{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99326706,0.00059784914,0.00026972248,0.000087761415,0.0011448286,0.00019449487,0.0000019957088,0.00032348445,0.0041128057],"genre_scores_gemma":[0.9996402,0.00005361522,0.00013464774,0.00004827446,0.000017973087,0.000032370423,0.000004588386,0.000040201343,0.000028091468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989978,0.00008280333,0.000223251,0.00018086251,0.00023160038,0.0002836782],"domain_scores_gemma":[0.99930114,0.00013339776,0.000039732236,0.000393178,0.000040026087,0.00009254552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017045112,0.00020412517,0.0002187019,0.00006794514,0.00039383315,0.00004441101,0.00034964774,0.00006069783,0.000014604306],"category_scores_gemma":[0.000007442959,0.00014135893,0.00008245046,0.00025497098,0.00017876027,0.00011215809,0.000037643647,0.00021961534,0.000056774497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008886541,0.00017776807,0.044589564,0.00015336106,0.00046272637,0.00016374399,0.00631331,0.004274168,0.015059368,0.9222725,0.0046423613,0.0018022464],"study_design_scores_gemma":[0.0036419223,0.0004678671,0.14401352,0.00036382576,0.00014075804,0.000895199,0.0012955355,0.0031519446,0.015749315,0.80866843,0.019841636,0.0017700229],"about_ca_topic_score_codex":0.000044149292,"about_ca_topic_score_gemma":0.000026287193,"teacher_disagreement_score":0.11360407,"about_ca_system_score_codex":0.00003284955,"about_ca_system_score_gemma":0.00001145942,"threshold_uncertainty_score":0.576445},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9870646,0.00024407801,0.0031618949,0.0028441998,0.0023604191,0.000098436416,0.0000019832341,0.00011844649,0.0041059316],"genre_scores_gemma":[0.9951908,0.0000064403644,0.0042909556,0.00014015024,0.000023635956,0.000015387206,0.0000026947134,0.000011107382,0.00031883028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977942,0.00008507938,0.00046205625,0.00037137498,0.0009417069,0.00034556453],"domain_scores_gemma":[0.9986082,0.00029292345,0.00015320313,0.0005326176,0.0002256607,0.000187404],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016608683,0.00012357946,0.00020466268,0.00018811492,0.00048867066,0.00034402544,0.0004879634,0.0000653782,0.00018626399],"category_scores_gemma":[0.0015315267,0.00010502419,0.00012476239,0.0007365701,0.000089543864,0.0003064869,0.000107661755,0.00019976593,0.0012414226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072936255,0.0001597844,0.006794923,0.000001181096,0.000023651475,0.000011445242,0.0007792139,0.0060812877,0.00018376012,0.9813485,0.0014275016,0.0031814417],"study_design_scores_gemma":[0.00080738193,0.0000568861,0.0067340285,0.00002616608,0.000013749028,0.000006644151,0.00047243387,0.00039739377,0.00093434984,0.9875402,0.0028732845,0.00013752129],"about_ca_topic_score_codex":0.00020045762,"about_ca_topic_score_gemma":0.000037025296,"teacher_disagreement_score":0.008126188,"about_ca_system_score_codex":0.00016510149,"about_ca_system_score_gemma":0.0001582433,"threshold_uncertainty_score":0.9995362},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81345755,0.00012764792,0.0030606918,0.0011007474,0.00027947983,0.00034394916,0.000045115885,0.00011522987,0.1814696],"genre_scores_gemma":[0.9975863,0.000004542094,0.00096968823,0.000059230424,0.000046633617,0.000037646965,0.00002377229,0.000016679609,0.0012555056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937636,0.000010389369,0.00014721409,0.00018486573,0.000082786864,0.00019837893],"domain_scores_gemma":[0.9994936,0.000074007185,0.000052632124,0.0002406605,0.00002710202,0.0001119729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059965554,0.000115896066,0.00014161869,0.000012501537,0.00014122334,0.000035498408,0.00010759466,0.000025724497,0.0003041393],"category_scores_gemma":[0.0000056261315,0.00011174679,0.000039904324,0.00009529472,0.000072376584,0.00012624076,0.00005588685,0.000104666804,0.0001747821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.5667017e-7,0.00007994562,0.001683202,0.000004543346,0.000016248398,2.1783826e-7,0.000196947,0.0000016687412,0.00008571788,0.9864541,0.0013516851,0.010124812],"study_design_scores_gemma":[0.00035209,0.000009549368,0.00024659134,0.000008400619,0.000014296103,0.0000016679311,0.0002356923,0.0000372179,0.0007760405,0.9493081,0.048865534,0.00014484751],"about_ca_topic_score_codex":0.000040619114,"about_ca_topic_score_gemma":0.0000015698041,"teacher_disagreement_score":0.18412876,"about_ca_system_score_codex":0.000015631374,"about_ca_system_score_gemma":0.000013164112,"threshold_uncertainty_score":0.45569018},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97101146,0.0006537526,0.0013841386,0.0025324987,0.0053941333,0.00016897346,6.028611e-7,0.0008212378,0.018033195],"genre_scores_gemma":[0.9952311,0.00006326295,0.0035359396,0.0007188992,0.0000011467466,0.000010877489,0.000001627779,0.000010993025,0.00042619015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867785,0.0000511589,0.00021684101,0.0003879867,0.00030365257,0.00036251833],"domain_scores_gemma":[0.9988567,0.000060259932,0.00006580659,0.0007516538,0.00011155469,0.00015402529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002850909,0.00014735048,0.00015485616,0.0001374099,0.0001806919,0.00012905883,0.00076805823,0.00007660804,0.000024392124],"category_scores_gemma":[0.00003631492,0.00013696121,0.00008519289,0.0008532804,0.000052951647,0.0003315057,0.00020100911,0.00015455915,0.0002992276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002303068,0.00008419118,0.0022387225,0.0000024229398,0.000009801592,0.000034956207,0.00010743873,0.000008860025,0.0003369793,0.98624426,0.006888857,0.0040412196],"study_design_scores_gemma":[0.0005418773,0.00008081677,0.00094169343,0.000012593084,0.0000038922985,0.0000285366,0.000006716145,0.0009413484,0.00065854297,0.9881988,0.0083999345,0.00018522251],"about_ca_topic_score_codex":0.000044912234,"about_ca_topic_score_gemma":0.0000023850755,"teacher_disagreement_score":0.024219595,"about_ca_system_score_codex":0.000016412325,"about_ca_system_score_gemma":0.000036682766,"threshold_uncertainty_score":0.5585116},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98753387,0.0004909389,0.000011324079,0.008972,0.00088813656,0.0001882161,0.0000018641314,0.000102734106,0.0018109356],"genre_scores_gemma":[0.99799347,0.000050261246,0.00113865,0.00044475298,0.000006369513,0.0000047781277,8.9102014e-7,0.000008621929,0.00035217634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984852,0.00008792412,0.0002909379,0.00044238602,0.00043855575,0.00025498055],"domain_scores_gemma":[0.99859774,0.00016457848,0.00014334072,0.0008748727,0.00009694689,0.00012251393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006978861,0.00015181782,0.00016816615,0.000074444964,0.00016333393,0.00010541656,0.0006028961,0.000060498725,0.000004544616],"category_scores_gemma":[0.00013302694,0.00010755171,0.000049992588,0.00043426,0.00010896415,0.00035482994,0.00015247375,0.00022550292,0.000038233164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011671667,0.000072305564,0.0012346111,0.0000042858924,0.000012536738,0.0000023272416,0.00049755815,0.000010987449,0.00039024284,0.98782855,0.0068668434,0.0030680595],"study_design_scores_gemma":[0.00078713085,0.00011250795,0.0035590902,0.000046951864,0.000006651357,0.000016235152,0.000012384354,0.00044086028,0.0065797446,0.98700887,0.0012714777,0.00015808664],"about_ca_topic_score_codex":0.00014196069,"about_ca_topic_score_gemma":0.0000071647687,"teacher_disagreement_score":0.010459648,"about_ca_system_score_codex":0.000014677658,"about_ca_system_score_gemma":0.000098382494,"threshold_uncertainty_score":0.43858314},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9656019,0.0005637456,0.008417203,0.0024809705,0.0023955372,0.00038010514,0.0000022271388,0.0007567447,0.019401543],"genre_scores_gemma":[0.98911417,0.000024621668,0.009968366,0.00020290482,0.000012929635,0.000029226601,0.0000011078872,0.000015636018,0.0006310368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838823,0.00010427031,0.00020625866,0.0004146377,0.0004008673,0.0004857209],"domain_scores_gemma":[0.99865603,0.0001905835,0.00005899515,0.0008051663,0.00011224609,0.00017700296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005107641,0.00014730652,0.00016088877,0.0001824053,0.00022191543,0.00014255763,0.0013782943,0.00006206305,0.00003351688],"category_scores_gemma":[0.000093974246,0.00015076516,0.00008054392,0.0008457607,0.00010175704,0.00077914726,0.00042043434,0.00026691495,0.0002616086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006301851,0.00007165256,0.001107171,0.000003926755,0.000009896198,0.000015160496,0.00016661896,0.00003003566,0.0008966056,0.9876436,0.0008148323,0.009234173],"study_design_scores_gemma":[0.0005656377,0.00008331996,0.0009871651,0.00001183874,0.00000200515,0.000010856165,0.000013803989,0.0026957362,0.007450546,0.97066396,0.017308742,0.0002063727],"about_ca_topic_score_codex":0.000011110319,"about_ca_topic_score_gemma":0.0000085838055,"teacher_disagreement_score":0.023512248,"about_ca_system_score_codex":0.00008013354,"about_ca_system_score_gemma":0.000048551163,"threshold_uncertainty_score":0.6148025},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920156,0.000011179818,0.003356883,0.00077793637,0.0005801419,0.0004535057,0.0000051414245,0.00010108952,0.0026985228],"genre_scores_gemma":[0.99199843,0.0000018325732,0.0077571706,0.000077604294,0.00000973476,0.00005417451,0.0000028641796,0.00003864843,0.00005955028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987756,0.00006488884,0.00035529348,0.00018452601,0.00039479972,0.00022491653],"domain_scores_gemma":[0.99797153,0.0009181528,0.00028108346,0.0005958092,0.00017978634,0.000053655473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000271221,0.00018164949,0.0002582018,0.00004988446,0.00025639054,0.00004536652,0.00022901237,0.00006905556,0.000033864002],"category_scores_gemma":[0.00086532056,0.00012262077,0.000065902444,0.00031513599,0.000154419,0.00015042158,0.00004200126,0.00020686939,0.00003335058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002767786,0.0003066282,0.000037282847,0.000034538363,0.000030776388,0.000003280075,0.00066437793,0.000097193995,0.00072532665,0.99772733,0.00031515013,0.000030443214],"study_design_scores_gemma":[0.0012466771,0.00027611537,0.000053327214,0.00020763879,0.00003602635,0.0000060743814,0.00015158257,0.000022785956,0.030986404,0.96681994,0.000050067178,0.00014336887],"about_ca_topic_score_codex":0.000006637509,"about_ca_topic_score_gemma":0.000005951522,"teacher_disagreement_score":0.030907393,"about_ca_system_score_codex":0.00010901892,"about_ca_system_score_gemma":0.00009158383,"threshold_uncertainty_score":0.50003296},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47848126,0.00008888432,0.507701,0.00038925145,0.0014686354,0.00025149653,0.000001944314,0.001513649,0.010103873],"genre_scores_gemma":[0.90793514,0.000009239629,0.091777064,0.00021272452,0.0000072079615,0.000004495483,0.000004035874,0.000009446901,0.000040637588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810445,0.00018187595,0.0004297498,0.00056824845,0.0002986831,0.00041700056],"domain_scores_gemma":[0.9977918,0.00069712364,0.00018920268,0.0009799543,0.00019395685,0.00014792313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028219107,0.00017374594,0.00021978946,0.00013062917,0.00022019459,0.00014558653,0.0008458199,0.00009086851,0.0000015250621],"category_scores_gemma":[0.000679542,0.00017864173,0.000077734505,0.000636103,0.00007265782,0.00039244743,0.00034285893,0.00022158898,0.000016913997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003507928,0.00018564146,0.005197952,0.000009477312,0.000015069531,0.00002386237,0.00059832406,0.00061046507,0.00015659528,0.9831507,0.0026436234,0.0073731984],"study_design_scores_gemma":[0.0016404074,0.00021574572,0.01588877,0.00004215911,0.000006149359,0.000015880394,0.000021179318,0.080288574,0.017443117,0.8830153,0.00093135727,0.0004913864],"about_ca_topic_score_codex":0.00033773953,"about_ca_topic_score_gemma":0.00002341701,"teacher_disagreement_score":0.42945388,"about_ca_system_score_codex":0.00012542156,"about_ca_system_score_gemma":0.00005883819,"threshold_uncertainty_score":0.7284798},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8618708,0.0005463003,0.115065865,0.0022315164,0.0040842784,0.00038713554,0.000013200925,0.00032215615,0.015478725],"genre_scores_gemma":[0.9904431,0.000010889153,0.009240357,0.000032343745,0.0000047578733,0.000005916742,0.0000016777018,0.0000040524656,0.0002569164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993364,0.000011009796,0.00017204383,0.00014162509,0.00016717537,0.00017172704],"domain_scores_gemma":[0.9990013,0.00016412332,0.00007641076,0.0006411078,0.00006853579,0.000048494127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005376376,0.000055169763,0.00006432358,0.00002495423,0.00015725166,0.000054913187,0.0009334622,0.000025379613,0.0000015702382],"category_scores_gemma":[0.00002847059,0.000040321705,0.0000304926,0.00030591566,0.000055757304,0.00012614328,0.0001788838,0.000071922586,0.000024489676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.7193813e-7,0.000038788756,0.0016933746,5.4907304e-7,0.00000333203,0.0000013912852,0.000080081874,2.4197715e-7,0.00013192791,0.9454814,0.0025177018,0.05005065],"study_design_scores_gemma":[0.0007633813,0.00016334666,0.26351887,0.0000218451,0.000013940783,0.000016583092,0.00018265139,0.0046303873,0.016419644,0.6484353,0.065512,0.00032204093],"about_ca_topic_score_codex":0.000037313413,"about_ca_topic_score_gemma":0.000015513815,"teacher_disagreement_score":0.29704607,"about_ca_system_score_codex":0.000013258177,"about_ca_system_score_gemma":0.000026805797,"threshold_uncertainty_score":0.17346205},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8727029,0.000109169356,0.000006702842,0.00005222837,0.0012605425,0.00012814776,0.0000033772167,0.000057796686,0.12567912],"genre_scores_gemma":[0.9987221,0.000023321072,0.00026354243,0.00008909875,0.000006784107,0.000007580781,5.217352e-7,0.000023168699,0.0008638873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990284,0.000054640474,0.00027152678,0.00017499151,0.00027207882,0.00019839371],"domain_scores_gemma":[0.99857616,0.00074875646,0.00013615428,0.00040595804,0.00007328538,0.000059702452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022781323,0.00014217893,0.00026131346,0.00020023274,0.00009239298,0.000010475919,0.00027224352,0.00009980841,0.00029160452],"category_scores_gemma":[0.00067478616,0.00011527462,0.000109995,0.00043445182,0.00008671311,0.000053744385,0.00008853709,0.00020380934,0.000032676006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001436442,0.00016109315,0.0004446862,0.000035127257,0.000037625385,0.0000045325855,0.00034802346,5.4698825e-7,0.000026698744,0.98767847,0.010474554,0.00077427464],"study_design_scores_gemma":[0.0005639456,0.00022750773,0.0004710921,0.000032225136,0.000022166796,0.0000034051943,0.00003214784,0.000043297303,0.0024739562,0.994616,0.001385432,0.00012885743],"about_ca_topic_score_codex":0.000004385832,"about_ca_topic_score_gemma":2.952877e-7,"teacher_disagreement_score":0.12601918,"about_ca_system_score_codex":0.000033466582,"about_ca_system_score_gemma":0.0000043612845,"threshold_uncertainty_score":0.47007626},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99305284,0.00014491675,0.00028316275,0.00044523584,0.0019123297,0.00007878965,2.987777e-7,0.00033464312,0.0037477715],"genre_scores_gemma":[0.99679935,0.000031242565,0.0021132028,0.0008421237,4.5108092e-7,0.000008571947,6.6448865e-7,0.000007442825,0.0001969465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881935,0.00004896232,0.00017171698,0.00035010412,0.00035505407,0.0002547886],"domain_scores_gemma":[0.9989409,0.00011624137,0.000060070182,0.00067056605,0.00008997828,0.00012226241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001963814,0.00012434178,0.00012904023,0.00013365624,0.0002619347,0.000038236485,0.00068075984,0.000055497017,0.000009226732],"category_scores_gemma":[0.000073569056,0.000112381145,0.0000639499,0.00058641855,0.00008027146,0.00023374616,0.00014230289,0.00015446752,0.0003383521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022743977,0.000076657074,0.0012811066,0.0000016706721,0.0000046447058,0.000048889982,0.00016788133,0.00002168248,0.00023111473,0.9896644,0.008147264,0.0003524585],"study_design_scores_gemma":[0.00038574132,0.00015138598,0.0026728744,0.000017152915,0.0000013859028,0.00003735071,0.0000018012897,0.0009388924,0.0017641273,0.99362105,0.00025971676,0.00014853891],"about_ca_topic_score_codex":0.000029613813,"about_ca_topic_score_gemma":6.220715e-7,"teacher_disagreement_score":0.007887548,"about_ca_system_score_codex":0.000016295726,"about_ca_system_score_gemma":0.00004953543,"threshold_uncertainty_score":0.45827702},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70217884,0.0010517305,0.27670416,0.0022988182,0.0053296755,0.00058463827,0.00002680371,0.0012273866,0.010597944],"genre_scores_gemma":[0.96033347,0.000026974914,0.039163966,0.00020648382,0.000029915322,0.000004602621,0.000011936361,0.000013258058,0.0002094255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986447,0.0000355231,0.00023042603,0.0004079823,0.00032054217,0.0003608101],"domain_scores_gemma":[0.99902374,0.000038553437,0.000096474265,0.00068527437,0.000052846302,0.000103123806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028863893,0.00016131753,0.00017498079,0.00013570918,0.00019294703,0.00026813088,0.0012640705,0.000044946093,0.0000083263585],"category_scores_gemma":[0.0000154956,0.00016269667,0.000069947055,0.00077288056,0.000047985093,0.0013200877,0.0004006232,0.00013329776,0.0000817145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.352785e-7,0.000044157212,0.0066974587,0.0000066211383,0.000024454508,0.000006467558,0.000077012686,0.000011799758,0.000022322887,0.9617941,0.0019120439,0.02940286],"study_design_scores_gemma":[0.000993599,0.000059245234,0.0047776997,0.000042482414,0.000032606284,0.0000018625145,0.000015371448,0.020350305,0.00059482985,0.9095722,0.063008115,0.0005517123],"about_ca_topic_score_codex":0.000029441084,"about_ca_topic_score_gemma":0.0000028792476,"teacher_disagreement_score":0.25815457,"about_ca_system_score_codex":0.000039464638,"about_ca_system_score_gemma":0.000018156543,"threshold_uncertainty_score":0.66345775},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96425277,0.00009692625,0.015038554,0.008168523,0.002964651,0.00042033257,0.000002697685,0.00029043583,0.008765092],"genre_scores_gemma":[0.99843645,0.000011799459,0.0010027788,0.00030169997,0.0000055638134,0.00003723013,7.701189e-7,0.000011545617,0.00019217662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982846,0.0002278097,0.00015777817,0.00035602372,0.00059143355,0.00038239305],"domain_scores_gemma":[0.9974469,0.0014824445,0.000031819065,0.0007710431,0.00015366398,0.00011416431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045273107,0.00013650101,0.0001284489,0.0001275037,0.00049079984,0.00006778914,0.00093459076,0.00006214865,0.000023975688],"category_scores_gemma":[0.0007965291,0.00010144058,0.000089502166,0.00069782353,0.0003182257,0.0003986812,0.00023411975,0.0003362521,0.0002458317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001681961,0.00010356002,0.000063600375,0.0000023485989,0.0000052114083,0.00004537791,0.00032578578,0.000007937201,0.0004965798,0.9960873,0.0012278293,0.0016176633],"study_design_scores_gemma":[0.000395476,0.00020016445,0.0038730882,0.000011742566,0.000001750853,0.0000514838,0.0000111982545,0.005155204,0.0032812178,0.9866476,0.00023467117,0.00013641796],"about_ca_topic_score_codex":0.0000044716585,"about_ca_topic_score_gemma":3.459603e-7,"teacher_disagreement_score":0.034183647,"about_ca_system_score_codex":0.000056182074,"about_ca_system_score_gemma":0.00006015643,"threshold_uncertainty_score":0.41366267},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81058216,0.00019790491,0.0001377741,0.0002321386,0.002448129,0.0001256767,0.00000827549,0.00007110899,0.18619682],"genre_scores_gemma":[0.9939454,0.000020679314,0.000035426317,0.00018268358,0.000023593799,0.000016004238,0.000005741772,0.00002135481,0.0057490934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905616,0.000031034426,0.00036369622,0.00028061998,0.000037768536,0.0002306916],"domain_scores_gemma":[0.9992251,0.00014408417,0.00019869398,0.0003432745,0.000022319637,0.000066549524],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007145553,0.0001228649,0.000252343,0.0001446762,0.000110372755,0.00005425078,0.00021082388,0.00008413826,0.0005124557],"category_scores_gemma":[0.00018853371,0.00014097599,0.00008041942,0.00021829053,0.000028947492,0.00012699637,0.000024755622,0.00012615105,0.0041691232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018845298,0.00009711932,0.0109177865,0.000006276893,0.000016492246,0.000007084206,0.00011656516,0.000011158416,0.0000067603487,0.98580647,0.0026523822,0.0003430432],"study_design_scores_gemma":[0.00087798,0.00011831739,0.00820166,0.000019832098,0.000002161757,0.00000762709,0.000031421456,0.00034589716,0.00005739733,0.94545656,0.04468631,0.00019485157],"about_ca_topic_score_codex":0.000047712856,"about_ca_topic_score_gemma":0.0000018094053,"teacher_disagreement_score":0.18336326,"about_ca_system_score_codex":0.00007741286,"about_ca_system_score_gemma":0.000005919204,"threshold_uncertainty_score":0.99660623},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9273403,0.0005067569,0.065578535,0.00009400106,0.0024272734,0.00014704918,0.0000031584357,0.00035500055,0.0035478869],"genre_scores_gemma":[0.9954594,0.00001349987,0.0036783789,0.00010769238,0.000025448082,0.0000062064983,0.000007413248,0.000022326323,0.0006796864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979876,0.00008059617,0.00030369512,0.00042929218,0.00052061747,0.00067818613],"domain_scores_gemma":[0.9987162,0.00031043074,0.000106119696,0.00052936014,0.00018472057,0.00015317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012723994,0.00017649848,0.00019090658,0.00022828742,0.0003273289,0.00029317176,0.0010920794,0.00008521285,0.00001954718],"category_scores_gemma":[0.00015982518,0.00018857606,0.00006327325,0.0009064162,0.00012655246,0.0008848404,0.00036224708,0.00028077952,0.00008865165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001668592,0.00005758411,0.002977883,0.0000057296643,0.0000197215,0.0000646016,0.00045684673,0.000029171506,0.018645598,0.96707934,0.0052175657,0.0054292954],"study_design_scores_gemma":[0.0016250986,0.00011496139,0.0034875562,0.00003072329,0.0000067705105,0.000026743855,0.00019084103,0.005422048,0.08132056,0.9024385,0.004755109,0.0005810615],"about_ca_topic_score_codex":0.000033441855,"about_ca_topic_score_gemma":0.000009270276,"teacher_disagreement_score":0.06811901,"about_ca_system_score_codex":0.00010925143,"about_ca_system_score_gemma":0.00005816409,"threshold_uncertainty_score":0.7689908},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930645,0.0007906433,0.001882775,0.0004447498,0.0005306607,0.00021485034,6.687508e-7,0.00015402025,0.0029171328],"genre_scores_gemma":[0.99781084,0.00043023596,0.0015583351,0.000108158056,0.000004577591,0.000019374373,0.0000013451834,0.000014118008,0.0000530284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983011,0.00017535113,0.00023459218,0.0004989144,0.00031116846,0.00047889497],"domain_scores_gemma":[0.9988178,0.0003548107,0.000058075853,0.00059294765,0.00006977058,0.00010660689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035099595,0.00016853494,0.00021838682,0.00019040285,0.00013071697,0.0001371023,0.00075916125,0.000074478696,0.000015145044],"category_scores_gemma":[0.00012643979,0.00016495955,0.000042336684,0.0011937196,0.0001505082,0.0010252796,0.000340842,0.00024753797,0.000027439442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035044504,0.00009423975,0.043982215,0.0000081855405,0.000010627141,0.0001853462,0.000572516,0.0000074203244,0.00040891353,0.94975334,0.000049519094,0.004892641],"study_design_scores_gemma":[0.0009753681,0.00008222952,0.09395741,0.000027967702,0.0000020212844,0.00002264608,0.00006133112,0.0007466039,0.0015023038,0.90196323,0.0004649309,0.000193975],"about_ca_topic_score_codex":0.000047976075,"about_ca_topic_score_gemma":0.00005246163,"teacher_disagreement_score":0.04997519,"about_ca_system_score_codex":0.00003759275,"about_ca_system_score_gemma":0.00002779187,"threshold_uncertainty_score":0.67268556},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92041326,0.000011460667,0.058431607,0.000051009196,0.0010098031,0.00023754028,0.0000059216627,0.00014116235,0.019698238],"genre_scores_gemma":[0.9957698,4.0300654e-7,0.002131975,0.0000354405,0.000014135689,0.000013200775,0.000011381308,0.000032071523,0.001991606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887174,0.00003083625,0.0002731,0.00022627228,0.00032827252,0.00026978098],"domain_scores_gemma":[0.9988687,0.0004288736,0.00013268249,0.00036240567,0.0001001153,0.00010720581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002769031,0.0001480224,0.00018335863,0.000075453085,0.00016934896,0.000031156967,0.00011482106,0.00006762576,0.00006518075],"category_scores_gemma":[0.000197198,0.00011563961,0.000053528303,0.00019905202,0.0000345368,0.00008109923,0.000028789891,0.00016172693,0.000071185736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003910138,0.00018009092,0.00044733065,0.000011314731,0.000030754167,0.000012663663,0.00009280964,0.000034918507,0.00022055703,0.9980601,0.00047994577,0.0003903965],"study_design_scores_gemma":[0.00089224917,0.00024237674,0.0005511382,0.00007892271,0.000020573014,0.000007654157,0.00017689574,0.00022587851,0.00030479525,0.996674,0.0006400361,0.00018548922],"about_ca_topic_score_codex":0.000028974442,"about_ca_topic_score_gemma":0.000037028807,"teacher_disagreement_score":0.07535653,"about_ca_system_score_codex":0.000096196396,"about_ca_system_score_gemma":0.0000143966045,"threshold_uncertainty_score":0.47156465},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97209275,0.00048171086,0.01978714,0.00036654924,0.00031236964,0.00025086023,0.00009951044,0.0004112942,0.006197811],"genre_scores_gemma":[0.9356445,0.000013087712,0.06418129,0.000062347965,0.0000018494486,0.000012825814,0.000008522856,0.000012623742,0.000062953266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987509,0.000023807239,0.00033470415,0.00028907615,0.00036342564,0.0002380693],"domain_scores_gemma":[0.9987679,0.00014407535,0.00024020573,0.00043035668,0.00033197895,0.00008547224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015177099,0.00015833657,0.000260791,0.000056958645,0.00009929264,0.00006705068,0.00058257347,0.000045311026,0.0000071540676],"category_scores_gemma":[0.00007779691,0.0001377328,0.00004227862,0.00054013723,0.00033349014,0.0004943635,0.00024977283,0.00010393205,0.0000024789972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023048646,0.00075360184,0.0059218295,0.000059113565,0.000054716005,0.00001839714,0.00027619587,0.00005043747,0.041125804,0.9490019,0.0018616864,0.00085323857],"study_design_scores_gemma":[0.0012347295,0.0002948468,0.00012045907,0.00030213068,0.000019486197,0.000029976236,0.000014267264,0.00013926844,0.37717265,0.6201415,0.00029326454,0.00023738675],"about_ca_topic_score_codex":0.00004529466,"about_ca_topic_score_gemma":0.00002037301,"teacher_disagreement_score":0.33604684,"about_ca_system_score_codex":0.000060444858,"about_ca_system_score_gemma":0.0001932701,"threshold_uncertainty_score":0.5616581},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98603916,0.000033350203,0.000075015974,0.000038912196,0.0009635266,0.000086583976,0.00000997484,0.000026283462,0.0127272075],"genre_scores_gemma":[0.9991536,0.000007987047,0.00033431605,0.000009408709,0.0000054519314,0.0000047943745,0.000004569247,0.000009314333,0.0004705403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926746,0.000027088676,0.0002783288,0.00010357114,0.00021595944,0.000107611355],"domain_scores_gemma":[0.9992116,0.00024079604,0.00020123947,0.00025161164,0.00006919938,0.0000255144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014109806,0.00008023315,0.00019387453,0.0000715983,0.000034835597,0.000002890236,0.0001208869,0.00005698241,0.0001658496],"category_scores_gemma":[0.00008158009,0.00007262272,0.00007111411,0.00020251426,0.00008143675,0.00003810529,0.000020927419,0.000070617585,0.00001863866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013401404,0.00028692634,0.011117414,0.000069013,0.00001758107,0.0000013098872,0.00010654939,0.0000024213186,0.001182539,0.9784897,0.008646285,0.00006688855],"study_design_scores_gemma":[0.0004519921,0.00015088341,0.009753237,0.00006157951,0.000036779922,9.4651097e-7,0.00003340032,0.000030266325,0.025034353,0.96365,0.00071306265,0.0000835238],"about_ca_topic_score_codex":0.0001579986,"about_ca_topic_score_gemma":0.000011903335,"teacher_disagreement_score":0.023851814,"about_ca_system_score_codex":0.000008807761,"about_ca_system_score_gemma":0.000021001555,"threshold_uncertainty_score":0.29614687},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92149603,0.000909018,0.00003282202,0.0002880953,0.0009606502,0.00014136467,0.00004848853,0.00008758809,0.07603592],"genre_scores_gemma":[0.9958388,0.00007807466,0.000031870826,0.00017958459,0.000027188258,0.000012736484,0.000009190496,0.00002872712,0.00379382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884474,0.00004647106,0.0003903423,0.00034664656,0.00003069205,0.0003410884],"domain_scores_gemma":[0.99935794,0.000063108004,0.00012552964,0.00032400189,0.000013568447,0.000115848314],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00082957005,0.00016051378,0.0003441786,0.000090173075,0.00023322081,0.00009389724,0.00017237362,0.00009919389,0.0019295276],"category_scores_gemma":[0.0000558712,0.00018140348,0.0000823117,0.00016627634,0.00004350905,0.00017565384,0.00004590469,0.00019264189,0.0014744713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008311527,0.00009960691,0.022711068,0.000019562727,0.000026469637,0.0000032351859,0.0009055942,0.000002844923,0.000009292894,0.9752041,0.0005542668,0.0004556195],"study_design_scores_gemma":[0.0010595002,0.00010003033,0.030880984,0.00003240584,0.0000067627752,0.00001744097,0.00012747303,0.00039455277,0.000036171954,0.9396022,0.027454471,0.00028801733],"about_ca_topic_score_codex":0.0001105515,"about_ca_topic_score_gemma":0.000005295414,"teacher_disagreement_score":0.07434275,"about_ca_system_score_codex":0.0000395466,"about_ca_system_score_gemma":0.000009036303,"threshold_uncertainty_score":0.999303},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917818,0.00030015167,0.0014794692,0.00031118045,0.00033290137,0.0002682659,0.0000017682561,0.00007644641,0.00544803],"genre_scores_gemma":[0.9948719,0.00015430248,0.0046191695,0.000106008214,0.0000030804754,0.000023357741,0.0000018597357,0.000021670141,0.00019863198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793035,0.00016893834,0.0003323209,0.00051430747,0.00053359533,0.00052046106],"domain_scores_gemma":[0.998134,0.0005996794,0.00012982133,0.00091619603,0.00012128745,0.00009899195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033294887,0.00020779856,0.0003185992,0.00022454637,0.00009597782,0.000048657064,0.0011277287,0.00007385091,0.000029123037],"category_scores_gemma":[0.00009740205,0.00017795096,0.00006175579,0.0015935154,0.0002852602,0.00086371857,0.0003812907,0.00021374803,0.000030897005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030287387,0.0003065082,0.12004179,0.000022658996,0.000042741474,0.00013848131,0.0011412238,0.00008334519,0.0015479146,0.8746493,0.00039722046,0.0013259809],"study_design_scores_gemma":[0.002134895,0.0004541145,0.036152836,0.00007590601,0.00000660297,0.000020355259,0.00013321642,0.0007348417,0.016053027,0.94272274,0.0011830112,0.00032847733],"about_ca_topic_score_codex":0.00006571662,"about_ca_topic_score_gemma":0.000100171615,"teacher_disagreement_score":0.08388895,"about_ca_system_score_codex":0.00007557562,"about_ca_system_score_gemma":0.00005137569,"threshold_uncertainty_score":0.72566295},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9789547,0.000033454668,0.000008328048,0.00043327984,0.0016367696,0.0003644748,0.000013121492,0.00004227642,0.018513592],"genre_scores_gemma":[0.9991573,0.0000107754395,0.00009504197,0.0002658792,0.000006682041,0.00001776528,0.0000011934144,0.000025939491,0.00041942456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985654,0.00020720574,0.00034386205,0.000206107,0.00039940534,0.00027802758],"domain_scores_gemma":[0.9979233,0.00068282225,0.0002491886,0.0010008626,0.000089265275,0.00005452998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007753474,0.0001891497,0.0002859537,0.00003863188,0.00042421388,0.000025685116,0.00053318636,0.000074486314,0.0001652223],"category_scores_gemma":[0.0008104802,0.00010761573,0.00020980884,0.00030851839,0.0002281707,0.000057812656,0.00011237947,0.0002651767,0.000026110078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008697379,0.00020980851,0.0010493868,0.00002496038,0.000040778617,8.9707265e-7,0.0003469708,6.8190974e-7,0.00028585293,0.98903316,0.00895099,0.00004784203],"study_design_scores_gemma":[0.00051214907,0.0000961564,0.0027113343,0.000043509892,0.000030652493,0.0000035702813,0.00010513288,0.0000090716985,0.0057867877,0.9873855,0.0031792119,0.00013692991],"about_ca_topic_score_codex":0.000041785086,"about_ca_topic_score_gemma":0.000013908736,"teacher_disagreement_score":0.020202596,"about_ca_system_score_codex":0.000037787275,"about_ca_system_score_gemma":0.000051137464,"threshold_uncertainty_score":0.43884417},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9767068,0.0028356698,0.0003736147,0.0007136737,0.005194069,0.00020990081,5.848898e-7,0.00018736934,0.013778296],"genre_scores_gemma":[0.9985511,0.00006937073,0.0010429118,0.00011203895,2.257182e-7,0.000007873762,2.879059e-7,0.0000066459725,0.00020955507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890196,0.00013477227,0.00024229562,0.00022242189,0.00025063485,0.00024793288],"domain_scores_gemma":[0.99871796,0.00018686325,0.00011161403,0.0007761233,0.0001318577,0.00007558226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007290734,0.000103036815,0.00012538534,0.00005793339,0.00021322197,0.000056698642,0.00065546867,0.000049869723,0.0000037990271],"category_scores_gemma":[0.000121376615,0.00007170326,0.00007658256,0.00052989594,0.00011702947,0.00011264763,0.00008620159,0.00012468577,0.000031265172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012589869,0.000050605417,0.0014428003,0.000003216758,0.000011475493,0.0000022089152,0.00010967458,0.0000065454683,0.00058381865,0.9941246,0.0031033128,0.000560506],"study_design_scores_gemma":[0.00033082365,0.000057088342,0.0006917678,0.0000063435505,0.0000046012233,0.00000555007,0.000020021329,0.00024376974,0.008874514,0.98618084,0.0034932576,0.000091441194],"about_ca_topic_score_codex":0.000029521447,"about_ca_topic_score_gemma":0.0000026616033,"teacher_disagreement_score":0.02184427,"about_ca_system_score_codex":0.000008177885,"about_ca_system_score_gemma":0.00007164004,"threshold_uncertainty_score":0.2923974},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99542797,0.000044274653,0.0010065151,0.00014209794,0.0004044757,0.000120426135,0.0000017446002,0.0000735835,0.0027789304],"genre_scores_gemma":[0.99884397,0.0000049043606,0.0010563068,0.000019635097,0.0000025632846,0.000011699585,0.0000024694941,0.0000068707363,0.000051582236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875015,0.00012334443,0.00017583385,0.0003615305,0.00029944643,0.00028972237],"domain_scores_gemma":[0.9991181,0.0003305681,0.00004069815,0.00037500833,0.00006381475,0.00007180323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038611775,0.000112490074,0.00013151058,0.00009934996,0.00009513475,0.00006676702,0.00035383427,0.000057139543,0.00004978859],"category_scores_gemma":[0.00006035092,0.000109084795,0.000035232086,0.00060453604,0.00012609677,0.0006053392,0.00018123098,0.00023124028,0.000018957671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003931611,0.000073267096,0.35656223,0.0000028603458,0.0000017136542,0.000004562891,0.000043446795,0.0000036136455,0.00019281596,0.64290154,0.00007377871,0.00013626265],"study_design_scores_gemma":[0.00028963274,0.000014866495,0.2839757,0.0000028902268,4.658184e-7,0.000002850845,0.000012992073,0.00024776315,0.0013906409,0.7137554,0.00022089863,0.000085876105],"about_ca_topic_score_codex":0.0001720387,"about_ca_topic_score_gemma":0.00003623064,"teacher_disagreement_score":0.07258654,"about_ca_system_score_codex":0.000060067847,"about_ca_system_score_gemma":0.000036404464,"threshold_uncertainty_score":0.4448349},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99696517,0.00006705835,0.000014864712,0.000025043852,0.00018341852,0.00020215174,0.0000017547184,0.00004469616,0.002495851],"genre_scores_gemma":[0.99964714,0.0000041031344,0.00021374426,0.000008395003,0.0000016428163,0.000011422596,0.0000012667839,0.000013909909,0.00009837708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991873,0.000034439072,0.00031341272,0.00013194203,0.00013831788,0.00019459374],"domain_scores_gemma":[0.99935716,0.00017663684,0.00009703826,0.0002748896,0.00004883918,0.000045435987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049318955,0.000104806175,0.00018450685,0.00014245613,0.00004639387,0.0000061882747,0.00017598711,0.00006909521,0.00002211099],"category_scores_gemma":[0.00012806772,0.00008755636,0.0000672276,0.0003714947,0.00009593651,0.000068642556,0.000032808675,0.00011366697,0.0000051528236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015504407,0.00026061156,0.02255195,0.000039222086,0.0000103336,0.000001327944,0.00087967695,1.7015175e-7,0.012744064,0.96332043,0.00008815853,0.00008851898],"study_design_scores_gemma":[0.00029123048,0.00002486611,0.010792334,0.000040359264,0.000008679125,8.122057e-7,0.00043953373,0.000002297652,0.09849396,0.8897202,0.00009532474,0.0000904033],"about_ca_topic_score_codex":0.00002721797,"about_ca_topic_score_gemma":0.00003139001,"teacher_disagreement_score":0.085749894,"about_ca_system_score_codex":0.00001649803,"about_ca_system_score_gemma":0.000014447055,"threshold_uncertainty_score":0.35704446},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954198,0.000083125844,0.00029114453,0.0009880427,0.0008869361,0.00012729928,4.4349835e-7,0.000104569735,0.0020986348],"genre_scores_gemma":[0.9988264,0.000014947337,0.0006356236,0.00044695268,4.2030712e-7,0.0000093447525,3.131876e-7,0.0000066446805,0.000059372444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998928,0.00007872048,0.0002273743,0.00021075325,0.00036787632,0.00018728629],"domain_scores_gemma":[0.99873644,0.00025141877,0.00011478941,0.00075260625,0.00008721589,0.000057548506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029206532,0.00011020285,0.00015287739,0.00010298239,0.00018756959,0.00001985533,0.0007003304,0.00004945021,0.000007704365],"category_scores_gemma":[0.000080397185,0.00007335651,0.000081960374,0.0006131571,0.00012992694,0.000098512064,0.000121022844,0.00014153928,0.000057208777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024401734,0.000096472715,0.0012400034,0.000005319207,0.000009912183,0.000007928624,0.00048446376,0.000024138217,0.0005037897,0.9947582,0.0026018156,0.00026555546],"study_design_scores_gemma":[0.00038899665,0.00013894019,0.0049189623,0.000036665017,0.000003015041,0.000013803545,0.000006419082,0.004223487,0.0037524474,0.98630726,0.00011167117,0.000098335615],"about_ca_topic_score_codex":0.000036963418,"about_ca_topic_score_gemma":7.566255e-7,"teacher_disagreement_score":0.008450904,"about_ca_system_score_codex":0.000009882068,"about_ca_system_score_gemma":0.000051630745,"threshold_uncertainty_score":0.29913917},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91970587,0.000034878736,0.000043350974,0.0002486002,0.00010435959,0.0003189106,0.000017043008,0.00008081577,0.07944619],"genre_scores_gemma":[0.9914619,0.0000144069945,0.0053568487,0.00003956855,0.000006846142,0.00004119717,0.000004530506,0.000022326134,0.0030524002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914813,0.000025376165,0.00033065258,0.00014505265,0.00019872142,0.00015208717],"domain_scores_gemma":[0.99899423,0.0002513202,0.000111252775,0.0005194924,0.0000692973,0.000054395507],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019911802,0.00010820033,0.0002231303,0.000035365858,0.00006109932,0.000013521076,0.00022117798,0.00006811712,0.00093994004],"category_scores_gemma":[0.00010932358,0.000095475734,0.00007306112,0.00020516885,0.000046433495,0.00003177225,0.00002430373,0.00009395441,0.00011789492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007054464,0.00027408454,0.000039654,0.000065224565,0.000021783977,0.0000010031654,0.0004572294,8.538637e-7,0.0005524886,0.9437019,0.053925898,0.00095281645],"study_design_scores_gemma":[0.0004696973,0.00003573041,0.00013010684,0.00003658465,0.00002594954,0.000003877405,0.000033318316,0.00014125038,0.002983566,0.9763683,0.019664211,0.00010738274],"about_ca_topic_score_codex":0.000012832044,"about_ca_topic_score_gemma":0.0000024091062,"teacher_disagreement_score":0.07639379,"about_ca_system_score_codex":0.000014882876,"about_ca_system_score_gemma":0.000026158315,"threshold_uncertainty_score":0.99997336},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906158,0.00083544565,0.003932945,0.0008673324,0.0022332054,0.00012617545,0.0000010560228,0.00026559882,0.0011224344],"genre_scores_gemma":[0.98166835,0.000037383114,0.018031133,0.00015360313,8.049761e-7,0.0000035627327,0.0000012096805,0.000008968874,0.00009497168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883425,0.00002813703,0.00028001846,0.0002997375,0.00030208717,0.00025578146],"domain_scores_gemma":[0.998958,0.000039221733,0.00011804391,0.00061823,0.000106725034,0.00015976423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020155023,0.00013340352,0.00019222536,0.00016350676,0.00007937452,0.000049628132,0.0006319474,0.00006485409,0.0000064520846],"category_scores_gemma":[0.00003281149,0.00012287538,0.00009917598,0.00079021114,0.000055799017,0.0002610915,0.00015633796,0.0001058343,0.000064031425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002285576,0.00007216349,0.0009875388,0.000007050926,0.000013585511,0.000005202421,0.00026232205,0.00013656549,0.002958787,0.9924838,0.0013960873,0.0016746141],"study_design_scores_gemma":[0.0009459449,0.00012638427,0.0015880261,0.000041922893,0.0000062192194,0.0000048357138,0.000008712512,0.00009386242,0.020463238,0.97613543,0.00044548282,0.00013996355],"about_ca_topic_score_codex":0.0002717356,"about_ca_topic_score_gemma":0.00000580797,"teacher_disagreement_score":0.01750445,"about_ca_system_score_codex":0.00001485863,"about_ca_system_score_gemma":0.000121364195,"threshold_uncertainty_score":0.5010713},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99005765,0.000122002304,0.00026550598,0.000056116507,0.00040707106,0.00030977812,0.000010820594,0.000063778665,0.008707278],"genre_scores_gemma":[0.9993518,0.0000043064147,0.00024701707,0.00001969652,0.000005340858,0.00004423547,0.0000037238876,0.000019387837,0.00030450063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924433,0.000039051065,0.00028061602,0.00014120842,0.00014489889,0.00014992076],"domain_scores_gemma":[0.99916786,0.0001433165,0.000143413,0.00038388663,0.0001060924,0.000055448392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002632685,0.00010653735,0.0002255801,0.00006820613,0.00008270346,0.0000141092205,0.00019061226,0.000082611296,0.00011714029],"category_scores_gemma":[0.00007182527,0.00010000235,0.000058106973,0.00030399775,0.00006133491,0.000061494444,0.000033131517,0.00011313712,0.00003958391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102948125,0.00019211014,0.00026654205,0.00010073098,0.000034961773,0.0000011938338,0.0002727848,0.000016386713,0.0006719081,0.99788994,0.0005195234,0.00002361464],"study_design_scores_gemma":[0.0015295781,0.000038686445,0.00031523505,0.000043465872,0.000024510262,0.0000057402117,0.00012332287,0.000009602169,0.0032270432,0.9935999,0.0009775877,0.00010535735],"about_ca_topic_score_codex":0.000014085825,"about_ca_topic_score_gemma":0.000005261245,"teacher_disagreement_score":0.009294143,"about_ca_system_score_codex":0.000024617857,"about_ca_system_score_gemma":0.000044183977,"threshold_uncertainty_score":0.40779772},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98165977,0.000111779635,0.0068523814,0.000259978,0.0004425141,0.00021899531,0.0000016202896,0.00014297228,0.01030999],"genre_scores_gemma":[0.9935298,0.00002732226,0.0060984083,0.000045910074,0.0000014915942,0.0000125787765,0.0000011238025,0.000007300068,0.00027607032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989709,0.00008945733,0.00017382656,0.00022930886,0.00031489984,0.00022155409],"domain_scores_gemma":[0.9991193,0.00012392149,0.000048749956,0.0005419754,0.000096065996,0.00007003485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027463978,0.00008280668,0.00012279821,0.00012180741,0.00006727928,0.000026643556,0.0007108888,0.000039793442,0.00008379781],"category_scores_gemma":[0.000039054954,0.00008251153,0.00005928933,0.00079917273,0.00008346075,0.00040126476,0.00006968921,0.00011272711,0.00010476937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012206916,0.00005615539,0.00040894293,0.0000059257227,0.000005381618,0.000004613602,0.00027622658,0.00003332833,0.001074581,0.94459826,0.00010372794,0.05342068],"study_design_scores_gemma":[0.00042649967,0.000105804575,0.0024772305,0.000010480013,0.000001533288,0.000003252162,0.0000048965053,0.0019442685,0.007676759,0.9865501,0.0007103972,0.00008880004],"about_ca_topic_score_codex":0.000010966251,"about_ca_topic_score_gemma":0.000001064966,"teacher_disagreement_score":0.05333188,"about_ca_system_score_codex":0.000018515744,"about_ca_system_score_gemma":0.000036211673,"threshold_uncertainty_score":0.33647224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99512905,0.00012157343,0.000116668074,0.001171487,0.0015895205,0.00014436663,0.0000011037716,0.000037512396,0.0016887031],"genre_scores_gemma":[0.99957085,0.000012163096,0.00012222976,0.00017776918,6.2997617e-7,0.000007840288,2.056306e-7,0.0000056325825,0.000102665894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988774,0.00011556516,0.000246199,0.00019976072,0.000380908,0.00018017624],"domain_scores_gemma":[0.9984812,0.00024380462,0.00016416809,0.00094174856,0.0001313263,0.000037764425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039368024,0.00010767413,0.00015257641,0.00007568328,0.00013176302,0.000022655118,0.00095958513,0.00004703537,0.000008738473],"category_scores_gemma":[0.00007637562,0.000058425474,0.00015037491,0.0011178108,0.00015940145,0.00007999949,0.00020450783,0.00013535992,0.000005861343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006050439,0.00012676463,0.00093921897,0.00000491791,0.000016041256,0.0000012408901,0.00025238088,0.00010380993,0.0014493287,0.9955842,0.0012365757,0.00027948542],"study_design_scores_gemma":[0.00034714103,0.00011060545,0.004360533,0.000049136404,0.000006689264,0.000007220985,0.00002337346,0.00044621894,0.009454727,0.98507303,0.000045951456,0.000075402815],"about_ca_topic_score_codex":0.00006433836,"about_ca_topic_score_gemma":0.0000016679339,"teacher_disagreement_score":0.010511185,"about_ca_system_score_codex":0.000005649254,"about_ca_system_score_gemma":0.00003438483,"threshold_uncertainty_score":0.23825218},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942659,0.0005915707,0.0014460953,0.0020231067,0.00033883355,0.00018268214,0.0000015176456,0.00013290462,0.0010173753],"genre_scores_gemma":[0.9905621,0.000053344396,0.008997899,0.00028379634,0.0000045477095,0.000016529297,9.832338e-7,0.0000111668605,0.000069639245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987358,0.0000966522,0.00017348425,0.0003731152,0.00024207043,0.00037891013],"domain_scores_gemma":[0.99920785,0.00014625801,0.000041252904,0.0004440385,0.000035908077,0.00012466783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004167863,0.00013582602,0.00016454265,0.0002184825,0.00008979277,0.000102509235,0.0005848912,0.00006685038,0.0000147505025],"category_scores_gemma":[0.000048297425,0.00012982036,0.000034339533,0.00067302026,0.00009912612,0.0006310512,0.0002784864,0.0002902156,0.000041832707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071589893,0.00004543487,0.004922534,0.000006604705,0.0000051113075,0.00001911929,0.00069908175,0.00004307436,0.0004930201,0.9799404,0.00023456785,0.013583871],"study_design_scores_gemma":[0.00076026877,0.000058949878,0.00379847,0.000017662573,0.0000011088522,0.000017787992,0.00001449996,0.009841551,0.0023449792,0.98043627,0.0025439395,0.0001645418],"about_ca_topic_score_codex":0.000013342734,"about_ca_topic_score_gemma":0.000023816214,"teacher_disagreement_score":0.013419329,"about_ca_system_score_codex":0.000036241876,"about_ca_system_score_gemma":0.000027952043,"threshold_uncertainty_score":0.52939206},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.977966,0.000035909048,0.003686382,0.0016640621,0.00018853649,0.0005350915,0.0000074781374,0.00022333553,0.01569319],"genre_scores_gemma":[0.965489,0.0000066897246,0.033783197,0.00007184992,0.000010858119,0.0000929584,0.0000038496805,0.000037969698,0.00050363666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991424,0.00001398161,0.00024683736,0.00019075663,0.00020528157,0.00020072062],"domain_scores_gemma":[0.9990957,0.0001233526,0.0001229845,0.00049052085,0.00008083006,0.000086606415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016814792,0.00014370744,0.00023374958,0.00004893127,0.00010191122,0.000050074275,0.00022354303,0.00005572937,0.000115102404],"category_scores_gemma":[0.000093988805,0.000118850716,0.000052365645,0.0001914872,0.000057771504,0.0000750111,0.00005979118,0.000120999735,0.00014127801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007873682,0.00031013385,0.000027294685,0.00006195098,0.00003734339,0.000003969714,0.0004613603,6.739134e-7,0.00070588995,0.9955765,0.0026694392,0.00013755677],"study_design_scores_gemma":[0.0011483525,0.00010863887,0.00004629918,0.00014221441,0.000039547,0.000012341129,0.00014021789,0.000009955035,0.006692524,0.9901991,0.0012913117,0.00016953424],"about_ca_topic_score_codex":0.000014524963,"about_ca_topic_score_gemma":0.000018225921,"teacher_disagreement_score":0.030096814,"about_ca_system_score_codex":0.00005951917,"about_ca_system_score_gemma":0.000047995574,"threshold_uncertainty_score":0.48465914},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9683016,0.000048886843,0.000029172672,0.0011820557,0.0005364267,0.00008174787,5.676817e-7,0.00008682276,0.029732704],"genre_scores_gemma":[0.99833745,0.00001451007,0.00055945007,0.00059607683,3.9655083e-7,0.0000072288935,3.5897884e-7,0.000005460682,0.00047908045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915415,0.00006905632,0.00016317406,0.00019848303,0.00024811324,0.00016703215],"domain_scores_gemma":[0.99903256,0.000174227,0.000048300153,0.0006406401,0.000055772212,0.000048530208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028092123,0.0000891257,0.00010682002,0.00003280822,0.00009723905,0.00003637773,0.00061085954,0.000039074275,0.00021846396],"category_scores_gemma":[0.000023832476,0.00005892333,0.00007110573,0.00041988146,0.00006370146,0.00008253819,0.000050354007,0.00010937537,0.00036219167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003470217,0.000089463654,0.00026366362,0.0000019702848,0.0000091510765,0.0000022331703,0.00015575372,0.000019020945,0.000078429744,0.99209815,0.005585665,0.0016930319],"study_design_scores_gemma":[0.00027197157,0.000056296074,0.00037206704,0.000020684993,0.0000027285532,0.000004612219,0.0000035355843,0.0005993209,0.0011316694,0.9968737,0.00058876444,0.000074679105],"about_ca_topic_score_codex":0.000055463937,"about_ca_topic_score_gemma":8.119863e-7,"teacher_disagreement_score":0.030035824,"about_ca_system_score_codex":0.000005214554,"about_ca_system_score_gemma":0.00001951445,"threshold_uncertainty_score":0.4655362},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6815801,0.00027819388,0.30711326,0.0015221443,0.0012624701,0.0002948888,0.00008541158,0.00028553474,0.0075780046],"genre_scores_gemma":[0.9873067,0.0000068526756,0.012481667,0.00006720575,0.0000028904942,0.0000073049314,0.000033458415,0.0000055210567,0.00008836312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919444,0.000013595467,0.0002069963,0.0002152257,0.0001800589,0.0001896795],"domain_scores_gemma":[0.9992001,0.000071660485,0.00010056189,0.00050565734,0.000054120588,0.000067894165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046263728,0.00006882613,0.00009161996,0.000046410772,0.000072226445,0.000032537268,0.00059722713,0.00004785029,0.000005753672],"category_scores_gemma":[0.000019510213,0.000070049246,0.000027768676,0.00037633275,0.000026798762,0.00022793241,0.00007745656,0.00007414257,0.000029519419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.3567037e-7,0.00017030037,0.00058712857,0.0000036546087,0.000005152413,6.6957523e-7,0.00017134873,6.905149e-8,0.00395557,0.9547423,0.015777448,0.024585629],"study_design_scores_gemma":[0.0028045338,0.00031675023,0.19291157,0.000055960103,0.000027663104,0.000018206196,0.00032513772,0.052808408,0.069199696,0.4738383,0.20686543,0.00082834775],"about_ca_topic_score_codex":0.000011846757,"about_ca_topic_score_gemma":0.0000015346499,"teacher_disagreement_score":0.48090398,"about_ca_system_score_codex":0.000022490856,"about_ca_system_score_gemma":0.000024272578,"threshold_uncertainty_score":0.28565255},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99314135,0.0007030438,0.00047785093,0.001693129,0.001023361,0.00009920052,9.2609804e-7,0.00025821518,0.0026029192],"genre_scores_gemma":[0.9789584,0.00002748628,0.020515157,0.00031557184,0.000001514968,0.00000494213,9.318858e-7,0.000009336802,0.00016661039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988143,0.00003835416,0.00030657247,0.0002903489,0.00029641553,0.00025401218],"domain_scores_gemma":[0.9989318,0.00006701768,0.00012799274,0.0006091627,0.00016034795,0.00010363193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035997236,0.00012244032,0.00018436981,0.00012429178,0.00007843453,0.000044078082,0.00067626935,0.00006862908,0.000013729196],"category_scores_gemma":[0.000044860513,0.00011567553,0.00007871798,0.0005062992,0.00006460911,0.00029510862,0.00018829592,0.000122062156,0.000117331816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020130744,0.00012809689,0.0010664762,0.0000074104155,0.000011541821,0.0000019738811,0.00024373668,0.000064128966,0.002897597,0.98496854,0.0024982211,0.008110261],"study_design_scores_gemma":[0.0008490995,0.0000964222,0.0007896021,0.000034791316,0.000008007422,0.000008621667,0.000010214005,0.0069215535,0.023148458,0.9645121,0.0034184798,0.00020262292],"about_ca_topic_score_codex":0.00003290396,"about_ca_topic_score_gemma":0.000001972972,"teacher_disagreement_score":0.020456417,"about_ca_system_score_codex":0.000016376269,"about_ca_system_score_gemma":0.000042161468,"threshold_uncertainty_score":0.47171113},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9968439,0.0000693525,0.00021188121,0.0004848429,0.0013230799,0.000116766816,0.0000014096355,0.0001289289,0.0008198879],"genre_scores_gemma":[0.99818826,0.000014787234,0.0014303552,0.00030929863,0.0000014858593,0.000007872343,0.000001744928,0.0000078779785,0.000038329385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889064,0.00008675624,0.0002096733,0.00027094551,0.00032981552,0.000212185],"domain_scores_gemma":[0.9988129,0.00012106238,0.000099699224,0.00078840717,0.00009644542,0.000081460414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002891731,0.00011767708,0.00014951338,0.00009828504,0.00027005412,0.000028163993,0.0007787355,0.00005306619,0.0000025992329],"category_scores_gemma":[0.000030037198,0.000083693,0.00006898434,0.0004450943,0.000095936004,0.00018875966,0.00010268276,0.00015014739,0.000025203852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009188017,0.00014006774,0.0011684472,0.0000053521044,0.000009461824,0.000023465356,0.0011112309,0.0001909085,0.00051364227,0.99501526,0.00093395734,0.0008790366],"study_design_scores_gemma":[0.0009209101,0.00078814983,0.0071858717,0.000042571624,0.0000076107845,0.000037138056,0.000034609104,0.0052282275,0.012073892,0.972608,0.0008407729,0.00023226788],"about_ca_topic_score_codex":0.000071563394,"about_ca_topic_score_gemma":0.0000035817798,"teacher_disagreement_score":0.022407264,"about_ca_system_score_codex":0.00001170279,"about_ca_system_score_gemma":0.000037760434,"threshold_uncertainty_score":0.34129015},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9864815,0.0007881421,0.0055927634,0.0014380105,0.0029572863,0.0001404352,7.635767e-7,0.00031691886,0.002284199],"genre_scores_gemma":[0.975438,0.000026491325,0.024275905,0.00014688629,6.606446e-7,0.0000024869369,8.5347193e-7,0.000007829733,0.00010088699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998941,0.000025049367,0.00024734385,0.00027496193,0.000286273,0.0002253646],"domain_scores_gemma":[0.99901736,0.000044927183,0.00010926152,0.0005765358,0.000110451096,0.00014148605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001746483,0.00012010262,0.00017655513,0.00014032079,0.00007018467,0.000047030397,0.0006302489,0.000063928215,0.000007133135],"category_scores_gemma":[0.000037177382,0.00011069919,0.00008926189,0.00072052,0.00004690483,0.00025670335,0.00014314966,0.000107207925,0.000045979235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019590418,0.00007352175,0.0008895206,0.0000066992097,0.000012145511,0.00000507784,0.00017142696,0.0000686003,0.0016038382,0.994186,0.001464324,0.0015168856],"study_design_scores_gemma":[0.0009444133,0.0001350585,0.0011825754,0.00003309006,0.0000055091214,0.0000049880473,0.000007640668,0.000048748654,0.017516362,0.97956973,0.00042722202,0.00012467566],"about_ca_topic_score_codex":0.00020843279,"about_ca_topic_score_gemma":0.0000048398733,"teacher_disagreement_score":0.018683141,"about_ca_system_score_codex":0.000015920426,"about_ca_system_score_gemma":0.0001547241,"threshold_uncertainty_score":0.45141822},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9815055,0.0008788564,0.005994703,0.0012883942,0.0014202961,0.00011644601,0.000001182288,0.0003649441,0.008429679],"genre_scores_gemma":[0.9959973,0.000058712732,0.0031500298,0.00034619562,0.000012931353,0.0000069968005,0.0000035667413,0.00001097224,0.00041328152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879384,0.00006956957,0.00018553353,0.00034697397,0.00022320416,0.00038086248],"domain_scores_gemma":[0.9991404,0.00014416652,0.00006810996,0.00042805503,0.0000585161,0.00016074209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003937905,0.00015552517,0.00015883992,0.000084277046,0.00023397464,0.000187319,0.000522299,0.000083371124,0.000024330375],"category_scores_gemma":[0.000037094364,0.00015427246,0.000037681486,0.00037434316,0.000045361852,0.0004942223,0.00018110346,0.00020061497,0.000086694614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013460007,0.00006806619,0.06823263,0.00001706038,0.000019250423,0.00015025056,0.0011460329,0.000027042419,0.00014214584,0.9052108,0.004455627,0.020517658],"study_design_scores_gemma":[0.004206011,0.0008179071,0.07699284,0.00018807278,0.00004084869,0.00058672664,0.00013896199,0.058328617,0.0028403592,0.76293594,0.09116135,0.0017623795],"about_ca_topic_score_codex":0.00007321972,"about_ca_topic_score_gemma":0.0000057990464,"teacher_disagreement_score":0.14227484,"about_ca_system_score_codex":0.000023612669,"about_ca_system_score_gemma":0.0000473097,"threshold_uncertainty_score":0.62910485},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9630356,0.00004961119,0.030656965,0.001637661,0.0011059702,0.0010235171,0.000025952251,0.000313778,0.0021509698],"genre_scores_gemma":[0.9891612,0.000008093928,0.0086358,0.0007702963,0.0000054016673,0.00024916415,0.000016753529,0.000020999674,0.0011322772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981605,0.000086252876,0.0002281082,0.00054729584,0.00041767358,0.00056019],"domain_scores_gemma":[0.99851793,0.00021152035,0.000041231036,0.0007635998,0.00021203244,0.00025370825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043828247,0.00016603031,0.00018119876,0.00022928276,0.00028408994,0.00009872483,0.0008780496,0.00006159368,0.00009427169],"category_scores_gemma":[0.00009908862,0.00016927153,0.00010313784,0.0012291374,0.00007884967,0.00035187684,0.00012703051,0.00013461542,0.00016132333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049783066,0.00017082162,0.00007844537,0.0000070189185,0.0000122676665,0.000007413737,0.0005584126,0.00013083463,0.0007538462,0.989889,0.003221532,0.0051205866],"study_design_scores_gemma":[0.0013301251,0.00070255785,0.000990008,0.000018885454,0.000004978219,0.000008098845,0.000045327815,0.004060689,0.004694948,0.92405206,0.06379308,0.000299269],"about_ca_topic_score_codex":0.000007823569,"about_ca_topic_score_gemma":0.0000041077096,"teacher_disagreement_score":0.065837,"about_ca_system_score_codex":0.000080278165,"about_ca_system_score_gemma":0.000059987557,"threshold_uncertainty_score":0.6902693},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98627836,0.00026867504,0.00012284315,0.005718283,0.003186949,0.00018636095,9.814871e-7,0.000096791446,0.0041407784],"genre_scores_gemma":[0.99887216,0.0000074428176,0.00009657853,0.00071822794,7.0193556e-7,0.000012563201,1.0919015e-7,0.000006614637,0.00028561012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988753,0.0001365699,0.00018925869,0.00022444701,0.00037568458,0.00019870054],"domain_scores_gemma":[0.99834746,0.00027709472,0.00011614177,0.0011260123,0.00008952064,0.00004377863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035752027,0.000111925394,0.00011662866,0.000053268555,0.00025270542,0.000053608936,0.0013315339,0.000046881873,0.00003091125],"category_scores_gemma":[0.000105144565,0.0000584902,0.000110421934,0.00080250844,0.00012433568,0.000090864625,0.00022171326,0.00018422642,0.00006358446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.230403e-7,0.00009568274,0.00023527548,0.0000032640908,0.000009132802,9.594995e-7,0.0002632499,0.000031552663,0.00017255268,0.9876428,0.010844822,0.000699775],"study_design_scores_gemma":[0.00026054587,0.000057693032,0.00050127483,0.000027899798,0.0000046251675,0.0000026784746,0.000010742582,0.0024876741,0.0057425355,0.99046785,0.00035207908,0.00008441293],"about_ca_topic_score_codex":0.00002369571,"about_ca_topic_score_gemma":0.0000011456999,"teacher_disagreement_score":0.012593814,"about_ca_system_score_codex":0.000008384674,"about_ca_system_score_gemma":0.000009655089,"threshold_uncertainty_score":0.24743435},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907554,0.00018579431,0.005336905,0.00033777367,0.0010133297,0.00018459558,0.0000035203668,0.000103796345,0.0020789192],"genre_scores_gemma":[0.99899846,0.0000054138677,0.0005165064,0.00034460519,0.0000031292177,0.0000073067795,0.0000015314024,0.000009010827,0.00011405956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989433,0.000052851934,0.00026234146,0.00023317769,0.00028633897,0.0002219343],"domain_scores_gemma":[0.9984292,0.000312658,0.00016921594,0.0009836747,0.0000460843,0.00005920173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057940633,0.000113346665,0.00013563083,0.000038906037,0.00009963902,0.00003906101,0.0011819154,0.00005702013,0.000012346194],"category_scores_gemma":[0.00007333867,0.000081390965,0.00007118298,0.00036468267,0.000057533794,0.00014733305,0.00019667101,0.00010650233,0.000052265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022228905,0.000120126184,0.00056805986,0.000008407527,0.000008995226,0.000001282191,0.00023511548,0.0000030043102,0.003314532,0.98331565,0.0062349574,0.006187621],"study_design_scores_gemma":[0.00039614577,0.000081241,0.023988416,0.00004218125,0.000005168704,0.0000051146485,0.00002478117,0.0031541416,0.039064694,0.93268526,0.00041266275,0.0001401802],"about_ca_topic_score_codex":0.000019432851,"about_ca_topic_score_gemma":5.2330074e-7,"teacher_disagreement_score":0.0506304,"about_ca_system_score_codex":0.000042911084,"about_ca_system_score_gemma":0.0000287156,"threshold_uncertainty_score":0.33190274},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7374475,0.0001281808,0.23846593,0.0009723602,0.0020438207,0.00046232354,0.0000021740973,0.0008498287,0.019627875],"genre_scores_gemma":[0.7625278,0.000029730956,0.23718357,0.00013865926,0.00000839479,0.000028345668,0.000002551915,0.000016615893,0.00006432867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809504,0.00016139817,0.00030770616,0.00052250974,0.00044917766,0.00046414512],"domain_scores_gemma":[0.998455,0.00011594359,0.00014363721,0.00094116287,0.00015870831,0.00018556361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061179936,0.00023753395,0.00023919276,0.00018881871,0.00017901052,0.00016764464,0.0012525272,0.0001268093,0.000033886117],"category_scores_gemma":[0.00007853465,0.00020685834,0.00008160315,0.0011083853,0.00040422185,0.0006619864,0.00012286041,0.00027610725,0.00006722767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027895261,0.00017459654,0.0012769755,0.000005815927,0.000029535098,0.000055838744,0.00020310002,0.0001502525,0.00016584364,0.87718314,0.00017278621,0.12055424],"study_design_scores_gemma":[0.0077939834,0.0033716182,0.07938302,0.00021837417,0.00009458265,0.0013841129,0.0003534413,0.084469,0.0038917707,0.8004235,0.01607577,0.0025408044],"about_ca_topic_score_codex":0.0000066445486,"about_ca_topic_score_gemma":0.000007658326,"teacher_disagreement_score":0.118013434,"about_ca_system_score_codex":0.00004770585,"about_ca_system_score_gemma":0.00009631645,"threshold_uncertainty_score":0.8435439},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51254743,0.0012628243,0.3401088,0.007108939,0.002239564,0.0038747243,0.00009059688,0.000155968,0.13261117],"genre_scores_gemma":[0.9973659,0.000013843716,0.00068165053,0.00004968699,0.000051914485,0.00006784292,0.000005039902,0.000014437811,0.0017496838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941325,0.000006253586,0.00015215922,0.0001188675,0.000073311836,0.00023615037],"domain_scores_gemma":[0.99826884,0.0013039305,0.00006415401,0.00026325588,0.000045973422,0.000053819695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002988698,0.00009439948,0.000089950554,0.000006215486,0.0005324368,0.00005417662,0.0001639564,0.000019202185,0.000024084706],"category_scores_gemma":[0.000019022302,0.000052542273,0.000057912093,0.00008405139,0.00011650159,0.000047134552,0.000056193636,0.00008797364,0.000018160403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094334955,0.000029113917,0.00016999431,0.0000035065273,0.000021431624,5.3577807e-8,0.00010021133,0.0000018915546,0.0000322493,0.98933804,0.0015326369,0.008761454],"study_design_scores_gemma":[0.00029901287,0.000019269839,0.00013785667,0.000003149338,0.000019049385,4.1769286e-7,0.00061882153,0.00024241413,0.00060091796,0.86236227,0.13562879,0.00006803163],"about_ca_topic_score_codex":0.000013682181,"about_ca_topic_score_gemma":0.000002554429,"teacher_disagreement_score":0.4848185,"about_ca_system_score_codex":0.000007997775,"about_ca_system_score_gemma":0.0000097347665,"threshold_uncertainty_score":0.40951273},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95537853,0.00043351934,0.000017617771,0.00033161708,0.0025072286,0.00017194776,0.000011988629,0.00007696198,0.041070577],"genre_scores_gemma":[0.9965596,0.00005721006,0.0005034892,0.00028607147,0.000010364843,0.000008634589,0.000004042096,0.000022476868,0.002548114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996007,0.00038029937,0.0009962412,0.0005507498,0.0016571907,0.00040849045],"domain_scores_gemma":[0.9955515,0.0021734359,0.00039924358,0.0011744738,0.0004836963,0.00021763638],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026912107,0.00022672603,0.00059639296,0.00030621418,0.00028392268,0.000048828188,0.0013059808,0.00017724122,0.0005453868],"category_scores_gemma":[0.0036424631,0.00018354355,0.00024804586,0.0011310454,0.0004498899,0.00038480453,0.00023449327,0.00023749442,0.0012506585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000744637,0.00020230535,0.03036948,0.0000071293625,0.00002552191,0.000056138353,0.0011933974,0.000018880586,0.001002839,0.9252001,0.040594984,0.0012547527],"study_design_scores_gemma":[0.0007524778,0.000167647,0.038639814,0.000016214375,0.000008991667,0.00003071533,0.00020709803,0.000027716611,0.0038418737,0.95201373,0.004086539,0.00020719692],"about_ca_topic_score_codex":0.000050518025,"about_ca_topic_score_gemma":0.000004874305,"teacher_disagreement_score":0.041181054,"about_ca_system_score_codex":0.000038558963,"about_ca_system_score_gemma":0.0001470371,"threshold_uncertainty_score":0.999527},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9972481,0.000359698,0.00011556958,0.00091366214,0.0005398315,0.00009155778,6.826787e-7,0.0000624567,0.00066842843],"genre_scores_gemma":[0.9990218,0.00012939019,0.00051468133,0.00026708213,4.261869e-7,0.000008982067,5.78241e-7,0.0000042082697,0.00005281687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991878,0.00007344842,0.00016025236,0.00019580302,0.00023941512,0.00014328148],"domain_scores_gemma":[0.9991166,0.00024403771,0.00007482942,0.00042015174,0.000084415,0.00005994862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002775687,0.000082690545,0.000113319715,0.00015712238,0.00027962145,0.00002351088,0.0002319969,0.00003611481,0.0000028649035],"category_scores_gemma":[0.000085052634,0.00004956477,0.000044826305,0.00089668337,0.00013415793,0.00010396345,0.00009697896,0.0000960249,0.000013246016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021237588,0.00008043086,0.0013783738,0.000002278654,0.000009574785,0.000003540517,0.0002107965,0.000009847911,0.00052321714,0.99499565,0.002607191,0.00017698032],"study_design_scores_gemma":[0.00033546082,0.00020077013,0.005740981,0.00001938577,0.0000060613006,0.000015055949,0.000010595772,0.000953759,0.0037810055,0.9885336,0.0003194424,0.00008384288],"about_ca_topic_score_codex":0.000029645002,"about_ca_topic_score_gemma":6.4822206e-7,"teacher_disagreement_score":0.0064620054,"about_ca_system_score_codex":0.0000061759565,"about_ca_system_score_gemma":0.000024580502,"threshold_uncertainty_score":0.21506503},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7775498,0.00016080285,0.2176015,0.0001928621,0.0016493269,0.00009518379,0.0000010701065,0.00007495675,0.002674474],"genre_scores_gemma":[0.9916184,0.0000040457167,0.008186452,0.00008348243,0.000009553362,0.0000018827113,0.0000042719034,0.0000034282489,0.00008846817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919647,0.000025759538,0.00020676746,0.00017204035,0.0002430721,0.00015587214],"domain_scores_gemma":[0.99934304,0.00013017423,0.00007765543,0.00026095123,0.0001256163,0.00006256916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048358814,0.000070461465,0.00009712688,0.00016284511,0.000053805976,0.000023487999,0.0003368681,0.000036488636,0.0000084692965],"category_scores_gemma":[0.000038730246,0.000072178234,0.000048771293,0.00073458574,0.00002422338,0.00018416277,0.00008404911,0.000058714217,0.000020468882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004190587,0.00004130482,0.0005351151,0.000006617815,0.000008446031,0.000005189308,0.00023207044,0.00016423146,0.0015748183,0.98514044,0.000576115,0.01171147],"study_design_scores_gemma":[0.0005597262,0.00014891186,0.016307194,0.000011994645,0.0000053626295,0.000013630494,0.000019741627,0.0050545973,0.028879957,0.9462623,0.0025832325,0.00015338162],"about_ca_topic_score_codex":0.000010099309,"about_ca_topic_score_gemma":0.0000030190552,"teacher_disagreement_score":0.21406859,"about_ca_system_score_codex":0.000015613079,"about_ca_system_score_gemma":0.00004065912,"threshold_uncertainty_score":0.29433432},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99322957,0.00028808933,0.0020180948,0.00009809633,0.0027302129,0.00017636605,0.0000021505016,0.000116312316,0.0013411277],"genre_scores_gemma":[0.99898833,0.00007508054,0.00075515336,0.00008358002,0.000010365693,0.000011874641,0.0000016844149,0.000012569666,0.00006135867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984602,0.00015418662,0.00036571934,0.0004206724,0.00028445304,0.00031480528],"domain_scores_gemma":[0.9988807,0.00023519262,0.00015771759,0.00047719092,0.00013997772,0.00010924845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006515918,0.0001764918,0.00030563906,0.0001522524,0.00015663973,0.00011130455,0.00045222734,0.0000834464,0.000014183093],"category_scores_gemma":[0.00004745574,0.0001681612,0.00009964017,0.0004662858,0.00007468099,0.0005176751,0.00019100771,0.00017063596,0.000004928937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009895683,0.00008203344,0.031576358,0.000019088377,0.00003680229,0.000018257168,0.00054393965,0.00000962883,0.0005822725,0.9651698,0.00032147503,0.0016304508],"study_design_scores_gemma":[0.001797055,0.0005449432,0.038546246,0.00013982457,0.00001617714,0.0001367257,0.00031124716,0.039539378,0.00077708025,0.91554636,0.0021326696,0.0005122765],"about_ca_topic_score_codex":0.00047148016,"about_ca_topic_score_gemma":0.00006718131,"teacher_disagreement_score":0.049623426,"about_ca_system_score_codex":0.0000296341,"about_ca_system_score_gemma":0.000016696536,"threshold_uncertainty_score":0.68574154},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93866605,0.0002494254,0.044671968,0.00014115484,0.0014257267,0.00018582714,9.183745e-7,0.00012936577,0.014529545],"genre_scores_gemma":[0.99188423,0.000012772505,0.007882092,0.00005189931,0.0000021420774,0.0000026954715,4.427016e-7,0.000008112726,0.00015561222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986807,0.000049344402,0.00024653514,0.00023127197,0.00042495914,0.00036719957],"domain_scores_gemma":[0.99878716,0.00020810199,0.00009553801,0.0006376945,0.00014287372,0.00012862995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009880604,0.00009519026,0.00014631232,0.0002323206,0.000071331895,0.000025081785,0.0010678861,0.000046407094,0.000014684209],"category_scores_gemma":[0.00007944076,0.00009204316,0.00007332002,0.00088037347,0.00009878769,0.0003298577,0.00026652013,0.00015713803,0.000029704694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010942097,0.00008159444,0.0037477424,0.0000054988946,0.000013138312,0.000019122966,0.0001391764,0.000002181373,0.00300219,0.9797338,0.00018887916,0.013055692],"study_design_scores_gemma":[0.00044935296,0.000119249285,0.0074716313,0.000011082863,0.0000015263778,0.0000061699393,0.000025262543,0.00009831099,0.030434309,0.96049416,0.0007903444,0.00009862273],"about_ca_topic_score_codex":0.000006971471,"about_ca_topic_score_gemma":0.0000016834076,"teacher_disagreement_score":0.05321816,"about_ca_system_score_codex":0.000033564866,"about_ca_system_score_gemma":0.000033127624,"threshold_uncertainty_score":0.37534115},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99513966,0.00007506985,0.00033748682,0.00009520256,0.00031026284,0.00013582873,0.000006161676,0.00004461035,0.003855695],"genre_scores_gemma":[0.99943644,0.000008065411,0.00036392268,0.000027702246,0.00000742976,0.000012212734,0.0000023412915,0.000009354617,0.00013250366],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894875,0.000026948306,0.00021719348,0.00017025556,0.00031610284,0.00032075707],"domain_scores_gemma":[0.9992398,0.0001151756,0.00006986578,0.00031612304,0.00012686265,0.00013214257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066889945,0.00007580701,0.0001235611,0.00008393958,0.000088028,0.00001992657,0.00031458304,0.000052432217,0.0002089317],"category_scores_gemma":[0.00006229603,0.00006984123,0.000047503872,0.0003450234,0.0001126033,0.00008677831,0.00007805808,0.00007768013,0.00017367835],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001809194,0.00011502042,0.007755619,0.000010623954,0.0000043291407,0.0000031380512,0.000060006543,8.6487455e-7,0.5647622,0.42510927,0.0011854147,0.0009754502],"study_design_scores_gemma":[0.000361219,0.00005539998,0.0246305,0.000009185208,0.0000034041263,0.0000024353785,0.00007305482,0.000015845353,0.68070555,0.29242623,0.0016312649,0.00008590476],"about_ca_topic_score_codex":0.0001089679,"about_ca_topic_score_gemma":0.000020185862,"teacher_disagreement_score":0.13268305,"about_ca_system_score_codex":0.00002295974,"about_ca_system_score_gemma":0.00005747938,"threshold_uncertainty_score":0.28480428},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9633634,0.00007372893,0.00007502072,0.00022124259,0.0021617974,0.00041191073,0.000017239629,0.00014948222,0.033526152],"genre_scores_gemma":[0.9982328,0.000011547448,0.00082144723,0.00028647014,0.0000142032595,0.000061274426,0.000004892151,0.00003461239,0.00053278694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990763,0.000061788945,0.00020734676,0.00021441458,0.00018021188,0.0002599016],"domain_scores_gemma":[0.99858916,0.000794279,0.0000865704,0.00040398448,0.000057996367,0.00006801068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026790373,0.00015619888,0.00018861721,0.0000576088,0.00027662687,0.000027707352,0.0001902631,0.000107631626,0.00036087804],"category_scores_gemma":[0.00040526496,0.00012722374,0.00012792714,0.00009541551,0.00006995193,0.00006685391,0.00003858359,0.00012295025,0.00003831638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028049317,0.000118221615,0.000045009343,0.00002628058,0.00003098815,0.0000021331941,0.00061053433,0.0000011504994,0.00001933503,0.96646994,0.031422902,0.0012254737],"study_design_scores_gemma":[0.00085927086,0.00019219371,0.00006149298,0.000024307355,0.000029550138,0.000003608701,0.000035909095,0.00031701368,0.00094865065,0.9948321,0.0025280563,0.0001678399],"about_ca_topic_score_codex":7.444077e-7,"about_ca_topic_score_gemma":7.5823925e-7,"teacher_disagreement_score":0.03486934,"about_ca_system_score_codex":0.00003220938,"about_ca_system_score_gemma":0.0000035208463,"threshold_uncertainty_score":0.5188034},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85065335,0.000030579693,0.14186549,0.001454623,0.000776166,0.001129887,0.0000066242715,0.0003291163,0.0037541476],"genre_scores_gemma":[0.9918118,0.000006455844,0.0077274214,0.0001676621,0.000005838272,0.00011923963,0.000005875569,0.000012890532,0.0001428097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860996,0.00008248842,0.00014673531,0.00046284747,0.00034025428,0.00035773352],"domain_scores_gemma":[0.9985635,0.00035624928,0.000059666974,0.00076056283,0.0001445215,0.00011544657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038323092,0.00014169788,0.00015114884,0.00012105952,0.00020109357,0.00007693179,0.00064134167,0.000055520508,0.0000044113626],"category_scores_gemma":[0.00009302879,0.000118592674,0.000057803438,0.00064570486,0.000082565515,0.00041668292,0.000046968613,0.00015621609,0.000032860527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020837689,0.00013421227,0.0023670306,0.0000072912044,0.000010149237,0.000008612047,0.00013660763,0.00006286035,0.00022281862,0.99302757,0.00035209433,0.0034623991],"study_design_scores_gemma":[0.0011447858,0.00081194023,0.0033853624,0.000013164739,0.0000029014716,0.00000897886,0.000007139832,0.0029776692,0.0021586525,0.9864352,0.002887075,0.00016712563],"about_ca_topic_score_codex":0.000006894242,"about_ca_topic_score_gemma":0.000011303629,"teacher_disagreement_score":0.14115845,"about_ca_system_score_codex":0.000069628986,"about_ca_system_score_gemma":0.00005740722,"threshold_uncertainty_score":0.48360687},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9848796,0.00010845839,0.00065728254,0.00012044842,0.00084223045,0.00037705683,0.00001985261,0.000035474874,0.012959602],"genre_scores_gemma":[0.9298379,0.000012847503,0.06972485,0.000036454367,0.000006464525,0.000015199142,8.46308e-7,0.000018843319,0.0003466083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966932,0.00051959505,0.0008486434,0.00047141287,0.0011627901,0.00030438983],"domain_scores_gemma":[0.99457175,0.003063296,0.00064610504,0.00080898916,0.0007539891,0.0001559028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013072271,0.00021746015,0.00064666616,0.00020640074,0.00011537897,0.00003956484,0.0007548068,0.00010290856,0.00027285932],"category_scores_gemma":[0.001812926,0.000171305,0.00013407395,0.0016256685,0.0006326657,0.00022429513,0.00013558804,0.0001672283,0.00003561454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00136892,0.001042261,0.103345335,0.00002348574,0.0002824195,0.00007000009,0.00229799,0.0007466676,0.3945101,0.488936,0.0038835355,0.0034933041],"study_design_scores_gemma":[0.004298183,0.0022554782,0.025073662,0.0001303794,0.00007935425,0.00027259503,0.0032873838,0.00042423228,0.28962326,0.6724909,0.001504871,0.0005596855],"about_ca_topic_score_codex":0.00005679742,"about_ca_topic_score_gemma":0.0000044356966,"teacher_disagreement_score":0.18355493,"about_ca_system_score_codex":0.000057413185,"about_ca_system_score_gemma":0.00015208038,"threshold_uncertainty_score":0.6985615},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92491055,0.000081710554,0.072690144,0.000046150486,0.00074479455,0.00009004033,0.0000014902159,0.000086442786,0.001348698],"genre_scores_gemma":[0.96223223,0.0000032444889,0.037695497,0.000015389343,0.000004541302,0.0000027498008,0.0000012567618,0.000005607831,0.00003947094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990896,0.000050579918,0.00022270498,0.00025924298,0.00018645488,0.0001914038],"domain_scores_gemma":[0.9993079,0.00007347834,0.00018583829,0.00029756266,0.00009728374,0.000037973863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076560296,0.000116747746,0.00017904092,0.00006863036,0.00009730186,0.00002795466,0.0003111669,0.000060886643,0.000005032089],"category_scores_gemma":[0.000029642371,0.000110882276,0.000048942227,0.0003607855,0.0000962581,0.00037784013,0.00012566187,0.000114982344,0.0000063960006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031642203,0.000041873347,0.007477903,0.0000064324818,0.000006602265,0.0000052266428,0.000115520634,0.00014567559,0.0039559193,0.98698646,0.000012705999,0.0012424897],"study_design_scores_gemma":[0.0004331399,0.00005362517,0.021776872,0.000027646798,0.000005344822,0.000018598155,0.00001504967,0.010471326,0.0075912606,0.9594445,0.000027762579,0.00013482354],"about_ca_topic_score_codex":0.00008091157,"about_ca_topic_score_gemma":0.0000027165038,"teacher_disagreement_score":0.037321717,"about_ca_system_score_codex":0.000054834214,"about_ca_system_score_gemma":0.000039427694,"threshold_uncertainty_score":0.4521648},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97933227,0.00082207774,0.0030326145,0.0002215266,0.0016953513,0.00031196658,5.749418e-7,0.00018907101,0.014394522],"genre_scores_gemma":[0.99692845,0.00004907037,0.002756912,0.00010504497,0.0000011678108,0.000020934178,4.6914303e-7,0.000011338391,0.00012663216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981762,0.0002798738,0.00022011928,0.0004132739,0.00038177523,0.0005287272],"domain_scores_gemma":[0.9988182,0.00024862055,0.00004980447,0.000669121,0.00007703009,0.00013719997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065418845,0.00013839049,0.00016439942,0.00035690196,0.00009404576,0.00009525516,0.0010357423,0.00005996707,0.000026362752],"category_scores_gemma":[0.00030343194,0.00013827093,0.000055665838,0.00196708,0.000072114846,0.00062818674,0.00015799388,0.0002451239,0.000114761984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052289306,0.000115503084,0.011007008,0.0000055338855,0.00000595816,0.00005134755,0.00020274016,0.000025585843,0.00015859074,0.98660296,0.00012260329,0.0016969632],"study_design_scores_gemma":[0.0008294184,0.00007661172,0.0045781303,0.000010772811,0.0000013103684,0.0000077961095,0.000028896653,0.00061356486,0.0025008344,0.98944426,0.0017382551,0.00017015747],"about_ca_topic_score_codex":0.000009438705,"about_ca_topic_score_gemma":0.000006798818,"teacher_disagreement_score":0.017596135,"about_ca_system_score_codex":0.000067133944,"about_ca_system_score_gemma":0.00008631988,"threshold_uncertainty_score":0.5638525},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96696043,0.00035080567,0.0010721007,0.0022123088,0.0050863014,0.00021700152,0.0000012543536,0.00070156826,0.023398208],"genre_scores_gemma":[0.9967881,0.000007602706,0.0023514607,0.00043158254,0.0000014496192,0.000011039091,0.000002149314,0.0000099029,0.00039674493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987544,0.000046640616,0.00020573083,0.00037425593,0.00032790363,0.00029109535],"domain_scores_gemma":[0.9990773,0.00007368963,0.00006714129,0.0006333577,0.00006881996,0.000079646816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002193783,0.00014313182,0.00013359715,0.00014159142,0.00015252622,0.00009614526,0.00051127095,0.00006338963,0.000007788464],"category_scores_gemma":[0.000013610983,0.00012825054,0.00008444018,0.00045724242,0.000038818907,0.0001244435,0.000114644594,0.00013512128,0.00027216686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026610633,0.00016420441,0.00028829576,0.0000030051433,0.0000032674425,0.000014141045,0.000042965316,0.00007247033,0.00071651634,0.9864949,0.011120433,0.0010771608],"study_design_scores_gemma":[0.0005964862,0.00013007055,0.0010760507,0.0000187732,0.0000029626317,0.0000038096262,0.0000014570477,0.0018297045,0.0039898814,0.989044,0.0031397743,0.00016703882],"about_ca_topic_score_codex":0.00011362786,"about_ca_topic_score_gemma":0.0000031242016,"teacher_disagreement_score":0.029827615,"about_ca_system_score_codex":0.000022242997,"about_ca_system_score_gemma":0.000027798143,"threshold_uncertainty_score":0.5229905},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99705195,0.00017301503,0.00072281016,0.000118738935,0.00018487284,0.000049640086,3.091815e-7,0.000027081207,0.001671552],"genre_scores_gemma":[0.9937616,0.000014548203,0.0060513183,0.00007611198,0.0000027821222,0.0000027191547,0.0000013483275,0.0000031038057,0.0000864786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993515,0.000030149626,0.00018049988,0.00018232276,0.00013234763,0.0001232033],"domain_scores_gemma":[0.9996802,0.00008666194,0.000046398338,0.00011165421,0.000040496452,0.00003456195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025827638,0.00006329464,0.00009821237,0.00011972487,0.00008132579,0.00007947878,0.00015987325,0.000030633004,0.000013182055],"category_scores_gemma":[0.000029009878,0.00006913808,0.000020799815,0.0005299295,0.000033120155,0.00031853217,0.000047458936,0.000064161,0.000003596208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076291376,0.00006457779,0.007094775,0.000018221866,0.000005927509,0.0000068251,0.0016304475,0.0007011725,0.001961253,0.8460514,0.00018888577,0.14226891],"study_design_scores_gemma":[0.0014922662,0.00013171003,0.070895635,0.00011647717,0.0000048212355,0.00002452861,0.000030917516,0.06842641,0.0068724905,0.84800977,0.003685032,0.0003099622],"about_ca_topic_score_codex":0.000036035584,"about_ca_topic_score_gemma":0.0000021806384,"teacher_disagreement_score":0.14195895,"about_ca_system_score_codex":0.00001284932,"about_ca_system_score_gemma":0.000027154932,"threshold_uncertainty_score":0.2819369},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939779,0.00018262478,0.00016865881,0.0028206126,0.00082845706,0.00031538872,0.000004142933,0.000028446346,0.0016737523],"genre_scores_gemma":[0.99762464,0.000050434304,0.0021394864,0.00006490048,0.000010433898,0.000019903728,0.0000042533334,0.0000056935137,0.000080275546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840915,0.00016439823,0.0003432512,0.0002750277,0.00054675335,0.00026142068],"domain_scores_gemma":[0.9988367,0.00009470268,0.00013647116,0.00084240985,0.000059112812,0.00003058746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010060132,0.00012243967,0.00016779004,0.00007553249,0.00008999486,0.00009409699,0.0015682174,0.000033020133,0.000008312946],"category_scores_gemma":[0.000030634066,0.0000743644,0.00010074333,0.00074135954,0.00013228122,0.00038116903,0.00036958038,0.00016244236,0.000009896219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010842486,0.0002398739,0.0053611547,0.0000075585044,0.00002576375,0.000005487958,0.0002694169,0.000011564526,0.000073695985,0.9772626,0.0016692585,0.015062794],"study_design_scores_gemma":[0.0030371642,0.00018460586,0.18188865,0.00003523159,0.000033433913,0.0000436921,0.00015766932,0.009994889,0.003073179,0.79475224,0.0063890647,0.0004101966],"about_ca_topic_score_codex":0.000059625127,"about_ca_topic_score_gemma":0.000014029728,"teacher_disagreement_score":0.18251036,"about_ca_system_score_codex":0.000010990219,"about_ca_system_score_gemma":0.000024447954,"threshold_uncertainty_score":0.3032492},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7063737,0.00035933763,0.276063,0.0023453108,0.0030502493,0.0003537002,0.0000023282473,0.0008716958,0.010580703],"genre_scores_gemma":[0.9830283,0.000016688447,0.016543461,0.000099096054,0.0000036528802,0.0000031012416,4.937465e-7,0.0000045324523,0.0003006689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922365,0.000079429,0.00018421958,0.0001594383,0.00021944317,0.00013380364],"domain_scores_gemma":[0.9991505,0.000058394366,0.000103323044,0.0005653658,0.00008764577,0.000034739292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001529259,0.00007585751,0.00012181432,0.000042590742,0.00014912077,0.000015057227,0.0010001344,0.000046406585,0.0000033033148],"category_scores_gemma":[0.000044668835,0.000055442808,0.00008195523,0.00041329968,0.000073996365,0.00010251435,0.00027854755,0.00009904201,0.0000107717715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012746297,0.000062798004,0.0048947507,0.0000038870844,0.000009609539,0.0000039873576,0.00032502477,0.00045752706,0.00008145307,0.98430866,0.009506757,0.00034428353],"study_design_scores_gemma":[0.0010693414,0.00019432783,0.051503796,0.000052226587,0.000013818615,0.00013084617,0.000013739576,0.10014384,0.02983376,0.81109107,0.0054799453,0.00047329624],"about_ca_topic_score_codex":0.000020153731,"about_ca_topic_score_gemma":5.17742e-7,"teacher_disagreement_score":0.27665463,"about_ca_system_score_codex":0.000016723261,"about_ca_system_score_gemma":0.00005871668,"threshold_uncertainty_score":0.22608921},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95398796,0.002476472,0.010815323,0.005280341,0.0057419883,0.0005595538,0.0000057212424,0.001670474,0.019462183],"genre_scores_gemma":[0.98579746,0.000038622773,0.013335741,0.0006060187,0.0000016336462,0.000005385429,0.0000039887473,0.000012392102,0.00019876497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867636,0.000034997443,0.00024934916,0.00037968688,0.0003230195,0.00033660998],"domain_scores_gemma":[0.99881923,0.000040494677,0.00008433596,0.0007741212,0.00013274299,0.0001490638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030762627,0.00015921085,0.00017360866,0.0001343372,0.0001520975,0.00015956035,0.0007430278,0.000072966046,0.000013052455],"category_scores_gemma":[0.000039931117,0.00014322974,0.0000775023,0.0006799111,0.000050157814,0.00037011094,0.00021471888,0.00016519942,0.0004494326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018535419,0.00007670341,0.00019403528,0.000010741364,0.000008563883,0.000021946771,0.00012478062,0.00007240898,0.0003012596,0.99577063,0.0021724764,0.0012445707],"study_design_scores_gemma":[0.0009917979,0.0001325956,0.0003563666,0.00006073969,0.000005625962,0.000017272643,0.000012585334,0.00066152774,0.0015724399,0.9931577,0.002828413,0.00020292735],"about_ca_topic_score_codex":0.0000708657,"about_ca_topic_score_gemma":0.0000020090924,"teacher_disagreement_score":0.03180951,"about_ca_system_score_codex":0.000051982803,"about_ca_system_score_gemma":0.00007372524,"threshold_uncertainty_score":0.5840739},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.980678,0.0007197101,0.000013363119,0.0000030547571,0.0018976943,0.00008098648,0.0000052118726,0.00013913424,0.016462808],"genre_scores_gemma":[0.9998403,0.000020929967,0.0000368696,0.000008061617,0.000001702352,0.000009465105,0.0000039131123,0.000016792017,0.00006191728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933875,0.00006943295,0.00020813197,0.000102412465,0.00010879148,0.00017247937],"domain_scores_gemma":[0.9996315,0.00004342691,0.000032572552,0.00019836373,0.000040092633,0.00005403775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019635097,0.00011689862,0.00017833672,0.0000820204,0.000036421876,0.000013414138,0.00012289968,0.00007054672,0.00007361976],"category_scores_gemma":[0.000015286581,0.00011387136,0.00005837342,0.0003204761,0.000041515697,0.00008662494,0.0000043466944,0.00008854782,0.000038894108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032412006,0.00002422562,0.0032548192,0.00006489899,0.000044493652,0.000008784549,0.00026436543,0.0002861227,0.016914008,0.97841275,0.0006701085,0.000052195886],"study_design_scores_gemma":[0.0007368283,0.00009952781,0.0007649331,0.00009352715,0.000024148907,0.000024138937,0.00024539657,0.00043187817,0.16501561,0.8276049,0.0046146284,0.0003444938],"about_ca_topic_score_codex":0.0000070073497,"about_ca_topic_score_gemma":0.0000013155995,"teacher_disagreement_score":0.15080784,"about_ca_system_score_codex":0.000011674222,"about_ca_system_score_gemma":0.000009863186,"threshold_uncertainty_score":0.46435395},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9970332,0.00007626171,0.0008007305,0.000093330185,0.0003969851,0.00042748192,0.00001115599,0.000047252106,0.0011136426],"genre_scores_gemma":[0.99480915,0.000012286818,0.004300845,0.00005033961,0.00001874924,0.000022878303,0.0000033773026,0.000035150762,0.0007472089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900657,0.000022723032,0.00029917294,0.00021994884,0.0001468253,0.00030473946],"domain_scores_gemma":[0.9990931,0.00033115523,0.00013210878,0.00024860958,0.00011611358,0.00007887841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072544545,0.00014332948,0.00028788717,0.00006868518,0.000072449926,0.000018945238,0.0001498156,0.000091027265,0.000011827063],"category_scores_gemma":[0.00027640467,0.000105906256,0.00006988944,0.00008924689,0.000069537826,0.000111544665,0.00007569839,0.000087139335,0.000002274469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010530668,0.0004370555,0.010508574,0.00054188445,0.000071871465,0.0000063387233,0.0018473937,4.164914e-8,0.0045223255,0.9766016,0.0033668904,0.0019907048],"study_design_scores_gemma":[0.0018360297,0.00021062806,0.006300236,0.00009449963,0.000042957985,0.000004986736,0.00021672006,0.000035224635,0.054288592,0.92836595,0.008376,0.00022816198],"about_ca_topic_score_codex":0.000018068462,"about_ca_topic_score_gemma":0.00001481757,"teacher_disagreement_score":0.049766265,"about_ca_system_score_codex":0.000025116371,"about_ca_system_score_gemma":0.000022690647,"threshold_uncertainty_score":0.4318732},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9787868,0.00008863192,0.00002071894,0.00007848067,0.0011145691,0.0004085038,0.00002088656,0.00007888781,0.019402469],"genre_scores_gemma":[0.99430466,0.000036026482,0.0042267996,0.00017431256,0.000011007768,0.00003042063,0.000008697186,0.000043032727,0.001165059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988473,0.00005798572,0.00035659896,0.00022560572,0.00021495209,0.0002975795],"domain_scores_gemma":[0.9987205,0.0004665596,0.00012211261,0.00048330906,0.00012865635,0.00007886334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003220926,0.00018349648,0.00033050307,0.00006253529,0.00012562063,0.000014731973,0.0003229425,0.00014507878,0.00060113694],"category_scores_gemma":[0.0001854944,0.0001587974,0.0001856965,0.00021700155,0.00012940576,0.000079242775,0.000039972198,0.0001281365,0.000008378926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080646096,0.00011812105,0.00049083336,0.00008211733,0.00012235821,0.0000016026463,0.0008512147,0.0000022531242,0.000075690165,0.9857859,0.010658509,0.0017307646],"study_design_scores_gemma":[0.0012888121,0.0001146631,0.00021561568,0.000023680472,0.0000700601,0.000004226203,0.00006574061,0.000032597058,0.00095284893,0.9841685,0.01287255,0.00019066317],"about_ca_topic_score_codex":0.00001868001,"about_ca_topic_score_gemma":0.0000048556712,"teacher_disagreement_score":0.01823741,"about_ca_system_score_codex":0.000016249443,"about_ca_system_score_gemma":0.000023301081,"threshold_uncertainty_score":0.65820277},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9565984,0.00010529462,0.00036697183,0.00012403764,0.0030221967,0.00017350701,0.000002160678,0.00022999322,0.039377414],"genre_scores_gemma":[0.9773508,0.000028225018,0.008090895,0.000090713525,0.00005585462,0.00000811498,0.0000010287207,0.000048916885,0.014325506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888027,0.000030079025,0.0002530073,0.00023938202,0.00030792612,0.00028936475],"domain_scores_gemma":[0.9989932,0.0003266965,0.00010672231,0.00043615306,0.00003347313,0.00010375331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008640896,0.00017878151,0.00021680142,0.00006307448,0.00012276767,0.000052332605,0.00027157072,0.000089854075,0.0006560946],"category_scores_gemma":[0.0003086852,0.00018532271,0.00007935032,0.0001230572,0.0000401557,0.00018775531,0.00008352211,0.00023213075,0.00048767246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038500148,0.000072659124,0.00037600723,0.000022611555,0.000015413867,0.000043972672,0.00055936136,6.6886054e-7,0.00004514529,0.97904456,0.017177066,0.0026387055],"study_design_scores_gemma":[0.0006261729,0.00007545096,0.00007165635,0.000060068403,0.000017143686,0.000019329764,0.0000767315,0.00006314658,0.0022783151,0.99506277,0.0014410063,0.00020818735],"about_ca_topic_score_codex":0.000007687551,"about_ca_topic_score_gemma":0.000004796901,"teacher_disagreement_score":0.025051907,"about_ca_system_score_codex":0.00009260622,"about_ca_system_score_gemma":0.000011116623,"threshold_uncertainty_score":0.75572413},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97708786,0.000037337642,0.0002325813,0.0001195245,0.004243042,0.0007862351,0.000016373218,0.00015192738,0.017325142],"genre_scores_gemma":[0.99095494,0.0000051519883,0.0076893326,0.00036573724,0.000017132046,0.00009543862,0.0000030444533,0.000053574917,0.0008156688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869156,0.00011103868,0.0002876236,0.00029916625,0.00021740825,0.00039322788],"domain_scores_gemma":[0.9980349,0.0011291328,0.00012273512,0.0005071997,0.00008787426,0.00011818729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004790128,0.00022165467,0.00029123324,0.00007322706,0.00030168233,0.000036398986,0.00021939061,0.0001605627,0.000082037084],"category_scores_gemma":[0.0014123555,0.0001876728,0.00017816522,0.0001549701,0.00008508784,0.00006645251,0.000036748166,0.00018563448,0.000030464407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073923424,0.00015738435,0.00029203983,0.000046274068,0.000046647754,0.000003913353,0.00069317047,0.000004253878,0.00014787145,0.9915253,0.006682819,0.00032640135],"study_design_scores_gemma":[0.0019178832,0.00018816686,0.00010662774,0.000029589539,0.00004519989,0.0000042256834,0.0000583022,0.00009614626,0.0050105783,0.9665451,0.025754282,0.00024390622],"about_ca_topic_score_codex":0.0000035660603,"about_ca_topic_score_gemma":0.0000035446517,"teacher_disagreement_score":0.02498021,"about_ca_system_score_codex":0.00005830407,"about_ca_system_score_gemma":0.00003214014,"threshold_uncertainty_score":0.7653075},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82423764,0.003777309,0.137943,0.0072915694,0.0075832778,0.0005777648,0.000004213702,0.0021436044,0.016441638],"genre_scores_gemma":[0.9905456,0.000027715623,0.00856671,0.00020816123,0.0000029992743,0.0000053200024,0.0000022414235,0.000012543832,0.0006287171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849224,0.000057185003,0.00024000967,0.00042643733,0.00041649127,0.00036761296],"domain_scores_gemma":[0.99871594,0.0000702248,0.00008433582,0.0007549369,0.00010656195,0.0002679866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030530192,0.00016798261,0.00020428536,0.00010885078,0.00016873339,0.0001388633,0.0008648221,0.00008227834,0.000013540355],"category_scores_gemma":[0.00004086269,0.00015696023,0.00009174519,0.0009946335,0.000035264144,0.0003321414,0.00014589867,0.00017837416,0.00013543387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025183717,0.000026746617,0.020253578,0.0000026118712,0.000016005097,0.0000151822005,0.00012215598,0.0000031261823,0.00009081009,0.9592515,0.008867596,0.011348152],"study_design_scores_gemma":[0.0006732053,0.0000638381,0.0053095403,0.000030741583,0.000008549001,0.000008215632,0.000003912824,0.00016923486,0.00032289178,0.985396,0.0078042103,0.00020964067],"about_ca_topic_score_codex":0.00008917068,"about_ca_topic_score_gemma":0.000005703733,"teacher_disagreement_score":0.16630796,"about_ca_system_score_codex":0.00002263121,"about_ca_system_score_gemma":0.0000813986,"threshold_uncertainty_score":0.64006525},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9194038,0.00033930864,0.000011688046,0.00000970109,0.0018136931,0.00006177483,0.000003143555,0.00015346445,0.07820345],"genre_scores_gemma":[0.9993858,0.000025467429,0.00002358881,0.000006698486,0.0000067976407,0.000008309692,0.000001158985,0.000021799773,0.00052039133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945885,0.000025118748,0.0001685753,0.00008310193,0.000106388594,0.0001579749],"domain_scores_gemma":[0.99964035,0.00003065626,0.000022113905,0.00023509671,0.00002356833,0.000048228852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000089878435,0.000095624724,0.00015375139,0.00003140827,0.000023579823,0.000008853284,0.0001317087,0.000065391934,0.00044637226],"category_scores_gemma":[0.000008106022,0.00009908306,0.00006022208,0.0001589583,0.000025280247,0.000080150676,0.000013006398,0.000086178574,0.00033885162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025723186,0.00006873256,0.0056141387,0.00010296708,0.00006170594,0.000006443123,0.00057935354,0.0001981582,0.0017920171,0.9803924,0.010526245,0.00065524003],"study_design_scores_gemma":[0.0018908129,0.0000708706,0.002874917,0.00016326888,0.00004223289,0.000041977743,0.00019452226,0.013923108,0.023912823,0.9355095,0.020711664,0.0006642816],"about_ca_topic_score_codex":0.0000060427346,"about_ca_topic_score_gemma":5.762297e-7,"teacher_disagreement_score":0.079982005,"about_ca_system_score_codex":0.000013988656,"about_ca_system_score_gemma":0.0000013088505,"threshold_uncertainty_score":0.48874632},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39661014,0.000010009367,0.58986723,0.00117996,0.001080154,0.00017402385,0.0000010878795,0.00008561465,0.0109918015],"genre_scores_gemma":[0.68053365,0.0000015972284,0.31918234,0.00013123346,0.000007739202,0.000009208555,4.6916978e-7,0.000008637407,0.00012511104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891126,0.00008828048,0.00020212529,0.0003067319,0.0002558377,0.00023577175],"domain_scores_gemma":[0.9988899,0.00014981408,0.00010646107,0.0006185078,0.00011037237,0.00012489798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047874963,0.00013522555,0.00026907868,0.000042243642,0.000054946493,0.00004749947,0.0006641895,0.00010037743,0.000035313606],"category_scores_gemma":[0.000059546786,0.0001036371,0.000070243004,0.0002729312,0.000093780916,0.00022806537,0.00015162588,0.00029358896,0.00003416487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030712723,0.00008896446,0.0018116528,0.000009542637,0.00001975949,0.000011998653,0.00033040956,1.1978204e-7,0.0025034884,0.9882724,0.00073736085,0.0061835623],"study_design_scores_gemma":[0.002821829,0.00007440608,0.0025511328,0.000025940091,0.000010917779,0.00007209303,0.0000033775023,0.0011830323,0.0060577705,0.9842681,0.002733148,0.00019823006],"about_ca_topic_score_codex":0.000024396828,"about_ca_topic_score_gemma":0.000002948991,"teacher_disagreement_score":0.28392354,"about_ca_system_score_codex":0.000007639958,"about_ca_system_score_gemma":0.000055076103,"threshold_uncertainty_score":0.42261985},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9731139,0.00012566155,0.0032279429,0.00032953566,0.0012087744,0.00031535694,8.044122e-7,0.00016262669,0.021515384],"genre_scores_gemma":[0.9917963,0.000012076648,0.007903175,0.0001417567,0.0000018948792,0.0000324304,4.1886292e-7,0.000014715093,0.000097216005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813485,0.0002969459,0.00022642726,0.00045493076,0.00039343623,0.00049339555],"domain_scores_gemma":[0.9985597,0.0005244405,0.00006374901,0.00068705337,0.000061529376,0.00010350692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082834996,0.00015923708,0.0001859768,0.00031730722,0.00012913777,0.00008344169,0.00082541973,0.00006845608,0.000010062623],"category_scores_gemma":[0.0004952977,0.00015842948,0.00006493268,0.0012246618,0.00007512029,0.0004011958,0.00014319202,0.0003436347,0.0000752093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000880415,0.00011076804,0.0017992946,0.000005250059,0.000003318757,0.000049828843,0.00035015328,0.000052242838,0.000560628,0.99000955,0.00006082763,0.006989337],"study_design_scores_gemma":[0.0009157586,0.000117542775,0.002762603,0.000034884433,7.613432e-7,0.0000063308094,0.000027750726,0.0008253658,0.008555554,0.98602664,0.0005445666,0.0001822089],"about_ca_topic_score_codex":0.000010361477,"about_ca_topic_score_gemma":0.0000071351233,"teacher_disagreement_score":0.021418167,"about_ca_system_score_codex":0.00008692193,"about_ca_system_score_gemma":0.00005416895,"threshold_uncertainty_score":0.64605665},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99760747,0.00017936296,0.0009181559,0.0004678299,0.00043261203,0.00014969522,6.791698e-7,0.000012871098,0.0002313147],"genre_scores_gemma":[0.9986897,0.000094717245,0.0010916161,0.000012109624,0.000002256103,0.000009104112,1.8448675e-7,0.0000053644035,0.000094944975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948484,0.000020804775,0.000105583764,0.00006778775,0.000205778,0.00011521436],"domain_scores_gemma":[0.9995209,0.00019587806,0.00004651075,0.00014888251,0.00006266728,0.000025139387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027287754,0.000044827986,0.00005397631,0.000014215404,0.00016908877,0.000017948334,0.0001683479,0.000020248239,9.818488e-7],"category_scores_gemma":[0.0005686774,0.00002485196,0.0000194053,0.00016796777,0.00007428697,0.0000957087,0.000054130684,0.000060489027,9.857151e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001625848,0.000010538883,0.00008398337,0.000011441507,0.0000043956647,2.2681436e-7,0.00020285872,0.0010951088,0.0018201083,0.9961481,0.00005849926,0.0005630787],"study_design_scores_gemma":[0.0003045559,0.000018722378,0.000660926,0.000021631706,0.0000039701563,0.0000020932273,0.00007850676,0.0017258913,0.022550432,0.9744066,0.00018510802,0.000041584324],"about_ca_topic_score_codex":0.000003277306,"about_ca_topic_score_gemma":0.0000024868764,"teacher_disagreement_score":0.021741554,"about_ca_system_score_codex":0.00002370225,"about_ca_system_score_gemma":0.00002200581,"threshold_uncertainty_score":0.13005112},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97798556,0.0029756508,0.000011802135,0.000012466242,0.00182727,0.00012049341,0.0000021746116,0.00023057287,0.016834008],"genre_scores_gemma":[0.9996473,0.00008294121,0.000044629192,0.000023301558,0.0000039349507,0.000018144849,0.0000017967343,0.000033455002,0.00014449106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992797,0.000042269134,0.00013068071,0.00016979504,0.000118021744,0.00025953358],"domain_scores_gemma":[0.9995306,0.000035436275,0.000025193003,0.00028524728,0.000018390252,0.0001050976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019937828,0.00016747425,0.00020341492,0.00007092088,0.000100700294,0.000048514743,0.00011168204,0.00009280837,0.000034748235],"category_scores_gemma":[0.000009377926,0.0001658904,0.00005535957,0.00017364306,0.00004509338,0.00012975292,0.0000139881895,0.00012132717,0.00003512761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033425652,0.000026769017,0.04754707,0.000064369255,0.000058039026,0.00001513344,0.00011696914,0.0001438917,0.0012846374,0.9485654,0.0020825525,0.00009182804],"study_design_scores_gemma":[0.0010896134,0.000042592485,0.006516739,0.00008304498,0.000030727693,0.00006173983,0.00044211023,0.00053512974,0.019611722,0.9494466,0.021660967,0.0004790172],"about_ca_topic_score_codex":0.000002497136,"about_ca_topic_score_gemma":0.0000026323653,"teacher_disagreement_score":0.04103033,"about_ca_system_score_codex":0.000015639107,"about_ca_system_score_gemma":0.0000046773616,"threshold_uncertainty_score":0.6764814},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99206936,0.00019282564,0.0051894546,0.00000609344,0.00040074575,0.00021079533,0.000030785224,0.00063408585,0.0012658578],"genre_scores_gemma":[0.9971345,0.0000216211,0.0027558068,0.000009343072,0.000014952329,0.000011808581,0.00002210477,0.000022855398,0.000006986845],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994037,0.000032390177,0.00016294654,0.00011501539,0.00015274946,0.00013319081],"domain_scores_gemma":[0.9996175,0.000053077947,0.000041441293,0.00021721543,0.000039881113,0.00003087537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076891425,0.00011625059,0.00013066106,0.00013853311,0.000029927212,0.000020111922,0.00016069149,0.000099656696,0.000052086438],"category_scores_gemma":[0.00000817551,0.0001142377,0.000026695529,0.00025441864,0.000020197664,0.00017758126,0.0000072382886,0.000104005165,0.000007154463],"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.000051119274,0.0002482231,0.0018140407,0.00019389241,0.0000433477,0.00005214021,0.0002376114,0.014720082,0.48917964,0.43732533,0.04491569,0.011218884],"study_design_scores_gemma":[0.0002481949,0.00032305933,0.005565729,0.00006284966,0.000013827513,0.000004739026,0.000010037213,0.005740779,0.44451845,0.543092,0.00020225054,0.00021809865],"about_ca_topic_score_codex":0.000038220212,"about_ca_topic_score_gemma":0.0000026575008,"teacher_disagreement_score":0.10576667,"about_ca_system_score_codex":0.00003810411,"about_ca_system_score_gemma":0.000009091174,"threshold_uncertainty_score":0.46584782},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9698212,0.003431579,0.0012025473,0.0010688421,0.008041395,0.00028487347,0.000007703074,0.00013816998,0.0160037],"genre_scores_gemma":[0.99772227,0.00032903766,0.00086719496,0.00018574663,0.000029343306,0.000018605979,0.0000015451611,0.000023288501,0.0008229777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971713,0.0006221502,0.00051802356,0.000431786,0.0005831415,0.00067363284],"domain_scores_gemma":[0.9972248,0.00049370865,0.00031234542,0.0012931149,0.00032935393,0.00034664923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022340263,0.00029311122,0.00036563227,0.00008335253,0.00036524064,0.00028659703,0.001915532,0.00015697263,0.000041750343],"category_scores_gemma":[0.00019619578,0.00023031665,0.00032726163,0.0010870814,0.00043639875,0.00026207115,0.0004735599,0.0003103623,0.00020764908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009643913,0.00020062787,0.010862911,0.000013898022,0.00011391783,0.00001557167,0.0018205267,0.000010534881,0.00013154805,0.96792364,0.015584002,0.0032263582],"study_design_scores_gemma":[0.0015455947,0.00018963791,0.0021249203,0.000058728772,0.000048852326,0.000030368019,0.00016351018,0.0014698401,0.0013500517,0.9628304,0.02988871,0.00029937262],"about_ca_topic_score_codex":0.00018733593,"about_ca_topic_score_gemma":0.000012898061,"teacher_disagreement_score":0.02790107,"about_ca_system_score_codex":0.00006251217,"about_ca_system_score_gemma":0.00033277273,"threshold_uncertainty_score":0.9392041},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9890362,0.0024347191,0.001056966,0.001287445,0.0007195276,0.00029421662,0.000001291811,0.00021962536,0.004950002],"genre_scores_gemma":[0.99853045,0.00020804304,0.0009262135,0.000092425274,0.0000030418885,0.000026187725,3.692029e-7,0.00000966721,0.0002036217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998755,0.00013042879,0.0001677607,0.00035043052,0.00021788068,0.00037852165],"domain_scores_gemma":[0.9989601,0.00038700423,0.000045479028,0.00043499688,0.00006695831,0.000105512576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029527192,0.00012775406,0.00018537683,0.00028663952,0.00010736146,0.00011646128,0.0005150912,0.000060467082,0.000025301275],"category_scores_gemma":[0.00017249846,0.00012696267,0.000031555996,0.00082479895,0.00013095286,0.00068117335,0.00019558205,0.00023909599,0.000035529036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073601427,0.00009289096,0.0052172965,0.000008241037,0.000009407759,0.00004182195,0.0005695692,0.0000035396556,0.00058427616,0.9862257,0.0005611105,0.006678783],"study_design_scores_gemma":[0.0011070564,0.00011334012,0.006951378,0.00001986358,0.0000015732712,0.000017574304,0.00006233551,0.0027990271,0.002223179,0.9854887,0.0010357965,0.00018017831],"about_ca_topic_score_codex":0.000022941518,"about_ca_topic_score_gemma":0.00001233408,"teacher_disagreement_score":0.009494224,"about_ca_system_score_codex":0.000026398275,"about_ca_system_score_gemma":0.000011657076,"threshold_uncertainty_score":0.5177387},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97838974,0.00047138962,0.0068993745,0.00034009235,0.0012398508,0.00034400765,0.0000018160829,0.00027835183,0.012035405],"genre_scores_gemma":[0.9976205,0.000020192392,0.002124393,0.000052628555,0.000010833641,0.00004100763,0.000003884569,0.000020317424,0.000106205756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783635,0.00016385883,0.0003589615,0.0005617309,0.00044892196,0.00063014956],"domain_scores_gemma":[0.99868685,0.000300651,0.00005257417,0.00075756974,0.00009169859,0.000110685505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062048924,0.00021014035,0.00029101945,0.00039163756,0.00013922463,0.00014293598,0.001116989,0.00008428535,0.000011422884],"category_scores_gemma":[0.00007335819,0.00021449587,0.0000957769,0.0010606908,0.00014246593,0.00055836677,0.00037262452,0.0003358995,0.000049644266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030817493,0.00013504463,0.017300682,0.0000061430783,0.000007843245,0.00010685914,0.00015718397,0.00006499851,0.0009635853,0.97513777,0.0003538942,0.0057352055],"study_design_scores_gemma":[0.00071028207,0.00011458538,0.05598005,0.00003474634,0.0000017537244,0.000010210018,0.000067734996,0.001098387,0.0049635535,0.9363628,0.00040531307,0.00025057816],"about_ca_topic_score_codex":0.00010677453,"about_ca_topic_score_gemma":0.0000819926,"teacher_disagreement_score":0.038774934,"about_ca_system_score_codex":0.000111780406,"about_ca_system_score_gemma":0.00006286071,"threshold_uncertainty_score":0.87468874},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9910973,0.00016948233,0.00028681348,0.00067960913,0.0020519618,0.00022183236,0.0000038742214,0.0005528105,0.004936356],"genre_scores_gemma":[0.99473363,0.00003960564,0.0036138324,0.0011659213,5.947484e-7,0.000024235884,0.000005996891,0.000016970576,0.00039923217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822146,0.00011972104,0.00030024518,0.00051020936,0.0004087488,0.0004396005],"domain_scores_gemma":[0.99845105,0.00019493308,0.000115630035,0.000853214,0.00017530336,0.00020987683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030574814,0.00021472765,0.0002521384,0.00018342804,0.000505288,0.00008393487,0.00078542647,0.000089191504,0.000018409713],"category_scores_gemma":[0.000070859845,0.0002029461,0.00010611411,0.00078108767,0.0001622176,0.0002839009,0.00017831675,0.00024027628,0.00032456263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010433415,0.00018883334,0.0012026449,0.000005000459,0.0000140192315,0.000055676483,0.00018534585,0.00011080177,0.0011243925,0.9773597,0.019634617,0.000108551394],"study_design_scores_gemma":[0.0011152629,0.00030774882,0.0012422937,0.000030912157,0.00000414977,0.000029209259,0.0000038073038,0.0070995525,0.00251349,0.9840718,0.0033010761,0.00028072397],"about_ca_topic_score_codex":0.00013996982,"about_ca_topic_score_gemma":0.000005534905,"teacher_disagreement_score":0.01633354,"about_ca_system_score_codex":0.000033861124,"about_ca_system_score_gemma":0.00006721562,"threshold_uncertainty_score":0.8275902},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99596184,0.00211591,0.00006420889,0.00040674504,0.0009179704,0.0000740435,6.3336586e-7,0.00011930285,0.00033934147],"genre_scores_gemma":[0.99726516,0.0007311732,0.0017810274,0.00014606043,7.3003963e-7,0.0000043652176,6.45714e-7,0.000006528596,0.00006428643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990848,0.000035201396,0.00020878323,0.0002587,0.00020242685,0.00021014214],"domain_scores_gemma":[0.9993003,0.00005798644,0.0000781891,0.00039358856,0.00008191174,0.00008801098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020972146,0.00011012652,0.00017340925,0.00014524473,0.00008577895,0.000046875208,0.00033582788,0.000049375467,0.0000015900976],"category_scores_gemma":[0.000023418399,0.00009842192,0.000044141158,0.00039703958,0.00009765749,0.00027658427,0.00015667063,0.000086779575,0.000008885949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003110651,0.000065098226,0.0048512644,0.000008512072,0.000011910203,0.00001231034,0.00018972148,0.0000030429042,0.0025992433,0.98881495,0.0005103142,0.0029304938],"study_design_scores_gemma":[0.00056174985,0.00011888735,0.0038459732,0.000019494957,0.000005505377,0.000020267964,0.000019562414,0.0008665074,0.0041489024,0.9897057,0.0005647386,0.00012275818],"about_ca_topic_score_codex":0.00006834553,"about_ca_topic_score_gemma":0.000001395983,"teacher_disagreement_score":0.0028077357,"about_ca_system_score_codex":0.0000056216486,"about_ca_system_score_gemma":0.000027188786,"threshold_uncertainty_score":0.40135294},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9585425,0.00047808507,0.031895835,0.00096677034,0.0018306505,0.00048546976,0.000008838379,0.00038454108,0.0054073064],"genre_scores_gemma":[0.98948145,0.000046045065,0.010296341,0.00010117839,0.000001908162,0.000017906754,0.0000026230214,0.000014957606,0.000037619044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835384,0.00010000586,0.00028331546,0.00039132728,0.0004558702,0.00041564464],"domain_scores_gemma":[0.998501,0.00014255675,0.00011222398,0.00093159365,0.00015626768,0.00015636726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004537193,0.0001610331,0.00023881202,0.00031797795,0.000112279726,0.000036997943,0.001447049,0.00008582996,0.000006315971],"category_scores_gemma":[0.00007868901,0.0001573363,0.00013076162,0.0012673347,0.00020635298,0.00045162626,0.0001968928,0.00025618382,0.00003959984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000136614635,0.00012908684,0.0012798025,0.000013876481,0.000021358963,0.000028836725,0.00023378448,0.000038793496,0.0012908303,0.9960259,0.00012290027,0.00080116215],"study_design_scores_gemma":[0.00094181986,0.00023070085,0.0020057007,0.000026580541,0.0000027680967,0.000012168034,0.000017712382,0.000033943816,0.01669794,0.9796345,0.00023360226,0.0001625428],"about_ca_topic_score_codex":0.000041719068,"about_ca_topic_score_gemma":0.000005850633,"teacher_disagreement_score":0.03093892,"about_ca_system_score_codex":0.000043332057,"about_ca_system_score_gemma":0.00011086744,"threshold_uncertainty_score":0.6415988},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96447074,0.00024647053,0.0000029589296,0.001388012,0.00078943034,0.00019171774,0.000007879338,0.000024479574,0.032878317],"genre_scores_gemma":[0.99954635,0.000033889803,0.0000045302836,0.00025626327,0.00001187587,0.000010068186,0.0000015611276,0.000004663223,0.00013082605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989326,0.00027237594,0.00012889046,0.00012975006,0.00036209667,0.00017429411],"domain_scores_gemma":[0.9991858,0.00044762556,0.00007830436,0.00019325143,0.00005520598,0.00003983994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000312454,0.00007900525,0.000101201884,0.00004176562,0.00067512685,0.000030454217,0.00021124363,0.000057785193,0.000047116493],"category_scores_gemma":[0.000050740528,0.000050326616,0.00011570419,0.00052698713,0.00061729504,0.000048202408,0.000025747808,0.00011178837,0.0000052174123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008975677,0.00008513236,0.008018199,0.0000032101132,0.0000075861512,5.2479595e-7,0.0005725219,0.000009985852,0.0001654452,0.98677844,0.0042014727,0.00014850587],"study_design_scores_gemma":[0.0004120537,0.00011312491,0.048227906,0.00004659681,0.00005489715,5.0750515e-7,0.00064164255,0.00001780066,0.0006350026,0.9179872,0.031709578,0.00015366208],"about_ca_topic_score_codex":0.002231549,"about_ca_topic_score_gemma":0.00015277785,"teacher_disagreement_score":0.06879121,"about_ca_system_score_codex":0.000028667215,"about_ca_system_score_gemma":0.000029339773,"threshold_uncertainty_score":0.5192598},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9935929,0.00039684097,0.0029893748,0.0006445882,0.0007881654,0.00046002943,0.000003834447,0.00011836957,0.0010058678],"genre_scores_gemma":[0.9915588,0.000024494135,0.008295037,0.00002758715,0.000001715112,0.000049570837,0.0000014098578,0.000013252015,0.00002814709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980402,0.00012226086,0.00033274048,0.0004104195,0.00064067723,0.00045371056],"domain_scores_gemma":[0.9982542,0.00013424185,0.00010641163,0.0012338092,0.00012833888,0.0001430028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059938995,0.000152173,0.00024151638,0.0004557679,0.000079170335,0.000043383505,0.0020221153,0.00008959731,0.000006564585],"category_scores_gemma":[0.00022385699,0.00014315436,0.00008239513,0.001623654,0.00018778397,0.00041722515,0.00079189945,0.00036220948,0.000017385437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010716594,0.00027848734,0.011242863,0.0000151124605,0.000009648713,0.000056881687,0.00035919,0.000084917316,0.00073469186,0.9851832,0.000026614267,0.001997693],"study_design_scores_gemma":[0.0018868909,0.00017842941,0.017053429,0.00007927519,0.0000020371285,0.000010174426,0.00003555015,0.00012630838,0.009182885,0.97125536,0.000043162294,0.00014650759],"about_ca_topic_score_codex":0.000053720014,"about_ca_topic_score_gemma":0.00004516853,"teacher_disagreement_score":0.013927835,"about_ca_system_score_codex":0.00009276231,"about_ca_system_score_gemma":0.00015665455,"threshold_uncertainty_score":0.5837666},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9805983,0.00008331802,0.00005836698,0.000008868242,0.001111236,0.00031082955,0.0000024676579,0.0001740282,0.017652636],"genre_scores_gemma":[0.9997361,0.0000057804536,0.00005089963,0.0000133820195,0.000013019154,0.000034930672,0.0000034039,0.000033057993,0.00010945565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99910617,0.000033112792,0.00020564056,0.0001679657,0.00014937967,0.00033775766],"domain_scores_gemma":[0.99954796,0.00013132382,0.0000342574,0.00018603861,0.00003496576,0.000065484564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003845585,0.0001717569,0.00021954789,0.00015712259,0.000044370074,0.00002446024,0.00014377684,0.00010737987,0.0000085513275],"category_scores_gemma":[0.000013794803,0.00015273967,0.00003034555,0.00040060334,0.00003503034,0.00012327501,0.000013251325,0.00020596008,0.000037146332],"study_design_candidate":"observational","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.00055516313,0.0003572671,0.3696408,0.00046578547,0.00031002003,0.0008895968,0.007012015,0.0018678186,0.005637749,0.60885483,0.0031326343,0.0012763147],"study_design_scores_gemma":[0.0113253165,0.0017950992,0.64345753,0.0009745652,0.00009854638,0.00035653755,0.010890153,0.0035263572,0.045871194,0.26734653,0.011674461,0.0026837082],"about_ca_topic_score_codex":0.00006899498,"about_ca_topic_score_gemma":0.00027991255,"teacher_disagreement_score":0.3415083,"about_ca_system_score_codex":0.00007441598,"about_ca_system_score_gemma":0.000022930062,"threshold_uncertainty_score":0.6228543},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9701511,0.0003171628,0.0007142377,0.00058972446,0.00400604,0.0005953978,0.0000045843376,0.0007729149,0.022848817],"genre_scores_gemma":[0.89221257,0.00008833433,0.002886481,0.00028372608,0.000049880546,0.00012143914,0.000007183097,0.00011201353,0.1042384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981262,0.00006267963,0.0005333159,0.00033358834,0.0004819626,0.0004622619],"domain_scores_gemma":[0.99844086,0.00045551322,0.00013781538,0.0006188955,0.00015456493,0.00019234607],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003310047,0.00025739326,0.000395213,0.00018721174,0.00020534718,0.000118390206,0.00033689165,0.00013159629,0.00054452394],"category_scores_gemma":[0.00093818776,0.00025850072,0.00012937997,0.00041218902,0.000095394564,0.0006776079,0.00019975979,0.00023723878,0.0014979056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019973768,0.00015413848,0.00015679977,0.000062927465,0.000059261416,0.00003726003,0.0004078281,0.000006762481,0.00019500457,0.970197,0.028623182,0.00007986688],"study_design_scores_gemma":[0.0006492018,0.00011531655,0.00026285998,0.00007480471,0.00006311384,0.000030795916,0.00045814808,0.000024586601,0.00043681322,0.99477273,0.0028084584,0.00030315277],"about_ca_topic_score_codex":0.000008386757,"about_ca_topic_score_gemma":0.0000044245453,"teacher_disagreement_score":0.08138958,"about_ca_system_score_codex":0.00013343892,"about_ca_system_score_gemma":0.000027885206,"threshold_uncertainty_score":0.9999867},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98235327,0.000059202765,0.00011570983,0.00013264744,0.00025912377,0.00017357724,0.000008212503,0.00009080373,0.016807467],"genre_scores_gemma":[0.99872434,0.0000025513639,0.00038062208,0.000024895844,0.000009197819,0.000028231294,0.000005272938,0.000019225348,0.00080565957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992142,0.00003784442,0.00027471446,0.0001471607,0.00015712503,0.00016896769],"domain_scores_gemma":[0.9991706,0.00019977665,0.00012354564,0.0004019858,0.00006684332,0.00003723653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019765907,0.000109755085,0.00018522228,0.00006926704,0.00007856883,0.000009340824,0.00020693785,0.00007715334,0.000068927075],"category_scores_gemma":[0.00004541977,0.00010659227,0.00008590676,0.0002740474,0.000088838584,0.000052993684,0.00004230217,0.00009686703,0.000030046744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065172576,0.00030288807,0.0029806031,0.000023882649,0.000013398887,9.785263e-7,0.000063029074,0.000001428583,0.0027106446,0.9893924,0.004364473,0.0001397305],"study_design_scores_gemma":[0.00043695702,0.000025489317,0.0029140003,0.000016490609,0.000017434542,0.0000023743576,0.00003893352,0.00002207405,0.018319657,0.97642374,0.001673924,0.000108949695],"about_ca_topic_score_codex":0.000054277178,"about_ca_topic_score_gemma":0.000006816008,"teacher_disagreement_score":0.016371088,"about_ca_system_score_codex":0.000015227464,"about_ca_system_score_gemma":0.000021535532,"threshold_uncertainty_score":0.43467066},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98668736,0.0005078297,0.0032099579,0.0002983351,0.0015762565,0.00043495247,0.0000039680112,0.000093212184,0.007188135],"genre_scores_gemma":[0.9949846,0.000036366622,0.004822504,0.000022091963,0.0000013033255,0.0000137895895,0.0000012277725,0.000007283104,0.00011083209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998475,0.000270514,0.00031295055,0.00030925797,0.0003532445,0.00027899706],"domain_scores_gemma":[0.9988122,0.00028571975,0.000107139625,0.00061440474,0.000116482726,0.00006403642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011452972,0.00009812121,0.00016637587,0.00035109848,0.00004359718,0.000024462877,0.000636429,0.00005777064,0.0000023728203],"category_scores_gemma":[0.0004478551,0.000100072706,0.000047614183,0.001146061,0.00008255874,0.00059680094,0.00010223728,0.00016401877,0.000014413402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022008326,0.000109909335,0.00079848286,0.000007740576,0.0000041766675,0.000009399117,0.0002018721,0.00001997808,0.00080365397,0.9958492,0.000108185384,0.0020653836],"study_design_scores_gemma":[0.0016746934,0.00010724051,0.0032699993,0.000018202398,8.492533e-7,0.0000023003581,0.000024346833,0.0005773203,0.014440034,0.9794222,0.00036077373,0.00010201889],"about_ca_topic_score_codex":0.000011503762,"about_ca_topic_score_gemma":0.0000043526297,"teacher_disagreement_score":0.016426988,"about_ca_system_score_codex":0.00004807136,"about_ca_system_score_gemma":0.00005803641,"threshold_uncertainty_score":0.40808466},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99374336,0.0015777223,0.0005169195,0.000013384345,0.0003349793,0.0001612127,0.0000029139676,0.0004724388,0.0031770973],"genre_scores_gemma":[0.99835,0.00048492366,0.0010950577,0.000008852726,0.0000020201928,0.000010866727,0.0000028437469,0.000022516828,0.000022884058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994377,0.000017941877,0.0001817993,0.000119961944,0.00010402454,0.00013859397],"domain_scores_gemma":[0.9996692,0.000026852113,0.00003321595,0.00018704483,0.00003496501,0.000048743423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000088298184,0.00011208368,0.00014973705,0.00020810527,0.000037695547,0.00001496241,0.000083377614,0.00010253173,0.00001925196],"category_scores_gemma":[0.000014290689,0.00012044305,0.000042389896,0.0003887075,0.00005020183,0.00012743713,0.000014806934,0.000102888174,0.0000018029262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005841205,0.00018436609,0.041320536,0.0003338048,0.00017497783,0.000012051403,0.0021455048,0.00009763733,0.1207792,0.7753761,0.008980697,0.050589275],"study_design_scores_gemma":[0.0014532456,0.00023496714,0.020292543,0.00020756236,0.00007092687,0.00002757448,0.000101639176,0.026564132,0.20042697,0.7492393,0.00065435626,0.00072677765],"about_ca_topic_score_codex":0.000009995723,"about_ca_topic_score_gemma":7.975618e-7,"teacher_disagreement_score":0.079647765,"about_ca_system_score_codex":0.000007641213,"about_ca_system_score_gemma":0.0000012361749,"threshold_uncertainty_score":0.4911525},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.947574,0.00048755482,0.042564746,0.0005275701,0.0025404505,0.00037179416,7.1481435e-7,0.0001396275,0.0057935505],"genre_scores_gemma":[0.9978458,0.000031367777,0.001923307,0.000034112152,0.0000041458716,0.0000065585023,4.8058024e-7,0.000008413367,0.0001457632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866086,0.000076363904,0.00024697097,0.00020839572,0.0004361771,0.0003712501],"domain_scores_gemma":[0.9982399,0.0008080597,0.00012147652,0.0005918203,0.0001630263,0.0000757677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001955068,0.00009041723,0.00011038362,0.00013399567,0.0002698382,0.000053129803,0.0010316389,0.000044652657,0.000001607492],"category_scores_gemma":[0.00018215022,0.00007041155,0.00007307429,0.00073813164,0.00016866125,0.0005529666,0.00021588105,0.00015926361,0.000011752615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015336534,0.000024956915,0.00081726495,0.0000048280895,0.000010100891,0.000003964292,0.00023116855,0.000005676176,0.0013768225,0.9817959,0.00011223599,0.01560171],"study_design_scores_gemma":[0.00039178747,0.00005905651,0.002669261,0.000009400877,0.0000017071778,0.0000031148982,0.00007189025,0.0004848579,0.022727208,0.97299963,0.0005024897,0.000079592224],"about_ca_topic_score_codex":0.000012317515,"about_ca_topic_score_gemma":0.000007225188,"teacher_disagreement_score":0.050271858,"about_ca_system_score_codex":0.000047194106,"about_ca_system_score_gemma":0.0000337305,"threshold_uncertainty_score":0.28712997},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31266913,0.00056730624,0.64602333,0.0038956292,0.031664558,0.0011618295,0.000012754035,0.0003879208,0.0036175647],"genre_scores_gemma":[0.99818075,0.0000025568188,0.0011183799,0.00031049867,0.000036673377,0.00006067863,0.000005556629,0.0000068753525,0.0002780526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917924,0.00006349419,0.00016531826,0.0001851285,0.00023543162,0.00017137041],"domain_scores_gemma":[0.99909043,0.0002805616,0.00007322204,0.00030082488,0.00018416798,0.00007077556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068276346,0.000082507926,0.0000950872,0.00003605506,0.00027615513,0.00014957067,0.000514993,0.000043712378,0.000005372666],"category_scores_gemma":[0.00003535169,0.000057315985,0.000069652,0.00015083578,0.000022279291,0.00027558213,0.00012955713,0.00008698767,0.000024947276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000623579,0.000020090813,0.000059434155,0.000003123151,0.000014104792,9.1709853e-7,0.0006705665,0.00031730346,0.000023081273,0.9746296,0.023918675,0.00033689244],"study_design_scores_gemma":[0.0005345544,0.00009508063,0.00017902526,0.0000124525195,0.000003676491,0.000012706898,0.00015068943,0.05938524,0.000079993864,0.9210973,0.018362159,0.00008714611],"about_ca_topic_score_codex":0.000034777488,"about_ca_topic_score_gemma":0.0000069558423,"teacher_disagreement_score":0.6855116,"about_ca_system_score_codex":0.000044107983,"about_ca_system_score_gemma":0.00005139316,"threshold_uncertainty_score":0.23372781},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8972961,0.000082560604,0.000006590429,0.0089605255,0.0009782349,0.00019412326,0.000009078518,0.000085879496,0.09238696],"genre_scores_gemma":[0.99709266,0.000117048825,0.000045295827,0.0013863007,0.000043282387,0.000008200791,0.0000025115953,0.00000933828,0.0012953538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907464,0.00007984546,0.000113534596,0.00017755004,0.00029919387,0.00025525436],"domain_scores_gemma":[0.99951017,0.000080836915,0.00004179101,0.00016179279,0.000045966543,0.00015945113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025636266,0.00008559068,0.000093212206,0.000052824398,0.00050539186,0.000076499135,0.00015524784,0.00007931302,0.00014637072],"category_scores_gemma":[0.00006946792,0.00007982526,0.000028438133,0.00018593976,0.00009651423,0.00015782278,0.000050940325,0.00013684721,0.000025352845],"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.0000030005594,0.00013202567,0.002768171,4.4285946e-7,0.00000816087,0.0000017960366,0.0019921225,0.000002181583,0.000030208092,0.98446864,0.0010203717,0.009572883],"study_design_scores_gemma":[0.0013725327,0.00011497932,0.16719264,0.000023038057,0.0000211225,4.914608e-7,0.0009251092,0.000046304493,0.00015902592,0.39456975,0.4353053,0.00026971629],"about_ca_topic_score_codex":0.00089355133,"about_ca_topic_score_gemma":0.0016699883,"teacher_disagreement_score":0.5898989,"about_ca_system_score_codex":0.00010394762,"about_ca_system_score_gemma":0.00008506407,"threshold_uncertainty_score":0.38871163},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91921234,0.0007168579,0.026213747,0.006528725,0.0044566193,0.0006291912,0.000025015224,0.001265993,0.04095149],"genre_scores_gemma":[0.9854784,0.00002672506,0.013438682,0.00034309513,0.000014645535,0.000049274982,0.0000058775086,0.000009032544,0.00063429406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884105,0.000041267427,0.00017544214,0.00037106028,0.00031831788,0.00025283828],"domain_scores_gemma":[0.99899596,0.00009118641,0.00005700762,0.00064534706,0.00009668679,0.000113825125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009305798,0.00013209163,0.000114552975,0.000102483784,0.0005137955,0.000022006514,0.0007023985,0.0000450942,0.000024738094],"category_scores_gemma":[0.000016189415,0.00013262566,0.000077822195,0.00060388393,0.00009294452,0.0003301474,0.00014616134,0.00015898042,0.0004370208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012835624,0.00019288696,0.0009317731,0.0000010015658,0.0000074514655,0.000015266567,0.000075623524,0.000053404325,0.00007369606,0.98311347,0.014718192,0.0008159797],"study_design_scores_gemma":[0.0006024572,0.00009791553,0.08398783,0.000007655103,0.0000022671957,0.00008214893,0.000004686074,0.008014618,0.00022169267,0.89757943,0.009193721,0.00020558275],"about_ca_topic_score_codex":0.000024706678,"about_ca_topic_score_gemma":4.9563994e-7,"teacher_disagreement_score":0.085534014,"about_ca_system_score_codex":0.00006573668,"about_ca_system_score_gemma":0.00009735019,"threshold_uncertainty_score":0.5617164},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9790458,0.0012383211,0.0036338288,0.0013107215,0.00862355,0.0005399282,0.000020585732,0.0006196534,0.004967608],"genre_scores_gemma":[0.9991386,0.000018604178,0.00028403162,0.00014062732,0.000083590036,0.000034625922,0.000008402964,0.000013566107,0.00027796463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818766,0.0002014922,0.0003671849,0.0005390384,0.00032236922,0.00038225937],"domain_scores_gemma":[0.9987583,0.00023448613,0.0001377396,0.00070084346,0.000061808576,0.000106803316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054884964,0.00021483579,0.0002732957,0.0001434547,0.00024079732,0.00031373822,0.0005886262,0.000094123396,0.0000013620245],"category_scores_gemma":[0.000031424745,0.00019458587,0.00008271726,0.00038313828,0.00008380694,0.00038894996,0.00016330111,0.00016362705,0.00003290836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008569742,0.00013778788,0.0003909742,0.000011879802,0.000014854792,0.000022776278,0.00006140935,0.00016136344,0.00019535133,0.9931259,0.0053481874,0.00044379523],"study_design_scores_gemma":[0.0037040894,0.00047219693,0.0049571055,0.000054142172,0.000014996795,0.000020501242,0.000020787365,0.007648372,0.0004600706,0.947382,0.034806177,0.00045959008],"about_ca_topic_score_codex":0.00011610903,"about_ca_topic_score_gemma":0.0000036096997,"teacher_disagreement_score":0.045743953,"about_ca_system_score_codex":0.000027191638,"about_ca_system_score_gemma":0.000029576482,"threshold_uncertainty_score":0.7934981},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99722874,0.00006824163,0.000011414328,0.00007039374,0.000084257445,0.00022738094,0.000011778278,0.000015458576,0.0022823547],"genre_scores_gemma":[0.9993086,0.000035083445,0.00046473977,0.000003950273,0.0000018216178,0.00001897621,0.0000010113037,0.000012800437,0.00015300208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991236,0.000062941814,0.00031644848,0.000108218104,0.00025084268,0.0001379691],"domain_scores_gemma":[0.99839914,0.00069195847,0.00030165154,0.0004530618,0.00011733175,0.000036882924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002840989,0.000097732394,0.0002430529,0.00003861998,0.000117678734,0.0000035408434,0.00028071512,0.00004748062,0.00001704412],"category_scores_gemma":[0.00009162398,0.00006720186,0.00009876494,0.00030950655,0.00041856288,0.00003716186,0.000032668213,0.000109148976,0.0000011043812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000687217,0.0002533335,0.005032563,0.000039847266,0.000093798706,0.0000018781795,0.0011474012,0.0000010846986,0.0020792393,0.9908631,0.0003958407,0.000023195524],"study_design_scores_gemma":[0.0007479711,0.00020125287,0.008791367,0.000027590659,0.000043240478,0.000015490199,0.00027133265,0.0000040016794,0.029932832,0.95977944,0.00011625878,0.00006921612],"about_ca_topic_score_codex":0.000024516268,"about_ca_topic_score_gemma":0.00000980462,"teacher_disagreement_score":0.031083649,"about_ca_system_score_codex":0.000010293812,"about_ca_system_score_gemma":0.000056320514,"threshold_uncertainty_score":0.2740412},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950773,0.00035980545,0.002114169,0.0007598778,0.00040084313,0.0009348595,0.000003049044,0.000021490523,0.00032858588],"genre_scores_gemma":[0.9984049,0.000027746804,0.0012930119,0.000019507252,0.0000029961182,0.000056681052,3.0849293e-7,0.0000065413747,0.00018827358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915683,0.00008827211,0.00018865004,0.0001895116,0.00021469891,0.00016202976],"domain_scores_gemma":[0.9986832,0.0004015364,0.00010964841,0.00065862003,0.00012198329,0.000025027099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006304652,0.00007837746,0.00012848659,0.000042932315,0.0001573662,0.00002937259,0.0007671121,0.00002322274,0.0000054197435],"category_scores_gemma":[0.00014101258,0.000046825433,0.00006736657,0.00054108654,0.00029731353,0.00020693488,0.000105294006,0.00007858735,5.020422e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044985085,0.00009211476,0.00051037397,0.00008575071,0.000043322325,1.5231105e-7,0.0011926289,0.00001848366,0.009514274,0.950073,0.00015247778,0.038272414],"study_design_scores_gemma":[0.0008759047,0.00014356746,0.005553015,0.000026845933,0.00001282348,0.0000041569865,0.000041991825,0.008347211,0.027392846,0.957285,0.00024057366,0.000076105476],"about_ca_topic_score_codex":0.000021609867,"about_ca_topic_score_gemma":0.000004713486,"teacher_disagreement_score":0.03819631,"about_ca_system_score_codex":0.000014493087,"about_ca_system_score_gemma":0.00004791346,"threshold_uncertainty_score":0.19094858},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99195534,0.00027544092,0.00007247967,0.000062300816,0.0016885394,0.00026620866,0.00000909485,0.00020364614,0.0054669706],"genre_scores_gemma":[0.99976295,0.0000046023447,0.00004653069,0.000085004955,0.000009977165,0.000027748245,0.0000029931246,0.000034018267,0.000026169102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991028,0.000033287084,0.0002475773,0.00017726683,0.00019780266,0.00024128288],"domain_scores_gemma":[0.9994259,0.00007558896,0.00004278701,0.00030885654,0.00005314576,0.0000937068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001738526,0.00019553663,0.00029429488,0.00011935616,0.000057732123,0.000028843633,0.00021679381,0.000081140606,0.000021279513],"category_scores_gemma":[0.00004248779,0.00018749158,0.00007724849,0.00029512402,0.000026868249,0.00007941216,0.000029528315,0.00015764819,0.00008536986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045498822,0.00006348809,0.0003564559,0.000119992284,0.00008844868,0.00001685782,0.0066454164,0.0037657062,0.01988825,0.96818835,0.00064465485,0.00017690624],"study_design_scores_gemma":[0.0050526266,0.0012048732,0.002487593,0.0011016512,0.00004262239,0.000028865548,0.0012916668,0.00015273989,0.14990042,0.83172745,0.006185979,0.00082354515],"about_ca_topic_score_codex":0.000058201655,"about_ca_topic_score_gemma":0.00008110947,"teacher_disagreement_score":0.1364609,"about_ca_system_score_codex":0.00008902695,"about_ca_system_score_gemma":0.000019773122,"threshold_uncertainty_score":0.76456845},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99185765,0.00085912336,0.0000021501196,0.00001547139,0.0012430144,0.00007664433,0.000007839378,0.00020347828,0.0057346215],"genre_scores_gemma":[0.9998071,0.00001533088,0.00003484169,0.000015248575,0.0000057731045,0.000006489562,0.00000770323,0.000020147243,0.000087358814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926955,0.000037036694,0.0002433612,0.000095182506,0.00017447115,0.00018037544],"domain_scores_gemma":[0.999603,0.00007031483,0.000050124516,0.00017110464,0.000049774735,0.000055682962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022227682,0.000111594425,0.0001889427,0.00009799463,0.000036788457,0.000007656836,0.00013364319,0.00008967523,0.000069011505],"category_scores_gemma":[0.00002098819,0.00011414647,0.00008709372,0.00032426007,0.00002799878,0.00009716795,0.000015634463,0.00010731272,0.00006314805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011817049,0.00018928135,0.0050230264,0.00006376366,0.00022438052,0.000005881291,0.00034617874,0.0052359477,0.0106402105,0.963839,0.013251818,0.0011687146],"study_design_scores_gemma":[0.0037553953,0.00018366262,0.019640686,0.00024892995,0.000115702685,0.00001915924,0.00011761894,0.015141829,0.052162506,0.8963241,0.011312711,0.0009776733],"about_ca_topic_score_codex":0.00000703008,"about_ca_topic_score_gemma":0.0000032707387,"teacher_disagreement_score":0.06751486,"about_ca_system_score_codex":0.00003180525,"about_ca_system_score_gemma":0.000008071903,"threshold_uncertainty_score":0.4654758},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85674554,0.00017342258,0.0039129937,0.00019578036,0.0028746205,0.0010683793,0.000020109646,0.00039643506,0.1346127],"genre_scores_gemma":[0.9920195,0.0000016032816,0.0072300015,0.0000123231275,0.000038673068,0.000050135182,0.0000048402153,0.000065209286,0.0005777329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980227,0.00011792059,0.0006434716,0.0002968086,0.0005162822,0.0004028397],"domain_scores_gemma":[0.9974566,0.0011950297,0.00035296025,0.0006891182,0.00022727612,0.000078997815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059182226,0.0002805079,0.0006099733,0.000086380096,0.00009460926,0.000023683637,0.00039961832,0.00015193938,0.00008365964],"category_scores_gemma":[0.0010673528,0.0002458091,0.00016329139,0.00035295932,0.00033957735,0.00019038605,0.00014380581,0.0002115557,0.000018714345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056364708,0.0006849712,0.00012932242,0.00018554518,0.000031739117,0.000007512977,0.0001412785,0.000002471027,0.0007136823,0.9957868,0.0021075804,0.00015273047],"study_design_scores_gemma":[0.0013793643,0.00015151144,0.000028004237,0.00008489569,0.000047091795,0.000007042163,0.000069044065,0.0000364908,0.047852747,0.9492449,0.0008519565,0.00024693235],"about_ca_topic_score_codex":0.000010481586,"about_ca_topic_score_gemma":0.0000017155994,"teacher_disagreement_score":0.13527392,"about_ca_system_score_codex":0.000068140536,"about_ca_system_score_gemma":0.000055386772,"threshold_uncertainty_score":0.9999994},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9870029,0.0000832006,0.006907618,0.00023464639,0.0011306701,0.0008347866,0.0000069967623,0.000024977087,0.0037742238],"genre_scores_gemma":[0.9972096,0.0000060003413,0.0024127143,0.00012331853,0.000009034704,0.00008482928,0.0000012236712,0.000017267463,0.00013598536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993908,0.000041280757,0.00017729485,0.00014599496,0.00012172495,0.0001229487],"domain_scores_gemma":[0.9987469,0.0007350986,0.000089523586,0.00029299487,0.00010078072,0.000034703844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044246038,0.00009788992,0.0001429988,0.00002817769,0.00018531898,0.000020587922,0.000115790885,0.00007186577,0.000023022874],"category_scores_gemma":[0.0003789515,0.000066697394,0.000053653905,0.00011018318,0.00007040121,0.000041306677,0.00004138295,0.00006292121,0.0000017762393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024824438,0.000033067514,0.0011166178,0.000030087538,0.000028193632,7.3007776e-8,0.0006432158,0.0000010046211,0.0003010504,0.99563956,0.00093821215,0.0012440612],"study_design_scores_gemma":[0.0005374031,0.00004980521,0.0010440464,0.000008010229,0.00004063421,0.000004208421,0.00008658785,0.000058223697,0.0039335196,0.9831045,0.011045677,0.000087352026],"about_ca_topic_score_codex":0.000003925205,"about_ca_topic_score_gemma":0.000001663156,"teacher_disagreement_score":0.012535059,"about_ca_system_score_codex":0.000017093857,"about_ca_system_score_gemma":0.000011634489,"threshold_uncertainty_score":0.27198407},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37219477,0.001667009,0.44937807,0.0005656994,0.0076041003,0.0054590967,0.00016659498,0.009599646,0.15336502],"genre_scores_gemma":[0.52106494,0.000115690294,0.4769348,0.0001191154,0.000049742062,0.0002214163,0.00012425956,0.00013623913,0.0012338179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992233,0.00001645761,0.00019699633,0.0001744522,0.00009767039,0.00029111808],"domain_scores_gemma":[0.9996127,0.000029328205,0.000019689567,0.00019581005,0.000042288902,0.000100200625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013673033,0.00014571268,0.00014308891,0.000043531683,0.000101139434,0.00007782057,0.00015434969,0.000086113054,0.00032065512],"category_scores_gemma":[0.000003673351,0.00015983635,0.000049337483,0.00014093705,0.000015970278,0.0002089498,0.000006184118,0.000103310864,0.00006230878],"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.000013541902,0.00011653942,0.00009569572,0.000063131534,0.000054457192,0.0000033630615,0.00079613394,0.7031518,0.00008388124,0.02388828,0.004149179,0.26758394],"study_design_scores_gemma":[0.0011138098,0.00011901632,0.00003727787,0.000024731218,0.00001278344,0.0000053255003,0.00002249119,0.9572283,0.00028817652,0.015034883,0.025838604,0.0002746141],"about_ca_topic_score_codex":0.0000045064203,"about_ca_topic_score_gemma":4.7737365e-7,"teacher_disagreement_score":0.26730934,"about_ca_system_score_codex":0.000029121265,"about_ca_system_score_gemma":0.000013187236,"threshold_uncertainty_score":0.65179366},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11354506,0.000064903135,0.7630694,0.026520995,0.005033095,0.0005926694,0.0000051682914,0.00093909394,0.0902296],"genre_scores_gemma":[0.28850338,0.000008023013,0.71008265,0.0007179935,0.00003834301,0.000028711114,0.0000010172724,0.000010034668,0.0006098456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892664,0.00006917845,0.00018578827,0.00030957177,0.00022969558,0.00027911764],"domain_scores_gemma":[0.9990714,0.00010516757,0.000044194643,0.0005079026,0.00006356076,0.00020777198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024361686,0.0001113862,0.00014473185,0.00005888751,0.00012526088,0.00011822044,0.00068097364,0.000042856518,0.000019500836],"category_scores_gemma":[0.00006359929,0.00010481002,0.00005270701,0.00057987485,0.000020989639,0.00034196154,0.00021072464,0.000114012386,0.0005098808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.447422e-7,0.0000888898,0.00014570454,0.0000016728358,0.0000046555265,0.0000027995457,0.00022722779,0.000013829154,0.00016055841,0.890331,0.0030611153,0.10596175],"study_design_scores_gemma":[0.0005181606,0.00015641078,0.0033635267,0.0000139035,0.0000059141394,0.00001169182,0.000024129551,0.01862214,0.0017467615,0.89541036,0.079745024,0.0003819831],"about_ca_topic_score_codex":0.000065670574,"about_ca_topic_score_gemma":0.0000031248312,"teacher_disagreement_score":0.17495833,"about_ca_system_score_codex":0.00005614534,"about_ca_system_score_gemma":0.000034043278,"threshold_uncertainty_score":0.6553656},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9807373,0.00019801996,0.0017885127,0.00017268519,0.0099144345,0.00025750732,0.0000015335416,0.00014364708,0.006786359],"genre_scores_gemma":[0.99964637,0.0000030563328,0.00011913722,0.00006232008,0.000035733225,0.000017892906,0.0000013165626,0.000009776817,0.00010440686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986879,0.00018847283,0.00025902397,0.00026899477,0.00025256156,0.0003430359],"domain_scores_gemma":[0.9987318,0.00019382859,0.00015384764,0.0006589165,0.00014154652,0.000120056204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040846376,0.00014327759,0.0002400229,0.00013437716,0.000101583566,0.000039733713,0.00044205977,0.000064132764,0.000010475182],"category_scores_gemma":[0.00011508277,0.00012699918,0.0000937191,0.0006180646,0.000036237085,0.00038596155,0.00008428317,0.00015606414,0.000039429528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068418117,0.00022656698,0.0075136214,0.000011303905,0.000021535825,0.0000014188113,0.00037576642,0.000012282623,0.00040634337,0.98470324,0.0055579864,0.0011630681],"study_design_scores_gemma":[0.0032268213,0.0016323779,0.20540267,0.0002532593,0.000042713826,0.00009415583,0.00013355364,0.009137256,0.04233384,0.72603947,0.010388145,0.0013157334],"about_ca_topic_score_codex":0.000085376254,"about_ca_topic_score_gemma":0.0000040173736,"teacher_disagreement_score":0.25866377,"about_ca_system_score_codex":0.000045108325,"about_ca_system_score_gemma":0.00003321651,"threshold_uncertainty_score":0.5178876},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94232136,0.00009749614,0.009772506,0.00026802058,0.00075011916,0.00012523246,0.0000025901668,0.0006647772,0.045997903],"genre_scores_gemma":[0.9840005,0.000006701165,0.015640998,0.00017962647,0.0000015512597,0.0000068973236,0.000001280364,0.000009369016,0.00015308784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990306,0.000022373632,0.00018678619,0.00024872026,0.00033113602,0.00018036482],"domain_scores_gemma":[0.99914104,0.00008342058,0.00009109661,0.00049515825,0.00012625974,0.00006304923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012037635,0.0001112679,0.0001518902,0.00009626678,0.000067252455,0.000045823377,0.0008107279,0.000046219644,0.000005213898],"category_scores_gemma":[0.00009641455,0.000106913954,0.000053218235,0.00034130638,0.00010563866,0.0005628574,0.00022205518,0.000103100785,0.000044799748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004034692,0.00018571291,0.00069337763,0.000009432234,0.000006139058,0.000041473144,0.00012480572,0.0000017364694,0.0002816397,0.9847797,0.006222304,0.0076496317],"study_design_scores_gemma":[0.00024364961,0.00020066193,0.0023914853,0.000038167087,0.0000014390596,0.000037812522,0.0000010565633,0.0011050786,0.03475415,0.96067077,0.00041029367,0.00014546621],"about_ca_topic_score_codex":0.000003825792,"about_ca_topic_score_gemma":1.5796557e-7,"teacher_disagreement_score":0.045844816,"about_ca_system_score_codex":0.000024218258,"about_ca_system_score_gemma":0.00009102429,"threshold_uncertainty_score":0.43598247},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9893875,0.0003017334,0.005676293,0.0011459704,0.0011130637,0.0001681976,0.000002510303,0.000401594,0.001803099],"genre_scores_gemma":[0.9928646,0.00000854358,0.0063737743,0.000462789,0.0000013566737,0.000019634434,0.000007316194,0.000013159598,0.00024882256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876475,0.000027082706,0.00018163225,0.0004123173,0.0003116265,0.00030255862],"domain_scores_gemma":[0.9990501,0.000037347134,0.00009989258,0.00054039294,0.00014164121,0.00013062189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018188135,0.0001561158,0.00015374033,0.000068520254,0.00025420636,0.000096598924,0.000421701,0.000045947236,0.000008515509],"category_scores_gemma":[0.000017588265,0.00013150802,0.000039348542,0.00048710886,0.00009069584,0.0003366174,0.00014115576,0.0001240981,0.00018024501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009648961,0.00008783808,0.0005808326,0.000007395748,0.000011088968,0.000027430398,0.00027380005,0.00023426823,0.0013377615,0.996614,0.0006295227,0.00018641804],"study_design_scores_gemma":[0.0027262846,0.00019361079,0.00036735,0.00007678468,0.000008061998,0.000032652235,0.0000074616883,0.000443537,0.007842472,0.98693955,0.001128397,0.00023384955],"about_ca_topic_score_codex":0.000055258777,"about_ca_topic_score_gemma":0.000021957281,"teacher_disagreement_score":0.009674456,"about_ca_system_score_codex":0.000101579804,"about_ca_system_score_gemma":0.00006783101,"threshold_uncertainty_score":0.53627414},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98351437,0.00008461485,0.000009944356,0.000027258768,0.0018888551,0.000099703204,0.000003802105,0.00016214712,0.014209295],"genre_scores_gemma":[0.9997708,0.000007704123,0.00011562794,0.000010182156,0.00002928132,0.00000772893,0.0000016833683,0.000017091414,0.000039867926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994446,0.00002431719,0.00018912149,0.00008767895,0.000118749216,0.00013552906],"domain_scores_gemma":[0.9997011,0.000042618285,0.000038469414,0.00015220088,0.000027174157,0.00003847331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010961182,0.00009615413,0.00014579887,0.00008738885,0.00003695895,0.000009408927,0.00008896108,0.000076928576,0.00004990147],"category_scores_gemma":[0.000010629549,0.00010145711,0.000056718185,0.00016208747,0.000030684478,0.00007707721,0.000008841153,0.0001046573,0.000090007365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018224133,0.000035751913,0.0015832346,0.000064009255,0.000029326362,0.0000017442693,0.00021367821,0.00088442693,0.0009109754,0.9928957,0.000624591,0.0027383396],"study_design_scores_gemma":[0.004108737,0.0005689386,0.014141048,0.00033605646,0.000113141614,0.00005950006,0.0007696661,0.0051660067,0.16203038,0.7789916,0.032704268,0.0010106758],"about_ca_topic_score_codex":0.0000042258257,"about_ca_topic_score_gemma":0.0000013314624,"teacher_disagreement_score":0.21390413,"about_ca_system_score_codex":0.00003657096,"about_ca_system_score_gemma":0.000004569947,"threshold_uncertainty_score":0.41373008},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89613265,0.0003132786,0.07420997,0.00039063272,0.006644701,0.0009184189,0.0000051458733,0.00035848978,0.021026725],"genre_scores_gemma":[0.922419,0.000002740587,0.07629014,0.00040390872,0.000025808497,0.000016037573,0.0000017163636,0.00003303249,0.00080759585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99495786,0.0008318998,0.0010398005,0.00074247655,0.0017296025,0.00069837115],"domain_scores_gemma":[0.9941455,0.003770007,0.0003229511,0.0010199924,0.00037325485,0.00036825924],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.010235237,0.00029093088,0.0005025743,0.00028833415,0.00024732726,0.0002745909,0.0012952423,0.00016455783,0.0003208074],"category_scores_gemma":[0.0028721953,0.00024536336,0.0001587254,0.00153742,0.0001820463,0.00039686682,0.0002770944,0.00024826004,0.0011858719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011127668,0.0008503338,0.026922328,0.000008202701,0.00010496947,0.00040988898,0.0017417122,0.00085921487,0.44467804,0.45680982,0.02761433,0.038888384],"study_design_scores_gemma":[0.0024657594,0.0007004546,0.04618728,0.000023689947,0.000021410891,0.000049594448,0.00045086985,0.0039832313,0.20011784,0.7326602,0.012613688,0.000726008],"about_ca_topic_score_codex":0.000027389971,"about_ca_topic_score_gemma":0.0000054395255,"teacher_disagreement_score":0.27585036,"about_ca_system_score_codex":0.00012142292,"about_ca_system_score_gemma":0.00010606596,"threshold_uncertainty_score":0.9999999},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9935267,0.000042955588,0.00078172144,0.00042818574,0.00006552042,0.00018921016,0.0000064345677,0.00003306053,0.0049262014],"genre_scores_gemma":[0.9747827,0.000027963844,0.02491706,0.000024163866,0.0000043145424,0.00004508515,0.0000086197815,0.0000123775,0.00017773868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993885,0.000017651939,0.00024514896,0.000112654234,0.00014021187,0.000095826304],"domain_scores_gemma":[0.9992414,0.00029965377,0.00010612175,0.00021493508,0.00008142388,0.000056425055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012689154,0.000078817284,0.00014608601,0.000050760475,0.00010000087,0.000015659754,0.00009717251,0.000037394133,0.00009088047],"category_scores_gemma":[0.00007059375,0.00007742769,0.000034453005,0.00014431184,0.00005389335,0.000052322288,0.000041662723,0.000057926554,0.000012957586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024286571,0.00021698061,0.0007564646,0.000041972307,0.00001902314,7.527803e-7,0.0004017202,7.58291e-7,0.002059721,0.99229735,0.0039441697,0.0002586792],"study_design_scores_gemma":[0.00032559625,0.000026815884,0.0013142054,0.000026433088,0.000022868982,0.000008568463,0.00007513465,0.00030175276,0.00089643156,0.99549043,0.0014318058,0.00007998488],"about_ca_topic_score_codex":0.000014732416,"about_ca_topic_score_gemma":0.0000090524245,"teacher_disagreement_score":0.02413534,"about_ca_system_score_codex":0.000015813324,"about_ca_system_score_gemma":0.000019270225,"threshold_uncertainty_score":0.31574097},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9482639,0.00024951776,0.0315842,0.0014522672,0.0018966453,0.00042881325,0.0000015639903,0.00048661724,0.015636466],"genre_scores_gemma":[0.99396974,0.000054968044,0.0045766584,0.00006475491,0.00000786494,0.000027321707,0.0000023972136,0.000012223138,0.0012840835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984779,0.00012920107,0.00019349603,0.0003741194,0.00047034284,0.00035496982],"domain_scores_gemma":[0.99876183,0.00017653687,0.000063573876,0.0007298528,0.0001313598,0.00013684871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035397703,0.00012975998,0.00014424304,0.00016891751,0.00026452605,0.00003960383,0.00094798487,0.000058765407,0.000023320647],"category_scores_gemma":[0.00012388977,0.00012816947,0.00006713902,0.0006395039,0.00013723267,0.00050498097,0.00023467971,0.00018321653,0.00015634614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012027281,0.0000988885,0.00043416757,0.0000030208973,0.0000073165193,0.00008517367,0.00045209812,0.000017975546,0.0013705542,0.9916483,0.0014352577,0.004435187],"study_design_scores_gemma":[0.0011562236,0.00015778691,0.008510394,0.000008718157,0.0000015909972,0.00004527833,0.000018946208,0.0027354432,0.0058000544,0.978752,0.0026126804,0.0002008493],"about_ca_topic_score_codex":0.000007880891,"about_ca_topic_score_gemma":0.0000017642096,"teacher_disagreement_score":0.045705818,"about_ca_system_score_codex":0.00007592239,"about_ca_system_score_gemma":0.00008047067,"threshold_uncertainty_score":0.52265996},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8692607,0.00044237715,0.000040252206,0.0021623136,0.00068678474,0.00012991558,0.00003499976,0.000018562921,0.12722407],"genre_scores_gemma":[0.99778396,0.000052333115,0.00009453851,0.00043726832,0.000016831707,0.00001345491,0.0000018048215,0.000016226566,0.0015835937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991425,0.000010181728,0.0004178696,0.00021856636,0.000023945244,0.00018689461],"domain_scores_gemma":[0.99913466,0.0001422314,0.00022730733,0.0004394555,0.000014151778,0.000042218133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041797227,0.0001074469,0.00025369957,0.000055897708,0.00006727022,0.000022033251,0.00031872734,0.000057464098,0.00052249554],"category_scores_gemma":[0.00006015033,0.00009319719,0.00009992094,0.000090420086,0.00008451114,0.00009746152,0.00003923725,0.000114350085,0.0005026497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010573453,0.0000697656,0.00049090706,0.0000041998824,0.000020947156,2.90948e-7,0.00030202256,0.00011645154,0.0000141362725,0.9968492,0.0018700743,0.00025147398],"study_design_scores_gemma":[0.00043028514,0.00008112759,0.00073764444,0.00000909223,0.0000024995431,9.264481e-7,0.000051128314,0.00091181224,0.00058367325,0.97476596,0.022296714,0.00012914141],"about_ca_topic_score_codex":0.000041302366,"about_ca_topic_score_gemma":0.0000040249006,"teacher_disagreement_score":0.12852322,"about_ca_system_score_codex":0.00005407742,"about_ca_system_score_gemma":0.000010466899,"threshold_uncertainty_score":0.64607126},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9687783,0.00003647276,0.000016508644,0.00012703719,0.00080799084,0.00014368843,0.000015722886,0.000020390886,0.030053904],"genre_scores_gemma":[0.99941623,3.065823e-7,0.000029015757,0.000019814113,0.000054526776,0.000008136637,0.000010360514,0.000014629981,0.00044698868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990606,0.000042659176,0.00027168434,0.0001818466,0.00021654142,0.00022672118],"domain_scores_gemma":[0.99923736,0.00008314575,0.00017002862,0.0003899192,0.00008498684,0.00003459013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012024939,0.00014528124,0.00020104116,0.000017347931,0.00014977009,0.000035814108,0.0002887851,0.000030773193,0.00012081645],"category_scores_gemma":[0.000002598102,0.00011288441,0.00018604686,0.00022438593,0.00008063706,0.00009154306,0.00012638935,0.00014367893,0.000022986364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020874554,0.00012843794,0.2840994,0.000008384327,0.000028488352,2.5555886e-7,0.000036000645,0.000038312486,0.0016091664,0.7130678,0.00044258544,0.00053905474],"study_design_scores_gemma":[0.0007941181,0.000021913456,0.12287878,0.000043846452,0.000059752736,3.434808e-7,0.00007457165,0.00026848097,0.05395744,0.8198823,0.001775161,0.0002433044],"about_ca_topic_score_codex":0.0014088999,"about_ca_topic_score_gemma":0.000014845413,"teacher_disagreement_score":0.16122063,"about_ca_system_score_codex":0.000019812527,"about_ca_system_score_gemma":0.000052805597,"threshold_uncertainty_score":0.46032926},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99773866,0.0007818876,0.00035831323,0.0000028193028,0.00022200315,0.00017933249,0.000005847857,0.00004584264,0.0006652722],"genre_scores_gemma":[0.9994361,0.000013782171,0.00049784686,0.0000027554438,0.000006696366,0.0000061524424,6.6344614e-7,0.000029611972,0.000006431672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926335,0.000029428498,0.00024066771,0.00014781226,0.00014010824,0.00017864704],"domain_scores_gemma":[0.9994782,0.00010994443,0.00008729754,0.00024098894,0.000037254922,0.00004628772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001919569,0.00015649914,0.0002966199,0.000057364028,0.00006897076,0.00002593271,0.00010550382,0.00007343354,0.0000015846124],"category_scores_gemma":[0.000010129996,0.00014351807,0.000031929583,0.00015460889,0.00010934909,0.0001278343,0.00004096276,0.00008088938,2.821804e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009149097,0.00012373009,0.22822326,0.0007379409,0.00019444045,0.000024858935,0.00031820667,0.0015560692,0.16708925,0.60133845,0.00006722528,0.00023505914],"study_design_scores_gemma":[0.003218092,0.00044658678,0.4499633,0.0004327998,0.00014122578,0.00005384927,0.00021955764,0.008242252,0.011940983,0.52482575,0.000019886573,0.0004957201],"about_ca_topic_score_codex":0.00027562233,"about_ca_topic_score_gemma":0.000036444533,"teacher_disagreement_score":0.22174004,"about_ca_system_score_codex":0.000011462389,"about_ca_system_score_gemma":0.0000063046386,"threshold_uncertainty_score":0.5852497},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9779563,0.000046024645,0.0002285199,0.00006708102,0.00040167652,0.00018178037,0.0000040267414,0.00006939166,0.021045174],"genre_scores_gemma":[0.99849457,0.0000034243387,0.00072486047,0.000064783366,0.000009551246,0.000013314255,0.0000023088562,0.000022331575,0.0006648458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999088,0.000029725632,0.00030339893,0.00015901208,0.0001919634,0.00022792429],"domain_scores_gemma":[0.99894214,0.00031270526,0.00013212192,0.00044988486,0.00008665865,0.00007647688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055677333,0.000115929084,0.00018788496,0.00009063424,0.000083974184,0.00000787245,0.00023067062,0.00010043061,0.000093827104],"category_scores_gemma":[0.00010762711,0.00010827756,0.00008650506,0.0003135651,0.00010064697,0.00006974173,0.000051571707,0.00011848915,0.00003501727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016471673,0.00023768496,0.004826014,0.000017429531,0.000020910738,0.000001256186,0.00022900604,1.919118e-7,0.0055967667,0.9872299,0.0012036382,0.0006207674],"study_design_scores_gemma":[0.00043756285,0.000031345724,0.0037664496,0.00001587362,0.000019886327,0.0000031710001,0.000115437295,0.000004393057,0.029278455,0.9622156,0.00399264,0.00011917898],"about_ca_topic_score_codex":0.00001528632,"about_ca_topic_score_gemma":0.0000051312545,"teacher_disagreement_score":0.025014257,"about_ca_system_score_codex":0.000018771134,"about_ca_system_score_gemma":0.000021887385,"threshold_uncertainty_score":0.44154307},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.496313,0.00019662754,0.4450675,0.00015545274,0.00047807264,0.00040160932,0.00005684364,0.00007104991,0.057259846],"genre_scores_gemma":[0.9252841,0.0000032398987,0.07336584,0.000019331372,0.000014931049,0.000020422247,0.000029367911,0.00001943792,0.0012433298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924046,0.0000261554,0.00028057877,0.0001457084,0.00009772564,0.00020935027],"domain_scores_gemma":[0.9992115,0.00026418513,0.00012681556,0.0002604882,0.00005321356,0.000083788014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003104537,0.000108550965,0.00021332408,0.000018129142,0.0000663814,0.0000094532925,0.00015328742,0.00003152905,0.0003550964],"category_scores_gemma":[0.000012391588,0.00010019248,0.000090330854,0.00018054685,0.00006201696,0.00005547675,0.000047019777,0.00008324842,0.000023686267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000768347,0.00008307709,0.00037377304,0.0000070452934,0.000027641943,1.0453359e-7,0.000055345245,0.0000022085,0.009009899,0.9841939,0.0018645868,0.0043746913],"study_design_scores_gemma":[0.00041366453,0.000013538899,0.000026999278,0.0000058037836,0.000015412788,1.6889514e-7,0.00015621808,0.000029445693,0.078269824,0.90428317,0.016682351,0.00010340451],"about_ca_topic_score_codex":0.00004831211,"about_ca_topic_score_gemma":2.0202894e-7,"teacher_disagreement_score":0.42897108,"about_ca_system_score_codex":0.000012663477,"about_ca_system_score_gemma":0.0000113181495,"threshold_uncertainty_score":0.4085731},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7311738,0.0003283763,0.26203096,0.00019006715,0.0030384483,0.0010345858,0.0000046558457,0.00034645776,0.0018526483],"genre_scores_gemma":[0.7720744,0.000006140743,0.22767803,0.00006244351,0.0000074270924,0.000115459814,0.000008470522,0.000014349658,0.00003327099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984918,0.00008606539,0.00038288045,0.00041078814,0.00023813281,0.0003903055],"domain_scores_gemma":[0.9990022,0.00013624737,0.00015781556,0.0005510548,0.0001002454,0.000052432526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084654876,0.00016253725,0.00020006513,0.00015846356,0.00013345649,0.00013974134,0.0007712828,0.000090513786,0.0000014779278],"category_scores_gemma":[0.000056114935,0.00016890667,0.00007365926,0.0005955521,0.00004201175,0.0005962272,0.00013935287,0.00014788238,0.000012623873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034288835,0.00013313153,0.008757072,0.000032268726,0.000003660371,0.0000022137485,0.0002182895,0.00010332474,0.0030230554,0.98526907,0.00042116235,0.0020333324],"study_design_scores_gemma":[0.000802028,0.00011095218,0.031679012,0.00005428498,0.00000359871,0.000004400784,0.000007665374,0.04619283,0.004090256,0.9161851,0.0006396074,0.00023025584],"about_ca_topic_score_codex":0.00011508037,"about_ca_topic_score_gemma":0.000008646324,"teacher_disagreement_score":0.06908395,"about_ca_system_score_codex":0.00008717447,"about_ca_system_score_gemma":0.000041731615,"threshold_uncertainty_score":0.6887814},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93368316,0.0000954071,0.037836283,0.009000957,0.0035109748,0.0006507459,0.000005242425,0.00048803524,0.014729215],"genre_scores_gemma":[0.9911338,0.000003626983,0.008222962,0.0005615923,0.000019945679,0.0000050785006,6.727174e-7,0.00001249206,0.00003981614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997677,0.0003133877,0.00045252402,0.0005291945,0.0005965815,0.00043130474],"domain_scores_gemma":[0.9970382,0.0010350402,0.00023382145,0.001420371,0.00016598511,0.0001065731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007250921,0.00023866945,0.00035505995,0.00009302189,0.00028468648,0.00010997854,0.0020450242,0.00008147416,0.000062628154],"category_scores_gemma":[0.00026083,0.0001827222,0.00016102947,0.00078907027,0.00042866316,0.00016474776,0.00084052375,0.0003652882,0.00014454171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022850816,0.00037849645,0.00067107717,0.000011466767,0.000014792954,0.000006960425,0.0012277445,0.00013782833,0.00010887211,0.98741823,0.0011990311,0.008823215],"study_design_scores_gemma":[0.00046263495,0.00022503178,0.013335901,0.000028485752,0.000005322478,0.000010466534,0.000017580385,0.38676545,0.0014123924,0.5970544,0.00045772354,0.00022459573],"about_ca_topic_score_codex":0.00007955769,"about_ca_topic_score_gemma":0.000006135435,"teacher_disagreement_score":0.3903638,"about_ca_system_score_codex":0.00009406933,"about_ca_system_score_gemma":0.000022823366,"threshold_uncertainty_score":0.74511945},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940358,0.00039935388,0.00091935333,0.00059311534,0.003152131,0.00023156936,0.0000011070817,0.000085545085,0.000582047],"genre_scores_gemma":[0.9977705,0.0000064104424,0.001850624,0.00029742418,0.000005448143,0.000003432597,5.559958e-7,0.000013586406,0.000052035906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824166,0.00012617698,0.00047319624,0.00029506994,0.00041580774,0.00044810819],"domain_scores_gemma":[0.99812657,0.0004654572,0.0002801694,0.0009427601,0.00009902908,0.00008599351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001866518,0.0001795646,0.00022130892,0.00015558228,0.00051853637,0.000116329975,0.0012654196,0.000081004735,0.0000050730287],"category_scores_gemma":[0.00008907172,0.0001095189,0.00014487693,0.0009009645,0.00022351289,0.00020490798,0.00031534996,0.00024682278,0.000011175822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015514639,0.0001115582,0.004441781,0.000020961752,0.00007349881,0.000012080072,0.0022860458,0.00012946819,0.030617869,0.9570041,0.0034959721,0.0017911874],"study_design_scores_gemma":[0.0025885184,0.00028926338,0.012944537,0.00021470815,0.000111716654,0.0001186858,0.0005146624,0.025611982,0.07400733,0.8818844,0.00097463554,0.0007395634],"about_ca_topic_score_codex":0.0003799372,"about_ca_topic_score_gemma":0.000011361315,"teacher_disagreement_score":0.07511967,"about_ca_system_score_codex":0.00004049189,"about_ca_system_score_gemma":0.00009819332,"threshold_uncertainty_score":0.44660512},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98616755,0.0011630951,0.0045983996,0.0007057539,0.0038404255,0.00030785587,0.000011050288,0.00012605543,0.003079806],"genre_scores_gemma":[0.9970782,0.00007624949,0.0025997062,0.0001401558,0.000014154882,0.000008990656,0.0000029246692,0.000017257058,0.000062395615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776167,0.00010074274,0.0005241979,0.00061340275,0.000469432,0.0005305782],"domain_scores_gemma":[0.99806094,0.0001604644,0.0002804041,0.0011242168,0.00018838052,0.00018561684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037109316,0.00028763694,0.00046711674,0.00007931936,0.0001581811,0.00007990604,0.0011516422,0.0001709863,0.000054988555],"category_scores_gemma":[0.00013629935,0.0002819224,0.00017559061,0.00051784335,0.0003565773,0.0005104849,0.00052561716,0.00029227728,0.00017035523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001358619,0.0004698211,0.004576141,0.00008516425,0.000025428038,0.000024436786,0.00059086026,0.0004409249,0.00061719894,0.9880163,0.00004608001,0.005094048],"study_design_scores_gemma":[0.0014567953,0.00049794855,0.03461776,0.00008561634,0.000020247768,0.000011167348,0.000044981596,0.00019250883,0.0059350296,0.9560164,0.0008077712,0.00031378056],"about_ca_topic_score_codex":0.0000980646,"about_ca_topic_score_gemma":0.0000048501865,"teacher_disagreement_score":0.031999916,"about_ca_system_score_codex":0.00018899076,"about_ca_system_score_gemma":0.00030599555,"threshold_uncertainty_score":0.9999633},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97923267,0.00020159691,0.000029199135,0.000010196591,0.0010222543,0.00012445897,0.0000016596532,0.00043277402,0.01894519],"genre_scores_gemma":[0.99946785,0.000015261932,0.00005758211,0.000018588746,0.000012928648,0.000022330622,0.0000019720987,0.000037410373,0.00036608824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993248,0.0000312003,0.00013439257,0.00013148796,0.00014316573,0.00023496903],"domain_scores_gemma":[0.99955094,0.000046493526,0.000019179668,0.00026714103,0.00002925195,0.00008701591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008623309,0.0001486389,0.00016967268,0.000048202975,0.0001034928,0.000012949845,0.00014624328,0.000048672347,0.000029478528],"category_scores_gemma":[0.00000568965,0.0001306475,0.00004139276,0.00022205865,0.000053905573,0.000089274516,0.0000106702355,0.00013205013,0.0001443428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006229785,0.00016189621,0.03890112,0.00010122584,0.00024471577,0.0003839946,0.0021437479,0.0057517593,0.006213122,0.9308931,0.014964291,0.00017870408],"study_design_scores_gemma":[0.022999372,0.0017486844,0.058376033,0.0005803053,0.00027358945,0.0028594467,0.0008606236,0.009229546,0.122280195,0.717894,0.057604406,0.005293797],"about_ca_topic_score_codex":0.000010582522,"about_ca_topic_score_gemma":0.00000285125,"teacher_disagreement_score":0.21299912,"about_ca_system_score_codex":0.000025462203,"about_ca_system_score_gemma":0.00001309772,"threshold_uncertainty_score":0.5327651},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2717571,0.0004326547,0.6894295,0.00039206987,0.0053979545,0.00042708553,0.000003353235,0.0008642477,0.031296022],"genre_scores_gemma":[0.9530831,0.000007768113,0.046545733,0.00015057327,0.000016516371,0.000005721685,0.0000036011133,0.0000105344425,0.00017644482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988373,0.000018931049,0.00019894834,0.00031464602,0.00028678597,0.00034342054],"domain_scores_gemma":[0.99909365,0.00007592067,0.0000670061,0.00058617495,0.000056936937,0.00012032213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045309184,0.00011718435,0.00011678403,0.00007611376,0.00013800972,0.0001298164,0.00077344564,0.00005708317,0.000012153254],"category_scores_gemma":[0.000018881745,0.000107099295,0.000041677245,0.0003395268,0.00001924632,0.0006199851,0.00047017302,0.00013426627,0.00010918095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045291195,0.00007573763,0.0009873931,0.000009261142,0.0000061700866,0.000040863164,0.00022009735,0.0000088862635,0.0006496778,0.9612885,0.0027425226,0.03396634],"study_design_scores_gemma":[0.0012794669,0.00023283888,0.015061933,0.000089474415,0.0000055080122,0.000040982606,0.00003211277,0.012237134,0.007854097,0.89102924,0.07160628,0.00053095084],"about_ca_topic_score_codex":0.0000527383,"about_ca_topic_score_gemma":0.000003033572,"teacher_disagreement_score":0.68132603,"about_ca_system_score_codex":0.000043929696,"about_ca_system_score_gemma":0.00003324561,"threshold_uncertainty_score":0.43673825},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950468,0.00016473395,0.000008613998,0.000021658023,0.00067947805,0.000092424685,0.000014716856,0.000030130834,0.0039414335],"genre_scores_gemma":[0.9998898,0.000010685903,0.000007022622,0.000013508833,0.0000042783445,0.0000016884206,0.0000020674395,0.000011130513,0.000059797414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995218,0.00006604811,0.00015006601,0.00005514982,0.00012691172,0.000080056154],"domain_scores_gemma":[0.9996001,0.000116286305,0.00007439757,0.00015232596,0.000042312186,0.000014565195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008148805,0.000071618386,0.00012587254,0.000033100037,0.000026633843,0.000005039481,0.00010064208,0.00005749332,0.00012473429],"category_scores_gemma":[0.000039302085,0.000053252712,0.00004072223,0.00019133052,0.000023990217,0.000036984136,0.0000071745326,0.0000741043,0.00000556204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019947781,0.0000195145,0.000767559,0.00003164338,0.00006436188,2.5649248e-7,0.0012474408,0.0012224297,0.013572233,0.98124665,0.001761791,0.000064124535],"study_design_scores_gemma":[0.0005601676,0.000112461195,0.0040003136,0.00009628438,0.00003964688,9.1998635e-7,0.0002566,0.015713105,0.12268401,0.8560459,0.00030274902,0.00018786175],"about_ca_topic_score_codex":0.0000049428013,"about_ca_topic_score_gemma":0.0000020010662,"teacher_disagreement_score":0.12520078,"about_ca_system_score_codex":0.000017078672,"about_ca_system_score_gemma":0.0000016838615,"threshold_uncertainty_score":0.21715826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9905203,0.00012762783,0.0044791694,0.0002606851,0.0009790871,0.00021831637,0.0000038568805,0.00046906504,0.0029419132],"genre_scores_gemma":[0.9895928,0.00002196974,0.009928332,0.0003080779,0.000009170249,0.000022547047,0.0000050791195,0.000024150182,0.00008789006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977372,0.00022941752,0.00023163146,0.00059627614,0.0006182185,0.0005872246],"domain_scores_gemma":[0.9979541,0.0001802673,0.0000853416,0.0013466323,0.00014564415,0.00028806616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037922437,0.00020711616,0.00022623538,0.00028380362,0.00058079313,0.00011448507,0.0015477434,0.000071274815,0.00002136951],"category_scores_gemma":[0.0000711714,0.00020396963,0.00008713102,0.0010132447,0.00026510705,0.000906258,0.000228947,0.00035706622,0.00024245628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019911058,0.0001807056,0.0031904525,0.0000050365693,0.000011771207,0.000095208336,0.00026321047,0.000036890648,0.0060834563,0.98814034,0.0005375047,0.0014355171],"study_design_scores_gemma":[0.00096169504,0.00048329128,0.009313384,0.000038696922,0.0000018580137,0.000044774206,0.000013607253,0.009785993,0.0070747947,0.9695221,0.0023865202,0.00037324423],"about_ca_topic_score_codex":0.00000877025,"about_ca_topic_score_gemma":0.000001194887,"teacher_disagreement_score":0.018618194,"about_ca_system_score_codex":0.000048651364,"about_ca_system_score_gemma":0.0000665191,"threshold_uncertainty_score":0.831764},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.637719,0.00015507056,0.36001903,0.0003947573,0.000828783,0.0005131451,0.000007229935,0.00012085276,0.00024217524],"genre_scores_gemma":[0.9769435,0.0000052063974,0.022910751,0.000041832744,0.000004343817,0.00005361249,0.0000063063776,0.000012597906,0.000021827214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988095,0.00004508124,0.00024458027,0.00029188336,0.00028361665,0.00032534183],"domain_scores_gemma":[0.9989128,0.00017032534,0.00011483412,0.00050097535,0.00021551114,0.00008555465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039187283,0.000114563394,0.00018020246,0.00018241756,0.00015519353,0.00005112287,0.00065079593,0.00004589452,0.0000020464502],"category_scores_gemma":[0.00011761853,0.00011702988,0.00009427626,0.0005873008,0.00009541322,0.000501905,0.00013998247,0.00009960809,0.000011157346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016853859,0.000055915436,0.0014362455,0.00001993982,0.000013835121,0.0000021952073,0.00026555097,0.00075576344,0.0052981963,0.9907909,0.00005278792,0.0012918044],"study_design_scores_gemma":[0.001168016,0.00024442276,0.0030280661,0.000029912999,0.0000033011327,0.0000029261755,0.000008625317,0.002613964,0.020679208,0.97170806,0.0003928343,0.000120663],"about_ca_topic_score_codex":0.000013687711,"about_ca_topic_score_gemma":0.0000105464405,"teacher_disagreement_score":0.33922455,"about_ca_system_score_codex":0.000039885217,"about_ca_system_score_gemma":0.000063722764,"threshold_uncertainty_score":0.477234},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952314,0.000050540817,0.00022223084,0.0013112695,0.0005723622,0.000095781754,5.582108e-7,0.000063475534,0.0024523847],"genre_scores_gemma":[0.997921,0.000013916398,0.0015485431,0.00044719237,5.3907445e-7,0.000008169018,2.6039555e-7,0.0000072653806,0.00005309887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991035,0.00005012625,0.000173533,0.00023942246,0.00024379691,0.00018964297],"domain_scores_gemma":[0.99911827,0.00016138483,0.000075387434,0.0004993195,0.00007690332,0.00006875497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028580727,0.00011161726,0.0001303588,0.000033706026,0.00012184115,0.00005167014,0.00037926665,0.00004959661,0.000016971311],"category_scores_gemma":[0.00005419599,0.00007664058,0.000052674728,0.00036389744,0.00010178419,0.00009792684,0.00013033487,0.00012823362,0.00010415512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026643058,0.000080624035,0.0017294564,0.0000049502896,0.000011477632,0.000004161874,0.00025698866,0.000024641517,0.00018128326,0.997016,0.00048772412,0.00020001728],"study_design_scores_gemma":[0.0006047058,0.000048736063,0.0012917798,0.00004296637,0.000005756372,0.000021631035,0.000012802111,0.0001346301,0.0021336325,0.99555725,0.00004984404,0.000096256466],"about_ca_topic_score_codex":0.00008952594,"about_ca_topic_score_gemma":0.0000018691987,"teacher_disagreement_score":0.0026896189,"about_ca_system_score_codex":0.00000979576,"about_ca_system_score_gemma":0.000033352826,"threshold_uncertainty_score":0.3125312},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95062464,0.0008120626,0.026216015,0.011251859,0.0061660553,0.00082023046,0.0000021926498,0.0007041791,0.0034027302],"genre_scores_gemma":[0.97405344,0.000008570246,0.025661908,0.00014255455,0.000026619142,0.000019339386,0.0000016862314,0.00001107488,0.000074818076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984531,0.00006575878,0.00022550672,0.0006289294,0.00030116545,0.00032555356],"domain_scores_gemma":[0.99872166,0.00008637865,0.000072705254,0.00077288004,0.00020862199,0.00013776393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039379075,0.00018136662,0.00020182997,0.00010316963,0.0001770616,0.00019902988,0.00067975593,0.00006967632,0.000003393423],"category_scores_gemma":[0.00017352459,0.00017928348,0.00003698178,0.0006091007,0.00010380433,0.0005261488,0.0004346869,0.00015561172,0.000050988096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017543534,0.0001692879,0.0006720186,0.000019810868,0.000008854708,0.00002119004,0.0008635723,0.000030819345,0.0002663674,0.9818344,0.00028191908,0.015829977],"study_design_scores_gemma":[0.0012572055,0.00017746662,0.020965375,0.000015152601,0.000006543085,0.00005387401,0.000019567602,0.0016423992,0.0040057003,0.9700205,0.0015449236,0.0002913044],"about_ca_topic_score_codex":0.000048960956,"about_ca_topic_score_gemma":0.0000058523738,"teacher_disagreement_score":0.023428757,"about_ca_system_score_codex":0.00013567819,"about_ca_system_score_gemma":0.00014871568,"threshold_uncertainty_score":0.7310968},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93895066,0.00018987924,0.032596212,0.0005712005,0.001122235,0.0001282151,6.339212e-7,0.0004890968,0.02595186],"genre_scores_gemma":[0.99390566,0.000032582666,0.005625849,0.0002278209,0.0000084363755,0.000011279566,9.3454537e-7,0.000010648952,0.00017676983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894994,0.0000651552,0.00013259084,0.00032326457,0.00021468964,0.00031436398],"domain_scores_gemma":[0.99908024,0.0001232886,0.0000582936,0.00056612835,0.000062203246,0.00010984976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002925834,0.00014420431,0.00014670011,0.00011128954,0.00021135874,0.00017519422,0.0007771913,0.000043739485,0.00003330292],"category_scores_gemma":[0.000018245568,0.0001238666,0.000057981142,0.00072909705,0.00006399476,0.00041458348,0.00014914482,0.0001304068,0.00007138597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001751443,0.00006164212,0.01108073,0.0000031140287,0.000017932642,0.0000556666,0.00019294284,0.000005972981,0.00013535008,0.9766742,0.00049501896,0.011259891],"study_design_scores_gemma":[0.00079538825,0.00025512345,0.004436936,0.000041722506,0.000011074178,0.00009377219,0.000040953953,0.0013777316,0.0010862873,0.9772539,0.014288942,0.00031814567],"about_ca_topic_score_codex":0.000008443135,"about_ca_topic_score_gemma":0.0000063281905,"teacher_disagreement_score":0.054955013,"about_ca_system_score_codex":0.000022273973,"about_ca_system_score_gemma":0.000030521936,"threshold_uncertainty_score":0.5051133},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97716266,0.00022187112,0.000004407198,0.00005269088,0.00054811034,0.00011175353,0.0000020279854,0.00005332228,0.02184317],"genre_scores_gemma":[0.9998532,0.000014016917,0.000010996956,0.000026687076,0.000006033632,0.000017550175,6.299896e-7,0.000013122771,0.000057756908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941784,0.00006742109,0.00017147134,0.00008679389,0.000110741166,0.00014573592],"domain_scores_gemma":[0.9994508,0.00023575702,0.000023440123,0.00025298796,0.000013156777,0.00002386334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034232088,0.000093933624,0.00014223225,0.00005272441,0.000029267225,0.00000925943,0.00019236314,0.000046730627,0.0000399608],"category_scores_gemma":[0.00003524886,0.000070984446,0.000045953726,0.0001850275,0.000040264127,0.000043734126,0.000012677476,0.00013687687,0.00006623988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009619441,0.000042341064,0.0010902409,0.000025051051,0.00001359036,0.0000020261446,0.0006195372,0.0021900302,0.0024507963,0.99270326,0.0005017456,0.00035174505],"study_design_scores_gemma":[0.0021049567,0.00036111078,0.016332822,0.0005097199,0.000025464804,0.000014859241,0.0009940097,0.020408759,0.08717328,0.8663541,0.005039204,0.0006817244],"about_ca_topic_score_codex":0.000012113371,"about_ca_topic_score_gemma":0.000012666484,"teacher_disagreement_score":0.1263492,"about_ca_system_score_codex":0.000028816385,"about_ca_system_score_gemma":0.0000053157664,"threshold_uncertainty_score":0.28946617},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9707392,0.00009576925,0.0019021562,0.00123416,0.0009320977,0.0008133705,0.000013107315,0.00030882237,0.023961345],"genre_scores_gemma":[0.99153215,0.000011483696,0.0072255544,0.00011839164,0.00000939833,0.00003918357,0.0000015246709,0.00005101054,0.001011293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983328,0.00013609054,0.00050523406,0.00023020674,0.0004668128,0.0003288746],"domain_scores_gemma":[0.9946806,0.0039419546,0.00028422952,0.0008217686,0.00018075458,0.00009071415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039567752,0.00024547105,0.00039913572,0.000063241125,0.00013882232,0.000020256713,0.00051409745,0.00011946563,0.00016058439],"category_scores_gemma":[0.0038852904,0.00017014115,0.00012750206,0.00045316195,0.00021725116,0.00011927923,0.00012495075,0.0003263136,0.00014487683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021533882,0.00075096363,0.00003934969,0.000044384728,0.000041057334,0.0000024460019,0.00041871364,0.000007991195,0.00017068961,0.99447376,0.003838581,0.00019054097],"study_design_scores_gemma":[0.0010056891,0.0001006902,0.000054187112,0.00006467849,0.000031820364,0.0000031554357,0.00014643189,0.00036280695,0.008197659,0.9890638,0.0007840384,0.0001850523],"about_ca_topic_score_codex":0.0000031768448,"about_ca_topic_score_gemma":0.0000018017048,"teacher_disagreement_score":0.022950053,"about_ca_system_score_codex":0.00009739147,"about_ca_system_score_gemma":0.000034731125,"threshold_uncertainty_score":0.69381547},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99602544,0.00029027075,0.00009434289,0.000054316468,0.00081911084,0.00041487798,0.0000042968304,0.0000300666,0.0022672985],"genre_scores_gemma":[0.99426323,0.000031093885,0.005581946,0.0000062986546,0.000002646339,0.00004503366,8.36485e-7,0.00003040004,0.00003853376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980637,0.00023790686,0.0008706938,0.00017798237,0.00035015424,0.00029957027],"domain_scores_gemma":[0.99589527,0.0027171255,0.0004302582,0.0007138522,0.0001854996,0.000057979654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082238665,0.00018225083,0.0004800736,0.00005763107,0.00008783674,0.000012258634,0.00033679756,0.00010434966,0.00002039281],"category_scores_gemma":[0.0026417444,0.00014750689,0.00012167395,0.0004453745,0.00018505428,0.00008723646,0.000050629787,0.00019836356,0.0000050976196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009287546,0.00043453224,0.002466028,0.0001043196,0.00004364468,0.0000060642196,0.00036994327,0.0000061992137,0.0033897802,0.9930581,0.00009199348,0.000020148027],"study_design_scores_gemma":[0.0013831513,0.00008894595,0.00043520393,0.00012806048,0.000046505644,0.000006290306,0.0002057357,0.000040146733,0.0315996,0.9658759,0.000050701976,0.00013973708],"about_ca_topic_score_codex":0.000012750561,"about_ca_topic_score_gemma":0.000010287018,"teacher_disagreement_score":0.028209819,"about_ca_system_score_codex":0.00006789688,"about_ca_system_score_gemma":0.00008383061,"threshold_uncertainty_score":0.6015156},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97795194,0.00006732622,0.000002323927,0.00029093318,0.00016130216,0.0001401681,0.0000039465244,0.000040310137,0.02134174],"genre_scores_gemma":[0.99838585,0.00003154319,0.00023160732,0.000028580329,0.000005270839,0.000026050799,8.442988e-7,0.000010146285,0.001280099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999433,0.000057736866,0.0001837074,0.00009055336,0.00010292054,0.00013207401],"domain_scores_gemma":[0.99891233,0.00057784707,0.000060537637,0.000381787,0.00003302743,0.000034474837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028771005,0.000068462534,0.000100658894,0.000018582701,0.00019809803,0.0000137646875,0.0002424829,0.000038245562,0.00014316264],"category_scores_gemma":[0.00005737477,0.00004967967,0.000074160474,0.0002025273,0.00012057984,0.000035042478,0.000016263151,0.0000850101,0.00005204841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018687133,0.00009020084,0.000092539565,0.0000056181357,0.00001995195,2.842723e-7,0.00016054708,2.0497352e-7,0.00016708145,0.9924167,0.0050254026,0.002002826],"study_design_scores_gemma":[0.00027848213,0.000025138923,0.00038389684,0.0000068764207,0.000022484739,0.0000018679146,0.000050130926,0.000006904432,0.0015124313,0.9832868,0.014368851,0.000056154262],"about_ca_topic_score_codex":0.000008724517,"about_ca_topic_score_gemma":0.0000031632617,"teacher_disagreement_score":0.020433906,"about_ca_system_score_codex":0.0000053715107,"about_ca_system_score_gemma":0.00001350952,"threshold_uncertainty_score":0.20258781},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9594897,0.001370677,0.0027569786,0.0022108422,0.003326098,0.00056723156,0.0000021503765,0.0005303381,0.02974596],"genre_scores_gemma":[0.99775183,0.000069892616,0.0015900182,0.00015664576,0.0000019777954,0.00002979938,6.028498e-7,0.000014185387,0.0003850393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824166,0.00014381607,0.00023429486,0.00045330098,0.00040186674,0.00052506424],"domain_scores_gemma":[0.99869055,0.00017375832,0.000047080797,0.00087664346,0.00006298562,0.00014897357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038172465,0.00015469664,0.00019293021,0.00032308677,0.000098125216,0.00008886152,0.0012505593,0.0000684947,0.00008652031],"category_scores_gemma":[0.000115716764,0.00015611347,0.000075481556,0.0013659582,0.00009821418,0.0006130283,0.0003545377,0.00031718696,0.00040578344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037444722,0.0001464712,0.0023808626,0.0000052514215,0.000005687006,0.00006926208,0.00031139082,0.000011157703,0.0002063457,0.9863795,0.0013578043,0.009122502],"study_design_scores_gemma":[0.00083182636,0.00009437515,0.0034621092,0.000017626928,9.251648e-7,0.000010138654,0.000015581427,0.008413371,0.0007954131,0.98495555,0.0012115755,0.00019149891],"about_ca_topic_score_codex":0.000016137647,"about_ca_topic_score_gemma":0.0000076643055,"teacher_disagreement_score":0.038262114,"about_ca_system_score_codex":0.00007370202,"about_ca_system_score_gemma":0.00001641869,"threshold_uncertainty_score":0.63661224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99746263,0.00032022252,0.000009747558,0.00018036319,0.000098457735,0.00018674626,0.0000021594362,0.00003195171,0.0017077299],"genre_scores_gemma":[0.99928004,0.00019784755,0.00033263338,0.0000103851635,0.0000029103842,0.000023040713,6.7137603e-7,0.000011369419,0.00014112415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938214,0.000046724173,0.00016649129,0.00012323476,0.00012976928,0.00015165962],"domain_scores_gemma":[0.99901116,0.00050739077,0.0000998058,0.00029256052,0.00003760347,0.00005146596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017987985,0.000093425035,0.00014633796,0.00003670713,0.00031293798,0.000011925873,0.00016394691,0.00002926605,0.0000059243657],"category_scores_gemma":[0.00005728935,0.000058291265,0.000040651517,0.0002378016,0.00031799293,0.00005412496,0.000023651479,0.00009573594,0.000002892649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003285947,0.00010329411,0.0032440599,0.0000134790325,0.00003619559,0.000003422393,0.00042577312,1.0585336e-7,0.00038991874,0.9950087,0.00054803444,0.0001941788],"study_design_scores_gemma":[0.0006127637,0.000106110165,0.010180248,0.000011543597,0.00003857255,0.000038539878,0.0001308424,0.0000076496935,0.0054734745,0.98257905,0.0007389356,0.00008229555],"about_ca_topic_score_codex":0.000009393045,"about_ca_topic_score_gemma":0.000005370671,"teacher_disagreement_score":0.012429654,"about_ca_system_score_codex":0.0000063197367,"about_ca_system_score_gemma":0.000021150696,"threshold_uncertainty_score":0.24068975},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952941,0.00018387615,0.00027561013,0.00019418653,0.0010154299,0.00012144585,6.4020094e-7,0.00010913971,0.0028055757],"genre_scores_gemma":[0.99617386,0.000016412654,0.0034205916,0.00031186195,5.5071973e-7,0.0000022132567,0.0000011279966,0.000010395776,0.00006299415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867374,0.000045322584,0.00029926762,0.0003494129,0.0003249285,0.00030735406],"domain_scores_gemma":[0.99889964,0.0002403808,0.0001127308,0.00050475687,0.000100285644,0.00014222805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006234284,0.00014766517,0.00020129938,0.00019796286,0.0000961679,0.000038444785,0.0003623324,0.000089793844,0.000006449165],"category_scores_gemma":[0.000045604807,0.00013505004,0.00006885453,0.0004885582,0.00010958348,0.00012627298,0.000109680586,0.00014629644,0.00002154114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014986784,0.00011637163,0.004148595,0.000011516799,0.000015040226,0.0000094818115,0.00027038253,0.000003749619,0.0016760406,0.98993784,0.00061348954,0.0031825257],"study_design_scores_gemma":[0.0011430943,0.00023037122,0.011142493,0.00004025087,0.000007731085,0.0000059215326,0.000015511945,0.0005536321,0.0075305593,0.9790222,0.0001451533,0.00016310367],"about_ca_topic_score_codex":0.00006867814,"about_ca_topic_score_gemma":0.0000032517619,"teacher_disagreement_score":0.010915643,"about_ca_system_score_codex":0.000012789075,"about_ca_system_score_gemma":0.00002533551,"threshold_uncertainty_score":0.55071807},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98736507,0.00006058288,0.0016049906,0.00016280336,0.000037679925,0.00014031645,0.000011549478,0.000030548934,0.010586482],"genre_scores_gemma":[0.9990221,0.000008599232,0.00063075207,0.000020826103,0.000011275794,0.000048337264,0.000008620044,0.000009336476,0.00024009857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955,0.000012047932,0.00009699032,0.00014205152,0.000059139526,0.00013981546],"domain_scores_gemma":[0.99959034,0.00012418657,0.000055337467,0.00014054855,0.000025929648,0.000063654545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000041128947,0.00010269244,0.00013631045,0.000014246913,0.00021158288,0.000016629068,0.00008938105,0.000016250824,0.0000644443],"category_scores_gemma":[0.0000028996026,0.000067194014,0.000022024988,0.00011565216,0.0001496867,0.000097722,0.000029103061,0.000075195625,0.000009396598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004946352,0.000051754087,0.007013935,0.000003469573,0.000019208373,6.2447447e-7,0.00035081684,0.000002601737,0.00007739711,0.9910711,0.00006804086,0.0013361175],"study_design_scores_gemma":[0.00034248084,0.000047163554,0.0007924404,0.000010185565,0.0000055740934,0.000003310774,0.00076590356,0.000034325836,0.0019544691,0.99351984,0.0024126621,0.000111649686],"about_ca_topic_score_codex":0.000028820783,"about_ca_topic_score_gemma":6.5202727e-7,"teacher_disagreement_score":0.011657108,"about_ca_system_score_codex":0.000005308932,"about_ca_system_score_gemma":0.000020832284,"threshold_uncertainty_score":0.27400923},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9715058,0.001330851,0.000011205636,0.0000069492867,0.0027806405,0.00033396974,0.000008630819,0.00020221728,0.023819732],"genre_scores_gemma":[0.999289,0.000031253574,0.000016347998,0.0000040622276,0.0000093141025,0.00006907697,0.0000031894187,0.00003928594,0.0005384813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859387,0.00012700506,0.0005457462,0.00018597103,0.00021619938,0.00033122223],"domain_scores_gemma":[0.99930215,0.000085087464,0.00007499396,0.00041993975,0.000036314923,0.00008149696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033974354,0.000199175,0.0004485675,0.000120220895,0.000040114966,0.000029257175,0.0002616055,0.00013883346,0.00013035712],"category_scores_gemma":[0.000018063154,0.00021204773,0.00008654288,0.00038832694,0.000036035122,0.00014355949,0.000033676864,0.0002228461,0.00004588834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052339365,0.00072238996,0.0411045,0.00088277884,0.0003015751,0.00011851782,0.0051250793,0.003912284,0.007207517,0.92627513,0.0128230555,0.0014748148],"study_design_scores_gemma":[0.017703092,0.00043484732,0.021624936,0.002660382,0.00024779633,0.0003848744,0.0045608035,0.40920347,0.022216458,0.50441957,0.013100104,0.0034436525],"about_ca_topic_score_codex":0.00010528296,"about_ca_topic_score_gemma":0.00000936586,"teacher_disagreement_score":0.42185557,"about_ca_system_score_codex":0.00006321754,"about_ca_system_score_gemma":0.0000043608443,"threshold_uncertainty_score":0.86470556},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9886748,0.0027326115,0.0005691674,0.0031222021,0.0017154184,0.00018908286,0.0000053868403,0.00050073816,0.0024905943],"genre_scores_gemma":[0.99518573,0.000046973277,0.0038304375,0.00064379664,0.0000028183304,0.0000044667163,0.0000050235785,0.000009141256,0.00027160606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989056,0.000048159498,0.0002045814,0.00034801764,0.0002146134,0.00027905588],"domain_scores_gemma":[0.99913937,0.0001422661,0.00007070267,0.00045228403,0.00005756984,0.00013778968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025610247,0.00013901175,0.00015036519,0.00009835779,0.0001420102,0.00016176153,0.00038773668,0.000063481064,0.000018251096],"category_scores_gemma":[0.000045084933,0.00012801524,0.000032378506,0.00025563454,0.000054389002,0.00035685085,0.00017682447,0.00012522322,0.00016895283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028263207,0.00006913685,0.0020413462,0.000011329515,0.00000913324,0.000009992984,0.00032781332,0.00006130079,0.00016414831,0.9841759,0.006812003,0.0063150665],"study_design_scores_gemma":[0.00080034684,0.00010498225,0.0014796974,0.00001756551,0.000007889709,0.000018200302,0.000016341317,0.025929574,0.00066591095,0.9448159,0.025899418,0.0002441714],"about_ca_topic_score_codex":0.000056883666,"about_ca_topic_score_gemma":0.000009848232,"teacher_disagreement_score":0.03936,"about_ca_system_score_codex":0.000012267929,"about_ca_system_score_gemma":0.000026490485,"threshold_uncertainty_score":0.52203095},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62622803,0.00019771153,0.0061428994,0.0035433564,0.0013391062,0.0050630914,0.00009442805,0.00073177466,0.35665962],"genre_scores_gemma":[0.9517363,0.000011977547,0.028149022,0.00014930575,0.000020030082,0.0007117934,0.000007638512,0.00006229899,0.019151684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991593,0.000012049024,0.0002358337,0.0001946058,0.00016867586,0.0002295788],"domain_scores_gemma":[0.9987946,0.0005226388,0.00010772297,0.0004265798,0.00008024514,0.000068200185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019146143,0.00012846955,0.00018532139,0.00003789292,0.00016537718,0.000060647984,0.00020472551,0.00006484188,0.00028808124],"category_scores_gemma":[0.00015476887,0.00011668701,0.00006384683,0.0001452798,0.000019682115,0.000054133372,0.000030091434,0.00008068036,0.00016833711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015324266,0.00034354223,0.000005295843,0.00006470534,0.000012891313,3.1278984e-7,0.000118337164,0.0000012555282,0.00006200766,0.7510444,0.24819309,0.00015263293],"study_design_scores_gemma":[0.0005734487,0.000089246634,0.0000023443727,0.00003465123,0.000021655176,0.0000018387409,0.000019004618,0.0019054565,0.00054675416,0.9571393,0.039529514,0.00013679307],"about_ca_topic_score_codex":0.000002898652,"about_ca_topic_score_gemma":0.000001752402,"teacher_disagreement_score":0.33750793,"about_ca_system_score_codex":0.00003862401,"about_ca_system_score_gemma":0.00000870993,"threshold_uncertainty_score":0.47583583},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9812027,0.00042368995,0.0003650164,0.0021027017,0.0074494365,0.00022726318,0.0000041440753,0.000734874,0.007490134],"genre_scores_gemma":[0.99622947,0.00002518071,0.0023498612,0.00090408185,0.0000038196767,0.0000047529275,0.000004998316,0.000015198701,0.00046264363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979412,0.000054499757,0.00040915213,0.000572042,0.00048755118,0.00053557404],"domain_scores_gemma":[0.9983055,0.00021167129,0.00012486998,0.0009981177,0.00013438269,0.00022545694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011530933,0.00021237387,0.00020230406,0.00029476,0.00020210409,0.0001139663,0.0008623917,0.00012026106,0.0000020732657],"category_scores_gemma":[0.00011535784,0.00018466085,0.00012020316,0.0007218214,0.00007008697,0.00032938374,0.00016502329,0.00029716166,0.00022042324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003241665,0.00016745712,0.00014230782,0.0000034343689,0.00001247656,0.000036211008,0.00018768513,0.000017962988,0.000550031,0.9882486,0.008570837,0.002030582],"study_design_scores_gemma":[0.0013335524,0.00029428082,0.0011473304,0.000039600076,0.000004136129,0.0000059666663,0.000012678892,0.00071978185,0.009251871,0.9853592,0.0015918436,0.00023974528],"about_ca_topic_score_codex":0.00009045593,"about_ca_topic_score_gemma":0.0000059575127,"teacher_disagreement_score":0.015026722,"about_ca_system_score_codex":0.000040501895,"about_ca_system_score_gemma":0.000039809383,"threshold_uncertainty_score":0.7530251},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99746275,0.00010576561,0.0000045549746,0.0004354868,0.0002985127,0.00019199746,0.000007746432,0.000029159804,0.0014640546],"genre_scores_gemma":[0.9992526,0.00011160497,0.00008000207,0.00014463178,0.000013145481,0.00002045286,0.000008499736,0.000017113025,0.00035195457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908483,0.0001736722,0.00025482668,0.00011997738,0.00019632891,0.00017038632],"domain_scores_gemma":[0.9991623,0.00029493414,0.00009668022,0.00035875506,0.000053429674,0.00003388881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038347166,0.00010913584,0.00020103302,0.000069219495,0.0001163504,0.000012119517,0.00032521613,0.00006887936,0.000067326226],"category_scores_gemma":[0.00015176796,0.00008148464,0.00004808261,0.00027619945,0.00012924429,0.0001319308,0.000042903655,0.00016932792,0.000034437864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007513281,0.0002252109,0.0068088593,0.000017965529,0.000014614697,0.0000212553,0.0031232235,4.329298e-7,0.00075565174,0.98823696,0.0007698843,0.000018451654],"study_design_scores_gemma":[0.0008982129,0.000077698365,0.028090108,0.000040594863,0.000022030386,0.000022434791,0.00063404767,0.000029398361,0.0022076843,0.96656084,0.0012624019,0.00015453195],"about_ca_topic_score_codex":0.000017187112,"about_ca_topic_score_gemma":0.0000056811064,"teacher_disagreement_score":0.02167608,"about_ca_system_score_codex":0.000015779338,"about_ca_system_score_gemma":0.00005928239,"threshold_uncertainty_score":0.33228472},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9931284,0.00026376496,0.000331479,0.000018602752,0.0019905143,0.00019304722,0.000024282379,0.00021117536,0.0038386974],"genre_scores_gemma":[0.99980116,0.000022607168,0.00004210296,0.000020916694,0.000006566807,0.000021996644,0.00000963505,0.000028322056,0.00004669816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990815,0.0000453536,0.00029451883,0.0001499003,0.0001956979,0.00023301676],"domain_scores_gemma":[0.99945647,0.000046553116,0.00004166587,0.0002754868,0.00006041285,0.00011942044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012790918,0.00015089601,0.00022413499,0.00020753966,0.0000509894,0.000017382465,0.0001710129,0.00006879057,0.00015307359],"category_scores_gemma":[0.000017203556,0.00015973595,0.000096356445,0.0007391627,0.000032821634,0.00010344359,0.000018229892,0.00009192254,0.000108772554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008919945,0.000066524924,0.017829942,0.00008200376,0.00007444059,0.000003892817,0.0007598027,0.0007211997,0.020214144,0.95715773,0.00261594,0.00046547028],"study_design_scores_gemma":[0.0024452908,0.0005284404,0.05714015,0.00027310097,0.00009175324,0.000022055752,0.00020128993,0.0100553,0.024301818,0.87518644,0.028414179,0.0013401771],"about_ca_topic_score_codex":0.0000062706204,"about_ca_topic_score_gemma":0.0000045987117,"teacher_disagreement_score":0.08197127,"about_ca_system_score_codex":0.000015474703,"about_ca_system_score_gemma":0.000002422817,"threshold_uncertainty_score":0.6513843},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9866067,0.00022973197,0.000037847236,0.00005085224,0.00091346406,0.00009808611,0.000006910904,0.0001733727,0.011882996],"genre_scores_gemma":[0.9997418,0.000027366488,0.00002794712,0.000013553508,0.000012787691,0.000028792947,0.0000045156166,0.000018808621,0.00012442977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994191,0.00003001142,0.00021126276,0.00008543866,0.00009192685,0.00016224779],"domain_scores_gemma":[0.9996252,0.000043596076,0.00002611497,0.0002217653,0.000023286188,0.000060029703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000078325706,0.00010598649,0.00016867221,0.00004764096,0.000033005686,0.000009131589,0.000111290705,0.00006013814,0.0001296565],"category_scores_gemma":[0.000009073687,0.000101590245,0.00007383014,0.000103906386,0.000030825282,0.00007250498,0.000014615461,0.00009511261,0.000072467476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005337917,0.00010678199,0.0024145653,0.000059525028,0.000043640208,0.0000018471604,0.00026346787,0.0006516929,0.005258083,0.9885087,0.0021517426,0.00053461705],"study_design_scores_gemma":[0.0011958505,0.00011190611,0.01626691,0.00011500219,0.00004547915,0.000011259729,0.00012341778,0.0023322238,0.11433357,0.8537962,0.011225857,0.0004423249],"about_ca_topic_score_codex":0.000002805547,"about_ca_topic_score_gemma":0.0000058577207,"teacher_disagreement_score":0.1347125,"about_ca_system_score_codex":0.000027148548,"about_ca_system_score_gemma":0.0000042742595,"threshold_uncertainty_score":0.414273},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.953327,0.0014253259,0.00006213838,0.000003563299,0.0054598157,0.00022244554,0.000008445658,0.00019281168,0.039298464],"genre_scores_gemma":[0.9995953,0.0000147185765,0.00008254688,0.000003993286,0.000009439732,0.000023062958,0.0000032359296,0.000035302033,0.00023240945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893856,0.00009651369,0.00036873925,0.00014675804,0.00018520761,0.00026422387],"domain_scores_gemma":[0.99944544,0.00007622101,0.00006930222,0.00027637553,0.000050973456,0.00008167422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043787333,0.0001546202,0.00031826395,0.00010815574,0.000054052754,0.0000263953,0.00015148771,0.00010385826,0.000044446013],"category_scores_gemma":[0.000061567756,0.00017020322,0.000086068285,0.00029686402,0.00003600653,0.00012932293,0.000011751527,0.0001280131,0.00003804488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008286647,0.000055005945,0.00075943023,0.00021567853,0.00007642667,0.000004258868,0.00038424542,0.00014239628,0.017817754,0.9788528,0.0016319618,0.00005173275],"study_design_scores_gemma":[0.009777508,0.0009830324,0.0023876475,0.002219953,0.0003446427,0.00019737752,0.00555588,0.007183967,0.37133622,0.5230172,0.0741641,0.0028324747],"about_ca_topic_score_codex":0.000014337606,"about_ca_topic_score_gemma":4.982481e-7,"teacher_disagreement_score":0.4558356,"about_ca_system_score_codex":0.00004259838,"about_ca_system_score_gemma":0.000013572433,"threshold_uncertainty_score":0.6940686},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98353183,0.00007065049,0.0011231046,0.00032439717,0.0012114143,0.0003274743,0.0000020136745,0.000029898914,0.013379221],"genre_scores_gemma":[0.9984621,0.00000854667,0.0014258865,0.000035018595,0.0000061669543,0.000009925447,5.0573675e-7,0.0000073425567,0.000044534456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863434,0.0002875145,0.00021621793,0.0002493743,0.00040254925,0.00020997981],"domain_scores_gemma":[0.9985355,0.00033247806,0.00012314094,0.00080367725,0.00015983444,0.000045381315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006967805,0.00009973028,0.00015606672,0.00013609929,0.000097910684,0.000018443121,0.00077119685,0.000028304705,0.00002911616],"category_scores_gemma":[0.00023897462,0.0000747806,0.0000783776,0.000786053,0.00018352851,0.00016059999,0.0000832202,0.00015507783,0.000014173437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001581088,0.00014419034,0.00043110026,0.000007744879,0.000013000027,0.0000020290695,0.00020646177,0.000017725666,0.0038549444,0.9939372,0.00046074003,0.0009090499],"study_design_scores_gemma":[0.000258542,0.00018295257,0.001738025,0.00001748184,0.0000020226835,0.0000028479312,0.000012322435,0.000049532387,0.12262743,0.8747692,0.0002730544,0.00006654766],"about_ca_topic_score_codex":0.000003303041,"about_ca_topic_score_gemma":0.0000013153012,"teacher_disagreement_score":0.11916796,"about_ca_system_score_codex":0.000022543803,"about_ca_system_score_gemma":0.000055637134,"threshold_uncertainty_score":0.30494642},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99275786,0.0005693258,0.00046705815,0.0008676366,0.0016545126,0.00010111052,6.3710667e-7,0.00023050918,0.0033513717],"genre_scores_gemma":[0.99560493,0.000073883944,0.0037290356,0.00026196326,0.0000010410981,0.0000062462345,0.000001515604,0.000010616559,0.00031074608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868524,0.000048799466,0.00032029112,0.00032818943,0.00032320578,0.00029426342],"domain_scores_gemma":[0.99879164,0.00008453851,0.00014056174,0.00069216243,0.0001748552,0.000116250245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036839227,0.00013717786,0.00021286415,0.00013973925,0.00009693423,0.000048991387,0.00072157633,0.00007688577,0.000016849184],"category_scores_gemma":[0.00006877966,0.00012776878,0.000082796774,0.00079541904,0.0000688437,0.00025111416,0.00018423106,0.00013454625,0.00009211597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035521393,0.00012823429,0.0044169165,0.000007793458,0.000013578325,0.000013462522,0.0002112433,0.000018943307,0.0036694822,0.9870832,0.0017549464,0.0026786693],"study_design_scores_gemma":[0.00073285087,0.00011674743,0.0012836527,0.000032761913,0.000007369653,0.000018842276,0.000011591753,0.0016928392,0.0063860673,0.9863306,0.003210538,0.00017613056],"about_ca_topic_score_codex":0.00007504639,"about_ca_topic_score_gemma":0.0000023015023,"teacher_disagreement_score":0.0032619776,"about_ca_system_score_codex":0.000014353952,"about_ca_system_score_gemma":0.000040875406,"threshold_uncertainty_score":0.52102596},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9890989,0.0006866203,0.00013392387,0.0000356333,0.0012654905,0.00026171948,0.000028269704,0.00011563376,0.008373819],"genre_scores_gemma":[0.9990434,0.0000083060795,0.00050151494,0.0000127462645,0.000045980454,0.000015426109,0.0000086254395,0.000029531642,0.00033446867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986541,0.00012559212,0.00035846847,0.00032376012,0.00024884127,0.00028923166],"domain_scores_gemma":[0.99870473,0.0004926108,0.00013629676,0.0005282274,0.000058712427,0.000079392164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004572306,0.00019728903,0.00033188486,0.000046271383,0.00025464277,0.000064913336,0.00020419675,0.00009324114,0.0000125302295],"category_scores_gemma":[0.000100224315,0.00016563988,0.00006336392,0.00012478959,0.00015091385,0.00010295511,0.00011770432,0.00016944532,0.000004255133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006860078,0.000036458307,0.056184128,0.000067241526,0.000019328627,0.0000086511545,0.00014660532,5.57559e-7,0.000017819155,0.9414068,0.0016176867,0.00048786143],"study_design_scores_gemma":[0.00070282107,0.000035418456,0.025910707,0.000035193323,0.00003372729,0.0000057214907,0.000039220802,0.000039462924,0.00007300827,0.9701845,0.0027363156,0.00020387617],"about_ca_topic_score_codex":0.00010197626,"about_ca_topic_score_gemma":0.000008121409,"teacher_disagreement_score":0.03027342,"about_ca_system_score_codex":0.00003745023,"about_ca_system_score_gemma":0.000011932203,"threshold_uncertainty_score":0.6754598},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99753255,0.000331736,0.000026993635,0.000010492331,0.0005486916,0.00015672405,0.0000050035665,0.00002834268,0.001359469],"genre_scores_gemma":[0.9998077,0.00003701514,0.000050065308,0.00000346318,0.0000030187525,0.000010940321,0.00000112006,0.00001924386,0.00006738987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99924576,0.00013139957,0.0002483167,0.000074876174,0.0001783817,0.00012126335],"domain_scores_gemma":[0.99916965,0.00008332997,0.00009616659,0.0004949555,0.00012920926,0.000026665017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023042422,0.00009892809,0.00021490583,0.00003226913,0.00007669869,0.0000030576832,0.0003172392,0.00005208548,0.0000067233022],"category_scores_gemma":[0.000018396577,0.000055553115,0.000058499332,0.0004586445,0.00018785457,0.00005338209,0.000019406401,0.00006635075,4.3541172e-7],"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.00008965522,0.00010194543,0.015239047,0.00013962573,0.00015244179,0.000001793379,0.0013339446,0.0012586381,0.012656845,0.9686669,0.0001810666,0.00017811],"study_design_scores_gemma":[0.0045010797,0.00081199507,0.03746518,0.0003061283,0.00012088271,0.000055039407,0.0013993377,0.0025155812,0.6918279,0.25783736,0.002573691,0.00058583025],"about_ca_topic_score_codex":0.00012734054,"about_ca_topic_score_gemma":0.000028801698,"teacher_disagreement_score":0.71082956,"about_ca_system_score_codex":0.000009456465,"about_ca_system_score_gemma":0.000026412541,"threshold_uncertainty_score":0.22653903},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9877104,0.00031713757,0.000032256936,0.002041884,0.0011644238,0.00051606336,0.0000034621883,0.004762812,0.0034515148],"genre_scores_gemma":[0.99154437,0.00012179402,0.007953394,0.000029659075,0.00003558646,0.00007863055,9.196126e-7,0.00005353324,0.00018213526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990773,0.000010687342,0.00015851742,0.00016730753,0.00013652469,0.00044963937],"domain_scores_gemma":[0.998919,0.00056225754,0.000025719677,0.00039575016,0.0000389522,0.000058334015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011376431,0.00018104717,0.00016494986,0.000035012334,0.00014490292,0.000058564252,0.00030488815,0.000114054055,0.000009065536],"category_scores_gemma":[0.00009686946,0.00012843186,0.000050424103,0.0003545828,0.00007323978,0.00008773039,0.000045033514,0.00021135644,0.000050451443],"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.00010294468,0.0001605386,0.0019128012,0.0000729202,0.00052153016,0.000020193484,0.00017755272,0.0047568143,0.0003617676,0.93223184,0.05192987,0.007751201],"study_design_scores_gemma":[0.005915665,0.0008910441,0.006106202,0.00009210988,0.00023027865,0.00004813656,0.00020951628,0.28459388,0.017432785,0.26438263,0.41858363,0.0015140937],"about_ca_topic_score_codex":0.0000018532955,"about_ca_topic_score_gemma":0.000023779285,"teacher_disagreement_score":0.66784924,"about_ca_system_score_codex":0.00010284768,"about_ca_system_score_gemma":0.000014246361,"threshold_uncertainty_score":0.5237299},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.960272,0.0011714572,0.025922246,0.001055466,0.0024752286,0.0006280293,0.0000103136845,0.00037945027,0.008085824],"genre_scores_gemma":[0.9941036,0.00005096093,0.0048933052,0.00012536079,0.00002503413,0.000033460772,0.0000064664528,0.000029491877,0.0007323131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997777,0.00011441121,0.00027318584,0.00065510906,0.00049051223,0.0006897897],"domain_scores_gemma":[0.9984811,0.00014075876,0.00008904938,0.0009467733,0.00013514044,0.00020716547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004654781,0.00025103823,0.00025581065,0.0001898966,0.00026822425,0.00020678862,0.0010471322,0.00010215154,0.000018543393],"category_scores_gemma":[0.000034046105,0.00024832878,0.00007202294,0.00066816434,0.00018084345,0.000548731,0.0007181528,0.00030746707,0.00014978304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017435545,0.00013191093,0.0062625688,0.0000258607,0.000015976697,0.00008678259,0.00017112617,0.000021064448,0.00094304525,0.9763889,0.004302249,0.011633085],"study_design_scores_gemma":[0.0010314104,0.00013549128,0.010537375,0.000016951813,0.0000044144413,0.000030764757,0.000018618814,0.0017493669,0.0025836928,0.9716676,0.01191546,0.00030887386],"about_ca_topic_score_codex":0.000050960494,"about_ca_topic_score_gemma":0.00000859912,"teacher_disagreement_score":0.033831622,"about_ca_system_score_codex":0.00008400263,"about_ca_system_score_gemma":0.00007345281,"threshold_uncertainty_score":0.9999969},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9838278,0.000051751016,0.0067206146,0.00013005454,0.0024438477,0.00024111045,0.000002429752,0.000057313366,0.006525031],"genre_scores_gemma":[0.9942415,0.000033486598,0.005585313,0.000021794569,0.000020995201,0.0000100121115,0.0000023332132,0.00001080646,0.000073785435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983904,0.00015342825,0.00035618403,0.00029398652,0.0005130781,0.00029296943],"domain_scores_gemma":[0.9984862,0.00027378352,0.00021062541,0.00065198896,0.00029145821,0.00008589672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005157272,0.00012747111,0.00026091738,0.00036381118,0.000059722213,0.000022338794,0.0009868646,0.00007501515,0.000022696708],"category_scores_gemma":[0.00017828021,0.00012966906,0.000116959294,0.0014763654,0.0002269003,0.00040000945,0.00019963557,0.00015459524,0.000011564609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055670935,0.00016184914,0.002556867,0.000013691446,0.000023985396,0.0000106730695,0.00029275598,0.000027852571,0.0030543194,0.9715187,0.00051907497,0.02176459],"study_design_scores_gemma":[0.0010924248,0.00028565046,0.0046650185,0.000023404918,0.000005765083,0.0000069037774,0.000030449908,0.0010254371,0.030886,0.96119636,0.00063808326,0.00014452361],"about_ca_topic_score_codex":0.000014015736,"about_ca_topic_score_gemma":0.0000024953385,"teacher_disagreement_score":0.027831681,"about_ca_system_score_codex":0.00003698731,"about_ca_system_score_gemma":0.00005238277,"threshold_uncertainty_score":0.5287751},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9800925,0.00009261697,0.0022905364,0.00036947193,0.0037524828,0.0003658271,0.0000021843491,0.000051667903,0.012982657],"genre_scores_gemma":[0.9982128,0.000006728484,0.00046735522,0.000033963977,0.00003801103,0.0000042297506,9.451847e-7,0.000019680505,0.001216281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906135,0.000041041192,0.0002930968,0.000108572174,0.00030769175,0.0001882249],"domain_scores_gemma":[0.9983771,0.0006188839,0.00028676284,0.0005908022,0.0000983756,0.000028105826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005410008,0.000089752095,0.00011027654,0.000022773498,0.00019633371,0.000015607671,0.00042663526,0.00006640799,0.000017127864],"category_scores_gemma":[0.0009767666,0.000054359614,0.000057963847,0.0002645923,0.00013236745,0.00005329212,0.00013160564,0.00014823234,0.000009349556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008716807,0.000039053815,0.008317985,0.0000114121995,0.0000151148515,6.0330206e-7,0.00019517457,4.7137877e-7,0.00011195753,0.9894053,0.0014335811,0.0004606608],"study_design_scores_gemma":[0.00030771142,0.000011304275,0.013185729,0.000016660146,0.000012254579,0.0000020830341,0.000083650884,0.000011659354,0.00914966,0.9733769,0.0037785708,0.000063782114],"about_ca_topic_score_codex":0.0000050051017,"about_ca_topic_score_gemma":0.00004207446,"teacher_disagreement_score":0.01812025,"about_ca_system_score_codex":0.00005752337,"about_ca_system_score_gemma":0.000028346223,"threshold_uncertainty_score":0.22167207},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.888449,0.008478623,0.00036779465,0.0028064284,0.006865772,0.0004951166,0.000029843404,0.000115415365,0.09239198],"genre_scores_gemma":[0.9929658,0.000042535925,0.00013841664,0.0014105777,0.000083239545,0.000024045872,0.000004974931,0.000032194792,0.00529821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99824536,0.00002457257,0.00068411144,0.0005363324,0.00005171585,0.0004579228],"domain_scores_gemma":[0.99853486,0.00028121847,0.0002687935,0.00071346853,0.000033858152,0.00016782418],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019781254,0.00021570202,0.00039208925,0.00018609574,0.00030700816,0.00009754776,0.0006458766,0.0001158285,0.00049342815],"category_scores_gemma":[0.0003229368,0.00021446272,0.00014824561,0.00033713898,0.00007097984,0.00041521262,0.00011256688,0.0002444265,0.0043855193],"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.000034313594,0.000041010207,0.015915189,0.000010243297,0.000046666657,0.000016381442,0.0017124228,0.000015247229,0.000023534898,0.96111786,0.02016251,0.00090459],"study_design_scores_gemma":[0.00047794502,0.0001644974,0.012166106,0.00005446716,0.00000839841,0.000008741758,0.00027313206,0.00005743703,0.0004470319,0.16095912,0.82491875,0.00046436983],"about_ca_topic_score_codex":0.00020951313,"about_ca_topic_score_gemma":0.00007872624,"teacher_disagreement_score":0.8047562,"about_ca_system_score_codex":0.00024048745,"about_ca_system_score_gemma":0.0000333678,"threshold_uncertainty_score":0.9963897},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9306364,0.00006152009,0.06697972,0.00012572327,0.00039807806,0.00016911015,0.0000029559897,0.00005758496,0.0015689114],"genre_scores_gemma":[0.9917573,0.0000030503359,0.008027248,0.000021674883,0.000004054207,0.0000121893345,0.0000025215365,0.000008484996,0.00016349203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988814,0.00010997756,0.00025938268,0.00021816077,0.0003463929,0.0001846567],"domain_scores_gemma":[0.9989176,0.00023200309,0.00014573781,0.00044604662,0.00020499663,0.0000536141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032795896,0.00009152816,0.0001560512,0.00024491685,0.00008111522,0.00001493059,0.00039740492,0.0000435082,0.000019096185],"category_scores_gemma":[0.00014983556,0.00009109278,0.000074028074,0.0008506234,0.000080210615,0.0003119006,0.00011983691,0.00009180882,0.000010851238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016996502,0.00015126557,0.00021314081,0.000009742235,0.000012713789,7.178964e-7,0.00022483937,0.0016760424,0.02179645,0.9695618,0.00014290855,0.0061933636],"study_design_scores_gemma":[0.0009431753,0.0003946625,0.0011761856,0.000030593696,0.0000049223686,0.0000031236293,0.00002609828,0.019478098,0.05495162,0.92281425,0.000050002833,0.00012726309],"about_ca_topic_score_codex":0.000006416337,"about_ca_topic_score_gemma":0.0000012916951,"teacher_disagreement_score":0.06112089,"about_ca_system_score_codex":0.000032351978,"about_ca_system_score_gemma":0.0000355882,"threshold_uncertainty_score":0.37146556},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9010694,0.00014313369,0.000047179852,0.000014986872,0.005278132,0.000106683896,0.000002371672,0.00030853797,0.09302959],"genre_scores_gemma":[0.99953645,0.0000059330605,0.000028816832,0.00004210289,0.0000070893566,0.000017017644,0.0000020360785,0.000030084417,0.00033044905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931586,0.000058175236,0.00014586089,0.00012904355,0.00011314526,0.00023789634],"domain_scores_gemma":[0.99956447,0.000056402274,0.000015665513,0.0002690087,0.000018625047,0.00007583479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018853426,0.00014476094,0.00014844768,0.00006602777,0.000054434662,0.000027996415,0.00012599365,0.00008528485,0.00007148806],"category_scores_gemma":[0.00004076649,0.00013693291,0.000071350216,0.00018059037,0.00002425825,0.00006330285,0.0000064994047,0.00019502614,0.00034975883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005622211,0.000029763856,0.00040901298,0.000018171788,0.000018811177,0.000009937402,0.0001995128,0.00013957068,0.0009452901,0.99484897,0.00305951,0.00031582447],"study_design_scores_gemma":[0.0013024234,0.00017294778,0.0009870245,0.00009731158,0.000018314215,0.000020794301,0.00015840937,0.00063593365,0.037902508,0.86920834,0.088962466,0.000533538],"about_ca_topic_score_codex":0.000004647557,"about_ca_topic_score_gemma":0.0000023457815,"teacher_disagreement_score":0.12564065,"about_ca_system_score_codex":0.000042937107,"about_ca_system_score_gemma":0.0000083712575,"threshold_uncertainty_score":0.5583962},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9378834,0.000024035224,0.000092580965,0.010746332,0.00049394567,0.00019499929,0.000010556526,0.00006623018,0.050487965],"genre_scores_gemma":[0.9959232,0.0000034545744,0.00007607054,0.0012311861,0.000028952527,0.000040540137,0.0000030459182,0.0000096282665,0.002683898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982549,0.00026831627,0.00030905468,0.00031167187,0.0006623314,0.00019374056],"domain_scores_gemma":[0.9966812,0.002090342,0.00018666798,0.00082447036,0.00013404875,0.00008323254],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014053887,0.00012335049,0.00015883677,0.00006947964,0.00037465958,0.00017588308,0.0007860488,0.00004452761,0.0012198034],"category_scores_gemma":[0.0006410178,0.00007734187,0.00009583923,0.00051442074,0.0001522579,0.00017259853,0.00007350649,0.00017750732,0.005702883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000129221025,0.000115278366,0.0006174923,2.7872701e-7,0.00000525873,9.24924e-7,0.00018067728,0.00010755967,0.000109848836,0.9693343,0.026211485,0.0033039676],"study_design_scores_gemma":[0.0003936417,0.000031357475,0.0053253705,0.000012815062,0.0000060042516,0.0000028851196,0.00064880686,0.00046740464,0.00069220725,0.92735827,0.06495627,0.00010499249],"about_ca_topic_score_codex":0.000010732894,"about_ca_topic_score_gemma":0.00007579518,"teacher_disagreement_score":0.058039866,"about_ca_system_score_codex":0.000039726074,"about_ca_system_score_gemma":0.000019132865,"threshold_uncertainty_score":0.9996932},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9790492,0.00022808799,0.0014019767,0.00010732904,0.00083319185,0.0004331042,0.000013634392,0.00015328146,0.017780181],"genre_scores_gemma":[0.9544365,0.00007392679,0.044295367,0.000027344424,0.000010736913,0.000028713466,0.0000046059195,0.000040287676,0.0010825326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843615,0.000068677065,0.0005318084,0.0002446522,0.0004135155,0.00030518282],"domain_scores_gemma":[0.99813,0.000692955,0.00027961828,0.000534098,0.00025927494,0.00010404848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032844182,0.00019213792,0.0004806341,0.00007186975,0.00011951772,0.0000065693234,0.00028050924,0.0001142696,0.0003976513],"category_scores_gemma":[0.0011975487,0.0001828814,0.000100034886,0.0003355191,0.0002491893,0.00021511565,0.00011592329,0.00021352846,0.0000533854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031946478,0.00038851067,0.000054850214,0.00025187203,0.00003200823,0.0000058423147,0.0009009292,5.586121e-7,0.00092794554,0.99563944,0.0010563383,0.0007097594],"study_design_scores_gemma":[0.00065708585,0.00018603794,0.000071399,0.0001617385,0.000021003114,0.000016732767,0.00008746757,0.000024935136,0.022077851,0.9755591,0.0009351217,0.00020151399],"about_ca_topic_score_codex":0.0000020066832,"about_ca_topic_score_gemma":0.0000024217838,"teacher_disagreement_score":0.04289339,"about_ca_system_score_codex":0.00007617914,"about_ca_system_score_gemma":0.000066854926,"threshold_uncertainty_score":0.74576867},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940481,0.00015621519,0.0005267504,0.0000039163915,0.0009337299,0.000093257746,0.000005626212,0.00007608159,0.0041563283],"genre_scores_gemma":[0.99974734,0.0000142998815,0.00016265687,0.0000019917816,0.00000808252,0.0000031919049,0.0000061507662,0.000017033344,0.00003927225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999315,0.000036100486,0.00031991486,0.00008522764,0.00010240682,0.00014131397],"domain_scores_gemma":[0.9994873,0.0001094865,0.00007599911,0.00021773991,0.00006875379,0.000040750623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000640588,0.000089655965,0.00018558673,0.00008187881,0.000020460522,0.0000033814797,0.00012738432,0.00007907639,0.0000127008725],"category_scores_gemma":[0.000027476794,0.00009196503,0.00005479685,0.00020918122,0.00004958089,0.000066679175,0.000010501312,0.000086167944,0.000010861272],"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.000040649153,0.00007271597,0.0042623985,0.00016685751,0.00006948538,0.000002151295,0.0005715997,0.0013533094,0.15894815,0.8337629,0.00019303699,0.00055672653],"study_design_scores_gemma":[0.0018660672,0.0002907102,0.07937274,0.00018882571,0.000067844696,0.000006679111,0.00122526,0.022395195,0.8220403,0.069544226,0.0025210427,0.0004811051],"about_ca_topic_score_codex":0.000007154466,"about_ca_topic_score_gemma":0.000001731647,"teacher_disagreement_score":0.7642187,"about_ca_system_score_codex":0.0000188445,"about_ca_system_score_gemma":0.00000783813,"threshold_uncertainty_score":0.3750225},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73979425,0.002458537,0.103894845,0.0027995822,0.012297928,0.0016533439,0.00003857047,0.0022836328,0.1347793],"genre_scores_gemma":[0.9864031,0.000022806344,0.012890305,0.0002431529,0.0000028374407,0.000033720422,0.000001973048,0.0000211721,0.00038092048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794644,0.00027540562,0.0002273486,0.00048128288,0.0004815224,0.0005879932],"domain_scores_gemma":[0.99763274,0.00023386374,0.00006890286,0.0017070619,0.00013748041,0.0002199332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062774617,0.00017948421,0.0002028003,0.0002081427,0.00024067822,0.00013181225,0.0018811328,0.00006159643,0.00005059851],"category_scores_gemma":[0.0003169429,0.0001779399,0.00010140926,0.0012099015,0.00015266846,0.0005429969,0.00036971128,0.0002621537,0.00029421665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034334698,0.000064139596,0.0015254306,0.000004985862,0.000014463043,0.000022775066,0.00008720814,0.000008203917,0.0010920595,0.9943916,0.002164279,0.00062141276],"study_design_scores_gemma":[0.00076407427,0.000091908114,0.0007661023,0.000007974844,0.0000022643674,0.000014715823,0.000009641749,0.00037782395,0.0026486325,0.96898925,0.026117124,0.00021046364],"about_ca_topic_score_codex":0.0000065685012,"about_ca_topic_score_gemma":0.0000030175538,"teacher_disagreement_score":0.24660885,"about_ca_system_score_codex":0.000039756032,"about_ca_system_score_gemma":0.00006035594,"threshold_uncertainty_score":0.7256178},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98307616,0.0022064375,0.00003303697,0.000008103822,0.0034505778,0.00021684058,0.0000073832034,0.000108103464,0.01089334],"genre_scores_gemma":[0.9997102,0.000013825886,0.0000073119704,0.000008318208,0.0000074479144,0.000023204044,0.0000026716548,0.000029545356,0.00019744915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988947,0.0002131993,0.00032630155,0.00012707364,0.0001967477,0.00024197924],"domain_scores_gemma":[0.99939054,0.000127872,0.00007409476,0.00030579075,0.00004217367,0.000059505226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007596741,0.00015473235,0.00024269713,0.000054582575,0.00015145105,0.00003321079,0.00021744774,0.00010155743,0.000014739214],"category_scores_gemma":[0.000077426135,0.00012551222,0.0000715702,0.00029950961,0.000065048574,0.00009736959,0.000020295314,0.00015785087,0.000008739223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027472855,0.00009027739,0.008321655,0.00016701514,0.00013007992,0.0000034737354,0.0012285735,0.00024852104,0.026644645,0.9514091,0.011619585,0.00010957949],"study_design_scores_gemma":[0.010868173,0.0010656349,0.0075249164,0.0013074707,0.00037153915,0.00045985662,0.010294575,0.018702483,0.21320188,0.39195895,0.34107336,0.0031711794],"about_ca_topic_score_codex":0.00008132238,"about_ca_topic_score_gemma":7.936001e-7,"teacher_disagreement_score":0.5594502,"about_ca_system_score_codex":0.00003568414,"about_ca_system_score_gemma":0.0000151052545,"threshold_uncertainty_score":0.51182395},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99534297,0.002497008,0.000034702392,0.000005039721,0.0005762988,0.00009876095,0.000005630716,0.00008004847,0.0013595471],"genre_scores_gemma":[0.99973893,0.00019056941,0.000027497452,0.000006491548,0.0000063272983,0.0000023123455,0.0000026964065,0.00001504784,0.000010149102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993712,0.000010754194,0.00020723006,0.00011942425,0.000107950415,0.0001834542],"domain_scores_gemma":[0.999657,0.000063553554,0.00003812594,0.00014108104,0.000021061293,0.000079174475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003657421,0.00011277585,0.00018953954,0.00008334291,0.0000367332,0.000015519809,0.00007530717,0.000072794144,0.000004381541],"category_scores_gemma":[0.000007984181,0.000102380785,0.00002497869,0.00015546501,0.00006185732,0.0000817688,0.000019648189,0.00008600703,0.0000026884952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026866632,0.00005120613,0.08570719,0.00088363315,0.00017868471,0.00010079047,0.0021965925,0.00006745737,0.20445277,0.70014733,0.00025283505,0.0059346748],"study_design_scores_gemma":[0.003320582,0.0003694065,0.15070528,0.0006718913,0.00018151192,0.0008789987,0.0029437528,0.0043414305,0.103603534,0.72801644,0.0033841594,0.0015830282],"about_ca_topic_score_codex":0.000036949627,"about_ca_topic_score_gemma":0.000004026094,"teacher_disagreement_score":0.10084924,"about_ca_system_score_codex":0.000015716,"about_ca_system_score_gemma":0.0000046141668,"threshold_uncertainty_score":0.4174967},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9881425,0.00042391167,0.000051680094,0.00041067673,0.0009523852,0.00008698571,9.935068e-7,0.00019896157,0.009731937],"genre_scores_gemma":[0.99528885,0.0000717665,0.00409685,0.00018291584,5.3683624e-7,0.0000057954608,0.0000012747984,0.000008143791,0.00034385064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988553,0.000061683764,0.00026704787,0.0002934436,0.00028057967,0.00024196657],"domain_scores_gemma":[0.9990086,0.00007626089,0.00007690621,0.00063812715,0.000104081955,0.000096038086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024790608,0.00012314983,0.00018629356,0.00011209029,0.00008831701,0.000047673722,0.00063468737,0.00004776778,0.000079169055],"category_scores_gemma":[0.000018092116,0.000112968926,0.00009058467,0.0006807807,0.00008130158,0.0002493428,0.0000769576,0.000104376784,0.000111500725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035715054,0.000111507594,0.0013048057,0.0000061614946,0.000012462975,0.0000050466024,0.000114285474,0.000034384633,0.0007448324,0.98913145,0.0017535726,0.006777937],"study_design_scores_gemma":[0.0007116256,0.000104888335,0.0011254989,0.000022436243,0.0000059939775,0.000006987658,0.000006068285,0.0009269214,0.0050192545,0.9901237,0.0018077039,0.00013891603],"about_ca_topic_score_codex":0.0000803769,"about_ca_topic_score_gemma":0.000002423627,"teacher_disagreement_score":0.009388086,"about_ca_system_score_codex":0.000007737298,"about_ca_system_score_gemma":0.00004014485,"threshold_uncertainty_score":0.4606739},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95653594,0.00017287029,0.015352728,0.000447116,0.007682161,0.00019586566,0.000002065135,0.00020275533,0.019408524],"genre_scores_gemma":[0.9992532,0.000017408545,0.00024852031,0.00010178378,0.000013082577,0.000011229126,6.8498076e-7,0.00000857034,0.0003455026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988473,0.00010161476,0.000281621,0.00027745223,0.0002476126,0.0002444192],"domain_scores_gemma":[0.9985686,0.00015104085,0.0001370464,0.0009051744,0.0001619288,0.00007618848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037289405,0.000122053694,0.00023279763,0.00011652806,0.00008643492,0.000059800044,0.000959488,0.00007684369,0.000027298982],"category_scores_gemma":[0.0000756173,0.00011585908,0.00011161027,0.0005819011,0.00004238414,0.00033047365,0.0002111437,0.000115415176,0.000024425002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062011336,0.000095196025,0.0035958798,0.0000108352015,0.000020190639,0.000015463813,0.00018893144,0.000030711322,0.00023108102,0.9882073,0.006324807,0.0012734317],"study_design_scores_gemma":[0.0012248924,0.00025389795,0.003809842,0.00007341943,0.0000048652087,0.000077334735,0.000045323435,0.013032168,0.002066691,0.97367394,0.0054840385,0.00025355886],"about_ca_topic_score_codex":0.00008994428,"about_ca_topic_score_gemma":0.000021778838,"teacher_disagreement_score":0.042717304,"about_ca_system_score_codex":0.000028589997,"about_ca_system_score_gemma":0.000030239042,"threshold_uncertainty_score":0.4724596},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9835837,0.00019545843,0.0007575332,0.00004830126,0.0004326448,0.0003705012,0.000033409342,0.00012569729,0.01445278],"genre_scores_gemma":[0.99293154,0.000014704834,0.006729689,0.000011483687,0.000005600276,0.000014870594,0.0000073882134,0.000042958218,0.00024175827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822855,0.00007577768,0.0007499964,0.00022444596,0.00042253302,0.00029868635],"domain_scores_gemma":[0.99669874,0.0019065841,0.0005217974,0.0005708111,0.00023362282,0.00006841909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030687265,0.00022288038,0.0006702138,0.00027453003,0.000049581708,0.000008871646,0.00030758508,0.00012368488,0.00007315184],"category_scores_gemma":[0.0014284682,0.00020659142,0.00017075804,0.0011936666,0.00032605967,0.00012613002,0.000079562684,0.00013764709,0.000015215408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028300085,0.0004957675,0.0007755952,0.00022903449,0.000056209574,0.0000041545977,0.000104013896,0.000005200404,0.0065545845,0.9907966,0.00087065814,0.000079852056],"study_design_scores_gemma":[0.0011289716,0.00014028033,0.0005211636,0.00010036588,0.000069546186,0.0000037548175,0.00008953854,0.000030481651,0.07067833,0.9269187,0.00013356835,0.00018529284],"about_ca_topic_score_codex":0.00004131651,"about_ca_topic_score_gemma":0.00000365017,"teacher_disagreement_score":0.06412374,"about_ca_system_score_codex":0.00004331957,"about_ca_system_score_gemma":0.000032468197,"threshold_uncertainty_score":0.8424553},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901594,0.00013587573,0.0017657042,0.0002897864,0.0005951038,0.00031099236,0.0000010358668,0.0000677657,0.006674365],"genre_scores_gemma":[0.9984626,0.0000828293,0.000423444,0.000024030287,0.000005674677,0.000042396056,0.000002087437,0.000009921725,0.00094700453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984106,0.00025294075,0.0002616832,0.00025548704,0.000568256,0.00025104507],"domain_scores_gemma":[0.9985837,0.0005417441,0.000099129924,0.00059121323,0.00012491163,0.000059330483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006521355,0.00011008875,0.00014200155,0.000066057764,0.00022710064,0.000071936534,0.00079916435,0.000055563705,0.00014522899],"category_scores_gemma":[0.00007822732,0.000084180836,0.000079120764,0.0005540612,0.00012132899,0.0005538587,0.000107778826,0.00015401082,0.00009154632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023813013,0.00014081235,0.0017619316,0.0000048990446,0.000026169984,0.000008847707,0.00096338085,0.00012238842,0.0013737683,0.9357376,0.000708128,0.058913957],"study_design_scores_gemma":[0.0038863735,0.000115161514,0.026624333,0.000017187776,0.000005232313,0.0000073122574,0.00007780792,0.006385727,0.0059961597,0.95522076,0.0015015,0.00016242488],"about_ca_topic_score_codex":0.000013513059,"about_ca_topic_score_gemma":0.0000054389643,"teacher_disagreement_score":0.058751535,"about_ca_system_score_codex":0.000057471116,"about_ca_system_score_gemma":0.00004501358,"threshold_uncertainty_score":0.34327948},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99599683,0.00025445083,0.00004960794,0.0007713145,0.0007727485,0.00015983765,0.0000023832777,0.000049756258,0.0019430409],"genre_scores_gemma":[0.9992468,0.000017803295,0.00059002405,0.00006549103,6.520726e-7,0.000008470027,0.0000011743483,0.000008017977,0.00006157674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987628,0.00012382005,0.00029127902,0.0002042437,0.00042068993,0.00019718404],"domain_scores_gemma":[0.9985611,0.00015499475,0.00025098695,0.00080925267,0.00019314037,0.000030521653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003491152,0.00012209377,0.00016298097,0.00004774936,0.00026734383,0.000045455585,0.0008117459,0.00004572111,0.000001972182],"category_scores_gemma":[0.000006845813,0.000063295534,0.00012327009,0.0007443283,0.0002859467,0.00016824859,0.00014180515,0.000114263516,0.000004040711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007887917,0.000116113595,0.014274226,0.000007651066,0.000022861608,5.9853573e-7,0.00006407805,0.000043977765,0.0017677249,0.98280704,0.00073188095,0.00015595197],"study_design_scores_gemma":[0.00050022005,0.00005516681,0.013411494,0.00004449584,0.000016937673,0.000007979092,0.000009987326,0.00034443956,0.022706464,0.9627645,0.000050979594,0.000087343986],"about_ca_topic_score_codex":0.00022464182,"about_ca_topic_score_gemma":0.000007503478,"teacher_disagreement_score":0.02093874,"about_ca_system_score_codex":0.00000785177,"about_ca_system_score_gemma":0.000037217826,"threshold_uncertainty_score":0.2581117},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93727964,0.000051523857,0.0003769278,0.00094160996,0.00052058714,0.00034120126,0.0000068434033,0.0002571352,0.060224537],"genre_scores_gemma":[0.9905502,0.000060554652,0.0031401468,0.00048952195,0.00007651451,0.00010353247,0.0000085134825,0.00004893648,0.0055220574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988185,0.00006187168,0.00034069273,0.00022153324,0.0002645967,0.00029280427],"domain_scores_gemma":[0.99854904,0.00064913934,0.00010620798,0.00053104234,0.000053286818,0.00011127551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003369283,0.0001695889,0.00026455958,0.000040194176,0.00015109021,0.000051212006,0.00024180513,0.000084443076,0.00080718804],"category_scores_gemma":[0.00024706486,0.00014243089,0.00010238854,0.00015725003,0.00005256282,0.00007707278,0.000052489075,0.00015521975,0.00029643482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105125855,0.0002537111,0.00003526545,0.00002889028,0.000021520791,0.0000045430697,0.00022269797,0.000002021205,0.00014931631,0.98779595,0.011331479,0.00014409208],"study_design_scores_gemma":[0.00058444706,0.000040004245,0.000014642824,0.00003961774,0.000020258783,0.0000053128897,0.00013710227,0.0004013385,0.0005675768,0.99116373,0.006844713,0.00018124476],"about_ca_topic_score_codex":0.00002136812,"about_ca_topic_score_gemma":0.0000013362443,"teacher_disagreement_score":0.05470248,"about_ca_system_score_codex":0.00004298389,"about_ca_system_score_gemma":0.000014912151,"threshold_uncertainty_score":0.8838143},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99385047,0.00026912653,0.00023081958,0.00039121837,0.00085578754,0.00008881153,6.9287836e-7,0.0001830389,0.0041300277],"genre_scores_gemma":[0.98797596,0.000007512207,0.01165831,0.0002865269,4.596238e-7,0.0000059566028,0.0000013407642,0.0000105239715,0.000053434494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874276,0.000056969868,0.00030498195,0.0002895862,0.00035641258,0.00024926037],"domain_scores_gemma":[0.9988896,0.00014839957,0.00013877534,0.00064900797,0.000078008925,0.00009619625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034249225,0.00013884893,0.00020489885,0.00015974956,0.00009791289,0.000040737345,0.0005472803,0.00006346728,0.000013357739],"category_scores_gemma":[0.000059206533,0.00013002912,0.00009528418,0.0005091322,0.00006458573,0.00020430527,0.00010486762,0.00011688768,0.00015439281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023605853,0.000116046416,0.0003118642,0.0000107274545,0.000016553364,0.0000027691133,0.0002534165,0.00023363094,0.0006961674,0.99399,0.0018034864,0.002562947],"study_design_scores_gemma":[0.00065792294,0.00018367384,0.00028999217,0.000078472156,0.0000073445,0.00000530495,0.000009769353,0.004667793,0.006957957,0.9868431,0.00014729316,0.00015138306],"about_ca_topic_score_codex":0.000023434259,"about_ca_topic_score_gemma":0.0000016169661,"teacher_disagreement_score":0.011427491,"about_ca_system_score_codex":0.000020440217,"about_ca_system_score_gemma":0.000035669083,"threshold_uncertainty_score":0.53024334},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8919855,0.0001204506,0.011346691,0.00016266847,0.00037735875,0.00031551492,0.000011483019,0.00003096119,0.095649384],"genre_scores_gemma":[0.9982655,0.000005956589,0.0010463032,0.000007026736,0.000014993718,0.000016456097,0.0000036219699,0.00000976725,0.0006303902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993643,0.000009910221,0.00021338704,0.000108279,0.00011580661,0.00018831114],"domain_scores_gemma":[0.9991884,0.00029558674,0.000117701136,0.00027566927,0.00007064308,0.000051992145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024523956,0.00007266235,0.00010390629,0.000013765434,0.00018080883,0.00001821981,0.00018302943,0.000017078013,0.000046730864],"category_scores_gemma":[0.000014130312,0.000052244533,0.000055400997,0.00018810463,0.00009739696,0.000058835474,0.000052415537,0.00008060701,0.000031401567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071795694,0.00008911391,0.0006731448,0.0000034055367,0.000016781705,1.0487347e-7,0.000066600616,0.0000012496929,0.0007472497,0.9922672,0.00023863447,0.005889364],"study_design_scores_gemma":[0.00021940673,0.000019629151,0.0011104218,0.000009440121,0.000009725667,1.4343455e-7,0.0003669672,0.000011697559,0.013740429,0.9768628,0.0075864648,0.000062878295],"about_ca_topic_score_codex":0.000016847158,"about_ca_topic_score_gemma":1.7242235e-7,"teacher_disagreement_score":0.10627999,"about_ca_system_score_codex":0.000010035968,"about_ca_system_score_gemma":0.000015285817,"threshold_uncertainty_score":0.21304703},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892996,0.000019759209,0.00003949466,0.0002125381,0.0005875522,0.00034268128,0.000022299142,0.00008490013,0.009391207],"genre_scores_gemma":[0.9904722,0.000019422505,0.009084348,0.000028418834,0.000014374699,0.00003036503,0.000017901708,0.000037028865,0.0002959545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787253,0.00009682919,0.0005980874,0.00032396903,0.0007484827,0.00036012425],"domain_scores_gemma":[0.99770325,0.0012093284,0.00028454635,0.00044120473,0.00016211538,0.00019955957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039786682,0.00025091515,0.0005524641,0.00027786783,0.00013610163,0.0000140585025,0.0002926855,0.00016364979,0.00014532174],"category_scores_gemma":[0.00042633357,0.00021288556,0.00016083375,0.00060382386,0.00021187053,0.000083319035,0.000096144504,0.00029374423,0.000052738065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014654262,0.0007363073,0.0017772774,0.00006676157,0.000040729938,0.00010491141,0.0002020904,0.0000021076025,0.0010496503,0.99538356,0.0003791289,0.00024283744],"study_design_scores_gemma":[0.0009465963,0.00020083594,0.0032836606,0.00013093364,0.0000536961,0.0000537649,0.000041144718,0.012540357,0.00083751517,0.98160404,0.000020978354,0.00028649636],"about_ca_topic_score_codex":0.00009116747,"about_ca_topic_score_gemma":0.000007674482,"teacher_disagreement_score":0.013779523,"about_ca_system_score_codex":0.00010435075,"about_ca_system_score_gemma":0.00008388669,"threshold_uncertainty_score":0.8681221},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9757662,0.0005492198,0.000080620186,0.00047634586,0.0006279212,0.00011184255,0.000072437855,0.000009596573,0.022305805],"genre_scores_gemma":[0.9995449,0.00006415514,0.000053549604,0.00011948976,0.000004528225,0.000007488224,0.0000016004876,0.0000119966235,0.00019229706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992024,0.000007642048,0.00042750777,0.00017353523,0.000022660826,0.00016626032],"domain_scores_gemma":[0.9991977,0.00007213162,0.00030456387,0.0003761099,0.00001941033,0.000030082445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004231553,0.000087815046,0.00028654732,0.000054772237,0.000050550596,0.000009529831,0.0002835261,0.00005422464,0.000118258075],"category_scores_gemma":[0.00008448586,0.000080139005,0.00010757066,0.000100635414,0.00009489511,0.00007698517,0.0000397544,0.00008562391,0.00006699783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010419041,0.00012124675,0.0010193649,0.000013927639,0.000023624998,3.3044967e-7,0.00050865917,0.00007137669,0.00003702039,0.9980278,0.0001428496,0.000023357356],"study_design_scores_gemma":[0.00067226804,0.000099455174,0.0014396339,0.000023701215,0.000002551367,5.139882e-7,0.00011704649,0.00008644771,0.0025639895,0.9939285,0.0009785496,0.000087365224],"about_ca_topic_score_codex":0.00011011594,"about_ca_topic_score_gemma":0.0000055230776,"teacher_disagreement_score":0.023778684,"about_ca_system_score_codex":0.0000434615,"about_ca_system_score_gemma":0.000018338838,"threshold_uncertainty_score":0.3267974},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.989117,0.00003415585,0.005031413,0.000942228,0.00028488462,0.00022238737,0.0000012240005,0.0000805125,0.0042861723],"genre_scores_gemma":[0.999221,0.000013526628,0.00045156592,0.00013051528,0.000002386369,0.000023024659,4.2583903e-7,0.000010847829,0.00014668691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986498,0.00017676565,0.00012571429,0.00029631195,0.0004552797,0.0002961348],"domain_scores_gemma":[0.9977097,0.0010369731,0.00008380751,0.0009684613,0.00013082383,0.00007026933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043401294,0.00012767452,0.00016340043,0.0001168272,0.0001489975,0.000044671488,0.0010770907,0.00003483663,0.000023579485],"category_scores_gemma":[0.00012472869,0.00007858431,0.00004853169,0.0010773962,0.00021131634,0.00024780686,0.00016329798,0.00021809015,0.000025060592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053810352,0.00012302649,0.003663346,0.0000029476787,0.000021837908,0.000020181304,0.000119671306,0.00004246879,0.00021345787,0.99461836,0.00017653947,0.0009443716],"study_design_scores_gemma":[0.00055843074,0.00053874525,0.007340908,0.000021946234,0.000002380076,0.000010413599,0.000023442322,0.00027346984,0.004706771,0.9861171,0.00029463824,0.00011171265],"about_ca_topic_score_codex":0.000027756845,"about_ca_topic_score_gemma":0.000008300582,"teacher_disagreement_score":0.010103998,"about_ca_system_score_codex":0.000021614369,"about_ca_system_score_gemma":0.000042887405,"threshold_uncertainty_score":0.3204575},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9763192,0.0014278122,0.0035177998,0.00032411344,0.0041655377,0.00016887732,7.887313e-7,0.0002879521,0.0137879215],"genre_scores_gemma":[0.9802381,0.000043833705,0.01929545,0.00010734675,2.715451e-7,0.0000027352507,5.123529e-7,0.0000075578664,0.0003041834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989312,0.0000680472,0.00024417648,0.00026702075,0.00026380626,0.00022569144],"domain_scores_gemma":[0.99900234,0.00007054897,0.00009760107,0.00059798436,0.000105574254,0.00012597606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028319063,0.00012093265,0.00018031364,0.00015106033,0.000072824114,0.00003852716,0.00047701586,0.0000586976,0.000014899112],"category_scores_gemma":[0.00007707233,0.000111505324,0.0000847386,0.000746802,0.000046229598,0.00019629048,0.000074177944,0.00009572396,0.000037113165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001101623,0.000047573205,0.0022942363,0.0000060850443,0.000011534972,0.0000024499861,0.0002039916,0.000009574374,0.0009808779,0.99036807,0.004429832,0.0016446508],"study_design_scores_gemma":[0.0005468231,0.00008635413,0.0006401831,0.000015924694,0.000005001869,0.0000050697554,0.00002001206,0.00009364159,0.015778955,0.9803748,0.002306366,0.00012683155],"about_ca_topic_score_codex":0.00008119646,"about_ca_topic_score_gemma":0.0000020724801,"teacher_disagreement_score":0.015777651,"about_ca_system_score_codex":0.0000075677926,"about_ca_system_score_gemma":0.000095245894,"threshold_uncertainty_score":0.45470554},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96813273,0.0041588936,0.00084241247,0.000090873036,0.005344998,0.0005996337,0.000010430545,0.00030762958,0.020512417],"genre_scores_gemma":[0.9996157,0.000089022455,0.00006208241,0.000005899167,0.000011732017,0.000043433338,8.1869143e-7,0.000021423022,0.00014988288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941653,0.000032168908,0.00018397797,0.00008245761,0.000088273184,0.00019661018],"domain_scores_gemma":[0.99938923,0.00027008122,0.000032463093,0.00023971421,0.00003261818,0.00003586578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020927322,0.00009790831,0.00013271133,0.000037298018,0.00010021676,0.000021631526,0.00019273945,0.000038177248,0.000018392248],"category_scores_gemma":[0.000023177692,0.00007619393,0.0000955311,0.00016789728,0.000050729435,0.00005366672,0.0000072175535,0.00006628653,0.000015067169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058902447,0.000022482887,0.00016910955,0.000038946997,0.000055393455,7.9971164e-7,0.00015595104,0.0001447034,0.003731269,0.9885359,0.006458304,0.00068124215],"study_design_scores_gemma":[0.0009601398,0.00011663285,0.00025805022,0.00003120885,0.00002788219,0.0000049800146,0.00015354618,0.0035979415,0.036385074,0.9451937,0.013075208,0.00019562716],"about_ca_topic_score_codex":0.0000027362319,"about_ca_topic_score_gemma":0.0000031950465,"teacher_disagreement_score":0.0433422,"about_ca_system_score_codex":0.000012006802,"about_ca_system_score_gemma":0.0000023942089,"threshold_uncertainty_score":0.3107098},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99761635,0.00023410295,0.00026415294,0.000017672077,0.00016162754,0.00023171908,0.000004413962,0.000023397073,0.001446542],"genre_scores_gemma":[0.99737006,0.00006178733,0.0025037827,0.000006736249,9.193352e-7,0.000013208586,5.039915e-7,0.000007663695,0.000035329856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853283,0.0001575028,0.0004636664,0.00025075953,0.0003431479,0.0002520923],"domain_scores_gemma":[0.9986949,0.00037325762,0.00015144054,0.0005874525,0.00013573321,0.00005719438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006337396,0.00010838959,0.0003702155,0.00030144735,0.000024845993,0.000006062907,0.0009434452,0.00006309666,0.000011688078],"category_scores_gemma":[0.00011040227,0.000110057495,0.000099279576,0.001389983,0.00019974887,0.00025470532,0.00016001407,0.00014637843,0.0000030972694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014211531,0.0004314543,0.019793043,0.00006909831,0.000021297868,0.000007261934,0.00090054894,0.00018582233,0.023049183,0.93873525,0.000017811295,0.01664709],"study_design_scores_gemma":[0.002684745,0.0003774783,0.06567761,0.000107166255,0.0000037815234,0.0000012782497,0.00007573995,0.0025680687,0.095517814,0.8327637,0.000068130714,0.00015452594],"about_ca_topic_score_codex":0.000108325294,"about_ca_topic_score_gemma":0.000008406408,"teacher_disagreement_score":0.10597162,"about_ca_system_score_codex":0.00002521272,"about_ca_system_score_gemma":0.000059057336,"threshold_uncertainty_score":0.44880146},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9865179,0.0016896921,0.00030956304,0.000048845253,0.005420874,0.00063613616,0.0000036421438,0.00027756917,0.0050957897],"genre_scores_gemma":[0.999324,0.000050460814,0.00002275441,0.000007296557,0.000026312055,0.00016950944,0.0000029489772,0.000030649688,0.00036607028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992918,0.00004509618,0.00020556299,0.00013169472,0.00008501059,0.00024088736],"domain_scores_gemma":[0.9995585,0.000117448115,0.000034748755,0.00019215269,0.000038905542,0.000058231755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000376924,0.00012875606,0.00013803439,0.000024249905,0.00026882364,0.00019316771,0.00011798149,0.00007596519,0.0000022612635],"category_scores_gemma":[0.00001603837,0.00010217108,0.00004904892,0.00012220984,0.00004860748,0.00011309413,0.000016796119,0.0001054282,0.000013238514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053760188,0.000021440026,0.0012494195,0.0002008146,0.00010861635,0.0000037580614,0.0007154782,0.00062091305,0.0005846252,0.9865583,0.007576181,0.0023066925],"study_design_scores_gemma":[0.0024797246,0.0004156145,0.0010636793,0.0002720718,0.00007417226,0.0001443843,0.002312682,0.06228362,0.00074116647,0.54186755,0.38768646,0.0006588846],"about_ca_topic_score_codex":0.000023488616,"about_ca_topic_score_gemma":0.000006049355,"teacher_disagreement_score":0.44469076,"about_ca_system_score_codex":0.000049050013,"about_ca_system_score_gemma":0.000007927942,"threshold_uncertainty_score":0.41664156},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933645,0.000113189795,0.0003128851,0.00035264867,0.00080311,0.00055440003,0.0000025696722,0.00008165939,0.0044150148],"genre_scores_gemma":[0.9764516,0.0000075828566,0.023058627,0.0001269476,0.0000072146445,0.000060888793,1.2967621e-7,0.000038682585,0.00024833865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836075,0.00021879803,0.00044396365,0.0002544078,0.00041807967,0.00030400115],"domain_scores_gemma":[0.998049,0.000857423,0.0001850296,0.000685638,0.0001429119,0.00007998257],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0005779508,0.00022360202,0.00039916812,0.00004974154,0.00014880134,0.000027020034,0.0003846895,0.000055971384,0.000029634251],"category_scores_gemma":[0.008678726,0.00013242326,0.000113839655,0.00031360908,0.00016496383,0.00009365769,0.00010792181,0.00017238177,0.000031115942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003048354,0.00011787416,0.00008310235,0.00009227307,0.000024558258,0.0000015156663,0.0007771423,0.000041168205,0.015833223,0.9827884,0.00009596309,0.00011429688],"study_design_scores_gemma":[0.00034076706,0.000064671396,0.0000074259297,0.0002975812,0.0000174327,0.000003638985,0.00010475353,0.000014010148,0.31840333,0.6803271,0.00029261076,0.00012667409],"about_ca_topic_score_codex":0.000008100615,"about_ca_topic_score_gemma":0.0000054552243,"teacher_disagreement_score":0.3025701,"about_ca_system_score_codex":0.0000747386,"about_ca_system_score_gemma":0.000054309527,"threshold_uncertainty_score":0.9996716},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9293462,0.00022247342,0.06262648,0.0019503012,0.0037712269,0.00013329097,0.0000048432894,0.00029396755,0.0016511894],"genre_scores_gemma":[0.9892172,0.0000069484595,0.0101072565,0.00042442232,0.00003613275,0.000007747333,0.000053632037,0.0000063373536,0.00014030545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991024,0.000028637269,0.00016408971,0.00028712937,0.00025215885,0.00016556132],"domain_scores_gemma":[0.99938,0.0000792816,0.000054670974,0.0003256885,0.00007617701,0.00008416402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010281879,0.000109467546,0.00011247668,0.00011490142,0.00010900732,0.000118362455,0.0004325753,0.00005523206,0.000027708566],"category_scores_gemma":[0.00003268058,0.000110886365,0.000038121514,0.0006572867,0.000015973095,0.00035291674,0.000110473935,0.0000876039,0.00020757261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045617603,0.000108380176,0.000241045,0.0000020846549,0.000013970364,0.00002299933,0.0002035466,0.0037901555,0.0014413517,0.98605907,0.0011979393,0.006914883],"study_design_scores_gemma":[0.0014843658,0.000098932294,0.015607205,0.000014814992,0.0000062143286,0.0000129477385,0.0000072695007,0.0050552106,0.009009738,0.95970184,0.00877078,0.00023069957],"about_ca_topic_score_codex":0.00008986033,"about_ca_topic_score_gemma":0.000009245287,"teacher_disagreement_score":0.05987099,"about_ca_system_score_codex":0.000052225303,"about_ca_system_score_gemma":0.000098623146,"threshold_uncertainty_score":0.4521815},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9881443,0.00034586803,0.000014592174,0.000004610463,0.0020484468,0.000082426406,0.0000029404957,0.000202218,0.009154643],"genre_scores_gemma":[0.99979156,0.00004789717,0.000012460636,0.000005021564,0.000003927058,0.0000071157247,0.0000039919632,0.00002359682,0.000104398605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936,0.000029687006,0.00021304016,0.00010049136,0.0000949077,0.0002018524],"domain_scores_gemma":[0.99956393,0.000047352914,0.000032595843,0.00025589054,0.000028407301,0.000071822455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012668886,0.00012525059,0.00018728344,0.00010279962,0.000031971143,0.000010360694,0.00015970279,0.00007158621,0.00005221963],"category_scores_gemma":[0.000011975387,0.000120384335,0.00009067322,0.00034656381,0.000036306854,0.00006599773,0.000013965552,0.0000910771,0.00003067288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010445328,0.00006238254,0.12666582,0.000075049866,0.00009003323,0.000010468397,0.00051154615,0.0003276576,0.0073606363,0.86378855,0.0007403396,0.00035706637],"study_design_scores_gemma":[0.0012562709,0.00017273318,0.06475276,0.00012212343,0.000055443015,0.000017318062,0.00038613976,0.00078576244,0.055327047,0.8600752,0.016415205,0.0006340253],"about_ca_topic_score_codex":0.000019280038,"about_ca_topic_score_gemma":0.0000063301527,"teacher_disagreement_score":0.061913066,"about_ca_system_score_codex":0.000012153325,"about_ca_system_score_gemma":0.000004411433,"threshold_uncertainty_score":0.49091306},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.882383,0.00070609275,0.0000071023246,0.000025892738,0.003435735,0.00008947268,0.000002222725,0.0004355659,0.11291495],"genre_scores_gemma":[0.9992487,0.000042517957,0.000008194082,0.000040782455,0.000010523082,0.000013324257,0.0000011958966,0.000026165151,0.00060858956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942,0.000024349616,0.00012808573,0.00010816003,0.00012721265,0.00019222064],"domain_scores_gemma":[0.999604,0.000058620826,0.000015098512,0.00024535973,0.000011790873,0.00006511471],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008458391,0.0001162864,0.000121646175,0.000069412956,0.000049594986,0.0000263231,0.00014536468,0.00006477859,0.00036117356],"category_scores_gemma":[0.000010931598,0.00011539546,0.000054040695,0.00019929136,0.000013999559,0.00006562181,0.000009706836,0.0001252215,0.0014019015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026795885,0.000040222087,0.00022720061,0.000031692973,0.000028832354,0.000015714339,0.00016063073,0.0003794145,0.00021721196,0.9480665,0.049710575,0.0011193469],"study_design_scores_gemma":[0.0014205837,0.00017814247,0.0009522161,0.000094543495,0.000026145595,0.00002019378,0.0000738525,0.010442772,0.0030926608,0.9238189,0.05922871,0.00065126334],"about_ca_topic_score_codex":0.0000019993522,"about_ca_topic_score_gemma":3.310048e-7,"teacher_disagreement_score":0.11686574,"about_ca_system_score_codex":0.00002839238,"about_ca_system_score_gemma":9.3505776e-7,"threshold_uncertainty_score":0.99937564},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9751483,0.0009926675,0.000014638495,0.000009828234,0.0023623426,0.00031723952,0.0000069824678,0.0005570005,0.02059096],"genre_scores_gemma":[0.995861,0.0000397399,0.000041652675,0.000021559661,0.0000309205,0.00009449906,0.000008728538,0.000062654886,0.0038392725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889785,0.000092022616,0.00026144675,0.00020327924,0.00021051751,0.0003348595],"domain_scores_gemma":[0.9993675,0.00006092317,0.00002773286,0.00039872868,0.000025907559,0.00011926129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020237558,0.00022730073,0.00030897863,0.000044617787,0.00008519555,0.00007252923,0.00020316904,0.00010247491,0.00032136822],"category_scores_gemma":[0.0000054709503,0.00018997736,0.000065832806,0.00030275792,0.000034394227,0.00015007846,0.000007801913,0.00014296411,0.00021296907],"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.00020240269,0.0001472732,0.0015985455,0.00027267312,0.00036894128,0.00009396264,0.00057480426,0.010895727,0.0038470975,0.96689916,0.013597712,0.001501728],"study_design_scores_gemma":[0.03807812,0.0020550378,0.009421643,0.0011337337,0.0004899885,0.0006079815,0.0012095917,0.051952258,0.006317209,0.2078104,0.675039,0.0058850483],"about_ca_topic_score_codex":0.000056118173,"about_ca_topic_score_gemma":0.000004783023,"teacher_disagreement_score":0.75908875,"about_ca_system_score_codex":0.000041537824,"about_ca_system_score_gemma":0.0000074325503,"threshold_uncertainty_score":0.77470523},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91201216,0.000020039288,0.006983698,0.0012125225,0.00017328814,0.00030517826,0.000020041107,0.00003328397,0.07923979],"genre_scores_gemma":[0.99826175,0.0000029239977,0.0005120818,0.00004835234,0.000010232794,0.000045460238,0.000004795611,0.000009829173,0.0011045673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994902,0.000016709173,0.0001463881,0.00011002013,0.00010296292,0.00013369469],"domain_scores_gemma":[0.99918514,0.00032211991,0.00007507597,0.00032195868,0.0000620326,0.000033640852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007977328,0.00008429103,0.00011282582,0.000010525027,0.0000994987,0.000011290379,0.00018729008,0.000016273043,0.0007712024],"category_scores_gemma":[0.000022638931,0.000056234046,0.000047792648,0.00022397174,0.000072113544,0.00003943954,0.000038912585,0.00009215818,0.000100351026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004682582,0.00008914056,0.00020428657,0.000002498493,0.0000117414875,2.0736132e-7,0.00003729358,0.000032905635,0.00030155334,0.99786043,0.00053087436,0.00092440634],"study_design_scores_gemma":[0.00015249763,0.000024503395,0.000034621546,0.000013056335,0.0000068669947,3.44599e-7,0.0001262555,0.00014996802,0.0017502914,0.99294543,0.004729996,0.00006618258],"about_ca_topic_score_codex":0.0000133395815,"about_ca_topic_score_gemma":9.675361e-8,"teacher_disagreement_score":0.0862496,"about_ca_system_score_codex":0.000008065544,"about_ca_system_score_gemma":0.000016121387,"threshold_uncertainty_score":0.8444125},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9306448,0.0064257015,0.0018042052,0.000047986,0.030348804,0.0018576806,0.000025036215,0.0020391515,0.026806606],"genre_scores_gemma":[0.99893785,0.000035306613,0.000025533509,0.000008858665,0.000047687485,0.00011863227,0.000008561929,0.000052708867,0.0007648647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872404,0.00007436222,0.0003629185,0.00017582996,0.00017729722,0.00048555984],"domain_scores_gemma":[0.99870485,0.00062616146,0.000059496848,0.00042364877,0.00008528128,0.000100570585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015181121,0.00019511279,0.00023026374,0.00006482414,0.0003021038,0.00009457459,0.00031109783,0.00012418114,0.000004291021],"category_scores_gemma":[0.00009790417,0.00014434419,0.000119370015,0.0002847296,0.000053466854,0.0000838691,0.000017782479,0.00014688779,0.000027055123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006483834,0.000025013554,0.00009016694,0.00006690036,0.00008307635,0.0000037126981,0.0001979878,0.00005539229,0.0014829058,0.99060535,0.00540385,0.0019207904],"study_design_scores_gemma":[0.0033167447,0.00022087227,0.0029829808,0.00014453709,0.00007909539,0.00003117541,0.0014057866,0.012530998,0.0129098585,0.7784825,0.18711586,0.0007796103],"about_ca_topic_score_codex":0.0000098648525,"about_ca_topic_score_gemma":0.000008669945,"teacher_disagreement_score":0.21212289,"about_ca_system_score_codex":0.00006877836,"about_ca_system_score_gemma":0.000010629056,"threshold_uncertainty_score":0.5886185},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8923035,0.00016493358,0.059835736,0.0035975566,0.009580444,0.000652945,0.000004280528,0.0013847116,0.032475844],"genre_scores_gemma":[0.99092597,0.000006005038,0.0080831265,0.0008642471,0.00002015573,0.000020970148,0.0000022531608,0.000019274028,0.00005797388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783343,0.00011211697,0.0003311499,0.00068588654,0.00053597527,0.0005014387],"domain_scores_gemma":[0.9978177,0.0003514518,0.000108205844,0.0013809144,0.00014413298,0.00019761256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049253914,0.00028057862,0.00027808826,0.00015495044,0.00019680092,0.0002383236,0.0016380019,0.0001185366,0.00002995968],"category_scores_gemma":[0.00020701862,0.00025738942,0.00012986091,0.00080284965,0.00011876094,0.0004101553,0.0005635083,0.0003360345,0.0006269074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005665473,0.0002825036,0.00019253258,0.0000051796014,0.000012498973,0.00003958648,0.0003780795,0.0005617062,0.000054952103,0.99171174,0.00030982678,0.0064457343],"study_design_scores_gemma":[0.0011681969,0.0003754401,0.00270823,0.000022620556,0.0000037753348,0.000019224804,0.000009094855,0.0020064933,0.0016094265,0.9907429,0.0010213668,0.0003132069],"about_ca_topic_score_codex":0.000043337008,"about_ca_topic_score_gemma":0.00000432614,"teacher_disagreement_score":0.09862244,"about_ca_system_score_codex":0.00021056065,"about_ca_system_score_gemma":0.00016057453,"threshold_uncertainty_score":0.99998784},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9755393,0.00017052688,0.0043429523,0.00019368881,0.002875231,0.00020145558,8.330328e-7,0.00008739428,0.016588567],"genre_scores_gemma":[0.9985371,0.000015568721,0.00026511305,0.00007494503,0.000012297707,0.000010414769,0.0000012110241,0.000008472328,0.0010748687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873984,0.000115427334,0.0003713464,0.0002776811,0.00022101843,0.00027470491],"domain_scores_gemma":[0.9991677,0.000091912865,0.00012219149,0.00046519915,0.00008707423,0.00006595625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038259802,0.00012582431,0.00025204572,0.00018635383,0.000055376397,0.000071802504,0.0005643901,0.000086016735,0.000044899934],"category_scores_gemma":[0.000023372853,0.00012353883,0.00008949092,0.00073121366,0.00003540753,0.0002772857,0.00011449253,0.00012938834,0.00009105526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040773866,0.0003772798,0.008618458,0.000022849868,0.00004114876,0.00015153353,0.0016566324,0.00016987382,0.0013786468,0.9733562,0.0069361734,0.007250464],"study_design_scores_gemma":[0.005356,0.0008227617,0.013288823,0.00036236562,0.000011144952,0.00029183007,0.00011755116,0.17272078,0.0018687461,0.7819106,0.022322988,0.00092642126],"about_ca_topic_score_codex":0.0001424206,"about_ca_topic_score_gemma":0.000028522827,"teacher_disagreement_score":0.19144557,"about_ca_system_score_codex":0.000048168036,"about_ca_system_score_gemma":0.000038149297,"threshold_uncertainty_score":0.5037767},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96593523,0.0000500144,0.00034330777,0.00006761778,0.00040692976,0.00016020138,0.000019265897,0.00009809644,0.032919362],"genre_scores_gemma":[0.9979388,0.000003093959,0.00049018074,0.000012518406,0.000007920788,0.00003296942,0.000011083256,0.0000148771105,0.0014885155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936503,0.000026927815,0.00023022796,0.00013152036,0.000112904025,0.00013335902],"domain_scores_gemma":[0.99926805,0.00016250154,0.000109470486,0.00035629811,0.00007161313,0.00003205424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015595082,0.00009222627,0.00015029365,0.00006731409,0.00010859965,0.000010320723,0.00014600334,0.000054535667,0.000095376585],"category_scores_gemma":[0.000040238854,0.000091582464,0.00009922939,0.00032790162,0.00008150654,0.00006043155,0.00003237947,0.00008442241,0.000043836593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004448952,0.0002576555,0.0010590642,0.000021767522,0.000016802178,4.3334182e-7,0.00003381089,0.0000024998717,0.0021115032,0.9805619,0.015875876,0.000054242602],"study_design_scores_gemma":[0.0003141786,0.000026581623,0.0019738476,0.000011569843,0.000036827758,0.000002165641,0.000035571808,0.000006219994,0.0049685375,0.9869771,0.0055555124,0.0000918613],"about_ca_topic_score_codex":0.000030854662,"about_ca_topic_score_gemma":0.000006117079,"teacher_disagreement_score":0.032003634,"about_ca_system_score_codex":0.0000106748885,"about_ca_system_score_gemma":0.000014002369,"threshold_uncertainty_score":0.37346244},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8447344,0.0004828193,0.123454645,0.000706477,0.0026551343,0.00068576523,0.0000042308943,0.0007604184,0.026516145],"genre_scores_gemma":[0.9856189,0.0000146081065,0.013432549,0.00019925743,0.000008015611,0.000011089839,0.000004243438,0.000025412333,0.00068594463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976127,0.0001505777,0.00027979963,0.0005793577,0.0006424895,0.00073508976],"domain_scores_gemma":[0.99802196,0.0002763841,0.00010007248,0.0010394373,0.00028118168,0.00028093602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011694456,0.00021800588,0.00023750594,0.00034469363,0.0002626657,0.000103106555,0.0014002401,0.00010975838,0.0000137590905],"category_scores_gemma":[0.00007223375,0.0002107294,0.00010987495,0.0014699282,0.00020685644,0.0006551523,0.00040002534,0.0003543118,0.00013229184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035516878,0.00009524478,0.0030563432,0.000004177681,0.000030661715,0.0001028366,0.00028213364,7.878253e-7,0.0018672588,0.98844403,0.00036663213,0.0057143904],"study_design_scores_gemma":[0.00077353197,0.00017454772,0.0066886535,0.000022135142,0.0000047968433,0.00002882784,0.000030522162,0.00046752588,0.027476488,0.96283346,0.0012347008,0.00026481404],"about_ca_topic_score_codex":0.000014172928,"about_ca_topic_score_gemma":0.00000410878,"teacher_disagreement_score":0.14088452,"about_ca_system_score_codex":0.000090773465,"about_ca_system_score_gemma":0.00006349152,"threshold_uncertainty_score":0.8593296},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98229176,0.00011360659,0.00004345093,0.0000099751405,0.0014466657,0.00019678789,0.000003945184,0.00019725243,0.015696552],"genre_scores_gemma":[0.9997369,0.000029853,0.0000057722814,0.000026548987,0.000011357298,0.000038755585,0.000006136376,0.000026815645,0.00011786068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928445,0.000039550396,0.00017498799,0.00014699821,0.00011380136,0.00024021705],"domain_scores_gemma":[0.9995805,0.00014949778,0.000020109183,0.0001896107,0.000013900866,0.000046379806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017307518,0.00014204034,0.00017188552,0.00014205452,0.000032754622,0.000019933239,0.00011819226,0.00008097208,0.000024404082],"category_scores_gemma":[0.00004089318,0.00014628783,0.000036794325,0.0003431277,0.000015384623,0.00008357401,0.0000150514325,0.00021269808,0.000098884135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019440221,0.0002196367,0.012307622,0.00012228396,0.00007785115,0.00034076424,0.0023129112,0.050898712,0.0010048517,0.9305062,0.00067674293,0.0013379868],"study_design_scores_gemma":[0.005594117,0.0006998858,0.017796667,0.00066782197,0.000023354054,0.00007314229,0.00063287606,0.056991555,0.005081674,0.9008366,0.010380347,0.0012219973],"about_ca_topic_score_codex":0.000029386294,"about_ca_topic_score_gemma":0.00001942908,"teacher_disagreement_score":0.029669674,"about_ca_system_score_codex":0.00006808053,"about_ca_system_score_gemma":0.000008313039,"threshold_uncertainty_score":0.59654444},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96069753,0.0005374815,0.0063404646,0.0013911503,0.006890867,0.0008897219,0.000086342225,0.0051572174,0.018009203],"genre_scores_gemma":[0.94960105,0.00006681041,0.04880248,0.0011648199,0.000018691098,0.00003978178,0.000041844185,0.00008332478,0.00018121944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99552006,0.00014970962,0.0009326851,0.00139253,0.0007154546,0.0012895527],"domain_scores_gemma":[0.99585253,0.00036581693,0.00087787973,0.0017770003,0.00062561507,0.0005011499],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001175702,0.0006693627,0.00073080725,0.0009074424,0.00029459476,0.0010890209,0.0026263476,0.0003849295,0.000033716664],"category_scores_gemma":[0.00037460917,0.00071896,0.00027666683,0.0022855885,0.00042363026,0.002936526,0.0007357183,0.00071545003,0.00010147947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077680714,0.00041003406,0.06443252,0.00022313328,0.0003571698,0.0006958915,0.0011424087,0.0000022189554,0.0016966115,0.83441406,0.052780226,0.043768063],"study_design_scores_gemma":[0.0010050647,0.00017769761,0.0040460373,0.00027504232,0.000037188645,0.00055493985,0.00028457487,0.00027050998,0.027646875,0.9597107,0.0049822014,0.001009127],"about_ca_topic_score_codex":0.00009441378,"about_ca_topic_score_gemma":0.00005485111,"teacher_disagreement_score":0.1252967,"about_ca_system_score_codex":0.00017643964,"about_ca_system_score_gemma":0.00016417154,"threshold_uncertainty_score":0.99994797},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99052995,0.0006895765,0.00028832897,0.0007302705,0.0014058392,0.000090266985,2.9717586e-7,0.00022965476,0.006035839],"genre_scores_gemma":[0.99579185,0.00014013042,0.0033605818,0.00044909483,6.7155804e-7,0.0000049268406,0.0000010395338,0.000008118826,0.00024357357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989958,0.000042589596,0.00017390477,0.00033811803,0.00018925223,0.00026035434],"domain_scores_gemma":[0.9992532,0.00007672509,0.000059794253,0.00041652814,0.0000614793,0.00013227438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023089805,0.0001224684,0.00014072235,0.00011023312,0.0001606561,0.00013263537,0.00034395186,0.000059275437,0.000010060548],"category_scores_gemma":[0.000025502966,0.00011666426,0.00004181649,0.00044317695,0.000055461587,0.00026968756,0.00017835126,0.000103944294,0.00006191041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003541882,0.000046018315,0.0056758896,0.0000042756747,0.0000093190465,0.000021817603,0.00016491553,0.000004148887,0.0005542909,0.9893896,0.0025730566,0.0015531492],"study_design_scores_gemma":[0.000798543,0.000074644326,0.0020950923,0.000019849182,0.0000051662873,0.000039115916,0.0000148558265,0.0023754016,0.000676494,0.98969394,0.00403512,0.00017175522],"about_ca_topic_score_codex":0.000034691162,"about_ca_topic_score_gemma":0.0000014644204,"teacher_disagreement_score":0.0057922658,"about_ca_system_score_codex":0.000008930901,"about_ca_system_score_gemma":0.000020203552,"threshold_uncertainty_score":0.47574306},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.956705,0.00003056731,0.00007141156,0.0024494005,0.0007492266,0.00039149408,0.0000062881504,0.00006307652,0.03953355],"genre_scores_gemma":[0.9962517,0.000003757295,0.0005625769,0.00023109176,0.000013691897,0.000023176988,2.503751e-7,0.000020797383,0.0028929526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988591,0.000119861244,0.000316775,0.00012964851,0.00038868695,0.00018590603],"domain_scores_gemma":[0.99693984,0.0019518791,0.00018991972,0.00080171414,0.00008318441,0.000033452034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044738193,0.0001286651,0.00021707287,0.00001826853,0.00013639008,0.000020677091,0.0004906514,0.000052912932,0.00020547144],"category_scores_gemma":[0.0020661757,0.00006862038,0.00012930906,0.00015572006,0.00020946765,0.00008033115,0.00015072843,0.0002031773,0.00009396665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060950515,0.00016084916,0.000062471285,0.00003318912,0.000018514012,2.9047888e-7,0.00031606373,0.0000033814513,0.00012018659,0.98718023,0.012021388,0.00007731115],"study_design_scores_gemma":[0.0002381541,0.00002730107,0.00030581903,0.00005555612,0.000024418656,0.0000013921851,0.000119839024,0.000048184236,0.007155381,0.99101895,0.0009245965,0.00008038802],"about_ca_topic_score_codex":0.0000076240285,"about_ca_topic_score_gemma":0.000010190365,"teacher_disagreement_score":0.03954672,"about_ca_system_score_codex":0.000056421883,"about_ca_system_score_gemma":0.00002792965,"threshold_uncertainty_score":0.27982578},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97996384,0.0001319963,0.000007749051,0.000050249488,0.00037805582,0.00009312788,0.0000021836531,0.00004408016,0.019328704],"genre_scores_gemma":[0.99936604,0.00019691461,0.000087378365,0.000008557785,0.0000024576655,0.000005125122,0.0000036331517,0.00001371169,0.0003161765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994912,0.000021637823,0.00023776104,0.000054463188,0.00008249994,0.000112410366],"domain_scores_gemma":[0.9996806,0.0000794348,0.000027559841,0.00015425951,0.00003782544,0.00002033379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012880206,0.000067808614,0.00012606193,0.00002253404,0.000017629827,0.000007881973,0.00011040951,0.000047820715,0.00020709574],"category_scores_gemma":[0.000017379696,0.000056205645,0.000028593397,0.00019311915,0.000031195843,0.00004118025,0.000007175127,0.00006966416,0.000024749703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020410516,0.0003937182,0.2314976,0.00041537726,0.0001988803,0.000013493048,0.003536815,0.16401055,0.001584538,0.55989903,0.008010483,0.030235438],"study_design_scores_gemma":[0.015487755,0.00029421708,0.08124715,0.00061321957,0.00006603719,0.000023973022,0.00036921527,0.13600008,0.040179554,0.6741513,0.050247636,0.0013198594],"about_ca_topic_score_codex":0.00003865366,"about_ca_topic_score_gemma":0.000020175905,"teacher_disagreement_score":0.15025045,"about_ca_system_score_codex":0.000012441701,"about_ca_system_score_gemma":0.000009540676,"threshold_uncertainty_score":0.22919998},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99786717,0.000088311834,0.0000124813905,0.0000718809,0.00022818593,0.00022229803,0.00000419366,0.00003669154,0.0014687624],"genre_scores_gemma":[0.9993318,0.000012629613,0.00040497095,0.00003892421,0.0000015012328,0.000018262064,0.0000011895847,0.000014895445,0.00017585768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992147,0.00016925714,0.00018690438,0.00017079942,0.00012652078,0.00013178852],"domain_scores_gemma":[0.9990034,0.00014637447,0.00010443064,0.00062905316,0.000057482932,0.000059271486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046021456,0.000099795936,0.00014427702,0.00003623157,0.00016267692,0.000013318408,0.00015022,0.000060308248,0.000027466514],"category_scores_gemma":[0.0001537811,0.00007321944,0.000059503043,0.00025845962,0.0001357641,0.00007438195,0.000037555477,0.00009230487,0.0000030922613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036758092,0.00012466419,0.001751649,0.000018780082,0.000011630118,4.6560015e-7,0.00018313841,4.726188e-7,0.011807026,0.9854717,0.00055950845,0.00006726277],"study_design_scores_gemma":[0.0003188518,0.000030888594,0.0023351347,0.00002424107,0.00003526308,0.0000057991697,0.00009433093,0.00001619292,0.025162088,0.9707857,0.0011068546,0.00008467167],"about_ca_topic_score_codex":0.0000036957915,"about_ca_topic_score_gemma":0.0000030456968,"teacher_disagreement_score":0.014686043,"about_ca_system_score_codex":0.0000051716684,"about_ca_system_score_gemma":0.00001300171,"threshold_uncertainty_score":0.2985802},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892495,0.000117436655,0.0061080847,0.0015838051,0.00055138767,0.00042034342,0.000004365033,0.000096840035,0.0018682074],"genre_scores_gemma":[0.99842554,0.000037251666,0.0013114433,0.00011300571,0.000004006817,0.000024710032,0.000002235272,0.000016273882,0.00006551591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977576,0.0006704679,0.00034077303,0.00045213563,0.00044437213,0.00033463005],"domain_scores_gemma":[0.99736804,0.0012621478,0.00016494229,0.00091362494,0.00017930818,0.00011193312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010103163,0.00018648973,0.0002824754,0.00028203218,0.0001691691,0.000086502485,0.00092638546,0.00008434822,0.0000105216695],"category_scores_gemma":[0.00059785787,0.00014608333,0.00012548402,0.0013548251,0.00031393187,0.00035272609,0.00028687797,0.0004230522,0.0000109575285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022187125,0.000038918442,0.012069216,0.000013503796,0.00004311655,0.000005630459,0.00097164174,0.0000047600383,0.00031163005,0.9781381,0.000119376884,0.008261952],"study_design_scores_gemma":[0.00066697696,0.00038049291,0.005700521,0.00006606139,0.000010416994,0.0000051921343,0.00015475687,0.0003962081,0.009487038,0.982634,0.00034855265,0.00014979827],"about_ca_topic_score_codex":0.000026470927,"about_ca_topic_score_gemma":0.000004623311,"teacher_disagreement_score":0.009176028,"about_ca_system_score_codex":0.000021989237,"about_ca_system_score_gemma":0.000043498658,"threshold_uncertainty_score":0.5957105},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9864802,0.000044932076,0.00013418097,0.00009312232,0.00015817111,0.00029521476,0.000009689849,0.00009571756,0.0126887765],"genre_scores_gemma":[0.9967506,0.000012964159,0.0027304634,0.000019311496,0.0000053472795,0.000027772376,0.0000058335813,0.000049073507,0.00039866567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981535,0.0003549819,0.0003131875,0.00023097877,0.00057790085,0.00036947234],"domain_scores_gemma":[0.99660915,0.0021529228,0.00016893826,0.00071125553,0.00024665,0.000111080335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006622374,0.00019872864,0.0004220454,0.000130442,0.00016945378,0.000013212367,0.00044560485,0.00009801983,0.00009671512],"category_scores_gemma":[0.00064056716,0.00016345648,0.00007524384,0.000475328,0.0004663272,0.00016876154,0.00015057696,0.0003384676,0.000038995116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017633052,0.0005780733,0.027244935,0.00013591949,0.000082015744,0.000092264185,0.0014026795,0.0000011656871,0.0005085693,0.96700907,0.0025371767,0.00023183256],"study_design_scores_gemma":[0.0016091588,0.00057816086,0.011741264,0.00006378225,0.000024113411,0.00007780009,0.00030664168,0.000075919575,0.00494387,0.98017967,0.00017458083,0.00022501734],"about_ca_topic_score_codex":0.00005367492,"about_ca_topic_score_gemma":0.00003953471,"teacher_disagreement_score":0.015503672,"about_ca_system_score_codex":0.0000670789,"about_ca_system_score_gemma":0.00011965251,"threshold_uncertainty_score":0.6665562},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97955775,0.00047438522,0.0000036572042,0.000008479169,0.0014092325,0.00008428923,0.0000023773239,0.0002268498,0.018232971],"genre_scores_gemma":[0.99979824,0.000019737909,0.0000375738,0.000014699795,0.0000030629685,0.000018649278,0.0000052320747,0.000027069706,0.00007572269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926925,0.00004156834,0.00020680089,0.00012380794,0.00011680948,0.00024178534],"domain_scores_gemma":[0.99964833,0.000061605475,0.000019592677,0.00020109936,0.0000133248905,0.00005604571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015561652,0.0001237729,0.00016976603,0.00014578446,0.000059669004,0.000009947442,0.00013091958,0.00008140393,0.000031695206],"category_scores_gemma":[0.000020127614,0.000136166,0.000042639625,0.00038335522,0.000027711265,0.00009552944,0.000018257046,0.00017403715,0.00018324681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000965019,0.000049991097,0.12630089,0.00006192939,0.000026419124,0.00016660735,0.002413403,0.0019941938,0.0005343806,0.8651937,0.0025755698,0.00067322],"study_design_scores_gemma":[0.004174441,0.00016821105,0.25870386,0.0003079496,0.000017568074,0.00015128944,0.00063980307,0.013199848,0.003930971,0.7108843,0.0065764985,0.0012452757],"about_ca_topic_score_codex":0.000028918745,"about_ca_topic_score_gemma":0.0000122253705,"teacher_disagreement_score":0.15430948,"about_ca_system_score_codex":0.00003723676,"about_ca_system_score_gemma":0.000009391768,"threshold_uncertainty_score":0.5552688},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94077295,0.004348296,0.000006213756,0.00005843255,0.006953888,0.0002930429,0.000036993646,0.00014173766,0.04738844],"genre_scores_gemma":[0.9990776,0.00009016739,0.000031994277,0.000011235093,0.000028361334,0.000016420418,0.0000036143547,0.000053193467,0.00068742014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784404,0.00020129641,0.0007266472,0.0003565745,0.0003364304,0.000534995],"domain_scores_gemma":[0.9985136,0.00021952628,0.00014591565,0.0008350903,0.000104486804,0.00018139882],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005816669,0.0003356067,0.00059083285,0.000118304335,0.00009098484,0.000033455806,0.00042723987,0.00028281732,0.001496872],"category_scores_gemma":[0.000109535424,0.00037559573,0.00028394695,0.0004788711,0.00017972488,0.00018480048,0.00008770505,0.0003256426,0.00051884976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003566389,0.00056837103,0.007808082,0.0010470347,0.0002622749,0.00002500287,0.002893443,0.00009921927,0.0050375774,0.97412807,0.006069016,0.0020262299],"study_design_scores_gemma":[0.0063268165,0.0015537319,0.02245353,0.00093462947,0.00048703962,0.00006426981,0.0019205371,0.015767733,0.030973628,0.8939109,0.023253987,0.0023532081],"about_ca_topic_score_codex":0.000030025309,"about_ca_topic_score_gemma":0.0000025253553,"teacher_disagreement_score":0.0802172,"about_ca_system_score_codex":0.00008647271,"about_ca_system_score_gemma":0.00001289822,"threshold_uncertainty_score":0.9998696},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9597176,0.000025068308,0.0014947304,0.0013450184,0.00040994678,0.00027740674,0.0000037158381,0.000107598404,0.03661895],"genre_scores_gemma":[0.9985111,0.0000179544,0.0007313036,0.00023421226,0.0000038853664,0.00002917876,0.0000012320894,0.000009336235,0.00046181082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987356,0.00017830505,0.0001647348,0.00025744637,0.00040640656,0.00025751622],"domain_scores_gemma":[0.9985972,0.00040453553,0.000055328204,0.0008040543,0.00007789237,0.00006096565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040927742,0.000108159824,0.00012500613,0.00006447619,0.00013809254,0.000041449322,0.00096035487,0.00004712437,0.000372333],"category_scores_gemma":[0.000056095298,0.00007930335,0.00008525691,0.0006888171,0.00014474468,0.0002546572,0.00008320837,0.00021018468,0.000463715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019580608,0.00009068742,0.00018872066,0.0000033927006,0.000010460799,0.0000066598254,0.0002384236,0.000019122039,0.00027468347,0.991341,0.0006291004,0.007178166],"study_design_scores_gemma":[0.00034704208,0.00009049286,0.0012284851,0.000020426922,0.0000021357084,0.000007651253,0.000007623346,0.00056870474,0.004845215,0.99174064,0.0010506725,0.00009091236],"about_ca_topic_score_codex":0.000015488897,"about_ca_topic_score_gemma":0.0000015468243,"teacher_disagreement_score":0.038793523,"about_ca_system_score_codex":0.000024171746,"about_ca_system_score_gemma":0.000031429852,"threshold_uncertainty_score":0.5960273},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9936198,0.00006924647,0.0031674623,0.00028497312,0.00030313502,0.00027449252,0.0000016672337,0.00015783033,0.0021213992],"genre_scores_gemma":[0.9828744,0.000013787867,0.016873868,0.00007615126,0.000003334353,0.00003530625,0.0000011798389,0.000023493902,0.00009846276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979703,0.00014870691,0.00022300944,0.0005902629,0.00055876264,0.00050899055],"domain_scores_gemma":[0.99838805,0.0005731469,0.00011647476,0.00060872175,0.0001236919,0.00018988474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048041999,0.0002328726,0.00025881335,0.00022322444,0.0005370858,0.00009449105,0.00052120374,0.00006136057,0.0000037618577],"category_scores_gemma":[0.00019254284,0.00019462999,0.000055392386,0.00073416764,0.0002862287,0.0005553147,0.00037652682,0.00038648173,0.00001683451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006259509,0.00010778212,0.0019834964,0.000017353406,0.000017245877,0.00023460173,0.0022869073,0.000042086253,0.00081545755,0.9797966,0.00004615921,0.014589711],"study_design_scores_gemma":[0.0032001778,0.0011630208,0.013876033,0.00014223301,0.000006806617,0.0005042877,0.00015508664,0.01239756,0.0071099,0.96083087,0.000047508158,0.0005665448],"about_ca_topic_score_codex":0.0000117597965,"about_ca_topic_score_gemma":0.0000023829234,"teacher_disagreement_score":0.018965762,"about_ca_system_score_codex":0.00006147298,"about_ca_system_score_gemma":0.000059007343,"threshold_uncertainty_score":0.79367805},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9648998,0.0042683966,0.00030515552,0.0000064971114,0.01784895,0.0005355615,0.000014325683,0.00045712662,0.011664208],"genre_scores_gemma":[0.99922305,0.0000115852545,0.00005672239,0.00000837148,0.00005902177,0.00018667003,0.0000068177696,0.000037960308,0.00040977332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915874,0.000042472242,0.00019069482,0.00010654545,0.00010668867,0.00039486657],"domain_scores_gemma":[0.99945104,0.00009914688,0.000027438253,0.00026523074,0.00003561034,0.00012156084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044111823,0.00014333024,0.0001957029,0.000052837964,0.000088786546,0.00003344705,0.00015946868,0.000085632964,0.0000124260505],"category_scores_gemma":[0.00003177183,0.00014078844,0.000084746884,0.00014050631,0.000019461382,0.00019694588,0.000013890963,0.000085132764,0.00011418873],"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.0000073999136,0.000031049785,0.002547303,0.00024024112,0.000042302163,6.317195e-7,0.0003445171,0.00008715233,0.0010797573,0.98926806,0.0061887014,0.00016285399],"study_design_scores_gemma":[0.006643332,0.00060767314,0.008951609,0.00061524444,0.00028833895,0.00019043326,0.0029958675,0.02765412,0.025249254,0.41351074,0.5100941,0.0031992667],"about_ca_topic_score_codex":0.0000064752217,"about_ca_topic_score_gemma":3.2928205e-7,"teacher_disagreement_score":0.5757573,"about_ca_system_score_codex":0.000046237,"about_ca_system_score_gemma":0.000005667378,"threshold_uncertainty_score":0.5741186},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9868059,0.000023337805,0.000004064729,0.000091810245,0.00028146448,0.000030900585,0.000012545219,0.00005383916,0.012696133],"genre_scores_gemma":[0.9992419,0.000045652974,0.00004799036,0.000038878297,0.000014571164,0.0000050753033,0.000014655435,0.000019729321,0.0005715844],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991752,0.0000139407675,0.00023369299,0.00018951316,0.0002370753,0.00015060582],"domain_scores_gemma":[0.99931824,0.00008378518,0.0001372351,0.0003453791,0.000059852824,0.000055486325],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000055283832,0.00012449537,0.0002121675,0.000041918163,0.00008125201,0.00000812044,0.00017153025,0.00007912105,0.0009920358],"category_scores_gemma":[0.0000629147,0.00012223593,0.00007761162,0.00013881005,0.000055702592,0.00006270865,0.000038253984,0.000108418,0.000043087217],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009347306,0.00096430356,0.011372246,0.00008649379,0.000058970447,0.000023779046,0.00060637086,0.0000022449,0.93382776,0.050853252,0.0005143243,0.001596775],"study_design_scores_gemma":[0.00084872276,0.000086568856,0.03016645,0.00005577338,0.000023246617,0.00000804398,0.00002438011,0.00010768882,0.94420445,0.012212244,0.011977179,0.0002852278],"about_ca_topic_score_codex":0.000020149457,"about_ca_topic_score_gemma":6.526098e-7,"teacher_disagreement_score":0.03864101,"about_ca_system_score_codex":0.000055320368,"about_ca_system_score_gemma":0.0000426133,"threshold_uncertainty_score":0.9999212},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9601759,0.000073617346,0.017973479,0.00018473767,0.0015248145,0.00023927091,8.226055e-7,0.00022391681,0.019603442],"genre_scores_gemma":[0.99432516,0.000008114659,0.005151474,0.00012385946,0.0000032118808,0.000009175393,0.000001553158,0.000014437107,0.00036302203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998121,0.00009186486,0.00027449496,0.0004241415,0.00044266882,0.00064579624],"domain_scores_gemma":[0.9986779,0.000258544,0.000056186454,0.00073735946,0.00010115023,0.00016884199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012872368,0.00014531189,0.00016896482,0.00027175402,0.00009421187,0.000049881928,0.00094563834,0.000079213816,0.000032572058],"category_scores_gemma":[0.00012460681,0.00014840055,0.00006189691,0.0020863758,0.00010097059,0.0005317703,0.0003337301,0.00034218765,0.0002173387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001678926,0.00011129612,0.03791675,0.0000040023397,0.0000048747156,0.00014354689,0.0002691629,0.0000017697207,0.00034825376,0.95800304,0.00028950907,0.00289099],"study_design_scores_gemma":[0.00086860004,0.00004685963,0.024033332,0.000013306563,8.047798e-7,0.000013662502,0.00003655636,0.00020884459,0.0033649846,0.9677938,0.0034385116,0.00018073095],"about_ca_topic_score_codex":0.00002555366,"about_ca_topic_score_gemma":0.000021862974,"teacher_disagreement_score":0.034149252,"about_ca_system_score_codex":0.00008544074,"about_ca_system_score_gemma":0.00004324252,"threshold_uncertainty_score":0.6051599},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98417217,0.0002920673,0.004751802,0.00026891203,0.00158219,0.00024902626,0.000004920926,0.00019303724,0.008485868],"genre_scores_gemma":[0.9961568,0.00015280262,0.0030083864,0.00011007116,0.000004355851,0.000022730994,0.00000177646,0.000016605003,0.000526437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803036,0.00013242042,0.0002401694,0.00044784817,0.0006345248,0.00051464763],"domain_scores_gemma":[0.9981879,0.0002468385,0.00015727525,0.0010658232,0.00019714405,0.00014501263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045102893,0.00018249475,0.0002874093,0.0002810369,0.0001661412,0.00006685782,0.001442924,0.00005643785,0.000023937151],"category_scores_gemma":[0.00008404919,0.00017636873,0.00011295631,0.0013186401,0.00020415382,0.00075159915,0.0004898776,0.00022059499,0.000049971295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002663316,0.00013904204,0.045429356,0.000012034801,0.000019062563,0.000033018587,0.00024484345,0.000020046251,0.0010202342,0.9507355,0.00026847364,0.0020517234],"study_design_scores_gemma":[0.0010552212,0.00011254415,0.009331595,0.00003105792,0.0000041916855,0.000014376911,0.00019524575,0.00044002966,0.024252588,0.96283096,0.0015259283,0.00020628882],"about_ca_topic_score_codex":0.0000622349,"about_ca_topic_score_gemma":0.000012336389,"teacher_disagreement_score":0.03609776,"about_ca_system_score_codex":0.00004322569,"about_ca_system_score_gemma":0.000047753518,"threshold_uncertainty_score":0.7192108},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7685796,0.0036342444,0.10224337,0.034789264,0.04224575,0.004692415,0.00007643446,0.0036112147,0.040127728],"genre_scores_gemma":[0.9700209,0.00008765941,0.022586029,0.00032123656,0.000115031784,0.00013569623,0.000048540012,0.00003254895,0.0066523817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989446,0.000025878331,0.00020166428,0.00027208286,0.00021439246,0.00034139212],"domain_scores_gemma":[0.9990731,0.00016334954,0.00009027998,0.0005574912,0.00008644169,0.000029358827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042094482,0.00012479097,0.00011413279,0.000044757777,0.0005611076,0.00044312375,0.001120309,0.000032780565,0.0000012832628],"category_scores_gemma":[0.00004531854,0.00009404285,0.00006455497,0.00037183947,0.000058802205,0.00078589475,0.0002817031,0.000073238116,0.000029186018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003328695,0.000030364157,0.00040147186,0.0000065074914,0.000012978417,0.0000017531912,0.000016883474,0.000004128569,0.00010310091,0.98009586,0.014306304,0.005017335],"study_design_scores_gemma":[0.00070696394,0.00007097297,0.0012876086,0.000008473012,0.000010709336,0.0000020429752,0.000022893144,0.012323766,0.0010570841,0.68529564,0.29901773,0.00019611324],"about_ca_topic_score_codex":0.00003832351,"about_ca_topic_score_gemma":0.000014405732,"teacher_disagreement_score":0.2948002,"about_ca_system_score_codex":0.000016356598,"about_ca_system_score_gemma":0.000019654173,"threshold_uncertainty_score":0.43156427},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9956518,0.00048466746,0.0008548888,0.00051976886,0.0012301754,0.00012643797,2.6155038e-7,0.00011562548,0.0010164203],"genre_scores_gemma":[0.9935007,0.000028972014,0.0063428343,0.000065901986,5.944826e-7,0.00001233035,2.783681e-7,0.000007982849,0.00004042576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907446,0.00002994786,0.00019041578,0.00022890388,0.00022387494,0.00025237992],"domain_scores_gemma":[0.99898994,0.00009262765,0.00010601849,0.0005965575,0.00014201213,0.00007285263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003230133,0.00010814664,0.00012356386,0.00006119398,0.00024063252,0.00006976358,0.00069647684,0.00003854425,4.974181e-7],"category_scores_gemma":[0.000026483558,0.000069164744,0.000050299986,0.0005382929,0.0001146811,0.00011069879,0.00013642506,0.00012008453,0.00001178758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060663747,0.00005216026,0.00067405973,0.000005270304,0.000018373647,0.000006894439,0.00025436675,0.00018545482,0.00044689924,0.99646485,0.000050104278,0.0018355038],"study_design_scores_gemma":[0.00086461415,0.00022697098,0.0011187649,0.000038636186,0.00000683541,0.000010845803,0.000020492658,0.00010156059,0.00982313,0.98722553,0.0004514106,0.00011121005],"about_ca_topic_score_codex":0.00008781411,"about_ca_topic_score_gemma":0.000015517162,"teacher_disagreement_score":0.009376232,"about_ca_system_score_codex":0.00001728902,"about_ca_system_score_gemma":0.00008567271,"threshold_uncertainty_score":0.28204566},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97870296,0.00020016584,0.00001601099,0.000028736209,0.0005205959,0.00013614354,0.0000010051607,0.00017730058,0.020217057],"genre_scores_gemma":[0.9997266,0.000013263499,0.000022513612,0.000017030612,0.000004342827,0.000048709302,0.0000017132962,0.000022112888,0.00014369989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994974,0.000023161092,0.00012027168,0.00011884218,0.00008903281,0.00015128088],"domain_scores_gemma":[0.9996427,0.00004708388,0.000015124334,0.00024390197,0.000011109666,0.00004004365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007027354,0.000097815406,0.0001039664,0.00007378113,0.000030502504,0.0000141990695,0.00010410239,0.000047540634,0.00005087434],"category_scores_gemma":[0.000008683712,0.000089564215,0.000019285591,0.0002443679,0.00001741033,0.00007085885,0.0000052423893,0.00012151288,0.00019180168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000936892,0.000093639486,0.0028800317,0.00002736178,0.000014815132,0.000011683738,0.00057395094,0.0013863886,0.00035208437,0.9923047,0.0015704073,0.000775567],"study_design_scores_gemma":[0.005502462,0.0004714232,0.03310937,0.00042722447,0.000017947736,0.000033584303,0.00030250012,0.032600082,0.00434072,0.9161315,0.0060349596,0.0010282093],"about_ca_topic_score_codex":0.000004105144,"about_ca_topic_score_gemma":0.0000045355155,"teacher_disagreement_score":0.07617319,"about_ca_system_score_codex":0.000036554997,"about_ca_system_score_gemma":0.0000011901487,"threshold_uncertainty_score":0.36523226},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.982845,0.000053538002,0.000071399794,0.00061917247,0.00006547964,0.00024402981,0.00001862417,0.00010749494,0.015975244],"genre_scores_gemma":[0.9968798,0.000011738933,0.0023420567,0.00007800878,0.00000499653,0.000036189263,0.0000058897335,0.000025359983,0.0006159354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990517,0.00017072438,0.00023970375,0.00021454631,0.00014276689,0.00018054844],"domain_scores_gemma":[0.99808455,0.0013119136,0.000059452934,0.000391845,0.00004098919,0.00011125391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003475684,0.00013991803,0.00020301189,0.00004569155,0.00024800387,0.00004357993,0.0001658709,0.00010939126,0.00038236388],"category_scores_gemma":[0.00022438118,0.00012990799,0.000048798865,0.00020222366,0.000103322556,0.00010949082,0.000032082957,0.00047968756,0.00018992217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005405654,0.00006124138,0.046513513,0.000009057541,0.000039548064,5.064278e-7,0.00067758746,1.3843432e-7,0.0000101984,0.94590384,0.0027188521,0.0040601096],"study_design_scores_gemma":[0.0003999299,0.000037012815,0.04567604,0.000018931212,0.000049184964,0.0000023665693,0.00009270552,0.00005321983,0.00016183974,0.94814914,0.0052085016,0.00015114176],"about_ca_topic_score_codex":0.00005937503,"about_ca_topic_score_gemma":0.000013160442,"teacher_disagreement_score":0.015359309,"about_ca_system_score_codex":0.000034218745,"about_ca_system_score_gemma":0.000023025406,"threshold_uncertainty_score":0.5297494},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99216163,0.00070192403,0.000328427,0.0002096902,0.0027173061,0.00014502852,0.0000030573385,0.00018945447,0.003543505],"genre_scores_gemma":[0.9945082,0.000019331239,0.005118824,0.00019744183,3.1127092e-7,0.000005637182,0.0000021370683,0.000013055856,0.00013503035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834794,0.000117015355,0.0003916905,0.00039944716,0.00037313247,0.00037076554],"domain_scores_gemma":[0.99863106,0.00012082388,0.00015506092,0.0007262333,0.00021599521,0.00015085422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047844695,0.00018129924,0.0002804064,0.0001784109,0.00011891255,0.00006269008,0.00051873823,0.000074622156,0.000023838542],"category_scores_gemma":[0.00011355935,0.00017326718,0.00012118017,0.0009087939,0.00010996309,0.00025383855,0.00012229163,0.00015747393,0.00012320539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002559686,0.00012322128,0.0016027044,0.000013490699,0.000021979326,0.000005995358,0.0001716516,0.000034120552,0.007188173,0.98932606,0.001230209,0.0002798416],"study_design_scores_gemma":[0.0009481151,0.00015843268,0.00067661813,0.00003714819,0.0000112522375,0.000018720604,0.000011240328,0.0021599226,0.008003824,0.98676294,0.00099272,0.00021907722],"about_ca_topic_score_codex":0.000045714194,"about_ca_topic_score_gemma":0.0000012428153,"teacher_disagreement_score":0.0047903974,"about_ca_system_score_codex":0.000014295916,"about_ca_system_score_gemma":0.00006373886,"threshold_uncertainty_score":0.70656306},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9923976,0.00012288103,0.0010841554,0.0011601337,0.0016510135,0.00021437618,0.0000015105134,0.00011332099,0.0032549987],"genre_scores_gemma":[0.99640876,0.000009055916,0.0029723973,0.0005751434,2.7921857e-7,0.000008314669,0.0000014852376,0.000007723356,0.00001686043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874276,0.00020909017,0.00024551706,0.00027027627,0.00032451414,0.0002078431],"domain_scores_gemma":[0.99869084,0.0003008173,0.00013040725,0.0006879654,0.0001256771,0.000064262305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053524104,0.00012933441,0.00015764423,0.000104516825,0.00020513235,0.000041706695,0.00042110082,0.000051196293,0.0000091321945],"category_scores_gemma":[0.00006984315,0.00009044773,0.00009071718,0.0005260268,0.00007485711,0.00010523905,0.000070842936,0.0001414337,0.000052684758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043544524,0.000106203064,0.00015756405,0.0000038453773,0.000008581946,0.0000022841477,0.00014309838,0.000045237404,0.011969873,0.98631793,0.0010136352,0.0002273714],"study_design_scores_gemma":[0.0004626057,0.00019779734,0.0005171787,0.00004391095,0.0000060423613,0.000006552167,0.0000066839434,0.002154513,0.02684347,0.9691559,0.0004905723,0.000114744136],"about_ca_topic_score_codex":0.000016607119,"about_ca_topic_score_gemma":8.262497e-7,"teacher_disagreement_score":0.017162021,"about_ca_system_score_codex":0.00001506975,"about_ca_system_score_gemma":0.00002846783,"threshold_uncertainty_score":0.36883512},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9915394,0.000017089802,0.00003561481,0.00014339222,0.00008858815,0.00024285713,0.000016824915,0.000018741424,0.007897459],"genre_scores_gemma":[0.9989255,0.0000024611536,0.00079486135,0.00002061415,0.0000065571317,0.000025320382,0.000005615388,0.000012801102,0.00020628465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923503,0.000022637798,0.00033428115,0.00008574976,0.00020976827,0.000112517104],"domain_scores_gemma":[0.9986718,0.0006693158,0.00023462632,0.0003594289,0.000048688897,0.000016121392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021229139,0.00008568783,0.00020349406,0.000035913494,0.00006407125,0.0000073202614,0.00021523077,0.000028275499,0.000084288375],"category_scores_gemma":[0.000056713583,0.0000601685,0.000053078762,0.0000974316,0.000047004894,0.000021038597,0.000043419474,0.000057394947,0.000010552089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002313336,0.000264759,0.00008730836,0.000056341378,0.000016689068,1.7711432e-7,0.0001238555,0.0000048025227,0.0012649123,0.98146605,0.016698236,0.000014559784],"study_design_scores_gemma":[0.00032772557,0.000028412593,0.00015020426,0.000051240284,0.000019465322,6.634743e-7,0.0000829238,0.00045355887,0.009004482,0.9893481,0.00047454293,0.000058660662],"about_ca_topic_score_codex":0.000040701816,"about_ca_topic_score_gemma":0.000002536403,"teacher_disagreement_score":0.016223691,"about_ca_system_score_codex":0.000009978415,"about_ca_system_score_gemma":0.000010748392,"threshold_uncertainty_score":0.24536002},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94442356,0.0008009777,0.0000028999866,0.0002736705,0.00061226677,0.00014088015,0.000088472356,0.00009649345,0.053560786],"genre_scores_gemma":[0.9887013,0.00035279253,0.000052382,0.000046822704,0.000056554283,0.000048887334,0.00008803845,0.000058363443,0.0105948895],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976822,0.00003181635,0.0007364164,0.0005819434,0.00046766212,0.0004999667],"domain_scores_gemma":[0.9976057,0.00020704782,0.00040637545,0.0012589616,0.00026322505,0.00025871728],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001172394,0.00040986354,0.0005644492,0.000048029295,0.00033889784,0.000019669336,0.0007521641,0.0005190295,0.0023073414],"category_scores_gemma":[0.00014371781,0.00047918395,0.00027294309,0.00046334433,0.00046207834,0.00010199584,0.00021775078,0.0005516364,0.00025391168],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019041344,0.002725777,0.033052802,0.0012286883,0.0004542489,0.00010026022,0.0015027779,0.00003277673,0.8155645,0.08979158,0.05473911,0.0006170278],"study_design_scores_gemma":[0.0024329147,0.000048673,0.0026120208,0.0001702539,0.00008293722,0.00006401185,0.00024309965,0.00011803649,0.94510907,0.032014664,0.016522435,0.00058190944],"about_ca_topic_score_codex":0.00007444463,"about_ca_topic_score_gemma":0.0000014505107,"teacher_disagreement_score":0.12954451,"about_ca_system_score_codex":0.00011027289,"about_ca_system_score_gemma":0.00032361023,"threshold_uncertainty_score":0.999766},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9709377,0.00043790106,0.0105361035,0.0001799814,0.005071553,0.00039106086,0.0000130481285,0.00066124747,0.0117713865],"genre_scores_gemma":[0.9984136,0.0000714723,0.00086266716,0.00008139972,0.00004264914,0.000040857984,0.000009145646,0.000029903642,0.00044830696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919546,0.00002996318,0.00019278697,0.00016967712,0.00023048893,0.00018162378],"domain_scores_gemma":[0.9994677,0.000155883,0.000043894226,0.00015317767,0.00007171404,0.00010765871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008883869,0.00014625641,0.00016178546,0.000099996425,0.00014874362,0.000014506076,0.00007438698,0.0000969594,0.00008765538],"category_scores_gemma":[0.000064744025,0.00016818626,0.000038436865,0.00014294738,0.0000644941,0.00046485564,0.000018253466,0.00020327192,0.0001805795],"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.00020708385,0.0003456873,0.033389866,0.00019395414,0.0006836307,0.00044113927,0.0018927834,0.09982379,0.025878614,0.59051245,0.24304378,0.0035872504],"study_design_scores_gemma":[0.013363933,0.0002106938,0.06791628,0.00009172087,0.00009304833,0.0010522362,0.0004043243,0.38540196,0.0028471805,0.33255458,0.19416875,0.0018952837],"about_ca_topic_score_codex":0.000015719275,"about_ca_topic_score_gemma":0.000005847413,"teacher_disagreement_score":0.28557816,"about_ca_system_score_codex":0.00015369013,"about_ca_system_score_gemma":0.00003002166,"threshold_uncertainty_score":0.6858437},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9855714,0.000073816125,0.0033726299,0.00039887996,0.00056653697,0.00011874673,6.830519e-7,0.000089307454,0.009808024],"genre_scores_gemma":[0.9990353,0.000009028823,0.00046854655,0.00034628637,0.0000053297094,0.0000073481224,4.218882e-7,0.000006038562,0.00012171328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991245,0.00005915749,0.00016857545,0.00020306365,0.00024376147,0.00020089647],"domain_scores_gemma":[0.9989167,0.0003629554,0.00010424482,0.0005265541,0.00004684662,0.00004272289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018326333,0.00009617786,0.00013224724,0.000037713482,0.0001910422,0.000015658237,0.0007218608,0.00003331455,0.00001377522],"category_scores_gemma":[0.00010620933,0.00006640397,0.000057987385,0.0002735287,0.000078979516,0.00014046731,0.00009167739,0.00013539713,0.00008655466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011803207,0.00004689253,0.00060872955,0.0000030264796,0.000005282319,0.0000141647315,0.00036011895,0.00002059558,0.00046212043,0.99669945,0.0008308334,0.00094761397],"study_design_scores_gemma":[0.0003171286,0.00013966464,0.0040511973,0.000017359836,0.0000017476142,0.000026678928,0.000022418408,0.00079729874,0.006833887,0.9872223,0.00045705924,0.00011326552],"about_ca_topic_score_codex":0.0000035528712,"about_ca_topic_score_gemma":1.2922987e-7,"teacher_disagreement_score":0.013463912,"about_ca_system_score_codex":0.000019847335,"about_ca_system_score_gemma":0.000035115103,"threshold_uncertainty_score":0.27078754},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19694343,0.0016331772,0.20423228,0.008307837,0.008488766,0.0009803204,0.0000070987226,0.010211415,0.5691957],"genre_scores_gemma":[0.97129095,0.000021647857,0.027300578,0.0007036912,0.0000045825755,0.000017035607,8.169622e-7,0.000015518968,0.0006451541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985912,0.000038426944,0.00019908311,0.00043661395,0.0004101846,0.00032451257],"domain_scores_gemma":[0.99891,0.00006219426,0.00009087341,0.00071918074,0.00010934177,0.00010840675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017015844,0.00017474804,0.00015201274,0.00017363823,0.00012315989,0.0005622668,0.0014446169,0.000072263494,0.000028634566],"category_scores_gemma":[0.00009166926,0.00016854894,0.00007539298,0.0006596268,0.00009524399,0.0011278341,0.00023888516,0.0001796125,0.00032576907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.686802e-7,0.00015193605,0.000050032737,0.000006959141,0.000007648609,0.000056402187,0.000065366425,0.0000016692011,0.0003356889,0.93648314,0.010165742,0.05267442],"study_design_scores_gemma":[0.00021994008,0.00018083522,0.000092150876,0.00004557702,0.0000031050968,0.000019389383,0.0000014923488,0.0029249662,0.0059443587,0.98759896,0.0027271307,0.00024208454],"about_ca_topic_score_codex":0.0000064031397,"about_ca_topic_score_gemma":4.8316844e-7,"teacher_disagreement_score":0.77434754,"about_ca_system_score_codex":0.000041039966,"about_ca_system_score_gemma":0.000023565697,"threshold_uncertainty_score":0.6873226},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96920294,0.00027829938,0.011379228,0.00012633242,0.0019173891,0.000092426795,0.0000010515665,0.00018467016,0.016817683],"genre_scores_gemma":[0.9968886,0.0000150780925,0.0029327008,0.00007386066,0.0000077682735,0.0000024948206,8.360415e-7,0.0000073529945,0.00007132346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892324,0.000051215724,0.00024289158,0.0002686722,0.00022536948,0.00028859195],"domain_scores_gemma":[0.9988477,0.00023608452,0.00010094156,0.0006485869,0.000073544754,0.00009312876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094094535,0.00011390879,0.00017258526,0.00017396043,0.00009549556,0.000039294086,0.0008266823,0.00005915475,0.00001534718],"category_scores_gemma":[0.000047545407,0.00011277737,0.000100299454,0.0007345458,0.00008763418,0.0002481343,0.00017247109,0.000118259806,0.000027621949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010464092,0.0001252053,0.0025151705,0.000007993566,0.000017843837,0.000006213822,0.00038759073,0.0000019303875,0.0025045285,0.9831474,0.00046678568,0.010808871],"study_design_scores_gemma":[0.00042518502,0.0001580659,0.009432282,0.000023799916,0.000007277748,0.000007042094,0.00005178563,0.00012333614,0.042663038,0.9434654,0.0034737769,0.00016899884],"about_ca_topic_score_codex":0.00001605614,"about_ca_topic_score_gemma":0.0000028617594,"teacher_disagreement_score":0.04015851,"about_ca_system_score_codex":0.000015981064,"about_ca_system_score_gemma":0.000030328521,"threshold_uncertainty_score":0.45989278},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9605863,0.0004549073,0.009310444,0.009874311,0.0031267565,0.00069614354,0.00001098104,0.00089791964,0.015042216],"genre_scores_gemma":[0.9931853,0.00004636062,0.005405746,0.0005548154,0.000027103659,0.000048344402,0.0000038454405,0.000034021334,0.000694486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972338,0.00021920321,0.00033227578,0.0008119466,0.0006704439,0.000732311],"domain_scores_gemma":[0.99742097,0.0003425724,0.00014057888,0.0014767532,0.00032921525,0.0002898864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074089493,0.00028574953,0.0002949788,0.00037653733,0.0002581135,0.00017005356,0.0018232943,0.00014336266,0.000050940955],"category_scores_gemma":[0.00030240745,0.00027783826,0.0001181743,0.0017087634,0.00010413363,0.00074440136,0.00043720842,0.00063826545,0.0005825668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045976383,0.00030784408,0.00040356172,0.000009268182,0.000019383417,0.000025217534,0.00012292665,0.00048394865,0.00040839595,0.98904246,0.0023946287,0.006736367],"study_design_scores_gemma":[0.00082075386,0.00043716645,0.0015121957,0.00004819608,0.0000035381943,0.000017617776,0.00001871709,0.005361911,0.006933273,0.981033,0.0034775157,0.00033606356],"about_ca_topic_score_codex":0.000006980256,"about_ca_topic_score_gemma":0.000018590516,"teacher_disagreement_score":0.032598954,"about_ca_system_score_codex":0.00011585956,"about_ca_system_score_gemma":0.00011286573,"threshold_uncertainty_score":0.9999674},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84335804,0.00013695241,7.0135e-7,0.00006277827,0.00025704835,0.000036957048,0.000024058096,0.00010707942,0.15601636],"genre_scores_gemma":[0.9855354,0.00008974222,0.00009520085,0.00020344456,0.000028811859,0.000015814809,0.000057544956,0.00003169965,0.013942369],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987865,0.00001218121,0.00025209205,0.00039541838,0.0002126815,0.00034111086],"domain_scores_gemma":[0.9992556,0.000091835966,0.000069739486,0.00035937637,0.000035941575,0.0001875368],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006928044,0.00022836725,0.00022032512,0.000018648892,0.00022549937,0.000030012048,0.0002044774,0.00015805285,0.0096385265],"category_scores_gemma":[0.00003945139,0.0002552914,0.000057322766,0.00011116664,0.00015691444,0.00014151754,0.0000415514,0.00028505293,0.00012644558],"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.0008742093,0.0020337368,0.05863813,0.0009829388,0.00064690766,0.0005840196,0.002594064,0.000058760706,0.737746,0.060419384,0.05335953,0.08206231],"study_design_scores_gemma":[0.007432152,0.00009727186,0.001896252,0.0002473414,0.00013212717,0.00013588721,0.00040948464,0.00013119174,0.32028636,0.06592837,0.6016459,0.0016576383],"about_ca_topic_score_codex":0.000019735064,"about_ca_topic_score_gemma":0.00000371572,"teacher_disagreement_score":0.5482864,"about_ca_system_score_codex":0.000084940344,"about_ca_system_score_gemma":0.000052847623,"threshold_uncertainty_score":0.9999899},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99593794,0.000767105,0.00005338318,0.00041077845,0.0011284078,0.00019292757,0.000003967934,0.00042623482,0.001079238],"genre_scores_gemma":[0.9983554,0.0000610133,0.00111546,0.0002306116,2.2960587e-7,0.000011353621,0.000007216447,0.000022507933,0.00019621752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790674,0.0001250229,0.0004201909,0.0005084346,0.0005789225,0.00046066905],"domain_scores_gemma":[0.99809605,0.00018568382,0.00030391334,0.0007475628,0.00049646915,0.00017033659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000390946,0.00026551224,0.0003781734,0.00029441275,0.0001894101,0.00008936387,0.0008011629,0.00015164513,0.000025739693],"category_scores_gemma":[0.00014821655,0.00022183766,0.000116635245,0.002347289,0.00016454844,0.0003764246,0.00012918767,0.00027948632,0.000037514863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008472692,0.0003971863,0.004753163,0.000011484591,0.00011334256,0.000022604421,0.00046765618,0.000023815937,0.0018369919,0.9879719,0.003431016,0.0009623655],"study_design_scores_gemma":[0.0023411252,0.00052354997,0.0025763335,0.00016315785,0.000039676695,0.000011374929,0.00001870869,0.011501291,0.004454006,0.9778553,0.00010132385,0.0004141172],"about_ca_topic_score_codex":0.000065308916,"about_ca_topic_score_gemma":0.0000063978646,"teacher_disagreement_score":0.011477475,"about_ca_system_score_codex":0.000024965451,"about_ca_system_score_gemma":0.00003101171,"threshold_uncertainty_score":0.90462774},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9593073,0.00036637453,0.004000911,0.00046550776,0.010909784,0.00040034662,0.0000011023103,0.00036621664,0.02418244],"genre_scores_gemma":[0.99874294,0.00003999215,0.00026987915,0.00025647882,0.0000531143,0.00005221168,0.000004600389,0.000022305827,0.00055847474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763745,0.00022768842,0.0005654632,0.0006612368,0.00029349138,0.0006146692],"domain_scores_gemma":[0.99846447,0.00021998433,0.00016635288,0.00082197745,0.00016855069,0.00015869025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007711574,0.00025364914,0.0004026286,0.00033725915,0.0001753567,0.0002619946,0.0009002996,0.0001597087,0.000054282984],"category_scores_gemma":[0.00009758094,0.00025508925,0.00012549726,0.001442799,0.00004363213,0.0005504118,0.0001951611,0.00034218843,0.00013639746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003918079,0.00016110163,0.007525999,0.000008185904,0.000024282406,0.00016442622,0.0014383083,0.000058127123,0.0003153402,0.9824718,0.00460679,0.0031864077],"study_design_scores_gemma":[0.008202746,0.0011081297,0.032406755,0.00051076786,0.000018785508,0.00041299014,0.0013001584,0.073726706,0.0019109302,0.82650155,0.052159872,0.0017406213],"about_ca_topic_score_codex":0.00032125297,"about_ca_topic_score_gemma":0.00012778946,"teacher_disagreement_score":0.1559703,"about_ca_system_score_codex":0.00013935102,"about_ca_system_score_gemma":0.000083693216,"threshold_uncertainty_score":0.9999901},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9804733,0.00009198483,0.0009340732,0.00007281433,0.0028121895,0.00012274807,0.0000011139241,0.00008044452,0.015411337],"genre_scores_gemma":[0.9978555,0.000006706112,0.0019512505,0.000071066584,0.000006859043,0.000010353955,3.311952e-7,0.000007496041,0.00009046327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874777,0.00018746992,0.00026245136,0.0002936267,0.00021362299,0.0002950583],"domain_scores_gemma":[0.998954,0.0002547149,0.00008476485,0.00056511175,0.000064976324,0.00007645426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057061354,0.00013031656,0.00020497387,0.00009371424,0.00005018962,0.000039855167,0.00062477525,0.00006935321,0.000041816515],"category_scores_gemma":[0.0002279388,0.00013422214,0.000096562515,0.00061713974,0.000070926646,0.00019358553,0.000119122014,0.00012778016,0.000048540034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014944796,0.00018570638,0.018678403,0.000008055623,0.0000075633516,0.000013910081,0.00020628919,0.0000027336555,0.00074820156,0.9787655,0.00021381913,0.0011548898],"study_design_scores_gemma":[0.0012029175,0.00021674419,0.0100172125,0.000033232907,0.000005971898,0.000006576883,0.00001730624,0.0002478017,0.010310754,0.9671623,0.010548032,0.0002311418],"about_ca_topic_score_codex":0.000035962326,"about_ca_topic_score_gemma":0.000007919279,"teacher_disagreement_score":0.017382178,"about_ca_system_score_codex":0.000018348775,"about_ca_system_score_gemma":0.000058972586,"threshold_uncertainty_score":0.547342},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97829884,0.00020591829,0.005298335,0.00021939861,0.00203631,0.0003660509,0.00001586913,0.0014164163,0.012142876],"genre_scores_gemma":[0.99675316,0.000032777003,0.0030084264,0.000080675796,0.000004890127,0.000017535325,0.000022137257,0.00004576432,0.000034639168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992636,0.00001258643,0.00015465493,0.00015308335,0.00014151401,0.00027458262],"domain_scores_gemma":[0.9995725,0.000024857947,0.000029437744,0.00023053399,0.00004691217,0.000095749674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006345122,0.00015952627,0.00016054117,0.000073226394,0.00009439045,0.000055511297,0.000119751654,0.000054955246,0.000031831023],"category_scores_gemma":[0.000008432578,0.00015102433,0.00003734321,0.0003262264,0.000040290834,0.00013190963,0.000015296228,0.00015129923,0.00007604899],"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.000015087244,0.00007206911,0.010083741,0.00006651248,0.00009508285,0.000019427633,0.0009208201,0.62762225,0.0023806787,0.35782838,0.00054186437,0.00035406934],"study_design_scores_gemma":[0.035086397,0.0010615613,0.05864587,0.0016807206,0.00022723166,0.0001575128,0.0005228694,0.1318008,0.029710544,0.68944126,0.04657206,0.0050931806],"about_ca_topic_score_codex":0.0000177334,"about_ca_topic_score_gemma":0.000020206176,"teacher_disagreement_score":0.49582148,"about_ca_system_score_codex":0.000050123206,"about_ca_system_score_gemma":0.000015801048,"threshold_uncertainty_score":0.6158594},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950825,0.0003819286,0.0011443894,0.00028390405,0.0008256056,0.00008637954,0.0000052296105,0.00020149622,0.0019885418],"genre_scores_gemma":[0.99816537,0.000029334778,0.0016123421,0.000125414,0.000009429227,0.000009921589,0.00001166101,0.000007805677,0.000028731049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990614,0.000093662646,0.00015621995,0.0003396363,0.00017121811,0.00017783475],"domain_scores_gemma":[0.99923015,0.0002998717,0.000066042565,0.000315525,0.00003469586,0.000053717868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019352016,0.00013476076,0.00013673281,0.00016149157,0.00021475623,0.00015974915,0.00032999984,0.000057154986,0.000009440949],"category_scores_gemma":[0.00002056141,0.00013084788,0.00006189567,0.00036345454,0.0000670889,0.0002678002,0.00008617748,0.00009839145,0.000016464857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001778078,0.00008877193,0.005611057,0.0000026948865,0.0000101812,0.000010616994,0.00017407912,0.000009805291,0.0010399739,0.98652786,0.00079848146,0.0057086837],"study_design_scores_gemma":[0.00055668515,0.00015939305,0.043697257,0.000022808135,0.000008103708,0.0000022810739,0.000026480018,0.0019694963,0.0018457868,0.95101637,0.0005268151,0.00016855673],"about_ca_topic_score_codex":0.00008106133,"about_ca_topic_score_gemma":0.000007852839,"teacher_disagreement_score":0.0380862,"about_ca_system_score_codex":0.000014096193,"about_ca_system_score_gemma":0.000013815689,"threshold_uncertainty_score":0.53358215},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9074334,0.000020599104,0.015758272,0.000040434265,0.00016359356,0.0001704718,0.000007552135,0.00003146003,0.07637422],"genre_scores_gemma":[0.99643475,7.57075e-7,0.0033341323,0.000010440005,0.0000063158373,0.000012611768,0.000006642141,0.000010792438,0.00018357405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993974,0.0000066156413,0.00023168293,0.00010426326,0.000094113304,0.00016590953],"domain_scores_gemma":[0.9993981,0.0001625315,0.00010028331,0.0002333595,0.000041628755,0.00006407853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013079682,0.000083785744,0.00015196441,0.000023954706,0.000057431986,0.000006211699,0.0001246775,0.000019671592,0.00023704807],"category_scores_gemma":[0.000007637026,0.00007766323,0.000074699834,0.00019544837,0.00006400719,0.000054959462,0.00003247176,0.00006340217,0.00003398681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003053786,0.0001109392,0.0016373859,0.000010932955,0.000020334774,1.8440949e-7,0.00008693399,0.0000026047894,0.0005363383,0.9952009,0.00018158252,0.0022088196],"study_design_scores_gemma":[0.00024632376,0.000016731945,0.00070985284,0.0000137388815,0.000012009783,2.2457401e-7,0.00029577274,0.000022701162,0.0089112045,0.98910445,0.00058502826,0.000081950035],"about_ca_topic_score_codex":0.00001872785,"about_ca_topic_score_gemma":3.2202385e-7,"teacher_disagreement_score":0.089001335,"about_ca_system_score_codex":0.000007808042,"about_ca_system_score_gemma":0.0000095483165,"threshold_uncertainty_score":0.31670147},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98929715,0.00046214604,0.001872237,0.0007873196,0.0009144356,0.00020271399,0.000002698724,0.00016846898,0.006292858],"genre_scores_gemma":[0.9815969,0.000005225036,0.018051958,0.00012569207,0.00000557031,0.0000084176745,0.0000012768893,0.000009853824,0.00019509268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985688,0.000096675714,0.00022625369,0.00030749768,0.00048023983,0.00032056103],"domain_scores_gemma":[0.9987599,0.00020206194,0.00007914513,0.0006716169,0.00016333634,0.00012393399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043449784,0.000119224955,0.00017710857,0.00018432314,0.00009019196,0.00002563064,0.00093889795,0.000040020397,0.00004106759],"category_scores_gemma":[0.000055553166,0.000112434165,0.00008664154,0.00067126215,0.00013034455,0.00046034894,0.00032837596,0.00016982938,0.00008207382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011018973,0.00011042092,0.0008489402,0.000004023112,0.000013499915,0.000005328352,0.00008013633,0.00030459755,0.002415262,0.9890757,0.0005863866,0.006544667],"study_design_scores_gemma":[0.0009133723,0.00009673858,0.0011251103,0.000012218336,0.0000022534196,0.0000092648415,0.0000037465677,0.003765426,0.020699393,0.97246534,0.00077418913,0.00013294538],"about_ca_topic_score_codex":0.000007213474,"about_ca_topic_score_gemma":0.0000022111494,"teacher_disagreement_score":0.01828413,"about_ca_system_score_codex":0.000030292316,"about_ca_system_score_gemma":0.00006327566,"threshold_uncertainty_score":0.4584932},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93419737,0.000051171817,0.00031652238,0.00033574773,0.0005843221,0.00018487977,0.0000022415538,0.000029543502,0.064298205],"genre_scores_gemma":[0.9984546,0.000003859284,0.00018971777,0.00005376219,0.0000030882788,0.000045050878,0.000001751939,0.0000071646996,0.0012410526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982841,0.00030351782,0.00038946175,0.00032644998,0.0004837315,0.00021272378],"domain_scores_gemma":[0.99849063,0.00068519666,0.00012032561,0.00051130244,0.00011800631,0.00007455272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025330347,0.00009882959,0.00016671655,0.0002538191,0.00011373992,0.000091923415,0.00042510315,0.00006312318,0.00032435192],"category_scores_gemma":[0.001339273,0.0000856545,0.00006537885,0.0013033771,0.00008084829,0.00024351885,0.000034274886,0.00013453113,0.0005686265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054965512,0.00009681529,0.0064547565,5.577097e-7,0.000002063447,0.0000012899211,0.00018957446,0.000021847927,0.00038181702,0.9897729,0.001029178,0.002043661],"study_design_scores_gemma":[0.00058142416,0.000022518212,0.011525475,0.0000047724798,0.0000028831146,0.0000028569204,0.00048928766,0.000059746326,0.0017016002,0.97442496,0.011087682,0.00009680431],"about_ca_topic_score_codex":0.000008330936,"about_ca_topic_score_gemma":0.000015887334,"teacher_disagreement_score":0.06425718,"about_ca_system_score_codex":0.000034721867,"about_ca_system_score_gemma":0.000038705086,"threshold_uncertainty_score":0.7308733},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9864398,0.00080564554,0.00006939438,0.000003599942,0.00051250623,0.00007518926,0.0000022059612,0.00011936103,0.011972262],"genre_scores_gemma":[0.9996617,0.000081225415,0.00004111286,0.0000026141,0.0000043670216,0.000007152036,0.0000016875501,0.000014199816,0.00018597975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995719,0.000013064119,0.00013486184,0.00008312987,0.00008854645,0.0001084913],"domain_scores_gemma":[0.99972624,0.000050466675,0.00003017097,0.00012991237,0.00002987775,0.00003333893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090927766,0.00008730089,0.00012558511,0.000060197526,0.000042599997,0.000023529785,0.00006613251,0.000048968017,0.000012079286],"category_scores_gemma":[0.0000057106995,0.000075620184,0.000018410698,0.00020222449,0.000051722902,0.00014366137,0.000010163467,0.000060832524,0.000008849055],"study_design_candidate":"observational","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.000018151393,0.000025135987,0.39764395,0.00010787477,0.00005712179,0.000007767155,0.00056717795,0.002041162,0.00057736656,0.5983157,0.00008598726,0.00055256876],"study_design_scores_gemma":[0.004043142,0.00043523015,0.6034656,0.000309732,0.000103708946,0.00014590996,0.0012803798,0.014970591,0.0051650763,0.35712942,0.012060504,0.0008906614],"about_ca_topic_score_codex":0.000017914817,"about_ca_topic_score_gemma":0.0000028967788,"teacher_disagreement_score":0.2411863,"about_ca_system_score_codex":0.000008804056,"about_ca_system_score_gemma":0.000004675303,"threshold_uncertainty_score":0.30837014},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9499022,0.000026915304,0.0000023456369,0.00013515756,0.00039862294,0.00023912244,0.0000028751535,0.000098499404,0.049194258],"genre_scores_gemma":[0.9965423,0.000011687302,0.0002310258,0.000045575922,0.000023724879,0.000043004224,0.0000040228933,0.000041182033,0.0030574764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982841,0.00021795339,0.0003202026,0.00028046477,0.0003754936,0.0005217757],"domain_scores_gemma":[0.99882627,0.00046427484,0.00003597212,0.00052032195,0.00003729125,0.000115879],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007985919,0.00016300657,0.00025901216,0.00011480771,0.00006298334,0.00004376646,0.00036743836,0.00012510446,0.0027015635],"category_scores_gemma":[0.0002759244,0.00016390365,0.00007013867,0.00037804033,0.000096473734,0.000113196475,0.00007608198,0.0003509526,0.0011188287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017229647,0.000419488,0.0054573375,0.000031600594,0.000015594638,0.00009374433,0.0004973235,0.0000018254951,0.00013674889,0.9805783,0.0034576869,0.009138068],"study_design_scores_gemma":[0.0017510403,0.00015641449,0.0026659626,0.0000297029,0.0000072013836,0.000009697327,0.00003277047,0.00018391917,0.0012960003,0.99036694,0.0033108073,0.00018955997],"about_ca_topic_score_codex":0.000045806482,"about_ca_topic_score_gemma":0.000018365643,"teacher_disagreement_score":0.046640098,"about_ca_system_score_codex":0.000088674075,"about_ca_system_score_gemma":0.000053284955,"threshold_uncertainty_score":0.99965894},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95078653,0.000072516734,0.000029001863,0.00007105014,0.0012285962,0.0001693049,0.000004214786,0.00009221816,0.047546543],"genre_scores_gemma":[0.99741906,0.000030058434,0.0019910748,0.00008022577,0.00001447153,0.0000070475644,0.0000018279516,0.000030575953,0.00042565135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868447,0.000089622336,0.00037791778,0.00022829782,0.000320998,0.0002987071],"domain_scores_gemma":[0.99827427,0.00078181387,0.00015709388,0.00054855796,0.00012704212,0.00011122991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003120852,0.00018407573,0.0003215975,0.00008970356,0.00013223015,0.000014310145,0.00037192518,0.00014777598,0.00017694326],"category_scores_gemma":[0.0005846856,0.00015932239,0.00016885408,0.00031699927,0.00017355557,0.000090091045,0.00010973895,0.00020811745,0.000009303456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022039798,0.00016416027,0.03549959,0.00004029331,0.000081565355,0.000007961398,0.00040901045,6.907654e-7,0.00023207409,0.96192026,0.00110143,0.000520898],"study_design_scores_gemma":[0.00096659025,0.00008338417,0.013406278,0.000035615813,0.000049490707,0.000013259705,0.00006468162,0.000023718216,0.0010775907,0.9814841,0.0026088257,0.0001864432],"about_ca_topic_score_codex":0.000037196645,"about_ca_topic_score_gemma":0.000012534857,"teacher_disagreement_score":0.04712089,"about_ca_system_score_codex":0.00001992781,"about_ca_system_score_gemma":0.000021615851,"threshold_uncertainty_score":0.64969784},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98369116,0.000005326259,0.00010681509,0.00031516622,0.00014193828,0.00052551646,0.000013867614,0.00021489056,0.014985339],"genre_scores_gemma":[0.99896914,0.0000057112256,0.00052915455,0.00013791681,0.000004185707,0.00008992672,0.000013613979,0.000056540128,0.00019380689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866134,0.000083613304,0.00021369511,0.0003661192,0.00035678383,0.00031843723],"domain_scores_gemma":[0.9983097,0.00050274277,0.00015064857,0.00081187504,0.000088046305,0.00013701609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028103494,0.00028783135,0.00024958604,0.00012623302,0.0002469159,0.000039545423,0.00030185998,0.00009732522,0.000029416542],"category_scores_gemma":[0.000075514086,0.00018681906,0.00007372153,0.00045654582,0.00019345277,0.00007566671,0.000026397078,0.00032012098,0.00004162996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002741695,0.00071880285,0.00023984473,0.000018370925,0.000065318556,0.00001168222,0.0005804143,0.00007899412,0.00011865321,0.99766773,0.00019806731,0.000027956634],"study_design_scores_gemma":[0.001853212,0.0012929927,0.00068452116,0.00019794964,0.000043254873,0.0000059257895,0.00021213206,0.0000012674582,0.011004862,0.9842515,0.00017649835,0.00027585728],"about_ca_topic_score_codex":0.000020146716,"about_ca_topic_score_gemma":0.000013322074,"teacher_disagreement_score":0.015278004,"about_ca_system_score_codex":0.000077232224,"about_ca_system_score_gemma":0.000056662902,"threshold_uncertainty_score":0.761826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9974642,0.00006270082,0.00015700638,0.00030610146,0.0003656835,0.00043264285,0.000008579972,0.00009351172,0.0011095693],"genre_scores_gemma":[0.99526364,0.000025381216,0.004110335,0.00005863546,0.000007556298,0.00007713482,0.000027967184,0.00001937649,0.000409955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935603,0.00003310186,0.0001981558,0.00015952413,0.00008568988,0.00016751111],"domain_scores_gemma":[0.99933964,0.0002389249,0.000066257315,0.00023359474,0.000056934634,0.000064674874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012830072,0.00010038837,0.00015902103,0.00009569598,0.00013035824,0.000008628908,0.00012602347,0.000075377924,0.000053269516],"category_scores_gemma":[0.00006991221,0.000101242826,0.00006302218,0.00036185666,0.000043262124,0.00007636636,0.000015169934,0.00008627341,0.000032571927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003395838,0.00014417403,0.0008624749,0.0000146928505,0.000012412914,0.0000019877496,0.00029223223,1.846683e-7,0.0002958615,0.975086,0.023101836,0.00015422564],"study_design_scores_gemma":[0.0009660229,0.00006433079,0.0016994275,0.000019681733,0.000013795242,0.0000069142275,0.000038151637,0.000030404084,0.0026323595,0.99116623,0.0032456357,0.00011704197],"about_ca_topic_score_codex":0.000020659112,"about_ca_topic_score_gemma":0.000012471335,"teacher_disagreement_score":0.0198562,"about_ca_system_score_codex":0.000020155718,"about_ca_system_score_gemma":0.0000554432,"threshold_uncertainty_score":0.41285625},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9848844,0.0004345882,0.000040308598,0.000017882703,0.0015078892,0.00008134539,0.0000058886226,0.00023799481,0.012789722],"genre_scores_gemma":[0.9997607,0.000026337702,0.000008210996,0.000027896282,0.000011540747,0.000008765629,0.0000021096,0.00002514992,0.00012931509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993855,0.000037882688,0.00012720536,0.00011832148,0.00009664251,0.00023445216],"domain_scores_gemma":[0.9996484,0.00007022573,0.000015206947,0.00017503553,0.000010413903,0.000080720885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014050257,0.00011842523,0.00013205793,0.000055370896,0.000092704286,0.00003666584,0.00008035382,0.000067010784,0.00014977193],"category_scores_gemma":[0.0000212443,0.00012016668,0.000031910433,0.000117510135,0.000015703961,0.00008685218,0.000018198889,0.00012440945,0.00016282816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038271533,0.00004296988,0.00031556722,0.000033068718,0.000031136078,0.000015669817,0.0005954056,0.00020898663,0.00041684488,0.99366915,0.0038516375,0.00081572664],"study_design_scores_gemma":[0.00389356,0.0003855465,0.0009439791,0.00024066016,0.00005647188,0.000053676802,0.00063474686,0.13443208,0.007835817,0.7748066,0.07557103,0.0011457949],"about_ca_topic_score_codex":0.0000011343134,"about_ca_topic_score_gemma":5.2647886e-7,"teacher_disagreement_score":0.21886252,"about_ca_system_score_codex":0.000014832869,"about_ca_system_score_gemma":7.9310735e-7,"threshold_uncertainty_score":0.4900255},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9536532,0.0004424568,0.041407067,0.0021508287,0.0007568427,0.00016669932,6.43286e-7,0.000033969678,0.0013882521],"genre_scores_gemma":[0.99359107,0.000019544786,0.0061335484,0.00015806127,0.000010428152,0.000008052649,0.0000018944013,0.000002001399,0.000075375705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994294,0.00005749631,0.00014459538,0.00012980888,0.0001651354,0.00007358608],"domain_scores_gemma":[0.99947727,0.00016522473,0.00007172511,0.00017121049,0.00008769042,0.000026897862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002942184,0.000052697687,0.000077712306,0.00006215786,0.00007963066,0.00003766958,0.0001926548,0.000020400606,0.0000031682139],"category_scores_gemma":[0.000042600834,0.000039007064,0.00002874907,0.00034259542,0.00006013753,0.00024163489,0.00006702992,0.000040387113,0.0000052598916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010354314,0.000024968766,0.00018815808,0.0000028157758,0.0000071717445,2.2473874e-7,0.00057840813,0.0001470555,0.00016270851,0.9720828,0.0003581536,0.026437178],"study_design_scores_gemma":[0.002889202,0.00008481765,0.012105222,0.00000881621,0.000012231463,0.000011623824,0.00003807559,0.05661712,0.005084752,0.9209426,0.002090172,0.000115391354],"about_ca_topic_score_codex":0.000007469291,"about_ca_topic_score_gemma":0.0000028254742,"teacher_disagreement_score":0.056470066,"about_ca_system_score_codex":0.000008234837,"about_ca_system_score_gemma":0.000025534702,"threshold_uncertainty_score":0.1590662},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919204,0.00007336074,0.0022781137,0.00034365008,0.0010311927,0.00007722534,8.3596865e-7,0.000030770632,0.004244445],"genre_scores_gemma":[0.9976241,0.0000020039704,0.002187341,0.00005507493,0.0000048511333,0.0000021760466,0.000007184014,0.000002905619,0.00011438057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993983,0.000033599357,0.00014018248,0.00015130972,0.00017430392,0.000102290855],"domain_scores_gemma":[0.99960005,0.00009724413,0.000049328894,0.00017844947,0.000054605673,0.00002032843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013298287,0.000060026578,0.0000877821,0.00014680561,0.000023163691,0.000018289438,0.00019432633,0.000032139687,0.0000062106],"category_scores_gemma":[0.000029734487,0.00006128377,0.000019466497,0.00057965895,0.000010324463,0.000104886785,0.000027174367,0.000055385008,0.00003173562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073305587,0.000111700654,0.00087231904,0.0000034409386,0.0000018042306,0.0000058611827,0.000039129387,0.0025455218,0.0004993023,0.9924441,0.0026905986,0.0007789231],"study_design_scores_gemma":[0.00050594367,0.00015981123,0.028398054,0.000015442927,0.0000010503671,0.0000022990343,0.0000022486067,0.0137996385,0.0032371138,0.9530381,0.0007541995,0.000086094806],"about_ca_topic_score_codex":0.000058532863,"about_ca_topic_score_gemma":0.0000126366385,"teacher_disagreement_score":0.039405964,"about_ca_system_score_codex":0.000025443574,"about_ca_system_score_gemma":0.00004434201,"threshold_uncertainty_score":0.24990796},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97475874,0.00032370997,0.00179053,0.0155147165,0.0015931178,0.0023446477,0.000016293498,0.00052720786,0.0031310078],"genre_scores_gemma":[0.9878918,0.000022004455,0.0093094595,0.0023036557,0.000012643988,0.00022835178,0.000008847677,0.000049717077,0.00017355486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957746,0.00078859704,0.0006914755,0.0008797758,0.00085108593,0.0010144259],"domain_scores_gemma":[0.99722403,0.00048398983,0.0002232775,0.0015633405,0.0001610284,0.0003443377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013558414,0.0004422912,0.0006530867,0.0006008731,0.00032599494,0.00022820146,0.0022187533,0.00016885097,0.000029620767],"category_scores_gemma":[0.00018857121,0.00041635963,0.00016966187,0.0014891356,0.00021834038,0.0005834213,0.00043577063,0.00069717056,0.00033616903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018572365,0.0009857047,0.0024053627,0.00002856049,0.000052600968,0.00008951839,0.0017267435,0.00019403921,0.001461389,0.9795894,0.0029296349,0.010351319],"study_design_scores_gemma":[0.010067479,0.001841447,0.0140935825,0.00023732125,0.000015435644,0.000025161658,0.00015192793,0.03319051,0.0025991532,0.92106926,0.015736999,0.0009717084],"about_ca_topic_score_codex":0.00004241692,"about_ca_topic_score_gemma":0.000072357136,"teacher_disagreement_score":0.05852013,"about_ca_system_score_codex":0.00045103597,"about_ca_system_score_gemma":0.00014843959,"threshold_uncertainty_score":0.9998288},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906165,0.0021128482,0.0003415086,0.0011220053,0.0018897702,0.00015423186,0.0000023874893,0.000412263,0.0033484949],"genre_scores_gemma":[0.9963945,0.000040486793,0.002425724,0.0004252799,0.0000024928968,0.0000054723305,0.0000051545835,0.00001680002,0.00068404473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836016,0.000063820335,0.00030352935,0.0005347307,0.00032849933,0.0004092581],"domain_scores_gemma":[0.9989102,0.00012480303,0.00010080571,0.00059053214,0.00013681754,0.00013686396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033303897,0.00021724065,0.00022940477,0.00014698177,0.00017858128,0.00023329572,0.00049762556,0.0000967767,0.0000124440085],"category_scores_gemma":[0.00004357865,0.000203934,0.000058368143,0.00050410035,0.00010371393,0.0003601766,0.0002572643,0.00018615321,0.00018319947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000301058,0.00010437567,0.0022980343,0.000014097593,0.0000087696635,0.000024029057,0.00010387636,0.00005399441,0.002962535,0.98138636,0.012259586,0.00078130217],"study_design_scores_gemma":[0.00092431024,0.000098157936,0.0022990336,0.000041145373,0.000011799068,0.00002549783,0.000009762963,0.008144535,0.002100407,0.9835167,0.0025472404,0.00028139888],"about_ca_topic_score_codex":0.0003577938,"about_ca_topic_score_gemma":0.000008555422,"teacher_disagreement_score":0.009712345,"about_ca_system_score_codex":0.00002291573,"about_ca_system_score_gemma":0.00004406066,"threshold_uncertainty_score":0.8316187},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9760296,0.00008254885,0.0008241539,0.00009029222,0.0019066838,0.00032740837,0.000003066504,0.00021512549,0.020521162],"genre_scores_gemma":[0.9897149,0.0000107901815,0.009654379,0.0000829537,0.0000096339745,0.00004209568,0.0000012135112,0.000059008526,0.00042501293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984978,0.00012061673,0.000365565,0.00031990738,0.00032149247,0.00037462654],"domain_scores_gemma":[0.99802345,0.0010511581,0.00015992296,0.00054141233,0.000074868105,0.0001491818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043231557,0.00025264715,0.00033572633,0.00008473828,0.0002830307,0.00010178338,0.00014864061,0.00012264821,0.00006878423],"category_scores_gemma":[0.0020821425,0.0002483916,0.00006347401,0.00027601753,0.00012281403,0.00016844436,0.00005213209,0.00026090042,0.00006193401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008929064,0.00022196662,0.00012400516,0.000047894457,0.000018697883,0.000010723202,0.00042572623,0.0000029856878,0.00012819657,0.99759287,0.001209868,0.00020811705],"study_design_scores_gemma":[0.0011484863,0.0001291418,0.00003256534,0.00009982121,0.000027572501,0.000017420443,0.00012679744,0.00004454259,0.0030908785,0.9937366,0.0012767653,0.00026938977],"about_ca_topic_score_codex":0.0000014592869,"about_ca_topic_score_gemma":0.000001034447,"teacher_disagreement_score":0.02009615,"about_ca_system_score_codex":0.00009644174,"about_ca_system_score_gemma":0.000046714114,"threshold_uncertainty_score":0.99999684},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61610836,0.0000055514624,0.000019286927,0.005967953,0.0010246709,0.00011740778,0.0000027442427,0.00002498543,0.37672904],"genre_scores_gemma":[0.9838052,0.0000015665362,0.000010978404,0.00013957956,0.0000475009,0.00001116607,0.0000059516565,0.000003681697,0.015974393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993173,0.000093096816,0.000078126664,0.000084505606,0.00031063883,0.00011635934],"domain_scores_gemma":[0.99957305,0.00023958615,0.000047369627,0.00006664911,0.000056326786,0.000017013746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027940742,0.000045519493,0.000038493687,0.000015284963,0.0004125164,0.000044922974,0.00010104543,0.00003495518,0.00015238905],"category_scores_gemma":[0.00009618198,0.00003322885,0.00003409714,0.000091751725,0.000067398316,0.000117162264,0.000013239736,0.00007849539,0.00020808654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006253035,0.00003900447,0.000520716,2.3983276e-7,0.0000037205177,7.39954e-7,0.000605463,0.000010168697,0.000036757876,0.9946067,0.0041229045,0.000047383663],"study_design_scores_gemma":[0.0001927646,0.000033488555,0.013567269,0.000009041739,0.000004435745,1.1568015e-7,0.0001323733,0.00006854886,0.00024685467,0.9500878,0.03559325,0.000064068656],"about_ca_topic_score_codex":0.0020348148,"about_ca_topic_score_gemma":0.00025788217,"teacher_disagreement_score":0.36769682,"about_ca_system_score_codex":0.000114036644,"about_ca_system_score_gemma":0.00003670884,"threshold_uncertainty_score":0.31727844},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98062366,0.00047455938,7.0396953e-7,0.0000025000131,0.00080401887,0.00014475542,4.6013233e-7,0.00006497294,0.017884377],"genre_scores_gemma":[0.9997837,0.000010678729,0.0000033817532,0.000004579952,0.000002915908,0.000015191009,2.3080982e-7,0.000015709149,0.00016362518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994833,0.0000367494,0.0001825776,0.00008247567,0.00008930445,0.00012562699],"domain_scores_gemma":[0.9997319,0.000032556894,0.000019240346,0.00017902142,0.000011314626,0.00002593938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114593604,0.00007769431,0.00015178678,0.00007486499,0.000014830269,0.000006435298,0.0000990948,0.000038158083,0.00012862204],"category_scores_gemma":[0.000008870469,0.00008211204,0.000023478759,0.00020450023,0.000008992734,0.000076100965,0.000014192788,0.000092253686,0.00006792317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038699258,0.0029311082,0.22335958,0.00037553482,0.00037557655,0.00029213738,0.045141574,0.011317259,0.0039928923,0.69254667,0.017250627,0.0023783285],"study_design_scores_gemma":[0.044313725,0.0038171893,0.15229833,0.0016253593,0.0003274797,0.000159175,0.041664325,0.12971292,0.02071246,0.5624697,0.037417788,0.005481499],"about_ca_topic_score_codex":0.000016363758,"about_ca_topic_score_gemma":0.000009846403,"teacher_disagreement_score":0.13007693,"about_ca_system_score_codex":0.000017766415,"about_ca_system_score_gemma":9.2090636e-7,"threshold_uncertainty_score":0.33484316},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98962915,0.00017110207,0.0002812626,0.00042712095,0.0049826186,0.00010610964,0.0000026233545,0.00016741834,0.0042325757],"genre_scores_gemma":[0.9979291,0.00001373545,0.001735992,0.00020569949,0.0000034770223,0.0000026902906,0.0000023863508,0.000006815657,0.00010011379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986546,0.00003064091,0.00035132153,0.00030919912,0.00039367145,0.00026056654],"domain_scores_gemma":[0.99881864,0.00030866018,0.00015994592,0.00046663405,0.00014080861,0.000105333114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009152055,0.000111122405,0.00014750373,0.00022844455,0.00011821457,0.000028241126,0.00041428363,0.00007467137,0.0000019896283],"category_scores_gemma":[0.00010613957,0.0001061811,0.00007251881,0.000513017,0.00005526885,0.00025309104,0.000101814265,0.00017324118,0.000042424595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003914375,0.00015886872,0.00044347244,0.0000048504094,0.000012419437,0.000009208623,0.000106659514,0.000048957198,0.0016804632,0.99483323,0.0018746791,0.00078803045],"study_design_scores_gemma":[0.0010492918,0.00024949064,0.0061153593,0.000035736135,0.0000032765038,0.000003686381,0.000009189844,0.00036765504,0.022302743,0.96881837,0.00091872615,0.0001264495],"about_ca_topic_score_codex":0.000030084175,"about_ca_topic_score_gemma":0.0000012459883,"teacher_disagreement_score":0.026014851,"about_ca_system_score_codex":0.000025744235,"about_ca_system_score_gemma":0.00004037467,"threshold_uncertainty_score":0.43299395},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99351543,0.000069104244,0.00001985536,0.0019254352,0.00021964371,0.0004307659,0.00000575171,0.000008089688,0.0038059056],"genre_scores_gemma":[0.9994859,0.00007480723,0.000036298254,0.00005138512,0.0000058671394,0.000048380894,5.0142876e-7,0.000009109439,0.000287767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914145,0.00017718255,0.00027461862,0.000076257544,0.00021711738,0.000113381306],"domain_scores_gemma":[0.99832183,0.0008244178,0.00023972274,0.0005222483,0.00007790215,0.000013869674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049851614,0.00007715714,0.000121893034,0.0000054281904,0.0003639862,0.000021989441,0.00029541107,0.00002425231,0.000028362045],"category_scores_gemma":[0.00020560648,0.000032363114,0.00007775412,0.00018244685,0.00030973306,0.000042828473,0.0002016245,0.00011526348,0.000004059029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024261833,0.000048982856,0.012166275,0.000010350527,0.000042837277,5.353183e-8,0.0007201392,6.5769393e-7,0.0002789739,0.98507,0.0013922477,0.00024520318],"study_design_scores_gemma":[0.0010743977,0.000009246435,0.020208264,0.000025559759,0.000056396264,0.000005470479,0.00034806118,0.00009094082,0.002143105,0.9735769,0.0024194443,0.000042228865],"about_ca_topic_score_codex":0.000029493121,"about_ca_topic_score_gemma":0.00002553454,"teacher_disagreement_score":0.0114931315,"about_ca_system_score_codex":0.000015436031,"about_ca_system_score_gemma":0.000019410558,"threshold_uncertainty_score":0.27995244},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99238276,0.000037693855,0.000006948303,0.000058825513,0.0012679668,0.00016495884,0.000006384313,0.000037902104,0.006036583],"genre_scores_gemma":[0.9992599,0.000007180537,0.00055195607,0.000067001085,0.000006339634,0.000010256489,0.0000019515294,0.000022376691,0.00007302574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874574,0.00007542884,0.00038608414,0.00023546147,0.0002790678,0.0002781917],"domain_scores_gemma":[0.9989455,0.0004387281,0.00015211452,0.000362926,0.000041410498,0.000059320882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035809202,0.00017333432,0.00029252443,0.00010985325,0.00009643347,0.000020065274,0.00032791693,0.00013806175,0.00003538864],"category_scores_gemma":[0.00034533086,0.00014846494,0.00010353558,0.00023914145,0.00023113405,0.000095444215,0.00007273161,0.0002148904,0.0000063388993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006982196,0.00016194585,0.00869448,0.000052608353,0.000022250659,0.000023459384,0.0020053813,0.000052335683,0.00023922675,0.98848814,0.00012398098,0.0000663898],"study_design_scores_gemma":[0.0014886602,0.00017253033,0.006842742,0.00008633803,0.000009058161,0.000005966371,0.00015931841,0.000004209948,0.004172896,0.9868767,0.000019599483,0.00016194751],"about_ca_topic_score_codex":0.000105877596,"about_ca_topic_score_gemma":0.00002804764,"teacher_disagreement_score":0.0068771746,"about_ca_system_score_codex":0.00008485613,"about_ca_system_score_gemma":0.00003780853,"threshold_uncertainty_score":0.60542244},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99016917,0.0000577722,0.006019878,0.00073418586,0.0005261387,0.00019155674,0.0000036952958,0.00019664,0.002100955],"genre_scores_gemma":[0.99605644,0.00004025302,0.0035906236,0.00020815908,0.0000053077656,0.000014786122,5.4674274e-7,0.000011905206,0.00007197918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979464,0.00018147839,0.00019523285,0.0006051496,0.0006252357,0.00044652433],"domain_scores_gemma":[0.9975895,0.0010490038,0.000036175777,0.0008483887,0.00023326764,0.00024361715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034050713,0.00018254107,0.00020737536,0.00006855152,0.0003097932,0.000070216534,0.0008407446,0.00009888999,0.00004080243],"category_scores_gemma":[0.0009494299,0.00016526703,0.000052223382,0.00038409122,0.00040278313,0.00055038155,0.00044632578,0.0004305908,0.00015115165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015356452,0.00013358038,0.032466967,0.000008900639,0.0000062337226,0.00007092934,0.00023244657,0.0000013904629,0.00032813713,0.9615419,0.000042711363,0.0051514558],"study_design_scores_gemma":[0.00041734774,0.00016403686,0.081198536,0.000013435851,0.0000010198075,0.00007429494,0.000008294052,0.0004085874,0.0043515484,0.9129694,0.00018736855,0.00020610064],"about_ca_topic_score_codex":0.000021548854,"about_ca_topic_score_gemma":0.000002150237,"teacher_disagreement_score":0.048731573,"about_ca_system_score_codex":0.00005555793,"about_ca_system_score_gemma":0.00007858955,"threshold_uncertainty_score":0.6739394},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97424084,0.00019816699,0.00035705278,0.00017824744,0.0013166963,0.00014127967,0.0000017746491,0.00069724384,0.022868708],"genre_scores_gemma":[0.9983362,0.00004248229,0.0010035875,0.0002859733,0.000016702626,0.0000147213705,0.0000025738036,0.000011799583,0.00028595544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869365,0.00008042609,0.00018898296,0.00039183768,0.0002867987,0.0003583147],"domain_scores_gemma":[0.99900645,0.00008240555,0.000044989563,0.0007013291,0.00003807606,0.0001267249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034409837,0.00016909972,0.0001811317,0.0000866361,0.00021415931,0.00019379701,0.0007339149,0.00007500035,0.00035031486],"category_scores_gemma":[0.000004027205,0.00016438187,0.0001209728,0.0005282362,0.00004776079,0.00039791488,0.00012160881,0.0001584328,0.00031493083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022725351,0.00017257915,0.0009381643,0.0000055732626,0.00003720458,0.000031425683,0.00056520285,0.00000889407,0.00018284534,0.9900124,0.0021706093,0.005852347],"study_design_scores_gemma":[0.00215435,0.00016024742,0.004208848,0.000022491404,0.000019506328,0.000042461477,0.000011810775,0.0016811015,0.0018934004,0.93597645,0.053410962,0.00041834573],"about_ca_topic_score_codex":0.00002864925,"about_ca_topic_score_gemma":0.0000018579857,"teacher_disagreement_score":0.054035954,"about_ca_system_score_codex":0.000029862029,"about_ca_system_score_gemma":0.0000442392,"threshold_uncertainty_score":0.6703298},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99666053,0.0003048866,0.00019262015,0.00012313404,0.00019186828,0.00014784397,0.0000019520317,0.00003130201,0.0023458356],"genre_scores_gemma":[0.9911138,0.00003311184,0.008704289,0.000007889421,0.0000022477384,0.000006200466,4.6532514e-7,0.0000071864597,0.00012480601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988657,0.00011136964,0.000220673,0.00027059138,0.00031738557,0.00021426308],"domain_scores_gemma":[0.9990177,0.0001447658,0.00008302401,0.00051871024,0.00017950317,0.00005628131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053256704,0.000089276036,0.00020660847,0.00009055205,0.000050439558,0.000012976013,0.00052631844,0.000032912078,0.000013089579],"category_scores_gemma":[0.00014594333,0.00008740907,0.000036806185,0.00055017107,0.0001480284,0.00027193173,0.00017178478,0.00011456064,0.0000062355166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016525202,0.00007435735,0.0017105257,0.00006142123,0.000015290727,0.00000809648,0.0008006535,0.000016650696,0.006734197,0.8934665,0.000056449764,0.097039364],"study_design_scores_gemma":[0.0007409255,0.00027542197,0.007826885,0.00007352379,0.0000053982326,0.000018166545,0.000048073387,0.0017728186,0.069451235,0.91939974,0.00022722968,0.00016060952],"about_ca_topic_score_codex":0.000012430028,"about_ca_topic_score_gemma":2.1651948e-7,"teacher_disagreement_score":0.09687875,"about_ca_system_score_codex":0.00001364785,"about_ca_system_score_gemma":0.000051195257,"threshold_uncertainty_score":0.35644382},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97423023,0.00010720803,0.022018412,0.00027223647,0.00024430436,0.00018048016,5.9530623e-7,0.00008535678,0.0028611622],"genre_scores_gemma":[0.9982924,0.00003846878,0.0015985317,0.000021853883,0.0000012958957,0.000014883314,0.0000016336159,0.000006491361,0.000024484181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988928,0.00011186937,0.00026036976,0.00019674018,0.00026557982,0.00027267687],"domain_scores_gemma":[0.9992887,0.00015192662,0.00006406222,0.00035549107,0.00008444484,0.000055411907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041699968,0.000093534516,0.00016330737,0.00039482134,0.000047950965,0.000025596744,0.000595059,0.000048126665,0.000008343801],"category_scores_gemma":[0.00006760052,0.00009476541,0.000051562518,0.0016530675,0.00005711401,0.00071379694,0.000059442165,0.0001494877,0.0000082603265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025523357,0.00008429043,0.005444528,0.0000070404876,0.0000062023023,0.0000143909165,0.0015030843,0.00018653963,0.0033527098,0.9816053,0.0000143499465,0.0077560437],"study_design_scores_gemma":[0.001122298,0.00012633625,0.016545406,0.00004006225,0.0000014304499,0.000008701188,0.00010484634,0.008214186,0.007549152,0.96596617,0.00019852193,0.00012290615],"about_ca_topic_score_codex":0.000033101926,"about_ca_topic_score_gemma":0.000027366501,"teacher_disagreement_score":0.024062114,"about_ca_system_score_codex":0.000029769873,"about_ca_system_score_gemma":0.00003098976,"threshold_uncertainty_score":0.38644212},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.963957,0.0006833018,0.000031181633,0.000008179597,0.0015638209,0.000087113796,9.638657e-7,0.00020778044,0.03346064],"genre_scores_gemma":[0.99963355,0.00008696307,0.00002295688,0.000005059425,0.000006568179,0.000010163584,0.0000016676811,0.000020853051,0.00021219191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994414,0.000010596449,0.00018691835,0.000086385895,0.00010613023,0.00016857563],"domain_scores_gemma":[0.9996529,0.000024494851,0.000029606283,0.00021341206,0.000031050495,0.000048489117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012747823,0.00009747259,0.00015905483,0.00007276717,0.00002796489,0.000011298653,0.00015670208,0.000059239454,0.00007603063],"category_scores_gemma":[0.0000041996063,0.000100244186,0.00005209014,0.00033864958,0.000021746335,0.00009712992,0.000016946191,0.000077702985,0.00006437234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036941696,0.00006632464,0.0089132665,0.00017386004,0.00008025309,0.000018697645,0.0005787616,0.0011371512,0.007153954,0.97814155,0.0026444816,0.001054767],"study_design_scores_gemma":[0.007149331,0.0002479249,0.0059108417,0.0002670126,0.000088723646,0.000111891764,0.0005730624,0.0037696967,0.07074389,0.7559879,0.15394205,0.0012076667],"about_ca_topic_score_codex":0.000027965265,"about_ca_topic_score_gemma":0.0000021673598,"teacher_disagreement_score":0.22215363,"about_ca_system_score_codex":0.000015469695,"about_ca_system_score_gemma":0.0000050924887,"threshold_uncertainty_score":0.4087839},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99136573,0.000046002468,0.00010775576,0.000042419742,0.00011997323,0.00020659881,0.000002951787,0.000060888844,0.008047651],"genre_scores_gemma":[0.9985033,0.000013639343,0.0011621283,0.000015137889,0.0000023367538,0.000023830704,0.00000382905,0.000019580966,0.0002561652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992241,0.000045243745,0.00020290322,0.00016063223,0.00019447469,0.00017261688],"domain_scores_gemma":[0.999016,0.00028579042,0.00013375025,0.00039971515,0.000103910774,0.000060830695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020593453,0.000113901726,0.00019447836,0.00016079133,0.000088780405,0.000008949419,0.0001475147,0.0000402703,0.000082358645],"category_scores_gemma":[0.00004556896,0.000093658695,0.00005706191,0.0011340379,0.00008096117,0.000076249395,0.000033299057,0.000103617545,0.000022681741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024673554,0.00029819235,0.015495801,0.000014612351,0.0000327209,0.0000029543214,0.000086515895,0.0000022547324,0.00053917395,0.9827557,0.00054078276,0.00020660933],"study_design_scores_gemma":[0.0009924752,0.00010211532,0.002036856,0.000029513889,0.000048289752,0.000011631952,0.00008662229,0.000020879017,0.0026913153,0.99350405,0.00036129795,0.000114967326],"about_ca_topic_score_codex":0.000017243727,"about_ca_topic_score_gemma":0.0000054904654,"teacher_disagreement_score":0.013458945,"about_ca_system_score_codex":0.0000130706285,"about_ca_system_score_gemma":0.000014534677,"threshold_uncertainty_score":0.38192907},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9759256,0.000025101226,0.015316077,0.00006932461,0.00046506946,0.0002412353,0.00007251332,0.000018309542,0.007866745],"genre_scores_gemma":[0.99921095,0.0000011151815,0.000635799,0.0000070059273,0.0000168105,0.000015259098,0.000018496856,0.000013351865,0.00008122947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925584,0.000010777748,0.00030741404,0.00014031611,0.0001196051,0.00016606801],"domain_scores_gemma":[0.9993684,0.00005308816,0.00017422876,0.00027429734,0.00006639092,0.000063575026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007251802,0.000105585306,0.00024100023,0.000026244383,0.000054208747,0.0000053624617,0.00016701529,0.000029388191,0.00013274504],"category_scores_gemma":[0.0000069419366,0.000100033096,0.000097956115,0.00016654351,0.00012949372,0.000052779735,0.000053172414,0.0000670212,0.000022492119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001131591,0.00027769833,0.00035051376,0.000011886187,0.000028583956,1.2315579e-7,0.00010357331,0.00011881461,0.0038657575,0.9944767,0.00009089706,0.00066417357],"study_design_scores_gemma":[0.0010076648,0.000063938845,0.00008303149,0.000028320468,0.00002118366,2.2325422e-7,0.00016700038,0.000015595468,0.099095725,0.89765626,0.0017494829,0.000111593516],"about_ca_topic_score_codex":0.000055886772,"about_ca_topic_score_gemma":2.3841672e-7,"teacher_disagreement_score":0.09682042,"about_ca_system_score_codex":0.000016812226,"about_ca_system_score_gemma":0.00004158642,"threshold_uncertainty_score":0.4079231},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98333395,0.00037423914,0.011906309,0.00021682697,0.0012055103,0.00045107474,0.0000077705845,0.00018106386,0.0023232705],"genre_scores_gemma":[0.9986784,0.00006146787,0.00092532224,0.0000837619,0.000015910055,0.00003173223,0.0000050700946,0.000018616067,0.00017972192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978633,0.00028147595,0.00052768504,0.00062425295,0.0003384482,0.00036486468],"domain_scores_gemma":[0.99772215,0.00046713202,0.0002855093,0.00087067136,0.00048992614,0.00016460393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006150021,0.00026768993,0.0005518486,0.00014140335,0.000218226,0.00005138645,0.00047169914,0.00013906854,0.000015585894],"category_scores_gemma":[0.00014450023,0.00022293295,0.00009058384,0.0006992607,0.00025863672,0.00044630564,0.00017957223,0.00021624904,0.0000050854514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033284925,0.00069830497,0.045168363,0.00015805427,0.00020829788,0.00011195243,0.0026451668,0.00031632808,0.0009929385,0.94400424,0.0044068173,0.0009566907],"study_design_scores_gemma":[0.017893868,0.010229399,0.08048766,0.000822047,0.00014711148,0.0023291786,0.0004269303,0.2423926,0.025303971,0.6134322,0.0038542051,0.0026807985],"about_ca_topic_score_codex":0.0005214365,"about_ca_topic_score_gemma":0.00013317478,"teacher_disagreement_score":0.330572,"about_ca_system_score_codex":0.000039563285,"about_ca_system_score_gemma":0.00009648649,"threshold_uncertainty_score":0.90909415},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010663072,0.00055700995,0.9828193,0.0030008117,0.0001353846,0.0003204206,0.0000010931338,0.0003903303,0.002112538],"genre_scores_gemma":[0.87509143,0.00016994406,0.12366664,0.00040159828,0.00004424074,0.00032830093,0.0000041834646,0.0000076941915,0.0002859668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992198,0.000023090106,0.0001450159,0.00036929233,0.00011541775,0.00012743361],"domain_scores_gemma":[0.99932104,0.000029386012,0.000065900655,0.00042398824,0.00009817718,0.000061508304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012638996,0.0000777455,0.00006707193,0.000046336125,0.00022482581,0.00010631471,0.0002664809,0.00003692674,0.000008097709],"category_scores_gemma":[0.000015906895,0.00008350204,0.00001783417,0.00033656173,0.00004262375,0.00032960734,0.000069521906,0.00007293961,0.000024739398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.2022669e-7,0.00003239608,0.00007080731,0.0000022953295,0.0000024498097,4.4757698e-7,0.000065049586,0.00016324436,0.0008295958,0.963781,0.0017590391,0.033293538],"study_design_scores_gemma":[0.000093838746,0.000023991051,0.00020324891,0.0000026687953,0.000002448241,0.00003670142,0.0000038394396,0.065012574,0.0021650498,0.8977817,0.03456247,0.0001114526],"about_ca_topic_score_codex":0.0000059816334,"about_ca_topic_score_gemma":3.5844988e-7,"teacher_disagreement_score":0.86442834,"about_ca_system_score_codex":0.000047350666,"about_ca_system_score_gemma":0.0000146966795,"threshold_uncertainty_score":0.3405114},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94328123,0.00040069874,0.054158937,0.00062153774,0.0006303661,0.00015451811,7.0329287e-7,0.000084197876,0.00066780386],"genre_scores_gemma":[0.993748,0.00016772441,0.0057424745,0.00025896644,0.0000053768163,0.0000125102215,6.9443854e-7,0.0000059626586,0.00005826815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993635,0.000025178388,0.000147738,0.00020408056,0.00010228148,0.00015724651],"domain_scores_gemma":[0.9992768,0.0001935246,0.00006529402,0.00035920631,0.00003171934,0.000073455616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006902036,0.00008052397,0.00013031346,0.00003220806,0.00008939754,0.000019097577,0.00032159328,0.00003278203,0.0000023846871],"category_scores_gemma":[0.000013604773,0.0000732302,0.000037275946,0.0002701361,0.00009477672,0.0001719183,0.00014729312,0.00007547633,0.000003884291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003996109,0.00011455061,0.03777399,0.000008250806,0.00002510838,0.000015091034,0.0002787797,0.00030109828,0.00034979277,0.93751365,0.011859318,0.011756374],"study_design_scores_gemma":[0.0020354248,0.00046748892,0.22634546,0.000067418005,0.000028812481,0.00010541691,0.00001892154,0.12712221,0.0050538513,0.62685746,0.010999233,0.0008983112],"about_ca_topic_score_codex":0.000014152405,"about_ca_topic_score_gemma":8.275221e-7,"teacher_disagreement_score":0.3106562,"about_ca_system_score_codex":0.0000064717337,"about_ca_system_score_gemma":0.000010799948,"threshold_uncertainty_score":0.2986241},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99008,0.0015475947,0.00008139938,0.00027708977,0.004374126,0.0003980412,0.000012317475,0.0004083938,0.0028210098],"genre_scores_gemma":[0.9992921,0.000038261667,0.000042417847,0.00003688642,0.000031666154,0.00013949248,0.0000037823215,0.000038336042,0.0003771099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991884,0.000032117397,0.00020289485,0.00013554191,0.00012084537,0.00032020503],"domain_scores_gemma":[0.9993125,0.000182103,0.00004089288,0.0003485795,0.00004504817,0.00007082928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031793118,0.00015128983,0.00015108097,0.000043211592,0.00026447867,0.000060523216,0.00027774475,0.000082022576,0.000008829136],"category_scores_gemma":[0.000029094776,0.0001185579,0.00012799873,0.00016832113,0.000042798547,0.0001075043,0.000016653301,0.00010952512,0.000057932415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009362547,0.000022061533,0.0010061535,0.000028822395,0.000044891098,9.679894e-7,0.00014931163,0.0003467707,0.00023833476,0.97891665,0.017435836,0.0018008557],"study_design_scores_gemma":[0.0007953039,0.000037270198,0.0013579654,0.000029864505,0.000021407239,0.000005945643,0.00025425435,0.002693676,0.0029959597,0.69468516,0.29686147,0.00026170138],"about_ca_topic_score_codex":0.0000026259893,"about_ca_topic_score_gemma":0.000036626694,"teacher_disagreement_score":0.28423145,"about_ca_system_score_codex":0.000031227253,"about_ca_system_score_gemma":0.000005786356,"threshold_uncertainty_score":0.4834651},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9910124,0.0006241334,0.00065024564,0.00008325228,0.0005302426,0.0003247851,0.0000065033205,0.000071867486,0.0066965553],"genre_scores_gemma":[0.99511015,0.000028888811,0.0045717363,0.000004446445,0.0000056522863,0.000012920425,0.000001525763,0.000027721784,0.0002369523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985519,0.00007651984,0.0005807495,0.00015500264,0.00039655066,0.00023928453],"domain_scores_gemma":[0.9963535,0.0024487474,0.0003702524,0.0005998398,0.00018738126,0.00004028069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005458464,0.00015595826,0.0003840525,0.000105910425,0.00010725938,0.00001035864,0.00029575406,0.0000724505,0.000009648621],"category_scores_gemma":[0.0010752442,0.000104326384,0.00013114359,0.0007179441,0.0002792266,0.00008467049,0.000104332175,0.000114983086,0.0000070952037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018169263,0.00022326774,0.00043910646,0.00010775852,0.000028859458,0.0000013199702,0.00010738555,0.0000031683633,0.0017920501,0.9964799,0.0005378059,0.0002611815],"study_design_scores_gemma":[0.0004270766,0.00008454415,0.00033294933,0.00005631764,0.00004273713,0.0000018477207,0.00017702425,0.000033910994,0.038289737,0.9602942,0.00015572709,0.000103949766],"about_ca_topic_score_codex":0.000024968878,"about_ca_topic_score_gemma":0.0000058600685,"teacher_disagreement_score":0.03649769,"about_ca_system_score_codex":0.0000263865,"about_ca_system_score_gemma":0.000017710649,"threshold_uncertainty_score":0.42543063},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98540837,0.00013323867,0.0002826241,0.00018473162,0.0023819155,0.0005685984,0.000042014042,0.00020712045,0.010791401],"genre_scores_gemma":[0.9936996,0.0000048931374,0.005146902,0.00017327169,0.000039539194,0.00006674986,0.000021429743,0.00006583577,0.00078179216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986251,0.00007390582,0.0003692896,0.00030622628,0.00019007683,0.0004354145],"domain_scores_gemma":[0.99862504,0.00051216537,0.00016007894,0.00051161414,0.00011198527,0.0000791335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036192685,0.0002444079,0.00032965772,0.00009212749,0.00028576964,0.00005069327,0.00033467024,0.00014084873,0.00007753606],"category_scores_gemma":[0.000101278485,0.00021348734,0.0002449321,0.00020100204,0.00014281746,0.00006788499,0.00008374358,0.00015126303,0.000015140807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004079022,0.00009316815,0.002795994,0.000056842608,0.000058940856,0.0000033588954,0.00030152634,0.0000025411136,0.00025016692,0.98300666,0.0131377885,0.0002522344],"study_design_scores_gemma":[0.0013392881,0.000071261966,0.0012941405,0.000021170386,0.00005808039,0.000005774748,0.000053175336,0.00006401462,0.00055259175,0.97967696,0.016579278,0.00028423796],"about_ca_topic_score_codex":0.000060872924,"about_ca_topic_score_gemma":0.000044984685,"teacher_disagreement_score":0.010009609,"about_ca_system_score_codex":0.000029813382,"about_ca_system_score_gemma":0.000016512402,"threshold_uncertainty_score":0.8705761},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9895656,0.00002638842,0.0040085637,0.0008053545,0.0005987337,0.0002075507,0.0000018492044,0.000037134483,0.004748795],"genre_scores_gemma":[0.99877566,0.0000046977284,0.0009824872,0.00007434031,0.000005120402,0.000017391985,6.7576894e-7,0.000008560372,0.00013109433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859697,0.00018413582,0.00025720947,0.00022069413,0.00051250483,0.00022849154],"domain_scores_gemma":[0.99830866,0.0006035476,0.00014630225,0.0006974632,0.0001938086,0.000050246825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072000903,0.0001049911,0.00015999294,0.00008826389,0.00009143195,0.000027646154,0.0008848423,0.00005182246,0.00008366992],"category_scores_gemma":[0.00018222864,0.0000784677,0.00009604065,0.00064167153,0.00021486722,0.00030186682,0.00015533695,0.00014260387,0.000048259095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004740622,0.00027436248,0.00027233124,0.000004626215,0.000015254247,0.0000012845912,0.00024783454,0.00003269883,0.0018357928,0.99395084,0.00045934372,0.002858213],"study_design_scores_gemma":[0.00055693806,0.0002047148,0.0004693502,0.000016152102,0.000003235693,0.000001550435,0.000011920045,0.0017244566,0.05288743,0.9436731,0.0003669967,0.000084200925],"about_ca_topic_score_codex":0.0000052404657,"about_ca_topic_score_gemma":0.000001088974,"teacher_disagreement_score":0.051051635,"about_ca_system_score_codex":0.000030247613,"about_ca_system_score_gemma":0.000043457858,"threshold_uncertainty_score":0.319982},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9971187,0.0000815646,0.00035257282,0.00022017884,0.0018207678,0.00016872649,0.0000019008244,0.00006152954,0.00017406562],"genre_scores_gemma":[0.99833554,0.0000048105276,0.0015523859,0.000034987177,6.6048227e-7,0.000015626463,9.920795e-7,0.000007017618,0.00004798768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992621,0.000019215173,0.00018698312,0.00018803554,0.00015883947,0.00018482418],"domain_scores_gemma":[0.9989455,0.00034493572,0.00009789811,0.0004588722,0.00008774081,0.00006505611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031804643,0.0001034227,0.000139413,0.000037814272,0.00018885595,0.00008876891,0.00039005623,0.000051642513,0.000006787105],"category_scores_gemma":[0.00006745709,0.000066679386,0.00006305403,0.00020940948,0.00013482232,0.00016842305,0.000103908766,0.000116042735,0.0000029856828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010991881,0.000032460754,0.013267463,0.000014044761,0.00001901873,1.3812071e-7,0.00033293813,0.0000018662286,0.00227513,0.98323715,0.0004553217,0.0003633736],"study_design_scores_gemma":[0.00043079507,0.0000606197,0.012126981,0.000011955382,0.000015379965,0.0000021140083,0.000030258723,0.0044736713,0.0041840305,0.9782213,0.00034519177,0.00009769759],"about_ca_topic_score_codex":0.000035107652,"about_ca_topic_score_gemma":0.0000085517295,"teacher_disagreement_score":0.005015841,"about_ca_system_score_codex":0.0000028282589,"about_ca_system_score_gemma":0.00002688046,"threshold_uncertainty_score":0.27191064},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917437,0.00042818178,0.000012870042,0.000014464273,0.00071538833,0.00021026123,0.0000034591283,0.00011843753,0.0067532337],"genre_scores_gemma":[0.99984384,0.00003416504,0.000011914632,0.000014748361,0.0000039195993,0.000026266047,0.0000038025178,0.000022831526,0.000038506754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902415,0.000102534665,0.00030585233,0.00014702308,0.00015868348,0.0002617621],"domain_scores_gemma":[0.9993186,0.00012092565,0.000048811984,0.0004254648,0.000039976294,0.000046239762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033910305,0.00013595328,0.00023743266,0.00011466197,0.00008440104,0.000009547302,0.00029945237,0.00008374909,0.000026823978],"category_scores_gemma":[0.000055286553,0.000116365634,0.0000794862,0.0007407619,0.000065769804,0.000096760545,0.000022822273,0.00018581399,0.000014578647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014645922,0.0000586765,0.008083209,0.00007196836,0.000044412187,0.00005444516,0.0021015608,0.00044695157,0.00738195,0.981177,0.00042371725,0.00014149719],"study_design_scores_gemma":[0.0011801574,0.0000686403,0.024034936,0.0000825018,0.000013700424,0.00008249687,0.00043235527,0.0020675426,0.00756652,0.9627624,0.0014249096,0.00028384628],"about_ca_topic_score_codex":0.0001448033,"about_ca_topic_score_gemma":0.000040284,"teacher_disagreement_score":0.018414574,"about_ca_system_score_codex":0.000028741943,"about_ca_system_score_gemma":0.000018307837,"threshold_uncertainty_score":0.47452527},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99291563,0.00008827511,0.0000063597954,0.00044979958,0.0001800279,0.00012379793,0.0000049069467,0.000019508747,0.0062116743],"genre_scores_gemma":[0.9992821,0.0000029156602,0.000042036772,0.000029784655,0.000019506879,0.00008551988,0.0000017299587,0.000004190893,0.00053219835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995414,0.000010609699,0.00012396155,0.00010976259,0.00008964525,0.00012463909],"domain_scores_gemma":[0.9996752,0.000012245839,0.000049645594,0.00018221425,0.000041868378,0.000038804556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000044562974,0.0000561637,0.00008474609,0.000023941857,0.000102338745,0.000017427323,0.00013962085,0.000010211448,0.00033405467],"category_scores_gemma":[0.0000025395464,0.00004909393,0.00004372339,0.00016390302,0.00007598455,0.00015333036,0.000032146938,0.00004671643,0.00019104696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.831486e-7,0.0001973757,0.0038319037,0.000002286399,0.000007882149,8.030874e-8,0.00016688311,0.000018173901,0.006827324,0.98617005,0.0017866078,0.0009907691],"study_design_scores_gemma":[0.00060153403,0.00005472396,0.0011050942,0.000018278346,0.000018064418,2.52488e-7,0.00018713606,0.0017379908,0.0724163,0.9195498,0.004158645,0.00015216153],"about_ca_topic_score_codex":0.000047645968,"about_ca_topic_score_gemma":7.084091e-7,"teacher_disagreement_score":0.06662021,"about_ca_system_score_codex":0.0000071132627,"about_ca_system_score_gemma":0.000011867915,"threshold_uncertainty_score":0.36576644},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9960307,0.00010072044,0.00005195375,0.00084739726,0.00009859666,0.000107950604,0.0000036940503,0.000009052345,0.0027499353],"genre_scores_gemma":[0.9993069,0.000021003938,0.000061457285,0.0005054478,0.000015349786,0.0000034161312,0.00002873415,0.000005710312,0.000051952964],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994938,0.000038391387,0.00011302868,0.00012893236,0.00009627572,0.0001296116],"domain_scores_gemma":[0.99968934,0.000020287234,0.000057741287,0.00016227459,0.0000432868,0.000027062099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013350957,0.00008852749,0.000083087005,0.000014302404,0.00007316764,0.00001154495,0.00013999248,0.000077026314,0.0000042406805],"category_scores_gemma":[0.000012798901,0.000050266965,0.000049461465,0.00007412997,0.00006964435,0.0000029717853,0.000020610169,0.00007545651,0.0000045447287],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064123736,0.00044629964,0.0031200286,0.000046642082,0.00012610253,0.0000026218684,0.00065626577,0.0004109583,0.8090115,0.14955682,0.0031663696,0.03281513],"study_design_scores_gemma":[0.0022105745,0.003263502,0.014560952,0.00005550361,0.000034531324,0.00001650818,0.0001282227,0.00028663423,0.91275054,0.019156715,0.047125436,0.00041084722],"about_ca_topic_score_codex":0.000005733833,"about_ca_topic_score_gemma":0.000011379625,"teacher_disagreement_score":0.13040009,"about_ca_system_score_codex":0.000006215429,"about_ca_system_score_gemma":0.000015833413,"threshold_uncertainty_score":0.20498273},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98151535,0.000014351619,0.000012173859,0.00059556705,0.0011670644,0.00018158599,0.0000053591657,0.000054426677,0.016454106],"genre_scores_gemma":[0.9989678,0.000005056301,0.00045172143,0.00030914217,0.000026175203,0.0000097200045,0.0000019366362,0.00003134814,0.00019707861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882483,0.00012594681,0.00026804153,0.00020682889,0.00033552144,0.00023883065],"domain_scores_gemma":[0.9985079,0.000457948,0.00011615429,0.0007643397,0.000073876006,0.00007975226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039110964,0.00017020552,0.0002391036,0.00003206658,0.00023811859,0.00003329834,0.00043461806,0.00013692667,0.00023343886],"category_scores_gemma":[0.00022850482,0.00010550649,0.00012619417,0.00014807809,0.00026450344,0.000079909405,0.000071446295,0.0002933167,0.000037061433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036899342,0.0003222299,0.00073859,0.000013922667,0.00004239081,0.000004721639,0.0009344515,0.0000016137285,0.00021891044,0.9952769,0.0022286875,0.00018065226],"study_design_scores_gemma":[0.0007485641,0.0001529481,0.002194793,0.000033356147,0.000026653071,0.000010208232,0.00012711181,0.000006098618,0.0034043794,0.9920174,0.0011399449,0.00013853419],"about_ca_topic_score_codex":0.000009921676,"about_ca_topic_score_gemma":0.0000028340405,"teacher_disagreement_score":0.017452456,"about_ca_system_score_codex":0.0000420421,"about_ca_system_score_gemma":0.000040885978,"threshold_uncertainty_score":0.43024302},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99029815,0.000084477986,0.0036231563,0.00015558758,0.0007050976,0.00013694372,0.0000013777164,0.0001153828,0.0048798476],"genre_scores_gemma":[0.9972183,0.000018172555,0.0025227454,0.00006162897,0.0000012878544,0.00000770742,6.924896e-7,0.000007823299,0.00016160215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987233,0.00010757337,0.00016702403,0.0002865306,0.00045207894,0.0002634786],"domain_scores_gemma":[0.9986347,0.00022611787,0.00006559657,0.0008535194,0.00012259092,0.000097476244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002768031,0.000104774605,0.00016826867,0.00017271057,0.00013582892,0.000011161352,0.0010100938,0.000051236515,0.000012025],"category_scores_gemma":[0.0001132221,0.00010012247,0.00008375759,0.0007459492,0.00021069752,0.0002458037,0.00021536852,0.00018604296,0.000046512836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012654389,0.00014350437,0.0016262352,0.000005067234,0.000009151797,0.000026742326,0.00013631005,0.000010562996,0.0004816919,0.9960491,0.0006288059,0.0008701781],"study_design_scores_gemma":[0.0004457258,0.00020230531,0.0082994085,0.000009106788,8.859126e-7,0.000013120273,0.0000029779721,0.00031265695,0.010872959,0.97956854,0.0001723891,0.00009994135],"about_ca_topic_score_codex":0.000007659892,"about_ca_topic_score_gemma":4.4919068e-7,"teacher_disagreement_score":0.016480573,"about_ca_system_score_codex":0.000023005314,"about_ca_system_score_gemma":0.000051222298,"threshold_uncertainty_score":0.40828758},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98416245,0.0012230461,0.0000955494,0.0023147878,0.0023471934,0.0005242539,0.000013387123,0.00016564348,0.009153664],"genre_scores_gemma":[0.996633,0.0011646556,0.00055256963,0.0001858146,0.000045070923,0.000028603126,0.000007379918,0.000035144487,0.0013477438],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99765605,0.00018358174,0.00056672026,0.00040235286,0.00051603327,0.0006752921],"domain_scores_gemma":[0.99847746,0.00020211733,0.00033589438,0.0007133278,0.00015575631,0.00011542197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010066425,0.00028293033,0.00037219556,0.00007652635,0.00039681277,0.00013876533,0.0007737821,0.00020937223,0.00025220637],"category_scores_gemma":[0.00009008387,0.00022625424,0.00012583232,0.00028859964,0.00027115567,0.00024694434,0.000088582885,0.00031243885,0.00037038737],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011347175,0.00021660764,0.0004083019,0.00002448379,0.000023247943,0.0000029021203,0.00026734878,0.0000022326692,0.5060807,0.47237292,0.019148402,0.0013394102],"study_design_scores_gemma":[0.0006714699,0.0008789754,0.0012291317,0.00010143737,0.000049876144,0.00000722644,0.000060421793,0.00039612327,0.8557821,0.10775792,0.03277048,0.00029482937],"about_ca_topic_score_codex":0.00017561187,"about_ca_topic_score_gemma":0.00006480416,"teacher_disagreement_score":0.364615,"about_ca_system_score_codex":0.00025102074,"about_ca_system_score_gemma":0.00015691854,"threshold_uncertainty_score":0.92263806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9722617,0.00033784786,0.01347825,0.00012680009,0.0018596684,0.00027631308,0.0000019812887,0.0001545428,0.011502871],"genre_scores_gemma":[0.9869724,0.000023724835,0.01265731,0.000055229903,0.0000014395433,0.000017390403,8.652193e-7,0.0000129096115,0.0002587521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841976,0.0002701618,0.00023560769,0.00033217127,0.0003843111,0.00035801594],"domain_scores_gemma":[0.99861777,0.00014901122,0.000091828,0.000863505,0.00015990036,0.00011797618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050399563,0.00013463359,0.00022297738,0.00017565434,0.00008819231,0.00003847013,0.0009290802,0.000054192464,0.000029780176],"category_scores_gemma":[0.00014146474,0.0001298081,0.00010310801,0.00091431825,0.00012352671,0.0003521759,0.00015561398,0.00013616025,0.000027811771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068921427,0.00007109504,0.0010638648,0.000009763734,0.000016734119,0.000012434286,0.00015403802,0.00001393692,0.0032840099,0.9944377,0.00020218124,0.0007273574],"study_design_scores_gemma":[0.0008183464,0.00008133376,0.00062468345,0.000008618775,0.0000027834958,0.000009832468,0.000018163506,0.00019826861,0.031452745,0.9649718,0.0016667669,0.00014668932],"about_ca_topic_score_codex":0.000007976327,"about_ca_topic_score_gemma":9.604202e-7,"teacher_disagreement_score":0.029465925,"about_ca_system_score_codex":0.000024926796,"about_ca_system_score_gemma":0.00006661639,"threshold_uncertainty_score":0.5293421},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9749389,0.0001216549,0.02333944,0.0004759794,0.00029555906,0.00020472947,0.0000017167714,0.00020231656,0.0004196619],"genre_scores_gemma":[0.9879239,0.00001734702,0.011881132,0.00009925066,0.0000033530196,0.000022446924,0.0000022421616,0.00001553757,0.000034742956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987173,0.000054888304,0.000121915116,0.00040485754,0.00037054453,0.00033047405],"domain_scores_gemma":[0.99909776,0.00012431678,0.000112904716,0.00038621615,0.00013705564,0.00014176138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018934208,0.00014830127,0.00014136732,0.0001631805,0.00029135123,0.00019356953,0.00050876144,0.00003993097,0.0000020622647],"category_scores_gemma":[0.000048339112,0.00012810162,0.000025994295,0.0008235384,0.00015798605,0.00077888556,0.00018709576,0.00022508155,0.000009520901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118707,0.000046102723,0.015552251,0.000008631222,0.000022561058,0.00006400505,0.0008707157,0.0002466145,0.0007854935,0.98146486,0.000017807371,0.0009090561],"study_design_scores_gemma":[0.0015057508,0.0001443986,0.015377163,0.00007079534,0.0000049094474,0.000037011014,0.0002659741,0.000263167,0.009844423,0.97223145,0.000038044764,0.00021690755],"about_ca_topic_score_codex":0.000039994036,"about_ca_topic_score_gemma":0.000011588927,"teacher_disagreement_score":0.012985005,"about_ca_system_score_codex":0.00005227831,"about_ca_system_score_gemma":0.000049709248,"threshold_uncertainty_score":0.5223832},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9282819,0.0011008778,0.0127956625,0.0026342392,0.0024784328,0.0013915116,0.000011263334,0.0018446186,0.049461465],"genre_scores_gemma":[0.9640617,0.000031356827,0.035308883,0.00025976653,0.000007018337,0.00004423759,0.0000026568405,0.0000262621,0.0002581382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775785,0.00015530756,0.00022796715,0.0005764703,0.0006259171,0.0006564843],"domain_scores_gemma":[0.9982332,0.00020323604,0.00008295958,0.0011217176,0.00013127626,0.00022760419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030872153,0.00023353493,0.00021812791,0.0002300771,0.00027181362,0.0001234504,0.00163318,0.00003793661,0.00012793517],"category_scores_gemma":[0.000016259108,0.0002045034,0.000073245144,0.0011414994,0.00012303746,0.0006985362,0.00040022362,0.00027664122,0.00024142166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001131962,0.00023769874,0.0041305586,0.000011586859,0.000055224802,0.00009698261,0.00046423523,0.0000050455787,0.00009989502,0.9875083,0.0021315115,0.0052476255],"study_design_scores_gemma":[0.0026116793,0.0005125622,0.0009723804,0.000018821605,0.000011083726,0.000055736284,0.000050755014,0.007145461,0.0011643108,0.98119044,0.0058642877,0.000402469],"about_ca_topic_score_codex":0.000015002796,"about_ca_topic_score_gemma":0.000012395864,"teacher_disagreement_score":0.04920333,"about_ca_system_score_codex":0.00006844851,"about_ca_system_score_gemma":0.000026156955,"threshold_uncertainty_score":0.8339407},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96113396,0.000050222166,0.015756348,0.00053888274,0.0013593443,0.00030702472,0.000004143719,0.0004580108,0.020392071],"genre_scores_gemma":[0.99670714,0.00001647319,0.0026978971,0.00009453478,0.000005197144,0.000027402113,0.000001583187,0.00001722979,0.00043255917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984122,0.00014068595,0.000152797,0.00045993942,0.00038134423,0.0004530288],"domain_scores_gemma":[0.9987098,0.0002105846,0.000072590556,0.00076632027,0.00010383196,0.00013687389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002094157,0.00016455224,0.00016014065,0.00013779112,0.00025058218,0.0001020454,0.0006619356,0.000059046506,0.00025389018],"category_scores_gemma":[0.00007431576,0.00013746845,0.000052136318,0.0010834722,0.00010302634,0.0006110581,0.00011577687,0.00028726176,0.00039828997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017737217,0.00014836143,0.0021863466,0.00000386594,0.000018626843,0.000025649713,0.00014338814,0.0000085637885,0.0000601539,0.99150497,0.00059808185,0.00528427],"study_design_scores_gemma":[0.0012701785,0.0002771811,0.00093480304,0.000034819266,0.0000030033432,0.000077561286,0.00002819721,0.0028518941,0.0011099984,0.99285483,0.0003312223,0.0002263204],"about_ca_topic_score_codex":0.0000035103435,"about_ca_topic_score_gemma":0.0000045080255,"teacher_disagreement_score":0.03557317,"about_ca_system_score_codex":0.000048245536,"about_ca_system_score_gemma":0.000013541321,"threshold_uncertainty_score":0.5605801},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16000153,0.00014103996,0.83254015,0.0011705008,0.00096226385,0.0006915844,0.0000092663095,0.0003205447,0.004163116],"genre_scores_gemma":[0.995939,0.000027557664,0.0033265073,0.0001605951,0.000007349104,0.00011293339,0.000014342939,0.000020952544,0.00039077166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985076,0.00009816385,0.00016560282,0.0004429694,0.00033622165,0.00044940226],"domain_scores_gemma":[0.9986315,0.00028346758,0.00008514819,0.0006698775,0.00019737045,0.0001326718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031553453,0.00016274919,0.00017846866,0.00010472918,0.00024334,0.00009846741,0.00075922953,0.000058483987,0.000009343654],"category_scores_gemma":[0.00007046757,0.00014587658,0.000052176812,0.0007375228,0.000098505094,0.00078482577,0.00010070132,0.00015376272,0.000027377411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006234817,0.000102996666,0.0034869886,0.000010638455,0.000015006666,0.000015400483,0.000076630415,0.000023296221,0.00025075817,0.99027324,0.00043658548,0.005246098],"study_design_scores_gemma":[0.0016594557,0.00044073313,0.0025258986,0.000028863102,0.000005022533,0.000023058139,0.000016278327,0.0044302186,0.0011257618,0.9823737,0.0071485145,0.00022247808],"about_ca_topic_score_codex":0.0000055106802,"about_ca_topic_score_gemma":0.000009354417,"teacher_disagreement_score":0.83593744,"about_ca_system_score_codex":0.000081597056,"about_ca_system_score_gemma":0.000054762964,"threshold_uncertainty_score":0.5948674},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9877511,0.00044351208,0.0054944814,0.00016948396,0.0010047853,0.00023183231,0.0000013104951,0.000101704165,0.004801778],"genre_scores_gemma":[0.99781,0.000060114984,0.0018211516,0.00010479424,0.0000010645562,0.000015848278,4.0312116e-7,0.000010109472,0.00017651275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838513,0.00020413804,0.00018306593,0.00045532416,0.0003646962,0.0004076371],"domain_scores_gemma":[0.99901605,0.0001840319,0.00004344862,0.0005711041,0.00005210789,0.00013326314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006469325,0.00014919358,0.00017423589,0.000259085,0.00009172281,0.00010087718,0.00065419497,0.00008375871,0.000014967743],"category_scores_gemma":[0.0001360191,0.00014708463,0.00003534851,0.0007326429,0.00010465745,0.0006150343,0.0001780396,0.0003209846,0.000027023107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079264455,0.00007264481,0.024494398,0.0000043732057,0.000005254134,0.00012743402,0.00025396296,0.000019843765,0.00017875609,0.97331214,0.00006138152,0.0014618587],"study_design_scores_gemma":[0.00074686867,0.000106051826,0.011614332,0.000017237251,7.677034e-7,0.00002559012,0.000019199826,0.0005051644,0.00093116873,0.9851291,0.00072046893,0.00018403222],"about_ca_topic_score_codex":0.000016909347,"about_ca_topic_score_gemma":0.000028629081,"teacher_disagreement_score":0.012880067,"about_ca_system_score_codex":0.000035191435,"about_ca_system_score_gemma":0.0000480815,"threshold_uncertainty_score":0.59979373},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9508152,0.00010985685,0.00015653404,0.00009631343,0.00060590636,0.0003541667,0.0000059267754,0.00017449677,0.047681615],"genre_scores_gemma":[0.9924075,0.00000592527,0.0023427275,0.000019369261,0.000009097914,0.00002890793,0.0000027847661,0.000039195394,0.0051444797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988311,0.00003083651,0.00040037825,0.00017092537,0.00033881605,0.00022794867],"domain_scores_gemma":[0.9986903,0.000608125,0.00018530284,0.00039582528,0.00008111674,0.000039310038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017906865,0.00014987723,0.000308941,0.000077157565,0.000046866902,0.000016417946,0.00019815475,0.000070792696,0.00007720908],"category_scores_gemma":[0.0003499666,0.0001352959,0.00008733836,0.00012657179,0.000095308234,0.0001552289,0.000060552786,0.00012015763,0.000090627145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051107354,0.00039444078,0.0000349228,0.00023444106,0.000013027845,0.0000035310318,0.00006245694,0.000015526335,0.0007192234,0.99091166,0.007586114,0.000019537409],"study_design_scores_gemma":[0.0005116432,0.00009910368,0.00006640779,0.00014299786,0.000019801955,0.000001827462,0.000022356156,0.000038552447,0.009419096,0.9893883,0.00015239246,0.00013750947],"about_ca_topic_score_codex":0.000014984177,"about_ca_topic_score_gemma":0.0000041283374,"teacher_disagreement_score":0.042537134,"about_ca_system_score_codex":0.000045655375,"about_ca_system_score_gemma":0.000016200298,"threshold_uncertainty_score":0.5517206},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95893186,0.00030214168,0.010483833,0.00042434974,0.011119305,0.0002421651,0.000002419209,0.00017399134,0.018319918],"genre_scores_gemma":[0.99879134,0.00005761535,0.00034859325,0.00016026803,0.00001834659,0.000006296758,0.0000012557006,0.000008236282,0.0006080601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988951,0.0001072402,0.00029365532,0.00025148777,0.00025216944,0.00020033098],"domain_scores_gemma":[0.9990387,0.000068086185,0.00013205722,0.0005168359,0.00017186184,0.00007247294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027498053,0.00010339284,0.00022526184,0.00010355158,0.00012407429,0.000024841906,0.0005162422,0.000080172984,0.000026866577],"category_scores_gemma":[0.000013531592,0.000107761836,0.000104769424,0.0004791526,0.000056774967,0.00023293054,0.000115450544,0.000112336245,0.000064184904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004605952,0.00013543856,0.0024446587,0.000012485499,0.000026442705,0.000006862284,0.0009325223,0.00001056985,0.00047285197,0.9731777,0.021293119,0.001482785],"study_design_scores_gemma":[0.0034944902,0.0013048564,0.02440069,0.0002512134,0.00002545043,0.00013861671,0.00012516056,0.023055961,0.0266327,0.879972,0.03960246,0.0009963921],"about_ca_topic_score_codex":0.0001382486,"about_ca_topic_score_gemma":0.0000035094101,"teacher_disagreement_score":0.093205646,"about_ca_system_score_codex":0.000026411311,"about_ca_system_score_gemma":0.000042451968,"threshold_uncertainty_score":0.43944},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903467,0.0015844443,0.000037158487,0.000022232558,0.0026712578,0.0001423692,0.0000056070467,0.00022330912,0.0049668723],"genre_scores_gemma":[0.99973416,0.00002141873,0.000020584457,0.00000900922,0.000041687526,0.000019729041,0.000003537247,0.000029234932,0.000120663375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913186,0.000054121763,0.00029754356,0.00012273074,0.00016060415,0.00023312499],"domain_scores_gemma":[0.9994998,0.000036795325,0.000044379216,0.0003144776,0.000028504755,0.000076021744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022526404,0.00013513089,0.00023712119,0.00004613363,0.000030276626,0.00002061287,0.00018725227,0.00008905641,0.000024850311],"category_scores_gemma":[0.000009205681,0.00013713502,0.000074958596,0.00012055245,0.000038308808,0.00012986976,0.000018976923,0.00009307194,0.00009608221],"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.000011701754,0.000072306386,0.00094097015,0.00017242337,0.0001411703,0.0000047975304,0.00052455993,0.020961642,0.008724024,0.9647145,0.0031986944,0.00053316966],"study_design_scores_gemma":[0.0061745313,0.00042094107,0.004528067,0.0006394704,0.00027247542,0.00009098247,0.0015079773,0.15060845,0.29409415,0.23939319,0.3000311,0.0022386934],"about_ca_topic_score_codex":0.000019095827,"about_ca_topic_score_gemma":0.0000013641758,"teacher_disagreement_score":0.72532135,"about_ca_system_score_codex":0.000027876793,"about_ca_system_score_gemma":0.000006443708,"threshold_uncertainty_score":0.5592204},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9879714,0.0015399933,0.0039505446,0.0007944917,0.004013818,0.0006141719,0.000003785088,0.000042549884,0.0010692008],"genre_scores_gemma":[0.9995724,0.000058018646,0.00006600881,0.00013309435,0.000013777679,0.000037423433,4.1182375e-7,0.000012384948,0.000106512074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973923,0.0010109306,0.00050109834,0.00036626324,0.0004299196,0.00029949908],"domain_scores_gemma":[0.99736303,0.00070376927,0.00040512034,0.001231077,0.00023702411,0.00005996356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019667586,0.00022097096,0.0004139267,0.00011026462,0.0004077873,0.0000843305,0.0009522494,0.00010826296,0.000005950053],"category_scores_gemma":[0.00017748619,0.00011172143,0.0003888755,0.0014102829,0.00073311053,0.00019153237,0.00021210073,0.0002924397,0.0000010594073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022634476,0.00008512485,0.0010880989,0.000021382528,0.00010263815,0.0000010044304,0.0012683371,0.00010643415,0.00022963752,0.9963041,0.0006181506,0.00015243582],"study_design_scores_gemma":[0.00195806,0.0001901899,0.004847994,0.000094958734,0.000042888845,0.00007734248,0.00036301636,0.001969036,0.004016176,0.9859525,0.0002990653,0.00018876958],"about_ca_topic_score_codex":0.00022495266,"about_ca_topic_score_gemma":0.000049964223,"teacher_disagreement_score":0.011600924,"about_ca_system_score_codex":0.00001206315,"about_ca_system_score_gemma":0.000043166805,"threshold_uncertainty_score":0.45558676},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6403623,0.0009496704,0.28678033,0.0010560642,0.005887028,0.0007500645,0.0000070817996,0.001352509,0.0628549],"genre_scores_gemma":[0.9904658,0.000012463941,0.008807466,0.00026534402,0.000010616034,0.000008255405,0.0000024503088,0.000017694301,0.000409913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980067,0.00008502362,0.00026033248,0.00045529613,0.000494647,0.0006980205],"domain_scores_gemma":[0.99811053,0.0004001863,0.000072720795,0.0010056697,0.00015637721,0.00025450817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012313676,0.00017116033,0.00018893574,0.00027372962,0.0002196117,0.000093002775,0.0016172034,0.00007478108,0.000027470694],"category_scores_gemma":[0.00009496906,0.00017119202,0.000099395555,0.00124694,0.00014805276,0.00047769237,0.00044990666,0.00030915998,0.00027838018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010461697,0.0000621593,0.0018820665,0.000005567386,0.000012580171,0.00005446913,0.00017826962,0.0000021928702,0.0022122297,0.9869075,0.0015373465,0.0071351593],"study_design_scores_gemma":[0.0005702418,0.00010521341,0.006444767,0.00001095247,0.0000019670006,0.000020445523,0.000024247838,0.00045597597,0.004908754,0.9697925,0.017433234,0.00023172672],"about_ca_topic_score_codex":0.000011839811,"about_ca_topic_score_gemma":0.000007423884,"teacher_disagreement_score":0.35010347,"about_ca_system_score_codex":0.000060202347,"about_ca_system_score_gemma":0.00004182466,"threshold_uncertainty_score":0.6981008},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6783622,0.000029407161,0.0000014482001,0.00026578092,0.0032495568,0.000081390775,0.0000010242397,0.000101350255,0.3179078],"genre_scores_gemma":[0.9734462,0.00017572829,0.000014374841,0.00028624045,0.0000626444,0.00002335127,0.000009763781,0.000007007377,0.025974685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999254,0.0000637309,0.0001430793,0.00013763327,0.00015752179,0.00024405753],"domain_scores_gemma":[0.99973285,0.00004299031,0.000036723486,0.00008149345,0.000029588911,0.000076379874],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003491615,0.00006323768,0.00008572329,0.000029027904,0.00069934386,0.00010060607,0.00011943705,0.0000863343,0.010089172],"category_scores_gemma":[0.000030079122,0.000075171156,0.000041366395,0.00014902338,0.00009767783,0.00031984618,0.000009916595,0.00006945889,0.0024208496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014532626,0.00005874506,0.010953363,0.0000026934745,0.000024083514,0.000003018053,0.00848655,0.0000028346176,0.0000033894523,0.92698425,0.032792192,0.020674372],"study_design_scores_gemma":[0.00022230195,0.000016636177,0.01599841,0.000004149373,0.000008246733,3.104439e-7,0.0008032736,0.0000023801467,0.000009477545,0.7452786,0.23754653,0.00010970379],"about_ca_topic_score_codex":0.00096470094,"about_ca_topic_score_gemma":0.0001929137,"teacher_disagreement_score":0.29508397,"about_ca_system_score_codex":0.00015016663,"about_ca_system_score_gemma":0.00009952988,"threshold_uncertainty_score":0.99835587},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98020786,0.00022913603,0.008204869,0.0008224826,0.00091060146,0.00030291826,0.0000033743902,0.0002497528,0.009068977],"genre_scores_gemma":[0.99153584,0.000018407582,0.008286386,0.00005344961,0.0000015851039,0.000020368685,6.7679446e-7,0.000012553401,0.000070752445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852705,0.000054597585,0.00023298997,0.00033563812,0.00048101236,0.0003686913],"domain_scores_gemma":[0.99822533,0.00012944391,0.00009545629,0.0012534448,0.00016904068,0.00012726744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037585138,0.00013122197,0.0002005185,0.00021036787,0.000098727316,0.00003815368,0.0020806787,0.00006108538,0.000007895146],"category_scores_gemma":[0.00016905584,0.00013160045,0.00009608333,0.0010993977,0.00017716028,0.00048270085,0.0006300999,0.00019047257,0.000037317604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011539321,0.000115199735,0.00091493793,0.000014691888,0.000013039594,0.000016422893,0.000192389,0.000056764835,0.0014075136,0.9965722,0.00009373848,0.0005915843],"study_design_scores_gemma":[0.0013261493,0.00026248634,0.0021835628,0.000024056584,0.0000022780148,0.000006464765,0.00001879455,0.000030723524,0.026069555,0.96950656,0.00043636144,0.00013301184],"about_ca_topic_score_codex":0.000033873097,"about_ca_topic_score_gemma":0.000003571027,"teacher_disagreement_score":0.027065622,"about_ca_system_score_codex":0.000062076804,"about_ca_system_score_gemma":0.00009451115,"threshold_uncertainty_score":0.5366511},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98818326,0.000060993993,0.0018069828,0.000053431617,0.00034463673,0.00020838447,0.000008301815,0.000055776207,0.009278243],"genre_scores_gemma":[0.9647504,0.0000043546765,0.034918685,0.000014724493,0.000007411998,0.0000051061,0.0000025011145,0.000033517605,0.00026330596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988715,0.00001817257,0.00038897997,0.0001689227,0.00030668787,0.00024570484],"domain_scores_gemma":[0.9985315,0.0004386536,0.0002816244,0.00053452275,0.00015070378,0.000062964864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033276965,0.00014020527,0.00032151508,0.00009534451,0.000036856236,0.00000398053,0.00023772943,0.00008043104,0.000022417273],"category_scores_gemma":[0.00026851997,0.00012579896,0.0000583779,0.00027906432,0.00015279514,0.000077449055,0.000090025766,0.00017570256,0.000003771244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033563887,0.00018058423,0.0043363776,0.00013439906,0.00005131078,0.000015683558,0.000749902,0.0000021266417,0.00087841507,0.9930747,0.00023429663,0.0003086024],"study_design_scores_gemma":[0.0008883697,0.00011777737,0.0014823537,0.00012729809,0.000034930297,0.000010108673,0.00032436269,0.0000070515357,0.04827375,0.94827443,0.00032822258,0.00013131856],"about_ca_topic_score_codex":0.000010220818,"about_ca_topic_score_gemma":0.000010491189,"teacher_disagreement_score":0.047395334,"about_ca_system_score_codex":0.00004554495,"about_ca_system_score_gemma":0.000037794114,"threshold_uncertainty_score":0.5129933},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.954832,0.00010822173,0.000076240976,0.00015268639,0.00027950373,0.00015125315,0.0000036673532,0.00004858112,0.044347823],"genre_scores_gemma":[0.99805176,0.000010959323,0.0011925299,0.00032408943,0.0000144905125,0.0000099797335,0.00005491323,0.000011256274,0.0003300188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99921554,0.00008241523,0.00013497638,0.00026393897,0.00008588549,0.00021722981],"domain_scores_gemma":[0.9995388,0.000020224286,0.000054681597,0.00021365943,0.00009500844,0.00007762174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014318974,0.00013065588,0.000117225936,0.000016429496,0.00011393821,0.000028081817,0.00009843824,0.00011004769,0.000034169538],"category_scores_gemma":[0.0000856042,0.00009655853,0.00004258581,0.0000913401,0.000055790704,0.0000024306403,0.000030951374,0.00008243696,0.000024552552],"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.000077399534,0.00035677277,0.012674519,0.000015918577,0.00017506882,0.000023929262,0.000059778125,0.000007651939,0.1878868,0.79497963,0.0033416965,0.00040081536],"study_design_scores_gemma":[0.0061323517,0.0040045306,0.014255306,0.000032954344,0.000108275635,0.00020911763,0.00030672358,0.000089195884,0.50663763,0.058766026,0.4081575,0.0013004126],"about_ca_topic_score_codex":0.0000030489837,"about_ca_topic_score_gemma":0.000002690629,"teacher_disagreement_score":0.7362136,"about_ca_system_score_codex":0.000007673732,"about_ca_system_score_gemma":0.000064732645,"threshold_uncertainty_score":0.39375424},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81870294,0.0012551885,0.0028528029,0.0010977548,0.0061340537,0.0004433288,0.00000508786,0.00040864974,0.16910017],"genre_scores_gemma":[0.99579966,0.000030861247,0.0039761537,0.000118844095,0.000006625364,0.000005295227,8.2199494e-7,0.0000085592455,0.00005317619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998719,0.000043997923,0.00025095502,0.00029720535,0.0004026955,0.00028619322],"domain_scores_gemma":[0.99911326,0.00006613115,0.00013955863,0.0005218899,0.000083564264,0.00007557033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023395722,0.00012852857,0.0001953743,0.00008107104,0.00009110941,0.00007877589,0.0007922861,0.00007233696,0.000051680552],"category_scores_gemma":[0.000032764503,0.00011909152,0.00006353142,0.0003698341,0.000037134014,0.0003017693,0.00023516479,0.00014974229,0.00012622043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.560487e-7,0.00015582581,0.0007676402,0.000012867141,0.000017153941,0.000043872016,0.00068872276,0.000013598311,0.00013664173,0.97976786,0.0015654216,0.016829664],"study_design_scores_gemma":[0.0010927495,0.00022495794,0.007709934,0.000036661448,0.000009462821,0.000043426822,0.000047000627,0.07209245,0.0014636093,0.9150225,0.0019130375,0.00034419252],"about_ca_topic_score_codex":0.000029611141,"about_ca_topic_score_gemma":0.0000017171909,"teacher_disagreement_score":0.1770967,"about_ca_system_score_codex":0.00004068956,"about_ca_system_score_gemma":0.00002058558,"threshold_uncertainty_score":0.48564112},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9922217,0.000041674975,0.0005448229,0.00018714095,0.00054028543,0.0003038471,0.0000225691,0.000017368893,0.0061205802],"genre_scores_gemma":[0.9970865,0.0000069651333,0.00046218096,0.00006290292,0.000008244948,0.00005057256,0.000004030612,0.000008332939,0.0023102327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984999,0.00007825111,0.00043853765,0.000263999,0.00053790805,0.00018142175],"domain_scores_gemma":[0.99797916,0.0009142394,0.00024988904,0.0004449,0.00032798524,0.00008379571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085523527,0.00009280853,0.00022393132,0.00009470387,0.00023534599,0.000027365679,0.0005297009,0.000049876693,0.00015749256],"category_scores_gemma":[0.00076175906,0.0000767786,0.00011970548,0.00032791717,0.0001896304,0.00017146667,0.00007609171,0.00006513935,0.00012283037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078906814,0.00035299337,0.008805687,0.0000029187513,0.000025182797,0.0000026899322,0.0009533141,0.000005620403,0.006446686,0.9725236,0.008243853,0.0025585215],"study_design_scores_gemma":[0.0008614958,0.00011317194,0.029078357,0.000007387421,0.000009378095,0.00000776241,0.00026452274,0.00005474393,0.012833843,0.94831717,0.008356939,0.00009521471],"about_ca_topic_score_codex":0.000005257143,"about_ca_topic_score_gemma":8.285049e-7,"teacher_disagreement_score":0.024206445,"about_ca_system_score_codex":0.000024992452,"about_ca_system_score_gemma":0.00006111616,"threshold_uncertainty_score":0.31309402},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9865501,0.000013482277,0.000014101416,0.00026218762,0.00011068757,0.0002199243,0.0000036876697,0.0000459365,0.012779874],"genre_scores_gemma":[0.9994052,0.000009860773,0.0002115674,0.00006517388,0.0000019056824,0.000029032908,0.0000012518065,0.000015210218,0.00026080583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993641,0.000053275427,0.0001439072,0.0001251135,0.000172196,0.00014141532],"domain_scores_gemma":[0.9988,0.00056934904,0.000089334986,0.00046194275,0.000041239582,0.00003817426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014912803,0.00010369733,0.00014574225,0.000041177693,0.00017791375,0.000005031337,0.00023012586,0.00003504449,0.00007658802],"category_scores_gemma":[0.000060547656,0.0000639175,0.00006916899,0.00028732672,0.00019963148,0.00003171044,0.000015435575,0.00013518672,0.00002539297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026165268,0.00023052297,0.0005094932,0.0000067816577,0.000035023197,0.0000040330615,0.00035342498,6.9654953e-7,0.0002090514,0.9929166,0.0056923795,0.000015864647],"study_design_scores_gemma":[0.00040228275,0.00014089732,0.0012774897,0.00001943167,0.000020954003,0.000019113962,0.0000614645,0.000009163395,0.0077844965,0.9900236,0.00015737362,0.000083720304],"about_ca_topic_score_codex":0.0000062844847,"about_ca_topic_score_gemma":0.0000025804459,"teacher_disagreement_score":0.0128550725,"about_ca_system_score_codex":0.000009338758,"about_ca_system_score_gemma":0.000021367794,"threshold_uncertainty_score":0.260648},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96294135,0.00012393325,0.0017666509,0.000054821805,0.0012277234,0.00022277562,0.0000043956566,0.000087454806,0.03357092],"genre_scores_gemma":[0.9929677,0.000015284215,0.005980787,0.0001232179,0.0000047039744,0.000009459633,0.0000056249696,0.00002822551,0.0008649896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901354,0.00023791566,0.00026483528,0.00016149794,0.0001297635,0.00019242437],"domain_scores_gemma":[0.99856734,0.0006881839,0.00013931793,0.00044954277,0.00010245395,0.00005314494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034733026,0.00013907468,0.00024900388,0.00006664365,0.00010578324,0.000005837524,0.0001586875,0.00009080617,0.00036616126],"category_scores_gemma":[0.0012268941,0.00012563117,0.00005820287,0.00022226718,0.00014483585,0.000055543496,0.000021501817,0.00012757974,0.000055629254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016247703,0.00019589781,0.00015653904,0.000023476106,0.00004063212,0.000003601158,0.00034602516,0.00006452666,0.00045530676,0.9974046,0.0012328795,0.000060276525],"study_design_scores_gemma":[0.00080964575,0.00011544542,0.000021896238,0.00002326173,0.000028425484,0.0000054096354,0.00007101529,0.000080216596,0.0074780565,0.9908826,0.00035779996,0.00012623458],"about_ca_topic_score_codex":0.000002061767,"about_ca_topic_score_gemma":0.0000016584625,"teacher_disagreement_score":0.03270593,"about_ca_system_score_codex":0.000027850074,"about_ca_system_score_gemma":0.000044367804,"threshold_uncertainty_score":0.512309},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939597,0.00013320167,0.00010181595,0.00055802445,0.001427374,0.000081106744,0.000001700757,0.00014533427,0.0035917],"genre_scores_gemma":[0.9983269,0.000010998404,0.0011260851,0.00020319234,9.972446e-7,0.0000073429596,0.000001417476,0.000007434834,0.00031561273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990182,0.000039342976,0.00019794558,0.00026967225,0.0002826012,0.00019221616],"domain_scores_gemma":[0.99909824,0.000084407235,0.000097469885,0.00054539816,0.000091261456,0.00008319758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014210129,0.00011554972,0.00018300276,0.000120756355,0.00012731427,0.000017405617,0.00047532356,0.00006359786,0.000010054405],"category_scores_gemma":[0.000043822576,0.0000989656,0.0000694593,0.0005136351,0.00009448517,0.000102075275,0.00011322179,0.00013383546,0.000026074287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069581265,0.00014456133,0.002014286,0.000006780231,0.000010577837,0.00002185873,0.00028530371,0.00004522643,0.0006737973,0.991689,0.0044943863,0.0006072262],"study_design_scores_gemma":[0.0014735528,0.00078295823,0.006921611,0.000061320854,0.000006775239,0.000039751078,0.0000068881723,0.0018826558,0.023368346,0.96293056,0.0022467275,0.00027885856],"about_ca_topic_score_codex":0.00004972107,"about_ca_topic_score_gemma":0.0000016225125,"teacher_disagreement_score":0.028758483,"about_ca_system_score_codex":0.000015387152,"about_ca_system_score_gemma":0.000044018703,"threshold_uncertainty_score":0.40356997},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99428827,0.00016228258,0.0024002416,0.000355411,0.0007845838,0.00026503231,8.797583e-7,0.00019032952,0.0015529958],"genre_scores_gemma":[0.99462336,0.00007155442,0.0049035517,0.00010185097,0.0000031542363,0.000047529928,0.0000042509237,0.000013565062,0.00023116682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982416,0.00026358396,0.00026188625,0.00041808526,0.0004033186,0.00041154367],"domain_scores_gemma":[0.9988274,0.00021888241,0.00007284207,0.00061573106,0.00015464933,0.000110496505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043579334,0.00014822891,0.0002114078,0.00041412716,0.00016581811,0.000039941457,0.0009135448,0.00007923732,0.000019136301],"category_scores_gemma":[0.00018382934,0.00015264073,0.000064878346,0.0016341524,0.00012879402,0.00061467214,0.00020750695,0.00023091346,0.00006669474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020658279,0.000100647674,0.0038905544,0.0000035061307,0.00000678175,0.00008874033,0.00038729244,0.000025814328,0.0030741603,0.9909376,0.00038774553,0.0010765005],"study_design_scores_gemma":[0.001890989,0.00008330543,0.02023266,0.0000103430675,0.0000010677459,0.000031385025,0.000011086795,0.0040000402,0.0066662077,0.9664376,0.0004324854,0.00020287246],"about_ca_topic_score_codex":0.00003701277,"about_ca_topic_score_gemma":0.000010746942,"teacher_disagreement_score":0.024500042,"about_ca_system_score_codex":0.00008267025,"about_ca_system_score_gemma":0.000078282595,"threshold_uncertainty_score":0.6224508},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97819734,0.00034630572,0.0038147531,0.0010379839,0.0073692054,0.0004993592,0.000004260503,0.00064699305,0.008083778],"genre_scores_gemma":[0.99307716,0.000046760855,0.0049670683,0.00046138567,0.000002083786,0.000059178295,0.000005717602,0.000018336506,0.001362337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986064,0.00003947827,0.00028062233,0.00043096073,0.00023600362,0.0004065281],"domain_scores_gemma":[0.99874055,0.00012457174,0.00009843147,0.0005899494,0.00029086112,0.00015560898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004102026,0.00017248378,0.00020493871,0.00013268393,0.00021774067,0.00015064364,0.00077695306,0.000076641554,0.0000130174],"category_scores_gemma":[0.00007769289,0.00016247737,0.00012600473,0.00056567707,0.000062715444,0.00029456316,0.00020524322,0.00013287741,0.0001265376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022569717,0.00012319727,0.0013075755,0.000011500791,0.000018327712,0.000011359439,0.00010512583,0.000008832149,0.000658318,0.9908042,0.006083029,0.0008459403],"study_design_scores_gemma":[0.0012215463,0.00036050132,0.00033510156,0.000035321314,0.000008672935,0.000008800513,0.0000142876925,0.0042412984,0.0012224464,0.93693465,0.05538894,0.00022845945],"about_ca_topic_score_codex":0.00004159446,"about_ca_topic_score_gemma":0.0000037132963,"teacher_disagreement_score":0.053869598,"about_ca_system_score_codex":0.000023890761,"about_ca_system_score_gemma":0.000045125973,"threshold_uncertainty_score":0.6625635},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.887945,0.00010509105,0.091061346,0.0005310077,0.00584199,0.0003947223,0.000002933944,0.00046747204,0.013650417],"genre_scores_gemma":[0.98960125,0.000005198499,0.0092481645,0.00082125375,0.000022351673,0.000022427395,0.0000031426991,0.000015899734,0.0002603306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986713,0.000053162334,0.00021714365,0.00038893323,0.00023657686,0.00043286858],"domain_scores_gemma":[0.99866086,0.00040445253,0.000080463375,0.00063002243,0.00008290427,0.00014128869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009468901,0.00016657506,0.000172915,0.00015520051,0.00023607582,0.0001099881,0.000835281,0.00008667269,0.000020208981],"category_scores_gemma":[0.00008441703,0.00016391472,0.0001704872,0.0005150537,0.00004882918,0.00021328098,0.00010992121,0.0001301636,0.000063514664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006495663,0.000102798374,0.0002399663,0.000005576497,0.000021858266,0.0000074903705,0.00017307715,0.0000058973033,0.00041145924,0.98726344,0.0054094484,0.0062940195],"study_design_scores_gemma":[0.0013785794,0.00025428593,0.00052685384,0.000016277138,0.000007189341,0.0000039082256,0.000011603026,0.00044991446,0.0048658145,0.9721782,0.020078022,0.00022934188],"about_ca_topic_score_codex":0.000009621709,"about_ca_topic_score_gemma":0.0000038352773,"teacher_disagreement_score":0.101656206,"about_ca_system_score_codex":0.000037842965,"about_ca_system_score_gemma":0.000030301573,"threshold_uncertainty_score":0.66842484},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9913295,0.0000145754375,0.00021196494,0.000019524075,0.000026819953,0.000101433085,0.000023174896,0.000010650097,0.008262363],"genre_scores_gemma":[0.99956906,0.000007435858,0.00026133662,0.0000061402707,0.0000015549742,0.00001528476,0.000009752669,0.000008600026,0.00012085932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995502,0.000011853771,0.00014655621,0.000098795696,0.00009403052,0.000098543365],"domain_scores_gemma":[0.9994357,0.00020397296,0.00011745162,0.00014793563,0.00005886134,0.000036071546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003898599,0.00007997509,0.00018809213,0.000021092472,0.00006316727,0.0000022239847,0.00005235855,0.00001835837,0.00003173651],"category_scores_gemma":[0.000013497753,0.000063829095,0.00003492662,0.00016666707,0.0001697744,0.000039859628,0.00002009739,0.000054698095,0.000002012718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011461178,0.00014779912,0.01379169,0.000007041057,0.00004218305,2.23569e-7,0.00019443421,0.0000076105152,0.00019002013,0.98536676,0.00009706811,0.00014371947],"study_design_scores_gemma":[0.000529218,0.00010723693,0.0043811076,0.00004116716,0.000016311305,2.7335275e-7,0.00019164552,0.000021724942,0.0065494482,0.9879822,0.000101244026,0.00007838532],"about_ca_topic_score_codex":0.000025733554,"about_ca_topic_score_gemma":7.459551e-7,"teacher_disagreement_score":0.0094105825,"about_ca_system_score_codex":0.0000041308094,"about_ca_system_score_gemma":0.000012243504,"threshold_uncertainty_score":0.26028752},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99803865,0.00024569713,0.00039448545,0.000497464,0.00027215117,0.00023271637,9.83158e-7,0.000045743694,0.00027213292],"genre_scores_gemma":[0.9957924,0.000031188516,0.0040961336,0.00003686315,0.0000010208261,0.000013043678,4.8787484e-7,0.000008812761,0.000020088388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987326,0.000066113695,0.00020880891,0.00037435806,0.00034039462,0.00027770197],"domain_scores_gemma":[0.9992209,0.00006395838,0.00006847692,0.00048847834,0.00007809067,0.00008008621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051342166,0.00011149716,0.00018166796,0.0002565735,0.00004842815,0.00003383077,0.0005913961,0.00003917794,0.0000018117655],"category_scores_gemma":[0.00008739554,0.000105934625,0.000030415724,0.00068026263,0.000113107046,0.000413217,0.00032516278,0.00022111094,0.000006272692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011353108,0.000115739946,0.015393544,0.000022526676,0.0000066658927,0.000027633763,0.00076692924,0.00004319956,0.0018112538,0.9794961,0.000010149093,0.0022948713],"study_design_scores_gemma":[0.0009541673,0.00009057896,0.048563164,0.000033164688,0.0000010812466,0.000017657148,0.000028023667,0.000054021573,0.008303205,0.94182533,0.000022889713,0.00010672208],"about_ca_topic_score_codex":0.00006774909,"about_ca_topic_score_gemma":0.000010717283,"teacher_disagreement_score":0.03767081,"about_ca_system_score_codex":0.000041611354,"about_ca_system_score_gemma":0.0000599502,"threshold_uncertainty_score":0.43198887},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9730511,0.0018535325,0.00022950026,0.00035610588,0.019637886,0.00049902487,0.000023307965,0.00011336754,0.004236211],"genre_scores_gemma":[0.9985421,0.000095870266,0.00088158913,0.000070180395,0.00014445787,0.000007312298,0.0000070175297,0.00003928839,0.0002122279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964061,0.00028154821,0.0011402245,0.0006376547,0.00094489154,0.000589608],"domain_scores_gemma":[0.9967718,0.00027566464,0.000823068,0.0013374412,0.0005883816,0.00020364803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011497213,0.00039551876,0.00086201687,0.00029106505,0.00012667448,0.00013068027,0.0021522255,0.00031872012,0.0001807508],"category_scores_gemma":[0.000250293,0.00042103723,0.00029418975,0.0013762611,0.0003691247,0.0013454638,0.00087459345,0.0003644881,0.00019122678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012838723,0.001085134,0.0012814363,0.00018008696,0.00012470207,0.000011508054,0.0011866649,0.000018187506,0.0042768684,0.98276937,0.0022155829,0.006722095],"study_design_scores_gemma":[0.005305856,0.0014914874,0.0038082625,0.00038103305,0.00014091215,0.000020259553,0.000093782364,0.009754417,0.042192,0.931004,0.0051047895,0.0007032081],"about_ca_topic_score_codex":0.00011603419,"about_ca_topic_score_gemma":0.0000057125367,"teacher_disagreement_score":0.051765356,"about_ca_system_score_codex":0.00013758084,"about_ca_system_score_gemma":0.00049820845,"threshold_uncertainty_score":0.99982417},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74937594,0.00085520954,0.21511988,0.0028325205,0.0036932756,0.0006479104,0.0000046699133,0.00116321,0.026307398],"genre_scores_gemma":[0.9894344,0.0000794201,0.009840023,0.00016854436,0.000010066198,0.000013753902,0.0000020830919,0.000020419351,0.00043125686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980775,0.00014011729,0.00020873884,0.0004879388,0.0004768246,0.00060885446],"domain_scores_gemma":[0.9983515,0.0002403837,0.00007195199,0.0009834041,0.0001434319,0.0002093177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004699266,0.00018042623,0.00020903964,0.00024812025,0.00027220423,0.00014919369,0.0014378938,0.0000616596,0.00003560937],"category_scores_gemma":[0.000086260996,0.00018007871,0.00010444545,0.0014024423,0.000121111436,0.0005706911,0.0004125211,0.00028916073,0.00028885575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010410273,0.000057911253,0.0015609207,0.0000042851116,0.000014673699,0.000082951105,0.00018052467,0.00004385286,0.001377809,0.99375445,0.00046967308,0.002442529],"study_design_scores_gemma":[0.00059899274,0.00010009354,0.0009780779,0.000015941649,0.0000023316802,0.000041965235,0.000026323238,0.0041265585,0.00081390963,0.9810765,0.011991962,0.00022737589],"about_ca_topic_score_codex":0.000017166798,"about_ca_topic_score_gemma":0.0000033646565,"teacher_disagreement_score":0.24005851,"about_ca_system_score_codex":0.00005019931,"about_ca_system_score_gemma":0.000041771327,"threshold_uncertainty_score":0.73433965},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99311316,0.0008820644,0.0015925177,0.00017271629,0.0016114543,0.00015126671,6.170941e-7,0.00022626917,0.002249926],"genre_scores_gemma":[0.9932252,0.000027457536,0.006467835,0.00021525312,7.80848e-7,0.000011086032,0.0000013615136,0.000014596388,0.00003640247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851596,0.00012107378,0.00027306913,0.00044299284,0.00029778256,0.000349094],"domain_scores_gemma":[0.998965,0.00008432134,0.00008447165,0.0006126324,0.00008141357,0.0001721433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054617267,0.00017529167,0.00021699369,0.00005848688,0.00022010262,0.00018030038,0.00030489618,0.00005357902,0.000016037831],"category_scores_gemma":[0.0000909942,0.00016232654,0.00005290392,0.00039938625,0.00006190706,0.00022576324,0.00010342607,0.00014000443,0.000096656564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.113746e-7,0.00006394142,0.0034424074,0.000024178458,0.00002021745,0.000032873944,0.0002561871,0.0000140607335,0.0038489066,0.9918356,0.00017087597,0.00029025567],"study_design_scores_gemma":[0.0009975781,0.00002819257,0.00030582232,0.000053703363,0.000013611219,0.00010662639,0.000021181871,0.0036578726,0.0026024824,0.99142236,0.00053989625,0.00025066768],"about_ca_topic_score_codex":0.00003370009,"about_ca_topic_score_gemma":9.0998884e-7,"teacher_disagreement_score":0.004875317,"about_ca_system_score_codex":0.00002910038,"about_ca_system_score_gemma":0.00005369912,"threshold_uncertainty_score":0.66194844},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98474777,0.00017519719,0.0001621492,0.0077926787,0.00088526093,0.00021672582,0.0000017069241,0.000075490825,0.0059430106],"genre_scores_gemma":[0.9985079,0.000042811895,0.00037340427,0.0008527788,0.0000022269078,0.000013941911,7.3586386e-7,0.0000071060003,0.00019909421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988304,0.00020601077,0.00023114716,0.00022967097,0.00032401265,0.00017875685],"domain_scores_gemma":[0.998516,0.0006318146,0.000115410585,0.0005779144,0.00011112355,0.000047734007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006307814,0.0001224227,0.00017415608,0.000029915267,0.00022839641,0.000074140175,0.00047021577,0.00006485439,0.00007838422],"category_scores_gemma":[0.00009869468,0.000066399196,0.000065011656,0.0003854124,0.0002963313,0.00008909255,0.00015777508,0.00023439837,0.00012872789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009375359,0.00008940456,0.00065810164,0.0000040985838,0.000017329268,0.0000012092007,0.00044952135,0.000008642638,0.000048912494,0.98528975,0.013078691,0.00034497154],"study_design_scores_gemma":[0.0013850807,0.000047917838,0.0005867802,0.000027709464,0.000010475231,0.000016210823,0.000015563159,0.006270505,0.00038923253,0.99083465,0.00032395768,0.00009193665],"about_ca_topic_score_codex":0.00006076981,"about_ca_topic_score_gemma":0.0000017945099,"teacher_disagreement_score":0.01376012,"about_ca_system_score_codex":0.00000562618,"about_ca_system_score_gemma":0.00000697322,"threshold_uncertainty_score":0.27076805},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97615856,0.0005695847,0.016798716,0.001607953,0.000750153,0.00016340261,8.332866e-7,0.00028992008,0.0036608889],"genre_scores_gemma":[0.9722116,0.00001549233,0.027189089,0.00046241473,0.000016730482,0.00001083138,0.0000017366127,0.000006609855,0.00008548316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917585,0.000036060854,0.00017157148,0.00026188308,0.00014436616,0.00021024836],"domain_scores_gemma":[0.9994403,0.000075945376,0.000043993517,0.00030519415,0.000039941464,0.00009459171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016221043,0.00010950479,0.00012363469,0.00007402908,0.00026360713,0.00020818805,0.00039823054,0.000040102634,0.000011318996],"category_scores_gemma":[0.000107602486,0.000102027385,0.00002644231,0.0002840154,0.000046176985,0.0008396844,0.00017642851,0.000124352,0.000048494592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.6191187e-7,0.00003788109,0.00057724764,0.0000063748785,0.0000062851846,0.000006408181,0.000777288,0.00014676979,0.00017531868,0.99016696,0.00026676114,0.007832313],"study_design_scores_gemma":[0.00068672636,0.00008237059,0.0060460046,0.000034784833,0.000008034052,0.000041515148,0.000051913776,0.026248077,0.0006184017,0.9641167,0.0017747313,0.00029075702],"about_ca_topic_score_codex":0.000010307895,"about_ca_topic_score_gemma":0.000015684747,"teacher_disagreement_score":0.026101308,"about_ca_system_score_codex":0.000026779991,"about_ca_system_score_gemma":0.000026074145,"threshold_uncertainty_score":0.41605562},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85489726,0.00046436852,0.0792857,0.00004847863,0.0012271206,0.00016048287,0.0000022118138,0.0025121886,0.061402205],"genre_scores_gemma":[0.99797124,0.000033863733,0.0014706975,0.0000469141,0.000014187267,0.000009133862,0.000006170651,0.0000341153,0.00041370583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922687,0.000007959618,0.00020242721,0.00014626313,0.00014289915,0.00027359207],"domain_scores_gemma":[0.9995129,0.00005820272,0.000021293074,0.00027078707,0.000038807215,0.00009797877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001305512,0.0001332508,0.0001683785,0.00010818819,0.000050134055,0.000012758458,0.00013826185,0.00007512117,0.00004369195],"category_scores_gemma":[0.000025097997,0.00013597946,0.000072408984,0.00043773005,0.000029839137,0.00011098646,0.000025654143,0.00017701666,0.00019417264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068779125,0.0005174549,0.005696741,0.00011059306,0.00042162897,0.000105801926,0.00037966453,0.017401801,0.08090028,0.7156095,0.037494566,0.14129318],"study_design_scores_gemma":[0.0012215984,0.00016887444,0.008982834,0.000031833213,0.0001174934,0.00002058064,0.00012839973,0.024432424,0.109971315,0.7448707,0.108801395,0.0012525338],"about_ca_topic_score_codex":0.000010681581,"about_ca_topic_score_gemma":0.0000032287999,"teacher_disagreement_score":0.14307398,"about_ca_system_score_codex":0.00009408226,"about_ca_system_score_gemma":0.000004137942,"threshold_uncertainty_score":0.5545081},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.983575,0.000097979966,0.002403478,0.00045492404,0.000840276,0.00020241718,9.501828e-7,0.00017665888,0.012248307],"genre_scores_gemma":[0.9982354,0.00000272269,0.0014251596,0.000086371256,0.0000024796623,0.00001891149,0.0000016080933,0.000009069122,0.00021827311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985652,0.00013316053,0.00017288704,0.00037867774,0.00036401048,0.0003860678],"domain_scores_gemma":[0.99894863,0.00020356667,0.000037986636,0.0006994922,0.00004863058,0.00006170961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043680708,0.00012089227,0.00013932327,0.0002765937,0.0000826242,0.000067154324,0.00090506003,0.00006140333,0.00000908652],"category_scores_gemma":[0.000054615553,0.00012114456,0.00005407642,0.0010475924,0.00007804991,0.00031076052,0.00018927448,0.0002628896,0.00008676395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008570953,0.00017340576,0.0042442447,0.0000029243356,0.0000018351134,0.00004069338,0.000023966042,0.000063149615,0.00019061114,0.99339414,0.00063445995,0.0012219963],"study_design_scores_gemma":[0.0005993289,0.00007763888,0.028882973,0.000010873385,4.2982452e-7,0.000002673064,0.0000022687202,0.00091598945,0.0015310176,0.96754164,0.00030578327,0.00012939658],"about_ca_topic_score_codex":0.00006904747,"about_ca_topic_score_gemma":0.000023773282,"teacher_disagreement_score":0.025852514,"about_ca_system_score_codex":0.00006634696,"about_ca_system_score_gemma":0.00003122392,"threshold_uncertainty_score":0.4940132},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98935485,0.0005564266,0.00011935595,0.000006078764,0.005405605,0.00020582377,0.000008373049,0.00019504844,0.004148439],"genre_scores_gemma":[0.9997477,0.0000061461615,0.0000029968244,0.0000014936114,0.000025293266,0.0000364261,0.000010953055,0.000026377524,0.0001426308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908036,0.000056119014,0.00035232853,0.00012262553,0.00016490041,0.00022364983],"domain_scores_gemma":[0.9995661,0.000038134516,0.000053118172,0.00026536186,0.000028806762,0.00004849901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001245674,0.00015193161,0.00029009176,0.00006228297,0.000038275582,0.000022457545,0.00013483691,0.000077184326,0.00001951281],"category_scores_gemma":[0.0000069121656,0.00013617885,0.000089543784,0.00014898436,0.000034110177,0.000056819772,0.000017056624,0.00009116008,0.000022425547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011007702,0.000094755924,0.005050618,0.00017200514,0.00004429074,0.0000042853344,0.00007198125,0.001618341,0.0052000084,0.98442715,0.00325701,0.00004854228],"study_design_scores_gemma":[0.0083520515,0.0005867579,0.035983764,0.0006125595,0.00022177609,0.000040686933,0.0008370797,0.045039676,0.13142051,0.75336456,0.021526376,0.0020142205],"about_ca_topic_score_codex":0.00011647411,"about_ca_topic_score_gemma":0.000007085338,"teacher_disagreement_score":0.2310626,"about_ca_system_score_codex":0.00003174387,"about_ca_system_score_gemma":0.0000051421125,"threshold_uncertainty_score":0.5553212},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9860077,0.00010667663,0.0075241653,0.0001609605,0.0017664187,0.00017035622,0.000015859465,0.00009768686,0.004150169],"genre_scores_gemma":[0.99554414,0.00006445659,0.0042885076,0.000037264686,0.0000020943578,0.0000035610549,0.000016835555,0.0000050533827,0.00003809483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896765,0.000053559983,0.00026967796,0.00022571535,0.00032393908,0.00015943547],"domain_scores_gemma":[0.9990466,0.00005786055,0.0001506,0.00057182607,0.00012401125,0.000049096787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019434828,0.000106060565,0.0002159718,0.00012366351,0.00006914311,0.000016096861,0.0008369132,0.000044795303,0.000010199243],"category_scores_gemma":[0.000015307733,0.000101799225,0.00008422397,0.00047516194,0.000102324506,0.0005307534,0.0002590407,0.00011452408,0.00001536232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004902893,0.00023838112,0.005098753,0.000022940929,0.000023228287,0.000014197111,0.00016656576,0.000001222107,0.0008136427,0.9880742,0.002436533,0.0031054397],"study_design_scores_gemma":[0.001716821,0.00042419537,0.07579271,0.00008467625,0.000023923736,0.000014986219,0.000028752178,0.010006276,0.031979445,0.8790021,0.0005868074,0.00033929065],"about_ca_topic_score_codex":0.0000628492,"about_ca_topic_score_gemma":7.5334555e-7,"teacher_disagreement_score":0.109072074,"about_ca_system_score_codex":0.000014823298,"about_ca_system_score_gemma":0.000029720262,"threshold_uncertainty_score":0.4151252},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9362543,0.0004943299,0.04918769,0.0007216635,0.004029189,0.0003485647,0.000009931917,0.0000882293,0.0088661015],"genre_scores_gemma":[0.99912614,0.000020272993,0.0006641887,0.00001533419,0.0000022309498,0.000005545891,0.000007537901,0.0000031770012,0.00015558838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923176,0.00005059242,0.00017931616,0.00017073928,0.00016857189,0.00019901221],"domain_scores_gemma":[0.9993637,0.00007772133,0.000070310656,0.0004302815,0.00003259159,0.00002535578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047709202,0.00007467616,0.00009378821,0.000029112096,0.00018295154,0.00025972485,0.0005946974,0.000023787032,0.0000015166439],"category_scores_gemma":[0.00005902407,0.00005618497,0.000030572766,0.00043892386,0.000079226804,0.00044181434,0.00013540086,0.00007124065,0.000010400125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011751379,0.000054012675,0.0034893611,0.0000037625707,0.000004928432,0.0000039485108,0.000086768276,0.0000058709024,0.00005191102,0.98407996,0.0008560303,0.011362246],"study_design_scores_gemma":[0.0018766357,0.00009055984,0.13651982,0.000069133384,0.000008813344,0.000002977524,0.00010703991,0.023938399,0.007944369,0.7907144,0.03838113,0.00034677598],"about_ca_topic_score_codex":0.000028574736,"about_ca_topic_score_gemma":0.000009778653,"teacher_disagreement_score":0.19336563,"about_ca_system_score_codex":0.000032473934,"about_ca_system_score_gemma":0.00002777082,"threshold_uncertainty_score":0.25045326},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98697865,0.000314251,0.009596765,0.00001310798,0.0012978163,0.0004009392,0.000003622144,0.00022598499,0.0011688888],"genre_scores_gemma":[0.99726236,0.000010780217,0.0025197547,0.000012326115,0.000026023105,0.00001919109,0.0000027960155,0.000031807944,0.00011495125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992909,0.000016342525,0.00016530171,0.00016810247,0.000096367476,0.00026302773],"domain_scores_gemma":[0.9994102,0.00024591465,0.00003485755,0.0001505422,0.00002948809,0.00012896502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026564428,0.00015346624,0.00018133874,0.000056328317,0.00009618117,0.000040193812,0.00007677894,0.00008603786,0.000007559376],"category_scores_gemma":[0.000018015215,0.00014318549,0.000037036283,0.00018919396,0.00004201751,0.00012846559,0.0000117679865,0.000093386414,0.0000041801036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001233606,0.000024483454,0.0043291985,0.00013593194,0.00012226844,0.000009358256,0.0006464193,0.000085846834,0.003088963,0.9870787,0.0011438127,0.0032116268],"study_design_scores_gemma":[0.0072831437,0.0010834233,0.016515536,0.00025061477,0.00015836516,0.00024020504,0.0016979757,0.00092111796,0.0127164,0.9543429,0.0038362127,0.000954119],"about_ca_topic_score_codex":0.000023281633,"about_ca_topic_score_gemma":0.00002176568,"teacher_disagreement_score":0.032735843,"about_ca_system_score_codex":0.000029222534,"about_ca_system_score_gemma":0.000009905917,"threshold_uncertainty_score":0.5838935},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87693894,0.0013853157,0.06887981,0.0012859912,0.0045193546,0.0003913734,0.0000079496585,0.0006489268,0.045942314],"genre_scores_gemma":[0.98384964,0.00058778777,0.015033488,0.00020081787,0.00002103737,0.000007840461,0.000004899512,0.000010392274,0.000284081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911237,0.000024703642,0.00012528306,0.0003107607,0.00019536336,0.00023152564],"domain_scores_gemma":[0.9992665,0.000046152963,0.000041260613,0.0005055632,0.000032820957,0.0001077008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000127447,0.00011198269,0.00012237564,0.000052335767,0.00013387155,0.00014132493,0.0005101574,0.000047498972,0.000017005761],"category_scores_gemma":[0.000015454889,0.00009788709,0.000025758629,0.00022307689,0.00003232853,0.0005273538,0.00039383996,0.00010407907,0.0000456827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004406341,0.000071556125,0.0031699499,0.0000068406152,0.000008545398,0.000078447345,0.0002699075,7.3224595e-7,0.00026838196,0.92314595,0.00680339,0.066171914],"study_design_scores_gemma":[0.0014428458,0.00023801823,0.02962581,0.00004819487,0.000007989401,0.00012696651,0.000067748115,0.027670505,0.0006146634,0.81462157,0.12507038,0.00046533815],"about_ca_topic_score_codex":0.00006258169,"about_ca_topic_score_gemma":0.0000014937644,"teacher_disagreement_score":0.118266985,"about_ca_system_score_codex":0.000018878904,"about_ca_system_score_gemma":0.000022031156,"threshold_uncertainty_score":0.39917198},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98919123,0.0011072821,0.0049103987,0.00030282376,0.00093254,0.000085044514,0.0000014692023,0.00012866486,0.0033405637],"genre_scores_gemma":[0.99418014,0.00007543688,0.005471586,0.000088047476,0.00000525701,0.0000011850923,2.4252884e-7,0.000004696355,0.00017342485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993925,0.000038884467,0.00012343888,0.00018231066,0.00012864271,0.00013419193],"domain_scores_gemma":[0.99935067,0.00012472534,0.000048517064,0.00035501542,0.000026143089,0.000094960276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011522362,0.000082074686,0.00012530982,0.00007229187,0.00007536571,0.000026716862,0.00029335718,0.00003921152,0.00006342764],"category_scores_gemma":[0.000023337216,0.00007717642,0.000047206093,0.0003128864,0.000047832396,0.00017121839,0.00016716536,0.00007523182,0.000013725548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023476398,0.00004533251,0.0017356918,0.0000037464308,0.0000120998875,0.0000027821575,0.00036177263,0.0000015697112,0.00062909676,0.98892516,0.0031319987,0.0051483763],"study_design_scores_gemma":[0.00068992755,0.00017134631,0.0033740064,0.000029449164,0.000011346366,0.0000067437027,0.000010246682,0.0049898303,0.002691107,0.98175687,0.006107871,0.00016124446],"about_ca_topic_score_codex":0.000017333796,"about_ca_topic_score_gemma":0.0000011114784,"teacher_disagreement_score":0.0071683046,"about_ca_system_score_codex":0.0000043051796,"about_ca_system_score_gemma":0.000008964552,"threshold_uncertainty_score":0.3147163},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9883654,0.00009490946,0.0074189655,0.0005113958,0.0009830402,0.00025295885,0.00000110655,0.00012870197,0.0022435074],"genre_scores_gemma":[0.99640757,0.000010979417,0.0034005377,0.000058117137,0.0000028367037,0.000028814527,0.0000021719684,0.000010601346,0.00007837772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985729,0.00008564686,0.00020483571,0.00037435855,0.00038416078,0.00037812474],"domain_scores_gemma":[0.9991291,0.000101635495,0.000054755237,0.0005417336,0.000080810525,0.00009195475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042735497,0.00012683334,0.00014936933,0.0003157502,0.000085639585,0.000082908184,0.00073756557,0.0000682689,0.0000072566168],"category_scores_gemma":[0.00011671762,0.00013329998,0.00005966377,0.0012324174,0.00007051904,0.00082272326,0.00023549401,0.00022790761,0.00008596711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012739699,0.00012183004,0.0007991751,0.0000045242955,0.0000044399,0.000036632293,0.00031859352,0.00026686987,0.0012028988,0.9943444,0.0000268082,0.0028610765],"study_design_scores_gemma":[0.001854557,0.000101799174,0.010977593,0.0000188144,8.3480086e-7,0.000011979777,0.000019801644,0.00044748827,0.0059124622,0.98045236,0.000050382056,0.00015194327],"about_ca_topic_score_codex":0.00003895537,"about_ca_topic_score_gemma":0.000010568489,"teacher_disagreement_score":0.013892068,"about_ca_system_score_codex":0.00016814918,"about_ca_system_score_gemma":0.00008316963,"threshold_uncertainty_score":0.54358155},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9854376,0.0003953661,0.0012627576,0.0011223091,0.0028454678,0.00016952894,9.87543e-7,0.00063879736,0.008127221],"genre_scores_gemma":[0.9951951,0.0000023752539,0.0039854436,0.00047109235,0.0000020535497,0.000008081945,0.0000027197607,0.0000116327465,0.00032149363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987655,0.0000518158,0.00021212679,0.00037540426,0.00029362523,0.00030149345],"domain_scores_gemma":[0.9990788,0.00012621035,0.00007664998,0.00057491875,0.00007217209,0.000071225644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025431128,0.00015002438,0.00015083214,0.000113704475,0.00016082212,0.00012643504,0.0004900086,0.00007525708,0.000009666956],"category_scores_gemma":[0.000036224155,0.00013341977,0.000061204126,0.00040805107,0.000034744888,0.00013574619,0.00011033066,0.00016420333,0.00022873764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022780223,0.000103740465,0.00020746782,0.0000026628695,0.0000055437768,0.00001311645,0.00003289708,0.00014964324,0.0020958493,0.9923801,0.00448066,0.0005260554],"study_design_scores_gemma":[0.00069484994,0.00012262505,0.00028988108,0.000024789932,0.0000035232026,0.000007086527,0.0000012387867,0.0021727365,0.0104557425,0.9853234,0.00073023466,0.00017384776],"about_ca_topic_score_codex":0.000087440145,"about_ca_topic_score_gemma":0.0000024861015,"teacher_disagreement_score":0.009757543,"about_ca_system_score_codex":0.000025880332,"about_ca_system_score_gemma":0.000042303473,"threshold_uncertainty_score":0.54407007},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9966106,0.00046969604,0.00033031084,0.0000029321384,0.0007564393,0.00015247209,0.0000037295397,0.00012097723,0.0015528355],"genre_scores_gemma":[0.9998255,0.000034276563,0.00008456882,0.0000042900037,0.000004685625,0.0000043390314,0.000004007521,0.000026061804,0.000012308721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992696,0.000025095898,0.00021087706,0.00013529883,0.00014750584,0.00021159656],"domain_scores_gemma":[0.99949205,0.00013580653,0.00004433217,0.00020452896,0.000038403236,0.000084896186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033561548,0.00014233861,0.00021781962,0.000102300844,0.000055532768,0.0000138138985,0.00010401859,0.00007858046,0.0000051007632],"category_scores_gemma":[0.000013774108,0.0001241226,0.00003760346,0.00021920397,0.00008083041,0.00009757631,0.00001924676,0.00010074498,0.0000031658767],"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.00019322266,0.00009279663,0.26869848,0.00021636355,0.000112492526,0.000024911471,0.0007930642,0.00042545324,0.0049721505,0.7213793,0.00019898213,0.0028927962],"study_design_scores_gemma":[0.0057628504,0.00052960723,0.5693524,0.00034399654,0.00008007159,0.00004732273,0.001192836,0.0027949112,0.034446646,0.3832528,0.0012573439,0.00093924045],"about_ca_topic_score_codex":0.00004233227,"about_ca_topic_score_gemma":0.000026567195,"teacher_disagreement_score":0.33812648,"about_ca_system_score_codex":0.000009964794,"about_ca_system_score_gemma":0.0000043267214,"threshold_uncertainty_score":0.5061573},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927811,0.000092008515,0.00039015815,0.00020880908,0.0027611165,0.0005439046,0.00003661603,0.00019878645,0.002987526],"genre_scores_gemma":[0.99100506,0.000017082075,0.008451103,0.00026903948,0.000021529553,0.000048499787,0.00001412977,0.000057934423,0.0001156255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859715,0.000047416812,0.0003599321,0.00033101384,0.00020410148,0.00046037603],"domain_scores_gemma":[0.9986963,0.00033940366,0.00015473332,0.0005560799,0.00011878369,0.00013466706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035585702,0.00025205783,0.0003921256,0.000104011335,0.00039117073,0.000051661584,0.00039844593,0.00014577495,0.000029944287],"category_scores_gemma":[0.00022480842,0.00022484911,0.00024959576,0.0002455577,0.00016375267,0.00008915414,0.00010800438,0.00018671608,0.00001539942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002605021,0.00010631931,0.0012326849,0.00008082595,0.00009030645,0.000006331392,0.00065737235,0.000009462975,0.000300787,0.9958582,0.001467884,0.0001637742],"study_design_scores_gemma":[0.002124573,0.00011546502,0.0010382903,0.000047133526,0.000063312655,0.000011234694,0.000068722715,0.000014872999,0.001365931,0.99043417,0.0044159815,0.0003003068],"about_ca_topic_score_codex":0.000030258707,"about_ca_topic_score_gemma":0.000017056513,"teacher_disagreement_score":0.008060945,"about_ca_system_score_codex":0.000048699992,"about_ca_system_score_gemma":0.000035768513,"threshold_uncertainty_score":0.9169081},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25853765,0.0011096818,0.7260989,0.004903539,0.0052254163,0.0023903162,0.000006845534,0.0003505091,0.0013771367],"genre_scores_gemma":[0.96975386,0.000059514103,0.029713124,0.00007074393,0.0000072440594,0.00023897507,0.0000026677762,0.000016937198,0.00013696063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986604,0.000080277954,0.00020623235,0.00031784148,0.0003093471,0.0004259373],"domain_scores_gemma":[0.9987473,0.00042749988,0.00006363812,0.0005501316,0.00014206194,0.000069403475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009517725,0.00011648089,0.00012021793,0.00017195693,0.0003034766,0.00012620063,0.0011376211,0.000054626144,7.8240777e-7],"category_scores_gemma":[0.00013452512,0.000092914415,0.00007234984,0.00091471337,0.00011835566,0.00046773697,0.00017453486,0.00017878058,0.000018415758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006484753,0.000054411346,0.00006498893,0.0000025642535,0.000005192186,0.000004999038,0.00015901864,0.00003386611,0.00012644708,0.90150136,0.000040779327,0.097999886],"study_design_scores_gemma":[0.0017092945,0.00012971088,0.00087572885,0.000011877109,0.0000012811596,0.0000043918767,0.000031338168,0.0061681606,0.0028334705,0.98731226,0.0008060664,0.000116420815],"about_ca_topic_score_codex":0.000020420866,"about_ca_topic_score_gemma":0.000023928491,"teacher_disagreement_score":0.71121615,"about_ca_system_score_codex":0.00012586969,"about_ca_system_score_gemma":0.00007868946,"threshold_uncertainty_score":0.378894},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.967887,0.00036618952,0.003076127,0.0012584185,0.0031177427,0.00016489206,0.0000011989462,0.00034841584,0.023780018],"genre_scores_gemma":[0.9961982,0.00003970715,0.0018817006,0.00049443747,0.00001448392,0.000010793604,0.0000016433065,0.000015162573,0.0013439213],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982421,0.00007817984,0.00034962714,0.000430071,0.00043293394,0.00046709648],"domain_scores_gemma":[0.9989471,0.00012937558,0.000094107876,0.0006177408,0.000067690184,0.00014401284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003780252,0.00016044376,0.00016007807,0.000051950723,0.00027542695,0.00040367592,0.0012507123,0.000073092495,0.00032435948],"category_scores_gemma":[0.00010071361,0.0001672087,0.00006406258,0.00042305142,0.000052672563,0.0011064422,0.000182222,0.00021440285,0.00076545076],"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.00001792807,0.00045119328,0.008278327,0.000016369255,0.00006499362,0.00007763652,0.006842129,0.00017411249,0.0029424245,0.41464645,0.042947847,0.5235406],"study_design_scores_gemma":[0.00055586064,0.00022896551,0.0007114773,0.00013647461,0.000022043147,0.000011411195,0.00049343077,0.038181774,0.0778767,0.7177344,0.16307235,0.0009751274],"about_ca_topic_score_codex":0.00012510736,"about_ca_topic_score_gemma":0.000008139079,"teacher_disagreement_score":0.5225655,"about_ca_system_score_codex":0.00008885476,"about_ca_system_score_gemma":0.000033601933,"threshold_uncertainty_score":0.98385763},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990853,0.00036197336,0.000015750547,0.00038339527,0.0001067974,0.00019991824,0.0000034765148,0.000033420416,0.008042244],"genre_scores_gemma":[0.999438,0.00008144636,0.00017808963,0.000039102157,0.0000028300237,0.000035233832,4.5199403e-7,0.000008375981,0.00021650085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994707,0.0000838243,0.00015746176,0.00009593145,0.000096715834,0.00009532831],"domain_scores_gemma":[0.99909717,0.0004662333,0.000084464315,0.0002884222,0.00003406712,0.000029640903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032178327,0.00007149336,0.0001488407,0.000032806925,0.00012198633,0.000012991289,0.00015737534,0.00003521471,0.000057288515],"category_scores_gemma":[0.00009160248,0.000048467104,0.000054096527,0.0001797337,0.00027437924,0.00004015099,0.000034648583,0.00007231688,0.0000088568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007933692,0.00007995047,0.00033196376,0.000019686118,0.000022493929,3.0821832e-7,0.0010609719,7.740532e-8,0.000067673216,0.99698734,0.0011293931,0.00029220726],"study_design_scores_gemma":[0.0008021207,0.00001649016,0.0002649945,0.000012291537,0.00003350277,0.0000027873589,0.00016095077,0.000050912986,0.0009235943,0.9972598,0.00041592226,0.0000566111],"about_ca_topic_score_codex":0.000006432955,"about_ca_topic_score_gemma":0.0000020745033,"teacher_disagreement_score":0.008584945,"about_ca_system_score_codex":0.0000025826505,"about_ca_system_score_gemma":0.000002195048,"threshold_uncertainty_score":0.19764312},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9863824,0.0009497465,0.0011047202,0.0008810345,0.0065497844,0.00083693693,0.0000064002274,0.0008804446,0.0024085254],"genre_scores_gemma":[0.9979751,0.00008585185,0.0007064441,0.0007851224,0.000021533593,0.0001308333,0.000016305512,0.000049705955,0.00022911931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959593,0.00039458243,0.000849701,0.0011298722,0.0006391534,0.0010274071],"domain_scores_gemma":[0.9971703,0.00030149045,0.00027807007,0.0011324451,0.00065143313,0.00046625582],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006054486,0.0005853381,0.0007133052,0.00045335336,0.00064925157,0.001069364,0.001338194,0.00033540302,0.00009591],"category_scores_gemma":[0.00010001965,0.0005426203,0.00026304778,0.0016801133,0.0001969846,0.0012959451,0.00039214033,0.00050280883,0.00014946237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013938442,0.00013020959,0.0083278185,0.00003377184,0.0001585345,0.000040883067,0.0010812671,0.000036428,0.002130779,0.97444415,0.011995381,0.001606822],"study_design_scores_gemma":[0.0043166587,0.00069639075,0.05568743,0.0003976318,0.0000603112,0.00035109528,0.00052929675,0.060058344,0.0010769555,0.86933887,0.0057380334,0.0017489786],"about_ca_topic_score_codex":0.0012261269,"about_ca_topic_score_gemma":0.000109579276,"teacher_disagreement_score":0.105105296,"about_ca_system_score_codex":0.00008084872,"about_ca_system_score_gemma":0.00008497028,"threshold_uncertainty_score":0.99996763},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99445665,0.00018678501,0.0002630405,0.00060259143,0.0010443953,0.00009184425,0.0000018759717,0.00006112878,0.003291707],"genre_scores_gemma":[0.9982292,0.00001191275,0.0015808585,0.00006665442,5.2445654e-7,0.0000026847222,6.6101023e-7,0.0000041360445,0.00010336904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999217,0.000041090785,0.0002403742,0.0001551539,0.00022101308,0.00012537903],"domain_scores_gemma":[0.9990667,0.0001849258,0.00013357337,0.00047770905,0.0001045238,0.000032551823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015487513,0.00008366249,0.00013504131,0.00010751463,0.000087984066,0.000019168236,0.0004142052,0.00003645857,0.0000062921545],"category_scores_gemma":[0.00003370506,0.000059535767,0.000075947726,0.000524794,0.0001566703,0.000065176326,0.00006743691,0.000083323415,0.000007648434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019655613,0.00006338035,0.00089238014,0.0000035596129,0.000009887536,5.642136e-7,0.000108487744,0.000068043984,0.0018176741,0.98852855,0.007997033,0.0005084998],"study_design_scores_gemma":[0.00033371896,0.000084159794,0.001445566,0.000021630385,0.0000057150496,0.0000030578078,0.000028598275,0.0002859044,0.019020267,0.9785929,0.000118157965,0.00006033852],"about_ca_topic_score_codex":0.00049026136,"about_ca_topic_score_gemma":0.0000045968527,"teacher_disagreement_score":0.017202593,"about_ca_system_score_codex":0.0000052233167,"about_ca_system_score_gemma":0.000057906764,"threshold_uncertainty_score":0.2427798},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9556497,0.00009794349,0.005757281,0.0012665661,0.0029908163,0.00056516845,0.0000108646755,0.00016956049,0.033492114],"genre_scores_gemma":[0.9976775,0.0000087297,0.001892667,0.00037651445,0.0000031672548,0.000013532782,0.000003850879,0.000010498861,0.000013547628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983106,0.00022215134,0.00041446192,0.00038571996,0.00032603976,0.00034099034],"domain_scores_gemma":[0.99757254,0.0011150503,0.00016277062,0.0009615453,0.00008480063,0.000103314065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074734364,0.00019362397,0.00041861378,0.00016147952,0.00005641089,0.00005521826,0.0011981962,0.000102495105,0.000009652303],"category_scores_gemma":[0.0008170799,0.00016465635,0.000088474386,0.00037174637,0.00010065916,0.00019041917,0.0002640145,0.00021081282,0.000028130593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000132016,0.0001707847,0.0040136143,0.000014560631,0.000014830595,0.000019720435,0.00040593752,0.00008568355,0.0001238985,0.9879185,0.0018842552,0.0052161915],"study_design_scores_gemma":[0.014051182,0.0005670368,0.004922991,0.00009907339,0.0000055650607,0.000006126795,0.00004475533,0.03933743,0.00077859417,0.9394171,0.0004775639,0.00029255284],"about_ca_topic_score_codex":0.00011197831,"about_ca_topic_score_gemma":0.000035229936,"teacher_disagreement_score":0.04850138,"about_ca_system_score_codex":0.000060967224,"about_ca_system_score_gemma":0.00007100555,"threshold_uncertainty_score":0.67144907},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9714718,0.0002625118,0.023999719,0.00046082833,0.00024098787,0.000491218,0.0000056637573,0.00015782312,0.00290946],"genre_scores_gemma":[0.9941202,0.00006656126,0.0056474064,0.000047419184,0.0000027338615,0.000028301745,0.000002284337,0.00001842137,0.00006666446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788743,0.0002856936,0.0003040681,0.00062732043,0.00044514704,0.000450363],"domain_scores_gemma":[0.9976866,0.00045659038,0.00014772886,0.0011740924,0.0003344793,0.00020047861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000953131,0.00021929793,0.0003616967,0.00019468437,0.00012913843,0.000057370136,0.00073249126,0.00007730118,0.0000149287625],"category_scores_gemma":[0.00024187607,0.00018589442,0.000063787484,0.0010502018,0.00043853183,0.0006718302,0.00043573516,0.00025000126,0.0000046851314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021725983,0.00028632366,0.036573023,0.00004129671,0.000038630533,0.00004904265,0.00040297167,0.000013353287,0.00075844827,0.9548511,0.000092453076,0.0066761132],"study_design_scores_gemma":[0.0015150541,0.0008225023,0.019316213,0.000038874114,0.000008302807,0.00006412913,0.000038730836,0.001299548,0.0045838207,0.9719048,0.00018719453,0.00022083623],"about_ca_topic_score_codex":0.00014939575,"about_ca_topic_score_gemma":0.000055782544,"teacher_disagreement_score":0.02264842,"about_ca_system_score_codex":0.000042494543,"about_ca_system_score_gemma":0.00007129988,"threshold_uncertainty_score":0.7580554},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9656065,0.0019271909,0.000021481743,0.000007042086,0.0032775523,0.00013559639,0.0000053823496,0.00024331316,0.028775912],"genre_scores_gemma":[0.9991276,0.000025982765,0.000010419279,0.0000043479326,0.000010626787,0.000017990818,0.0000016764538,0.000030058638,0.00077126146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922854,0.000036742807,0.00027372217,0.00011052389,0.00015195039,0.00019854768],"domain_scores_gemma":[0.9995191,0.00004757517,0.000044687335,0.0002851381,0.000040249928,0.00006325922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015809397,0.000128767,0.00023728854,0.000078501034,0.000032924636,0.000018892579,0.00016939126,0.00008009549,0.000110323264],"category_scores_gemma":[0.000013071414,0.00012753524,0.00006788903,0.00022464695,0.00002809748,0.00010070036,0.000015340058,0.000096972784,0.00015321567],"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.0000034940997,0.00005975202,0.0012929862,0.0003245545,0.000089033696,0.000008299602,0.0008314826,0.0019086814,0.0051971157,0.9760799,0.013944749,0.00025995955],"study_design_scores_gemma":[0.010312665,0.0010263231,0.0040835226,0.0018172088,0.00034420763,0.00022320224,0.0050930814,0.39969203,0.07034858,0.3133968,0.18935934,0.0043029953],"about_ca_topic_score_codex":0.000018207546,"about_ca_topic_score_gemma":5.366732e-7,"teacher_disagreement_score":0.66268307,"about_ca_system_score_codex":0.00002261547,"about_ca_system_score_gemma":0.000001735715,"threshold_uncertainty_score":0.52007365},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9807381,0.0003709593,0.0004660795,0.002083171,0.0069140657,0.00035265478,0.000009598333,0.0006812974,0.008384056],"genre_scores_gemma":[0.9958601,0.000054982927,0.0027806344,0.0011387818,0.000008811386,0.00001551771,0.000012444318,0.000028179877,0.000100544574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735874,0.000109931956,0.0004626392,0.00078477315,0.0006262905,0.00065762096],"domain_scores_gemma":[0.99806154,0.0001153544,0.00017500494,0.0012250907,0.0001320274,0.00029098868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037425943,0.00035012932,0.00037035852,0.000458205,0.00038399425,0.00023099486,0.0012169511,0.00012013817,0.00003189927],"category_scores_gemma":[0.00004806718,0.0003287539,0.00023676515,0.00155439,0.00019831698,0.00038604127,0.00024323934,0.00036034285,0.0006618485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000092754535,0.000305391,0.00037329015,0.0000044924873,0.000030058362,0.00004985287,0.00014388496,0.00023620487,0.0007002519,0.99165773,0.005048094,0.0014414453],"study_design_scores_gemma":[0.0023500244,0.0003420986,0.002087146,0.00006318402,0.000014211498,0.000018262843,0.0000054961743,0.0006298471,0.0011105686,0.9904794,0.0024962407,0.0004035208],"about_ca_topic_score_codex":0.00013205572,"about_ca_topic_score_gemma":0.00002730769,"teacher_disagreement_score":0.015121985,"about_ca_system_score_codex":0.000059048052,"about_ca_system_score_gemma":0.00008938504,"threshold_uncertainty_score":0.99991643},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.989252,0.0005272509,0.0035966542,0.00034481028,0.0015857547,0.00008783266,0.0000039193555,0.0003649377,0.0042368653],"genre_scores_gemma":[0.99606925,0.000070684946,0.0032149048,0.00051809073,0.00001867149,0.00001442345,0.00000393628,0.0000102526,0.00007977547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986904,0.00015709961,0.00016419713,0.0003916147,0.00024070646,0.00035593726],"domain_scores_gemma":[0.9989137,0.00018261626,0.000059722737,0.00065367704,0.000042573447,0.00014768816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027765383,0.00016117665,0.00017760723,0.00009234839,0.0003691564,0.000102344115,0.0010796225,0.000082765764,0.00006281078],"category_scores_gemma":[0.00004247081,0.0001609914,0.00012702326,0.0005032624,0.00014466132,0.0003436546,0.00019230349,0.00020201252,0.00017242743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009221249,0.00008985245,0.017433053,0.0000033570548,0.000027661508,0.00013985347,0.0019041472,0.000005646188,0.0017664771,0.97177595,0.0035210156,0.0033237953],"study_design_scores_gemma":[0.00053407555,0.00012896741,0.012145535,0.000019481331,0.00000785315,0.00006631996,0.0000233939,0.00063600077,0.0031375967,0.9741635,0.008857253,0.00028004323],"about_ca_topic_score_codex":0.00013438791,"about_ca_topic_score_gemma":0.0000033250685,"teacher_disagreement_score":0.0068172854,"about_ca_system_score_codex":0.000050193954,"about_ca_system_score_gemma":0.00012761798,"threshold_uncertainty_score":0.6565039},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9592425,0.00080093683,0.0001646835,0.0023522393,0.005670792,0.00017881572,0.0000010886139,0.0006325501,0.030956348],"genre_scores_gemma":[0.99697965,0.00003185096,0.0009145671,0.0011583285,0.0000010241063,0.000007414106,9.388417e-7,0.000012321025,0.0008939112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986405,0.0000619811,0.00019845134,0.0004229467,0.0003356839,0.0003404621],"domain_scores_gemma":[0.9988181,0.000107385444,0.000047157766,0.00079223025,0.000085385305,0.00014975123],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019808828,0.00016406811,0.00015637597,0.00016929023,0.00015651653,0.00012074412,0.00068084465,0.000074114156,0.00011461783],"category_scores_gemma":[0.000050154078,0.00014565751,0.000092337745,0.00061702676,0.000057609297,0.0002376605,0.00012673982,0.00019008118,0.0015799984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010610702,0.00016546527,0.0002876546,0.0000030304755,0.000008343818,0.000014460012,0.00016099766,0.000012126739,0.0001743454,0.9589726,0.038626112,0.0015738017],"study_design_scores_gemma":[0.0006225397,0.00016962044,0.00026619746,0.000019071624,0.0000037755499,0.000008071514,0.0000033867168,0.004953458,0.0007693412,0.99086314,0.002122619,0.0001987593],"about_ca_topic_score_codex":0.000012979941,"about_ca_topic_score_gemma":5.039985e-7,"teacher_disagreement_score":0.037737098,"about_ca_system_score_codex":0.000017540582,"about_ca_system_score_gemma":0.0000096206395,"threshold_uncertainty_score":0.99919736},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.989193,0.00072833075,0.0024455357,0.00012646905,0.00047737235,0.00007274601,0.0000014232572,0.00007393532,0.006881155],"genre_scores_gemma":[0.9970394,0.000013794645,0.0027559444,0.00007932868,0.0000068608033,0.000003577704,0.0000011633077,0.000005299627,0.00009465352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916136,0.00003847566,0.00016951514,0.00024525035,0.00020741014,0.00017801387],"domain_scores_gemma":[0.9993074,0.0001978256,0.000085449334,0.000326239,0.000038491442,0.000044621735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001462555,0.00010345731,0.0001778118,0.0001590594,0.00006023973,0.00003663245,0.00032100917,0.00004339765,0.0000039136044],"category_scores_gemma":[0.00002809717,0.000091965274,0.00004427009,0.00061160635,0.00005363869,0.00024194256,0.00011303472,0.000095201045,0.000010729689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003268774,0.000064797925,0.0056939144,0.00001428689,0.0000060488555,0.000009485357,0.00001878575,0.000029854173,0.000111164256,0.9922786,0.0002479943,0.0015217942],"study_design_scores_gemma":[0.00035012222,0.00016927221,0.038020026,0.000010663303,0.0000052033374,0.0000078419835,0.000004874226,0.0003139021,0.0014522604,0.9592737,0.00028202703,0.00011009802],"about_ca_topic_score_codex":0.00004085855,"about_ca_topic_score_gemma":7.507623e-7,"teacher_disagreement_score":0.033004895,"about_ca_system_score_codex":0.00001545124,"about_ca_system_score_gemma":0.000015784071,"threshold_uncertainty_score":0.37502348},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99481434,0.00032929442,0.000742315,0.00072061917,0.002025635,0.00008880641,0.0000040782575,0.000181835,0.001093089],"genre_scores_gemma":[0.9930443,0.00001294372,0.0067161964,0.0001744717,7.7170176e-7,0.000006021115,0.000004663265,0.000009136929,0.000031454165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987827,0.000040954106,0.00029285956,0.00034191113,0.0002963477,0.00024522215],"domain_scores_gemma":[0.9989156,0.00006725135,0.00011763661,0.0006663162,0.000120904915,0.00011230443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017748178,0.00014489844,0.00022698735,0.00013964565,0.000068805064,0.00004898008,0.0007377063,0.000085949985,0.0000070158358],"category_scores_gemma":[0.00003923143,0.00012848183,0.00012051163,0.0005890053,0.00009700563,0.00022326566,0.00017202992,0.00016301053,0.000040475967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000456345,0.00014940057,0.0015211327,0.000002891402,0.00002159027,0.000008028575,0.00034826258,0.000045292116,0.0027266322,0.9938054,0.0005842008,0.00078257074],"study_design_scores_gemma":[0.0012986294,0.00013279877,0.0025368903,0.000048716152,0.000008080422,0.0000019612824,0.00002198227,0.00036214807,0.013430354,0.98179734,0.00021635239,0.00014477539],"about_ca_topic_score_codex":0.0008974384,"about_ca_topic_score_gemma":0.000053198582,"teacher_disagreement_score":0.012008124,"about_ca_system_score_codex":0.00002652176,"about_ca_system_score_gemma":0.00008344287,"threshold_uncertainty_score":0.5239337},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9519205,0.00034720515,0.017474638,0.00037730692,0.0016635323,0.0004132807,6.29919e-7,0.00019594564,0.027606959],"genre_scores_gemma":[0.99590003,0.000014390283,0.0037888167,0.00006174918,0.0000011928236,0.000028897815,6.3771336e-7,0.000008508948,0.0001957855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986281,0.00023662702,0.00017622634,0.00032251608,0.00029588933,0.00034068248],"domain_scores_gemma":[0.99908817,0.00018866415,0.0000426913,0.0005312376,0.00006860223,0.00008063105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075271394,0.00010482323,0.00012557306,0.00029746973,0.000070365735,0.00006706825,0.0006377933,0.00005328722,0.000015130176],"category_scores_gemma":[0.00025208018,0.0001078331,0.000043426804,0.0012989349,0.000055357934,0.0005626163,0.00009288691,0.000192401,0.00006792683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033160445,0.0000779618,0.00470953,0.0000032117055,0.0000027019798,0.000017525408,0.00019938253,0.000013217273,0.00038995687,0.9916058,0.0001108939,0.0028664963],"study_design_scores_gemma":[0.00076145306,0.00004885765,0.004995,0.000009012735,5.8437877e-7,0.000005105434,0.00002193524,0.0005362632,0.005231512,0.98648864,0.0017741935,0.00012743771],"about_ca_topic_score_codex":0.0000070292263,"about_ca_topic_score_gemma":0.000005841832,"teacher_disagreement_score":0.043979518,"about_ca_system_score_codex":0.00006628649,"about_ca_system_score_gemma":0.000048708316,"threshold_uncertainty_score":0.4397306},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99616134,0.00035706267,0.00013329445,0.00010066829,0.00020586727,0.00013556995,0.0000036595873,0.000026475267,0.002876043],"genre_scores_gemma":[0.9971132,0.00019516409,0.0017938067,0.000012219693,0.0000012226618,0.000009366516,6.072916e-7,0.000008059277,0.0008663292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988248,0.00014541707,0.00022542395,0.00021691136,0.0003218127,0.00026568817],"domain_scores_gemma":[0.99890393,0.0002544895,0.00007562646,0.0005849067,0.0001076939,0.00007333291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046597645,0.00009620301,0.000178587,0.000037712824,0.00012423482,0.000039584444,0.00065108686,0.000038990365,0.00006259545],"category_scores_gemma":[0.00003430226,0.000072495284,0.000054592812,0.0004589454,0.00025337853,0.0002643867,0.00019966412,0.000104581624,0.000011101587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029779023,0.000046749014,0.0021529286,0.000009192461,0.000022603826,0.0000024166523,0.00020746914,0.00002368946,0.0010086934,0.9863493,0.00019898954,0.009948214],"study_design_scores_gemma":[0.00067921967,0.00006059388,0.004344419,0.000010510341,0.00000296517,0.000012636309,0.00001354961,0.00121642,0.0081680305,0.984998,0.00040865058,0.00008499956],"about_ca_topic_score_codex":0.000041086114,"about_ca_topic_score_gemma":0.0000011102312,"teacher_disagreement_score":0.009863215,"about_ca_system_score_codex":0.000009870761,"about_ca_system_score_gemma":0.00003689944,"threshold_uncertainty_score":0.29562718},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99175704,0.00084689545,0.005440585,0.00038249118,0.00073854317,0.0005096205,0.000011457778,0.00014780943,0.00016556642],"genre_scores_gemma":[0.9919462,0.00007702996,0.007638946,0.0001222348,0.000010369975,0.00014895013,0.0000034908012,0.000015919588,0.000036835732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982491,0.000190761,0.00020466247,0.00048264573,0.00025013438,0.00062269415],"domain_scores_gemma":[0.9983831,0.00058338774,0.00007192535,0.00052786287,0.00012426013,0.000309467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009908252,0.00019484156,0.00024696864,0.00016535542,0.00035272716,0.00011879104,0.0003559575,0.00008725349,0.000002816698],"category_scores_gemma":[0.00015767872,0.00018932026,0.000077994795,0.000460311,0.0002602978,0.0011450845,0.00046480048,0.00016744908,0.000003301186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017042044,0.00013180508,0.12712334,0.000029021341,0.000020716703,7.316411e-7,0.00023614049,6.0257685e-7,0.0013212535,0.8665782,0.000098546094,0.00444256],"study_design_scores_gemma":[0.00066617987,0.00013957846,0.13286996,0.0000079700385,0.000007969553,0.000014882622,0.000010478771,0.0006415327,0.0023427876,0.8627408,0.00035476446,0.00020308497],"about_ca_topic_score_codex":0.000020615978,"about_ca_topic_score_gemma":0.0000069854723,"teacher_disagreement_score":0.005746616,"about_ca_system_score_codex":0.000030804345,"about_ca_system_score_gemma":0.000022469196,"threshold_uncertainty_score":0.7720256},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9881067,0.0001768712,0.00044936905,0.000037968017,0.001411961,0.00017697424,0.000005632071,0.00041004,0.009224477],"genre_scores_gemma":[0.9997445,0.000009571092,0.00006460437,0.000031258558,0.000007373455,0.00003012242,0.0000047870226,0.000042095216,0.00006573017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921906,0.000019847748,0.00013828953,0.00017423945,0.00018921615,0.00025934025],"domain_scores_gemma":[0.9994803,0.000023007287,0.000023963039,0.00035925332,0.000022827096,0.00009063577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093040246,0.00018505326,0.00017912145,0.00007366628,0.00007869586,0.000028894041,0.00016001369,0.00006885502,0.000009424181],"category_scores_gemma":[0.0000047498747,0.00015744231,0.000060189708,0.00031438298,0.000051279894,0.00009097619,0.000008137179,0.0001594651,0.000084071966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003218349,0.000046171077,0.00035783314,0.000036755202,0.000038784918,0.00003428389,0.0002810306,0.0047947075,0.0005339896,0.99349636,0.00015032684,0.00019756792],"study_design_scores_gemma":[0.0022157182,0.000293176,0.0015540074,0.0002096034,0.000020939378,0.000014885748,0.00007515354,0.00012317009,0.010232069,0.9796837,0.005171038,0.0004065578],"about_ca_topic_score_codex":0.000008893366,"about_ca_topic_score_gemma":0.000012559161,"teacher_disagreement_score":0.013812684,"about_ca_system_score_codex":0.000060828617,"about_ca_system_score_gemma":0.000012166197,"threshold_uncertainty_score":0.64203113},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9948895,0.0017000557,0.000060251426,0.00003106118,0.0008664902,0.00018506878,0.000006276515,0.00031578258,0.0019455203],"genre_scores_gemma":[0.9996993,0.000025963649,0.00015019109,0.000019988469,0.000010071129,0.000021750455,0.00001925637,0.0000381408,0.000015338243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895704,0.000062506515,0.0002493004,0.00024097558,0.00017002088,0.00032013765],"domain_scores_gemma":[0.9994439,0.00009901705,0.000047288435,0.00026931523,0.00004304329,0.00009746894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001725038,0.00024655266,0.00028161556,0.0001530681,0.00019043144,0.00009484483,0.00016974423,0.00008616012,0.000010409673],"category_scores_gemma":[0.000003881097,0.00022956837,0.00005457301,0.0003721734,0.00013412251,0.00020576551,0.000027743505,0.00016926377,0.00002009308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073258234,0.000114297465,0.08162345,0.00037978482,0.00022389929,0.00006254034,0.0010601671,0.0011473836,0.021842599,0.89068836,0.001979167,0.00080506416],"study_design_scores_gemma":[0.003146227,0.00031619475,0.03953231,0.0003160742,0.00014651968,0.00012687218,0.00041260064,0.0032176531,0.0080167,0.9355531,0.008021733,0.0011940182],"about_ca_topic_score_codex":0.00016666194,"about_ca_topic_score_gemma":0.000099869256,"teacher_disagreement_score":0.04486471,"about_ca_system_score_codex":0.000025320805,"about_ca_system_score_gemma":0.000008346318,"threshold_uncertainty_score":0.93615264},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9134078,0.00080575404,0.076393105,0.0009481167,0.002654936,0.00041858456,0.0000020669765,0.0008011508,0.0045684855],"genre_scores_gemma":[0.9919075,0.000013097443,0.0076266075,0.00009857928,0.000010768473,0.0000641788,0.0000048831475,0.000020435793,0.00025396806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997879,0.00016562849,0.0003207622,0.00053863775,0.0005067254,0.00058923394],"domain_scores_gemma":[0.99852663,0.0001683825,0.00009560435,0.00090048433,0.00015298402,0.00015591462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005581128,0.00019618763,0.00021018424,0.00023788397,0.00035560658,0.0002097644,0.0009691837,0.000073641364,0.00001959535],"category_scores_gemma":[0.00009066078,0.0001957646,0.00011873662,0.0012078322,0.00014738708,0.00075671024,0.0004025637,0.00025760155,0.00023904677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007837236,0.00011312541,0.0036105472,0.000008894553,0.000010195617,0.00003403456,0.00017891935,0.00011778631,0.0021692629,0.9882172,0.0012951082,0.0042370884],"study_design_scores_gemma":[0.00054861757,0.000101244026,0.0040401244,0.00002423598,0.0000034386958,0.000008151453,0.000015608568,0.004704241,0.0056803133,0.98238957,0.0022448623,0.00023960015],"about_ca_topic_score_codex":0.00011042067,"about_ca_topic_score_gemma":0.000022931838,"teacher_disagreement_score":0.07849968,"about_ca_system_score_codex":0.00008271494,"about_ca_system_score_gemma":0.0000642047,"threshold_uncertainty_score":0.79830486},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.579126,0.0001465211,0.41549638,0.00017289988,0.00400749,0.0004137025,0.000005750881,0.0001498177,0.00048145387],"genre_scores_gemma":[0.9880298,0.000002780405,0.011719524,0.00007509311,0.000047253507,0.000045745397,0.0000030144417,0.0000128858355,0.00006390635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986262,0.00012192998,0.0003366655,0.00039646943,0.00022470672,0.00029407814],"domain_scores_gemma":[0.9986525,0.00015144276,0.00016841282,0.0006908446,0.0002284017,0.000108372136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071458815,0.0001473402,0.00027599107,0.00011686786,0.00014826554,0.00007129426,0.0006244924,0.00009659427,0.0000050815916],"category_scores_gemma":[0.00002325379,0.00014121358,0.00014848358,0.00033325597,0.000047011858,0.00026516017,0.00006899898,0.00009351891,0.0000091133625],"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.000005407753,0.00032686655,0.00012003603,0.0000111592335,0.0000251118,0.0000011833106,0.00039015786,0.0010952441,0.000635321,0.9432889,0.0013852771,0.052715316],"study_design_scores_gemma":[0.0011724521,0.00045715744,0.00082741294,0.0000321315,0.000009420082,0.000013791449,0.000043423894,0.89093506,0.011117873,0.089985795,0.0051531326,0.00025236577],"about_ca_topic_score_codex":0.000031033804,"about_ca_topic_score_gemma":0.000007905341,"teacher_disagreement_score":0.8898398,"about_ca_system_score_codex":0.00005788184,"about_ca_system_score_gemma":0.00003144038,"threshold_uncertainty_score":0.5758523},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990107,0.00006802774,0.00014723283,0.00046038767,0.0001764359,0.00011273237,0.0000073675888,0.00007478167,0.0088460455],"genre_scores_gemma":[0.99530715,0.000005329711,0.0044693523,0.000034402135,0.0000057421157,0.000020584177,0.0000015937007,0.000012931484,0.00014294569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993338,0.00004417067,0.00021716418,0.00012432029,0.00013163387,0.0001489327],"domain_scores_gemma":[0.99898857,0.00050481,0.000049161943,0.00032540588,0.00007183717,0.000060242543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021429975,0.0000865404,0.00015066634,0.000053468917,0.00007680816,0.0000086144455,0.00018175038,0.000057836456,0.00016439558],"category_scores_gemma":[0.00024369275,0.000082730585,0.00008419313,0.0001730539,0.00013916798,0.00007736024,0.00003462568,0.000099722936,0.00004884564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043452133,0.00035391236,0.0002854271,0.00002935399,0.00001131735,7.64557e-7,0.00019226254,0.0000028558625,0.0005414145,0.99679404,0.0014558539,0.00032842235],"study_design_scores_gemma":[0.00024570947,0.000028607843,0.00058343186,0.000013791884,0.000019492563,0.0000032874057,0.00003346081,0.000080415404,0.004904762,0.99298716,0.0010124089,0.000087450746],"about_ca_topic_score_codex":0.000002645713,"about_ca_topic_score_gemma":0.000002621499,"teacher_disagreement_score":0.0087031,"about_ca_system_score_codex":0.0000089653395,"about_ca_system_score_gemma":0.00001156038,"threshold_uncertainty_score":0.3373655},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1796708,0.00044944446,0.79982764,0.007163769,0.004764917,0.0018620476,0.00003581649,0.0010974503,0.0051281275],"genre_scores_gemma":[0.9407064,0.000012518364,0.058352824,0.0002556538,0.000008958162,0.000091939415,0.000011532072,0.000023090475,0.0005371038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985937,0.00003799379,0.00019213292,0.0004181282,0.00027654343,0.00048149488],"domain_scores_gemma":[0.998619,0.0001693564,0.000060497194,0.0007492852,0.00014869557,0.00025312984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021552749,0.0001541361,0.00016974975,0.00019787028,0.00031375588,0.00012139763,0.0011000012,0.00007048825,0.000016530625],"category_scores_gemma":[0.00010610613,0.00016163777,0.00012318857,0.0007867687,0.000086195134,0.00054067327,0.00017109951,0.00016057554,0.000086530534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007866518,0.00006179598,0.00008928404,0.0000058966375,0.000018572839,0.0000069420894,0.00017232673,0.000076272896,0.00093063933,0.9950284,0.0016919088,0.0019101237],"study_design_scores_gemma":[0.0020970223,0.00018950796,0.00095235487,0.0000150655615,0.000004072067,0.000009089255,0.000015197659,0.00015601865,0.0036337236,0.98935694,0.0033791205,0.00019186712],"about_ca_topic_score_codex":0.000033259876,"about_ca_topic_score_gemma":0.000015212499,"teacher_disagreement_score":0.76103556,"about_ca_system_score_codex":0.00007637181,"about_ca_system_score_gemma":0.0002556504,"threshold_uncertainty_score":0.6591397},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9827253,0.000116599665,0.0017907538,0.00044230276,0.0027985473,0.0001843156,0.0000032309158,0.00009695413,0.011841994],"genre_scores_gemma":[0.9991186,0.000016421222,0.00056908134,0.00008475579,0.000032195618,0.000010569896,0.0000013621703,0.000011081289,0.00015588685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987005,0.00010590475,0.00042622714,0.00026948014,0.0002679234,0.00022999433],"domain_scores_gemma":[0.99862593,0.00026836773,0.00027753686,0.0005286924,0.00023175021,0.00006772861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030356727,0.00014530763,0.00032659838,0.00011167172,0.00006488683,0.00003836538,0.0005125456,0.00010050997,0.000049372866],"category_scores_gemma":[0.00005049833,0.00013271972,0.00012228703,0.00039699473,0.000059867147,0.0002856584,0.000068720976,0.0001391421,0.000058155056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029008663,0.0003375361,0.004596228,0.000023991806,0.00005713173,0.0000044713684,0.0003981593,0.00016257956,0.000878509,0.9841734,0.0032681746,0.0060707917],"study_design_scores_gemma":[0.0071118064,0.0015455963,0.039621573,0.00084686413,0.000062697116,0.00018546607,0.0004052215,0.021361196,0.18676223,0.7224347,0.018347804,0.0013148615],"about_ca_topic_score_codex":0.00010469429,"about_ca_topic_score_gemma":0.000026251062,"teacher_disagreement_score":0.26173872,"about_ca_system_score_codex":0.000030779283,"about_ca_system_score_gemma":0.000034159617,"threshold_uncertainty_score":0.54121536},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99157196,0.00012838934,0.0020027447,0.0005667948,0.001833218,0.000106702726,0.000001646381,0.00020887393,0.003579642],"genre_scores_gemma":[0.9926801,0.00001884728,0.0068755643,0.00023158672,5.67081e-7,0.000005626741,0.0000014882846,0.000006565442,0.0001797052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904096,0.000044113414,0.00022598392,0.00023572236,0.00028287596,0.00017036783],"domain_scores_gemma":[0.99899477,0.000129376,0.00010591961,0.00053236744,0.00016502207,0.000072559225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020328553,0.00009539864,0.00014333894,0.00012111606,0.00016551667,0.0000159738,0.00043611162,0.000053538515,0.000009724889],"category_scores_gemma":[0.00010820583,0.0000884896,0.000057366888,0.00053112535,0.000053756365,0.00014153557,0.00009143209,0.00010866728,0.0000859623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021109672,0.00015913448,0.00050057424,0.000003147345,0.000009885185,0.0000058515006,0.00030227134,0.00007494339,0.0006091911,0.9952124,0.002914077,0.00020643917],"study_design_scores_gemma":[0.0005312741,0.0001576083,0.0013011659,0.000017699604,0.000003603673,0.000008389013,0.000002397263,0.0031492263,0.0034503518,0.9910522,0.00021976574,0.00010631893],"about_ca_topic_score_codex":0.00003410533,"about_ca_topic_score_gemma":4.7959355e-7,"teacher_disagreement_score":0.00487282,"about_ca_system_score_codex":0.000012397846,"about_ca_system_score_gemma":0.000058582893,"threshold_uncertainty_score":0.36085013},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.994214,0.000103425744,0.0000222295,0.000052460076,0.0035372698,0.00022216474,0.000014933703,0.00016136568,0.0016721281],"genre_scores_gemma":[0.99915373,0.00002567108,0.00063791225,0.00006920754,0.000008907417,0.00002439717,0.00000430027,0.000030154588,0.00004571844],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981504,0.0002796319,0.00040019705,0.00037770884,0.00043248874,0.00035959302],"domain_scores_gemma":[0.99862826,0.00020733385,0.00022511568,0.0006556912,0.0001786934,0.0001048821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064554944,0.00019858056,0.00042218616,0.00010949302,0.0001524788,0.000030733718,0.00045618636,0.00012341459,0.00042317552],"category_scores_gemma":[0.00031523147,0.0001957096,0.00010755963,0.00031574775,0.0002237566,0.00022447272,0.00015157742,0.00008328399,0.00033174947],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003300779,0.0001810967,0.007835796,0.000023915849,0.000013996099,0.000041333027,0.00022087667,0.000004218312,0.86378163,0.12656401,0.001281483,0.000018613493],"study_design_scores_gemma":[0.0007344255,0.00013242583,0.01654257,0.00001737886,0.00001604043,0.00004408391,0.000028066223,0.0000069826265,0.8783286,0.10368148,0.00025663496,0.0002113121],"about_ca_topic_score_codex":0.00021963558,"about_ca_topic_score_gemma":0.0000037431548,"teacher_disagreement_score":0.022882529,"about_ca_system_score_codex":0.000043286975,"about_ca_system_score_gemma":0.000097862256,"threshold_uncertainty_score":0.79808056},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9964737,0.00078647834,9.872276e-9,0.00034744447,0.00018734281,0.000055650635,0.00001493029,0.000030305062,0.002104105],"genre_scores_gemma":[0.9992969,0.00017426933,0.000021454694,0.000031615262,0.0000035010505,0.0000027260696,0.000007676148,4.1737553e-7,0.00046146076],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9995456,0.000017621114,0.000102910555,0.00010585371,0.00010046363,0.00012759001],"domain_scores_gemma":[0.99981153,0.000050305054,0.00004261654,0.000032089425,0.00002342209,0.000040059596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000040322455,0.000066219414,0.00010810935,0.000003536829,0.00006469338,0.000010703727,0.00011001752,0.000036043282,0.00038949956],"category_scores_gemma":[0.000012457751,0.00002239907,0.00004136514,0.000099631616,0.000023946921,0.000052862575,0.000026891017,0.00003413637,0.00009232465],"study_design_candidate":"observational","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.000060752678,0.0016317165,0.36731803,0.000027727367,0.00017867981,0.00004045391,0.000572201,0.000007292288,0.4237429,0.05012017,0.0131411115,0.14315897],"study_design_scores_gemma":[0.003248293,0.0023747815,0.60962236,0.0002027206,0.00013097703,0.00004804832,0.00054446596,0.0013321635,0.15927733,0.14133652,0.0805943,0.0012880461],"about_ca_topic_score_codex":0.00016176357,"about_ca_topic_score_gemma":0.000012910027,"teacher_disagreement_score":0.26446554,"about_ca_system_score_codex":0.00000776645,"about_ca_system_score_gemma":6.275027e-7,"threshold_uncertainty_score":0.4264747},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938627,0.00023282313,0.000057941517,0.0001706904,0.0002830227,0.00007321305,6.1951636e-7,0.00009360105,0.005225425],"genre_scores_gemma":[0.99663436,0.00005943414,0.0029520558,0.000080293634,2.301538e-7,0.0000070688275,4.678077e-7,0.000005941842,0.0002601629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916613,0.000029516033,0.00020725833,0.00023778499,0.00018438845,0.00017491583],"domain_scores_gemma":[0.9993866,0.000054885746,0.00006169095,0.0003751086,0.000044497912,0.00007719044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001669185,0.00009848307,0.0001621897,0.000037173977,0.00007567993,0.000040535557,0.0003011983,0.0000399995,0.000045157896],"category_scores_gemma":[0.000012154578,0.0000908079,0.00003732513,0.00037589052,0.00009184698,0.00021275581,0.000059158097,0.00006934005,0.000044497014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000261278,0.00005454406,0.004930747,0.00002097805,0.00000866872,0.0000032594535,0.00022682335,0.0000021093203,0.00021128212,0.9906779,0.00031432096,0.0035467518],"study_design_scores_gemma":[0.00045693113,0.00004601527,0.004081286,0.000044884935,0.000005072373,0.000012494088,0.0000043849077,0.0008713114,0.0009332866,0.99276525,0.00066602055,0.000113086884],"about_ca_topic_score_codex":0.0000354485,"about_ca_topic_score_gemma":8.072608e-7,"teacher_disagreement_score":0.004965262,"about_ca_system_score_codex":0.0000068190275,"about_ca_system_score_gemma":0.000015616502,"threshold_uncertainty_score":0.37030387},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7669441,0.00077582477,0.09729109,0.00007455228,0.0046514324,0.00048659617,0.0000071148015,0.0035362476,0.12623301],"genre_scores_gemma":[0.99219567,0.000119596305,0.007390906,0.000015200473,0.0000091513875,0.000011530166,0.000007824222,0.000028304024,0.00022180824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952155,0.0000063510793,0.00011001349,0.0001010152,0.00008692956,0.00017414817],"domain_scores_gemma":[0.9997414,0.000024794997,0.000016441789,0.0001463424,0.000024583078,0.000046464607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003236978,0.00009755208,0.00009482559,0.0000417124,0.00008921717,0.000009856603,0.000078522164,0.000047855086,0.000021249738],"category_scores_gemma":[0.000018251822,0.00010423598,0.000023130764,0.00009147474,0.000026286676,0.000095229174,0.000016014146,0.00011154546,0.000047350353],"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.000004251354,0.000036157668,0.0007523471,0.00004873077,0.000026161926,0.00003566335,0.00038940896,0.83777744,0.00024959867,0.15388872,0.005570596,0.0012209164],"study_design_scores_gemma":[0.002004535,0.00012379343,0.0036580204,0.00008211165,0.000030615156,0.00010470855,0.00005580875,0.10088557,0.024307135,0.8435772,0.024078047,0.0010924686],"about_ca_topic_score_codex":0.0000041644403,"about_ca_topic_score_gemma":4.5482264e-7,"teacher_disagreement_score":0.73689187,"about_ca_system_score_codex":0.000043788787,"about_ca_system_score_gemma":0.000007453052,"threshold_uncertainty_score":0.425062},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9947578,0.0004261791,0.0000024833182,0.00002677255,0.0011014227,0.0001108457,0.000005098923,0.00007324462,0.0034962033],"genre_scores_gemma":[0.9998223,0.00001939122,0.000067272544,0.0000050427807,0.0000060118455,0.0000051201296,0.0000019955428,0.000016133408,0.000056713474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941754,0.00002282412,0.00023087395,0.00008804258,0.00010827372,0.00013241412],"domain_scores_gemma":[0.9996016,0.000019709933,0.00004625492,0.00024379534,0.000056221903,0.000032438606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013029817,0.00008797438,0.00018025363,0.0000817572,0.00001292126,0.0000028026304,0.00013304266,0.00004149064,0.000014042675],"category_scores_gemma":[0.000016853819,0.000086218985,0.00005638284,0.0002320874,0.00004358409,0.000069843605,0.000011204942,0.00006095333,0.000011236239],"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.000022918295,0.00015189576,0.011299123,0.000434989,0.00013072063,0.0000018253787,0.0007886522,0.00081201224,0.07802359,0.9035988,0.0035172347,0.0012182309],"study_design_scores_gemma":[0.0021131379,0.00021042893,0.017679313,0.00026054317,0.00006372774,0.000012740956,0.0003179423,0.0008457496,0.8144838,0.15191977,0.011599658,0.00049319497],"about_ca_topic_score_codex":0.000005076049,"about_ca_topic_score_gemma":8.074513e-7,"teacher_disagreement_score":0.75167906,"about_ca_system_score_codex":0.000010672474,"about_ca_system_score_gemma":0.000005257747,"threshold_uncertainty_score":0.3515908},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77966493,0.0001616635,0.0019699142,0.00017663625,0.0043263966,0.00083526835,0.000022551434,0.0006520269,0.21219061],"genre_scores_gemma":[0.9991115,0.000019333134,0.00041087164,0.00017521375,0.0000043664986,0.000048431524,0.000007978744,0.000029809944,0.0001925282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993858,0.00002327965,0.00018527838,0.00012248624,0.00011641487,0.00016675574],"domain_scores_gemma":[0.999612,0.000023861481,0.000020829932,0.00019471264,0.000039730392,0.000108895765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012365408,0.000115504154,0.00014663006,0.000102522026,0.000042896852,0.000016943039,0.00008809292,0.000059922764,0.00020482528],"category_scores_gemma":[0.00003943298,0.00012377334,0.00003351342,0.00028331086,0.000017980485,0.000036707737,0.0000106075995,0.00011305233,0.00018246635],"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.0000057788293,0.00010070347,0.00035671284,0.00003940322,0.000035925445,8.24575e-7,0.00068116555,0.07097793,0.0010879285,0.91489166,0.011609551,0.0002124006],"study_design_scores_gemma":[0.012541854,0.0016327228,0.0022964205,0.0010308108,0.0001756715,0.000010368779,0.0018772779,0.05088253,0.30809364,0.18455221,0.43273434,0.0041721477],"about_ca_topic_score_codex":0.0000017446574,"about_ca_topic_score_gemma":0.0000021277522,"teacher_disagreement_score":0.73033947,"about_ca_system_score_codex":0.00005078632,"about_ca_system_score_gemma":0.000021481317,"threshold_uncertainty_score":0.504733},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9839243,0.00037053582,0.00026891366,0.0038795308,0.0028778033,0.00016943018,0.000002383443,0.00009493232,0.008412138],"genre_scores_gemma":[0.99733543,0.000015527092,0.0023258848,0.0001497807,7.44405e-7,0.0000026049784,2.5624345e-7,0.0000044755507,0.00016531802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999198,0.000066979395,0.00020881218,0.00016263154,0.00024441644,0.000119166514],"domain_scores_gemma":[0.9990314,0.00016272713,0.00014093104,0.00048372013,0.00015190161,0.000029277779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016606467,0.00008044122,0.00012773726,0.00006804234,0.000055165336,0.000017227725,0.00036391083,0.000043169195,0.000074378884],"category_scores_gemma":[0.000045028213,0.00005547071,0.000047375306,0.0004900191,0.00013637538,0.000076596625,0.000066738285,0.00009119237,0.00003918508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023699827,0.000081053025,0.00022887839,0.000007715688,0.000007777122,8.394031e-7,0.00017913437,0.000021310081,0.0014411567,0.9940596,0.0025561363,0.0014139935],"study_design_scores_gemma":[0.0004284318,0.00019095866,0.00047491177,0.000042178857,0.0000060933253,0.000003059325,0.000010807466,0.0040685725,0.013861705,0.98011094,0.0007209474,0.000081407445],"about_ca_topic_score_codex":0.000028247146,"about_ca_topic_score_gemma":3.9273232e-7,"teacher_disagreement_score":0.013948709,"about_ca_system_score_codex":0.0000073386727,"about_ca_system_score_gemma":0.00001123755,"threshold_uncertainty_score":0.226203},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.977791,0.00003460923,0.016651433,0.0004546375,0.0023594582,0.00011908587,0.000008430525,0.00007762367,0.002503724],"genre_scores_gemma":[0.99862266,0.0000016357601,0.0010366298,0.00025752894,0.0000052168925,0.0000051590287,0.0000018488012,0.000004182423,0.000065135006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902815,0.00016677508,0.00016483135,0.0001939631,0.00027856644,0.00016773965],"domain_scores_gemma":[0.9990317,0.0001512247,0.00010205322,0.0005734938,0.00009177428,0.000049711012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040856865,0.000092419745,0.00012410463,0.000043995686,0.00016229681,0.000029435581,0.0010124665,0.00004410565,0.000012827204],"category_scores_gemma":[0.000060367343,0.000067195826,0.00011157025,0.00037195854,0.00015828009,0.0001808433,0.00020063405,0.00013111524,0.000016222128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014906803,0.00005820013,0.0007570729,0.0000042870843,0.000010985981,4.4075335e-7,0.0001084726,0.00002671575,0.00034994405,0.99785244,0.00038900212,0.0004409368],"study_design_scores_gemma":[0.00036079026,0.00005250063,0.018761275,0.000009862883,0.0000039238057,0.0000031059308,0.0000070363717,0.0036125346,0.0064178845,0.96972865,0.00095659285,0.00008585],"about_ca_topic_score_codex":0.000009372044,"about_ca_topic_score_gemma":0.0000010694444,"teacher_disagreement_score":0.028123807,"about_ca_system_score_codex":0.000009734746,"about_ca_system_score_gemma":0.000030982577,"threshold_uncertainty_score":0.27401662},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053239346,0.00010036191,0.99477243,0.0010110879,0.001384819,0.0004235042,0.000007758532,0.00021615996,0.0015514866],"genre_scores_gemma":[0.005458761,0.0000042103748,0.993042,0.0000720506,0.000056093984,0.000032207394,0.000014320883,0.00002114073,0.0012992487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980317,0.0001537173,0.00037407695,0.0004837677,0.0004335312,0.00052321213],"domain_scores_gemma":[0.99820524,0.00048648316,0.00012710292,0.0006266971,0.00038782335,0.0001666391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093674765,0.00016287592,0.00024384062,0.00017699595,0.000269039,0.0002428147,0.0007795408,0.00009100604,0.00003287187],"category_scores_gemma":[0.0004433107,0.00017191439,0.00010350664,0.00067668024,0.00004074071,0.00031671918,0.00027934022,0.00017007154,0.00004276042],"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.0000030391018,0.000049361166,0.00007672266,0.000010786095,0.000017208826,0.000005393578,0.000042289495,0.0016701755,0.00032311957,0.97697705,0.0058506457,0.014974235],"study_design_scores_gemma":[0.0008985444,0.000043049236,0.00004746,0.0000072953426,0.000008096363,0.000017579734,0.0000109206185,0.6289757,0.001570612,0.36106536,0.0071943183,0.00016105783],"about_ca_topic_score_codex":0.00020835678,"about_ca_topic_score_gemma":0.0000034262978,"teacher_disagreement_score":0.62730557,"about_ca_system_score_codex":0.000078097655,"about_ca_system_score_gemma":0.00033241458,"threshold_uncertainty_score":0.7010466},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95951664,0.000087411485,0.0013617128,0.0011111421,0.0011565832,0.0008593492,0.000011189214,0.0005826363,0.03531333],"genre_scores_gemma":[0.989014,0.000007333607,0.005226391,0.000107557455,0.000020734018,0.00008372092,0.000018334445,0.000065119966,0.0054568024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834514,0.000037258913,0.0006110252,0.0002189385,0.0003997642,0.00038788645],"domain_scores_gemma":[0.9989349,0.00030964206,0.00011971102,0.00039163366,0.00013670187,0.00010739038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026709551,0.00022040172,0.00032878376,0.00013720368,0.00013988826,0.00006698129,0.00023761111,0.00013186023,0.0001076712],"category_scores_gemma":[0.00025730356,0.00021541852,0.00010055167,0.00035739513,0.00003773432,0.0007285987,0.00005342099,0.00017832138,0.0006136511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008939568,0.00015289636,0.000016998642,0.000113128764,0.00001603519,0.000004961242,0.0006594515,0.00002475962,0.0006185293,0.9919021,0.0063986047,0.000083569226],"study_design_scores_gemma":[0.00079307746,0.000061285486,0.00010306078,0.00008115554,0.000034660046,0.000008432649,0.00014938459,0.00021452818,0.005455631,0.9912781,0.0015588427,0.0002618393],"about_ca_topic_score_codex":0.000022211345,"about_ca_topic_score_gemma":0.000016946822,"teacher_disagreement_score":0.02985653,"about_ca_system_score_codex":0.0001362788,"about_ca_system_score_gemma":0.000025525504,"threshold_uncertainty_score":0.8784512},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98133415,0.000021218619,0.000007949156,0.0009445887,0.00021513356,0.00023483373,0.000008517528,0.000060588194,0.01717305],"genre_scores_gemma":[0.9980383,0.000006624064,0.0005037226,0.00067301723,0.0000060749435,0.00004593182,0.0000065201207,0.00001117795,0.00070864905],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876773,0.00006321562,0.00018473215,0.00038582002,0.00024351652,0.0003549883],"domain_scores_gemma":[0.99937886,0.00007485069,0.000053975153,0.00023562937,0.000013342561,0.00024336248],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00010422463,0.00016581547,0.00018111343,0.000013925792,0.00016184106,0.000022144814,0.00025605076,0.00008504108,0.0013661856],"category_scores_gemma":[0.00012617446,0.0001333386,0.00007743899,0.00040797744,0.00008092362,0.000078698264,0.00010248306,0.00013326407,0.001640776],"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.000062859195,0.0010555193,0.011548163,0.000009496377,0.000020363104,0.00003013277,0.0003850137,0.00007628828,0.88447714,0.06345018,0.03812384,0.0007609906],"study_design_scores_gemma":[0.001980648,0.0012347586,0.25015122,0.000038901708,0.000040837625,0.000017800776,0.0004712156,0.00014948029,0.1635848,0.40901825,0.17213124,0.0011808309],"about_ca_topic_score_codex":0.00010456132,"about_ca_topic_score_gemma":0.00001769563,"teacher_disagreement_score":0.72089237,"about_ca_system_score_codex":0.00008639887,"about_ca_system_score_gemma":0.00000839439,"threshold_uncertainty_score":0.9995467},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98044354,0.000010888775,0.000022992246,0.0008706486,0.0001592394,0.00018202473,0.0000040792943,0.000043444856,0.018263131],"genre_scores_gemma":[0.99954087,0.000003954012,0.00024553452,0.00010119665,0.0000020943805,0.000023286988,9.811997e-7,0.0000107122905,0.000071359274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948955,0.000032800075,0.00014194872,0.000098872704,0.00012453581,0.00011228759],"domain_scores_gemma":[0.9991026,0.0003597154,0.00007440702,0.00040501385,0.000029227002,0.000029020239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023353644,0.000077599856,0.00010468005,0.000037463196,0.00010456733,0.000008088595,0.0002179853,0.000036678506,0.000060847706],"category_scores_gemma":[0.000109163244,0.000053917334,0.00007648154,0.00024225077,0.00008927018,0.000023350676,0.000017331373,0.00011385885,0.00004821875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006299057,0.00020629827,0.000043542153,0.0000071807544,0.000016832488,7.0849086e-7,0.0002496033,0.000001480619,0.0005451521,0.9980498,0.00084556354,0.000027546965],"study_design_scores_gemma":[0.00031682767,0.00005666599,0.00027869688,0.00002166992,0.000013486264,0.0000013141057,0.00007767437,6.959996e-7,0.01761373,0.9813769,0.00018326023,0.000059070993],"about_ca_topic_score_codex":0.000005309962,"about_ca_topic_score_gemma":0.000003120717,"teacher_disagreement_score":0.01909733,"about_ca_system_score_codex":0.000012617055,"about_ca_system_score_gemma":0.00001543982,"threshold_uncertainty_score":0.21986851},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99482274,0.00006946852,0.0021620328,0.00009122327,0.00034812183,0.00043933478,0.00036861666,0.000058645695,0.0016398289],"genre_scores_gemma":[0.99656284,0.000003436938,0.002354589,0.0000091324555,0.0000063752545,0.00009916398,0.00028867132,0.000019106828,0.0006567046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920267,0.000021761693,0.00027196645,0.00017105174,0.000105590865,0.00022695304],"domain_scores_gemma":[0.9991439,0.00023382736,0.00013606549,0.00030743465,0.00013300942,0.000045751676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021106697,0.000117137235,0.00019211603,0.00004761622,0.0003181812,0.000012572727,0.00017655811,0.00007312134,0.000026480437],"category_scores_gemma":[0.00007643499,0.00011894968,0.00009011592,0.00037192696,0.000059829337,0.000060440692,0.000024473393,0.00007201397,0.000006416106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000127114645,0.0003127737,0.00044249158,0.000032704418,0.00002254385,2.2692902e-7,0.000066522334,0.0000019447068,0.0077630864,0.9205502,0.070766576,0.00002817374],"study_design_scores_gemma":[0.0005103786,0.0000837504,0.00008577055,0.00001626892,0.000055634646,0.0000012876642,0.00007832975,0.00010925092,0.015066472,0.9729289,0.010939019,0.00012494199],"about_ca_topic_score_codex":0.000048239293,"about_ca_topic_score_gemma":0.000005126232,"teacher_disagreement_score":0.059827555,"about_ca_system_score_codex":0.000026789843,"about_ca_system_score_gemma":0.000023306144,"threshold_uncertainty_score":0.48506275},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9991763,0.00009843107,0.00025647308,0.00013724287,0.000114601055,0.00007803049,0.0000078339,0.000014747624,0.00011631054],"genre_scores_gemma":[0.9966901,0.00000931391,0.0032585957,0.00002933037,0.000003773798,6.531754e-7,3.1819982e-7,0.0000036907222,0.0000042500765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993841,0.000065531705,0.00017314516,0.00013127564,0.0001520468,0.00009388892],"domain_scores_gemma":[0.99899334,0.000425336,0.00012542885,0.00036170252,0.00006832205,0.00002584671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017771451,0.00007896663,0.00015678133,0.0000578642,0.00004226505,0.000007216479,0.00041960756,0.00003974523,0.0000065464687],"category_scores_gemma":[0.00007293113,0.000055935303,0.000053653966,0.00022236636,0.00013165621,0.00007069908,0.00011833831,0.00009003663,4.2597037e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029664692,0.0000853351,0.0012591253,0.000013724739,0.000025413974,2.7073784e-7,0.0008597786,0.00030788776,0.009522982,0.98635185,0.00006575474,0.0014781918],"study_design_scores_gemma":[0.0013727219,0.0007824576,0.004567897,0.00009485886,0.000023265804,0.000005818972,0.00011183337,0.035272114,0.42026398,0.53698194,0.00033451087,0.00018860126],"about_ca_topic_score_codex":0.000007525641,"about_ca_topic_score_gemma":0.0000022741606,"teacher_disagreement_score":0.44936994,"about_ca_system_score_codex":0.0000033478823,"about_ca_system_score_gemma":0.000015689362,"threshold_uncertainty_score":0.22809754},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97999334,0.00030582366,0.014662155,0.000049325197,0.00043515253,0.00064460206,0.000012703726,0.00097188755,0.0029249825],"genre_scores_gemma":[0.9935407,0.00007307703,0.0060907253,0.00002039123,0.000008400294,0.000121362325,0.000004514693,0.000038771526,0.00010202469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995088,0.000011559987,0.00011100104,0.0001245419,0.000068005706,0.00017609437],"domain_scores_gemma":[0.9996591,0.00005800126,0.000018670813,0.0001457895,0.000051955172,0.000066434404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048739512,0.0001202966,0.00014702564,0.00007439935,0.000114611204,0.000019641331,0.00006409534,0.00007708788,0.0000133042395],"category_scores_gemma":[0.000008636137,0.000115314826,0.00002405934,0.00017125237,0.000094990224,0.000104306884,0.000008290381,0.00008007154,0.0000045058027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026043007,0.0004896317,0.077471115,0.00058125425,0.0009867348,0.00028283606,0.0064060763,0.00073370134,0.067807354,0.6402755,0.1766708,0.028034575],"study_design_scores_gemma":[0.020018898,0.0045714444,0.062015776,0.00047599987,0.0005552907,0.0033039083,0.0014935489,0.032157484,0.1892842,0.60097086,0.07996244,0.0051901634],"about_ca_topic_score_codex":0.000010741121,"about_ca_topic_score_gemma":0.0000059196464,"teacher_disagreement_score":0.12147686,"about_ca_system_score_codex":0.000023397557,"about_ca_system_score_gemma":0.00002025715,"threshold_uncertainty_score":0.4702402},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9895777,0.00010551126,0.00044151398,0.0037683959,0.0015023317,0.00014446872,6.287518e-7,0.000117694995,0.004341758],"genre_scores_gemma":[0.998706,0.000019840578,0.00048228708,0.0006109366,6.701371e-7,0.000010318977,5.029952e-7,0.000006736956,0.00016269716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989536,0.00009008954,0.00020040957,0.00023933683,0.000299958,0.00021664516],"domain_scores_gemma":[0.99873567,0.0002585639,0.00009315049,0.00075035286,0.00010414607,0.000058118934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041609572,0.0001111047,0.00013718643,0.00008926504,0.0001309299,0.00004364031,0.0007676147,0.000050019768,0.000011448016],"category_scores_gemma":[0.000073751835,0.000074066644,0.00007915254,0.00075149705,0.000070220056,0.00010005878,0.00012348864,0.0001308715,0.000044076278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005876963,0.00009572156,0.0005909931,0.000002944837,0.000007718204,0.0000072444122,0.000249297,0.000029149849,0.00059990434,0.9947903,0.0015176581,0.00210318],"study_design_scores_gemma":[0.00035508935,0.00012297847,0.0008222512,0.00002943158,0.0000036398028,0.000005523331,0.000013188951,0.0019534612,0.0037636927,0.99145114,0.0013781468,0.00010143791],"about_ca_topic_score_codex":0.00006234966,"about_ca_topic_score_gemma":0.0000025869474,"teacher_disagreement_score":0.009128313,"about_ca_system_score_codex":0.0000101826445,"about_ca_system_score_gemma":0.000031726406,"threshold_uncertainty_score":0.302035},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8245782,0.00073036517,0.012804635,0.006327472,0.010403412,0.00083425065,0.0000045460692,0.00085676904,0.14346032],"genre_scores_gemma":[0.9967723,0.0000387904,0.0022741028,0.00013737574,0.0000027704552,0.00001107611,0.0000031824345,0.000004447345,0.00075596164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992487,0.000032344917,0.00013051061,0.00022712885,0.00017783056,0.00018348556],"domain_scores_gemma":[0.99949855,0.000030821553,0.00003653726,0.00037943252,0.000019689413,0.00003498004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019694935,0.000075298405,0.00008145973,0.0001744317,0.000042827596,0.000119502,0.00066406844,0.000026693477,0.000040467985],"category_scores_gemma":[0.000022349175,0.00007774723,0.000025615218,0.00062778534,0.000015465523,0.0008799119,0.0001893252,0.00007316367,0.00025231548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.0400372e-7,0.00008234368,0.0010765669,0.000002758206,0.0000026001371,0.000021133777,0.00010662416,0.0000016293186,0.000014329194,0.95329666,0.00592631,0.039468747],"study_design_scores_gemma":[0.0010931866,0.00005564618,0.011261097,0.000013657178,0.0000024448839,0.0000019996717,0.000015925634,0.078982376,0.00023034068,0.9009845,0.007147978,0.00021079202],"about_ca_topic_score_codex":0.000014332373,"about_ca_topic_score_gemma":0.0000032642429,"teacher_disagreement_score":0.17219406,"about_ca_system_score_codex":0.000023572453,"about_ca_system_score_gemma":0.0000025046525,"threshold_uncertainty_score":0.3243089},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94782335,0.00009066292,0.01602256,0.0031870725,0.00017146683,0.00042359822,0.00003454758,0.00004141277,0.032205332],"genre_scores_gemma":[0.99953854,0.0000049464393,0.00015822724,0.00006504355,0.000023765173,0.00004190305,0.0000067983497,0.000009163321,0.00015161275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941486,0.000029107036,0.00015058795,0.0001220969,0.000096572614,0.0001867589],"domain_scores_gemma":[0.9979578,0.0016291974,0.00005416172,0.00027474514,0.00003272402,0.00005133378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003709157,0.000098816745,0.00011183359,0.000009542347,0.0005066657,0.00005342596,0.00015275643,0.000017851573,0.00011222881],"category_scores_gemma":[0.00004651395,0.00005286258,0.000054843567,0.00016760368,0.00020962048,0.000045786255,0.000066839806,0.00014575408,0.00003079269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001428236,0.000043658634,0.00017197999,0.0000018284378,0.000015681928,1.6324529e-7,0.000063569234,0.0000012709118,0.000036874742,0.99835235,0.00027580746,0.0010225072],"study_design_scores_gemma":[0.0003572838,0.000008305569,0.0004672197,0.000010496047,0.000018299079,8.256073e-7,0.00037469255,0.000067341694,0.0006556117,0.99361044,0.004357767,0.00007174528],"about_ca_topic_score_codex":0.000035047295,"about_ca_topic_score_gemma":5.496829e-7,"teacher_disagreement_score":0.05171519,"about_ca_system_score_codex":0.000012802959,"about_ca_system_score_gemma":0.000009112586,"threshold_uncertainty_score":0.3896914},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6646138,0.0009177898,0.000001924665,0.00046981502,0.003103906,0.00011535595,0.000004373741,0.000032843604,0.33074018],"genre_scores_gemma":[0.99163735,0.00003246418,0.000008469066,0.00008789874,0.000010028488,0.0000047904286,0.0000016963021,0.000007939114,0.008209373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937755,0.000060860777,0.00015382857,0.000096039694,0.00011577822,0.00019594515],"domain_scores_gemma":[0.99950904,0.0001209293,0.00006497687,0.0001937849,0.00007866796,0.000032582837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019165859,0.00007380886,0.000104472856,0.000030428928,0.00027230324,0.000022279437,0.00016638788,0.000021449538,0.00063243887],"category_scores_gemma":[0.000047875434,0.00004883113,0.000055589422,0.00003572751,0.0005768547,0.000056920464,0.000030641117,0.00008134399,0.000100902624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041823955,0.000029212948,0.0011906459,0.0000045163706,0.000011256098,0.0000018308582,0.0031143716,1.9451406e-7,0.000011912659,0.9890752,0.006300603,0.00025609887],"study_design_scores_gemma":[0.00019859373,0.000043503333,0.00016269897,0.000003040071,0.0000046483615,8.6036647e-7,0.0009537186,0.000004504626,0.0002461157,0.50056803,0.49776703,0.000047241247],"about_ca_topic_score_codex":0.000035222296,"about_ca_topic_score_gemma":0.00007596452,"teacher_disagreement_score":0.49146643,"about_ca_system_score_codex":0.000008739713,"about_ca_system_score_gemma":0.000028770355,"threshold_uncertainty_score":0.6924762},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9836775,0.00045408163,0.000029712506,0.00003348499,0.00274468,0.0003256319,0.000011512273,0.0006823513,0.012041015],"genre_scores_gemma":[0.99852556,0.00014751006,0.00010350647,0.000055654353,0.00003543167,0.00008115431,0.000022774257,0.00007032635,0.0009581102],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984561,0.00011698947,0.00038867295,0.00026997563,0.00032608194,0.00044216102],"domain_scores_gemma":[0.99920595,0.000046571055,0.00006759487,0.0004589129,0.00004245492,0.00017849202],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016427464,0.00029985522,0.00030743482,0.000119951204,0.00023225929,0.00003574127,0.00028345364,0.00012599459,0.00016893435],"category_scores_gemma":[0.000014544368,0.00030113044,0.000118511336,0.00023803119,0.000040292867,0.000118076125,0.000025857897,0.00023012454,0.00017639418],"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.0004202239,0.0017721223,0.038240913,0.00050007465,0.0016215256,0.00083256245,0.0058368775,0.010847183,0.12390703,0.3887154,0.42287263,0.0044334745],"study_design_scores_gemma":[0.040979955,0.0034705359,0.0768978,0.0020159055,0.00054451614,0.00045389123,0.0012193193,0.045112923,0.20544258,0.3395337,0.27487022,0.009458684],"about_ca_topic_score_codex":0.000026860822,"about_ca_topic_score_gemma":0.000014315389,"teacher_disagreement_score":0.14800243,"about_ca_system_score_codex":0.00018748143,"about_ca_system_score_gemma":0.00001814379,"threshold_uncertainty_score":0.9999441},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9709731,0.0001411508,0.026231328,0.00011671758,0.0010139978,0.0002900359,5.2887344e-7,0.00017679004,0.0010563671],"genre_scores_gemma":[0.9905214,0.000010702474,0.009284088,0.00006526273,0.0000045659617,0.000007742713,0.0000025724974,0.00002011259,0.0000835857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782765,0.0001488148,0.00034702674,0.0005039876,0.0005242399,0.00064831064],"domain_scores_gemma":[0.99856216,0.00032554928,0.000096364376,0.0007231226,0.00013085114,0.00016195142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00216291,0.00018255755,0.00021954041,0.00048326817,0.00013940205,0.00010606079,0.0009865257,0.00010565681,0.000011285841],"category_scores_gemma":[0.00019818167,0.00019321423,0.000063520776,0.0015191442,0.00008302002,0.0009778946,0.00032617906,0.00034806004,0.000069403686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002574506,0.000088246634,0.08287531,0.000008109226,0.0000101694295,0.000054048218,0.0005471128,0.000401401,0.0016781641,0.9115806,0.00004441305,0.0026866512],"study_design_scores_gemma":[0.0010034125,0.000052294774,0.045776147,0.000033868542,0.0000020925095,0.000007286979,0.000040537623,0.022638643,0.0055538956,0.92446405,0.00018721269,0.00024055598],"about_ca_topic_score_codex":0.00002899542,"about_ca_topic_score_gemma":0.000020120864,"teacher_disagreement_score":0.03709916,"about_ca_system_score_codex":0.00013143143,"about_ca_system_score_gemma":0.00005067666,"threshold_uncertainty_score":0.7879048},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95775115,0.000022016924,0.005473201,0.000999387,0.00015491022,0.0002812379,0.000019677189,0.000029641129,0.03526877],"genre_scores_gemma":[0.99733,0.000005044601,0.0010810978,0.00006581479,0.000013359302,0.00006284766,0.000007907069,0.000012056116,0.0014218685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941766,0.000024687344,0.00017147335,0.00012430518,0.00011313134,0.00014872605],"domain_scores_gemma":[0.9991817,0.00027130844,0.00008840597,0.0003507549,0.00006959429,0.000038243674],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000088180044,0.00009724615,0.00013815894,0.000012107638,0.000110373716,0.0000133933445,0.00020028645,0.000018855255,0.00095110654],"category_scores_gemma":[0.00002139815,0.000064977976,0.00005922637,0.00023402358,0.00007194017,0.000040263694,0.00004185323,0.00009000927,0.00008219548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007456111,0.00009205076,0.00016074404,0.0000025795828,0.000015866251,2.3948158e-7,0.000035791545,0.00005732669,0.00072789955,0.9975841,0.0006985482,0.00061737356],"study_design_scores_gemma":[0.00026352474,0.000022285763,0.000023691837,0.000011351336,0.00000896819,3.7148482e-7,0.00007533575,0.0002525818,0.0026702993,0.9907779,0.005816003,0.00007765426],"about_ca_topic_score_codex":0.000021300477,"about_ca_topic_score_gemma":1.3115853e-7,"teacher_disagreement_score":0.039578848,"about_ca_system_score_codex":0.000009355053,"about_ca_system_score_gemma":0.000017810162,"threshold_uncertainty_score":0.99996215},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98578364,0.000042096624,0.000345605,0.00027573487,0.00038816925,0.00020666566,0.000003193331,0.000085946514,0.012868977],"genre_scores_gemma":[0.9924202,0.00001989364,0.00623614,0.00019008703,0.0000069746884,0.000017723776,0.000002720839,0.000028394159,0.001077853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990476,0.00009760403,0.00022508703,0.00020965874,0.00017021061,0.00024983514],"domain_scores_gemma":[0.9989551,0.00032794467,0.000108017026,0.00041891125,0.000095097406,0.000094984716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021504915,0.00014826737,0.000290187,0.0000926728,0.000077197394,0.0000067516767,0.00020857273,0.00009079687,0.00011902517],"category_scores_gemma":[0.0001950554,0.0001239067,0.000057529734,0.0003563958,0.00013951816,0.00008167821,0.000041291427,0.00013584488,0.000021901777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002864137,0.00013660594,0.0052653546,0.00001584316,0.000056877514,0.000039280552,0.00042587222,0.000012014631,0.000667448,0.9898857,0.0030844507,0.00012416617],"study_design_scores_gemma":[0.0010037024,0.00024401936,0.00077224645,0.000030507275,0.000030001667,0.000023425715,0.00019906844,0.000003755973,0.004301385,0.99120843,0.0020211912,0.00016224291],"about_ca_topic_score_codex":0.000018151148,"about_ca_topic_score_gemma":0.0000398726,"teacher_disagreement_score":0.011791124,"about_ca_system_score_codex":0.000028814418,"about_ca_system_score_gemma":0.000034155968,"threshold_uncertainty_score":0.50527686},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8608699,0.0000118152375,0.00007031139,0.00041012253,0.0001477086,0.0004946906,0.000006855669,0.00014332104,0.13784528],"genre_scores_gemma":[0.9927177,0.00001418365,0.0034749794,0.00005805139,0.000010909483,0.00014442384,0.0000021113929,0.0000384687,0.0035392097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900323,0.000035157693,0.00024424176,0.00021091988,0.0002846178,0.00022181911],"domain_scores_gemma":[0.9985043,0.00063592335,0.00015692545,0.0005468782,0.00006193627,0.000094069146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012475258,0.00017141114,0.00023809704,0.000043952172,0.00014379418,0.000039781426,0.00018699719,0.000056265108,0.00071753556],"category_scores_gemma":[0.00014128198,0.00013176439,0.000045629,0.00021419663,0.00005480958,0.00005516344,0.000029248828,0.00013296348,0.00051032106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033450492,0.0004246723,0.000027095122,0.000049206807,0.000031857326,0.000004576869,0.00049552694,0.0000014121364,0.000023904688,0.9174294,0.08136301,0.00014600174],"study_design_scores_gemma":[0.00069653767,0.00019097848,0.00010372767,0.00011844039,0.00003598372,0.000005664261,0.000072303075,0.0013563771,0.00043785188,0.9958666,0.000928884,0.0001866274],"about_ca_topic_score_codex":0.000006836194,"about_ca_topic_score_gemma":0.000007355232,"teacher_disagreement_score":0.13430607,"about_ca_system_score_codex":0.000045026518,"about_ca_system_score_gemma":0.00001073946,"threshold_uncertainty_score":0.78565115},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97087455,0.00009779784,0.019631581,0.0012586103,0.0014517689,0.0003107239,0.0000010842099,0.00011879959,0.006255087],"genre_scores_gemma":[0.99556035,0.000034055633,0.004212432,0.000038376904,0.0000024158003,0.000017682394,4.767411e-7,0.0000067091078,0.00012749573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897546,0.00008733115,0.0001674462,0.00018870523,0.00034773542,0.00023330616],"domain_scores_gemma":[0.998856,0.00022223522,0.000083992294,0.0006077033,0.00016853618,0.00006150937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054122554,0.000080779304,0.00009440196,0.00006183052,0.00019287807,0.000049249324,0.0009473074,0.000037522812,0.0000041224366],"category_scores_gemma":[0.00014126718,0.00006102598,0.0000641795,0.00076384505,0.00019556149,0.00036714645,0.00021505528,0.0001340845,0.00006680221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009248284,0.000047706202,0.00046634118,0.0000035307328,0.000009439128,0.0000040423893,0.00027899918,0.000032544747,0.0004304295,0.99619806,0.00015942579,0.0023602194],"study_design_scores_gemma":[0.00073961914,0.00004235336,0.00079229655,0.000009732862,0.0000016372965,0.0000066755833,0.000035668952,0.00016843225,0.007077805,0.99048835,0.00056817045,0.00006925651],"about_ca_topic_score_codex":0.000018007568,"about_ca_topic_score_gemma":0.00001278915,"teacher_disagreement_score":0.024685808,"about_ca_system_score_codex":0.00004874397,"about_ca_system_score_gemma":0.00006895294,"threshold_uncertainty_score":0.24885672},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9774306,0.0006154789,0.0027285723,0.0031705226,0.0027658066,0.0007092076,0.00001220431,0.0002368977,0.012330742],"genre_scores_gemma":[0.99837285,0.000012206575,0.00065594533,0.00062749017,0.0000073259102,0.00004251104,8.533128e-7,0.000009045088,0.00027178752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990843,0.00006849553,0.00017030798,0.00024647443,0.00020988293,0.00022052317],"domain_scores_gemma":[0.9983961,0.0007099339,0.000091225826,0.00070955517,0.000050481427,0.000042689804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003638995,0.00011642837,0.00015403918,0.00004169087,0.00015733937,0.00006659274,0.0010251813,0.000042766475,0.000053366166],"category_scores_gemma":[0.00013794878,0.00007992737,0.00010171521,0.00022835271,0.00008292091,0.0001421971,0.00011284151,0.000093009745,0.00007222381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037000125,0.000078301615,0.000043430642,0.000010347578,0.000008862297,0.0000018528713,0.0004473208,0.0000034511947,0.000362592,0.9871777,0.008165914,0.0036965194],"study_design_scores_gemma":[0.0006075105,0.00038170503,0.0003119514,0.00004540884,0.0000062408035,0.0000070237857,0.000042281372,0.019168084,0.005082575,0.9697702,0.0044152313,0.00016181708],"about_ca_topic_score_codex":0.0000045137153,"about_ca_topic_score_gemma":2.466814e-7,"teacher_disagreement_score":0.020942267,"about_ca_system_score_codex":0.000020225736,"about_ca_system_score_gemma":0.000012333053,"threshold_uncertainty_score":0.32593435},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9957901,0.00013310924,0.00010556524,0.00015587245,0.0001438769,0.0002609306,0.000007845918,0.000034042274,0.0033686215],"genre_scores_gemma":[0.99896175,0.0000111665495,0.0005006626,0.000013143809,0.000003363436,0.00003440171,0.0000042564766,0.0000111664485,0.0004601208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957657,0.000014965202,0.0001558597,0.00010351215,0.000058793183,0.00009031023],"domain_scores_gemma":[0.9992314,0.000429052,0.00006029174,0.00018465871,0.000054196364,0.000040379025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010677973,0.00006437306,0.00013197343,0.00003661536,0.00006456548,0.0000057148704,0.00007681068,0.00006829653,0.00008418424],"category_scores_gemma":[0.00020251391,0.0000623486,0.000041194293,0.0001554041,0.00006947923,0.00003855169,0.00001832363,0.000064053085,0.000011738984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013252651,0.00013635313,0.0006418035,0.000018813924,0.000018475142,9.363144e-8,0.00024878437,1.3059791e-7,0.0011702316,0.9900992,0.0073096734,0.00034322345],"study_design_scores_gemma":[0.0010420382,0.000034608383,0.0003975917,0.000013183475,0.000037565373,0.0000014978042,0.000026913689,0.0005005514,0.0014764853,0.99516565,0.0012369287,0.000066967135],"about_ca_topic_score_codex":0.0000010401433,"about_ca_topic_score_gemma":6.226815e-7,"teacher_disagreement_score":0.0060727443,"about_ca_system_score_codex":0.000008235319,"about_ca_system_score_gemma":0.0000056975177,"threshold_uncertainty_score":0.2542502},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7870014,0.0046476675,0.087865755,0.015957512,0.024799794,0.00093770603,0.000012019933,0.0016674376,0.07711073],"genre_scores_gemma":[0.992793,0.000025946554,0.0051242453,0.0005044044,0.0000189904,0.000013336601,0.0000037105171,0.000007450624,0.0015088792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891055,0.000065977314,0.00020166505,0.00029668663,0.00030665856,0.0002184743],"domain_scores_gemma":[0.9989951,0.00011713947,0.000068670626,0.000628107,0.00008452196,0.000106452375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019806914,0.000117209995,0.00013440178,0.00017473489,0.0001522432,0.00013136685,0.0008339411,0.00005469426,0.000120600795],"category_scores_gemma":[0.00010660363,0.00012012583,0.00008516729,0.0008130728,0.000023892298,0.0004430156,0.00018649024,0.0001006221,0.00028106786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016353458,0.000086763015,0.00013804353,0.0000026722778,0.000011155403,0.000009014194,0.00015023482,0.000032018477,0.000161213,0.9544109,0.027404727,0.017591588],"study_design_scores_gemma":[0.0013416011,0.000112588496,0.0013978628,0.000006201541,0.000005281343,0.000019089697,0.000005299152,0.035629284,0.0015283102,0.9447059,0.015038981,0.00020958214],"about_ca_topic_score_codex":0.0000063508305,"about_ca_topic_score_gemma":0.0000010810949,"teacher_disagreement_score":0.20579167,"about_ca_system_score_codex":0.000026667945,"about_ca_system_score_gemma":0.000019247645,"threshold_uncertainty_score":0.4898589},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97915083,0.0013676578,0.0000073877945,0.00006603699,0.00044184775,0.0001231252,0.0000019044962,0.0001897793,0.018651426],"genre_scores_gemma":[0.9990585,0.00009249894,0.000011741213,0.000012409504,0.00000933638,0.000021163447,0.0000019049199,0.00002281488,0.0007696661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943197,0.00006807684,0.0001233814,0.00010806576,0.000088613226,0.00017989473],"domain_scores_gemma":[0.99942046,0.00023836635,0.000015230111,0.00025619543,0.000015916863,0.000053837044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024927652,0.00011883875,0.00010313159,0.000018043,0.00026759438,0.000058685113,0.0001237033,0.00005454463,0.000027593469],"category_scores_gemma":[0.000010998559,0.00007512922,0.000025321513,0.00014507836,0.00009314185,0.000095726,0.000007793013,0.00015114744,0.00004856052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032319578,0.00001787858,0.014694085,0.000026653945,0.00007364611,0.0000049179034,0.0014293727,0.0004673502,0.000069375805,0.97574997,0.001678962,0.0057554776],"study_design_scores_gemma":[0.0006922401,0.00009526676,0.04388678,0.000057185185,0.00002195263,0.0000337332,0.000458614,0.0012620252,0.00046657838,0.9321825,0.020574506,0.00026864503],"about_ca_topic_score_codex":0.0000052656346,"about_ca_topic_score_gemma":0.0000049856953,"teacher_disagreement_score":0.04356749,"about_ca_system_score_codex":0.00001418242,"about_ca_system_score_gemma":0.0000061234514,"threshold_uncertainty_score":0.30636805},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97714436,0.00014116555,0.009254913,0.00039925476,0.0034614615,0.00020812043,0.0000025033503,0.00015965589,0.009228558],"genre_scores_gemma":[0.9995204,0.0000083676805,0.00025493448,0.00008837484,0.000013854242,0.000011781652,0.0000011475404,0.000008198681,0.00009290719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880123,0.00015289067,0.0002958699,0.0002918559,0.00022085753,0.00023727253],"domain_scores_gemma":[0.9989925,0.00020015423,0.000120523495,0.00041189438,0.00019467209,0.000080265745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023152465,0.00013502018,0.00025668746,0.000121372395,0.00008061966,0.000040494793,0.0004583877,0.000092129754,0.000012019306],"category_scores_gemma":[0.00003735612,0.00012927756,0.00011295713,0.0005822149,0.000045904653,0.0003160842,0.00005756538,0.00014831204,0.00001738593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011811205,0.00015979962,0.00079288986,0.000008191167,0.000038680846,0.0000047815615,0.0007805773,0.00006530663,0.0011377851,0.99043036,0.0013917529,0.0051780655],"study_design_scores_gemma":[0.0058844993,0.0012422178,0.04245285,0.00023606575,0.000048729915,0.00009731327,0.00025537095,0.3305272,0.04076482,0.56797457,0.009337779,0.0011785927],"about_ca_topic_score_codex":0.00010044826,"about_ca_topic_score_gemma":0.00002683415,"teacher_disagreement_score":0.4224558,"about_ca_system_score_codex":0.000050267507,"about_ca_system_score_gemma":0.000049091723,"threshold_uncertainty_score":0.5271786},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94877034,0.0001679267,0.00009622488,0.000004940054,0.0016598227,0.00010347967,0.0000027456672,0.00014066369,0.049053866],"genre_scores_gemma":[0.99981135,0.0000058004657,0.000023993509,0.000013374502,0.00000587523,0.0000039213082,0.0000022216498,0.000022891178,0.000110560744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992847,0.000027040289,0.0002470239,0.00010596273,0.00014185788,0.00019343193],"domain_scores_gemma":[0.99943775,0.00023042018,0.000024718342,0.0002091479,0.000033780318,0.00006417529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042598342,0.000118667645,0.00019274864,0.00009372235,0.000033514825,0.0000061469063,0.000119999306,0.000089267836,0.000030295107],"category_scores_gemma":[0.000037271995,0.00011793673,0.000063509826,0.0001920717,0.000050036106,0.00006128391,0.000011365541,0.00014641682,0.000047570702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002202225,0.00003685234,0.003668967,0.000037631882,0.000051937364,0.00001034569,0.00033253222,0.00016503851,0.0045936317,0.98977774,0.0008042558,0.00049904996],"study_design_scores_gemma":[0.0007170371,0.00024855154,0.030853024,0.00015177584,0.000025021369,0.000008985582,0.00039450332,0.00034355003,0.13748632,0.82719004,0.0022006184,0.0003805646],"about_ca_topic_score_codex":0.000004564676,"about_ca_topic_score_gemma":0.0000018123342,"teacher_disagreement_score":0.16258769,"about_ca_system_score_codex":0.000028643293,"about_ca_system_score_gemma":0.00000569388,"threshold_uncertainty_score":0.48093203},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97704315,0.00006190893,0.0011307544,0.001987457,0.00014963475,0.00023566671,0.000013337164,0.00003856207,0.019339534],"genre_scores_gemma":[0.998921,0.000011293768,0.00043281182,0.0000802277,0.000022566568,0.000051081424,0.0000035404469,0.000010274385,0.0004672251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949336,0.000017381344,0.00011170549,0.00014006066,0.000090753165,0.0001467415],"domain_scores_gemma":[0.99920857,0.00042643072,0.00004765091,0.00023803092,0.000025434876,0.000053903634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000065722954,0.0001025102,0.00011258002,0.000010176859,0.000329089,0.00002112662,0.00011849271,0.000018207666,0.00017304142],"category_scores_gemma":[0.000019793955,0.00006508116,0.000038929556,0.00010091849,0.0001590019,0.000048991456,0.00004342573,0.00011281948,0.00009387083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020030418,0.000049985098,0.00073238957,0.0000020980265,0.000010508596,6.8824863e-7,0.00012441695,0.0000040793725,0.000088444816,0.9980216,0.00043335924,0.0005304309],"study_design_scores_gemma":[0.00014677733,0.000023530394,0.00027023928,0.000008526491,0.0000066188177,0.0000021884762,0.00013787276,0.000057598794,0.0017844341,0.9929173,0.0045569465,0.0000879875],"about_ca_topic_score_codex":0.00002082871,"about_ca_topic_score_gemma":1.3247254e-7,"teacher_disagreement_score":0.021877835,"about_ca_system_score_codex":0.000007888195,"about_ca_system_score_gemma":0.00001545267,"threshold_uncertainty_score":0.2653933},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844158,0.00043303918,0.00003170048,0.000035056357,0.0006582265,0.00015353737,0.0000015757423,0.00028839908,0.013982635],"genre_scores_gemma":[0.99927676,0.000058979378,0.000118901386,0.000048243666,0.0000124033195,0.000022057755,0.0000015252895,0.000038475402,0.0004226633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992549,0.000042276453,0.0001436972,0.00016877709,0.00012013951,0.0002702158],"domain_scores_gemma":[0.9994766,0.00011079544,0.000022433582,0.00024874642,0.00002461402,0.00011678934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001657102,0.00017256942,0.00018978423,0.000038368686,0.000064792504,0.000042615156,0.000117716205,0.000078177465,0.000025626105],"category_scores_gemma":[0.000013715251,0.00015468318,0.000029866262,0.00017031899,0.000046482113,0.000102391576,0.000016324104,0.00012981646,0.000039246268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021883297,0.00021322747,0.023465764,0.00026166116,0.00058456697,0.00045113347,0.0026741866,0.0011320368,0.016766412,0.94535154,0.0075629875,0.0013176776],"study_design_scores_gemma":[0.00834653,0.0009021056,0.020356,0.0003491212,0.0002401681,0.00094869593,0.0009767896,0.0014697516,0.010379087,0.80389404,0.14995049,0.0021871922],"about_ca_topic_score_codex":0.000013713847,"about_ca_topic_score_gemma":0.00000589251,"teacher_disagreement_score":0.1423875,"about_ca_system_score_codex":0.000022385062,"about_ca_system_score_gemma":0.0000070667834,"threshold_uncertainty_score":0.6307797},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99721235,0.00005732151,0.00004262515,0.0004776073,0.00024048824,0.00042587426,0.000012985647,0.00008712438,0.0014436478],"genre_scores_gemma":[0.99707186,0.00001222059,0.0024693657,0.000078143436,0.000008872201,0.00014731048,0.000028296725,0.000017774226,0.00016614734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936736,0.000035525663,0.00020175015,0.00015268619,0.00007493985,0.00016771784],"domain_scores_gemma":[0.9993681,0.00024229575,0.00006416387,0.00022239905,0.00006072363,0.00004236878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021715515,0.00009423879,0.00014021428,0.00009409117,0.00008966304,0.0000150700325,0.000119646415,0.000071812545,0.000050515482],"category_scores_gemma":[0.00006422434,0.00009445157,0.000056867262,0.00028727145,0.000039999875,0.00009006632,0.000014639765,0.00008347154,0.00004364736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028289252,0.00025788005,0.00036421436,0.000017950826,0.000011625115,3.7193746e-7,0.00018906969,5.565384e-7,0.00039848126,0.99323064,0.0049402076,0.0005607385],"study_design_scores_gemma":[0.00080921646,0.000047229994,0.00072261057,0.00002063091,0.00001625176,0.0000015568381,0.000051578805,0.00015119121,0.0036073169,0.9873379,0.007123145,0.0001113561],"about_ca_topic_score_codex":0.0000036657711,"about_ca_topic_score_gemma":0.0000178457,"teacher_disagreement_score":0.005892699,"about_ca_system_score_codex":0.000027130787,"about_ca_system_score_gemma":0.000016149574,"threshold_uncertainty_score":0.38516232},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9536368,0.00012352092,0.0007418216,0.00003604712,0.000369907,0.00031435007,0.000007952955,0.00015684812,0.04461271],"genre_scores_gemma":[0.9819369,0.000025029689,0.013003716,0.00001862876,0.000004091131,0.00008791854,0.0000023228504,0.000045017834,0.004876384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864304,0.00009013198,0.00041547988,0.00019413976,0.00035957634,0.00029765247],"domain_scores_gemma":[0.99848264,0.00059005676,0.00021126353,0.00043654614,0.00019288684,0.00008657496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022184386,0.00018426047,0.00038138652,0.00005742585,0.00012023251,0.000048065376,0.00015747779,0.00006446245,0.0005034503],"category_scores_gemma":[0.00095200574,0.00016318569,0.000084505904,0.00025959316,0.00021703585,0.00035112968,0.000048723054,0.00013681546,0.00007601446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057886127,0.00022574213,0.0029209836,0.00025941266,0.00005939153,0.000010300682,0.0006174161,0.0000024853073,0.00009507033,0.99248904,0.0033117218,0.0000026658945],"study_design_scores_gemma":[0.00061362225,0.000045823726,0.000099276345,0.00021785483,0.0000763,0.000041212235,0.0010484462,0.0000070119895,0.0048216213,0.9926338,0.00020107819,0.00019393161],"about_ca_topic_score_codex":0.000008515175,"about_ca_topic_score_gemma":0.000021757756,"teacher_disagreement_score":0.039736327,"about_ca_system_score_codex":0.00004787639,"about_ca_system_score_gemma":0.000059368467,"threshold_uncertainty_score":0.6654519},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97484523,0.00021993468,0.000026951351,0.000001265094,0.0011542569,0.00007818863,0.0000044797607,0.00008527104,0.02358445],"genre_scores_gemma":[0.9998283,0.000013597385,0.0000864756,0.0000024029093,0.0000026747596,0.000005651979,0.000001175722,0.000019909343,0.000039824536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938756,0.000021801317,0.00026878697,0.000080885766,0.00010281795,0.00013813867],"domain_scores_gemma":[0.9995963,0.00003135478,0.0000697007,0.00021798378,0.00004569587,0.000038939917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018598215,0.000098729295,0.00022786827,0.00008049681,0.000014704501,0.000002843718,0.00017203657,0.000067788234,0.000077120145],"category_scores_gemma":[0.000017385273,0.00009821866,0.00008085988,0.00018050933,0.000053005762,0.00007679381,0.00001853132,0.00006809947,0.000011896026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002280138,0.00006555209,0.0069802934,0.0002458723,0.00008532966,0.000003246213,0.0031515437,0.0000124769695,0.018377168,0.96991676,0.00057074294,0.0005681898],"study_design_scores_gemma":[0.00063204346,0.000112003545,0.005365003,0.000109639164,0.000027058128,0.0000044262138,0.00044759936,0.00014754596,0.26785398,0.72453105,0.0005901272,0.00017952516],"about_ca_topic_score_codex":0.000025181242,"about_ca_topic_score_gemma":8.0616877e-7,"teacher_disagreement_score":0.24947679,"about_ca_system_score_codex":0.000008482967,"about_ca_system_score_gemma":0.000005242828,"threshold_uncertainty_score":0.40052408},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99551105,0.0001737032,0.00012876537,0.0004538094,0.0009794595,0.00022685621,0.000022341743,0.00013183027,0.0023721715],"genre_scores_gemma":[0.99874604,0.000010052186,0.00080264156,0.000257146,0.000033509492,0.000026023847,0.000010060591,0.000025612839,0.00008891981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998668,0.000053809857,0.00019832532,0.00035330668,0.00032237187,0.00040417307],"domain_scores_gemma":[0.9994089,0.000024250761,0.000071250644,0.00028256417,0.00007794718,0.000135102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014471545,0.00021236119,0.00023832425,0.000025623118,0.0002016635,0.00013321871,0.00026733507,0.000064496875,0.0003773988],"category_scores_gemma":[0.00001399985,0.00014986293,0.000054230954,0.00012415498,0.00018641094,0.00026805795,0.0000522013,0.00013197333,0.0002014795],"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.00048725767,0.00012633696,0.00024553263,0.00003379372,0.00003279377,0.00011523347,0.00278129,0.00090619153,0.34527197,0.6490855,0.00026661382,0.0006474782],"study_design_scores_gemma":[0.004284343,0.00079603976,0.0011083825,0.00010779155,0.000047814832,0.00006201461,0.00017918555,0.000031057283,0.5548423,0.43385422,0.0041231993,0.00056364445],"about_ca_topic_score_codex":0.0007093055,"about_ca_topic_score_gemma":0.00007053995,"teacher_disagreement_score":0.2152313,"about_ca_system_score_codex":0.00005763823,"about_ca_system_score_gemma":0.000088872854,"threshold_uncertainty_score":0.6111233},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98981833,0.00004823366,0.000113526985,0.0006295322,0.00096597866,0.00023343727,0.000004593566,0.00004387826,0.008142483],"genre_scores_gemma":[0.998988,0.000006597048,0.00036755973,0.000030775125,0.000013237959,0.000017681912,0.0000019233673,0.000012903454,0.0005613557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998795,0.0001024895,0.00034512114,0.00015782967,0.00042919826,0.00017039927],"domain_scores_gemma":[0.99770725,0.0014313026,0.00016728764,0.00047817174,0.00017674199,0.000039237682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009058022,0.00009677976,0.00016830568,0.0000515436,0.00015078769,0.00002605471,0.00028073462,0.000072326446,0.00012662861],"category_scores_gemma":[0.0023097938,0.000073073265,0.00006796754,0.00031847312,0.000102071164,0.00012332885,0.00007489659,0.00015583604,0.000042466145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038278402,0.00014219084,0.007413805,0.000018981435,0.000025690986,0.0000018173097,0.00027980987,0.000010232344,0.0013019228,0.98902863,0.0014430659,0.00029558895],"study_design_scores_gemma":[0.00045622487,0.000048176993,0.008853371,0.000023764953,0.00001963125,0.0000115905805,0.0001543882,0.00012360314,0.0014795432,0.98779935,0.0009478573,0.00008247643],"about_ca_topic_score_codex":0.00007813852,"about_ca_topic_score_gemma":0.000038263912,"teacher_disagreement_score":0.00916963,"about_ca_system_score_codex":0.00008271033,"about_ca_system_score_gemma":0.000092454065,"threshold_uncertainty_score":0.29798412},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93953454,0.00055523764,0.012591602,0.0003977795,0.012309672,0.0003377023,0.0000011903808,0.00033750205,0.033934742],"genre_scores_gemma":[0.99835753,0.000018057712,0.00056051783,0.00013726996,0.000025623085,0.000020726287,7.0603414e-7,0.000013317511,0.00086622237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998382,0.00029554375,0.00027303045,0.0004845865,0.00021093935,0.0003539028],"domain_scores_gemma":[0.9987242,0.00027489083,0.00011025664,0.0005941836,0.00014090593,0.00015556425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004474246,0.00018601619,0.00025084597,0.000110459594,0.00024393287,0.00022344991,0.00038471253,0.00013085963,0.000015943599],"category_scores_gemma":[0.00022013737,0.00017680688,0.00006511484,0.00053502095,0.000049524228,0.0003993147,0.00011829107,0.0002090083,0.000055166875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043862196,0.000073006115,0.002345456,0.000009163157,0.000020028416,0.00001604157,0.0002614788,0.0000043111413,0.0002971942,0.985198,0.009407981,0.0023629246],"study_design_scores_gemma":[0.0040935683,0.00081499276,0.035374332,0.00013612697,0.000029230994,0.0003814695,0.00023486833,0.025094708,0.0042038066,0.8431521,0.08516076,0.0013240193],"about_ca_topic_score_codex":0.000046650108,"about_ca_topic_score_gemma":0.000011054011,"teacher_disagreement_score":0.14204592,"about_ca_system_score_codex":0.000057774967,"about_ca_system_score_gemma":0.00006583749,"threshold_uncertainty_score":0.7209975},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69569564,0.00021246489,0.29878467,0.00011567757,0.0029171107,0.00021820972,0.0000747039,0.0001944047,0.0017871577],"genre_scores_gemma":[0.893913,0.000015742029,0.10595147,0.000039366816,0.0000071383556,0.000013602952,0.000015176557,0.0000117613945,0.000032754222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987941,0.000029927727,0.00034210717,0.00033885852,0.00025395607,0.00024109901],"domain_scores_gemma":[0.9987479,0.00005081026,0.00016947866,0.0008072097,0.00011617868,0.00010842202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009556076,0.00016536843,0.00028081777,0.000087139415,0.00014767883,0.000029338453,0.00041677058,0.00006397114,0.000011391397],"category_scores_gemma":[0.000033537028,0.00015555328,0.000090788395,0.00034239906,0.000110650755,0.00075915735,0.00018858745,0.00012909924,0.00003439939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004945334,0.000052699073,0.0015420096,0.000009539226,0.000027709424,0.0000064292385,0.0003346333,0.00008648539,0.0015468556,0.99473536,0.0001245806,0.0015287304],"study_design_scores_gemma":[0.0014060946,0.00009519902,0.0009682126,0.00009225765,0.000011244176,0.000018472343,0.00009335524,0.00033642843,0.010697431,0.9795872,0.0064472677,0.0002468457],"about_ca_topic_score_codex":0.00060602365,"about_ca_topic_score_gemma":0.00011255421,"teacher_disagreement_score":0.19821738,"about_ca_system_score_codex":0.000044363213,"about_ca_system_score_gemma":0.00010243865,"threshold_uncertainty_score":0.6343278},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98307866,0.000098915596,0.004606708,0.00020000357,0.0005951681,0.00016795904,8.3623996e-7,0.0000777261,0.011174045],"genre_scores_gemma":[0.9960585,0.00004795154,0.003650812,0.000043489064,0.000002203437,0.000017930462,6.3107075e-7,0.000010437192,0.0001680474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859726,0.00012230022,0.00024617044,0.0003108894,0.00034526997,0.00037812124],"domain_scores_gemma":[0.99889046,0.00015369078,0.00006771925,0.0007020506,0.00009665425,0.00008941384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046497915,0.00011460395,0.00019561853,0.00020571757,0.00004120557,0.000026326203,0.001026481,0.00005972957,0.000041466326],"category_scores_gemma":[0.00007769252,0.00011590534,0.00006697305,0.0016180949,0.000099682286,0.00040391547,0.0002912535,0.00020071439,0.000086564345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015625152,0.00014737688,0.060962066,0.00000684467,0.0000057756934,0.000071883245,0.00021851445,0.000009286667,0.00033890776,0.9334273,0.00009665287,0.0046997895],"study_design_scores_gemma":[0.00070655916,0.000052305382,0.009446759,0.000019829055,8.928023e-7,0.000025925541,0.000022390994,0.0004163343,0.0011511476,0.98744786,0.00058969617,0.00012028888],"about_ca_topic_score_codex":0.000038692266,"about_ca_topic_score_gemma":0.000008301919,"teacher_disagreement_score":0.054020595,"about_ca_system_score_codex":0.000035919154,"about_ca_system_score_gemma":0.00004535302,"threshold_uncertainty_score":0.4726483},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9325397,0.00019154257,0.00033309736,0.0015643144,0.0012511023,0.0012777833,0.000016061571,0.00040342635,0.06242299],"genre_scores_gemma":[0.99424154,0.000022747116,0.0007090105,0.00037118743,0.000030854317,0.00012602222,0.000010479688,0.000060479033,0.0044276672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979435,0.00014461417,0.00051650894,0.00040920428,0.00041094603,0.0005752053],"domain_scores_gemma":[0.99743927,0.00080145727,0.00021391289,0.0011811868,0.00018921262,0.00017499499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017432768,0.00030888445,0.00031070306,0.00011637143,0.00074915483,0.000082448045,0.0007623043,0.00017849052,0.00015186309],"category_scores_gemma":[0.00029883688,0.00018325422,0.00022357816,0.0005582138,0.00033609523,0.0001429724,0.00014831004,0.00046899696,0.00024182387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037890346,0.00036615154,0.00076347083,0.000027842621,0.00006227516,0.000009353103,0.00085048,5.1245155e-7,0.0005998581,0.9778213,0.018221265,0.0012395909],"study_design_scores_gemma":[0.0007746349,0.000067520166,0.0009966857,0.000031530803,0.0000723146,0.000019772482,0.0005386697,0.000026361085,0.003956016,0.95919746,0.03402933,0.00028968998],"about_ca_topic_score_codex":0.000036588885,"about_ca_topic_score_gemma":0.000048381633,"teacher_disagreement_score":0.06170187,"about_ca_system_score_codex":0.000046852438,"about_ca_system_score_gemma":0.000046300076,"threshold_uncertainty_score":0.74728906},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99613273,0.00052219303,0.000021221456,0.00008440237,0.0005782642,0.00051024684,0.00001169619,0.00010293169,0.0020362905],"genre_scores_gemma":[0.9983569,0.00012552533,0.0012862284,0.00009608495,0.000006723552,0.00003708262,0.0000082458255,0.000053168667,0.000030039948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819756,0.00012208203,0.0004260762,0.0004384769,0.00035118224,0.0004646232],"domain_scores_gemma":[0.9987865,0.00036639007,0.00010552089,0.0005268452,0.00006187701,0.00015286806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041812417,0.000359482,0.0005907773,0.00031106634,0.00027201133,0.000059073474,0.0003211827,0.00015194104,0.000018828125],"category_scores_gemma":[0.00007766303,0.0002790686,0.00012388517,0.00050431915,0.00039600595,0.00016348127,0.00012184148,0.0003475231,0.0000028063403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019127692,0.00013247241,0.024424275,0.000085503576,0.00009533603,0.00005951303,0.0013008498,0.000007995792,0.0002014212,0.97302145,0.0001082976,0.00037161438],"study_design_scores_gemma":[0.005675199,0.00017262854,0.015499897,0.000147879,0.00007719756,0.000057660924,0.00023322663,0.000011221486,0.0005249625,0.9771066,0.000109953515,0.0003835858],"about_ca_topic_score_codex":0.00009047485,"about_ca_topic_score_gemma":0.00014608019,"teacher_disagreement_score":0.008924378,"about_ca_system_score_codex":0.000044833225,"about_ca_system_score_gemma":0.00003613948,"threshold_uncertainty_score":0.99996614},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9962758,0.00015197991,0.000845126,0.0010216383,0.0009354803,0.00020793013,9.74107e-7,0.000119710625,0.00044140164],"genre_scores_gemma":[0.99899375,0.000022718794,0.0005141657,0.00042960272,0.0000013274788,0.0000066040434,0.000004548847,0.000008659944,0.000018606033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860907,0.00012711916,0.00032895975,0.00032300098,0.0003513433,0.00026050117],"domain_scores_gemma":[0.9984918,0.0005559793,0.00017162813,0.0005013663,0.00018214657,0.00009705277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011569933,0.00014204046,0.00016716872,0.00011044337,0.0002245323,0.000046320823,0.00020176599,0.000085616004,0.000010106705],"category_scores_gemma":[0.00016204314,0.00010146215,0.000046868925,0.00042322435,0.00010562295,0.00019678271,0.00012406938,0.00014475662,0.000025418134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002234349,0.00011343841,0.00040980623,0.000007958581,0.000009618917,0.000004466338,0.00025325714,0.000021449094,0.027839748,0.9693299,0.0012477817,0.000740221],"study_design_scores_gemma":[0.00066867436,0.00035244945,0.004462121,0.00011958779,0.000010257742,0.0000063140205,0.000027470742,0.0030443247,0.08678794,0.90429205,0.000089240566,0.0001395868],"about_ca_topic_score_codex":0.000029846868,"about_ca_topic_score_gemma":0.0000048010425,"teacher_disagreement_score":0.065037884,"about_ca_system_score_codex":0.000019030584,"about_ca_system_score_gemma":0.00001814107,"threshold_uncertainty_score":0.41375065},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938124,0.000040233273,0.00008402165,0.00004609829,0.00017018609,0.000113940834,0.000011050727,0.000016011056,0.0057060854],"genre_scores_gemma":[0.99925715,1.14282514e-7,0.00012099557,0.000002464646,0.000048373502,0.0000129802675,0.0000146495,0.000012243243,0.0005310384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991287,0.000031289685,0.00019425822,0.00016265221,0.0002063365,0.00027675566],"domain_scores_gemma":[0.99958426,0.000020859561,0.00006697326,0.00019362527,0.000081138,0.000053173986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047626963,0.00012193401,0.00018550945,0.00003236822,0.000085192274,0.00002402429,0.00019154359,0.000020627187,0.0001897825],"category_scores_gemma":[0.0000028568552,0.00009999294,0.00009490442,0.0001240455,0.00012968494,0.00012681786,0.00007655411,0.00014233051,0.000038443093],"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.000033916007,0.00016752604,0.114066765,0.000009392111,0.000036712034,5.6389797e-7,0.000049529277,0.000057969643,0.03153159,0.8375175,0.00052530674,0.0160032],"study_design_scores_gemma":[0.0018596485,0.00022591135,0.06773867,0.00006467491,0.000030883693,3.8517274e-7,0.00036740504,0.0008737998,0.6049823,0.32214946,0.0012673887,0.00043948428],"about_ca_topic_score_codex":0.0005661831,"about_ca_topic_score_gemma":7.9109225e-7,"teacher_disagreement_score":0.5734507,"about_ca_system_score_codex":0.000014213093,"about_ca_system_score_gemma":0.000057248264,"threshold_uncertainty_score":0.40775937},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9961529,0.0012018981,0.0002726598,0.0006865267,0.0009952198,0.0001750991,0.00000332917,0.0001574511,0.00035494947],"genre_scores_gemma":[0.9902163,0.00009170429,0.009518963,0.00011636745,0.0000015677113,0.000010114435,0.0000031957895,0.000017107275,0.000024693602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979104,0.000111693465,0.00062570284,0.00045825937,0.0005121507,0.00038181295],"domain_scores_gemma":[0.9980748,0.00011968371,0.0003746893,0.0009510388,0.00032518932,0.00015455582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007124671,0.00022433908,0.00040553528,0.00038424795,0.00012276441,0.000045092584,0.0009542398,0.00010903164,0.000008655413],"category_scores_gemma":[0.00006845566,0.00021025943,0.00019781748,0.0013036316,0.00017142901,0.0003859948,0.0002797598,0.00020098915,0.000015017812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008786079,0.00017581412,0.004235084,0.00004803053,0.000046291367,0.0000047996896,0.0016323971,0.00004707766,0.013580897,0.97410375,0.0011734812,0.004943602],"study_design_scores_gemma":[0.0009206695,0.00021328789,0.0014218449,0.000098702614,0.00001891183,0.000009034544,0.000055815064,0.0019486727,0.056472547,0.93802994,0.00057047326,0.00024010193],"about_ca_topic_score_codex":0.00018394733,"about_ca_topic_score_gemma":0.000013480576,"teacher_disagreement_score":0.042891648,"about_ca_system_score_codex":0.000022102538,"about_ca_system_score_gemma":0.00008092324,"threshold_uncertainty_score":0.85741305},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9877247,0.0002805926,0.00018635188,0.00064627995,0.0016902545,0.00010793473,0.000001240203,0.00020888573,0.0091537675],"genre_scores_gemma":[0.9976786,0.00004941936,0.0017213086,0.00022354657,6.409355e-7,0.0000076260217,0.0000018183546,0.000008721668,0.00030835296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882615,0.00004155671,0.00028250075,0.00030792537,0.00027049333,0.0002713688],"domain_scores_gemma":[0.9989515,0.00007041033,0.00012406036,0.000602012,0.00013475947,0.00011728309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000290344,0.00013145515,0.00020600903,0.00015933074,0.00009898353,0.000052915268,0.0007127615,0.00006877866,0.0000126204295],"category_scores_gemma":[0.00003231318,0.0001247583,0.000086554675,0.0007182059,0.00007825712,0.00023964228,0.00017607724,0.000116008094,0.000042428477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005409186,0.00011011897,0.009786177,0.000008510175,0.000014306017,0.000019351393,0.00015314318,0.0000041040767,0.0012486745,0.98525614,0.0027563758,0.0006377192],"study_design_scores_gemma":[0.00065606623,0.00016925466,0.0026589062,0.000032389773,0.0000071316263,0.000020064406,0.000010983394,0.0004903947,0.002903264,0.9868506,0.0060303165,0.00017060188],"about_ca_topic_score_codex":0.00012111561,"about_ca_topic_score_gemma":0.0000040197847,"teacher_disagreement_score":0.009953873,"about_ca_system_score_codex":0.000014014166,"about_ca_system_score_gemma":0.000035674842,"threshold_uncertainty_score":0.50874954},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925499,0.00012112789,0.0005358199,0.0010130325,0.0010474533,0.00016671418,0.0000020067348,0.00016746335,0.0043965136],"genre_scores_gemma":[0.9989153,0.0000013739177,0.0007121838,0.00030624087,0.0000013384254,0.000009714074,0.00000216762,0.000010242132,0.000041439376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985653,0.00011824005,0.00036820973,0.00027728933,0.00039808737,0.00027285845],"domain_scores_gemma":[0.99839,0.00046897438,0.00021827464,0.000746756,0.00012516206,0.000050817787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061358284,0.00014796028,0.00020082608,0.00012601369,0.0002193835,0.00011231768,0.00077846216,0.00004731827,0.000010378624],"category_scores_gemma":[0.00016290956,0.000106046886,0.00009434635,0.0006874273,0.00011369206,0.00013820894,0.00016477509,0.0001655415,0.000038349386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021252845,0.00008893612,0.0016745096,0.000012304204,0.000010204264,0.000004022273,0.0001092714,0.0001433478,0.0014516074,0.9922769,0.0041308287,0.00009591668],"study_design_scores_gemma":[0.0003814608,0.00008638142,0.004209237,0.00008792872,0.000005345129,0.0000038229105,0.000009086241,0.0129478285,0.0014712503,0.9805671,0.000104456994,0.00012607947],"about_ca_topic_score_codex":0.0002617393,"about_ca_topic_score_gemma":0.000007473564,"teacher_disagreement_score":0.01280448,"about_ca_system_score_codex":0.000015438367,"about_ca_system_score_gemma":0.00002771064,"threshold_uncertainty_score":0.43244666},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94764745,0.00018498852,0.03059711,0.00021428391,0.0051004137,0.00027945996,0.0000060112548,0.00020691629,0.015763361],"genre_scores_gemma":[0.99952257,0.0000045389716,0.00021091638,0.00003964504,0.000023590354,0.00001517376,0.0000037269774,0.000010010892,0.00016984322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985852,0.00019666257,0.00036462047,0.00034299595,0.00024125336,0.00026926352],"domain_scores_gemma":[0.99884814,0.00021770223,0.00016434409,0.00045842276,0.00025260623,0.000058757167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002803721,0.00015424925,0.0002925843,0.00014857062,0.00011779359,0.000059107322,0.0004599481,0.000110458204,0.000008440507],"category_scores_gemma":[0.000027374183,0.00014939407,0.00013998931,0.0007982892,0.00006425305,0.0003155918,0.000061856,0.000157275,0.000014693843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010180812,0.0001531795,0.0017364883,0.000011571988,0.000020077972,0.000011018849,0.00022185541,0.00004175322,0.0014690121,0.9907514,0.0049953577,0.0005781099],"study_design_scores_gemma":[0.0022762388,0.0004958407,0.06801967,0.00010439826,0.000021140479,0.00004180358,0.000076886245,0.01864924,0.016837291,0.88948095,0.0034628233,0.0005337263],"about_ca_topic_score_codex":0.0005340677,"about_ca_topic_score_gemma":0.000049991104,"teacher_disagreement_score":0.10127046,"about_ca_system_score_codex":0.00004670235,"about_ca_system_score_gemma":0.000052933967,"threshold_uncertainty_score":0.60921127},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99337876,0.0016389767,0.000035060115,0.00013088627,0.0004690279,0.00015471876,0.000010578271,0.000020657038,0.0041613416],"genre_scores_gemma":[0.99834794,0.00005285908,0.0005181382,0.00012266832,0.000038852337,0.00001713856,0.000046642945,0.00002247319,0.00083326385],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923337,0.00005405928,0.00014412885,0.00027827558,0.000093455965,0.00019669998],"domain_scores_gemma":[0.9995828,0.000011828937,0.00006038523,0.00025202183,0.00003687749,0.000056031084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009699451,0.00014670753,0.00013520452,0.000031025345,0.00010002888,0.0000370235,0.00013049458,0.00016720458,0.00006318971],"category_scores_gemma":[0.000028243318,0.0001377808,0.00004704623,0.000054092918,0.00005397426,0.0000036798237,0.000071082795,0.00006770275,0.0000053544036],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004461348,0.000032052678,0.00056120753,0.000009064954,0.000027659877,0.0000053592844,0.00001098246,0.0000026445425,0.9292387,0.060515817,0.004026204,0.005525735],"study_design_scores_gemma":[0.0008607418,0.00018684563,0.007415102,0.0000049795103,0.000013749224,0.000013102975,0.00001539145,0.0000052465366,0.7177821,0.25286698,0.02062599,0.00020976532],"about_ca_topic_score_codex":0.000058985876,"about_ca_topic_score_gemma":0.000033261993,"teacher_disagreement_score":0.21145657,"about_ca_system_score_codex":0.00000623556,"about_ca_system_score_gemma":0.00004168059,"threshold_uncertainty_score":0.56185377},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99270815,0.00045403317,0.0007009629,0.00029256943,0.0029423926,0.00011620547,0.000001572267,0.00022321404,0.0025608886],"genre_scores_gemma":[0.9945584,0.00001387737,0.004881679,0.00046681854,0.0000012802496,0.0000020012997,0.0000020829941,0.000011144401,0.00006269782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852014,0.000034749308,0.00036094748,0.0003370757,0.00040005482,0.00034703498],"domain_scores_gemma":[0.9987184,0.00025048287,0.00014619772,0.00063213997,0.00011829704,0.00013447685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008574864,0.00014793534,0.0002039823,0.00027257486,0.00012219803,0.0000405754,0.0006340368,0.00008623755,0.000004875901],"category_scores_gemma":[0.00007751244,0.00013779593,0.000083502,0.0006021838,0.00006796329,0.00021068507,0.00008478389,0.00017606257,0.000039767096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010332413,0.00015352693,0.00048448212,0.000010486478,0.000014689852,0.000016365248,0.00014487654,0.000017011598,0.0052159852,0.9916838,0.0012575939,0.0009908862],"study_design_scores_gemma":[0.00067388185,0.00021894432,0.00038262113,0.000054998614,0.000004957283,0.000004102179,0.000010044735,0.00038310292,0.018030623,0.9799422,0.00013872155,0.00015578153],"about_ca_topic_score_codex":0.000059896272,"about_ca_topic_score_gemma":0.0000026459998,"teacher_disagreement_score":0.012814637,"about_ca_system_score_codex":0.000018710258,"about_ca_system_score_gemma":0.00003233964,"threshold_uncertainty_score":0.5619155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99017894,0.000022087113,0.000041511583,0.00012304386,0.00007795386,0.0001890661,0.0000017151596,0.000027394712,0.009338267],"genre_scores_gemma":[0.9995241,0.000008367818,0.0003161762,0.000049323546,0.0000024358783,0.000009935506,4.977925e-7,0.00001141964,0.000077732715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993343,0.000042905795,0.00015239674,0.00013520196,0.00017653518,0.00015871365],"domain_scores_gemma":[0.99851674,0.0009696692,0.00009384248,0.00033139225,0.000038816343,0.00004952621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005192757,0.00009764552,0.000121561025,0.000034318353,0.00011546895,0.000013518167,0.0001846035,0.000050215203,0.000037283808],"category_scores_gemma":[0.00006889588,0.00006260645,0.00003071989,0.00026419046,0.00018903232,0.000052451207,0.000024978763,0.00016820536,0.000009661559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033224114,0.00013255027,0.0047751595,0.000011517019,0.000028193925,0.0000024456351,0.00033660943,1.2792333e-7,0.0003503337,0.9940103,0.0001812546,0.00013823966],"study_design_scores_gemma":[0.00036790167,0.000075474316,0.0077466527,0.000030351635,0.000029531346,0.000010023634,0.00020205844,0.00000585582,0.008312309,0.98306566,0.00007262851,0.00008153889],"about_ca_topic_score_codex":0.000011505842,"about_ca_topic_score_gemma":0.000015162754,"teacher_disagreement_score":0.01094467,"about_ca_system_score_codex":0.000008472147,"about_ca_system_score_gemma":0.0000128556185,"threshold_uncertainty_score":0.2553017},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8762779,0.00048587975,0.06944719,0.0028204666,0.0014006018,0.00040179974,0.000013637259,0.00048021533,0.04867228],"genre_scores_gemma":[0.96749973,0.000030223817,0.032212343,0.00009068434,0.000005345378,0.000011390271,0.0000014541391,0.000007749635,0.00014109591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990236,0.0000662377,0.00017671542,0.00020254873,0.000273799,0.0002570647],"domain_scores_gemma":[0.9990645,0.000137945,0.00005464882,0.0005509412,0.000108189684,0.00008377516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002207156,0.00008400218,0.0001239233,0.0001202373,0.00008515685,0.000028569337,0.0007752159,0.000037113557,0.000031944368],"category_scores_gemma":[0.00005270959,0.00008559997,0.00006381547,0.0004713891,0.000085815715,0.00046405316,0.00023164113,0.00013671105,0.00015916488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037016057,0.00008084277,0.00026909722,0.0000041659864,0.0000076240076,0.0000027701244,0.00013097828,0.000070752365,0.0005583649,0.9959446,0.00061070477,0.0023163909],"study_design_scores_gemma":[0.0004047457,0.00006610671,0.0010273245,0.000007724019,0.0000017721396,0.000009254796,0.000009396125,0.0022140231,0.00531757,0.98955256,0.0012935901,0.00009596239],"about_ca_topic_score_codex":0.0000044918665,"about_ca_topic_score_gemma":0.0000019282888,"teacher_disagreement_score":0.09122178,"about_ca_system_score_codex":0.000036246776,"about_ca_system_score_gemma":0.000050563835,"threshold_uncertainty_score":0.34906653},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78165317,0.0010934008,0.16348577,0.00026512225,0.005346202,0.00053606194,0.0000034521622,0.00039476424,0.047222048],"genre_scores_gemma":[0.97964686,0.000034593242,0.019809319,0.000030989344,0.0000020086543,0.0000049561563,5.6608354e-7,0.0000102494605,0.00046047868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867386,0.00015262654,0.00020153384,0.00028428205,0.00037657813,0.00031111733],"domain_scores_gemma":[0.9988741,0.0001213331,0.00007128941,0.0006868204,0.00010840555,0.00013803082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034999446,0.00011712173,0.0001734163,0.00018836383,0.00007494873,0.000037947797,0.000859728,0.000051962335,0.00003782901],"category_scores_gemma":[0.00012588932,0.00011580817,0.0000880501,0.00090408284,0.00009602428,0.0003720382,0.00015347236,0.00014464179,0.00003664919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000455299,0.0000351552,0.0011668202,0.0000065606696,0.000014864448,0.0000067365127,0.000177516,0.000009888426,0.0023070343,0.99251187,0.0006448329,0.0031141709],"study_design_scores_gemma":[0.0005246833,0.000091993476,0.00041646074,0.000007849208,0.000002422452,0.000006164363,0.00002457029,0.000061159764,0.04288112,0.953511,0.0023585332,0.000114036244],"about_ca_topic_score_codex":0.000025312915,"about_ca_topic_score_gemma":0.0000021670385,"teacher_disagreement_score":0.19799365,"about_ca_system_score_codex":0.000022175589,"about_ca_system_score_gemma":0.00015263908,"threshold_uncertainty_score":0.47225204},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9915893,0.0015140419,0.000042430685,0.00011422358,0.0026754888,0.0004014972,0.00006413454,0.00019660399,0.0034022573],"genre_scores_gemma":[0.998523,0.0007976022,0.00015044659,0.000032330994,0.00003248841,0.000059690905,0.000024652907,0.00008478561,0.000294988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980454,0.0000643204,0.00070989877,0.00035070092,0.0003271852,0.0005025104],"domain_scores_gemma":[0.99860233,0.000095983705,0.00017190649,0.00080676825,0.0001416441,0.00018135873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001690471,0.000358437,0.0005871404,0.00023056664,0.0002022675,0.000024375275,0.00043935215,0.00030583132,0.00029010818],"category_scores_gemma":[0.000035399822,0.0004092406,0.00020057826,0.0007893733,0.00016782517,0.00015593003,0.000107542306,0.00020747213,0.00025580628],"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.000118969976,0.0011584979,0.048000038,0.0005668191,0.0006812841,0.00007323889,0.0035736847,0.00025949397,0.3824853,0.5384259,0.023628816,0.0010279731],"study_design_scores_gemma":[0.0066483114,0.00051861326,0.20417215,0.00035473684,0.00030578786,0.00011549458,0.0002854835,0.001525406,0.5644262,0.20368682,0.016051691,0.0019093376],"about_ca_topic_score_codex":0.0002910004,"about_ca_topic_score_gemma":0.000007848591,"teacher_disagreement_score":0.33473906,"about_ca_system_score_codex":0.00007193382,"about_ca_system_score_gemma":0.000119857265,"threshold_uncertainty_score":0.99983597},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94198626,0.0004181537,0.0015517696,0.00078964065,0.0058881566,0.00074660627,0.0000037466498,0.00018171217,0.048433956],"genre_scores_gemma":[0.9531594,0.000010936674,0.034313876,0.0006875463,0.000015664931,0.000038436454,3.470968e-7,0.000030790452,0.011743024],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969787,0.00045136578,0.00042716946,0.0007196219,0.0010401049,0.00038305638],"domain_scores_gemma":[0.99608004,0.002577881,0.00014437865,0.00063273264,0.0002113539,0.00035359143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001603072,0.00024667126,0.0003643673,0.00017054335,0.00020045757,0.00033974208,0.00048024344,0.00008528445,0.0004452592],"category_scores_gemma":[0.0024728838,0.00019100119,0.0000602124,0.0009601218,0.00012006414,0.00035115218,0.00015395538,0.00019722803,0.0006653816],"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.0011229516,0.001716371,0.018691251,0.000017447728,0.00021103905,0.00027699897,0.0125789605,0.0005168703,0.17514746,0.09448724,0.61319923,0.08203417],"study_design_scores_gemma":[0.0107945325,0.012213567,0.03767676,0.00026212036,0.00018881782,0.0007900412,0.0051097474,0.012860641,0.18012881,0.5696546,0.16668388,0.0036364696],"about_ca_topic_score_codex":0.00005002812,"about_ca_topic_score_gemma":0.00000699787,"teacher_disagreement_score":0.47516736,"about_ca_system_score_codex":0.000095227966,"about_ca_system_score_gemma":0.000022123877,"threshold_uncertainty_score":0.85523564},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98546475,0.00035528353,0.0014940193,0.0009123238,0.0013102455,0.00016810499,0.000001289681,0.00029830524,0.00999567],"genre_scores_gemma":[0.9987721,0.000028861301,0.0006136051,0.00049827277,0.00001258039,0.000018309742,0.0000011205831,0.000011059208,0.000044085275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985101,0.000114971226,0.00026330593,0.00042939934,0.00025385543,0.0004283174],"domain_scores_gemma":[0.99891984,0.00010714773,0.000067156776,0.0007372255,0.000038011785,0.00013058592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004949973,0.00017328202,0.00019873105,0.00030760668,0.00010744775,0.00012648324,0.0010178976,0.00007968858,0.000021936821],"category_scores_gemma":[0.00003557554,0.00018169697,0.0001137983,0.0010500895,0.00005961987,0.00047464008,0.000167505,0.00021678186,0.00013228424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023936589,0.00014379165,0.009843127,0.0000042321913,0.00001021294,0.00003289344,0.00075295876,0.000018269453,0.00038120424,0.9568754,0.00034905906,0.031586453],"study_design_scores_gemma":[0.0011491579,0.000093829316,0.06068232,0.00005023107,0.00000583956,0.000028280005,0.000023087541,0.0017264521,0.0011611946,0.9160126,0.018645063,0.0004219884],"about_ca_topic_score_codex":0.00001658596,"about_ca_topic_score_gemma":0.000033578828,"teacher_disagreement_score":0.050839193,"about_ca_system_score_codex":0.000050586477,"about_ca_system_score_gemma":0.000045025772,"threshold_uncertainty_score":0.7409387},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50219786,0.00058727583,0.032150045,0.006504981,0.0082315095,0.0012821654,0.000022173708,0.0007526559,0.44827133],"genre_scores_gemma":[0.99744296,0.000009765781,0.001532014,0.00092279207,0.0000028317625,0.000019088884,0.0000016680958,0.0000056946233,0.000063212865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989757,0.00013779766,0.00012299813,0.000274001,0.00025651915,0.0002329844],"domain_scores_gemma":[0.9987483,0.00025842877,0.000047687285,0.0008396167,0.000040101422,0.00006588135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040747697,0.00011364133,0.00009177092,0.00004474052,0.00021553361,0.00015523772,0.00078352744,0.000046474794,0.00011747238],"category_scores_gemma":[0.00008321314,0.00007619301,0.000067320645,0.00048733712,0.000048406124,0.00026301676,0.000097622615,0.00018045225,0.0003906572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017807297,0.00009932165,0.00016533564,0.0000021332814,0.00000817677,0.0000043580126,0.00015623476,0.000001813467,0.000021184956,0.9642193,0.035154875,0.00016551679],"study_design_scores_gemma":[0.00024670703,0.00006535032,0.0002680016,0.0000073487454,0.000002157224,0.0000036065712,0.0000057015013,0.000109324435,0.0009632665,0.9120745,0.08614722,0.000106812324],"about_ca_topic_score_codex":0.0000067871024,"about_ca_topic_score_gemma":0.0000010476816,"teacher_disagreement_score":0.49524507,"about_ca_system_score_codex":0.000015992875,"about_ca_system_score_gemma":0.000040288378,"threshold_uncertainty_score":0.50212383},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96633464,0.0004513104,0.0023692993,0.00014447076,0.00088022865,0.00017442825,0.000026270636,0.00010453446,0.029514823],"genre_scores_gemma":[0.9943809,0.0000048790844,0.0008826206,0.00003189225,0.00001569931,0.000012077212,0.00001193329,0.0000239338,0.004636088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990885,0.00006903078,0.0002905631,0.00018448087,0.00014508239,0.00022229887],"domain_scores_gemma":[0.99909025,0.00028301604,0.00016280366,0.00037315415,0.000055957033,0.00003478853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015842717,0.00015187389,0.0003053669,0.000050682196,0.00007414188,0.0000058834567,0.00017170848,0.00012819748,0.000206535],"category_scores_gemma":[0.00009256627,0.00012968956,0.00008862825,0.00015158292,0.00018592733,0.00006843364,0.000042689855,0.0001742062,0.000011113475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040399358,0.00017177721,0.0013934525,0.000050166276,0.000022592234,0.00001620968,0.00013286402,0.000013950811,0.00036006593,0.99582756,0.0016731459,0.00029780646],"study_design_scores_gemma":[0.00088157086,0.000058576366,0.0010674673,0.000029964554,0.00002209481,0.000005582448,0.000023129234,0.000022319122,0.0036061124,0.99206,0.0020799655,0.00014319834],"about_ca_topic_score_codex":0.000010753288,"about_ca_topic_score_gemma":0.000022056869,"teacher_disagreement_score":0.028046241,"about_ca_system_score_codex":0.000028452236,"about_ca_system_score_gemma":0.00001735622,"threshold_uncertainty_score":0.5288587},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94215405,0.0015628209,0.0015553447,0.00007455884,0.0014555128,0.00012921226,0.0000061103015,0.00028066512,0.05278175],"genre_scores_gemma":[0.9993547,0.00004676482,0.00041667797,0.00003296179,0.0000067897086,0.000004171239,0.000002512056,0.000017048147,0.00011837422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953336,0.000014379002,0.00012063741,0.000077334036,0.00014001339,0.0001143095],"domain_scores_gemma":[0.99973565,0.000059408652,0.00001712538,0.00012500769,0.000024712152,0.000038075937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000040606978,0.000079835314,0.000110876565,0.0000540015,0.000021975255,0.0000059118483,0.00009959375,0.000039765673,0.000117243275],"category_scores_gemma":[0.000013971204,0.00008358708,0.000046368725,0.00016328398,0.000020687869,0.00004166892,0.000012014322,0.000078041354,0.00006108894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028708753,0.00023320592,0.0022412331,0.00018445682,0.00041607628,0.00007263527,0.0028803665,0.13051762,0.014972079,0.5339538,0.2773003,0.03719954],"study_design_scores_gemma":[0.0020581898,0.00033181265,0.004833002,0.00008866452,0.00006862605,0.000027930188,0.000075157724,0.15238254,0.033705033,0.7683652,0.037257817,0.0008060327],"about_ca_topic_score_codex":0.0000039149368,"about_ca_topic_score_gemma":3.2690946e-7,"teacher_disagreement_score":0.24004248,"about_ca_system_score_codex":0.000021523549,"about_ca_system_score_gemma":0.0000037579373,"threshold_uncertainty_score":0.34085822},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9953774,0.00021190806,0.00084548607,0.0003118815,0.0010616878,0.000087494656,4.3296e-7,0.00015578892,0.0019478748],"genre_scores_gemma":[0.990015,0.000011276981,0.009802934,0.00013461585,4.851287e-7,0.000006292055,9.4513683e-7,0.000008590622,0.000019900233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895036,0.0000312027,0.00025796253,0.00025018622,0.00029732008,0.00021293726],"domain_scores_gemma":[0.99904424,0.000031880314,0.000098485456,0.0006314804,0.000105669,0.00008824926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002160663,0.00011439647,0.00018851233,0.00007790775,0.00007336896,0.000034390545,0.00054026546,0.000059454844,0.000010341108],"category_scores_gemma":[0.000032470136,0.00010665287,0.00009472252,0.0006037723,0.00006871247,0.00019668242,0.00011549824,0.00008612679,0.00013314145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.429781e-7,0.00012806231,0.0012946851,0.000022025733,0.00001811288,0.000009169102,0.00021343715,0.00008092113,0.0035901002,0.9943202,0.000119633274,0.00020300968],"study_design_scores_gemma":[0.0008330904,0.00004642146,0.0010337855,0.000049870825,0.00000738373,0.000026835165,0.0000073913507,0.00032905917,0.00876887,0.9886968,0.00007330454,0.00012718246],"about_ca_topic_score_codex":0.00007051314,"about_ca_topic_score_gemma":4.5369663e-7,"teacher_disagreement_score":0.0089574475,"about_ca_system_score_codex":0.000020089177,"about_ca_system_score_gemma":0.00006683037,"threshold_uncertainty_score":0.43491778},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98801965,0.00007455375,0.0014136219,0.0010128563,0.00029124267,0.00019810679,7.148223e-7,0.000090276575,0.008898978],"genre_scores_gemma":[0.9982333,0.00003487639,0.0013455937,0.00024884118,0.0000017800174,0.000019237552,9.747323e-7,0.00000779242,0.00010755784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988425,0.0002124539,0.00017192635,0.00023496561,0.00033077665,0.00020741543],"domain_scores_gemma":[0.99861526,0.00045071423,0.000049812665,0.00074512407,0.00008000727,0.000059062135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047073528,0.00009798639,0.00011627556,0.000093966504,0.00015279389,0.000039338305,0.0010470378,0.000041710697,0.00011118284],"category_scores_gemma":[0.000042944765,0.00007178772,0.000072904135,0.0006034445,0.00013902345,0.00023229711,0.000094570576,0.0001844371,0.00011063266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022815571,0.00008269299,0.00009144087,0.0000034881052,0.000008778253,0.0000033673766,0.00023244796,0.00002641996,0.00063157274,0.98577774,0.00049047323,0.012628773],"study_design_scores_gemma":[0.00022399034,0.00021469113,0.00063333125,0.000018992967,0.0000014004605,0.0000022837091,0.0000062757754,0.00080755574,0.013137057,0.9844938,0.0003825993,0.000078041885],"about_ca_topic_score_codex":0.000015550711,"about_ca_topic_score_gemma":0.0000013856452,"teacher_disagreement_score":0.012550731,"about_ca_system_score_codex":0.000029206509,"about_ca_system_score_gemma":0.000026084032,"threshold_uncertainty_score":0.2927418},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9729582,0.000024188195,0.016595446,0.00013649197,0.0021889964,0.000097557226,0.0000025162171,0.000024856052,0.007971753],"genre_scores_gemma":[0.99764407,0.000010712547,0.0021113234,0.000047536596,0.000021417523,0.000003851609,0.0000060237567,0.0000031357529,0.00015191596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992033,0.000038065584,0.00022647149,0.00015791267,0.00027856155,0.00009564883],"domain_scores_gemma":[0.9992947,0.00013908505,0.00012143165,0.00023431318,0.00017049143,0.000039969167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001360064,0.00006715366,0.00011485812,0.00017032948,0.000049051836,0.000014508133,0.0002754589,0.000029785295,0.000043165346],"category_scores_gemma":[0.00005635125,0.00006896284,0.000057963538,0.00082360057,0.000031935477,0.00017686693,0.00004803964,0.00004848335,0.000016449249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000090540825,0.00015681915,0.00072648545,0.000003723244,0.000009728307,0.0000020094253,0.00024976765,0.0007946446,0.0005684368,0.99194694,0.0011733827,0.0043589957],"study_design_scores_gemma":[0.0005362186,0.00022296935,0.011465286,0.000012208964,0.0000047381513,0.000003757914,0.000013330969,0.0021389672,0.011076953,0.97354364,0.00090078,0.00008114271],"about_ca_topic_score_codex":0.000008211056,"about_ca_topic_score_gemma":0.0000018367689,"teacher_disagreement_score":0.024685888,"about_ca_system_score_codex":0.0000144542355,"about_ca_system_score_gemma":0.000052148145,"threshold_uncertainty_score":0.2812223},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96910226,0.0003696743,0.027866293,0.00022713175,0.00053861976,0.0001387803,0.000005285293,0.00008018797,0.0016717836],"genre_scores_gemma":[0.9889627,0.000041927833,0.0096804965,0.000085287946,0.000009393455,0.000034946275,0.0000034968314,0.000004434622,0.0011773076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947894,0.00002069329,0.0001416647,0.00015681711,0.000074355055,0.00012754348],"domain_scores_gemma":[0.9995874,0.000113036906,0.000039980667,0.00017196324,0.000053041273,0.00003453292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007416169,0.00006423234,0.000097828466,0.0000364699,0.00017863691,0.00005212641,0.00014310276,0.000026503536,0.000033246833],"category_scores_gemma":[0.00002853544,0.0000623061,0.000032464235,0.00013513699,0.00004602314,0.00035329405,0.000032335476,0.000037263388,0.000006900306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002456222,0.000036073325,0.0004067288,0.000012036035,0.000008555964,7.7595985e-7,0.00015280045,0.00033698604,0.0006254986,0.98650014,0.0013283519,0.010589566],"study_design_scores_gemma":[0.00039794826,0.00012740298,0.0009488039,0.000010848204,0.0000074844684,0.000006319841,0.00006250245,0.008547875,0.0014253356,0.9851571,0.0032019275,0.00010650722],"about_ca_topic_score_codex":0.000005194139,"about_ca_topic_score_gemma":0.0000034682068,"teacher_disagreement_score":0.019860465,"about_ca_system_score_codex":0.000009265979,"about_ca_system_score_gemma":0.000020514786,"threshold_uncertainty_score":0.2540769},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9721348,0.000081877406,0.00027480954,0.00029820955,0.00019627635,0.00029215406,0.00003550747,0.00007280612,0.02661351],"genre_scores_gemma":[0.9885299,0.000008511267,0.010880416,0.000029805175,0.0000064117708,0.000021831203,0.0000034771842,0.000017940127,0.00050168816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917877,0.000025045652,0.00029526858,0.00013031875,0.00022151075,0.00014909368],"domain_scores_gemma":[0.99905866,0.00027121557,0.00014813636,0.00038835747,0.00007533683,0.00005831403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011062556,0.000104942665,0.0002192795,0.000050100385,0.00007004011,0.000013152311,0.0002167928,0.000046456364,0.00079152925],"category_scores_gemma":[0.000104707295,0.00009306845,0.00007442839,0.0001608662,0.00006705764,0.0000312024,0.0000550201,0.0000976271,0.00003623014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011771626,0.00014632568,0.00011905353,0.00006754727,0.00002261136,8.835959e-7,0.00031437917,4.162968e-7,0.00058272574,0.97354466,0.024924234,0.00027596654],"study_design_scores_gemma":[0.00031953337,0.00002928787,0.00021857409,0.000016419996,0.00001855021,0.0000053831855,0.000026465012,0.000844781,0.0005307599,0.9931142,0.004778472,0.00009757426],"about_ca_topic_score_codex":0.0000030211327,"about_ca_topic_score_gemma":0.0000012847584,"teacher_disagreement_score":0.02611182,"about_ca_system_score_codex":0.000011048293,"about_ca_system_score_gemma":0.0000075462053,"threshold_uncertainty_score":0.866669},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.854457,0.00007508701,0.14221993,0.00054981664,0.00036834288,0.00032643604,0.0000012695475,0.00013520764,0.0018669023],"genre_scores_gemma":[0.9941899,0.000017144339,0.0055700624,0.000049648217,0.0000056843855,0.000029036162,0.0000033873362,0.000013313757,0.00012181387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984926,0.00009297421,0.0001626673,0.00041329232,0.0005433939,0.00029506558],"domain_scores_gemma":[0.99911416,0.00013330413,0.000087033295,0.00040043515,0.00014529772,0.00011975892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047300768,0.00015150824,0.0001495395,0.00017965783,0.00019119249,0.00016593926,0.0004617755,0.00006954832,0.000006164758],"category_scores_gemma":[0.00006305847,0.00013480801,0.000027173164,0.00048780767,0.00011571521,0.0010396168,0.0002031299,0.00020340289,0.000025288151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003917925,0.000093361945,0.0006835037,0.0000074194786,0.00001362932,0.000037853337,0.00091675343,0.00022784437,0.0007225094,0.98946923,0.000011345298,0.0077773514],"study_design_scores_gemma":[0.0032854048,0.00031112164,0.0070312,0.000027807158,0.000004411688,0.000041051215,0.00006546847,0.00089084235,0.0072562397,0.9807856,0.000092270995,0.00020860121],"about_ca_topic_score_codex":0.00003144686,"about_ca_topic_score_gemma":0.000039054343,"teacher_disagreement_score":0.13973291,"about_ca_system_score_codex":0.00014793446,"about_ca_system_score_gemma":0.00007470946,"threshold_uncertainty_score":0.54973114},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9816334,0.00011383916,0.00685354,0.0000692528,0.0021032672,0.0001007341,0.0000011866161,0.00048274038,0.008641996],"genre_scores_gemma":[0.9940601,0.000014259716,0.0055053257,0.0000860653,0.000022045246,0.000010659069,0.00000612698,0.00003820541,0.0002572383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992486,0.000007716003,0.00016956552,0.00013907914,0.00013693885,0.0002980735],"domain_scores_gemma":[0.999595,0.000038340528,0.000017323775,0.00020488178,0.000031064716,0.00011340569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000209095,0.00012803554,0.00011969628,0.00009984742,0.00007126026,0.000033019875,0.00015737518,0.00009971691,0.000026415362],"category_scores_gemma":[0.000015954223,0.00014434522,0.000034912446,0.00026744496,0.000009757557,0.00007077763,0.000041327483,0.00012359476,0.000032858985],"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.00001192365,0.00003957261,0.0029033714,0.000023646524,0.000037861595,0.000013904954,0.00009774178,0.2415323,0.0014376814,0.74851525,0.00057510094,0.0048116497],"study_design_scores_gemma":[0.005423586,0.00064146495,0.05130964,0.00057658553,0.00014379738,0.000059567494,0.0005358148,0.093155384,0.43472394,0.27547196,0.13414721,0.0038110376],"about_ca_topic_score_codex":0.000010868789,"about_ca_topic_score_gemma":0.000020682384,"teacher_disagreement_score":0.4730433,"about_ca_system_score_codex":0.000080947764,"about_ca_system_score_gemma":0.000008349191,"threshold_uncertainty_score":0.5886227},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29853982,0.010400509,0.30433238,0.05371158,0.0134363035,0.002251622,0.000012353111,0.010060299,0.30725515],"genre_scores_gemma":[0.9739251,0.000119773365,0.024622377,0.0005444296,0.000018437559,0.00003567191,0.0000015446801,0.000020137197,0.00071251875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811417,0.00006179765,0.00028213937,0.00047695983,0.00053550984,0.0005294182],"domain_scores_gemma":[0.99829143,0.00016577801,0.00016336713,0.001059108,0.0001854503,0.00013485539],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00057339174,0.00024020055,0.00017969233,0.000105776104,0.0004581185,0.0014906669,0.0029650293,0.00011796246,0.00000566558],"category_scores_gemma":[0.00010489887,0.00018296891,0.00011640765,0.000552517,0.0002535262,0.0013840282,0.0006481704,0.00029445122,0.000080610764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004137755,0.00006789559,0.0011268522,0.000007847444,0.000023690667,0.00003023991,0.00013107334,0.000004112773,0.000318388,0.84122646,0.0067300927,0.15032923],"study_design_scores_gemma":[0.00036444646,0.00012628229,0.0020063748,0.00006825753,0.000012341112,0.00006527115,0.000025731375,0.0025872642,0.015885727,0.9543865,0.023980435,0.00049136765],"about_ca_topic_score_codex":0.000038311784,"about_ca_topic_score_gemma":0.000062739084,"teacher_disagreement_score":0.6753853,"about_ca_system_score_codex":0.00008749311,"about_ca_system_score_gemma":0.00019793764,"threshold_uncertainty_score":0.9995459},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9852089,0.00003688625,0.00027730767,0.0013892227,0.000091768205,0.00030332702,0.0000037337597,0.00012540788,0.012563396],"genre_scores_gemma":[0.98247534,0.0000034573345,0.015038868,0.00013458022,0.000017199438,0.000102219776,0.0000013056024,0.000024740579,0.0022022582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919915,0.00003708866,0.0001665692,0.00022781128,0.00015235035,0.00021700912],"domain_scores_gemma":[0.999079,0.00020975346,0.00006041011,0.000483406,0.0000774033,0.000090019865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020346636,0.00013202624,0.00016768753,0.00005551163,0.00014259273,0.000027234782,0.00023060582,0.00004302254,0.000095237214],"category_scores_gemma":[0.00010474428,0.00010961463,0.000035395635,0.0004340076,0.000049261438,0.000087854314,0.000038218644,0.000101360325,0.00018827648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054511136,0.0001508937,0.00031266804,0.000005785112,0.000013447733,0.0000029212335,0.00037310732,0.0000069880525,0.00066380086,0.9911245,0.005992213,0.0012991532],"study_design_scores_gemma":[0.0006670372,0.000110037756,0.001082114,0.000033616605,0.000020782722,0.000008883661,0.00007686303,0.000020597696,0.005134117,0.97017884,0.022486942,0.00018016256],"about_ca_topic_score_codex":0.0000046449777,"about_ca_topic_score_gemma":0.00007540266,"teacher_disagreement_score":0.020945664,"about_ca_system_score_codex":0.000029515399,"about_ca_system_score_gemma":0.00002615133,"threshold_uncertainty_score":0.44699547},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.995624,0.000056063123,0.001386158,0.00096207816,0.0006702124,0.00019644716,8.3597416e-7,0.000053773518,0.0010503986],"genre_scores_gemma":[0.99199957,0.0000025029767,0.007486637,0.0004230703,5.7841703e-7,0.000004118059,2.3588315e-7,0.0000095798405,0.0000737259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871093,0.000072488845,0.00032334035,0.00025418587,0.000406254,0.0002327745],"domain_scores_gemma":[0.9982639,0.0004890884,0.00015714082,0.00078161224,0.00022386127,0.00008440479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001255622,0.00011950084,0.00020268864,0.00012375374,0.00008764328,0.000022130647,0.0006944953,0.00005243255,0.0000062472],"category_scores_gemma":[0.0002073738,0.00008455574,0.000072684736,0.0009016598,0.000065122455,0.00007762756,0.00017968334,0.00012656405,0.000012470584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019313555,0.000106534935,0.0005731647,0.000010127758,0.000018908502,0.000002849851,0.0009952568,0.00005007879,0.010219836,0.9867771,0.00074000383,0.0004868129],"study_design_scores_gemma":[0.00039207516,0.0002193028,0.0013311995,0.000085919244,0.000006015784,0.000001903784,0.000051715546,0.00012250012,0.029389665,0.9682072,0.00009326037,0.000099280835],"about_ca_topic_score_codex":0.00008735239,"about_ca_topic_score_gemma":0.000004611705,"teacher_disagreement_score":0.019169828,"about_ca_system_score_codex":0.000010265062,"about_ca_system_score_gemma":0.00003455994,"threshold_uncertainty_score":0.34480828},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9418595,0.00035808684,0.028417472,0.0141944075,0.0013309979,0.0003121739,0.000002503662,0.00036545927,0.01315943],"genre_scores_gemma":[0.99788445,0.0000034721204,0.0008751815,0.00056590524,0.000018045983,0.000009495554,0.0000022239117,0.0000056046247,0.0006356436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921626,0.000041607964,0.00012528288,0.0002116114,0.00018169038,0.00022352938],"domain_scores_gemma":[0.9994526,0.0001191608,0.00006046774,0.00026773164,0.000033598728,0.00006643901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001669352,0.0001037888,0.000101044556,0.000024152552,0.00018471519,0.00014792867,0.00047643017,0.000026217345,0.000007396398],"category_scores_gemma":[0.000011410176,0.00006751725,0.00002751411,0.00020916227,0.00007498596,0.000320568,0.00008198138,0.00010282715,0.00009772093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005346468,0.000052251296,0.00039566905,0.0000018696152,0.000016814642,0.000004315948,0.00048583405,0.00009649901,0.00023009822,0.90236473,0.025943683,0.07040291],"study_design_scores_gemma":[0.005801138,0.0007175312,0.0038838019,0.00010090286,0.000040595034,0.00019415648,0.00011879,0.10436464,0.024077795,0.53853685,0.32088524,0.0012785466],"about_ca_topic_score_codex":0.000010405013,"about_ca_topic_score_gemma":0.000008213315,"teacher_disagreement_score":0.36382782,"about_ca_system_score_codex":0.000030193214,"about_ca_system_score_gemma":0.00004887368,"threshold_uncertainty_score":0.27532735},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9662723,0.00012859644,0.028498089,0.00007186921,0.0004982315,0.00024223515,6.4845005e-7,0.000074217736,0.004213812],"genre_scores_gemma":[0.994835,0.000013229689,0.004996485,0.000025656032,4.944451e-7,0.000011053561,6.734363e-7,0.000009658581,0.00010772475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998745,0.00015748246,0.00018643492,0.0002491201,0.0004005254,0.00026142673],"domain_scores_gemma":[0.99895704,0.000114083065,0.00011485804,0.0005018644,0.00022272405,0.00008945906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039309732,0.00010830215,0.00014950636,0.00017802772,0.00008667032,0.000041396535,0.00055816665,0.00004242676,0.000014859339],"category_scores_gemma":[0.00008950261,0.00009269733,0.000037457725,0.0010021582,0.00008537227,0.00054856343,0.00006636185,0.00013565377,0.00001345845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002955873,0.000120773635,0.0027655663,0.000008666127,0.000026443886,0.000010335649,0.00020984146,0.000024100795,0.0018095762,0.99299324,0.00004431621,0.0019576135],"study_design_scores_gemma":[0.001571343,0.0004269356,0.001868778,0.000030254603,0.0000063891307,0.000012378248,0.000032563003,0.0013693008,0.025319112,0.96895003,0.00026271876,0.00015017514],"about_ca_topic_score_codex":0.0000049960418,"about_ca_topic_score_gemma":0.0000013741968,"teacher_disagreement_score":0.028562725,"about_ca_system_score_codex":0.00003911081,"about_ca_system_score_gemma":0.00005931744,"threshold_uncertainty_score":0.37800875},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938781,0.0017275253,0.00018203568,0.00074859423,0.0012550944,0.00013585543,0.0000013945406,0.0003491376,0.0017222292],"genre_scores_gemma":[0.9943965,0.000025900881,0.004656985,0.0003064854,0.0000020682087,0.000012678644,0.0000029794887,0.000012597543,0.00058377587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987248,0.00006471917,0.00023929111,0.00041982695,0.0002485359,0.00030278548],"domain_scores_gemma":[0.9991211,0.00004728808,0.000116607975,0.0005155421,0.00009666477,0.000102776554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022892069,0.00017066627,0.00020554902,0.00012903164,0.00020269274,0.00018478322,0.00037978284,0.00007877013,0.000004071229],"category_scores_gemma":[0.000015571828,0.00015463051,0.00006169386,0.0003018079,0.00008421874,0.00022096102,0.00016960895,0.00011578646,0.000021424268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023665843,0.000058893605,0.005157719,0.0000060641364,0.000008878002,0.000013466986,0.000050453604,0.000006260128,0.002048764,0.98624754,0.0059389398,0.00046064603],"study_design_scores_gemma":[0.0009377669,0.000051074814,0.007127824,0.000021635371,0.000007689997,0.000013539679,0.0000045132306,0.0011141213,0.0049725985,0.9835928,0.0019389357,0.00021748253],"about_ca_topic_score_codex":0.00019752,"about_ca_topic_score_gemma":0.000008843127,"teacher_disagreement_score":0.004474949,"about_ca_system_score_codex":0.000011582986,"about_ca_system_score_gemma":0.000026530068,"threshold_uncertainty_score":0.6305649},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9882313,0.0010122488,0.000042957847,0.000015731908,0.002096276,0.00020442391,0.0000056641034,0.00012777609,0.008263632],"genre_scores_gemma":[0.99970406,0.000055164273,0.00006154876,0.000007591331,0.000008743133,0.000016178363,0.000004770177,0.00002776832,0.000114159884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887556,0.000055635464,0.00037235915,0.00013266089,0.00021858612,0.00034520868],"domain_scores_gemma":[0.9992854,0.00017209441,0.00007068811,0.00033206271,0.000057319416,0.00008243117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063583214,0.0001621493,0.00020283101,0.000070900925,0.0001746633,0.000019771007,0.0002673754,0.00007923763,0.000011068762],"category_scores_gemma":[0.000021088128,0.00012935049,0.00012083623,0.00021485334,0.0000837102,0.0000746354,0.00004161267,0.0001310495,0.000007685383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006311592,0.000064250075,0.0024020185,0.00004250264,0.00015009767,0.0000094559655,0.00084383454,0.00011090902,0.02492549,0.9686287,0.0011402238,0.0016194085],"study_design_scores_gemma":[0.0074579227,0.00088637066,0.1322106,0.0003491799,0.00018661545,0.000037626138,0.0035735443,0.0019848123,0.37199327,0.43663523,0.042951003,0.0017338354],"about_ca_topic_score_codex":0.000011755655,"about_ca_topic_score_gemma":0.000013376971,"teacher_disagreement_score":0.53199345,"about_ca_system_score_codex":0.00003079943,"about_ca_system_score_gemma":0.000010611917,"threshold_uncertainty_score":0.52747595},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95107496,0.00034174148,0.043091364,0.00045934296,0.001032882,0.00038015217,0.0000025687998,0.00020747741,0.0034095324],"genre_scores_gemma":[0.99794704,0.000010738684,0.0015950748,0.000039734758,0.0000047199524,0.00003776911,0.000009951423,0.0000118022945,0.00034316996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983225,0.00015065141,0.00029204643,0.00041958404,0.0004361174,0.00037912597],"domain_scores_gemma":[0.9990528,0.00013166142,0.000082984676,0.00052462047,0.00014546381,0.000062429914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000528606,0.00014409327,0.00016387869,0.0003277297,0.00008910923,0.00012512923,0.0007903303,0.00007232091,0.000008136329],"category_scores_gemma":[0.000055505898,0.0001467136,0.00004511564,0.001593432,0.00006574534,0.0006742813,0.00018151505,0.00025742903,0.00003521581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017295572,0.00016584457,0.006583159,0.000006125309,0.000002795539,0.000049593495,0.00007898549,0.00017509106,0.0011182519,0.9896618,0.00012142026,0.002019608],"study_design_scores_gemma":[0.0011291746,0.00006106353,0.020131825,0.000020977699,8.951157e-7,0.00000425579,0.000006588432,0.007378745,0.004596321,0.9661143,0.00038981126,0.00016604332],"about_ca_topic_score_codex":0.0000635519,"about_ca_topic_score_gemma":0.00007261817,"teacher_disagreement_score":0.0468721,"about_ca_system_score_codex":0.00012080264,"about_ca_system_score_gemma":0.000039746723,"threshold_uncertainty_score":0.5982807},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99243057,0.00006241723,0.000490044,0.000040970728,0.00009984231,0.0001700607,0.000009346827,0.000028329789,0.0066684433],"genre_scores_gemma":[0.99218696,0.000010129625,0.0076311566,0.000013886361,0.0000053074796,0.00000518109,0.0000059635263,0.000014392866,0.00012701094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913937,0.000011228147,0.00043611095,0.00008774872,0.00018374618,0.00014179741],"domain_scores_gemma":[0.99878895,0.00043326762,0.00023966555,0.0003671968,0.00012467947,0.000046210967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052204187,0.00008484425,0.00023899366,0.000092618786,0.000033461798,0.0000031916582,0.00019023134,0.000057653462,0.000024386518],"category_scores_gemma":[0.00015542642,0.00007775162,0.00006894562,0.00021447375,0.0000562053,0.000058128942,0.00005572099,0.00007011925,0.0000054736347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003831873,0.00027068178,0.00041287075,0.0001675028,0.000027632279,7.5070864e-7,0.00038850674,2.814589e-7,0.0023675107,0.9936076,0.0025553738,0.00019747308],"study_design_scores_gemma":[0.000269276,0.00004867699,0.0005293749,0.00004714075,0.0000260151,0.000001222449,0.00017014895,0.000060358052,0.030185668,0.9681594,0.0004289514,0.000073764386],"about_ca_topic_score_codex":0.000019800469,"about_ca_topic_score_gemma":0.000006314529,"teacher_disagreement_score":0.027818156,"about_ca_system_score_codex":0.000014030681,"about_ca_system_score_gemma":0.000021366448,"threshold_uncertainty_score":0.3170619},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928535,0.000029884799,0.000068276386,0.00005793941,0.0018250025,0.0005506266,0.000007025205,0.00007457223,0.004533141],"genre_scores_gemma":[0.9971382,0.0000044005315,0.00245397,0.00018878606,0.000011058717,0.000033405555,0.0000035660944,0.00003773691,0.00012887528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987612,0.00004992055,0.00033838,0.00025197945,0.00020080268,0.00039776345],"domain_scores_gemma":[0.99756426,0.0018481899,0.00010453008,0.00034707435,0.00005135422,0.00008460714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089644484,0.0001820949,0.00026359278,0.00017124462,0.00014797463,0.000017769593,0.0002613342,0.0001642762,0.0000243222],"category_scores_gemma":[0.00068941514,0.00015919475,0.00013456393,0.00020430259,0.00007996315,0.000060952687,0.00005406685,0.00019919181,0.0000055764795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018085132,0.00018037198,0.0037338126,0.00004111968,0.000030526895,0.000009640441,0.0008940212,0.0000022691574,0.00008212647,0.99204904,0.0017948562,0.0010013736],"study_design_scores_gemma":[0.0019360656,0.00013139022,0.007872901,0.00004226964,0.000016535212,0.000002216855,0.00016761215,0.000039172308,0.001281164,0.98783857,0.00047232973,0.00019980615],"about_ca_topic_score_codex":0.00002129913,"about_ca_topic_score_gemma":0.000053900432,"teacher_disagreement_score":0.004404266,"about_ca_system_score_codex":0.000064948435,"about_ca_system_score_gemma":0.0000143916395,"threshold_uncertainty_score":0.6491774},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98667645,0.00060335605,0.0000619586,0.00015469675,0.0013362516,0.0005238151,0.000008849583,0.00009402551,0.010540578],"genre_scores_gemma":[0.9986677,0.00007038794,0.00040494069,0.000021612677,0.0000033855847,0.00004796779,0.000002405616,0.000045595858,0.0007359732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973707,0.0006735085,0.0004915345,0.00026287805,0.000693319,0.00050805864],"domain_scores_gemma":[0.9962966,0.0022783345,0.00018446587,0.000928333,0.00018956873,0.00012269171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027142416,0.00020771276,0.00035120695,0.00012469084,0.0002579787,0.000046096957,0.00056528393,0.00010525176,0.00011051437],"category_scores_gemma":[0.001832086,0.00014677279,0.00019316717,0.0005190016,0.00030361608,0.00007494542,0.0000825336,0.0003345064,0.00005333327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020140904,0.0002272222,0.0011579148,0.000061354156,0.00012572778,0.000015288573,0.0003264223,5.448953e-7,0.0011684836,0.99454975,0.002077828,0.00026935103],"study_design_scores_gemma":[0.0007596789,0.00012452496,0.00069433404,0.000024878465,0.000044984987,0.000020126541,0.00026012663,0.000049531507,0.0063362545,0.9880395,0.003480735,0.00016532646],"about_ca_topic_score_codex":0.000014400229,"about_ca_topic_score_gemma":0.0000066199286,"teacher_disagreement_score":0.0119912615,"about_ca_system_score_codex":0.00007188726,"about_ca_system_score_gemma":0.00008487336,"threshold_uncertainty_score":0.59852207},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9979571,0.00029267813,0.0001865431,0.000029988396,0.0006304936,0.00009956344,0.0000124397075,0.000009552608,0.00078160106],"genre_scores_gemma":[0.9986705,0.000029674808,0.00091654254,0.000016681744,0.000042071824,0.0000049405,0.00013321909,0.000013679742,0.00017269167],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993746,0.000020681584,0.00017430838,0.00018144646,0.00010890031,0.00014004635],"domain_scores_gemma":[0.99957806,0.0000124811895,0.00008402475,0.0001889234,0.00009252618,0.000043998443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017487939,0.000079980804,0.000087299246,0.000042477604,0.000037608832,0.000007093844,0.000102014725,0.00008155594,0.000023441462],"category_scores_gemma":[0.000056665496,0.00008895084,0.000044441545,0.00008767058,0.000027225142,0.000003714125,0.000045713394,0.000044355715,0.000013173824],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024114237,0.000039204948,0.0045761294,0.00000880659,0.000057436755,0.0000034353059,0.00027051807,0.000009544932,0.9887641,0.0010776257,0.0003397135,0.0048293816],"study_design_scores_gemma":[0.0010138158,0.0002574016,0.028555628,0.000016265612,0.000035604484,0.000007474056,0.0004325481,0.000074972115,0.9580636,0.006751471,0.0045913267,0.00019988863],"about_ca_topic_score_codex":0.000012431467,"about_ca_topic_score_gemma":0.0000044999697,"teacher_disagreement_score":0.030700484,"about_ca_system_score_codex":0.000013230608,"about_ca_system_score_gemma":0.00002637648,"threshold_uncertainty_score":0.36273098},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938001,0.00025845843,0.0006884387,0.0014032483,0.0018777124,0.00052043714,0.0000017768422,0.00018220898,0.0012676329],"genre_scores_gemma":[0.97979975,0.00001512639,0.01946781,0.00038941993,0.000017346689,0.000038669517,2.5989755e-7,0.000015748605,0.00025586862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768317,0.00026321207,0.0004615828,0.000593376,0.00056225556,0.00043639983],"domain_scores_gemma":[0.9979531,0.000091203365,0.000107814645,0.0015085363,0.00020306073,0.00013624459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058087066,0.00022579356,0.00031339953,0.000067515495,0.00019575983,0.000120996054,0.002325109,0.000057363442,0.00003813901],"category_scores_gemma":[0.00018408099,0.00016064948,0.0001347231,0.00090572325,0.00012912878,0.0003116803,0.00076476467,0.00021041516,0.000075308766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007390418,0.00056635856,0.004152996,0.00008520435,0.00006713899,0.00002948093,0.0047362926,0.005001877,0.0454427,0.801145,0.0010900048,0.13760902],"study_design_scores_gemma":[0.0028175733,0.00053960667,0.013257525,0.00045478335,0.000033302378,0.000104501225,0.000054552627,0.09617747,0.13325065,0.742312,0.009769706,0.0012283169],"about_ca_topic_score_codex":0.00029528642,"about_ca_topic_score_gemma":0.000018750321,"teacher_disagreement_score":0.1363807,"about_ca_system_score_codex":0.00014532452,"about_ca_system_score_gemma":0.00015369522,"threshold_uncertainty_score":0.6551095},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99051106,0.000105852465,0.0002314436,0.00395901,0.0012404457,0.000723417,0.0000090539825,0.00016048735,0.0030592221],"genre_scores_gemma":[0.9967294,0.00005239338,0.0022213713,0.00015494639,0.00009188618,0.00008794836,0.0000033020376,0.00007282746,0.0005859225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978076,0.00048594718,0.00051419873,0.00031445132,0.0005038469,0.00037393824],"domain_scores_gemma":[0.9903667,0.008090323,0.00029963246,0.0010171351,0.00010881346,0.00011737107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010437056,0.00031108808,0.00041384954,0.00006127805,0.0011510672,0.00005612293,0.00052393874,0.00018101558,0.000032792053],"category_scores_gemma":[0.003381157,0.00018490678,0.00011388752,0.00032675953,0.00031060568,0.00012597172,0.00018892516,0.00072918506,0.00009909902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016145732,0.00007685203,0.0015276574,0.0000138268915,0.000050205315,0.000005639962,0.0016846213,0.000002036489,0.000045267814,0.98879325,0.007695785,0.00008870856],"study_design_scores_gemma":[0.0009696723,0.00007742744,0.0025240507,0.000040264607,0.00007323115,0.000019385801,0.00009258055,0.00007388551,0.0007733674,0.9919564,0.0031598369,0.00023989567],"about_ca_topic_score_codex":0.000013209247,"about_ca_topic_score_gemma":0.0000027799558,"teacher_disagreement_score":0.0076043755,"about_ca_system_score_codex":0.000095329626,"about_ca_system_score_gemma":0.00006117093,"threshold_uncertainty_score":0.8853195},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97980446,0.00018802266,0.0057990053,0.0005670652,0.00079420576,0.00026067765,0.0000012096122,0.00026013784,0.012325202],"genre_scores_gemma":[0.9962819,0.0000057311872,0.003402457,0.000084717605,0.0000036670974,0.000022414923,0.000002130001,0.0000125342485,0.00018442712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835575,0.00011738839,0.00026291521,0.0004184365,0.0003468256,0.00049871724],"domain_scores_gemma":[0.9989931,0.00020297283,0.00006342341,0.00058752974,0.00006907009,0.00008391687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005238506,0.00015353083,0.0001906503,0.00033806864,0.000100825804,0.00009857515,0.0010205797,0.000067446774,0.000013075898],"category_scores_gemma":[0.00005814987,0.00015644896,0.00006727626,0.001257404,0.00013569363,0.0005212781,0.00022745531,0.000293978,0.000065057546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056628596,0.00009536062,0.007008821,0.0000049428704,0.0000033701183,0.000058981826,0.00008033395,0.000027480472,0.0018506425,0.98891246,0.0002689465,0.0016829865],"study_design_scores_gemma":[0.0009015728,0.00005279574,0.008078026,0.000014905839,9.2311365e-7,0.000012091538,0.000012408155,0.0013998857,0.0022753594,0.9866634,0.0004110945,0.00017751333],"about_ca_topic_score_codex":0.000119543874,"about_ca_topic_score_gemma":0.000026768656,"teacher_disagreement_score":0.016477447,"about_ca_system_score_codex":0.000058959806,"about_ca_system_score_gemma":0.00006677556,"threshold_uncertainty_score":0.6379804},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9960649,0.00010880526,0.001770787,0.000028949682,0.0011833146,0.00009217156,0.000004567954,0.00014400583,0.0006025159],"genre_scores_gemma":[0.99826336,0.000021781798,0.0016678881,0.000007571152,0.000008020923,0.000008410216,0.000008771871,0.000011191859,0.0000029836965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995073,0.000012646449,0.00019493657,0.000097056465,0.00008017755,0.0001078567],"domain_scores_gemma":[0.99973667,0.00001852021,0.000040438503,0.00010674255,0.00005546788,0.000042161657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000049924634,0.00009148108,0.00012924538,0.00005699278,0.000046276426,0.00001660452,0.000047003887,0.00006630112,0.0000057745415],"category_scores_gemma":[0.000013646317,0.00009775707,0.000022440214,0.000142305,0.000078804354,0.00011483208,0.000010022443,0.00008428346,0.000004713613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018893488,0.000025020918,0.010143139,0.00007926897,0.000066001085,0.0000036473812,0.00050894683,0.0053136935,0.09922577,0.87426424,0.00007950171,0.0102718845],"study_design_scores_gemma":[0.0057605547,0.0002940891,0.038572405,0.0002864493,0.00010779813,0.00036944338,0.00068909524,0.0068562655,0.3077117,0.6373662,0.0011712882,0.00081474456],"about_ca_topic_score_codex":0.00003671865,"about_ca_topic_score_gemma":0.000022139757,"teacher_disagreement_score":0.23689805,"about_ca_system_score_codex":0.000038775397,"about_ca_system_score_gemma":0.0000227269,"threshold_uncertainty_score":0.39864177},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5422618,0.0026296608,0.2772825,0.014441655,0.029870544,0.0060845586,0.00017449503,0.0025400105,0.12471477],"genre_scores_gemma":[0.9966425,0.000022311313,0.0018806395,0.00026340407,0.000030316609,0.00008079632,0.000020509626,0.000012611785,0.0010469363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862653,0.00007322489,0.00021830645,0.00044299715,0.00028242005,0.00035654777],"domain_scores_gemma":[0.9984741,0.00043713916,0.00012902525,0.00055925915,0.00026738466,0.00013304123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004058635,0.00017876501,0.00018913437,0.00007511687,0.0010038322,0.000101811085,0.00084494066,0.00010571711,0.000052028772],"category_scores_gemma":[0.00037967454,0.00015412326,0.000101405036,0.00036836375,0.000043794364,0.0003025792,0.0010600737,0.00014601985,0.00014827578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006948469,0.00039121325,0.00012578667,0.000008958657,0.000016316004,0.0000025129773,0.0019326512,0.000006405911,0.00032168822,0.97240007,0.007842295,0.01694516],"study_design_scores_gemma":[0.0019566044,0.00064050633,0.0011452596,0.000029787476,0.000021913977,0.0000029587527,0.000022095812,0.28027803,0.0021183034,0.69521695,0.01822099,0.0003466134],"about_ca_topic_score_codex":0.0000126910845,"about_ca_topic_score_gemma":0.000005549974,"teacher_disagreement_score":0.4543807,"about_ca_system_score_codex":0.00014691621,"about_ca_system_score_gemma":0.000040907373,"threshold_uncertainty_score":0.7720767},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8972011,0.00007538998,0.09658065,0.0010931045,0.0030338732,0.00022820542,7.0570053e-7,0.00029333108,0.0014936146],"genre_scores_gemma":[0.9801784,0.000003309789,0.018790001,0.00084487314,0.000046538964,0.000007276945,0.0000016206168,0.000015121797,0.00011286027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984623,0.00006444351,0.0003170261,0.0004266533,0.0003020965,0.0004274874],"domain_scores_gemma":[0.9989536,0.00008858373,0.0000953849,0.0005515126,0.000068328,0.00024261221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024393458,0.00019785555,0.0002521993,0.00017982477,0.00021345753,0.00024342442,0.0009299564,0.00006353909,0.000016876811],"category_scores_gemma":[0.000029446968,0.00020068134,0.00008024246,0.00083842955,0.000028098595,0.00048231697,0.000452859,0.00011074984,0.00024595537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001592341,0.00022173063,0.002629816,0.000016456546,0.000043854605,0.00009688552,0.0009922396,0.0021905752,0.0053583025,0.9458482,0.005174704,0.03741129],"study_design_scores_gemma":[0.0016859687,0.0003246841,0.01663943,0.000111856694,0.000020392403,0.00023789468,0.000020934838,0.3248501,0.00291414,0.645617,0.0066941394,0.00088343094],"about_ca_topic_score_codex":0.000102562626,"about_ca_topic_score_gemma":0.000005451291,"teacher_disagreement_score":0.32265955,"about_ca_system_score_codex":0.00012404022,"about_ca_system_score_gemma":0.00010230795,"threshold_uncertainty_score":0.8183547},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903276,0.00037092197,0.00062726537,0.0009141116,0.0013252988,0.00010359154,7.606665e-7,0.00020726572,0.006123199],"genre_scores_gemma":[0.99855113,0.000029035835,0.00095651083,0.00017577402,7.791041e-7,0.0000052037544,4.1454575e-7,0.000010093324,0.00027105334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881625,0.000067576744,0.00026488266,0.00029872596,0.00028602182,0.00026656824],"domain_scores_gemma":[0.9990108,0.00012386125,0.00014139141,0.00052338146,0.00009843582,0.00010214642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036693565,0.00012472534,0.00019161314,0.00011930729,0.00012993706,0.000073255025,0.0005850953,0.000058517056,0.000035296256],"category_scores_gemma":[0.00006315325,0.00012130915,0.00007083778,0.00045170882,0.000051318915,0.0002467717,0.00021213767,0.00016753336,0.0001161951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.8791564e-7,0.00010148005,0.0049961065,0.000016510756,0.000013700419,0.000010180295,0.0006166137,0.000014749024,0.0017787453,0.98687094,0.0026394941,0.0029407733],"study_design_scores_gemma":[0.0011885801,0.00024544986,0.0011406606,0.0001019315,0.000012123512,0.000013775613,0.000054014174,0.015535837,0.017654728,0.9612761,0.0024261633,0.0003506378],"about_ca_topic_score_codex":0.000064173924,"about_ca_topic_score_gemma":0.0000012781528,"teacher_disagreement_score":0.02559486,"about_ca_system_score_codex":0.000017910128,"about_ca_system_score_gemma":0.000009543146,"threshold_uncertainty_score":0.49468437},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99609905,0.00006126624,0.000022806045,0.00012793725,0.0005303625,0.00045393937,0.000018532039,0.0000746726,0.0026114562],"genre_scores_gemma":[0.997752,0.000009891151,0.0021112354,0.000035495363,0.0000063116236,0.0000142231565,0.00001184207,0.000034473625,0.000024538736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985875,0.000053197775,0.0004438634,0.00030217433,0.00036375545,0.00024952943],"domain_scores_gemma":[0.9988709,0.00018763231,0.00022293368,0.00046929705,0.00018863406,0.000060584713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024993822,0.000208744,0.0004159503,0.00010962492,0.000055590437,0.0000064169385,0.00023053004,0.000046193712,0.000033242617],"category_scores_gemma":[0.00016051804,0.00019176451,0.00011298378,0.00031469113,0.00010752016,0.00007334239,0.000046270645,0.0001464302,0.0000050703993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060692983,0.0014831927,0.0018693352,0.00027407703,0.00018860151,0.0000075183416,0.002061077,0.0000028031989,0.001221482,0.99222744,0.0004059237,0.00019788402],"study_design_scores_gemma":[0.0020550718,0.0003514926,0.0055790506,0.00017359554,0.00008654438,0.0000034320092,0.00011495561,0.000005951432,0.060117558,0.9312818,0.000045433735,0.0001851049],"about_ca_topic_score_codex":0.00021673799,"about_ca_topic_score_gemma":0.000024426015,"teacher_disagreement_score":0.060945604,"about_ca_system_score_codex":0.000063834304,"about_ca_system_score_gemma":0.000108520384,"threshold_uncertainty_score":0.78199303},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98902357,0.000036788475,0.00026152888,0.0011375636,0.002710041,0.00067624834,0.00000901893,0.00010312791,0.006042131],"genre_scores_gemma":[0.99864143,0.000012082145,0.00063390203,0.0002470435,0.000022617418,0.000043538115,7.5703736e-7,0.000059105507,0.00033955014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783456,0.00027349283,0.00063016237,0.00025389466,0.00061473716,0.00039312753],"domain_scores_gemma":[0.9948868,0.0029869918,0.00053050776,0.0013961169,0.00012870235,0.0000708664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076136657,0.0002829917,0.00045115073,0.00006477579,0.00034203747,0.00004208228,0.001014955,0.000099363606,0.00008980716],"category_scores_gemma":[0.0012524582,0.00016651898,0.00024962137,0.00055875344,0.0001970608,0.00010244608,0.00026258468,0.00037769089,0.000055614255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022178916,0.00020769388,0.00017768648,0.00003532545,0.000050329694,0.0000029439288,0.0006171824,0.0000174522,0.0016782343,0.9941155,0.0030253853,0.000050088227],"study_design_scores_gemma":[0.00064092973,0.000066931665,0.00022495237,0.00016058909,0.00004633482,0.000010956847,0.00018306692,0.000046302655,0.003992565,0.9936204,0.00081921957,0.00018775463],"about_ca_topic_score_codex":0.000017358065,"about_ca_topic_score_gemma":0.000005054797,"teacher_disagreement_score":0.009617852,"about_ca_system_score_codex":0.0000735869,"about_ca_system_score_gemma":0.000042093452,"threshold_uncertainty_score":0.67904466},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9958576,0.0001850285,0.00018802266,0.000044309872,0.002092171,0.0001568897,0.00000493998,0.000111647176,0.0013594045],"genre_scores_gemma":[0.99945503,0.000104054656,0.000058328354,0.000017469481,0.000014043043,0.000022640917,0.0000028373117,0.000018317394,0.00030726084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932116,0.00006737579,0.00019689657,0.000099291276,0.00013311939,0.00018214293],"domain_scores_gemma":[0.9994376,0.00013944284,0.000028397462,0.0002699332,0.000060764116,0.00006388781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016842948,0.00010144379,0.00012616933,0.000047944555,0.00013013353,0.00006142943,0.00017775953,0.0000457547,0.000019457573],"category_scores_gemma":[0.000046532416,0.00008083627,0.000045696386,0.00036550325,0.000031251966,0.00012850964,0.000018249248,0.00007334606,0.000035820813],"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.0000170014,0.000037909842,0.010732826,0.000029836847,0.00011275272,0.0000054932957,0.00070255913,0.01556167,0.02742633,0.9410208,0.0026694664,0.0016833586],"study_design_scores_gemma":[0.001812106,0.0006481628,0.024823884,0.00034269824,0.00014530522,0.000045678946,0.00069879065,0.01966183,0.17995457,0.37343523,0.39672533,0.0017064182],"about_ca_topic_score_codex":0.000024526878,"about_ca_topic_score_gemma":0.000011747405,"teacher_disagreement_score":0.5675856,"about_ca_system_score_codex":0.000027393991,"about_ca_system_score_gemma":0.000011576166,"threshold_uncertainty_score":0.32964075},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85443175,0.002505009,0.0000010523055,0.00058696064,0.0097458055,0.00023070669,0.00007327722,0.000053402237,0.13237205],"genre_scores_gemma":[0.99113524,0.0001419378,0.000010988541,0.00014291154,0.000093946626,0.000011993951,0.000011358198,0.000034931127,0.008416713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984276,0.000045879195,0.00047931928,0.00028740655,0.00032757822,0.00043217916],"domain_scores_gemma":[0.9989554,0.000066495624,0.00024400806,0.00036264138,0.00028473392,0.00008666725],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020483414,0.0002886606,0.00047712662,0.00012322879,0.00062410644,0.00011682576,0.00029715072,0.0001169327,0.0010217234],"category_scores_gemma":[0.000044085842,0.0002691211,0.00021461037,0.00009823852,0.0007523315,0.00019678306,0.00012735894,0.00023421572,0.00049742823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035779274,0.00045222306,0.001004316,0.00022654906,0.00015993443,0.00003081977,0.02122383,0.0000051213005,0.000015766582,0.974433,0.0019078522,0.0005048245],"study_design_scores_gemma":[0.0033352252,0.0005265505,0.0028627913,0.00031587033,0.00014092098,0.0000049776622,0.004986806,0.0000023844575,0.0025741372,0.8658597,0.11881336,0.0005772676],"about_ca_topic_score_codex":0.00063710834,"about_ca_topic_score_gemma":0.00013724051,"teacher_disagreement_score":0.13670348,"about_ca_system_score_codex":0.00010658614,"about_ca_system_score_gemma":0.000106876214,"threshold_uncertainty_score":0.9999761},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98178935,0.0006358278,0.000007811362,0.000027536711,0.0017461856,0.00013032576,0.0000019622967,0.00026820265,0.015392809],"genre_scores_gemma":[0.99977165,0.000071106966,0.000012996777,0.000021881939,0.000008248371,0.000028853574,0.00000578418,0.00003166554,0.000047815924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909997,0.0000594261,0.00024138932,0.00015655553,0.000119685006,0.0003229776],"domain_scores_gemma":[0.9995847,0.000071233386,0.000025883623,0.00022790281,0.00001807241,0.00007221359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024694452,0.00015759384,0.00021914316,0.0001473635,0.00005005187,0.000029273164,0.0001864204,0.00009637901,0.000040250914],"category_scores_gemma":[0.000016313297,0.00017158131,0.00006386049,0.0003956989,0.000030731466,0.00015505767,0.000019177483,0.00018332122,0.00008006942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038753064,0.00006634166,0.1573282,0.0000487802,0.00005816419,0.00019979001,0.0014595687,0.0008895503,0.0014318879,0.8355427,0.0011711874,0.0017650992],"study_design_scores_gemma":[0.001964482,0.00008247138,0.06957824,0.00015477768,0.000013592287,0.000046072546,0.0007494564,0.0016535603,0.0014511648,0.9165619,0.0072147325,0.0005295446],"about_ca_topic_score_codex":0.00004450626,"about_ca_topic_score_gemma":0.00003835451,"teacher_disagreement_score":0.087749965,"about_ca_system_score_codex":0.000041949283,"about_ca_system_score_gemma":0.000006250502,"threshold_uncertainty_score":0.69968826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9587577,0.00002726255,0.017508803,0.00029415937,0.0015342104,0.0003313238,0.00003476141,0.00008699835,0.021424813],"genre_scores_gemma":[0.99908954,0.0000034265147,0.0004591915,0.00006701636,0.00013503268,0.00004700128,0.000035640514,0.000020239844,0.00014291519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917537,0.000030500043,0.00022264422,0.00018990078,0.00018412506,0.00019747193],"domain_scores_gemma":[0.99894404,0.00050211005,0.00011233719,0.00034055626,0.000050162787,0.000050788996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008246074,0.00014605229,0.00016922764,0.000018634917,0.00054031966,0.000058356673,0.00022769651,0.000035701865,0.000115634604],"category_scores_gemma":[0.000026854717,0.00011181332,0.00009733096,0.00013249052,0.00009455471,0.00017750586,0.000083776926,0.00020918436,0.00009691727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001341763,0.00009202086,0.0015969299,0.0000018383428,0.000023908657,5.755396e-7,0.00075656275,0.000011032619,0.0002078745,0.9960254,0.0005250383,0.00074539875],"study_design_scores_gemma":[0.00061404734,0.00002876859,0.0008312179,0.000031841846,0.0000188326,3.9359838e-7,0.00029210147,0.000599131,0.0012270972,0.9946588,0.001563137,0.00013458838],"about_ca_topic_score_codex":0.00011932009,"about_ca_topic_score_gemma":0.0000011616994,"teacher_disagreement_score":0.040331867,"about_ca_system_score_codex":0.0000277461,"about_ca_system_score_gemma":0.000019064622,"threshold_uncertainty_score":0.4559615},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24418435,0.0007165019,0.24783131,0.0012866998,0.0058207987,0.0006201007,0.000005192188,0.00570742,0.4938276],"genre_scores_gemma":[0.97621137,0.000005566034,0.02325,0.00021596739,0.0000018088185,0.000016272666,0.0000022855063,0.0000084917265,0.00028825036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991888,0.00003594371,0.00013404568,0.00023963039,0.00019130894,0.00021026503],"domain_scores_gemma":[0.99934965,0.000039361534,0.000056055876,0.00041414003,0.00006987146,0.00007094438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018993832,0.00009737122,0.00009589948,0.00005467126,0.000069452704,0.00028901352,0.00047824212,0.000043135387,0.00001048681],"category_scores_gemma":[0.00011761023,0.00009787594,0.000027362432,0.0002746231,0.000041117768,0.00085370283,0.00008331036,0.00008419737,0.00012723493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.067359e-7,0.00006169836,0.00040886892,0.000005119984,0.0000028109025,0.000010639047,0.00004137425,3.0222742e-7,0.00030490433,0.98787194,0.0075047556,0.0037868496],"study_design_scores_gemma":[0.00016722371,0.00005788418,0.00024057167,0.000015595224,0.0000016163726,0.000014721719,0.000002219751,0.00019999438,0.053848773,0.9341658,0.011153555,0.00013205757],"about_ca_topic_score_codex":0.0000033760336,"about_ca_topic_score_gemma":4.1950062e-7,"teacher_disagreement_score":0.732027,"about_ca_system_score_codex":0.00003158512,"about_ca_system_score_gemma":0.000048405054,"threshold_uncertainty_score":0.3991265},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9501643,0.00091052765,0.010297726,0.00035827074,0.0030609886,0.00060985185,0.000003511794,0.0006375016,0.033957288],"genre_scores_gemma":[0.9864304,0.000031488875,0.012142482,0.00025429946,0.000007636458,0.000048251986,0.0000030534334,0.00003897628,0.0010433908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967617,0.000652362,0.0003196182,0.00077587366,0.00075981405,0.0007306627],"domain_scores_gemma":[0.996303,0.00023733804,0.000101915495,0.0027728716,0.00019861906,0.00038621298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013126355,0.00026542065,0.00031695323,0.00031659607,0.00030521033,0.00020299289,0.002734118,0.000131673,0.000044430348],"category_scores_gemma":[0.0006048121,0.00026610662,0.00015478804,0.0014317996,0.00018266552,0.0011666882,0.0003726104,0.00034472937,0.00017713106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022434897,0.0001836829,0.000417453,0.0000053237454,0.000019115017,0.00009559724,0.00017655788,0.0000050396693,0.0017022094,0.99328476,0.00092729705,0.0031605286],"study_design_scores_gemma":[0.0019177152,0.00038235186,0.00061273784,0.000011756748,0.0000051087923,0.000035228433,0.00007998471,0.00028677276,0.005988502,0.9839742,0.006386036,0.00031959263],"about_ca_topic_score_codex":0.000014790891,"about_ca_topic_score_gemma":0.0000030856058,"teacher_disagreement_score":0.036266085,"about_ca_system_score_codex":0.000065850974,"about_ca_system_score_gemma":0.00016411301,"threshold_uncertainty_score":0.99997914},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9824288,0.00014765986,0.000012019432,0.0001933956,0.001065433,0.0002641884,0.0000063440243,0.00023026417,0.015651911],"genre_scores_gemma":[0.9968058,0.00008349069,0.0008593846,0.00012186177,0.000040430623,0.000031439886,0.0000065015624,0.00006197499,0.001989157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817204,0.00014796143,0.00029852506,0.00030762894,0.00055899663,0.0005148594],"domain_scores_gemma":[0.99840486,0.000540261,0.00007791654,0.0007044153,0.0001175194,0.0001550002],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005138022,0.00019237431,0.0003006316,0.00013852585,0.00022012182,0.000027507078,0.00050856476,0.00012589038,0.00024739362],"category_scores_gemma":[0.00061999005,0.00018842609,0.000111353496,0.0003129146,0.00017143635,0.00023308262,0.00018267924,0.00032468396,0.0008996795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029009581,0.0002386196,0.0017942974,0.00004207379,0.000040069852,0.00024573502,0.00044831124,2.390221e-7,0.00077093876,0.98260057,0.013639355,0.00015078901],"study_design_scores_gemma":[0.0009404258,0.0001037061,0.001992543,0.000019864696,0.000010413585,0.00009442418,0.00003840255,0.00003660021,0.0016013162,0.99266565,0.0022712676,0.0002253581],"about_ca_topic_score_codex":0.000016333233,"about_ca_topic_score_gemma":0.0000013090303,"teacher_disagreement_score":0.014376976,"about_ca_system_score_codex":0.00009707166,"about_ca_system_score_gemma":0.00010080557,"threshold_uncertainty_score":0.9998782},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9559164,0.0009937568,0.019916011,0.0043385336,0.0105650285,0.00083906227,0.000045689332,0.0010337668,0.0063517652],"genre_scores_gemma":[0.9843381,0.00003338778,0.0143916905,0.00064588786,0.00006161191,0.000033973894,0.00001163655,0.000013083023,0.00047064366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986077,0.00005922587,0.00026628183,0.0004620434,0.00025609665,0.00034863147],"domain_scores_gemma":[0.99864924,0.0003602765,0.000099651195,0.00065945357,0.00010476082,0.0001266363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005679076,0.00016046128,0.0001779917,0.0001069439,0.00024111214,0.000072146984,0.00091315137,0.000074730466,0.000003910413],"category_scores_gemma":[0.00008589634,0.00015539335,0.00013772816,0.00036830571,0.000074140145,0.00038998568,0.00023368158,0.00012993038,0.000059039066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013738948,0.00013660047,0.0002692327,0.0000053885424,0.00001834311,0.000033648532,0.00013235935,0.00003836439,0.0003803359,0.9935541,0.0034880533,0.0018061675],"study_design_scores_gemma":[0.0016134657,0.0003283276,0.0008089949,0.000034495297,0.000007664959,0.000028280752,0.0000068150653,0.0147868665,0.0009345803,0.9620899,0.019106735,0.0002539012],"about_ca_topic_score_codex":0.0000088622855,"about_ca_topic_score_gemma":9.735226e-7,"teacher_disagreement_score":0.031464245,"about_ca_system_score_codex":0.000024642351,"about_ca_system_score_gemma":0.000049672428,"threshold_uncertainty_score":0.6336757},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902302,0.00006544126,0.005763462,0.0002105033,0.0013200367,0.000052499312,5.3804206e-7,0.0001191129,0.0022382308],"genre_scores_gemma":[0.99868375,0.00001788689,0.0008078176,0.00026255418,0.000006941762,0.0000041270564,0.0000012655144,0.0000047864205,0.00021085153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999317,0.00002247447,0.000085923355,0.00024173778,0.00017939061,0.00015347719],"domain_scores_gemma":[0.99944705,0.00017076591,0.000037236445,0.00023849666,0.000030741794,0.00007569302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004012181,0.00009623242,0.000099242774,0.00004209344,0.00021267054,0.000024968496,0.0002367399,0.000041760944,0.000016873873],"category_scores_gemma":[0.00004008181,0.000081919425,0.00002476529,0.0001497047,0.00004925901,0.0003369595,0.00008551079,0.000118067874,0.000045545195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026645102,0.000053516836,0.0034825925,0.0000012643549,0.0000037656687,0.000021775779,0.0001440058,0.000019510084,0.000038206726,0.9949633,0.0007894291,0.0004799855],"study_design_scores_gemma":[0.00037015617,0.0001153279,0.055360083,0.00000454491,0.0000011085054,0.00003325828,0.0000076130736,0.0005323537,0.00062777434,0.9407832,0.0020228946,0.00014170642],"about_ca_topic_score_codex":0.0000042270494,"about_ca_topic_score_gemma":2.631106e-7,"teacher_disagreement_score":0.054180104,"about_ca_system_score_codex":0.000022440012,"about_ca_system_score_gemma":0.000025558302,"threshold_uncertainty_score":0.33405772},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9738682,0.00030850625,0.00027162596,0.0009679236,0.0036241163,0.00012771646,9.939994e-7,0.0004565734,0.020374376],"genre_scores_gemma":[0.9974981,0.0000050184967,0.0012617754,0.0005711499,0.0000016512803,0.000007361474,0.000003620961,0.000012179006,0.0006391597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865484,0.00005560576,0.00021705446,0.0004122146,0.0003274096,0.0003328913],"domain_scores_gemma":[0.9989753,0.00009800019,0.000051901327,0.0006902203,0.000095756004,0.000088818386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023516928,0.00016243012,0.0001522337,0.00016767111,0.00014955441,0.0001285222,0.00059308886,0.00007288115,0.000019781824],"category_scores_gemma":[0.000023588886,0.00014435656,0.00009082492,0.00057858485,0.00005754978,0.00020774039,0.000115759365,0.00015865512,0.0005096218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020967564,0.00015187448,0.0008337007,0.0000029727971,0.000004843525,0.000012995983,0.000029208502,0.000044640336,0.00049894326,0.9694317,0.028606208,0.00038083305],"study_design_scores_gemma":[0.0006054906,0.00011433048,0.0016790475,0.00001618446,0.0000036086672,0.000005731033,0.0000019530041,0.0009664989,0.0020600883,0.9928021,0.0015550912,0.00018989983],"about_ca_topic_score_codex":0.00010286769,"about_ca_topic_score_gemma":0.0000027616816,"teacher_disagreement_score":0.027051117,"about_ca_system_score_codex":0.000019666742,"about_ca_system_score_gemma":0.000030862597,"threshold_uncertainty_score":0.6550327},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9888366,0.000024042001,0.0023379857,0.00071519363,0.00077134214,0.0002956658,7.680744e-7,0.000020784772,0.0069976086],"genre_scores_gemma":[0.999129,0.000002032891,0.0006414441,0.000051358045,0.0000047292597,0.0000057559987,1.6498778e-7,0.000006518702,0.0001589769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987314,0.00016455646,0.0002056606,0.00019316294,0.0005071148,0.00019814515],"domain_scores_gemma":[0.9979652,0.0006920111,0.00015056062,0.0009708691,0.00019310546,0.000028247303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016554866,0.00007876843,0.00010607165,0.000049871753,0.000098329365,0.000013763573,0.0012503662,0.000021580716,0.000012494631],"category_scores_gemma":[0.00036266076,0.000045199387,0.00006630583,0.00078408094,0.00021274027,0.00014321393,0.00026499157,0.00017349551,0.000016016096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001356237,0.00008327504,0.0028560124,0.000005683392,0.000007814693,7.3487024e-7,0.00024126576,0.000014812571,0.0027822307,0.99024373,0.00017413107,0.003576715],"study_design_scores_gemma":[0.00029275805,0.000027222904,0.011327818,0.000017952849,0.0000017808846,0.0000024385934,0.00001536258,0.00015879706,0.14527854,0.8427617,0.00007034827,0.00004529513],"about_ca_topic_score_codex":0.000012247571,"about_ca_topic_score_gemma":0.0000028903341,"teacher_disagreement_score":0.14748208,"about_ca_system_score_codex":0.00003238864,"about_ca_system_score_gemma":0.00003955031,"threshold_uncertainty_score":0.23235124},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9935595,0.00012864944,0.000088909794,0.000043019078,0.0020401317,0.00012526264,0.000013163226,0.00010757635,0.0038938182],"genre_scores_gemma":[0.9998815,0.000004502322,0.000057671874,0.000015306725,0.0000033598658,0.000010657425,0.0000022153065,0.000013217759,0.000011535522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953616,0.000026108277,0.00015786548,0.00006651292,0.000093694165,0.000119637334],"domain_scores_gemma":[0.9996164,0.000028319115,0.000026072954,0.0002726623,0.000024040763,0.000032524957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007328834,0.000080868005,0.000111915346,0.000037888796,0.0000787291,0.0000075992943,0.00019812406,0.000036375248,0.000009648257],"category_scores_gemma":[0.0000055912133,0.000064415115,0.00009852806,0.00023768266,0.000058768237,0.0000459813,0.000020136384,0.00009374927,0.000021716874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016746375,0.000033627744,0.0007505268,0.000027047881,0.00003424434,9.4811503e-7,0.00026031843,0.0059297825,0.018320825,0.9744208,0.00018952756,0.000030707037],"study_design_scores_gemma":[0.00085763296,0.000025354868,0.011728155,0.000084030966,0.000017887292,0.000009854304,0.00008070007,0.00020229186,0.02437338,0.96167815,0.00080327614,0.00013926618],"about_ca_topic_score_codex":0.00002175782,"about_ca_topic_score_gemma":0.000006293935,"teacher_disagreement_score":0.0127426,"about_ca_system_score_codex":0.000020217009,"about_ca_system_score_gemma":0.0000064295336,"threshold_uncertainty_score":0.26267722},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9962963,0.000030170111,0.00016821086,0.00005223419,0.00049329345,0.00034037963,0.000002219354,0.000042776875,0.0025744245],"genre_scores_gemma":[0.99763656,0.0000017774419,0.00201176,0.000047808433,0.0000112066755,0.000010887455,8.1044874e-7,0.000036046105,0.00024317205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826306,0.000110780515,0.0004518869,0.00023910165,0.0005070452,0.0004281228],"domain_scores_gemma":[0.9976038,0.0015974103,0.000107188105,0.00045579902,0.0001127871,0.00012301235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017600905,0.00015249112,0.00030695784,0.00042738044,0.00003607969,0.000017013344,0.00036659953,0.000098491575,0.00006174886],"category_scores_gemma":[0.0014619201,0.00014823813,0.000062559135,0.0006305526,0.000040852727,0.000054054537,0.0001424962,0.0002840064,0.000088138506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026368693,0.00057715265,0.008557048,0.00008005118,0.000013541348,0.00007327383,0.0013371044,0.0000054941684,0.012198009,0.9748008,0.00034908415,0.0017447184],"study_design_scores_gemma":[0.0009569982,0.00032088644,0.008109355,0.00026490467,0.0000059250638,0.0000057559287,0.00008875851,0.000086860804,0.04415019,0.9458017,0.000049219292,0.00015946626],"about_ca_topic_score_codex":0.000042220145,"about_ca_topic_score_gemma":0.000032816657,"teacher_disagreement_score":0.03195218,"about_ca_system_score_codex":0.0001122909,"about_ca_system_score_gemma":0.00004127407,"threshold_uncertainty_score":0.60449755},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9647357,0.0001703388,0.00094991946,0.00013909335,0.0011260087,0.0003412819,0.00000275336,0.00011318794,0.0324217],"genre_scores_gemma":[0.99504876,0.000012797126,0.0028441646,0.000011138128,0.000012555953,0.000010312532,5.22186e-7,0.000023127726,0.0020366134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866474,0.000046982037,0.0004989003,0.00015061404,0.00033351206,0.0003052463],"domain_scores_gemma":[0.99587953,0.0030506568,0.00018492216,0.0006498622,0.00016204962,0.00007298808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014680739,0.00012648392,0.0002460786,0.000029668145,0.000147168,0.000021248485,0.00034723594,0.00006904386,0.00004157648],"category_scores_gemma":[0.00273431,0.00008992758,0.000100341815,0.00017745663,0.0002981292,0.000109700835,0.00012876635,0.00016484098,0.0000384704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013416938,0.0001493185,0.0008240766,0.00009211927,0.000019834366,0.0000017988442,0.0002473099,1.1540081e-7,0.00026083653,0.99657816,0.0014350071,0.00037800818],"study_design_scores_gemma":[0.00028506442,0.00003649157,0.0012247445,0.00002723673,0.000018528157,0.0000030434169,0.00033247017,0.000008177975,0.008517721,0.98833823,0.0011129288,0.00009535029],"about_ca_topic_score_codex":0.000007513776,"about_ca_topic_score_gemma":0.000022303211,"teacher_disagreement_score":0.030385086,"about_ca_system_score_codex":0.00007144997,"about_ca_system_score_gemma":0.000024083145,"threshold_uncertainty_score":0.366714},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98822165,0.0008140256,0.003932304,0.00008225428,0.0011978276,0.00013811523,0.0000044179346,0.00015937272,0.0054500513],"genre_scores_gemma":[0.9903749,0.0000502554,0.009437411,0.000020807764,0.000008507624,0.0000031210154,0.0000037554896,0.000020120113,0.00008112006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939686,0.000009388748,0.00022299329,0.00010189765,0.000111753594,0.00015709626],"domain_scores_gemma":[0.999653,0.00004182002,0.00003395004,0.00017386866,0.000025881733,0.00007150117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000078992685,0.0001060591,0.0002449958,0.000039135117,0.000027047565,0.00001442376,0.000090332476,0.000076158045,0.000046986926],"category_scores_gemma":[0.000010935851,0.00011092368,0.00002833107,0.000073130046,0.000027648519,0.000066954904,0.000029303981,0.00010456546,0.000023340652],"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.000005416828,0.00009280629,0.0035387964,0.000088841356,0.00004674803,0.0000019629683,0.00057653687,0.025078539,0.0038902948,0.9572889,0.002582855,0.006808279],"study_design_scores_gemma":[0.0021827896,0.00021636339,0.005739693,0.00009014536,0.00006954187,0.000010584319,0.00032095588,0.7907289,0.025466587,0.17003936,0.004502025,0.0006330516],"about_ca_topic_score_codex":0.0000055878195,"about_ca_topic_score_gemma":0.0000032701907,"teacher_disagreement_score":0.78724957,"about_ca_system_score_codex":0.000021412865,"about_ca_system_score_gemma":0.000006743032,"threshold_uncertainty_score":0.45233363},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9382025,0.00060207385,0.056331836,0.00075356965,0.0021164431,0.0007528605,0.000002421039,0.00032652554,0.00091178436],"genre_scores_gemma":[0.9969411,0.000017757688,0.0027445273,0.00020995659,0.000014764385,0.000026405165,0.000001822684,0.0000081667895,0.000035517864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870807,0.00008659185,0.00022859333,0.0005092652,0.00028874606,0.00017871684],"domain_scores_gemma":[0.99861366,0.00016414067,0.0000987906,0.00086916704,0.00014725307,0.00010699337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002474299,0.00013229309,0.00016798331,0.00008624555,0.00010907315,0.00005742259,0.00039479873,0.000064331136,0.000013898009],"category_scores_gemma":[0.000040823285,0.00012810755,0.000038722363,0.00032045436,0.000062697545,0.00040338948,0.00022320004,0.0001122576,0.00004274175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004949862,0.0005026583,0.000422655,0.000011441394,0.000005205476,0.000001218278,0.00012767305,0.00008279613,0.0002439404,0.9345466,0.0004546418,0.06359624],"study_design_scores_gemma":[0.0005148331,0.00070663844,0.015367677,0.000010376092,0.0000061388537,0.000004754295,0.000008989039,0.058065817,0.00032558257,0.9242998,0.00053930696,0.00015008631],"about_ca_topic_score_codex":0.000011124398,"about_ca_topic_score_gemma":6.9732636e-7,"teacher_disagreement_score":0.06344616,"about_ca_system_score_codex":0.00005538742,"about_ca_system_score_gemma":0.000012080829,"threshold_uncertainty_score":0.5224074},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9867732,0.0012349663,0.009978756,0.00023084159,0.0007426043,0.000377433,0.0000040148957,0.000128165,0.0005300245],"genre_scores_gemma":[0.96994305,0.000029153813,0.02984017,0.00011055218,3.0765523e-7,0.00002335682,0.0000017173128,0.000013328564,0.000038396993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988657,0.000050881656,0.00022458576,0.00037334758,0.00021352377,0.00027194637],"domain_scores_gemma":[0.99898285,0.00013103923,0.00012722338,0.0004255396,0.00023500607,0.000098338016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032824246,0.00015422638,0.0002385141,0.000093271934,0.00013966758,0.00005765928,0.00026573663,0.000049978848,0.0000018598224],"category_scores_gemma":[0.00007773341,0.00013098939,0.000052602398,0.00049471605,0.00012663742,0.00016776427,0.000037105357,0.0000804648,0.0000012013508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010501957,0.00007264192,0.0050596916,0.000041564566,0.000034202985,0.0000021668625,0.00020201522,0.000038134727,0.0014846819,0.9925144,0.0002658832,0.00027412752],"study_design_scores_gemma":[0.0026979484,0.00027177768,0.000227375,0.00005496488,0.000022141356,0.000008176616,0.000046388963,0.001146618,0.006763626,0.9876475,0.0009024957,0.00021098478],"about_ca_topic_score_codex":0.000032523254,"about_ca_topic_score_gemma":0.000011147363,"teacher_disagreement_score":0.019861413,"about_ca_system_score_codex":0.000009155706,"about_ca_system_score_gemma":0.000086158754,"threshold_uncertainty_score":0.5341592},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9710391,0.0009756465,0.0000048490933,0.0000076018973,0.0029186502,0.00021665558,0.0000036781557,0.0001380812,0.024695711],"genre_scores_gemma":[0.99901575,0.000016432636,0.0000036310305,0.0000016180775,0.00001137776,0.00004213178,0.0000040997134,0.0000238094,0.000881151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998943,0.000095151765,0.00043456102,0.00012300303,0.0001551547,0.00024913138],"domain_scores_gemma":[0.99939615,0.000107646374,0.00006255401,0.00036262083,0.000041337753,0.000029703731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046651554,0.00013041221,0.00022665471,0.000049386876,0.00005831415,0.000028401393,0.00020163757,0.000090675785,0.000011004792],"category_scores_gemma":[0.000018658075,0.00010507563,0.00006378739,0.0003613041,0.000038898575,0.00005468718,0.000017307471,0.00013596819,0.000021354479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021631367,0.00006479511,0.013333006,0.0000722202,0.000040657564,0.000015303747,0.000106264524,0.0014752646,0.0018362878,0.9788405,0.004065464,0.0001286511],"study_design_scores_gemma":[0.0057233465,0.00009327286,0.053213887,0.000500263,0.00006668639,0.00009623337,0.0010157157,0.01837467,0.018445149,0.8806974,0.020761237,0.001012131],"about_ca_topic_score_codex":0.00027950451,"about_ca_topic_score_gemma":0.000022708891,"teacher_disagreement_score":0.09814305,"about_ca_system_score_codex":0.000041470674,"about_ca_system_score_gemma":0.000008978682,"threshold_uncertainty_score":0.428486},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9724319,0.000010580541,0.024251897,0.00022222052,0.00083457946,0.000085569074,8.0849213e-7,0.000101656566,0.002060768],"genre_scores_gemma":[0.9988357,0.000018507522,0.00074760325,0.00022158741,0.0000045539355,0.0000066261014,0.00000435216,0.000005340472,0.00015574842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993407,0.0000262654,0.00014213382,0.00018649054,0.00015453446,0.00014985235],"domain_scores_gemma":[0.99943787,0.00003936764,0.000091856746,0.00034359135,0.00004588057,0.000041435553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006445012,0.000081697544,0.00012297538,0.00005503487,0.000041794425,0.000019470037,0.00036771587,0.00003496311,0.000015930946],"category_scores_gemma":[0.000023811417,0.00007459206,0.00003395118,0.00031820853,0.000018866796,0.00024503193,0.000061790335,0.000062262545,0.000053109357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008319066,0.00007083764,0.00081041385,0.0000032393116,0.0000033619062,0.0000070788733,0.00006931671,0.000010819225,0.021113183,0.9739669,0.000035075867,0.003901434],"study_design_scores_gemma":[0.00065299997,0.00024584777,0.031336453,0.000022096712,0.000002139249,0.000008065248,0.0000032822131,0.0027499383,0.009499519,0.9545746,0.0007604862,0.00014461484],"about_ca_topic_score_codex":0.0000013584779,"about_ca_topic_score_gemma":1.4410816e-7,"teacher_disagreement_score":0.030526038,"about_ca_system_score_codex":0.000018798013,"about_ca_system_score_gemma":0.000014918172,"threshold_uncertainty_score":0.3041776},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96547633,0.0002567808,0.00049028406,0.00029499352,0.00042918572,0.00022205338,0.0000017501577,0.000085469605,0.032743152],"genre_scores_gemma":[0.99345326,0.000042098432,0.005290283,0.000011481834,0.000005697984,0.000012120285,1.08757035e-7,0.000020714946,0.0011642061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992067,0.00004872149,0.0002705954,0.00011626003,0.00017338352,0.00018431431],"domain_scores_gemma":[0.99718034,0.0022501603,0.00013006834,0.00032882596,0.000066049455,0.000044566827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035741553,0.00010266358,0.00019999521,0.000009808186,0.00015201903,0.000022106387,0.00015410318,0.000043651195,0.0000504026],"category_scores_gemma":[0.0014182206,0.00006927653,0.000037512855,0.00010998462,0.00021323231,0.00007871191,0.00010049222,0.000103142396,0.000029719435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032118462,0.000052502153,0.00024921753,0.000071185,0.000015795253,0.0000013813303,0.00050609716,6.1319554e-8,0.00006755284,0.9972766,0.00033532988,0.0014210872],"study_design_scores_gemma":[0.00026216626,0.000015637797,0.000041124964,0.00004209963,0.000015217099,0.000009379098,0.00024757508,0.00011030188,0.0016714893,0.99674875,0.0007546702,0.00008156935],"about_ca_topic_score_codex":8.229703e-7,"about_ca_topic_score_gemma":3.3407855e-7,"teacher_disagreement_score":0.031578947,"about_ca_system_score_codex":0.000012384002,"about_ca_system_score_gemma":0.0000031779769,"threshold_uncertainty_score":0.2825015},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019164046,0.000023461773,0.976456,0.00016959803,0.001167736,0.00045658764,0.000004459913,0.0006810288,0.0018770694],"genre_scores_gemma":[0.58605415,0.0000027426638,0.4133382,0.00038493724,0.000017164817,0.00004398651,0.000007994478,0.000017293993,0.0001334963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856484,0.00007071369,0.00028653888,0.00045012514,0.00019271745,0.0004350719],"domain_scores_gemma":[0.9985405,0.00040974683,0.00012238843,0.0005831019,0.00017311593,0.00017113978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001747802,0.00016195812,0.00020020423,0.00018207333,0.00019104884,0.0001767024,0.00085426046,0.00013568059,0.000016807106],"category_scores_gemma":[0.000114582836,0.00016660488,0.00009711019,0.0003689405,0.000024078226,0.0007314117,0.00010659714,0.00014704613,0.000023155342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001881027,0.00014951978,0.00011354794,0.000013690074,0.000020207499,0.000009766466,0.00034999996,9.195428e-7,0.020281257,0.8123286,0.0019569811,0.1647567],"study_design_scores_gemma":[0.00095129653,0.0004683889,0.00036381566,0.000016787686,0.000010091129,0.000013151299,0.000030756597,0.018955823,0.3455388,0.6260919,0.0072311265,0.0003280667],"about_ca_topic_score_codex":0.000024824842,"about_ca_topic_score_gemma":0.000005600091,"teacher_disagreement_score":0.5668901,"about_ca_system_score_codex":0.000093165596,"about_ca_system_score_gemma":0.00005755309,"threshold_uncertainty_score":0.67939496},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97373545,0.000064380605,0.012977798,0.0005022015,0.0007270157,0.00022885457,0.0000021680096,0.00014528478,0.011616851],"genre_scores_gemma":[0.9981731,0.000017461964,0.0015397392,0.000057822665,0.0000015527744,0.000019848192,0.0000023641905,0.0000086925065,0.00017941114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987266,0.0001446677,0.0001870339,0.00027240778,0.00041450246,0.0002547567],"domain_scores_gemma":[0.9985002,0.00041387853,0.00007268521,0.00076594064,0.00016057727,0.00008666433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035104927,0.00010077363,0.00014139427,0.00023482779,0.000110308996,0.000030187384,0.00084491866,0.00003867997,0.000044644126],"category_scores_gemma":[0.00023198678,0.00009348335,0.00006847334,0.0010821285,0.0000987474,0.00029211194,0.00015000683,0.00014321301,0.00007582094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001251887,0.00014224453,0.0011348184,0.0000024654464,0.000012219581,0.000007603119,0.00012717034,0.000062432206,0.00058094447,0.99449986,0.00020646067,0.003211276],"study_design_scores_gemma":[0.00052281556,0.00020628446,0.0038366911,0.000013084457,0.000002380053,0.0000041976346,0.0000126807445,0.0019399722,0.0021644828,0.99100536,0.00019222702,0.0000998242],"about_ca_topic_score_codex":0.000007365732,"about_ca_topic_score_gemma":0.000002543332,"teacher_disagreement_score":0.02443766,"about_ca_system_score_codex":0.000025768228,"about_ca_system_score_gemma":0.00004618225,"threshold_uncertainty_score":0.38121402},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4873937,0.00091161905,0.502728,0.0027924026,0.0026449924,0.0026819739,0.000070597096,0.00044423496,0.00033249045],"genre_scores_gemma":[0.7708381,0.000031799005,0.22814405,0.0002324063,0.00004763698,0.00027759548,0.0000135100545,0.000038759423,0.00037617577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998471,0.000054159944,0.00025199584,0.00046064946,0.00020379292,0.0005583968],"domain_scores_gemma":[0.9985367,0.00063784525,0.00009103376,0.0004886357,0.00008016889,0.0001656111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005445261,0.00018370592,0.00024943717,0.00023071052,0.00032306244,0.0001483722,0.000777819,0.000083551735,0.0000023909288],"category_scores_gemma":[0.000093533105,0.00018521231,0.000103270366,0.0003195707,0.00009747417,0.00058033323,0.00020129397,0.00012331746,0.000008130088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002852624,0.00011536864,0.00025523335,0.000055360077,0.00006216088,0.0000039121,0.0004884389,0.000010132858,0.0009957245,0.7925088,0.0053996164,0.20007673],"study_design_scores_gemma":[0.003491335,0.00047215505,0.00046526227,0.00003877971,0.000016295344,0.000022028,0.000037349146,0.13883394,0.005157264,0.8357588,0.015290362,0.00041643195],"about_ca_topic_score_codex":0.00000452065,"about_ca_topic_score_gemma":0.0000044308317,"teacher_disagreement_score":0.28344437,"about_ca_system_score_codex":0.00006811,"about_ca_system_score_gemma":0.000050477498,"threshold_uncertainty_score":0.7552739},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94480056,0.00019095611,0.04715294,0.000016632768,0.005082278,0.00047220424,0.000019333755,0.0006551856,0.0016099039],"genre_scores_gemma":[0.988562,0.0000031447491,0.011242663,0.000018297142,0.00003508952,0.00006771372,0.000012662674,0.000048119506,0.0000102929935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911463,0.00003265146,0.00023624401,0.00019123775,0.00011040525,0.00031482746],"domain_scores_gemma":[0.9994596,0.000059947593,0.000035875764,0.00027692932,0.00004605036,0.000121596015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028251117,0.00017491863,0.00021493428,0.000061695704,0.00011754865,0.00005956486,0.00017773214,0.0000719148,0.000009533235],"category_scores_gemma":[0.000014429572,0.00018465164,0.00008600418,0.00013854034,0.000047494446,0.00019690854,0.000011638046,0.00011979955,0.00001930895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006998172,0.000052745603,0.00026684933,0.000052043288,0.000070796596,0.000010966765,0.00045755628,0.0027610518,0.008081737,0.96652585,0.00011103816,0.02160236],"study_design_scores_gemma":[0.002902844,0.00017170967,0.00010213339,0.000073099036,0.00003141194,0.000043689655,0.0006253641,0.008309613,0.04427186,0.9422608,0.00076959137,0.00043787225],"about_ca_topic_score_codex":0.000016795153,"about_ca_topic_score_gemma":0.0000034452971,"teacher_disagreement_score":0.04376145,"about_ca_system_score_codex":0.00007362773,"about_ca_system_score_gemma":0.00002067495,"threshold_uncertainty_score":0.7529875},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26208112,0.0026597527,0.5470934,0.1333624,0.0075523905,0.004432463,0.000024424853,0.002862334,0.03993172],"genre_scores_gemma":[0.95273817,0.000022446993,0.0369032,0.0018107975,0.000053905365,0.00024758663,0.0000048052434,0.000019422405,0.008199674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893373,0.000099213365,0.00022875419,0.0002909541,0.00020089513,0.00024643049],"domain_scores_gemma":[0.99879223,0.00009012401,0.000060527324,0.0008765962,0.0000655444,0.00011499953],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047041627,0.00011735582,0.00011600277,0.00005659662,0.00027952046,0.00012511581,0.0012773096,0.00005267245,0.000048148657],"category_scores_gemma":[0.000020637262,0.00008786736,0.00006435027,0.0006760115,0.000024586647,0.00022089419,0.00025908538,0.00014211363,0.0015060981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001627498,0.000039750084,0.000014300838,0.0000014790883,0.000009470216,0.0000011556622,0.0002642366,0.00031208253,0.00010252079,0.974608,0.0059343018,0.018711077],"study_design_scores_gemma":[0.00035476565,0.000022107386,0.00007268343,0.0000033070269,0.000005484822,0.00001277532,0.00000972477,0.016136052,0.0007369591,0.5846844,0.39781904,0.00014272491],"about_ca_topic_score_codex":0.00000788439,"about_ca_topic_score_gemma":0.0000015409832,"teacher_disagreement_score":0.690657,"about_ca_system_score_codex":0.000038973416,"about_ca_system_score_gemma":0.000038144495,"threshold_uncertainty_score":0.99927133},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97834593,0.00070380146,0.007469962,0.0003552795,0.0012266437,0.000101850215,0.0000025429094,0.00009616187,0.011697825],"genre_scores_gemma":[0.9985134,0.00007177855,0.0012753885,0.00007342686,0.0000025480206,0.000003317858,2.0723758e-7,0.0000037198956,0.000056184723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918413,0.00006465792,0.00021877345,0.00017782458,0.00019579173,0.0001588403],"domain_scores_gemma":[0.9987127,0.00050536223,0.00012572245,0.00052895944,0.00008231214,0.00004492273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019295397,0.000085770705,0.00016614812,0.00010384483,0.000039013285,0.000016565473,0.0007736834,0.000049722777,0.000089401176],"category_scores_gemma":[0.00012031256,0.00008443034,0.00009686056,0.00054138416,0.000066384455,0.00020248488,0.00016406787,0.00008420684,0.000015430622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005460764,0.00013207832,0.0031005256,0.000026924214,0.000013518362,0.0000039196525,0.0004600694,0.000004575821,0.0010083988,0.9871489,0.0009197175,0.0071759433],"study_design_scores_gemma":[0.0004995056,0.0004657396,0.0019418626,0.00008519697,0.000010307929,0.0000037418351,0.000021727114,0.003368751,0.03855425,0.9537237,0.0011540384,0.00017117718],"about_ca_topic_score_codex":0.0000068208947,"about_ca_topic_score_gemma":6.3271705e-7,"teacher_disagreement_score":0.037545852,"about_ca_system_score_codex":0.0000045447223,"about_ca_system_score_gemma":0.000010545036,"threshold_uncertainty_score":0.34429693},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.960986,0.0007762548,0.00026663704,0.0009850283,0.0021768506,0.0001576792,0.000002503798,0.0005964359,0.034052595],"genre_scores_gemma":[0.9974841,0.000064497704,0.00090235565,0.0006707187,0.000014497665,0.000012228955,0.0000017135615,0.000012971561,0.000836935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869037,0.000112139205,0.0001900647,0.0003976318,0.0002544232,0.00035538923],"domain_scores_gemma":[0.9988091,0.00011040257,0.000041569838,0.00086845027,0.000039204115,0.00013129532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034534308,0.0001654669,0.00017389577,0.00010617237,0.00021713802,0.00013496727,0.0011046384,0.000080871985,0.00035864077],"category_scores_gemma":[0.000013675533,0.0001652605,0.000115168026,0.00053457,0.000081288876,0.0006229015,0.00015018228,0.00018598312,0.00061873253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018220499,0.00011886137,0.00043850794,0.0000026866242,0.000015351938,0.00004519009,0.00028713132,0.0000049780388,0.00012781186,0.98671603,0.0056921034,0.006533134],"study_design_scores_gemma":[0.00048011064,0.00021000682,0.004121028,0.000017876155,0.0000048507814,0.000017504406,0.000006599489,0.00019707244,0.00079797144,0.9759881,0.017917156,0.00024171291],"about_ca_topic_score_codex":0.00001480966,"about_ca_topic_score_gemma":9.0770624e-7,"teacher_disagreement_score":0.036498066,"about_ca_system_score_codex":0.000023882805,"about_ca_system_score_gemma":0.00004063332,"threshold_uncertainty_score":0.7952761},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9810271,0.00018007675,0.0000063670864,0.000007289564,0.0059988117,0.00017953364,0.000003072623,0.00024057782,0.012357155],"genre_scores_gemma":[0.999461,0.000028027138,0.000009781766,0.0000045742895,0.000039268416,0.000029317142,0.00000449639,0.000029731178,0.00039380355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991447,0.000050675997,0.00022125879,0.00014747166,0.00015236018,0.0002835314],"domain_scores_gemma":[0.99962336,0.000032144395,0.000019305524,0.00024013313,0.000020286732,0.000064767366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014349479,0.0001520032,0.00020225835,0.000078546334,0.000059052585,0.000013653484,0.00017300343,0.00010420217,0.00003250463],"category_scores_gemma":[0.000019508347,0.000120204044,0.0000519795,0.000219044,0.000037772832,0.00015300178,0.000018949022,0.00021135794,0.00009793604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019852702,0.0006502162,0.17427437,0.00036264217,0.0002658604,0.00074513,0.010288649,0.0040633734,0.01850767,0.73994595,0.046911,0.0037866086],"study_design_scores_gemma":[0.023304407,0.0011010745,0.2852873,0.00056405726,0.000086312095,0.0003729834,0.0013173699,0.010067481,0.041742112,0.39781138,0.23318642,0.005159108],"about_ca_topic_score_codex":0.00010384915,"about_ca_topic_score_gemma":0.000021199867,"teacher_disagreement_score":0.34213457,"about_ca_system_score_codex":0.000072038856,"about_ca_system_score_gemma":0.000020654754,"threshold_uncertainty_score":0.49017784},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96862376,0.0058268737,0.0113965655,0.0014102926,0.0006223326,0.0003969453,0.00000972158,0.0013068694,0.010406653],"genre_scores_gemma":[0.9362711,0.0001824329,0.06329701,0.00016905382,0.0000030287342,0.00002244308,0.0000018077159,0.000013349212,0.0000398257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983341,0.000052765652,0.00038537983,0.0004853084,0.00039852722,0.0003439323],"domain_scores_gemma":[0.99874336,0.00010487118,0.00022490625,0.00057351135,0.00021938278,0.00013397328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043814362,0.00022562401,0.00028949548,0.00036977718,0.00011673728,0.00030144834,0.0011923613,0.0001023333,0.0000032957912],"category_scores_gemma":[0.00006221355,0.00021234322,0.00009616743,0.001099744,0.0004943603,0.0019139851,0.0003022397,0.0001613939,0.00000538894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038984026,0.00010336326,0.0054554394,0.000047522542,0.000021367248,0.000012805513,0.00023872004,0.0000014578854,0.0035279058,0.9241778,0.00072548486,0.06568419],"study_design_scores_gemma":[0.00030558722,0.00018519296,0.0013376087,0.000101450445,0.000011231579,0.000036865047,0.000019019108,0.00093430845,0.0635356,0.93270713,0.00054552057,0.00028046456],"about_ca_topic_score_codex":0.00005857368,"about_ca_topic_score_gemma":0.000017316179,"teacher_disagreement_score":0.06540373,"about_ca_system_score_codex":0.000020845155,"about_ca_system_score_gemma":0.00009308958,"threshold_uncertainty_score":0.86591053},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9619966,0.0003395951,0.000018791876,0.00025364113,0.000733671,0.0001531914,0.000020477835,0.000071728005,0.03641229],"genre_scores_gemma":[0.9970512,0.0000067964806,0.0002735011,0.0001398563,0.000022074542,0.000015115835,0.000014684927,0.000030396091,0.0024463963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989007,0.000028128694,0.0004054198,0.00031743155,0.000047231664,0.0003010571],"domain_scores_gemma":[0.99919254,0.00008125006,0.0002945448,0.000317389,0.000026602616,0.000087650114],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058277854,0.00015391874,0.00031822865,0.00009247069,0.00019556786,0.00004926721,0.00021795217,0.00007280416,0.00020538364],"category_scores_gemma":[0.000049612016,0.00016178835,0.000047342157,0.00018296341,0.00005040329,0.00017791876,0.00007466206,0.00012629834,0.0018220098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003228664,0.00010182915,0.08361212,0.000019623667,0.000039773,0.000005398411,0.0006912311,0.00005828938,0.00011894307,0.9140888,0.0008313621,0.00040035514],"study_design_scores_gemma":[0.011918112,0.0006395814,0.12252576,0.00039274356,0.000034726618,0.00015004276,0.0004098977,0.009309863,0.0038349251,0.7172712,0.13136865,0.0021444801],"about_ca_topic_score_codex":0.000065904416,"about_ca_topic_score_gemma":0.000013065897,"teacher_disagreement_score":0.19681756,"about_ca_system_score_codex":0.00016250121,"about_ca_system_score_gemma":0.000006667356,"threshold_uncertainty_score":0.9989552},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9968959,0.00031152097,0.000022230386,0.000011592151,0.0003975655,0.00011513783,0.0000027595534,0.000108085944,0.0021351804],"genre_scores_gemma":[0.9998133,0.000009539834,0.00011622274,0.0000048719767,0.0000073358297,0.000009811385,5.592069e-7,0.000025752792,0.0000125852075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999444,0.00001132663,0.00013810604,0.00012383203,0.00011360474,0.00016913826],"domain_scores_gemma":[0.99967444,0.000041367424,0.00003021445,0.00017221448,0.000024764291,0.000057026275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010522747,0.00013593119,0.00019985082,0.00005209074,0.00003774224,0.000016775753,0.00009293708,0.00004587388,0.000005291041],"category_scores_gemma":[0.0000085371175,0.00011815085,0.000035609537,0.00014202816,0.000057425634,0.000091579095,0.000019824543,0.000090565656,0.0000057383763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014997783,0.00011213706,0.04648313,0.00048537255,0.00032135757,0.00006415641,0.001500758,0.009370876,0.04203485,0.8987593,0.00009613093,0.00062196824],"study_design_scores_gemma":[0.015829407,0.002258211,0.10279443,0.00090090226,0.00022083032,0.00042150004,0.00057961635,0.0018233819,0.12215401,0.75041693,0.0010520094,0.0015487662],"about_ca_topic_score_codex":0.000041447678,"about_ca_topic_score_gemma":0.000023489127,"teacher_disagreement_score":0.14834236,"about_ca_system_score_codex":0.000018116867,"about_ca_system_score_gemma":0.000011223706,"threshold_uncertainty_score":0.48180518},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9802988,0.00016745333,0.017215565,0.0003425309,0.00071910286,0.0003062327,0.0000016485278,0.00024745282,0.00070118404],"genre_scores_gemma":[0.991752,0.000006778092,0.008060661,0.00009666291,0.000004374714,0.00003257268,0.0000033955782,0.000022040504,0.000021499342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977906,0.00010958561,0.0003434151,0.00053416326,0.00048647125,0.0007357985],"domain_scores_gemma":[0.99869734,0.00020192358,0.000108493914,0.00071469485,0.00013036247,0.000147175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070340576,0.0002023476,0.0002543143,0.0003850473,0.00020550165,0.00014805117,0.0011803014,0.000077669785,0.000004827625],"category_scores_gemma":[0.0002053172,0.00021654103,0.00007748955,0.0016334773,0.00012720052,0.0008484597,0.00042743084,0.00040705633,0.000082513325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011892017,0.00008825727,0.038188837,0.0000109829225,0.000008857353,0.00009666202,0.00048066434,0.0024787397,0.0013958232,0.9563408,0.000019666137,0.0008788111],"study_design_scores_gemma":[0.0019251676,0.000075004355,0.061905812,0.00008593965,0.000001332287,0.000010894913,0.000023264223,0.008324561,0.0014695433,0.9256661,0.00026465804,0.00024775707],"about_ca_topic_score_codex":0.0001161068,"about_ca_topic_score_gemma":0.00013795975,"teacher_disagreement_score":0.03067474,"about_ca_system_score_codex":0.00014620679,"about_ca_system_score_gemma":0.0000815377,"threshold_uncertainty_score":0.8830287},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99573445,0.00079859496,0.000015059469,0.00014347878,0.0003313629,0.000049930637,7.251797e-7,0.0000387616,0.0028876292],"genre_scores_gemma":[0.99799854,0.00012570409,0.0017253654,0.00004748889,1.9771271e-7,0.0000011913564,3.7836034e-7,0.0000038753583,0.00009723529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992851,0.000035686844,0.00020413597,0.0001804516,0.00016731022,0.00012732322],"domain_scores_gemma":[0.9994297,0.0000633144,0.00007045345,0.0003125757,0.00006641631,0.00005754683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017118048,0.00007684922,0.00015645025,0.00007019596,0.000033852015,0.000017469509,0.00028640433,0.000037392925,0.000026000489],"category_scores_gemma":[0.000013384303,0.00006927902,0.00003930829,0.00032971043,0.00011938623,0.00016564944,0.000055932444,0.000050970248,0.000009608953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058171963,0.00008389762,0.0063873725,0.000028488494,0.000016113148,0.000001623965,0.00040905466,0.000009169975,0.0015661538,0.9800485,0.00051096326,0.010932854],"study_design_scores_gemma":[0.0005247172,0.00011998271,0.004891624,0.00003902805,0.0000094014795,0.000003857627,0.000015135568,0.0004842889,0.0127859805,0.9807621,0.00027324626,0.00009060433],"about_ca_topic_score_codex":0.000093958726,"about_ca_topic_score_gemma":0.0000011947885,"teacher_disagreement_score":0.0112198265,"about_ca_system_score_codex":0.00000257313,"about_ca_system_score_gemma":0.000017891682,"threshold_uncertainty_score":0.28251165},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9816812,0.000052095136,0.00055896677,0.000034153658,0.0018398309,0.000377575,0.000008900344,0.00024208454,0.0152051775],"genre_scores_gemma":[0.9918105,0.0000027348833,0.007287732,0.0000063378357,0.000021047643,0.000015367274,0.000008023302,0.000076412296,0.00077184883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796295,0.000076746044,0.0007250015,0.0002950339,0.00054147973,0.00039879384],"domain_scores_gemma":[0.99766266,0.00078719505,0.0004830335,0.00077734,0.0002036988,0.00008607644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002744408,0.00030865913,0.00059185445,0.000110563225,0.00008447241,0.00002203634,0.00044049337,0.00017512582,0.000083162784],"category_scores_gemma":[0.00057513383,0.00029274166,0.00017721446,0.0003969759,0.000117750395,0.00018573801,0.00013526223,0.00021803683,0.000035980884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094463585,0.0005178887,0.002904071,0.00009718972,0.00003164227,0.00000746839,0.00022298771,0.000003002819,0.0016804903,0.9921916,0.0022884374,0.000045773097],"study_design_scores_gemma":[0.000900882,0.00008438819,0.00063072296,0.00005620332,0.00004686967,0.0000051301286,0.000095592986,0.0000312576,0.042041007,0.9553246,0.00050713867,0.00027624704],"about_ca_topic_score_codex":0.000084405256,"about_ca_topic_score_gemma":0.0000065427043,"teacher_disagreement_score":0.040360514,"about_ca_system_score_codex":0.00012149065,"about_ca_system_score_gemma":0.000057371035,"threshold_uncertainty_score":0.9999525},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9555069,0.0007057905,0.030144623,0.00792259,0.0010772685,0.00021863331,0.000005121128,0.00016905622,0.0042499835],"genre_scores_gemma":[0.99902123,0.00005870435,0.0001542372,0.00065227994,0.000010456988,0.000020578822,0.0000016647455,0.0000031573413,0.000077666315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860215,0.00017980704,0.00023332916,0.0003762561,0.0002804705,0.00032795634],"domain_scores_gemma":[0.99851763,0.0007987805,0.00003628582,0.0005459456,0.000023571056,0.000077803765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008072809,0.00014184552,0.00018800373,0.0002060116,0.00013366627,0.00009154019,0.0013021756,0.000059821356,0.00021186685],"category_scores_gemma":[0.00026997173,0.00007997015,0.0001210099,0.0015079074,0.000094594216,0.00019314,0.00017530032,0.0003306831,0.00015790445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005606605,0.00020966414,0.00048346343,9.898472e-7,0.000008305323,0.0000064796695,0.00009952663,0.0000430012,0.000009963117,0.9523391,0.0003938798,0.046400014],"study_design_scores_gemma":[0.00030126283,0.00010064918,0.0074506365,0.00000777304,0.0000056999106,0.0000016060851,0.000020618465,0.0010389335,0.000188362,0.9861126,0.0046391087,0.00013272848],"about_ca_topic_score_codex":0.000016989785,"about_ca_topic_score_gemma":0.000011614515,"teacher_disagreement_score":0.046267286,"about_ca_system_score_codex":0.000039123977,"about_ca_system_score_gemma":0.000012775401,"threshold_uncertainty_score":0.3261088},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96713805,0.0009212508,0.00036296315,0.0002483658,0.00044520068,0.00012102671,0.00004093823,0.000026666394,0.030695511],"genre_scores_gemma":[0.99898076,0.00018380357,0.00024006302,0.00013876813,0.000023134207,0.0000070396286,0.000003955288,0.00002383423,0.00039862032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901766,0.000012491459,0.00042569105,0.0003013427,0.000022684984,0.00022015921],"domain_scores_gemma":[0.99924916,0.00011070956,0.00027050302,0.00027998962,0.000016351085,0.00007330248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037277973,0.00014089757,0.00036627124,0.000098488366,0.00007661616,0.000036939276,0.00016578469,0.00008478778,0.00013929314],"category_scores_gemma":[0.00005268569,0.00016070019,0.000074957476,0.00006114128,0.00010534427,0.00017304134,0.0000720421,0.0001271113,0.00010421663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026697226,0.00004519621,0.014842244,0.00001245558,0.000026391628,0.0000015981282,0.0008717143,0.00034297485,0.000015461574,0.9807173,0.000063090905,0.0030348483],"study_design_scores_gemma":[0.0016825708,0.00016785876,0.0144211035,0.000045173372,0.0000067571814,0.000004748831,0.00006743824,0.005485574,0.0008520263,0.9706233,0.006311883,0.00033157543],"about_ca_topic_score_codex":0.000071038994,"about_ca_topic_score_gemma":0.000019310717,"teacher_disagreement_score":0.031842705,"about_ca_system_score_codex":0.00007026404,"about_ca_system_score_gemma":0.000011850346,"threshold_uncertainty_score":0.65531635},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48061267,0.0010494265,0.48611417,0.00011684906,0.005327927,0.0027890452,0.00003264991,0.018467825,0.0054894537],"genre_scores_gemma":[0.8858456,0.000033405024,0.11354679,0.000027699423,0.000034074033,0.0003820763,0.00004141656,0.00006047081,0.000028445718],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923325,0.000008918854,0.000188729,0.00017544476,0.00009650298,0.00029718588],"domain_scores_gemma":[0.99952406,0.00005748471,0.000031389663,0.00026247007,0.000064883614,0.000059695136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001280497,0.00014598023,0.00017231332,0.000059566933,0.00007002522,0.000060027327,0.00021223757,0.0000768244,0.000003946802],"category_scores_gemma":[0.000020328784,0.0001557093,0.000039536193,0.00018821681,0.00002224187,0.00023186242,0.00003628065,0.00010498503,0.000012246678],"study_design_candidate":"design_other","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.00004366817,0.0002637706,0.0039673843,0.000627934,0.00013489979,0.000051775027,0.0005235053,0.0016651558,0.0011137006,0.29049063,0.055627745,0.6454898],"study_design_scores_gemma":[0.0018382824,0.00066122145,0.00045605676,0.00031051488,0.000026763522,0.00007054454,0.000046707548,0.24283558,0.0047325734,0.31140336,0.43670487,0.0009135253],"about_ca_topic_score_codex":0.0000021747107,"about_ca_topic_score_gemma":0.0000010700805,"teacher_disagreement_score":0.6445763,"about_ca_system_score_codex":0.00006594459,"about_ca_system_score_gemma":0.000010164334,"threshold_uncertainty_score":0.6349641},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9966751,0.000107671665,0.000479196,0.00026250473,0.0005719315,0.000067532164,3.941589e-7,0.000009648392,0.0018260553],"genre_scores_gemma":[0.9994023,0.000007803927,0.00042542012,0.000111394365,0.0000011389044,0.0000030589545,2.5263208e-7,0.0000016746467,0.00004697821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995113,0.00007400756,0.00008860046,0.000123482,0.00013063323,0.00007195151],"domain_scores_gemma":[0.99960715,0.00014229197,0.000038886345,0.00016620677,0.000025377954,0.000020090041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015655777,0.000048385118,0.000060005517,0.00006657977,0.000046636913,0.000027844282,0.00014615971,0.000018077339,0.0000028167874],"category_scores_gemma":[0.000090900896,0.00003687982,0.000019621952,0.00042951314,0.00002375295,0.000107066364,0.000038075523,0.000046236408,0.0000016212724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012406467,0.000049661096,0.0048313476,0.000002891693,0.00000192214,5.7987904e-7,0.000128728,0.0006265029,0.00012904989,0.9931731,0.00016007228,0.00089488423],"study_design_scores_gemma":[0.00039539303,0.00006611983,0.040455926,0.000019680268,0.0000015342468,0.0000027947065,0.0000134364645,0.0038564778,0.012523119,0.94184935,0.0007471812,0.00006899441],"about_ca_topic_score_codex":0.0000119223305,"about_ca_topic_score_gemma":0.000009290107,"teacher_disagreement_score":0.051323775,"about_ca_system_score_codex":0.000007930828,"about_ca_system_score_gemma":0.000028111906,"threshold_uncertainty_score":0.15039155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9583988,0.00007259904,0.0007595443,0.000104975195,0.0008613688,0.00009413317,5.43789e-7,0.0000977978,0.039610226],"genre_scores_gemma":[0.99812275,0.000018716953,0.0012292828,0.00004405408,0.000003361281,0.0000028845996,0.0000012257833,0.0000053592703,0.0005723337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910015,0.000024742478,0.00020122851,0.00021030281,0.00027221933,0.00019136196],"domain_scores_gemma":[0.99932635,0.000049528462,0.0000972184,0.00039621338,0.000075497046,0.000055191464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013062636,0.00009723983,0.00015296767,0.00008163689,0.00008991275,0.000043174383,0.00067706767,0.000030876392,0.0000059900062],"category_scores_gemma":[0.000030161113,0.00008541071,0.000058238347,0.00030476085,0.000065865555,0.00058592606,0.0002903689,0.000058292248,0.00004435091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002002813,0.000093367176,0.0018357213,0.000011245539,0.000010419744,0.000039912138,0.00082648644,0.000001434487,0.00013572445,0.9910149,0.0014291352,0.004599675],"study_design_scores_gemma":[0.00105545,0.0001904644,0.01564175,0.000039048777,0.000006049792,0.000025715757,0.000022110315,0.0027010501,0.011473022,0.96164536,0.006868794,0.00033116093],"about_ca_topic_score_codex":0.000019626143,"about_ca_topic_score_gemma":9.590901e-7,"teacher_disagreement_score":0.03972397,"about_ca_system_score_codex":0.000017829485,"about_ca_system_score_gemma":0.00002655041,"threshold_uncertainty_score":0.34829476},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97302735,0.00016566843,0.020687804,0.00015427808,0.00043384524,0.00023185831,0.000002275533,0.00018222783,0.005114701],"genre_scores_gemma":[0.98846734,0.00006831743,0.011222034,0.000103556566,0.0000020664054,0.000019647507,0.0000012037887,0.000014383993,0.00010148249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829876,0.00016675805,0.00031080397,0.0003356204,0.0005109218,0.00037713812],"domain_scores_gemma":[0.99831265,0.0002620713,0.0000975221,0.0009490504,0.00022234223,0.00015633603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039480373,0.00014917247,0.00026544905,0.0002133446,0.00013619587,0.000019579158,0.0013660162,0.00007084858,0.000007697354],"category_scores_gemma":[0.0001378876,0.0001439605,0.00010819893,0.0010967146,0.00032240848,0.00039695503,0.00035793585,0.0002100649,0.00004814598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008508306,0.00012988572,0.0021382507,0.000015646214,0.000017361923,0.000058796017,0.00026098255,0.000004025017,0.0053360118,0.9906881,0.00063764595,0.00070477906],"study_design_scores_gemma":[0.000535365,0.00021299931,0.045140274,0.000021668253,0.000002078546,0.000037210946,0.000005657725,0.00071092724,0.008040773,0.9449139,0.00022047448,0.00015862053],"about_ca_topic_score_codex":0.00002239022,"about_ca_topic_score_gemma":7.094155e-7,"teacher_disagreement_score":0.045774158,"about_ca_system_score_codex":0.000032640055,"about_ca_system_score_gemma":0.00014657286,"threshold_uncertainty_score":0.58705384},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9932588,0.00010946197,0.0006989002,0.000063190295,0.0000919769,0.00037837488,0.000007719039,0.00011127896,0.005280346],"genre_scores_gemma":[0.9968497,0.000087944725,0.0026283984,0.00002300842,0.0000064099104,0.00007103136,0.0000028671516,0.000021993937,0.00030860913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921364,0.000043244287,0.00024165542,0.00018097689,0.0001902939,0.00013022248],"domain_scores_gemma":[0.99881196,0.0004904495,0.00010535031,0.00038593414,0.00012805597,0.00007826202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013786298,0.00010719799,0.00020286218,0.00005415068,0.00015070521,0.0000075859584,0.000113289054,0.000053926888,0.00004134416],"category_scores_gemma":[0.00024488638,0.000097513126,0.00003351677,0.00011905034,0.00012157807,0.0001464488,0.000035271496,0.00008725907,0.000036042606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006565729,0.00035364088,0.000034380533,0.00006182666,0.000009246334,0.0000024961028,0.0003090231,0.00000378307,0.0013249676,0.9974107,0.0004357669,0.000047605306],"study_design_scores_gemma":[0.0002770044,0.000102897386,0.00021432806,0.000042678697,0.0000177463,0.000013452732,0.00011262215,0.0001884461,0.010782567,0.9880402,0.000108883585,0.00009919354],"about_ca_topic_score_codex":9.938811e-7,"about_ca_topic_score_gemma":6.1008836e-7,"teacher_disagreement_score":0.009457599,"about_ca_system_score_codex":0.0000161482,"about_ca_system_score_gemma":0.000014564313,"threshold_uncertainty_score":0.397647},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98345983,0.000025347535,0.0050952095,0.00058317825,0.0004849821,0.00018262242,8.206462e-7,0.000060458744,0.010107537],"genre_scores_gemma":[0.9986427,0.000018403258,0.0009802394,0.000100469915,0.00000201207,0.000020584645,4.2790404e-7,0.000006758304,0.0002284463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988888,0.00015465032,0.00014331813,0.00019930983,0.00042234574,0.00019158404],"domain_scores_gemma":[0.9984569,0.0006254958,0.00007298094,0.0006635191,0.00013616882,0.000044955726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040806728,0.000084619795,0.00010710278,0.0000786188,0.00017648905,0.0000145863605,0.0008926911,0.00003486438,0.00003392719],"category_scores_gemma":[0.00019066074,0.000060033333,0.00006656321,0.0007317909,0.00017986141,0.00021182718,0.00014719581,0.0001562024,0.00011023158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010794199,0.000079195575,0.0007876433,0.000002276231,0.0000079244965,0.000007771319,0.00029780404,0.000006497214,0.0002685064,0.9967983,0.001105838,0.00062747987],"study_design_scores_gemma":[0.0003363562,0.00006501902,0.0022325406,0.000008765191,9.406802e-7,0.000015834685,0.000010669983,0.00041809067,0.0070331986,0.9896465,0.00016401288,0.000068090674],"about_ca_topic_score_codex":0.000005827194,"about_ca_topic_score_gemma":3.492444e-7,"teacher_disagreement_score":0.015182814,"about_ca_system_score_codex":0.000021338963,"about_ca_system_score_gemma":0.000035190133,"threshold_uncertainty_score":0.24480882},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9953776,0.0016473632,0.00024074396,0.00019887113,0.0017094341,0.00011171243,2.2766494e-7,0.00017825165,0.00053581205],"genre_scores_gemma":[0.997544,0.000019365989,0.0021960777,0.0001340476,0.0000010224785,0.0000027922626,3.4419642e-7,0.0000075285457,0.000094815754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988677,0.000028823697,0.000292985,0.00024032821,0.00029706312,0.0002731009],"domain_scores_gemma":[0.9991023,0.000034136323,0.000107406864,0.00052208983,0.0001423758,0.000091678856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000651128,0.00010843592,0.00016202364,0.00016498328,0.00007833295,0.000031777323,0.00055572006,0.000060129718,0.0000016254393],"category_scores_gemma":[0.00003932823,0.00008975118,0.000068777095,0.00045729615,0.000092497394,0.0003030029,0.00016262464,0.000099702316,0.00002633245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004856458,0.000099062396,0.00080161454,0.00001240845,0.000011571466,0.0000040390596,0.0002539689,0.0000018983533,0.037935186,0.9594969,0.00024010924,0.0011383877],"study_design_scores_gemma":[0.0003352869,0.00008038695,0.0009439008,0.00003367757,0.0000032872892,0.0000035525773,0.000010081378,0.00017546167,0.22391272,0.7742779,0.00011898488,0.000104731],"about_ca_topic_score_codex":0.000040410145,"about_ca_topic_score_gemma":9.663206e-7,"teacher_disagreement_score":0.18597752,"about_ca_system_score_codex":0.00001139867,"about_ca_system_score_gemma":0.000043003856,"threshold_uncertainty_score":0.36599466},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919552,0.0003394707,0.003836139,0.00026026205,0.0011812228,0.0002993071,0.000001163129,0.00030143998,0.0018258042],"genre_scores_gemma":[0.9978471,0.00006538214,0.0018352899,0.00012616599,0.000003479502,0.000037614176,0.0000023252624,0.000023241862,0.00005944452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767333,0.00018734703,0.00031363295,0.00060257525,0.0005274913,0.0006956358],"domain_scores_gemma":[0.9982354,0.00037109907,0.00008425907,0.0010053103,0.00013556311,0.00016838493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004717107,0.0002201019,0.00028743624,0.00043768107,0.00025237072,0.00005961387,0.0014660637,0.00010482686,0.00002207574],"category_scores_gemma":[0.00022389572,0.00022333565,0.000100028985,0.0021601808,0.00017616256,0.00075698906,0.00042847643,0.0004461976,0.00012060041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000125312945,0.00012571909,0.040037844,0.000006697161,0.0000113695305,0.000283189,0.00046809745,0.000017058455,0.0008235852,0.954427,0.00029006766,0.0034968522],"study_design_scores_gemma":[0.0010904932,0.00010684651,0.041686796,0.000031093354,0.0000013592114,0.00004443026,0.00001613943,0.004088335,0.0017527915,0.95069593,0.00021378194,0.00027197806],"about_ca_topic_score_codex":0.000056608093,"about_ca_topic_score_gemma":0.000045175337,"teacher_disagreement_score":0.0058918656,"about_ca_system_score_codex":0.00009343592,"about_ca_system_score_gemma":0.00010841727,"threshold_uncertainty_score":0.9107363},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9393197,0.001679447,0.000007914877,0.000013121373,0.0025281315,0.00009992286,0.0000067280116,0.00022204201,0.05612301],"genre_scores_gemma":[0.9995964,0.00003184622,0.000016929851,0.000005629509,0.000010441437,0.000013157952,0.0000019365516,0.000023591392,0.00030006154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991941,0.00005866647,0.00024082186,0.00014049896,0.00015201732,0.00021388139],"domain_scores_gemma":[0.9994236,0.000050923325,0.000035168963,0.0003778527,0.00004094664,0.000071480754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002441407,0.00012985982,0.00025972098,0.00006554497,0.00004008065,0.000013311358,0.00017232061,0.00007782367,0.0001669064],"category_scores_gemma":[0.000020257949,0.00013679972,0.00010745353,0.0002918648,0.000042285355,0.000095396186,0.000016962465,0.000113521084,0.00010727168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000146303755,0.00022140157,0.013893319,0.0004673709,0.00025975524,0.00002064086,0.0019367948,0.0007275252,0.0124884695,0.9425586,0.0241852,0.0032262858],"study_design_scores_gemma":[0.0034551346,0.000353881,0.025232561,0.00031487047,0.00018381809,0.00006754559,0.00079049024,0.011273696,0.18847063,0.7220647,0.04610717,0.0016855074],"about_ca_topic_score_codex":0.000037335838,"about_ca_topic_score_gemma":0.0000017760963,"teacher_disagreement_score":0.22049391,"about_ca_system_score_codex":0.000028944405,"about_ca_system_score_gemma":0.0000031685643,"threshold_uncertainty_score":0.55785304},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.987493,0.0007500908,0.000023939767,0.000013007307,0.0017946739,0.00011182854,0.0000091922375,0.0002154639,0.0095887985],"genre_scores_gemma":[0.99965525,0.00005940974,0.00007006187,0.000012860484,0.000013232578,0.000022776789,0.000005912343,0.000024249182,0.00013625663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999283,0.000032277956,0.0002270094,0.000105205654,0.000122052086,0.00023046463],"domain_scores_gemma":[0.99955004,0.000056790494,0.000032107746,0.00025427784,0.000035672656,0.000071102586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011373086,0.000112962014,0.0002034933,0.000081247985,0.00011667937,0.000007632099,0.00016877808,0.000069648384,0.000040040406],"category_scores_gemma":[0.000008434572,0.00012331452,0.000077727454,0.00021636931,0.000058142436,0.00019830801,0.00002451871,0.00010162142,0.00010056756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008298499,0.00010464473,0.0011490515,0.00006883771,0.00006836283,0.000018894612,0.00041568174,0.0028899056,0.021899018,0.9701198,0.0032023182,0.000055206205],"study_design_scores_gemma":[0.0012385887,0.00015664869,0.0043378365,0.00008192364,0.000032696775,0.00006942226,0.00013832806,0.0028631052,0.068538174,0.9200981,0.0020313095,0.00041386255],"about_ca_topic_score_codex":0.000015356258,"about_ca_topic_score_gemma":0.0000011148674,"teacher_disagreement_score":0.050021674,"about_ca_system_score_codex":0.000029923025,"about_ca_system_score_gemma":0.000013843145,"threshold_uncertainty_score":0.502862},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9894916,0.00045546738,0.0007673153,0.0007088497,0.00072472525,0.00035466152,0.000002303286,0.0003279783,0.007167093],"genre_scores_gemma":[0.99750787,0.00006764971,0.0016059751,0.00012674986,0.000006544458,0.0000463867,0.0000034287252,0.000025950458,0.0006094569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975042,0.00031051572,0.00029302138,0.00065719127,0.0004704589,0.0007646576],"domain_scores_gemma":[0.9984237,0.0003595192,0.000066895176,0.0008830237,0.00007400386,0.0001928504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006518823,0.00024785777,0.0003232774,0.00041577072,0.00017614514,0.00016222017,0.0015442889,0.000117865326,0.0001932282],"category_scores_gemma":[0.00010018434,0.0002539319,0.00010941695,0.0016761394,0.0001580118,0.0009317988,0.00019673839,0.0004640472,0.00021230106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041736468,0.0001957458,0.009062661,0.000016093443,0.000024182416,0.00014742774,0.001457315,0.00009076644,0.0012102491,0.91870826,0.0008985275,0.06814703],"study_design_scores_gemma":[0.0013540905,0.00013137216,0.027721113,0.00006261959,0.0000027773106,0.00001681692,0.00006613827,0.0012666332,0.007947477,0.9588746,0.0022089116,0.0003474706],"about_ca_topic_score_codex":0.000033958146,"about_ca_topic_score_gemma":0.000013723946,"teacher_disagreement_score":0.06779957,"about_ca_system_score_codex":0.00007973007,"about_ca_system_score_gemma":0.00007033262,"threshold_uncertainty_score":0.9999913},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98073334,0.00011215066,0.0019090045,0.00035413532,0.0030170914,0.00009027695,2.0584115e-7,0.00039862917,0.013385173],"genre_scores_gemma":[0.9945588,0.0000030617373,0.0045739594,0.00072680094,8.447336e-7,0.0000021851458,7.2269825e-7,0.000008796847,0.00012479251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874675,0.000028791366,0.00022553328,0.00033519225,0.0003034928,0.00036022888],"domain_scores_gemma":[0.99893826,0.00021534691,0.00007314044,0.0005605451,0.00007735182,0.00013535957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095032563,0.000121013596,0.00011618305,0.00017241166,0.000171306,0.00007850987,0.0005191377,0.000062836625,0.0000061007067],"category_scores_gemma":[0.00008108333,0.00011111331,0.00006656615,0.00060111063,0.000035357272,0.00015127951,0.00011958302,0.00016736375,0.00016467394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032707294,0.000069202695,0.00065873406,0.0000027677988,0.0000058813457,0.00001961501,0.000110054374,0.000007294606,0.00053546525,0.99274194,0.0014892223,0.0043565272],"study_design_scores_gemma":[0.00041602546,0.0001126781,0.001493089,0.000022209073,0.000002001595,0.000005504998,0.000007735867,0.0004966086,0.0042629875,0.9926183,0.0004215447,0.00014130051],"about_ca_topic_score_codex":0.000016264745,"about_ca_topic_score_gemma":0.0000010384591,"teacher_disagreement_score":0.013825503,"about_ca_system_score_codex":0.000019108582,"about_ca_system_score_gemma":0.000019320962,"threshold_uncertainty_score":0.45310694},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9863895,0.0010724552,0.000011035308,0.000009628557,0.002038009,0.00018225562,0.00000801302,0.0015018139,0.008787242],"genre_scores_gemma":[0.9995988,0.00007463742,0.00004358035,0.00001252503,0.000009794066,0.00003090595,0.000014101964,0.00005077575,0.00016486965],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998672,0.00011323846,0.0004161471,0.000207731,0.0002059721,0.0003849037],"domain_scores_gemma":[0.999181,0.0001449259,0.000082662904,0.00037610382,0.00009249879,0.00012283456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029624903,0.0002281969,0.00038933076,0.00020872011,0.00008532849,0.000027362925,0.00022118959,0.00013371404,0.00006153645],"category_scores_gemma":[0.000050452425,0.00023705438,0.00013838916,0.0008968121,0.00006636335,0.00018539898,0.000029274806,0.00017938668,0.00003390287],"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.00024732645,0.00035108125,0.5127391,0.0003326793,0.00072393037,0.00013332872,0.002222744,0.00140487,0.03950493,0.43358958,0.006043978,0.0027064371],"study_design_scores_gemma":[0.005890885,0.0005096602,0.37764838,0.00093066733,0.00021361047,0.00009754903,0.0008512674,0.01908328,0.06115864,0.52136844,0.0102296285,0.0020180012],"about_ca_topic_score_codex":0.00006681868,"about_ca_topic_score_gemma":0.000012779924,"teacher_disagreement_score":0.13509074,"about_ca_system_score_codex":0.00003782142,"about_ca_system_score_gemma":0.000017027438,"threshold_uncertainty_score":0.9666797},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9972172,0.00024407043,0.000054554333,0.000030185442,0.00017643881,0.00008658516,0.000018087057,0.000016868224,0.0021560069],"genre_scores_gemma":[0.99935323,0.00005926975,0.00012041533,0.000054398683,0.000009464992,0.000004206417,0.00017421378,0.0000066975467,0.00021810152],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927896,0.000045646048,0.00018907172,0.00021492822,0.00008176189,0.0001896494],"domain_scores_gemma":[0.9996385,0.000016707598,0.00005616849,0.00018775734,0.00004824743,0.000052643496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001626441,0.00010429553,0.00014932851,0.000010452694,0.00005963262,0.0000106112275,0.00016075505,0.0001273112,0.0000900406],"category_scores_gemma":[0.00005546282,0.000088985755,0.00008065066,0.0000966134,0.000055033095,0.000002279635,0.00005699864,0.00006275925,0.000019791887],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003419191,0.0007467853,0.041267365,0.000090394184,0.000243961,0.000060544047,0.00006024775,0.0001897976,0.82539725,0.055177543,0.0076987785,0.06872538],"study_design_scores_gemma":[0.004158837,0.0036724221,0.07558393,0.00018112923,0.00009499972,0.0002696726,0.000080017344,0.0010411006,0.7771577,0.06972762,0.06672753,0.0013050284],"about_ca_topic_score_codex":0.000010829059,"about_ca_topic_score_gemma":8.333259e-7,"teacher_disagreement_score":0.067420356,"about_ca_system_score_codex":0.000011050842,"about_ca_system_score_gemma":0.000020203686,"threshold_uncertainty_score":0.36287338},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9386048,0.0007694254,0.00088281225,0.0004085664,0.00625259,0.00040946426,0.000007217344,0.00020102852,0.0524641],"genre_scores_gemma":[0.98458236,0.000013930871,0.009129683,0.00027323322,0.00003691182,0.000035030498,7.78048e-7,0.00003145808,0.00589662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956079,0.0007074351,0.00076696486,0.0007442453,0.0016225997,0.0005508452],"domain_scores_gemma":[0.99674207,0.0014774194,0.00021787873,0.0010107835,0.00024089456,0.00031094113],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0027762598,0.0002577727,0.0004076561,0.00016293101,0.0003107882,0.00060448184,0.0012598964,0.00016171554,0.0031612974],"category_scores_gemma":[0.002631046,0.00021600342,0.00020321553,0.00087250705,0.0002676984,0.00052508834,0.00027571822,0.00023042873,0.0051195915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002522961,0.0018387515,0.03952323,0.000008614731,0.00010768686,0.00027444708,0.0036724287,0.0006061411,0.04952231,0.680885,0.1831071,0.04020195],"study_design_scores_gemma":[0.003501877,0.0007366842,0.00898629,0.000016229817,0.000024423021,0.000050282553,0.00026240826,0.01569523,0.1010718,0.8100709,0.058581278,0.0010026429],"about_ca_topic_score_codex":0.000019231878,"about_ca_topic_score_gemma":7.107114e-7,"teacher_disagreement_score":0.12918581,"about_ca_system_score_codex":0.00008029929,"about_ca_system_score_gemma":0.00002776184,"threshold_uncertainty_score":0.9977499},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9755851,0.00010647746,0.0016370082,0.0033566987,0.004487392,0.00029088146,8.4712076e-7,0.00034947167,0.014186107],"genre_scores_gemma":[0.9963793,0.0000049270707,0.0012644178,0.0020578636,0.0000030470976,0.000011699966,0.0000011555373,0.000014915992,0.0002626317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825776,0.00006641679,0.0002841872,0.00041835877,0.0004899179,0.00048339172],"domain_scores_gemma":[0.9979871,0.00064737594,0.00011625217,0.0009693235,0.00012424614,0.00015571585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014369946,0.00018925931,0.00017030354,0.000091450456,0.00035938786,0.00015297059,0.0011029114,0.00010659336,0.000030169069],"category_scores_gemma":[0.00015123164,0.00013302467,0.000097176824,0.0006677395,0.000108858774,0.00016238705,0.00022349802,0.0003021231,0.0004886566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000113841415,0.00010231866,0.0006787759,0.000002585867,0.000017613287,0.000018693776,0.00018799987,0.000021384658,0.00026821115,0.9823299,0.015142357,0.0012187756],"study_design_scores_gemma":[0.0006147418,0.00017419767,0.0016646131,0.00002539483,0.0000062525382,0.0000075784424,0.000022871744,0.0016759816,0.0020215623,0.9912565,0.0023347652,0.00019558695],"about_ca_topic_score_codex":0.000088924964,"about_ca_topic_score_gemma":0.000031495973,"teacher_disagreement_score":0.020794224,"about_ca_system_score_codex":0.000044796056,"about_ca_system_score_gemma":0.00005430101,"threshold_uncertainty_score":0.6280855},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9880645,0.0021117283,0.0019348472,0.00012936741,0.0014976708,0.00025518768,0.00000969331,0.00010512434,0.0058918255],"genre_scores_gemma":[0.9872672,0.00020491134,0.0118546765,0.000025398795,0.000014534448,0.0000106670095,0.0000016601119,0.000013272862,0.0006076838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822444,0.00016669303,0.00048910495,0.00038000377,0.00044044934,0.00029930915],"domain_scores_gemma":[0.99847686,0.00015227706,0.00040182896,0.00069249986,0.00017397886,0.00010254429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041000295,0.00018093495,0.0003747881,0.00020653462,0.00007977986,0.000051694926,0.0010643122,0.00009004007,0.00016262587],"category_scores_gemma":[0.000053524345,0.0001723975,0.00013708178,0.0008412554,0.00009284318,0.00055666274,0.000267343,0.00011937281,0.000049360737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022743387,0.0004988641,0.0006472921,0.00009052765,0.00005943223,0.000021281332,0.0014183912,0.000021817259,0.0075347293,0.98104733,0.0014523873,0.0071852044],"study_design_scores_gemma":[0.0065191695,0.0010453427,0.0046142144,0.00029213016,0.00011330244,0.00006164921,0.00020841608,0.039603658,0.25030628,0.69353396,0.0025715567,0.0011303301],"about_ca_topic_score_codex":0.00005753129,"about_ca_topic_score_gemma":2.3177017e-7,"teacher_disagreement_score":0.2875134,"about_ca_system_score_codex":0.000026919151,"about_ca_system_score_gemma":0.00003081469,"threshold_uncertainty_score":0.70301664},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93718415,0.00047246178,0.0039443173,0.00054064364,0.0042303354,0.00043696206,0.0000040474138,0.00022046697,0.05296661],"genre_scores_gemma":[0.97806793,0.000025386955,0.015747195,0.00050308224,0.000022591084,0.000047349084,0.0000021660398,0.00003246224,0.0055518453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957825,0.0006883123,0.00072385994,0.0007365851,0.0014999812,0.00056876044],"domain_scores_gemma":[0.9968634,0.0012572301,0.00023281886,0.0010703001,0.00027114621,0.00030508352],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003441122,0.0002528396,0.0004506222,0.00023330103,0.00023768265,0.00035124598,0.0012114693,0.00014045154,0.0016615345],"category_scores_gemma":[0.0020839819,0.000218179,0.00017504193,0.001662018,0.00021502821,0.000609107,0.00022969065,0.00020813936,0.0030391344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054191553,0.0009936028,0.12487839,0.000006775395,0.0000915687,0.00036172185,0.0016137757,0.00032772255,0.17158264,0.5226712,0.11680268,0.060128022],"study_design_scores_gemma":[0.0016779307,0.00038490517,0.022559626,0.00001847766,0.000014489562,0.000042904267,0.00043898236,0.0026291783,0.038743198,0.8700092,0.06293614,0.00054496503],"about_ca_topic_score_codex":0.00004273652,"about_ca_topic_score_gemma":0.000003887498,"teacher_disagreement_score":0.34733802,"about_ca_system_score_codex":0.000110387526,"about_ca_system_score_gemma":0.0000788079,"threshold_uncertainty_score":0.99925107},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8922311,0.00034071004,0.014828705,0.0022706727,0.009690589,0.00041505782,0.000008993243,0.0011081494,0.07910602],"genre_scores_gemma":[0.9970149,0.000028597415,0.0017276068,0.0008684907,0.000007913584,0.000018016139,0.0000018097039,0.000008873625,0.00032384024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999025,0.000103616614,0.00014468358,0.00030392516,0.00018399529,0.00023876598],"domain_scores_gemma":[0.9991608,0.00015825257,0.000051093866,0.0004757728,0.000054587897,0.00009944547],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021145541,0.00012365199,0.00011320082,0.00012477659,0.00015916389,0.000086169224,0.0005724262,0.000062754785,0.00014162126],"category_scores_gemma":[0.00004793129,0.000118190655,0.00008505985,0.0004900061,0.00004274206,0.00029619568,0.00007064064,0.00017790665,0.0010892408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018162684,0.0001485004,0.000028814873,0.0000022533638,0.000008512134,0.000021058713,0.00015849978,0.0000023090167,0.000027029348,0.97772956,0.0038716805,0.017999968],"study_design_scores_gemma":[0.000421988,0.00017857068,0.00018186358,0.000017347606,0.0000025316508,0.00001030293,0.00000539562,0.0014701121,0.0012038975,0.9955781,0.0007612869,0.0001686129],"about_ca_topic_score_codex":0.0000020943721,"about_ca_topic_score_gemma":2.179968e-7,"teacher_disagreement_score":0.10478374,"about_ca_system_score_codex":0.000014115001,"about_ca_system_score_gemma":0.000005406637,"threshold_uncertainty_score":0.9996885},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892248,0.0015645972,0.001682644,0.0002064555,0.0012449593,0.00042062643,0.0000049419136,0.00038157977,0.0052694026],"genre_scores_gemma":[0.99895203,0.000017004015,0.0006336112,0.000058657395,0.00003697907,0.00011039695,0.000002093993,0.000033748587,0.00015549258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994304,0.000014650814,0.00012799635,0.00011029693,0.000091423746,0.00022521969],"domain_scores_gemma":[0.9994781,0.0001764536,0.000021355185,0.00024080915,0.00002606218,0.000057223704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021584524,0.00012407103,0.000120827324,0.00003326991,0.00014723925,0.00004204423,0.0001871396,0.000048276874,0.000021863829],"category_scores_gemma":[0.000017608829,0.00008532632,0.00005464567,0.00012691306,0.000033154047,0.00012794233,0.0000131825645,0.0001031855,0.000028054963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038325576,0.000032143333,0.0011674947,0.00007421959,0.00015647348,0.0000020830705,0.000540698,0.003024749,0.0020274003,0.98433644,0.004818498,0.00378145],"study_design_scores_gemma":[0.0065611177,0.00044283905,0.0021840013,0.00039994932,0.00019897401,0.00009777697,0.00166516,0.23919894,0.050884992,0.4232164,0.2735231,0.0016267499],"about_ca_topic_score_codex":0.000002581902,"about_ca_topic_score_gemma":0.000008082501,"teacher_disagreement_score":0.56112003,"about_ca_system_score_codex":0.000028988317,"about_ca_system_score_gemma":0.000010249927,"threshold_uncertainty_score":0.34795064},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9895506,0.0004917324,0.00024266298,0.0002626386,0.0015051865,0.00021792883,0.0000023522587,0.00014577246,0.0075811166],"genre_scores_gemma":[0.9951675,0.000008784351,0.00468593,0.000053401753,8.2968955e-7,0.000007185506,0.0000021053954,0.000010434116,0.000063842504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984594,0.00008398754,0.0004242375,0.0003376388,0.00038438733,0.00031035405],"domain_scores_gemma":[0.99828064,0.00013609644,0.00025533634,0.0009900231,0.00026532763,0.00007258752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008801349,0.00014240557,0.00038055095,0.00015966277,0.00008100161,0.000026844597,0.0007673037,0.000049404283,0.0000048541647],"category_scores_gemma":[0.00014006933,0.00012616497,0.0000776,0.00082784187,0.000120659555,0.0001986975,0.0002821915,0.000085283646,0.000015237871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026336832,0.00014705125,0.00091630867,0.00012540405,0.000022529084,6.232881e-7,0.0001742918,0.00007491332,0.027170556,0.9699587,0.0011280039,0.00027895966],"study_design_scores_gemma":[0.0005935071,0.00028359867,0.00070047355,0.00011076878,0.000013524666,0.000002550182,0.0000048522443,0.009570723,0.050865654,0.9375152,0.00019042548,0.00014872095],"about_ca_topic_score_codex":0.000049581256,"about_ca_topic_score_gemma":9.583038e-7,"teacher_disagreement_score":0.032443527,"about_ca_system_score_codex":0.00000843866,"about_ca_system_score_gemma":0.000045339315,"threshold_uncertainty_score":0.51448584},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96816427,0.00009274841,0.011146339,0.0046886695,0.0032029601,0.00014263373,3.1193676e-7,0.00014780025,0.012414278],"genre_scores_gemma":[0.9978946,0.000011341049,0.00058599986,0.0011015487,0.000015747124,0.000011341323,0.000001645171,0.000004145369,0.00037365567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992129,0.0000640141,0.00011179301,0.00019960325,0.00025487575,0.0001567655],"domain_scores_gemma":[0.9992917,0.0002184038,0.000039683262,0.00034352727,0.000060507013,0.000046162037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026366333,0.00008200689,0.00006347044,0.00007183195,0.00025985288,0.00013870202,0.00047148752,0.00002787682,0.000023156428],"category_scores_gemma":[0.000055590648,0.00006087645,0.00004760572,0.00061769615,0.000017590688,0.00020213518,0.00008188273,0.00009721308,0.00013088157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002230007,0.000037315778,0.00026154492,5.70788e-7,0.000005833242,0.000006635645,0.00011088308,0.0002888555,0.00016379436,0.9879656,0.0029723775,0.008184379],"study_design_scores_gemma":[0.00023658758,0.00008936441,0.00553952,0.000008367684,0.000002319366,0.000012808575,0.000011677307,0.012003569,0.0015328869,0.9599578,0.020484038,0.00012107188],"about_ca_topic_score_codex":0.000006791754,"about_ca_topic_score_gemma":0.0000011741053,"teacher_disagreement_score":0.029730318,"about_ca_system_score_codex":0.000023920042,"about_ca_system_score_gemma":0.000030644183,"threshold_uncertainty_score":0.24824695},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8540028,0.0013758917,0.1392561,0.0005501886,0.0017855575,0.0004722021,0.0000052843466,0.00007309846,0.0024789195],"genre_scores_gemma":[0.99541277,0.000114062525,0.0043920656,0.000024934776,0.0000034585005,0.000004219411,0.0000025810568,0.0000032428434,0.000042676507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923015,0.000035509096,0.00021028309,0.00015788562,0.000180686,0.00018550083],"domain_scores_gemma":[0.9989902,0.0006010576,0.000069027985,0.00026351892,0.000042284075,0.00003393383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012020424,0.00006627878,0.00010227568,0.0002043885,0.000103227634,0.000112009395,0.0004612162,0.000019794328,0.0000015813322],"category_scores_gemma":[0.00016022149,0.00004968144,0.00001767118,0.00096914195,0.00005264064,0.00021312674,0.00023405091,0.000058276873,0.0000028380405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007590932,0.00006122896,0.015400866,0.000009499886,0.000010970951,0.0000048208303,0.00014977847,0.000009023506,0.000024925435,0.9385003,0.00039408682,0.045426894],"study_design_scores_gemma":[0.004533443,0.00011189492,0.42980963,0.000044248827,0.000015116153,0.0000047870917,0.00029383952,0.0064031836,0.0011088441,0.54813814,0.009283617,0.00025328886],"about_ca_topic_score_codex":0.000055680943,"about_ca_topic_score_gemma":0.0000286762,"teacher_disagreement_score":0.41440874,"about_ca_system_score_codex":0.000018059895,"about_ca_system_score_gemma":0.000015783497,"threshold_uncertainty_score":0.20259503},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99761444,0.000049814982,0.00003528518,0.00019316554,0.000073986586,0.00024041349,0.000006562345,0.000030212608,0.0017560923],"genre_scores_gemma":[0.99969274,0.000029245524,0.00017584318,0.00003316825,0.0000011327413,0.000027681424,0.0000016088767,0.00001270488,0.000025879179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992744,0.00009891228,0.00026893363,0.00011235763,0.00012706756,0.000118375756],"domain_scores_gemma":[0.9983138,0.0010079078,0.00018030671,0.00040515015,0.00005871023,0.000034136192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039352765,0.00009808413,0.00021088407,0.00006491926,0.00010074381,0.000008366774,0.00018725745,0.000039224364,0.000028048245],"category_scores_gemma":[0.0001226718,0.00007220999,0.0000577336,0.0003155903,0.00020463085,0.000036663572,0.0000417072,0.000082992025,0.0000037200273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094363195,0.00013682088,0.0010516973,0.0000690976,0.000028418779,5.7732626e-7,0.00034267377,0.0000014524509,0.0055330563,0.99251795,0.00019703977,0.00011178417],"study_design_scores_gemma":[0.00027962972,0.00005191623,0.002717851,0.000114766684,0.000031789852,0.0000035705314,0.00011236399,0.00009558396,0.00827674,0.98816097,0.000082909915,0.0000719083],"about_ca_topic_score_codex":0.000009324175,"about_ca_topic_score_gemma":0.0000027087813,"teacher_disagreement_score":0.0043569757,"about_ca_system_score_codex":0.000006087536,"about_ca_system_score_gemma":0.000009532162,"threshold_uncertainty_score":0.29446378},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.722537,0.0009443757,0.15990151,0.004685077,0.051243003,0.00088412565,0.000001575841,0.0014435949,0.05835977],"genre_scores_gemma":[0.9954993,0.0000119863635,0.00040291707,0.0011358018,0.00010678088,0.000019387151,0.0000012014544,0.000013527093,0.0028091136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986446,0.000113673144,0.0002828072,0.00036116218,0.0002450578,0.00035269436],"domain_scores_gemma":[0.99891394,0.0001568826,0.00009431167,0.00062836055,0.000085595166,0.00012091408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038833317,0.00015960525,0.00019214855,0.000084248124,0.0001710594,0.00018607866,0.0006464768,0.00010243084,0.0000430382],"category_scores_gemma":[0.000037805785,0.0001454006,0.00009955474,0.00035660787,0.000020019745,0.00030550183,0.00010630998,0.00021280705,0.00041472734],"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.000008607961,0.00007259303,0.00009308176,0.000001537834,0.000013233734,0.000009961114,0.00008890343,0.003043569,0.0000074660634,0.9314424,0.057624783,0.0075938655],"study_design_scores_gemma":[0.0018319446,0.00041458657,0.00053264986,0.00007006318,0.0000074113236,0.000059634218,0.000016830767,0.79252994,0.00034294854,0.13604079,0.06764719,0.0005060207],"about_ca_topic_score_codex":0.000014200928,"about_ca_topic_score_gemma":0.000010192366,"teacher_disagreement_score":0.79540163,"about_ca_system_score_codex":0.00009325166,"about_ca_system_score_gemma":0.000025660895,"threshold_uncertainty_score":0.59292644},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9951627,0.00015677405,0.0000050398016,0.00014080359,0.00055807194,0.00024571916,0.000004373239,0.000097427095,0.0036290688],"genre_scores_gemma":[0.9991788,0.000016665404,0.00043984884,0.0000925295,0.000011355647,0.00008602843,0.0000042804836,0.00002518438,0.00014526353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989145,0.00008977007,0.00026673562,0.00016487372,0.00018958993,0.00037457893],"domain_scores_gemma":[0.9991238,0.00022886753,0.00008394684,0.00041083392,0.000025992713,0.00012654542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005747367,0.00014458214,0.0001866204,0.00014264233,0.0001012594,0.000021348771,0.00025518294,0.000105276435,0.0000567728],"category_scores_gemma":[0.000085837164,0.0001422921,0.00007659365,0.0002813016,0.000061461564,0.00026293163,0.0000720603,0.00021395963,0.000120187484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005515175,0.0004691282,0.023112698,0.000015203282,0.000015404505,0.000001805004,0.00087818905,2.7105187e-7,0.00052045286,0.97424906,0.0004968976,0.00023538788],"study_design_scores_gemma":[0.000491191,0.000016790911,0.04296425,0.000018788392,0.000014183662,0.0000042923284,0.00020624901,0.0000034956918,0.0012457318,0.9542221,0.0006512973,0.00016162178],"about_ca_topic_score_codex":0.00001534889,"about_ca_topic_score_gemma":0.000014897453,"teacher_disagreement_score":0.020026939,"about_ca_system_score_codex":0.000038180304,"about_ca_system_score_gemma":0.00001808155,"threshold_uncertainty_score":0.5802503},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9802575,0.00003816605,0.000052985142,0.00031328172,0.00055750937,0.00023055177,0.000018897119,0.00016634048,0.018364735],"genre_scores_gemma":[0.99383,0.000009983348,0.0017181004,0.0004015638,0.000032933734,0.00004042556,0.0000046605683,0.00002529924,0.0039369883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985777,0.000075667514,0.00040033815,0.00026738245,0.00030296942,0.0003759532],"domain_scores_gemma":[0.9988376,0.00042047296,0.00006488177,0.00040953417,0.00010771243,0.00015981802],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00059107866,0.00017691874,0.00029913665,0.00011472492,0.00011316138,0.000055543882,0.0002696911,0.00009010033,0.0010776663],"category_scores_gemma":[0.00081366213,0.00016385138,0.00008519152,0.00058527687,0.000024243542,0.00013158565,0.00006497807,0.00014227102,0.00058297894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065658074,0.0003438149,0.00081742165,0.0001162072,0.000030191492,0.000014566762,0.0021554811,0.0000025851061,0.000056522054,0.96284944,0.017781196,0.01576694],"study_design_scores_gemma":[0.00087763387,0.00015535271,0.0007917854,0.00003140442,0.000016068707,0.0000051271727,0.00017657632,0.000035733367,0.0012033453,0.9744448,0.021972258,0.00028992636],"about_ca_topic_score_codex":0.00012739428,"about_ca_topic_score_gemma":0.000009273512,"teacher_disagreement_score":0.015477014,"about_ca_system_score_codex":0.00005654048,"about_ca_system_score_gemma":0.00004566116,"threshold_uncertainty_score":0.9998355},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48729134,0.000066115455,0.51015514,0.00017165903,0.0014160536,0.0002636017,0.000012518369,0.00007910658,0.00054445816],"genre_scores_gemma":[0.987097,0.0000014029273,0.012587026,0.000060868268,0.000016761462,0.000033657667,0.00003091854,0.000007806927,0.00016452913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990855,0.000048893802,0.00026236137,0.00024519794,0.00018760697,0.00017045105],"domain_scores_gemma":[0.9991386,0.00017814038,0.000119585704,0.00026175444,0.00025716252,0.000044765377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025697023,0.000105469895,0.00013455402,0.00014694268,0.00011983772,0.000047990598,0.00028486652,0.000044528955,0.000010111483],"category_scores_gemma":[0.00003588976,0.0001087035,0.000089686124,0.00043368834,0.000029675302,0.00026479544,0.000078598336,0.000056720783,0.0000087187955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016602238,0.00021131725,0.00011251056,0.00001741104,0.000014768625,0.0000027968756,0.00018066801,0.0010759954,0.004392411,0.9869257,0.0013177242,0.005732099],"study_design_scores_gemma":[0.00079636904,0.00025500823,0.0010851301,0.000011161167,0.000009570554,0.0000116244755,0.000022189017,0.09226001,0.015450785,0.8887725,0.0011847072,0.0001409724],"about_ca_topic_score_codex":0.00005477116,"about_ca_topic_score_gemma":0.000023942717,"teacher_disagreement_score":0.49980572,"about_ca_system_score_codex":0.000044051252,"about_ca_system_score_gemma":0.000076132914,"threshold_uncertainty_score":0.44328},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901104,0.00055050664,0.000072469054,0.001959077,0.0012034237,0.000121861405,2.4614772e-7,0.0002700905,0.0057119504],"genre_scores_gemma":[0.992494,0.000024683173,0.006840427,0.00043295306,0.0000011473996,0.000015103965,6.121536e-7,0.0000091787315,0.0001819099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872804,0.000051586267,0.00026597505,0.00036651726,0.00023168858,0.00035617195],"domain_scores_gemma":[0.99919397,0.00008160495,0.00006398184,0.0004947372,0.000062208725,0.00010352629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047955447,0.00012648989,0.00015602988,0.00023684815,0.00010372615,0.00009659236,0.00063431583,0.00007133325,0.000007806674],"category_scores_gemma":[0.00005361614,0.00012793773,0.00005227873,0.0008196145,0.000040194573,0.00043489202,0.00021891136,0.00019747883,0.00011582699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022755075,0.00008596942,0.0040498096,0.0000037700229,0.0000034525408,0.000010209667,0.00030867412,0.00004949815,0.0006330466,0.9900914,0.002135626,0.0026263017],"study_design_scores_gemma":[0.00084713753,0.00006205727,0.0039827162,0.00003971904,0.000001977156,0.0000063437283,0.000010522329,0.0048114033,0.0023028697,0.9823971,0.005338354,0.00019984359],"about_ca_topic_score_codex":0.000058496677,"about_ca_topic_score_gemma":0.000018256827,"teacher_disagreement_score":0.0076943105,"about_ca_system_score_codex":0.000046479843,"about_ca_system_score_gemma":0.000040566913,"threshold_uncertainty_score":0.5217149},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.984313,0.00036242997,0.00017375548,0.0010043859,0.0013120605,0.00011677796,8.8275334e-7,0.000102207865,0.012614476],"genre_scores_gemma":[0.9991404,0.000005463104,0.00041774963,0.00027249914,6.519069e-7,0.000005635011,9.2440854e-7,0.0000068035783,0.00014990174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988377,0.000073646406,0.00023953614,0.000267586,0.00034191037,0.00023961367],"domain_scores_gemma":[0.9988223,0.00022630866,0.0000809424,0.00071144424,0.000120463206,0.000038555674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040427997,0.000120193035,0.00013112838,0.00010857963,0.00014112997,0.000053640815,0.00075864804,0.000047073427,0.000015406738],"category_scores_gemma":[0.0000469702,0.00007925431,0.00008917393,0.0006953456,0.00011455211,0.000110153574,0.00011508375,0.00012668342,0.0000871167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001443872,0.00015263486,0.0009017983,0.0000037666653,0.0000028250308,0.0000020205703,0.00006114097,0.0000475101,0.0009971902,0.9892062,0.008466199,0.00015727512],"study_design_scores_gemma":[0.0002715587,0.000105532505,0.0018582043,0.000016518083,0.000003858138,0.0000026262328,0.0000070651713,0.000755921,0.0046405555,0.9920419,0.00019464956,0.00010164581],"about_ca_topic_score_codex":0.000110729554,"about_ca_topic_score_gemma":0.0000020055093,"teacher_disagreement_score":0.014827348,"about_ca_system_score_codex":0.000009755828,"about_ca_system_score_gemma":0.000034629116,"threshold_uncertainty_score":0.3231897},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930678,0.000084390274,0.00039546288,0.00078696146,0.0009945628,0.000089384834,9.701656e-7,0.00013330719,0.00444714],"genre_scores_gemma":[0.9949645,0.000002914073,0.004752003,0.00012601652,0.0000012557612,0.0000048039033,0.0000012854556,0.0000044917747,0.00014275714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992766,0.000028373988,0.00019277596,0.00017304087,0.00018935873,0.00013987072],"domain_scores_gemma":[0.99930394,0.00013423609,0.00007446511,0.00037752243,0.000054509346,0.0000553422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020245621,0.00007170524,0.00011261659,0.00011112711,0.00007094145,0.000022841501,0.00030705694,0.000038622456,0.000012806318],"category_scores_gemma":[0.000050295333,0.00006687201,0.000041732415,0.0002960809,0.00002145045,0.00013968072,0.000059230733,0.00007550729,0.000071602466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038137941,0.00008921001,0.00015129091,0.0000023688597,0.000006458216,0.0000010854056,0.00014273965,0.0006346654,0.00083081453,0.9947315,0.0010564857,0.0023495615],"study_design_scores_gemma":[0.00088263286,0.000142379,0.0011410816,0.000024741643,0.000003942593,0.0000023224286,0.0000040813065,0.0064784084,0.010500702,0.9799063,0.000811187,0.000102209066],"about_ca_topic_score_codex":0.000011167414,"about_ca_topic_score_gemma":0.0000013505066,"teacher_disagreement_score":0.014825194,"about_ca_system_score_codex":0.000015857038,"about_ca_system_score_gemma":0.000024303727,"threshold_uncertainty_score":0.27269614},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9918917,0.000026806205,0.00033457525,0.00011467903,0.00025016433,0.00021873502,0.000003947822,0.00017840644,0.006981026],"genre_scores_gemma":[0.99648345,0.0000034920824,0.002890914,0.00006391318,0.000007734082,0.00002758901,0.000005296548,0.00002778556,0.0004898491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990436,0.000030741947,0.00021499449,0.00021378908,0.0001956178,0.0003012641],"domain_scores_gemma":[0.9989528,0.0003025554,0.0000975563,0.00045827107,0.000073693765,0.00011512622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047402724,0.00014608087,0.0001669784,0.0000941262,0.0001689378,0.000024019393,0.0001954882,0.00006743855,0.00008678363],"category_scores_gemma":[0.000041413554,0.00012009819,0.000056507328,0.00046708464,0.000106910484,0.00009035509,0.00003090419,0.00014621942,0.00006836592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037187154,0.000205077,0.003673819,0.000013668852,0.000030326572,0.000010732494,0.00014033036,3.7974232e-7,0.00060869905,0.9939909,0.0010172685,0.00027161368],"study_design_scores_gemma":[0.00063548423,0.00008474268,0.0050514527,0.00001792413,0.000029746967,0.000010244753,0.00007718092,0.0000026368114,0.0053658974,0.9865778,0.0019772393,0.00016963584],"about_ca_topic_score_codex":0.000010433746,"about_ca_topic_score_gemma":0.000024264897,"teacher_disagreement_score":0.0074130837,"about_ca_system_score_codex":0.000015659833,"about_ca_system_score_gemma":0.000016486074,"threshold_uncertainty_score":0.48974624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99657774,0.00042352127,0.000032505424,0.00035188923,0.0016619667,0.00008904985,4.911693e-7,0.0001122105,0.0007506194],"genre_scores_gemma":[0.9986218,0.00007127406,0.00095410104,0.00006958089,9.4121214e-7,0.000010516417,5.243838e-7,0.0000073885294,0.00026388137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885446,0.0000663097,0.00028719453,0.00020596148,0.00032801952,0.00025803832],"domain_scores_gemma":[0.9988787,0.00016213776,0.000121285346,0.0006584549,0.00009839403,0.0000810277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002819534,0.000109790766,0.00015543375,0.00004553099,0.0003337809,0.000038900824,0.00055602664,0.000044312437,0.0000057740103],"category_scores_gemma":[0.000047110836,0.00007725624,0.000093877294,0.00047661675,0.00018512773,0.00025910596,0.00016425045,0.00010183477,0.00012286773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017390681,0.00006514798,0.0019651104,0.0000059368185,0.00001716256,0.0000066573634,0.00026495277,0.00001252897,0.0007888019,0.9945027,0.0021571417,0.00021211481],"study_design_scores_gemma":[0.00040392726,0.00005234331,0.004885974,0.00001842134,0.0000043772898,0.00006169844,0.0000069417315,0.002002117,0.0028883219,0.9894236,0.00014302263,0.00010926544],"about_ca_topic_score_codex":0.000029863359,"about_ca_topic_score_gemma":3.698055e-7,"teacher_disagreement_score":0.0050791157,"about_ca_system_score_codex":0.000009144042,"about_ca_system_score_gemma":0.000051992225,"threshold_uncertainty_score":0.3150418},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99619156,0.000043661676,0.00004174651,0.00027982797,0.0001967652,0.00020787773,0.0000025726897,0.00008782328,0.0029481566],"genre_scores_gemma":[0.99922454,0.000011502369,0.00057575817,0.000053366166,0.0000032410808,0.00008181476,0.000002347937,0.000015396174,0.00003204218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992374,0.000036572972,0.00021343917,0.0001749858,0.00013871079,0.00019885712],"domain_scores_gemma":[0.9994393,0.000098990844,0.00005901059,0.00031765012,0.00002461854,0.000060453658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026944975,0.000103507075,0.00013961647,0.000114970244,0.000072763854,0.000020052059,0.00018677865,0.00006751181,0.000034351255],"category_scores_gemma":[0.0000619903,0.00010199609,0.000060594568,0.00039255334,0.000050327213,0.00008194642,0.00004136102,0.0001519963,0.00007929773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005813999,0.00031843595,0.0029205268,0.000010663817,0.000009256714,0.000006736554,0.00047715337,0.000005618791,0.00089664117,0.99517554,0.00009738987,0.000076204524],"study_design_scores_gemma":[0.0008924505,0.00002250841,0.0041936683,0.00003185068,0.000008936864,0.000004047941,0.00012491076,0.000002142353,0.0070989514,0.9873426,0.00016186501,0.00011608954],"about_ca_topic_score_codex":0.000029919238,"about_ca_topic_score_gemma":0.00005927109,"teacher_disagreement_score":0.00783298,"about_ca_system_score_codex":0.000037956415,"about_ca_system_score_gemma":0.000024196444,"threshold_uncertainty_score":0.41592798},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6645381,0.00010872778,0.32939982,0.0006940608,0.0013587981,0.0024732342,0.0000715626,0.00013813125,0.0012175527],"genre_scores_gemma":[0.9726637,0.0000039458682,0.026983432,0.000041823416,0.000009597596,0.00007357161,0.000003983701,0.00003903444,0.00018092031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998353,0.000045855075,0.0006860576,0.00020971628,0.00042944637,0.0002759374],"domain_scores_gemma":[0.9961383,0.0021052088,0.00054004684,0.0006501651,0.0005036024,0.000062710045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045413116,0.00022047819,0.00050694274,0.00005324816,0.00010348529,0.000013231491,0.00042945475,0.00010731907,0.000020893931],"category_scores_gemma":[0.0020099848,0.00017529,0.00018208413,0.0002647372,0.000095602925,0.00012371359,0.000054537202,0.00014783803,0.0000067408937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085755135,0.00043425293,0.000012266671,0.00013067246,0.000059502658,4.4184821e-7,0.0015160413,0.00080969866,0.00034406013,0.9954618,0.00072627346,0.00041923224],"study_design_scores_gemma":[0.0017140175,0.0001209838,0.000031731877,0.00009049517,0.0001295507,0.000004836017,0.00015911151,0.121272035,0.001038905,0.8752806,0.000007855903,0.00014984257],"about_ca_topic_score_codex":0.0000024842702,"about_ca_topic_score_gemma":7.0349097e-7,"teacher_disagreement_score":0.3081256,"about_ca_system_score_codex":0.00007454631,"about_ca_system_score_gemma":0.00010021223,"threshold_uncertainty_score":0.71481186},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9453761,0.0014177116,0.0026080436,0.0012225854,0.021111514,0.0028936625,0.000106979714,0.000746249,0.024517162],"genre_scores_gemma":[0.9910327,0.0002977948,0.0074288715,0.00019425526,0.000065482796,0.00002825712,0.000018098546,0.00016216739,0.0007723793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99430865,0.0003672532,0.0020839914,0.0008177767,0.0013057862,0.0011165164],"domain_scores_gemma":[0.99375695,0.0011483511,0.001471056,0.0022474502,0.00095492904,0.0004212413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010962775,0.0009578594,0.0018407698,0.000385166,0.00023937329,0.00009849139,0.0014955576,0.0006735677,0.00015117487],"category_scores_gemma":[0.0013517812,0.0010215176,0.0005559767,0.0014744304,0.00036485592,0.00047734633,0.00028650917,0.0008853329,0.00015168915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013057103,0.0022100618,0.00016917048,0.0006303373,0.00019567783,0.000074317155,0.0010641679,0.00003118688,0.0018816361,0.98862654,0.00356446,0.001421903],"study_design_scores_gemma":[0.0031243146,0.0012851522,0.00028139268,0.0010669599,0.00035375048,0.000029764566,0.00022670951,0.00027835844,0.01830858,0.9729017,0.0012004483,0.0009428581],"about_ca_topic_score_codex":0.000017390164,"about_ca_topic_score_gemma":0.0000021748183,"teacher_disagreement_score":0.045656603,"about_ca_system_score_codex":0.00029338725,"about_ca_system_score_gemma":0.00037804418,"threshold_uncertainty_score":0.99922353},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9382953,0.0009816556,0.05287017,0.0027921128,0.001312099,0.00026288952,0.000001667282,0.00023702103,0.0032471037],"genre_scores_gemma":[0.9825189,0.000026953796,0.016745694,0.00041508756,0.0000074176733,0.000009928851,0.0000028270597,0.000007982146,0.00026517131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900967,0.000067027926,0.00023432307,0.0002698661,0.00021083561,0.0002082758],"domain_scores_gemma":[0.9991566,0.00006425898,0.00005065591,0.0005720011,0.00008633333,0.00007014705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016271333,0.00011854595,0.00016455862,0.00008924399,0.0001145526,0.000035000965,0.00062005036,0.00006524222,0.000025852545],"category_scores_gemma":[0.00002195608,0.00010895087,0.00006962611,0.00042608296,0.00006706768,0.0005069347,0.00013904164,0.000114543574,0.000036755155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026731036,0.000089930654,0.00011916218,0.0000037897687,0.000010878267,0.0000031965853,0.00016707412,0.002580721,0.0015626375,0.9911781,0.00043011364,0.0038517325],"study_design_scores_gemma":[0.00064881745,0.000086438544,0.0023443538,0.0000111057625,0.0000051988713,0.000007467136,0.000028593031,0.010027335,0.00547491,0.9798594,0.0013429188,0.00016346537],"about_ca_topic_score_codex":0.000009153426,"about_ca_topic_score_gemma":0.000005111777,"teacher_disagreement_score":0.044223655,"about_ca_system_score_codex":0.000031636722,"about_ca_system_score_gemma":0.000042937525,"threshold_uncertainty_score":0.44428876},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9565373,0.0000631494,0.011611127,0.0041835792,0.0011017749,0.001085992,0.0000341711,0.000328208,0.025054717],"genre_scores_gemma":[0.9768873,0.000006817643,0.022030218,0.00010388717,0.00002070134,0.00024445597,0.00000823027,0.000033645098,0.00066478224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991341,0.000016296677,0.0002483484,0.00018331686,0.00015436586,0.00026353568],"domain_scores_gemma":[0.9984536,0.000908413,0.000051418232,0.0003694321,0.0001178429,0.000099295605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023188666,0.00012025395,0.00019120931,0.000032043692,0.000154778,0.00005028841,0.00019448489,0.00007211767,0.00012361562],"category_scores_gemma":[0.0006528963,0.00011226481,0.00009190617,0.00011773549,0.000049183276,0.00007501409,0.00004608739,0.000082148435,0.00006220334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004421327,0.0002657474,0.000081779646,0.00007530534,0.000010403297,0.0000018932184,0.00011609147,6.807584e-8,0.00008532895,0.9524647,0.046623304,0.0002709342],"study_design_scores_gemma":[0.00043840866,0.0000475216,0.00006370663,0.000019534851,0.0000398115,0.000012090381,0.000060050934,0.00087099534,0.00019512228,0.9853332,0.012779592,0.00013997081],"about_ca_topic_score_codex":0.0000021256403,"about_ca_topic_score_gemma":0.000002093197,"teacher_disagreement_score":0.03384371,"about_ca_system_score_codex":0.00002527517,"about_ca_system_score_gemma":0.000018198967,"threshold_uncertainty_score":0.4578026},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7716674,0.00007987176,0.22282265,0.001661466,0.00048948894,0.00096539117,0.000057036785,0.0005402202,0.0017164449],"genre_scores_gemma":[0.9581436,0.000009374753,0.041006774,0.0006497256,0.000023444632,0.00011403688,0.00002107292,0.000014198913,0.000017770291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977889,0.00013669941,0.00033248359,0.0007891712,0.00048094636,0.00047179236],"domain_scores_gemma":[0.9979379,0.0006998874,0.00012715193,0.0007588707,0.00013901528,0.00033713225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003064614,0.000278073,0.0004550922,0.00040618115,0.00072578975,0.00014804037,0.0009583934,0.00008304739,0.000015833208],"category_scores_gemma":[0.0001323633,0.00021911788,0.00008242725,0.0024357934,0.00014495548,0.0002662188,0.00048289623,0.00021568056,0.0000515805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025675625,0.00025594945,0.003698668,0.0000051129527,0.00004717014,0.000016004617,0.00022440426,0.000051268864,0.00015688072,0.98787725,0.0005543868,0.007087219],"study_design_scores_gemma":[0.001871382,0.0010272793,0.04088813,0.000011509483,0.000043211025,0.00005033743,0.00006162778,0.0022674897,0.0009256999,0.9358857,0.016329682,0.00063790183],"about_ca_topic_score_codex":0.0003019366,"about_ca_topic_score_gemma":0.00001814031,"teacher_disagreement_score":0.18647617,"about_ca_system_score_codex":0.000038022605,"about_ca_system_score_gemma":0.000037825113,"threshold_uncertainty_score":0.8935368},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96727437,0.0007967382,0.000006388134,0.00010584248,0.0030328447,0.00009415967,0.000003922949,0.0001191619,0.028566552],"genre_scores_gemma":[0.9946914,0.000026597583,0.0020375373,0.00035604322,0.000027581105,0.000024265955,0.0000024793585,0.000028976077,0.0028051417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988489,0.00008605038,0.00021041148,0.0002816715,0.0002115362,0.0003614234],"domain_scores_gemma":[0.99920356,0.000026848506,0.00007059739,0.00046343388,0.00007561813,0.00015994546],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00024979786,0.00015185188,0.00018501705,0.000042600033,0.00015937103,0.00005129187,0.00040758622,0.000083095496,0.0037233778],"category_scores_gemma":[0.00009352675,0.0001253703,0.00006123454,0.000119838216,0.00013506683,0.00018706756,0.00009737677,0.00006925208,0.0010964556],"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.00012562989,0.00026276687,0.002657043,0.000024733681,0.000035866215,0.000025572614,0.0030955984,0.0000013654068,0.40568796,0.56653816,0.017261684,0.0042836396],"study_design_scores_gemma":[0.000506971,0.00015766372,0.001949096,0.000028500179,0.000023943272,0.000008658773,0.00025808747,0.000031441832,0.91217685,0.065881826,0.018600008,0.00037698922],"about_ca_topic_score_codex":0.0003628107,"about_ca_topic_score_gemma":0.000004730258,"teacher_disagreement_score":0.50648886,"about_ca_system_score_codex":0.000025769392,"about_ca_system_score_gemma":0.00007334726,"threshold_uncertainty_score":0.9996813},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99301004,0.0005874152,0.00018590242,0.000675962,0.0025070277,0.0001303269,4.4834215e-7,0.0000916418,0.002811237],"genre_scores_gemma":[0.99889195,0.0000102197255,0.0006378704,0.00038464708,0.0000010108321,0.000007067069,4.893465e-7,0.000006900184,0.000059869344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989439,0.000103104525,0.00018138967,0.00016360883,0.00034036784,0.00026758903],"domain_scores_gemma":[0.9986597,0.0004297711,0.00010249011,0.0006377904,0.000081163984,0.000089111934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000683434,0.00010416315,0.00012806307,0.00014400236,0.000118010554,0.000024874367,0.0004932463,0.00004841012,0.0000121205085],"category_scores_gemma":[0.00015120931,0.0000667583,0.00006608884,0.0008888042,0.00005214474,0.00017511079,0.00015780168,0.00012466093,0.00009974811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002261102,0.00013766477,0.0007799721,0.0000029751723,0.000012011906,5.108094e-7,0.00021790162,0.000026869537,0.00083661417,0.9925016,0.004895266,0.000586348],"study_design_scores_gemma":[0.0003821448,0.00015218987,0.0012950221,0.000023297347,0.000009327016,0.000003101735,0.000037260514,0.0016652081,0.0163855,0.9795818,0.00033570404,0.000129479],"about_ca_topic_score_codex":0.000023117926,"about_ca_topic_score_gemma":1.3704013e-7,"teacher_disagreement_score":0.015548886,"about_ca_system_score_codex":0.000013570824,"about_ca_system_score_gemma":0.000018308974,"threshold_uncertainty_score":0.27223244},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9884415,0.000018750647,0.000034801535,0.000732871,0.0005197062,0.00037300514,0.000042223477,0.000070441216,0.009766662],"genre_scores_gemma":[0.9985643,0.000011849103,0.00056552695,0.0005127198,0.000018873614,0.000021272555,0.000015208904,0.000031192998,0.00025903928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859947,0.00026582545,0.00032469712,0.00022625095,0.0003630608,0.00022069698],"domain_scores_gemma":[0.99806744,0.00088093407,0.00010582537,0.0006241521,0.00019243224,0.00012924656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037617428,0.00020487407,0.0003309161,0.000068878595,0.0002698557,0.000017827231,0.00038269692,0.00012537123,0.00036503817],"category_scores_gemma":[0.0001958947,0.000148759,0.00007615471,0.00036135933,0.00013497182,0.000063650004,0.00010165505,0.00028473345,0.00024675313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087614375,0.00035566726,0.0025674491,0.000008596005,0.000059992,0.00001917365,0.0018149535,0.0000034396073,0.0034484668,0.9846076,0.0070023695,0.000024691813],"study_design_scores_gemma":[0.001933559,0.0005273588,0.007477097,0.00018703895,0.000077694014,0.000012337362,0.00063084567,0.00014456226,0.14274235,0.84245354,0.0033074634,0.0005061522],"about_ca_topic_score_codex":0.00012475591,"about_ca_topic_score_gemma":0.000010203443,"teacher_disagreement_score":0.14215404,"about_ca_system_score_codex":0.000050951327,"about_ca_system_score_gemma":0.00007326855,"threshold_uncertainty_score":0.6066216},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98823255,0.000008385135,0.000037678336,0.000119698765,0.00018951953,0.000117527365,0.000003648915,0.000015758744,0.011275219],"genre_scores_gemma":[0.9995935,7.9255955e-7,0.00024155671,0.0000321185,0.0000013288374,0.000009532219,3.0147424e-7,0.000007951293,0.00011290931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946105,0.00007696709,0.0001884544,0.00007776483,0.00011419603,0.00008154459],"domain_scores_gemma":[0.9989915,0.00026543252,0.00014449014,0.0005113355,0.00006783394,0.000019436993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032272108,0.0000576832,0.0001343523,0.00001909896,0.000049789945,0.0000025685122,0.00025211883,0.000041433785,0.000036763093],"category_scores_gemma":[0.00022733473,0.00004013361,0.00008094271,0.0001846163,0.0001120483,0.000023574905,0.00006743559,0.0000736519,0.00000574212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033074427,0.0001524864,0.0011352092,0.000019488032,0.000011915432,1.7980376e-8,0.0002989639,0.0000010699827,0.0021831847,0.99556965,0.0005793121,0.000045395813],"study_design_scores_gemma":[0.00023528279,0.000023464827,0.0043831742,0.000021739826,0.000015524276,4.3200978e-7,0.00003677307,0.000031621745,0.025893137,0.9687857,0.000530751,0.0000423958],"about_ca_topic_score_codex":0.000007888974,"about_ca_topic_score_gemma":0.0000017705086,"teacher_disagreement_score":0.026783945,"about_ca_system_score_codex":0.000005330529,"about_ca_system_score_gemma":0.000011766608,"threshold_uncertainty_score":0.16366012},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99621487,0.00023916073,0.0004716778,0.0004186904,0.00054557354,0.00017269843,0.0000030813467,0.00009895833,0.0018352987],"genre_scores_gemma":[0.9969077,0.000088678404,0.0028086486,0.00005409529,0.000001980178,0.000017464039,4.6186648e-7,0.000009271485,0.00011166731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853045,0.00016774097,0.00018264388,0.00041773933,0.000317874,0.0003835261],"domain_scores_gemma":[0.9985254,0.00024813885,0.000035535497,0.000974378,0.000073506206,0.00014308126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034817247,0.0001260497,0.00017266875,0.0000986527,0.00011352328,0.0000344816,0.00088037946,0.000065823086,0.00004661246],"category_scores_gemma":[0.00020697735,0.00012741178,0.000038674345,0.00073907623,0.00025877135,0.0006772458,0.0005521731,0.00026167603,0.00003247997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000818702,0.000093239774,0.16826417,0.0000079031315,0.0000038141586,0.000051557276,0.00050443853,3.5575871e-7,0.00013948424,0.8295517,0.00031214283,0.0010629982],"study_design_scores_gemma":[0.00077154225,0.000039941522,0.093639955,0.0000065033914,4.2439086e-7,0.000033066957,0.000011657123,0.00015599071,0.0012845012,0.9035595,0.00036270864,0.00013421824],"about_ca_topic_score_codex":0.00004168812,"about_ca_topic_score_gemma":0.000013333335,"teacher_disagreement_score":0.07462421,"about_ca_system_score_codex":0.000048559934,"about_ca_system_score_gemma":0.00005474736,"threshold_uncertainty_score":0.5195702},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990249,0.00009233412,0.000248628,0.00006931801,0.00028370883,0.00029295744,0.000008403872,0.00009376937,0.008661915],"genre_scores_gemma":[0.9978907,0.000008025398,0.0017097193,0.000041809253,0.0000074437958,0.00006898463,0.000006575808,0.000039068866,0.00022763236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882275,0.00008340017,0.00029308692,0.00018307078,0.00024695418,0.00037071013],"domain_scores_gemma":[0.99859273,0.00025647477,0.00020480585,0.00070279837,0.00009697726,0.00014623792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032794048,0.00019305013,0.00027952317,0.00012241153,0.00011450508,0.000012088572,0.00031820705,0.00011333236,0.0000822464],"category_scores_gemma":[0.000054069376,0.00015814554,0.00009376574,0.0005438207,0.00017522024,0.00018792151,0.00007142709,0.00018126992,0.000031426716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025260912,0.00046691962,0.030318117,0.000034277695,0.00006679166,8.776866e-7,0.0002828538,4.3570128e-7,0.00054705486,0.9665511,0.00078466954,0.0009215902],"study_design_scores_gemma":[0.0008438912,0.00007118728,0.011195496,0.000034126744,0.00007046651,0.000009485627,0.00016512908,0.000006951951,0.004053378,0.982328,0.0010203923,0.00020151048],"about_ca_topic_score_codex":0.000016395783,"about_ca_topic_score_gemma":0.000008225861,"teacher_disagreement_score":0.019122621,"about_ca_system_score_codex":0.000019051658,"about_ca_system_score_gemma":0.000025226691,"threshold_uncertainty_score":0.64489883},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990464,0.0006322278,0.002451104,0.0001497003,0.0018117629,0.00014623947,0.0000020746672,0.00039970962,0.0039431932],"genre_scores_gemma":[0.9968464,0.000050738665,0.002789645,0.00021218893,0.0000123087775,0.000010245729,0.0000011457603,0.000010953063,0.00006640908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892825,0.00009906933,0.000179685,0.0003581464,0.00016094164,0.0002738902],"domain_scores_gemma":[0.9990761,0.00008987388,0.00007086454,0.00058440835,0.000040624367,0.0001381011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034323474,0.0001528654,0.00017938673,0.000110519126,0.00015600673,0.00006203171,0.0006548969,0.00007426853,0.000015866697],"category_scores_gemma":[0.000026311729,0.00014886267,0.00006780293,0.00036178489,0.00010639318,0.00044348382,0.0002623722,0.00014996492,0.000062539744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001024919,0.0001556729,0.0024797143,0.0000063910747,0.00002089184,0.000013973415,0.001137437,5.0572165e-8,0.0002139434,0.9928326,0.000122011035,0.0030070376],"study_design_scores_gemma":[0.00058192597,0.00025979063,0.007208711,0.000014484603,0.000010291666,0.000013572772,0.000021801963,0.0005905898,0.0019005373,0.98797494,0.0012134336,0.00020992637],"about_ca_topic_score_codex":0.000027288657,"about_ca_topic_score_gemma":0.0000020241448,"teacher_disagreement_score":0.0063823774,"about_ca_system_score_codex":0.000011768614,"about_ca_system_score_gemma":0.000022427168,"threshold_uncertainty_score":0.6070444},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9291854,0.000697972,0.008868592,0.007159863,0.0127618145,0.00064091483,0.0000048837837,0.0032041154,0.037476465],"genre_scores_gemma":[0.9776291,0.000007992645,0.021115448,0.0011170083,0.0000024254578,0.0000075183216,0.00000508135,0.000011917072,0.000103506856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860024,0.000108737484,0.00023797837,0.00039625293,0.00031397137,0.00034282886],"domain_scores_gemma":[0.9988288,0.00009556271,0.0000754065,0.0007702344,0.000086179294,0.0001437729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048894424,0.000150782,0.00016172096,0.00010684879,0.00015884283,0.00012044593,0.0008198201,0.00004616553,0.00003065694],"category_scores_gemma":[0.000023545042,0.000141863,0.0000671008,0.00036852667,0.000030903728,0.00025149144,0.00027874167,0.00013185562,0.00043588076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010320842,0.000095242554,0.00079028285,0.000010766218,0.000012256021,0.0000034557197,0.00016655585,0.000006416638,0.00018255856,0.9872301,0.009858499,0.0016428102],"study_design_scores_gemma":[0.00078202575,0.0001321736,0.00050262327,0.000011218716,0.000006893648,0.0000069750877,0.000007502289,0.013606033,0.0009820908,0.9595191,0.024246208,0.00019714225],"about_ca_topic_score_codex":0.000044808126,"about_ca_topic_score_gemma":0.000001954918,"teacher_disagreement_score":0.048443723,"about_ca_system_score_codex":0.000026021382,"about_ca_system_score_gemma":0.00002850438,"threshold_uncertainty_score":0.5785005},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99741983,0.00002794029,0.000088372595,0.0006394618,0.000093477436,0.0002482898,0.000006525814,0.000015844935,0.0014602615],"genre_scores_gemma":[0.99755037,0.00000399959,0.0021544942,0.000038674225,0.00001428967,0.00015669604,0.000007292138,0.000009145979,0.00006501755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994821,0.00001877371,0.0001274735,0.00014089746,0.0000757496,0.00015502477],"domain_scores_gemma":[0.9995196,0.00014512883,0.000081237005,0.00018099342,0.00002402643,0.000049049628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109626446,0.00009451783,0.00012476668,0.000016703023,0.00018012,0.00006190589,0.00012735093,0.000023501943,0.00008535385],"category_scores_gemma":[0.000008355794,0.00005557388,0.000016962027,0.00013778672,0.00016490747,0.00009415789,0.00004981442,0.00022364045,0.0000036378715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003679413,0.000053178686,0.010674558,0.000004410254,0.000009181604,5.294022e-7,0.0002332181,7.606402e-7,0.0013401934,0.9860036,0.000009032852,0.0016676643],"study_design_scores_gemma":[0.00041600506,0.000023866145,0.0036847608,0.000028317872,0.000012003007,0.0000022465156,0.000360545,0.00016865968,0.00162886,0.99104774,0.0025174816,0.000109533335],"about_ca_topic_score_codex":0.000024788025,"about_ca_topic_score_gemma":0.000009032075,"teacher_disagreement_score":0.0069897966,"about_ca_system_score_codex":0.0000036754186,"about_ca_system_score_gemma":0.000026959482,"threshold_uncertainty_score":0.22662371},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928557,0.000210546,0.0005789364,0.0007170695,0.0016812929,0.00015476604,7.0830964e-7,0.00034828618,0.0034526477],"genre_scores_gemma":[0.9973156,0.000008055031,0.0015345411,0.00061569124,0.000007489865,0.000027134443,0.0000019546708,0.000012680521,0.0004768766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883425,0.000059837505,0.00019012581,0.0003263719,0.00023071429,0.00035870145],"domain_scores_gemma":[0.998936,0.00013885013,0.00008038488,0.0006532768,0.000061322,0.00013015108],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022401511,0.00013612352,0.0001455407,0.000044875742,0.00017067239,0.000185571,0.00076883676,0.000054271703,0.00015451608],"category_scores_gemma":[0.000050884133,0.00012277199,0.000054700726,0.00023032507,0.00003504315,0.000592512,0.00051162386,0.000105254476,0.001644193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014489813,0.00007673849,0.0034050262,0.000009487481,0.000012456066,0.0000213796,0.0005692407,0.000002082042,0.0028112682,0.95121497,0.026417462,0.015458442],"study_design_scores_gemma":[0.00061030814,0.00010880923,0.018206103,0.000036525762,0.000004332765,0.000013038753,0.000050718234,0.025743805,0.003533868,0.9489328,0.0024311102,0.00032856557],"about_ca_topic_score_codex":0.00008175834,"about_ca_topic_score_gemma":0.0000020772536,"teacher_disagreement_score":0.025741722,"about_ca_system_score_codex":0.00007236177,"about_ca_system_score_gemma":0.000025109151,"threshold_uncertainty_score":0.99913317},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9855372,0.00028098153,0.010856427,0.0002927794,0.0009039211,0.0003170778,0.000014078302,0.00023806516,0.0015594796],"genre_scores_gemma":[0.990736,0.000018920975,0.008957195,0.00016282023,0.0000050316794,0.000015756961,0.0000048168763,0.000033347573,0.000066115834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969503,0.00038758165,0.00050486176,0.0007262325,0.0006789888,0.0007519866],"domain_scores_gemma":[0.997339,0.0005924088,0.00025492514,0.0011938742,0.00028868474,0.00033111137],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010626457,0.00030897828,0.00051167613,0.00035353441,0.00061741594,0.00055944384,0.0013416604,0.00010589873,0.000011757649],"category_scores_gemma":[0.0001635206,0.00031457175,0.00015853789,0.0013851642,0.0012447349,0.0009507664,0.0006035081,0.00038450575,0.00004031736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027975497,0.0000647229,0.014288674,0.000039974708,0.000037454898,0.000007428985,0.0007439976,0.000019215806,0.0073269946,0.9732415,0.00018544981,0.0040166057],"study_design_scores_gemma":[0.001353302,0.0003436454,0.02419281,0.000059970982,0.000010290819,0.000018965204,0.000028412584,0.007871139,0.0011237034,0.9615952,0.003044622,0.00035795433],"about_ca_topic_score_codex":0.00016806174,"about_ca_topic_score_gemma":0.000016247084,"teacher_disagreement_score":0.011646321,"about_ca_system_score_codex":0.000029597355,"about_ca_system_score_gemma":0.00006764793,"threshold_uncertainty_score":0.9999306},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8641013,0.0016045609,0.12066703,0.0009190902,0.0033576305,0.0009265208,0.000005640886,0.0003641471,0.008054088],"genre_scores_gemma":[0.99721384,0.000036204205,0.0026141815,0.000030772742,0.0000033264996,0.000011577405,0.0000027054396,0.000011785031,0.00007559214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978234,0.00019754285,0.00048456935,0.0003184258,0.0006698501,0.00050621165],"domain_scores_gemma":[0.9970008,0.0013950071,0.00024378805,0.00093041814,0.00030796687,0.000122028076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002289272,0.00015448288,0.00023870371,0.00023251717,0.0004135029,0.000084336556,0.0016264183,0.000064383814,0.000002745424],"category_scores_gemma":[0.00019349686,0.00012034711,0.00013092998,0.0013953479,0.00037418443,0.0003387103,0.00029332688,0.00024483525,0.000016046592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041475032,0.00009554165,0.0055326805,0.000009024697,0.000023266713,0.000004096381,0.00034509663,0.0000073329948,0.002098672,0.9722371,0.000445212,0.01916052],"study_design_scores_gemma":[0.00072123454,0.00017332079,0.025235945,0.000017173188,0.0000042040297,0.0000033839838,0.00011820406,0.0023289535,0.009680525,0.95853084,0.0030363998,0.00014979938],"about_ca_topic_score_codex":0.00001534112,"about_ca_topic_score_gemma":0.000025098967,"teacher_disagreement_score":0.13311256,"about_ca_system_score_codex":0.000041991676,"about_ca_system_score_gemma":0.000035238012,"threshold_uncertainty_score":0.49076128},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9918104,0.0002415433,0.00016080934,0.00027181685,0.0006677253,0.0004289828,0.000008381879,0.00004376785,0.0063665984],"genre_scores_gemma":[0.9975667,0.000035256482,0.0018998863,0.000026091646,0.000015171751,0.000040722654,0.0000027219435,0.00003430965,0.00037915344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998272,0.00027496944,0.00057724083,0.00020892618,0.00037148976,0.00029537434],"domain_scores_gemma":[0.99684757,0.0014838061,0.00051107164,0.0007265229,0.00034944428,0.0000816024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006307381,0.00020814878,0.0004358513,0.00005170013,0.00020014393,0.000030450661,0.00047126084,0.000093847506,0.000046555713],"category_scores_gemma":[0.0006623639,0.00014880084,0.00015139142,0.000231802,0.00033221042,0.00026814258,0.0001593351,0.00028067725,0.00004122599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011642896,0.00024457424,0.0032952367,0.00005558479,0.00010191043,0.0000013707199,0.0010200047,9.811681e-7,0.002402262,0.9874031,0.004033605,0.0014297196],"study_design_scores_gemma":[0.0008871557,0.00013520295,0.0069804788,0.000056344932,0.000041972806,0.000002408136,0.0002701954,0.00019268948,0.017595556,0.97349143,0.00018596942,0.00016059841],"about_ca_topic_score_codex":0.00017470018,"about_ca_topic_score_gemma":0.000047189176,"teacher_disagreement_score":0.015193294,"about_ca_system_score_codex":0.00004988354,"about_ca_system_score_gemma":0.00006809931,"threshold_uncertainty_score":0.6067922},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99574447,0.00013359066,0.00023205859,0.00018487514,0.0014057828,0.000085468564,0.0000013170929,0.00015340206,0.0020590217],"genre_scores_gemma":[0.9985526,0.000022134607,0.001132771,0.00020604272,3.4478654e-7,0.0000065486797,0.0000012842619,0.000008677206,0.00006955479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873096,0.00005580993,0.0002617471,0.0003161031,0.00038396596,0.00025143105],"domain_scores_gemma":[0.99887514,0.000098292854,0.00011825207,0.0006683306,0.00012586251,0.00011414206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020294375,0.00013278566,0.00019001811,0.00020136057,0.00014258939,0.000018875366,0.00053980824,0.00007131929,0.000009253386],"category_scores_gemma":[0.00004647963,0.00012061024,0.00008541365,0.0007230261,0.00010826503,0.00017919214,0.00012618963,0.00014037061,0.00007165385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079428955,0.00016005884,0.0043628463,0.000005482687,0.000012529011,0.000018781664,0.0002319966,0.000064107466,0.00042056292,0.9889933,0.005342179,0.0003802131],"study_design_scores_gemma":[0.0007450986,0.00035822773,0.005292074,0.000027578832,0.0000027837734,0.000014065681,0.000003529052,0.0018027383,0.0047787516,0.98653144,0.00029244952,0.00015127659],"about_ca_topic_score_codex":0.000043161803,"about_ca_topic_score_gemma":9.503023e-7,"teacher_disagreement_score":0.0050497293,"about_ca_system_score_codex":0.000010424562,"about_ca_system_score_gemma":0.000053242922,"threshold_uncertainty_score":0.49183428},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98022884,0.000016318369,0.00003325313,0.000088459456,0.00033816567,0.0002554822,0.0000039386528,0.000034342367,0.0190012],"genre_scores_gemma":[0.9991036,0.000004817447,0.00063793006,0.00007161703,0.0000022072995,0.000040239458,3.8873463e-7,0.000010506421,0.00012866582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994459,0.000060649276,0.00015365474,0.000103068174,0.00013327689,0.00010344027],"domain_scores_gemma":[0.99923277,0.00012420588,0.000094728915,0.0004841793,0.00003854783,0.000025580965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020711598,0.00007765943,0.000100443205,0.00003150446,0.00010115701,0.0000036468969,0.0002587599,0.000035120287,0.00007039281],"category_scores_gemma":[0.000054367498,0.0000529157,0.00009566697,0.000175528,0.000075290096,0.000021173335,0.000044252763,0.00007701329,0.000021959302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009968956,0.00027696387,0.0006087712,0.000013244383,0.000019616295,2.2416992e-7,0.00106305,1.201904e-7,0.00041132662,0.9965021,0.0009116929,0.00018290103],"study_design_scores_gemma":[0.00021945962,0.000046459514,0.0038351787,0.00002374173,0.000028991617,4.351815e-7,0.000055564746,0.000002296729,0.035849825,0.9595453,0.00033501827,0.000057693473],"about_ca_topic_score_codex":0.000009462369,"about_ca_topic_score_gemma":0.0000031062564,"teacher_disagreement_score":0.036956783,"about_ca_system_score_codex":0.000008348249,"about_ca_system_score_gemma":0.000009910365,"threshold_uncertainty_score":0.21578395},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98613256,0.000006013558,0.000015622047,0.00030096748,0.00033548893,0.0001862732,0.000004151813,0.000051931773,0.0129670035],"genre_scores_gemma":[0.9981443,0.0000036736799,0.0015067562,0.000014342464,0.0000064997103,0.000027396545,0.0000015263249,0.00001910417,0.00027636357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933696,0.000040669045,0.00017186718,0.00012291153,0.00014662299,0.00018096832],"domain_scores_gemma":[0.9988869,0.00043377528,0.0001210104,0.00045454054,0.000051267303,0.000052550316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033223903,0.000103350874,0.00013485749,0.000021453348,0.0002545626,0.000028110126,0.0002845912,0.000051970423,0.00005072133],"category_scores_gemma":[0.000041217274,0.000068002446,0.00006418951,0.00019797802,0.00017928096,0.00005835462,0.000027485188,0.00027179316,0.000023692668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001825729,0.00009037272,0.002579899,0.000010490024,0.000035127865,0.0000013689285,0.00043320315,1.8195783e-7,0.0018462683,0.9941995,0.0006590667,0.00012625605],"study_design_scores_gemma":[0.0003507877,0.000026305615,0.0023296205,0.000011733891,0.000026692705,0.000015044786,0.00017657432,0.0000034098987,0.0037442623,0.99174225,0.0014812541,0.000092074464],"about_ca_topic_score_codex":0.000016350434,"about_ca_topic_score_gemma":0.000065477514,"teacher_disagreement_score":0.012690639,"about_ca_system_score_codex":0.000005265775,"about_ca_system_score_gemma":0.0000207281,"threshold_uncertainty_score":0.27730593},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8804433,0.00046728237,0.11127356,0.0005796574,0.0014004167,0.0012762689,0.0000047734384,0.00012717675,0.0044275993],"genre_scores_gemma":[0.9931655,0.000035214256,0.0065914122,0.000010861683,0.0000024065955,0.000065686814,0.000001272733,0.000007052145,0.00012058873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916476,0.000097185286,0.00017926919,0.00019722256,0.00017699815,0.00018453671],"domain_scores_gemma":[0.99837357,0.00080600404,0.000115068135,0.00036191125,0.0002985064,0.00004495104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059998175,0.00007761882,0.00010739308,0.00008486306,0.00019397716,0.000035208188,0.00051237753,0.00004192255,0.0000018645234],"category_scores_gemma":[0.00039572886,0.000059205708,0.000035947145,0.0002945412,0.00015346013,0.00033042885,0.00012582047,0.00006322657,0.0000019752151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052982236,0.000036680805,0.0001708447,0.000008502024,0.000010441912,4.359709e-7,0.0005920182,2.5047638e-7,0.0015140754,0.9548035,0.00007494764,0.042735294],"study_design_scores_gemma":[0.0010792287,0.00021500513,0.005578633,0.000007476241,0.000004201856,0.000002100304,0.00006421811,0.0043661827,0.030896982,0.95742,0.00029298753,0.00007300644],"about_ca_topic_score_codex":0.0000057115226,"about_ca_topic_score_gemma":0.0000072841854,"teacher_disagreement_score":0.11272224,"about_ca_system_score_codex":0.000019987314,"about_ca_system_score_gemma":0.000027010703,"threshold_uncertainty_score":0.24143386},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9894454,0.0003542969,0.0018305044,0.000103003906,0.0023915356,0.00019994269,0.000004174271,0.00027191496,0.005399237],"genre_scores_gemma":[0.9953646,0.000012133721,0.0044636307,0.0000657981,7.112974e-7,0.000020782732,0.000004518097,0.000011684889,0.00005611581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982399,0.000104231534,0.0003749458,0.00048798634,0.0003113436,0.00048160265],"domain_scores_gemma":[0.9989214,0.000054702985,0.00012531683,0.0006567172,0.00009547695,0.00014637041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003672242,0.00019201146,0.00023755063,0.0002042334,0.00013758756,0.00006682192,0.00071691524,0.00006229719,0.000022324542],"category_scores_gemma":[0.00002670507,0.00018235898,0.000073559226,0.000863208,0.000108426386,0.00048269876,0.00020706758,0.0002091852,0.000057534005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008644403,0.0001430082,0.030328017,0.000006557444,0.000011403434,0.000018707182,0.000664721,0.000010561335,0.00018063492,0.9679453,0.000228281,0.00045415765],"study_design_scores_gemma":[0.00110581,0.00015567354,0.019523133,0.000059474365,0.0000059686276,0.0000032554817,0.00008500637,0.0047126915,0.00073716213,0.972746,0.0005804865,0.00028530514],"about_ca_topic_score_codex":0.00020956379,"about_ca_topic_score_gemma":0.00005795135,"teacher_disagreement_score":0.010804883,"about_ca_system_score_codex":0.000030787738,"about_ca_system_score_gemma":0.000039427756,"threshold_uncertainty_score":0.7436384},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97035044,0.000011527047,0.000011519086,0.00015030547,0.002909575,0.0003149671,0.000008293553,0.0001852282,0.026058141],"genre_scores_gemma":[0.99820036,0.000003306849,0.0004151771,0.00009837233,0.000029593717,0.000047729234,0.000006984602,0.00006197071,0.001136505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791765,0.00013589214,0.0003065689,0.00039415533,0.00070543255,0.00054027146],"domain_scores_gemma":[0.9972602,0.0014416131,0.00006325332,0.00093142927,0.00011557611,0.00018792733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011548181,0.00024294587,0.00029596817,0.00015088558,0.00017431655,0.0000988473,0.0006667852,0.0002156637,0.0008281011],"category_scores_gemma":[0.001178555,0.0002151957,0.00011388392,0.0003274918,0.00022727669,0.00018577483,0.00015371335,0.0008916282,0.0004958062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004714322,0.0002681963,0.0038975026,0.000028713232,0.000030141522,0.000038514394,0.00018376857,1.9663517e-7,0.008277188,0.97611433,0.010816157,0.00029816543],"study_design_scores_gemma":[0.00047081962,0.00019749027,0.0019320603,0.00002381229,0.000013214727,0.000010248406,0.00003435339,0.00006395484,0.0063795974,0.9896441,0.0009801664,0.00025014766],"about_ca_topic_score_codex":0.000016768763,"about_ca_topic_score_gemma":0.000028402726,"teacher_disagreement_score":0.027849916,"about_ca_system_score_codex":0.000056976303,"about_ca_system_score_gemma":0.000062070874,"threshold_uncertainty_score":0.9067127},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99662083,0.0000267577,0.00024677513,0.00017598933,0.00069439795,0.00014985856,0.000027079059,0.000013340047,0.0020449639],"genre_scores_gemma":[0.9989409,0.000012959187,0.0006167939,0.000032382377,0.000015585267,0.00003001433,0.00018174289,0.00001550206,0.0001541096],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943155,0.000021888696,0.00014484109,0.00017160301,0.00011329827,0.000116831005],"domain_scores_gemma":[0.99948233,0.00002123897,0.000048238304,0.0003023112,0.00008697289,0.00005892526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006141525,0.00009258356,0.000084069965,0.00005873473,0.00009586819,0.000009232672,0.00013961777,0.00009680752,0.00006739069],"category_scores_gemma":[0.000048766593,0.00009716599,0.00007391272,0.00010769807,0.000067306086,0.0000034269149,0.000017359856,0.00011072248,0.000025416883],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007600848,0.00017601823,0.0015849519,0.0000071201052,0.000039401748,4.551427e-7,0.00024506057,0.000022457445,0.88105,0.116210096,0.00034553933,0.00031132984],"study_design_scores_gemma":[0.002082274,0.0008986319,0.059880055,0.00001676903,0.000091840986,0.0000066449115,0.00021827084,0.000067069814,0.6382672,0.2890557,0.008929339,0.0004862034],"about_ca_topic_score_codex":0.000022224884,"about_ca_topic_score_gemma":0.000040042785,"teacher_disagreement_score":0.24278276,"about_ca_system_score_codex":0.000007731775,"about_ca_system_score_gemma":0.0000408012,"threshold_uncertainty_score":0.39623138},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.577076,0.00036415842,0.41460702,0.0014172666,0.001958844,0.0025138012,0.000010135641,0.00062723225,0.0014255281],"genre_scores_gemma":[0.80945975,0.000007529505,0.18965113,0.00015701455,0.000028722632,0.00013062342,0.000007690225,0.00003620425,0.00052131526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982292,0.0001185111,0.0002806116,0.00048173513,0.00028895185,0.000601],"domain_scores_gemma":[0.99836886,0.00060037215,0.00007862146,0.00060375175,0.00020690919,0.00014146233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005814218,0.00017597382,0.00024765078,0.00020856361,0.00013382194,0.00013016764,0.0011315815,0.00008296489,0.000020350257],"category_scores_gemma":[0.00013909877,0.00017459321,0.00007576939,0.0006794387,0.00007841881,0.0006057531,0.00043808494,0.00023433649,0.00039849646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070962537,0.00033332888,0.001862357,0.00002191296,0.000024843534,0.00003368787,0.0006889067,0.00016409515,0.0012039647,0.5966076,0.0014872599,0.39756492],"study_design_scores_gemma":[0.00082623924,0.00015075866,0.0020949042,0.000026825557,0.0000011492876,0.000004958475,0.000018356162,0.46892235,0.00075296377,0.5266497,0.00036258297,0.0001892057],"about_ca_topic_score_codex":0.000041180156,"about_ca_topic_score_gemma":0.0000032832309,"teacher_disagreement_score":0.46875826,"about_ca_system_score_codex":0.0000695271,"about_ca_system_score_gemma":0.000056151788,"threshold_uncertainty_score":0.71197045},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97158945,0.00019332574,0.015625078,0.0020491076,0.0018954318,0.0005903704,0.0000015909429,0.0006704474,0.007385178],"genre_scores_gemma":[0.9819762,0.000014307512,0.016824031,0.0007962447,0.000015680012,0.00014357327,0.0000071066806,0.000018045794,0.00020479009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831533,0.000092314454,0.00031120065,0.00054221513,0.0002734919,0.00046543166],"domain_scores_gemma":[0.998276,0.0002302078,0.00015821718,0.0009911046,0.00015810374,0.00018638848],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017227388,0.00022076661,0.00024232545,0.0000817122,0.00019017949,0.00030861428,0.001075501,0.000108739805,0.00004188434],"category_scores_gemma":[0.00011107582,0.00020261382,0.00008748979,0.0005023407,0.00006378289,0.0015040764,0.0002990838,0.00019691154,0.0012074471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002476196,0.00007837384,0.00036565735,0.0000073912647,0.0000133755,0.0000034823024,0.00013348843,0.000007086383,0.0042089615,0.9774532,0.0011263981,0.016600113],"study_design_scores_gemma":[0.0005967971,0.000099821926,0.010032442,0.0000080152895,0.0000068241434,0.000013056186,0.000019362935,0.0010083419,0.0016409984,0.98516077,0.0011400343,0.00027353351],"about_ca_topic_score_codex":0.000037904596,"about_ca_topic_score_gemma":7.908683e-7,"teacher_disagreement_score":0.016326578,"about_ca_system_score_codex":0.000055357847,"about_ca_system_score_gemma":0.000045348366,"threshold_uncertainty_score":0.99957025},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99169785,0.00070372777,0.00021978328,0.00023883505,0.0057064844,0.000115243914,7.8678585e-7,0.00012691175,0.0011903612],"genre_scores_gemma":[0.997415,0.000007994541,0.0024258948,0.000076737946,0.000003923782,0.000005765601,0.000001756553,0.000006476886,0.000056419827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890727,0.00006212557,0.00022006071,0.00021611621,0.00027251136,0.00032190664],"domain_scores_gemma":[0.9990106,0.00005129597,0.00010131669,0.0005881002,0.00011834457,0.000130292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005049179,0.00010860919,0.00016404696,0.00008229948,0.00007152967,0.000027479486,0.00044956536,0.000041444593,0.000008328283],"category_scores_gemma":[0.00006160529,0.000098073884,0.000058384856,0.00040643412,0.000055181972,0.00038658583,0.00019643726,0.00010366954,0.000062311774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034152924,0.00019554886,0.045092296,0.000016119619,0.000014535166,0.0000024812418,0.00035087182,0.00000533377,0.001108008,0.94491225,0.0028512075,0.0054479335],"study_design_scores_gemma":[0.0011746151,0.00020893465,0.06612764,0.000054541913,0.000021253045,0.00003712921,0.000013410498,0.00066909404,0.051887393,0.8783455,0.001052653,0.00040781623],"about_ca_topic_score_codex":0.00003706694,"about_ca_topic_score_gemma":6.3751975e-7,"teacher_disagreement_score":0.066566736,"about_ca_system_score_codex":0.000012573346,"about_ca_system_score_gemma":0.000040828498,"threshold_uncertainty_score":0.3999337},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98491675,0.00009430952,0.0068520475,0.0000957722,0.0010961309,0.00014630127,0.0000015169894,0.00035510963,0.006442075],"genre_scores_gemma":[0.9962111,0.000013602081,0.0035187742,0.0001369063,0.000006617564,0.000018599243,0.0000025112388,0.000016395328,0.000075487034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986179,0.00015469208,0.00019505413,0.00040389696,0.00028322762,0.00034526878],"domain_scores_gemma":[0.9988379,0.0000878289,0.0001040389,0.0007707715,0.000059242117,0.00014025849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030188865,0.00020070806,0.00021430691,0.00012744081,0.00018498242,0.000074614516,0.0012119099,0.000060171504,0.0000286151],"category_scores_gemma":[0.000009586925,0.00016983025,0.00007958565,0.0004042974,0.00010445204,0.00045338954,0.00023669383,0.00017123467,0.00011822527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059588532,0.00042109372,0.030766996,0.000008033128,0.000058203208,0.00005072191,0.0015367729,5.297951e-7,0.0003026323,0.9640816,0.00019861509,0.002515219],"study_design_scores_gemma":[0.001195659,0.00088695856,0.04715802,0.000069598864,0.000020398516,0.000040333023,0.00005987478,0.0008790798,0.0032579093,0.9446762,0.0013113698,0.00044458912],"about_ca_topic_score_codex":0.000111037756,"about_ca_topic_score_gemma":0.0000061713195,"teacher_disagreement_score":0.019405387,"about_ca_system_score_codex":0.000021074595,"about_ca_system_score_gemma":0.000027465263,"threshold_uncertainty_score":0.6925477},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91355157,0.00027318008,0.0020146351,0.0010978458,0.015036677,0.0007071033,0.0000044121402,0.0008162163,0.066498354],"genre_scores_gemma":[0.9946862,0.000012139821,0.004475167,0.00010204667,0.000079846526,0.000029698786,0.0000030050549,0.000021289108,0.0005906426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979037,0.00024111927,0.00025665018,0.00047741394,0.0005795765,0.00054154254],"domain_scores_gemma":[0.9985116,0.00020340548,0.00006353116,0.00075480243,0.00018523316,0.0002814046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006862806,0.00017151021,0.00023198134,0.0003662402,0.00006699084,0.00009567803,0.0013210532,0.000093819275,0.0000138437645],"category_scores_gemma":[0.00035434944,0.00017508345,0.000061689156,0.0017881936,0.00011277468,0.00059360574,0.00044543468,0.00031871133,0.00020659533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003815834,0.00015478751,0.004204424,0.0000034860718,0.0000057992593,0.000109102315,0.0008293077,0.0000116979845,0.00017915084,0.97912717,0.010498883,0.004838058],"study_design_scores_gemma":[0.0014496073,0.00013305,0.0034585388,0.00001416569,0.0000012925021,0.0000075996263,0.000024347193,0.0014355744,0.0009072955,0.9838586,0.008490653,0.00021928157],"about_ca_topic_score_codex":0.000027433729,"about_ca_topic_score_gemma":0.000030674735,"teacher_disagreement_score":0.08113459,"about_ca_system_score_codex":0.00013300747,"about_ca_system_score_gemma":0.00017165153,"threshold_uncertainty_score":0.7139695},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9909926,0.00006937047,0.000031505366,0.00163273,0.00056902616,0.0004202173,0.000027409797,0.00007468597,0.0061824634],"genre_scores_gemma":[0.9989615,0.000004901619,0.00061129336,0.00013184367,0.000015166369,0.000042566855,0.000004956098,0.00002990376,0.0001978604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791294,0.0007709784,0.00032159485,0.00017442177,0.00055248017,0.00026755958],"domain_scores_gemma":[0.98772836,0.010938097,0.00015226475,0.0007879369,0.0002791344,0.000114196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020992144,0.00016105158,0.0002869446,0.000097645425,0.00018317,0.000050512004,0.00033955192,0.000081958155,0.00009239062],"category_scores_gemma":[0.0072583775,0.00011523509,0.00007933232,0.000232138,0.00032223048,0.00015654259,0.00017840373,0.00037821074,0.00014689473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003702474,0.00033640544,0.00051340787,0.000023136294,0.000046735404,0.000009977265,0.0017087257,0.000027405884,0.00009578693,0.9837441,0.013430409,0.000026877538],"study_design_scores_gemma":[0.00078691595,0.00028980293,0.00040051513,0.000036795922,0.00001744022,0.0000048844663,0.0006124572,0.00074072555,0.0016031984,0.9952753,0.00011119672,0.00012077317],"about_ca_topic_score_codex":0.000029324663,"about_ca_topic_score_gemma":0.00002246724,"teacher_disagreement_score":0.013319212,"about_ca_system_score_codex":0.000067941284,"about_ca_system_score_gemma":0.00013363482,"threshold_uncertainty_score":0.868948},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97054005,0.00030111658,0.022207677,0.0007432751,0.0012193805,0.00031672834,0.0000016695648,0.00043418782,0.004235922],"genre_scores_gemma":[0.9940786,0.000019866191,0.0054458207,0.0003197698,0.0000040046657,0.000017034234,0.0000013688588,0.000014209667,0.00009936611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851364,0.00018518847,0.00017892286,0.0004159869,0.0003194827,0.0003867742],"domain_scores_gemma":[0.9985717,0.0003597682,0.00006407331,0.00075622497,0.0000631306,0.00018512778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000520296,0.00016612493,0.00021537635,0.00016976101,0.00018154678,0.0001459197,0.0008538706,0.00006711892,0.000010381954],"category_scores_gemma":[0.00013910476,0.00014997963,0.00004768718,0.00042995196,0.00016442745,0.00035639343,0.00031063694,0.00020067209,0.000056356042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040661625,0.000025734316,0.0011228358,0.000018440822,0.000013471912,0.000008638052,0.00021681337,0.0000033981325,0.00057738746,0.9928502,0.0005991658,0.0045598675],"study_design_scores_gemma":[0.0006243554,0.00015905769,0.00314519,0.000018496652,0.0000035779435,0.000034142646,0.000008282864,0.0065499367,0.0010689859,0.98723865,0.0009645676,0.00018476883],"about_ca_topic_score_codex":0.000009742432,"about_ca_topic_score_gemma":0.0000022648996,"teacher_disagreement_score":0.023538517,"about_ca_system_score_codex":0.000020462236,"about_ca_system_score_gemma":0.000024723586,"threshold_uncertainty_score":0.61159915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9752396,0.00023137519,0.01750156,0.00044492772,0.0010962234,0.00041422542,0.000005922719,0.00020928356,0.0048569236],"genre_scores_gemma":[0.9921872,0.00002790954,0.007559056,0.00009686954,0.0000047989192,0.000016982114,0.0000018808029,0.000015947218,0.000089381756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822426,0.00022641831,0.00025434766,0.00044194047,0.0004488079,0.00040425584],"domain_scores_gemma":[0.9982981,0.0003326523,0.000112503716,0.000937699,0.00012853289,0.00019050596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073107245,0.0001730939,0.0002860675,0.00024407245,0.00013643404,0.00005344459,0.0009443399,0.00006747458,0.000028627028],"category_scores_gemma":[0.00013559841,0.00016963723,0.00008542124,0.000601316,0.00034983986,0.00040295316,0.000486932,0.00019112411,0.000026957707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007864068,0.000055747307,0.0020112458,0.00002124605,0.000018150879,0.0000056768304,0.00019808997,0.0000050536164,0.0044267382,0.9840013,0.00025908815,0.008989838],"study_design_scores_gemma":[0.0008160976,0.00022640596,0.003586983,0.000018902692,0.000005146559,0.0000115589155,0.00001816216,0.003836779,0.012245353,0.9745368,0.0045137745,0.00018408439],"about_ca_topic_score_codex":0.000025220195,"about_ca_topic_score_gemma":0.000006580708,"teacher_disagreement_score":0.016947616,"about_ca_system_score_codex":0.00002081642,"about_ca_system_score_gemma":0.000038134694,"threshold_uncertainty_score":0.6917606},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99732304,0.00001909104,0.0011454526,0.0002816842,0.00029072046,0.00013091609,0.0000023943321,0.00003403803,0.0007726473],"genre_scores_gemma":[0.9997203,0.0000018366089,0.000107692285,0.00014114054,0.000003862578,0.000006356367,0.0000015959728,0.0000036548015,0.000013585058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858946,0.00021969012,0.00032733148,0.0002752662,0.00040068573,0.00018754575],"domain_scores_gemma":[0.99782157,0.0010306472,0.00021890957,0.00079853757,0.00008129353,0.000049062637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054719776,0.00011752968,0.0003194132,0.00021680066,0.00012258047,0.000032245876,0.0013512616,0.0000367109,0.000026375532],"category_scores_gemma":[0.00040669445,0.00007293009,0.000099853125,0.001722552,0.000097578595,0.00009572499,0.00036144507,0.00011899513,0.000013369883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004803992,0.00051520497,0.008184828,0.0000028974132,0.000048463506,8.1115707e-7,0.0002742113,0.00003370229,0.00019084009,0.987924,0.00049432146,0.0023259236],"study_design_scores_gemma":[0.0004997463,0.0010987835,0.0836049,0.000007661094,0.00002574269,5.133626e-7,0.00014187858,0.0011147717,0.0007458112,0.91249835,0.00015564443,0.000106210944],"about_ca_topic_score_codex":0.0002241941,"about_ca_topic_score_gemma":0.000011448885,"teacher_disagreement_score":0.075425655,"about_ca_system_score_codex":0.000006788845,"about_ca_system_score_gemma":0.000008414678,"threshold_uncertainty_score":0.29740027},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97063076,0.000054920463,0.018593814,0.00049042125,0.005010515,0.00042889695,0.0000028763934,0.00014475721,0.0046430593],"genre_scores_gemma":[0.9991806,0.0000033606134,0.00037300965,0.00025586673,0.000013092747,0.000051364415,0.0000022210154,0.000011235626,0.00010920868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847835,0.00019731908,0.00036699846,0.00035701736,0.00029691707,0.00030338997],"domain_scores_gemma":[0.9983748,0.0003212994,0.0001882238,0.0006760507,0.00032795034,0.00011167913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031945118,0.00017405029,0.00032916732,0.00013907622,0.00012839313,0.00010629223,0.0005838552,0.000074565905,0.00008077198],"category_scores_gemma":[0.000049085866,0.00015302171,0.00011212501,0.00053915515,0.00006544118,0.0003131145,0.00015595184,0.00016615872,0.000289624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062677886,0.00019409062,0.0008946259,0.000014355782,0.00003426101,0.0000024093922,0.00022747436,0.00016940694,0.0012501633,0.9858764,0.0106938835,0.0006366837],"study_design_scores_gemma":[0.002061782,0.00091672793,0.020824535,0.00017379851,0.0000106133875,0.000023844652,0.00005869026,0.12268724,0.0025542811,0.8447365,0.0053749396,0.00057701475],"about_ca_topic_score_codex":0.0004162978,"about_ca_topic_score_gemma":0.000014158642,"teacher_disagreement_score":0.14113985,"about_ca_system_score_codex":0.000040757914,"about_ca_system_score_gemma":0.000027126076,"threshold_uncertainty_score":0.6240045},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9586763,0.00012759314,0.01688551,0.00043273112,0.007817055,0.00013032503,1.3737355e-7,0.00020971739,0.015720643],"genre_scores_gemma":[0.99924624,0.0000034830882,0.0003457779,0.00015961655,0.000015547661,0.000012358806,5.5977046e-7,0.0000073551555,0.00020904656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989583,0.00013281753,0.00022729588,0.0002692428,0.0001575362,0.0002547965],"domain_scores_gemma":[0.9993314,0.00011026446,0.000064118256,0.00039506942,0.0000416988,0.000057433874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005398864,0.00010367582,0.00016961341,0.00014600398,0.00007433724,0.00011939442,0.0005093478,0.00006202001,0.000007356116],"category_scores_gemma":[0.00003705108,0.000098215656,0.000057700803,0.00045418405,0.00001757628,0.0002726723,0.00009213759,0.00013611624,0.000060376027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016422679,0.000025933372,0.009433937,0.0000026200062,0.0000038355192,0.000004743623,0.00032505643,0.00015073155,0.00008283531,0.98569065,0.0013933659,0.0028846501],"study_design_scores_gemma":[0.0010293048,0.00019425373,0.02827395,0.00009068396,0.0000022927093,0.000018922927,0.000050584946,0.18031235,0.00038136056,0.7783,0.011026686,0.0003196483],"about_ca_topic_score_codex":0.000113659305,"about_ca_topic_score_gemma":0.00006586695,"teacher_disagreement_score":0.20739068,"about_ca_system_score_codex":0.000031982563,"about_ca_system_score_gemma":0.000013215811,"threshold_uncertainty_score":0.4005118},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93482643,0.0004329347,0.04143078,0.00080606114,0.0028745392,0.00043771992,0.0000034194277,0.00058717804,0.018600939],"genre_scores_gemma":[0.9938672,0.000011893971,0.0023789273,0.00014494351,0.000021338385,0.000025781812,0.0000031204318,0.000028403938,0.0035183432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977478,0.00023754952,0.0002596622,0.0005829501,0.00055199803,0.000620071],"domain_scores_gemma":[0.9979664,0.00036426002,0.00010958953,0.0011846878,0.00013750712,0.00023755965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007671485,0.00021582683,0.0002670207,0.00017519413,0.00035561676,0.00017841744,0.0014919312,0.000089787856,0.000023619425],"category_scores_gemma":[0.00021266699,0.00021012343,0.000079736994,0.00053142564,0.00015963012,0.00060391857,0.00090471806,0.00028058214,0.00039190357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001798354,0.000096597425,0.0037875837,0.0000085978945,0.000017139317,0.000019512232,0.00058980164,0.00007195751,0.002400125,0.9659288,0.0016945549,0.02536737],"study_design_scores_gemma":[0.0023255749,0.0004877418,0.003358988,0.000044973272,0.0000053760264,0.000022388824,0.00007065536,0.03898575,0.013875663,0.9076148,0.03272996,0.0004780794],"about_ca_topic_score_codex":0.000019616411,"about_ca_topic_score_gemma":0.000010163661,"teacher_disagreement_score":0.05904082,"about_ca_system_score_codex":0.00011976904,"about_ca_system_score_gemma":0.00004042406,"threshold_uncertainty_score":0.8568585},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94350475,0.00001926321,0.0008562145,0.00005008485,0.00041860115,0.00023385859,0.0000104973215,0.00012366258,0.05478308],"genre_scores_gemma":[0.9750199,0.0000025544807,0.024350533,0.00003985517,0.000002735051,0.000012696722,0.0000017621427,0.000024993882,0.00054498325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987077,0.00012576768,0.00040552253,0.00021042027,0.00028886725,0.00026172225],"domain_scores_gemma":[0.998339,0.0006058576,0.00020365839,0.0004731825,0.0002581071,0.000120217395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005495236,0.00015700186,0.00041944688,0.000038632395,0.00004810734,0.000008780001,0.0002943258,0.00009703959,0.0002824104],"category_scores_gemma":[0.003022925,0.00014519981,0.00008816698,0.00034575694,0.00013175423,0.00011941729,0.00012906335,0.00011979294,0.00005014022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014520718,0.0003516007,0.00094745215,0.00006635519,0.000048950886,0.000007176978,0.002423614,2.7559932e-7,0.00049501925,0.9952529,0.00035003625,0.000042087187],"study_design_scores_gemma":[0.0002701233,0.000086201195,0.00047563927,0.000080887985,0.00003148934,0.0000018240689,0.0005163763,0.000005560915,0.030767115,0.9675622,0.00004371456,0.00015889396],"about_ca_topic_score_codex":0.0000393978,"about_ca_topic_score_gemma":0.00001266393,"teacher_disagreement_score":0.054238096,"about_ca_system_score_codex":0.00006676279,"about_ca_system_score_gemma":0.00004718957,"threshold_uncertainty_score":0.59210765},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907917,0.000044663757,0.003011366,0.0014407353,0.00026984478,0.0003491659,0.0000018015625,0.0000750694,0.0040156464],"genre_scores_gemma":[0.9958647,0.0000058900596,0.0035806901,0.00008511641,0.00000265627,0.000057986297,9.541337e-7,0.000014483024,0.0003875538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843305,0.00014673459,0.00015975545,0.00029416924,0.000589029,0.00037726917],"domain_scores_gemma":[0.9984899,0.00022369457,0.00010113081,0.00086440414,0.00021877894,0.00010205752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036769634,0.00014323716,0.0001711549,0.000056416833,0.00013433436,0.000101116726,0.001411728,0.000049721453,0.00010271422],"category_scores_gemma":[0.000031530053,0.00008846147,0.000053239408,0.00052424055,0.00019238291,0.00055491977,0.00040390054,0.000262329,0.00021961375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001209053,0.00010263151,0.020855216,0.0000060511784,0.000030790117,0.000010283571,0.00038454708,0.000020060279,0.00022414823,0.97488403,0.0008816393,0.0025885378],"study_design_scores_gemma":[0.00087528594,0.00018053193,0.049251467,0.000015991463,0.0000051491284,0.00003562776,0.00014693248,0.0012293906,0.0020542776,0.9454634,0.00055858906,0.00018333101],"about_ca_topic_score_codex":0.000071515096,"about_ca_topic_score_gemma":0.000018251656,"teacher_disagreement_score":0.029420577,"about_ca_system_score_codex":0.000027086831,"about_ca_system_score_gemma":0.000062624385,"threshold_uncertainty_score":0.36073542},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.902231,0.0002775175,0.056567065,0.00036157388,0.006273002,0.0002672331,0.0000011100984,0.0001440572,0.033877447],"genre_scores_gemma":[0.99664146,0.000002789933,0.0031133788,0.0000935193,0.00000764206,0.0000037446382,1.11638904e-7,0.000006963267,0.00013040708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992323,0.000040872706,0.00015577163,0.0002297714,0.00016823181,0.00017303835],"domain_scores_gemma":[0.99933887,0.00008212541,0.000045575936,0.00033821497,0.00008546986,0.00010973325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013990833,0.000100181824,0.00015352333,0.00006436738,0.000060313458,0.000051028066,0.0002627,0.000053707663,0.000025045723],"category_scores_gemma":[0.000018740215,0.00007762634,0.00003407789,0.00017878645,0.0000638611,0.00018485794,0.000062384446,0.00009610606,0.000011169878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032376574,0.00006370936,0.0011551232,0.000007880186,0.000014100004,0.000018639874,0.0004299639,4.3043678e-7,0.000013103445,0.9948867,0.0015971157,0.0017808776],"study_design_scores_gemma":[0.00069982995,0.0015009103,0.0038833155,0.00010025171,0.000008222297,0.00005225024,0.000037407237,0.00085424475,0.0005350193,0.9916361,0.00052349194,0.00016896786],"about_ca_topic_score_codex":0.00017291747,"about_ca_topic_score_gemma":0.000018684563,"teacher_disagreement_score":0.09441045,"about_ca_system_score_codex":0.000010340532,"about_ca_system_score_gemma":0.000034824017,"threshold_uncertainty_score":0.31655103},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9828058,0.00013675811,0.00022564178,0.0000017221365,0.0022806083,0.00012882442,0.000022331333,0.00022341525,0.014174932],"genre_scores_gemma":[0.9998044,0.000011907508,0.00009768362,0.0000045092625,0.0000028770698,0.000014554719,0.000008370166,0.000022715745,0.00003299762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993771,0.000033248558,0.00023097417,0.00009663491,0.00009601473,0.00016608083],"domain_scores_gemma":[0.9995537,0.000032432254,0.000038821472,0.00026290887,0.00004750948,0.00006464343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008752718,0.00011246569,0.0001718387,0.00008807163,0.00004430179,0.0000061971764,0.0001638039,0.000058254172,0.0000959676],"category_scores_gemma":[0.000011661377,0.000115390576,0.000072813345,0.00026181777,0.00004997293,0.00009958919,0.000016340608,0.00008028172,0.000050441013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046444447,0.000050265793,0.01565155,0.00004865066,0.00006161388,0.000001864982,0.0013464264,0.000073947784,0.008031206,0.9742943,0.00034700485,0.000088521956],"study_design_scores_gemma":[0.0012049909,0.00012779977,0.053976774,0.00008700584,0.000054305903,0.0000058710134,0.00031685716,0.0025285506,0.046016425,0.89076704,0.0043944106,0.00051995186],"about_ca_topic_score_codex":0.000026238404,"about_ca_topic_score_gemma":0.0000038124824,"teacher_disagreement_score":0.083527245,"about_ca_system_score_codex":0.000009421224,"about_ca_system_score_gemma":0.0000044853587,"threshold_uncertainty_score":0.4705491},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94510466,0.00012694774,0.033173237,0.00012419593,0.0027543944,0.000078550554,3.6028322e-7,0.000060277303,0.018577384],"genre_scores_gemma":[0.9919375,0.00000279768,0.007804232,0.00004867429,0.0000046796877,0.0000031523136,3.6008453e-7,0.0000024160815,0.00019614151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999481,0.00003446657,0.00013425296,0.00010506889,0.0001445645,0.00010062843],"domain_scores_gemma":[0.9994712,0.00008937831,0.00006656021,0.0002403687,0.0001049825,0.00002755021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023669747,0.00004620121,0.000051936633,0.000017417253,0.00024912867,0.00008300296,0.00037173514,0.000020125515,0.000011238934],"category_scores_gemma":[0.00003512552,0.000034709585,0.00003125968,0.00026300474,0.00005793209,0.00019312867,0.000093479146,0.000043625103,0.000036926132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022844185,0.000027788117,0.0014696491,0.0000014488093,0.0000054005695,8.253213e-7,0.00048411443,0.0000060761076,0.00011677349,0.9873558,0.00037392182,0.010155918],"study_design_scores_gemma":[0.00019114405,0.000025459009,0.015157624,0.000004837306,0.0000020935443,0.000008086643,0.000012317918,0.0033310961,0.0098593915,0.9675315,0.0038111678,0.000065251515],"about_ca_topic_score_codex":0.000014181911,"about_ca_topic_score_gemma":0.0000010787329,"teacher_disagreement_score":0.046832893,"about_ca_system_score_codex":0.000009134843,"about_ca_system_score_gemma":0.000058245438,"threshold_uncertainty_score":0.19161215},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9800752,0.0007785935,0.002439544,0.001325036,0.0038543385,0.00091427047,0.0000068521304,0.00030977934,0.01029641],"genre_scores_gemma":[0.99768597,0.00002904396,0.0020701773,0.00007329616,0.000004947135,0.00002040637,8.547779e-7,0.000014093886,0.000101239806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983007,0.00019943094,0.0002538132,0.00038798992,0.00043689008,0.00042120065],"domain_scores_gemma":[0.99791914,0.0003583086,0.00014312241,0.0012503918,0.00024055035,0.000088508044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073326274,0.00015469348,0.00018504592,0.00012710778,0.0003024628,0.000052746782,0.0016198636,0.000047829115,0.0000066352313],"category_scores_gemma":[0.00023852564,0.00010829663,0.00007171663,0.0009420657,0.00029776795,0.00023697241,0.00029304656,0.0002917931,0.00004597519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035648678,0.00007103927,0.00063493353,0.000010328221,0.000023089546,0.0000075851867,0.0005722489,0.0000068753548,0.0014027823,0.99487275,0.00030873076,0.002054007],"study_design_scores_gemma":[0.0003802547,0.00031047463,0.002398088,0.00002292181,0.0000031027907,0.0000050052736,0.000024062792,0.0002984603,0.03376825,0.960691,0.001967447,0.00013092947],"about_ca_topic_score_codex":0.000010982308,"about_ca_topic_score_gemma":0.0000024914154,"teacher_disagreement_score":0.03418173,"about_ca_system_score_codex":0.000019800344,"about_ca_system_score_gemma":0.000057032248,"threshold_uncertainty_score":0.44162083},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9958656,0.00017581538,0.0011031118,0.00021774234,0.0016740544,0.00012211096,0.0000014522514,0.000086591725,0.0007535605],"genre_scores_gemma":[0.99559766,0.0000028151803,0.0043104133,0.000021295367,0.0000026859807,0.0000050079725,0.0000021654012,0.000007596383,0.000050366267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985465,0.00013029597,0.00036845249,0.00036679328,0.00035482255,0.0002331424],"domain_scores_gemma":[0.99853206,0.00010195617,0.00018973547,0.00083225674,0.00024339967,0.0001005915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060364057,0.00013410435,0.00029831682,0.00009816623,0.000054877048,0.000021688018,0.0005396441,0.00004921589,0.0000041284693],"category_scores_gemma":[0.00014950203,0.0001191728,0.0000907914,0.0004966977,0.00010549509,0.00015192608,0.0002508887,0.0001378372,0.000009021298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037931068,0.00031281367,0.0020822058,0.000029271123,0.000013534275,0.0000013980879,0.00019671192,0.000023850242,0.0041952264,0.9882326,0.0004989569,0.0044096173],"study_design_scores_gemma":[0.0009358578,0.0002368224,0.0032103274,0.000020444913,0.000011327455,0.0000084764415,0.0000046969913,0.0071343384,0.034807216,0.9533818,0.00009749991,0.00015122838],"about_ca_topic_score_codex":0.00015071174,"about_ca_topic_score_gemma":0.0000018819911,"teacher_disagreement_score":0.03485086,"about_ca_system_score_codex":0.0000131844645,"about_ca_system_score_gemma":0.00007038628,"threshold_uncertainty_score":0.48597258},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99722564,0.00008447321,0.0000022001375,0.00007617626,0.000086871005,0.00025610288,0.0000028889717,0.000024709887,0.0022409423],"genre_scores_gemma":[0.999258,0.000016911556,0.0006100954,0.000021258253,0.0000011811369,0.000024647445,0.0000019289962,0.000008964123,0.00005701506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942297,0.000043017993,0.00020225832,0.00012306623,0.00008755677,0.00012111224],"domain_scores_gemma":[0.99934375,0.00026281987,0.00009962591,0.00020877205,0.000040986728,0.000044053613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018849687,0.00008057158,0.00015446554,0.000091221016,0.000041291794,0.000013762086,0.00012834699,0.00004362853,0.000083437364],"category_scores_gemma":[0.000055653592,0.00007411073,0.00002729528,0.00022956678,0.00010257998,0.000111958245,0.000042369167,0.00009396346,0.000019388266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021450214,0.000121876714,0.025341736,0.000026029698,0.000009891952,3.7251266e-7,0.0004856616,8.414264e-8,0.0013641329,0.97184116,0.00028772722,0.00051918963],"study_design_scores_gemma":[0.00062519166,0.00002839659,0.026799425,0.000026367217,0.000009489988,0.0000015753812,0.00022519522,0.000019848678,0.0016777435,0.9704687,0.000042064305,0.00007597653],"about_ca_topic_score_codex":0.000080367055,"about_ca_topic_score_gemma":0.000015872529,"teacher_disagreement_score":0.0021839275,"about_ca_system_score_codex":0.000005824428,"about_ca_system_score_gemma":0.000009079622,"threshold_uncertainty_score":0.30221477},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9853799,0.0004419637,0.0000041383414,0.0000036715921,0.0015122199,0.00020736459,0.000011444758,0.00014052168,0.012298781],"genre_scores_gemma":[0.9998425,0.000017389048,0.00006244466,0.0000026883808,0.0000035505304,0.000017007906,0.0000017824462,0.00001921906,0.000033394437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99928606,0.00006855977,0.0002630235,0.00010945059,0.00012741721,0.0001454676],"domain_scores_gemma":[0.9993321,0.00005060711,0.00007377962,0.00042960103,0.00007882299,0.000035145695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013876506,0.0001081435,0.00019713595,0.00014616086,0.000050175302,0.0000037768941,0.0002566776,0.00004507902,0.00001730761],"category_scores_gemma":[0.000029986819,0.00008374386,0.00011730458,0.0009756597,0.00007537221,0.00006182293,0.000021013646,0.0000923683,0.000005570443],"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.000025239302,0.00039452675,0.04053145,0.0002747301,0.00026611285,0.0000020694206,0.0024438254,0.00015079822,0.04551128,0.9091593,0.0006994409,0.00054122874],"study_design_scores_gemma":[0.0007082131,0.00010488787,0.3244622,0.00016834306,0.000103378625,0.000010587308,0.000129915,0.0005723083,0.41848052,0.25467333,0.00029811577,0.00028819623],"about_ca_topic_score_codex":0.000051400435,"about_ca_topic_score_gemma":0.0000036852869,"teacher_disagreement_score":0.65448594,"about_ca_system_score_codex":0.000011935152,"about_ca_system_score_gemma":0.000006998915,"threshold_uncertainty_score":0.34149754},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9736459,0.00006235465,0.020591715,0.0005085567,0.001993086,0.0002465779,0.000008819491,0.00013075622,0.0028122058],"genre_scores_gemma":[0.99525994,0.000008161417,0.0045691645,0.000029218383,0.000002155891,0.000010769254,0.0000070616575,0.000009286421,0.0001042208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879557,0.00012739874,0.00019729503,0.00026824654,0.0003707884,0.00024070509],"domain_scores_gemma":[0.99871796,0.0002048676,0.00010776899,0.00067604304,0.00020143768,0.00009191677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006725549,0.000103454404,0.00014874873,0.00016444606,0.00009780639,0.00003782167,0.0010159527,0.00006773181,0.000017630031],"category_scores_gemma":[0.00010362868,0.00010297269,0.000055995642,0.0006876915,0.00016662366,0.00043520654,0.00021733587,0.0002763979,0.000024414885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041961216,0.00006692096,0.00065220264,0.0000058667906,0.000005661569,0.0000012081707,0.000075693744,9.2485044e-7,0.120790035,0.8720557,0.0007830975,0.0055584866],"study_design_scores_gemma":[0.00056740403,0.00009372494,0.0018277139,0.0000056215426,0.0000016758883,0.0000034762745,0.0000071218933,0.0012199427,0.042591836,0.9507962,0.0027730484,0.00011224277],"about_ca_topic_score_codex":0.000016183945,"about_ca_topic_score_gemma":0.000004007877,"teacher_disagreement_score":0.078740485,"about_ca_system_score_codex":0.000013681257,"about_ca_system_score_gemma":0.000028660697,"threshold_uncertainty_score":0.41991046},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.996498,0.000088891466,0.00006693006,0.0003088807,0.00008831488,0.00034542868,0.00000908594,0.0000080666605,0.00258643],"genre_scores_gemma":[0.9993191,0.000009244795,0.0003184262,0.000010543449,0.000010858245,0.000054813543,0.0000023266703,0.000009548876,0.00026517315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994834,0.000021235217,0.00014296436,0.00017961294,0.000055910077,0.000116898955],"domain_scores_gemma":[0.9994552,0.00013573297,0.00008485405,0.00022211293,0.000050218114,0.00005185786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048273534,0.00010094152,0.0001421366,0.000009437683,0.00013190512,0.000033122044,0.000074070886,0.000020009948,0.000025684038],"category_scores_gemma":[0.000018828203,0.00006574518,0.000022319018,0.00009153584,0.00023577739,0.00012836445,0.00011962495,0.00007108162,0.0000025202585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002322126,0.000055461023,0.028513793,0.000023047754,0.00001899697,7.830882e-8,0.0006160736,3.9852458e-7,0.002360742,0.9624811,0.00012920302,0.0057987846],"study_design_scores_gemma":[0.0003060698,0.000017933391,0.019546924,0.000018126588,0.000012233512,0.0000038937624,0.0012553796,0.00008223143,0.013308469,0.9650951,0.0002629665,0.00009066991],"about_ca_topic_score_codex":0.000088469744,"about_ca_topic_score_gemma":6.6740984e-7,"teacher_disagreement_score":0.010947728,"about_ca_system_score_codex":0.0000035037854,"about_ca_system_score_gemma":0.000009064041,"threshold_uncertainty_score":0.2681011},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942654,0.0000269708,0.00020214605,0.000081336344,0.00013819248,0.00044047248,0.000003937481,0.000085091975,0.004756491],"genre_scores_gemma":[0.9977625,0.0000060898096,0.0017776474,0.00003314406,0.0000039350434,0.00019021679,0.0000041245034,0.000031656284,0.00019068859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989616,0.000056742847,0.00028981798,0.0002307107,0.00022286222,0.00023822211],"domain_scores_gemma":[0.99876297,0.00028146905,0.00011361043,0.0006242904,0.0001191834,0.00009848677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017286287,0.00017016438,0.00027017857,0.00010091556,0.00008797306,0.000024199177,0.000302342,0.00008447278,0.00013866795],"category_scores_gemma":[0.000051974617,0.00013708317,0.00008942629,0.0004045286,0.00017645769,0.00017284162,0.00005653631,0.0001459359,0.00003134115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001044881,0.0003005919,0.022273868,0.000030579275,0.00005419893,0.0000010791789,0.00018443205,7.810359e-7,0.002773385,0.9727929,0.0009249027,0.0006528094],"study_design_scores_gemma":[0.00038897523,0.00010487651,0.011713173,0.000036534533,0.000039583865,0.000004457693,0.00011632502,0.00003307596,0.007114163,0.98013467,0.00014353973,0.00017060505],"about_ca_topic_score_codex":0.00003526128,"about_ca_topic_score_gemma":0.0000075671205,"teacher_disagreement_score":0.010560694,"about_ca_system_score_codex":0.000011770819,"about_ca_system_score_gemma":0.00002012398,"threshold_uncertainty_score":0.55900896},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937141,0.0019139155,0.0005400098,0.00037891796,0.002253344,0.00019528985,0.0000054630054,0.00011136277,0.00088758307],"genre_scores_gemma":[0.99093443,0.000013985853,0.008929902,0.00006254027,0.0000016800655,0.000006288464,0.0000029740413,0.000011136841,0.00003703938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850035,0.000076734614,0.00041171414,0.00027674864,0.0003675825,0.00036684418],"domain_scores_gemma":[0.99837786,0.00007881246,0.00027343386,0.0008062532,0.00033855613,0.0001250983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057825877,0.00015021251,0.00030420453,0.00012608069,0.00007296667,0.000017373633,0.0006239459,0.00004245331,0.0000032647852],"category_scores_gemma":[0.00008002154,0.00013981157,0.00007337078,0.00089290197,0.00014445641,0.00034204437,0.00016198275,0.00011266855,0.0000121308085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039871825,0.00019443528,0.012612111,0.000054244938,0.000018700912,7.089419e-7,0.0006393494,0.000006776216,0.017518906,0.9679452,0.000580244,0.00042532815],"study_design_scores_gemma":[0.0010607328,0.00014114016,0.004690214,0.00009561626,0.000020541322,0.000006540781,0.000023580864,0.0006325081,0.055021126,0.93704164,0.0010090698,0.0002573116],"about_ca_topic_score_codex":0.00010639153,"about_ca_topic_score_gemma":0.0000019036416,"teacher_disagreement_score":0.03750222,"about_ca_system_score_codex":0.000011874215,"about_ca_system_score_gemma":0.000043559576,"threshold_uncertainty_score":0.57013506},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9743498,0.00007050728,0.0000034835534,0.0006853624,0.00049428974,0.00019123712,0.0000013121764,0.00006494397,0.02413905],"genre_scores_gemma":[0.999124,0.0000099693625,0.00022002024,0.000052712356,0.0000026996372,0.000064221735,0.0000012200328,0.0000131642055,0.00051202346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928814,0.00008439137,0.00017488727,0.00012087324,0.00013985841,0.00019182634],"domain_scores_gemma":[0.99907565,0.00034073825,0.000053808413,0.00040038093,0.000046880286,0.000082523846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068888214,0.00008377693,0.00009886009,0.000037270594,0.00013196171,0.000032337106,0.0002720816,0.000047579742,0.0000058731725],"category_scores_gemma":[0.0002188864,0.00006251062,0.000044290704,0.00034216142,0.00009511435,0.000055263346,0.0000408778,0.00013983244,0.00007023309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006763862,0.00007202919,0.0023616469,0.0000024809003,0.0000073119404,0.0000017254299,0.00055513467,3.9085938e-7,0.000015528278,0.98806053,0.008676021,0.00024046144],"study_design_scores_gemma":[0.0004577362,0.000016216354,0.00090487016,0.0000075608714,0.0000059278627,0.0000024020455,0.0004516411,0.000012674043,0.00013475928,0.9850169,0.012909757,0.00007955557],"about_ca_topic_score_codex":0.00003073422,"about_ca_topic_score_gemma":0.00009884856,"teacher_disagreement_score":0.024774155,"about_ca_system_score_codex":0.000029971445,"about_ca_system_score_gemma":0.000032070584,"threshold_uncertainty_score":0.2549109},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93270427,0.000022353384,0.062484924,0.000111918635,0.0028371403,0.00024474348,0.0000018447325,0.00017165422,0.0014211626],"genre_scores_gemma":[0.9916001,0.0000011006617,0.008121228,0.00009263055,0.000021892633,0.000025594096,0.00001051591,0.000010090368,0.00011683109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990345,0.000044584755,0.00018453722,0.00033079876,0.00017115871,0.00023437075],"domain_scores_gemma":[0.9993012,0.00006722422,0.0000824287,0.00033926422,0.00010450511,0.00010535596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002604223,0.000118829936,0.000120469886,0.00007618798,0.0001759028,0.0001282576,0.00045698232,0.00006306327,0.000017676544],"category_scores_gemma":[0.000028722485,0.00011670167,0.000066833,0.00018490026,0.000028202654,0.00096319086,0.000087488275,0.00006294163,0.000047315123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017257964,0.00016343448,0.0004958086,0.000005412815,0.0000071987074,0.0000018981398,0.0013455686,0.0000021583667,0.0005664407,0.9667932,0.00063064374,0.029971024],"study_design_scores_gemma":[0.0010598039,0.00038990017,0.029079163,0.000010070545,0.0000072596404,0.000008802618,0.00002801477,0.04193891,0.007481914,0.9193513,0.00040914078,0.00023572317],"about_ca_topic_score_codex":0.00006730513,"about_ca_topic_score_gemma":0.0000035899602,"teacher_disagreement_score":0.05889586,"about_ca_system_score_codex":0.000046447254,"about_ca_system_score_gemma":0.000048531314,"threshold_uncertainty_score":0.47589558},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98005533,0.00031765935,0.010277069,0.00051115284,0.0007678295,0.00019433037,0.0000052849673,0.00018376742,0.0076875566],"genre_scores_gemma":[0.9945254,0.000009301187,0.0051482646,0.00017166662,0.000013618813,0.000018959448,0.0000054321363,0.000010363098,0.000097007025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998993,0.000040248084,0.00023403575,0.00020208556,0.00022500294,0.00030565303],"domain_scores_gemma":[0.9990367,0.00007717668,0.0001051246,0.0006326458,0.00004212407,0.0001062285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019912802,0.00011596454,0.0001569602,0.00006161755,0.000054028445,0.00003889742,0.0007715283,0.00005471364,0.000028850412],"category_scores_gemma":[0.0000107498645,0.000115955176,0.00008071995,0.00027369717,0.000033330838,0.0004036598,0.00017129869,0.00010734179,0.00010325542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016000846,0.00026885886,0.010202542,0.00001555694,0.000014989748,0.0000029063212,0.0003505038,4.374741e-7,0.0073422045,0.9787932,0.0013850675,0.0016221396],"study_design_scores_gemma":[0.0016922094,0.00033119367,0.35940334,0.000074001204,0.000048286132,0.00006057141,0.00008528093,0.0047508855,0.16918191,0.44662887,0.016824542,0.0009189223],"about_ca_topic_score_codex":0.000017219974,"about_ca_topic_score_gemma":0.0000010466009,"teacher_disagreement_score":0.53216434,"about_ca_system_score_codex":0.000023545914,"about_ca_system_score_gemma":0.000052207826,"threshold_uncertainty_score":0.47285149},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9601223,0.00053118827,0.028944155,0.0012821906,0.0019488654,0.0005969498,0.000001298745,0.0006716173,0.0059014265],"genre_scores_gemma":[0.9864785,0.00002160606,0.012194767,0.00020484893,0.000005612218,0.00009823369,0.0000016219374,0.00002436696,0.0009704114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796027,0.00014737718,0.00024241432,0.00050107535,0.0004824545,0.0006663875],"domain_scores_gemma":[0.99821657,0.00015678442,0.00007574696,0.0011320772,0.00017701359,0.00024182929],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045769065,0.00019033646,0.00020542477,0.00022377937,0.00027548708,0.00032721323,0.0015176531,0.00006927996,0.00012647126],"category_scores_gemma":[0.000054700206,0.0001783356,0.00009906106,0.0009614473,0.00011584331,0.0016182032,0.00053769746,0.00027320939,0.0011871167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019447132,0.000058958358,0.00065243844,0.000008503161,0.000014879894,0.000012185466,0.00017598926,0.00002978883,0.0042233565,0.987533,0.001632562,0.005656443],"study_design_scores_gemma":[0.0003575792,0.00006263942,0.0022015797,0.000017166358,0.0000020190994,0.000010651755,0.000028426579,0.0019244808,0.0047859247,0.98863554,0.0017546617,0.00021932968],"about_ca_topic_score_codex":0.00007964357,"about_ca_topic_score_gemma":0.0000016111711,"teacher_disagreement_score":0.026356224,"about_ca_system_score_codex":0.000043382006,"about_ca_system_score_gemma":0.000043196585,"threshold_uncertainty_score":0.9995906},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99766046,0.00012097638,1.1465495e-7,0.00037147742,0.00015113487,0.00008243991,0.000008696573,0.000021350428,0.0015833778],"genre_scores_gemma":[0.99960303,0.00009618565,0.000020581674,0.000024697585,0.000002998578,0.0000031667266,0.000009865529,6.0570653e-7,0.0002388667],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99935937,0.00007611551,0.00012601967,0.00014312184,0.0001461523,0.00014920926],"domain_scores_gemma":[0.99966925,0.000059469527,0.00006274675,0.000043318585,0.00008846442,0.00007676251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018394734,0.00007442656,0.00012086608,0.000018982111,0.00008347017,0.0000119640545,0.00014508676,0.00006368878,0.00021150763],"category_scores_gemma":[0.000042808777,0.000026804604,0.000042713124,0.00029443318,0.000120300814,0.00007774135,0.000051297695,0.00008797179,0.00000470502],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061771185,0.00036965622,0.5143046,0.000018326124,0.00004115869,0.000007278225,0.00055555266,7.0971865e-8,0.053099345,0.3386079,0.0033905772,0.089543805],"study_design_scores_gemma":[0.00017470564,0.0001926658,0.95592487,0.000020093385,0.0000038866838,6.8236443e-7,0.0006944296,0.0000061761875,0.00533488,0.03624822,0.0013186741,0.000080689024],"about_ca_topic_score_codex":0.0013434372,"about_ca_topic_score_gemma":0.0009929289,"teacher_disagreement_score":0.44162035,"about_ca_system_score_codex":0.000007001791,"about_ca_system_score_gemma":0.000004212375,"threshold_uncertainty_score":0.23158602},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98392093,0.0007847762,0.00013785771,0.0015118284,0.00878228,0.00020161651,0.000001605495,0.0007684673,0.0038906266],"genre_scores_gemma":[0.9978392,0.000012957409,0.001302418,0.0005219347,0.0000015785442,0.000013203237,0.0000043198474,0.000013623041,0.0002907783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981649,0.0001514917,0.00034622327,0.0004756198,0.00046452708,0.00039726653],"domain_scores_gemma":[0.99833137,0.00006387927,0.00012050114,0.0008957771,0.0002262143,0.00036225325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086894573,0.00018767903,0.00023792779,0.00015263172,0.00013870593,0.00013984666,0.0008303694,0.00012724611,0.000008206617],"category_scores_gemma":[0.000118874166,0.00017492876,0.00010646366,0.0007942217,0.00008850684,0.0005814027,0.00030611546,0.00022319541,0.00039797218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038382127,0.000114148235,0.0014870466,0.0000038909143,0.000020363526,0.000015094654,0.0002900266,0.000020081237,0.00017424749,0.98749346,0.009506106,0.00087171054],"study_design_scores_gemma":[0.0012675783,0.00012912153,0.00069050834,0.000014368146,0.000007945557,0.000010537396,0.000013287667,0.0017079295,0.0009789647,0.9937596,0.0011851871,0.00023497474],"about_ca_topic_score_codex":0.00013925265,"about_ca_topic_score_gemma":0.0000012346678,"teacher_disagreement_score":0.013918244,"about_ca_system_score_codex":0.000040421382,"about_ca_system_score_gemma":0.00012947568,"threshold_uncertainty_score":0.7133388},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99382746,0.0012572223,0.00020963285,0.0013044738,0.0010366411,0.00012713837,0.0000012222271,0.00015839658,0.0020777895],"genre_scores_gemma":[0.9968024,0.00004127827,0.0025346521,0.00039321533,0.0000011642254,0.0000013702976,0.000001719789,0.0000080993905,0.0002161274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862456,0.000055272638,0.00031650765,0.00040313968,0.0002884538,0.00031207653],"domain_scores_gemma":[0.9989573,0.00009145411,0.00011940537,0.000520605,0.00015941447,0.00015181836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003287815,0.0001755916,0.0002629017,0.00013988977,0.00009004208,0.00008625268,0.00042975796,0.000086210224,0.0000075215416],"category_scores_gemma":[0.00007568031,0.00016488729,0.000064615495,0.00047207726,0.00009422341,0.0003099844,0.0001447168,0.00016042728,0.000036165908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005729399,0.00014153612,0.00059812225,0.000012094488,0.0000111636555,0.000010507939,0.00031842318,0.000025071617,0.004892996,0.9823195,0.0012059093,0.010458976],"study_design_scores_gemma":[0.0010029125,0.00028813767,0.0044119437,0.000050690804,0.0000111904865,0.000023832281,0.000014583605,0.0063313264,0.0034111615,0.98406535,0.00017411583,0.0002147758],"about_ca_topic_score_codex":0.000050507624,"about_ca_topic_score_gemma":7.773548e-7,"teacher_disagreement_score":0.0102442,"about_ca_system_score_codex":0.000016559356,"about_ca_system_score_gemma":0.00004850243,"threshold_uncertainty_score":0.6723909},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9756787,0.000015726406,0.000005486202,0.00005831566,0.0020580832,0.000119744625,0.0000016743228,0.00014625657,0.021916043],"genre_scores_gemma":[0.99978745,0.0000016495617,0.000005637692,0.00005486162,0.000008702372,0.00002935211,0.0000012259923,0.00002134308,0.00008978138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995661,0.000019046664,0.00007079204,0.00008226441,0.00011917131,0.00014262124],"domain_scores_gemma":[0.9995576,0.000071393566,0.000015234061,0.000306128,0.000011444358,0.000038167225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013698173,0.0000957547,0.000078634264,0.00002254103,0.000076120436,0.000028051905,0.00017614778,0.000032805583,0.000090542926],"category_scores_gemma":[0.000009555496,0.000058005055,0.000025756613,0.00010728481,0.000039242303,0.000041743402,0.000009384933,0.00020842078,0.00015681397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009791096,0.000021297938,0.0015590683,0.000008021014,0.00003288504,0.000003599873,0.0001169433,0.00004419973,0.0030449529,0.99140245,0.003579279,0.0001775385],"study_design_scores_gemma":[0.000930891,0.00012381589,0.017304694,0.000051717998,0.000021127382,0.000009766309,0.000137979,0.0005933188,0.009866719,0.96129197,0.009320052,0.00034796272],"about_ca_topic_score_codex":0.0000029147236,"about_ca_topic_score_gemma":0.0000063439047,"teacher_disagreement_score":0.03011047,"about_ca_system_score_codex":0.0000067054507,"about_ca_system_score_gemma":0.000002628238,"threshold_uncertainty_score":0.23653774},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9822851,0.00010779517,0.013896912,0.0003338675,0.0009786467,0.00033674418,7.278268e-7,0.00010948491,0.0019507098],"genre_scores_gemma":[0.99565876,0.000012230482,0.004073315,0.000032526434,0.0000028924924,0.000033725548,0.0000018475873,0.000007819249,0.00017685979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988864,0.000112141955,0.00020180513,0.00023764126,0.0003259666,0.00023601249],"domain_scores_gemma":[0.99893326,0.00011616599,0.00008239624,0.0005472856,0.00024152688,0.00007937798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022704354,0.0000928411,0.00014149612,0.00014167301,0.000088712484,0.0000646015,0.00072096556,0.000047573365,0.00008075757],"category_scores_gemma":[0.000065519234,0.00008905082,0.00005764444,0.0006098852,0.00008664735,0.00067776465,0.00021128864,0.00011760726,0.00014859281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031706834,0.00006958031,0.00072737806,0.000007202585,0.000012193989,0.0000014825821,0.00015129062,0.000007811122,0.01948066,0.976097,0.0005606535,0.0028816022],"study_design_scores_gemma":[0.00047377447,0.000078769175,0.0016877429,0.0000066021207,0.0000018026151,0.0000016804421,0.000010244222,0.0025420168,0.046121564,0.94888645,0.000096918215,0.00009243899],"about_ca_topic_score_codex":0.00003495947,"about_ca_topic_score_gemma":9.924522e-7,"teacher_disagreement_score":0.027210528,"about_ca_system_score_codex":0.000014479038,"about_ca_system_score_gemma":0.000036151974,"threshold_uncertainty_score":0.36313874},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9982894,0.000021427506,0.000021044634,0.00013687857,0.00067633577,0.00034995942,0.0000029796702,0.00002020594,0.0004817848],"genre_scores_gemma":[0.9993559,0.0000037194347,0.0001727167,0.000057718353,0.000026271733,0.00004152167,0.0000011688162,0.000024008716,0.00031696665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988272,0.00020181104,0.00027148315,0.00010781738,0.00029611218,0.00029553863],"domain_scores_gemma":[0.99910986,0.00024803155,0.00009163454,0.00040179133,0.000071506685,0.00007719136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072236836,0.00009987223,0.00018587783,0.00012897076,0.000036251266,0.000013265858,0.00033838252,0.000060668255,0.000053747273],"category_scores_gemma":[0.0006482743,0.00007491972,0.000051471994,0.00057689135,0.000036485944,0.00013144044,0.00017405864,0.00015407326,0.000060352253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004054352,0.00039017995,0.09633246,0.00006259007,0.000008486946,8.332758e-7,0.0025676137,2.5764885e-7,0.1477858,0.7522226,0.000081544116,0.0005071071],"study_design_scores_gemma":[0.0008978373,0.00008784411,0.35967487,0.0001619887,0.000012725087,0.0000072811968,0.000079388374,0.00006298563,0.04856922,0.5899322,0.0003446398,0.00016900573],"about_ca_topic_score_codex":0.00002023609,"about_ca_topic_score_gemma":0.0000062464132,"teacher_disagreement_score":0.2633424,"about_ca_system_score_codex":0.000050536328,"about_ca_system_score_gemma":0.000028078566,"threshold_uncertainty_score":0.30551377},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97601384,0.000028203602,0.000010216811,0.00035255658,0.00025485444,0.0002151203,0.0000058709898,0.00005217944,0.023067186],"genre_scores_gemma":[0.9994179,0.0000036593208,0.00019934963,0.000099733115,0.0000025200907,0.00004118934,0.0000022470692,0.000012579584,0.0002208338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927163,0.00011925128,0.0001855951,0.000102985236,0.00019547812,0.0001250675],"domain_scores_gemma":[0.9987219,0.00055342773,0.00010848153,0.0004631353,0.00009117789,0.00006188032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063943746,0.000091469956,0.00014363087,0.00004451831,0.00008875828,0.000010908537,0.00026987732,0.000045573095,0.000047101483],"category_scores_gemma":[0.00034440673,0.00006178164,0.000076437456,0.00024673436,0.00010306874,0.000037566886,0.000034819946,0.000099528275,0.000055361917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021180465,0.00015383073,0.00024325603,0.0000071261634,0.000023168132,4.5750758e-7,0.0005470868,6.352751e-7,0.00015538678,0.9883187,0.010485976,0.000043243654],"study_design_scores_gemma":[0.000434884,0.00007027324,0.00012289494,0.000014540398,0.000021141503,0.0000010385609,0.00023634435,0.0000119972965,0.0065205866,0.9914181,0.0010769117,0.00007128887],"about_ca_topic_score_codex":0.000007837091,"about_ca_topic_score_gemma":0.000002090166,"teacher_disagreement_score":0.023404075,"about_ca_system_score_codex":0.000010275521,"about_ca_system_score_gemma":0.00002383874,"threshold_uncertainty_score":0.2519382},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959305,0.00025758168,0.0011022993,0.0001147398,0.0014999036,0.00008164326,0.0000013396055,0.00007420367,0.00093777163],"genre_scores_gemma":[0.9938089,0.000010000008,0.006053727,0.000048295915,0.000001251006,0.0000015947091,0.000002010089,0.000009750015,0.00006446514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986053,0.000095800686,0.0003970893,0.0002936095,0.00037697793,0.00023122955],"domain_scores_gemma":[0.9986326,0.00019021844,0.00015725128,0.00065465795,0.00027810672,0.00008713401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006803693,0.00012898928,0.00027564255,0.00013926665,0.00005591839,0.000025829364,0.00051993947,0.00007165854,0.000011383515],"category_scores_gemma":[0.00014957899,0.000116725896,0.000087281805,0.00044194082,0.00007843845,0.00021541411,0.00025287806,0.000115068084,0.000026434573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044816884,0.00013301181,0.0024027727,0.000032725162,0.000011706423,8.531478e-7,0.00031528776,0.000076113065,0.028417265,0.9662234,0.0005017051,0.0018806845],"study_design_scores_gemma":[0.0011971064,0.0004047679,0.0021498753,0.0001127385,0.000013234432,0.0000047096914,0.000022253229,0.019875143,0.06445154,0.9113626,0.00018588864,0.0002201712],"about_ca_topic_score_codex":0.00006580857,"about_ca_topic_score_gemma":8.412246e-7,"teacher_disagreement_score":0.05486082,"about_ca_system_score_codex":0.00001018184,"about_ca_system_score_gemma":0.00004064781,"threshold_uncertainty_score":0.47599438},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96476614,0.0000504164,0.0075472514,0.013687665,0.0019919714,0.00064855925,0.0000016638908,0.00024835797,0.011057949],"genre_scores_gemma":[0.9982691,0.0000025437723,0.0010148596,0.00027758014,0.0000069666225,0.000115911746,0.000001012064,0.000011803609,0.0003002669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983239,0.00026285203,0.00017325908,0.00035027854,0.0004798995,0.00040979026],"domain_scores_gemma":[0.9970583,0.0017408159,0.000035674348,0.0008149034,0.00021780502,0.00013255289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054064026,0.00013818457,0.0001177722,0.00012537275,0.00029109107,0.00023610957,0.0010213299,0.00006359417,0.00011354017],"category_scores_gemma":[0.0010797629,0.00009849278,0.000074829055,0.00061351724,0.00025178245,0.0006026355,0.00023763656,0.0003204658,0.0005388474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056805243,0.000080037236,0.000022223338,0.000003198827,0.0000057958423,0.000006165525,0.00012285859,0.0000042723645,0.0010287727,0.99301064,0.0031696372,0.002540746],"study_design_scores_gemma":[0.00030109793,0.00017285849,0.0039629326,0.00001192588,0.0000014479822,0.0000075282455,0.000027520657,0.003646915,0.0016476811,0.99004006,0.00005688697,0.00012311553],"about_ca_topic_score_codex":0.00000982319,"about_ca_topic_score_gemma":3.1343305e-7,"teacher_disagreement_score":0.033502888,"about_ca_system_score_codex":0.000042157004,"about_ca_system_score_gemma":0.00003818559,"threshold_uncertainty_score":0.6925973},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99492896,0.0003082874,0.000047376558,0.000007258132,0.0006965678,0.000057992867,0.0000019413396,0.000036204463,0.0039153895],"genre_scores_gemma":[0.9998924,0.000027035414,0.000039087332,0.0000017243274,0.00000571938,0.0000046894393,6.8913056e-7,0.000013433904,0.000015223171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950874,0.000043821867,0.00018045127,0.00006504737,0.00008975084,0.00011216673],"domain_scores_gemma":[0.99955416,0.00015459499,0.000041632553,0.00018664778,0.000032743537,0.000030203704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031078848,0.0000737923,0.00013997845,0.000017622013,0.00004741111,0.000010432644,0.00010532367,0.0000451186,0.0000058963287],"category_scores_gemma":[0.000028434757,0.00005777261,0.000039122122,0.00008295737,0.000060644386,0.000041858588,0.00002132458,0.000068828514,0.000004481209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008831215,0.000014780732,0.012900718,0.00013285891,0.00004732145,4.701571e-7,0.00054450973,0.00042539672,0.0016745309,0.98243845,0.00012818519,0.001683973],"study_design_scores_gemma":[0.00283057,0.00023449674,0.031269744,0.00045927142,0.00009507045,0.000035706347,0.00224202,0.032043282,0.04635762,0.8762467,0.007499055,0.00068644714],"about_ca_topic_score_codex":0.0000068391228,"about_ca_topic_score_gemma":9.248096e-7,"teacher_disagreement_score":0.10619171,"about_ca_system_score_codex":0.0000045621437,"about_ca_system_score_gemma":0.0000030120232,"threshold_uncertainty_score":0.23558986},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9684154,0.0001242621,0.0076805945,0.00007849229,0.0027002434,0.00012008334,0.0000015830211,0.0005068374,0.020372497],"genre_scores_gemma":[0.9971422,0.000006714856,0.0024932441,0.00021579723,0.0000057736506,0.000010427732,9.872261e-7,0.0000096742315,0.00011518279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895453,0.000103716935,0.00016670533,0.00031384017,0.00018897551,0.00027223662],"domain_scores_gemma":[0.998985,0.00008247258,0.00006809327,0.0007054015,0.000052975563,0.000106043975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031909667,0.00013981703,0.00015107452,0.000104821855,0.00013395972,0.000072956296,0.0009609172,0.000065137545,0.00008829145],"category_scores_gemma":[0.000027570468,0.0001348334,0.00010206654,0.0005011435,0.00007543323,0.000360779,0.00022313504,0.000111281035,0.00010944812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008420669,0.00025353918,0.006755178,0.000003816431,0.00001533455,0.000014771209,0.00089339213,5.9401373e-8,0.00016991352,0.9889833,0.00095646014,0.0019458432],"study_design_scores_gemma":[0.0004590787,0.00022000761,0.017202849,0.000013873974,0.000007713431,0.000006456999,0.000021651656,0.0003224211,0.0020396241,0.9753253,0.004166361,0.00021468909],"about_ca_topic_score_codex":0.000059385366,"about_ca_topic_score_gemma":0.0000087256,"teacher_disagreement_score":0.02872679,"about_ca_system_score_codex":0.000015801686,"about_ca_system_score_gemma":0.00002588197,"threshold_uncertainty_score":0.54983467},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99655247,0.00069930975,0.000036540045,0.00015130265,0.0017685827,0.000066992245,2.6135555e-7,0.00009457372,0.00062996807],"genre_scores_gemma":[0.99903446,0.000020267116,0.0007942142,0.00010492955,5.6681944e-7,0.0000054545626,7.653175e-7,0.0000061451774,0.000033172157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991254,0.00005017709,0.00015231696,0.00019969181,0.00014981418,0.00032259114],"domain_scores_gemma":[0.9994102,0.00007681487,0.000039218816,0.0003054165,0.000026933436,0.00014141135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033194252,0.000107843036,0.0001297117,0.00014250923,0.00006845501,0.00005339801,0.00025701342,0.000058191978,0.000003514773],"category_scores_gemma":[0.000030443023,0.00009459462,0.00002616907,0.00046821704,0.000040856274,0.00049226603,0.00015410368,0.000111483,0.000013766234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.601784e-7,0.000061812665,0.2049508,0.000003802313,0.0000026299226,0.0000012886985,0.00056169997,0.0000010537577,0.00017489762,0.7936126,0.00020474705,0.00042404488],"study_design_scores_gemma":[0.00043669154,0.000029281004,0.11768705,0.000014850597,0.000002291833,0.0000042029033,0.00003240044,0.00031136564,0.0014879282,0.87951237,0.0003266184,0.00015496275],"about_ca_topic_score_codex":0.00007407735,"about_ca_topic_score_gemma":0.000002897966,"teacher_disagreement_score":0.08726374,"about_ca_system_score_codex":0.000012018976,"about_ca_system_score_gemma":0.000012628821,"threshold_uncertainty_score":0.38574567},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99359286,0.00006623825,0.0000011805689,0.0027771157,0.00011680288,0.00016237875,0.000006717918,0.0000142013105,0.003262523],"genre_scores_gemma":[0.999402,0.000017591101,0.0000054860398,0.00023811127,0.00002762601,0.000032858607,0.000004575025,5.7771973e-7,0.00027116534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99929947,0.00006531357,0.00010072517,0.000087756925,0.00021061332,0.00023612821],"domain_scores_gemma":[0.9992429,0.00048975286,0.000039471677,0.00007285219,0.00004761111,0.00010740156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025558492,0.000060377828,0.000080083846,0.0000032584253,0.00013671238,0.000014870233,0.0002220535,0.00004668935,0.0006343675],"category_scores_gemma":[0.00015918924,0.000017323091,0.000046994013,0.00027410372,0.00006692442,0.000049213682,0.000046332058,0.00012747908,0.00008830682],"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.000028443308,0.00025788875,0.011273947,0.0000013109964,0.000011830056,1.5155072e-7,0.000022332579,5.523757e-7,0.040766902,0.9331638,0.0058699683,0.0086028455],"study_design_scores_gemma":[0.0004258478,0.0002942955,0.56163996,0.000011730602,0.000008134798,0.0000013743855,0.00007805214,0.00006348338,0.012662078,0.39567405,0.028966377,0.00017461619],"about_ca_topic_score_codex":0.00014847777,"about_ca_topic_score_gemma":0.000018912764,"teacher_disagreement_score":0.550366,"about_ca_system_score_codex":0.000011280277,"about_ca_system_score_gemma":0.000005528412,"threshold_uncertainty_score":0.69458795},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9815623,0.00014812459,0.00007253711,0.001480207,0.0031012546,0.00050443213,0.000015284963,0.00026096727,0.012854866],"genre_scores_gemma":[0.9907876,0.00004745586,0.001874046,0.00045579276,0.00012552059,0.00015939088,0.00000595023,0.00010863592,0.0064355764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978539,0.00015309388,0.0005493261,0.00036236318,0.000592569,0.0004887573],"domain_scores_gemma":[0.99407023,0.004530416,0.00025038904,0.0008951868,0.00012759965,0.00012620391],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000318653,0.00034071493,0.00046423925,0.00009002905,0.0003129928,0.00037925277,0.00057472475,0.00014484563,0.002270778],"category_scores_gemma":[0.0019413065,0.00025243955,0.00018987342,0.00016481675,0.00023920357,0.0008168759,0.00022985868,0.00037009575,0.0024753804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004840671,0.00013237662,0.00015369033,0.00003387079,0.000096886055,0.0000048389643,0.00082778244,0.0000012640329,0.00039319176,0.9176134,0.08066225,0.0000756299],"study_design_scores_gemma":[0.0004183832,0.000029601097,0.00041449643,0.0001354736,0.00006259844,0.000002122669,0.0010500195,0.00006434524,0.005401469,0.9917829,0.0003318028,0.00030678592],"about_ca_topic_score_codex":0.0002885547,"about_ca_topic_score_gemma":0.000011175353,"teacher_disagreement_score":0.08033045,"about_ca_system_score_codex":0.00014677986,"about_ca_system_score_gemma":0.00003121735,"threshold_uncertainty_score":0.9999928},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97953075,0.00028370452,0.011898822,0.00018246374,0.004831698,0.00023198834,0.0000026588177,0.00009290458,0.0029450145],"genre_scores_gemma":[0.99967563,0.000018757233,0.00014984148,0.00006326024,0.000021580252,0.000019969271,0.000001750994,0.000009680605,0.00003951063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986773,0.00021512443,0.00030840977,0.00023479549,0.00022478198,0.00033954604],"domain_scores_gemma":[0.99898386,0.00028500307,0.00008926192,0.00037084866,0.00013811157,0.00013292042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000957538,0.00016300187,0.0002900722,0.00012099789,0.000148848,0.000064838416,0.0002536923,0.00011918452,0.000017141618],"category_scores_gemma":[0.00005837593,0.00014958276,0.00009675212,0.00033375045,0.00006543162,0.0016645917,0.00007505908,0.00015729721,0.000013077083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008890998,0.00014103459,0.026886102,0.000034047564,0.000028044127,4.3027475e-7,0.0036093832,0.0000044817684,0.0011039266,0.96559346,0.00045270124,0.0021374798],"study_design_scores_gemma":[0.005187894,0.0009473013,0.29713193,0.00020892965,0.00007762555,0.0002535984,0.0014139062,0.029895835,0.043762736,0.6107757,0.008779041,0.0015654629],"about_ca_topic_score_codex":0.00012516131,"about_ca_topic_score_gemma":0.000016995462,"teacher_disagreement_score":0.35481775,"about_ca_system_score_codex":0.000038026945,"about_ca_system_score_gemma":0.000023261611,"threshold_uncertainty_score":0.60998076},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9951777,0.000083116596,0.000021313235,0.00018239228,0.000053930715,0.0003449784,0.0000017826968,0.000038957747,0.0040958277],"genre_scores_gemma":[0.99909365,0.000023922728,0.00068420393,0.000023219698,0.0000024861085,0.00009853739,9.145235e-7,0.000013317217,0.000059739425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993782,0.000050934166,0.00016721965,0.00012430096,0.0001323093,0.00014702475],"domain_scores_gemma":[0.99859786,0.0008232532,0.0001571257,0.00027778037,0.000095938616,0.000048050093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024086334,0.000094120864,0.0001267965,0.00004056529,0.00022576933,0.000045975066,0.00018079308,0.000030224088,0.000009983141],"category_scores_gemma":[0.00006897874,0.000058638994,0.000031636486,0.00020259173,0.00024956785,0.00011639493,0.000043857483,0.00011163041,0.000008483618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058990045,0.00006196779,0.00424057,0.000013297749,0.000039601546,2.1987624e-7,0.00049567374,2.0693996e-7,0.00049619953,0.99368584,0.00010694339,0.0008535804],"study_design_scores_gemma":[0.00036616134,0.000046985162,0.011809358,0.000035428136,0.000027477256,0.0000020900566,0.00073609746,0.000016164471,0.0030923411,0.98368406,0.00010504364,0.00007880759],"about_ca_topic_score_codex":0.000044223314,"about_ca_topic_score_gemma":0.00000961448,"teacher_disagreement_score":0.010001794,"about_ca_system_score_codex":0.0000055886335,"about_ca_system_score_gemma":0.00001532964,"threshold_uncertainty_score":0.23912287},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907425,0.000051176077,0.0018307648,0.00018954977,0.00063814176,0.0002769209,6.7321577e-7,0.00011272468,0.006157535],"genre_scores_gemma":[0.99138796,0.0000041323924,0.00807722,0.000038900333,0.0000037639682,0.00004379995,8.214658e-7,0.000013243343,0.0004301593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986338,0.000098799144,0.00024645095,0.0002758295,0.00039719584,0.00034794235],"domain_scores_gemma":[0.99860257,0.00021013773,0.00007637422,0.000805951,0.00017794067,0.00012701462],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021752775,0.00012776231,0.00021806241,0.00007812525,0.000069466776,0.00006321829,0.0009275459,0.0000567654,0.00023461836],"category_scores_gemma":[0.00010171189,0.00011794243,0.0000790458,0.00055831415,0.00011396927,0.0007177763,0.00036579292,0.00014234052,0.0009176273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017684986,0.00010431114,0.0022379425,0.000021586817,0.000018713816,0.000004926669,0.00022489014,0.0000041163257,0.005261958,0.9880943,0.0007489657,0.0032765449],"study_design_scores_gemma":[0.00048603798,0.000066919056,0.008144438,0.000020179694,0.0000025623779,0.000028179298,0.000025909878,0.0030166022,0.0076235514,0.9803875,0.000052274267,0.00014581883],"about_ca_topic_score_codex":0.00004588101,"about_ca_topic_score_gemma":3.660415e-7,"teacher_disagreement_score":0.0077067483,"about_ca_system_score_codex":0.000036344045,"about_ca_system_score_gemma":0.000047462352,"threshold_uncertainty_score":0.9998603},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9828999,0.00026954737,0.00021848122,0.00066362054,0.002103809,0.0013807076,0.000008867516,0.00015088411,0.012304196],"genre_scores_gemma":[0.9966438,0.000049691716,0.0028013526,0.000072302784,0.000007669151,0.000076139884,0.0000014651357,0.000054187512,0.00029343527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798685,0.00021814408,0.0007131063,0.00027539497,0.00045506255,0.00035144447],"domain_scores_gemma":[0.99676424,0.0016349541,0.00046702108,0.00085777516,0.0001569944,0.0001189894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011209557,0.000274022,0.00051349757,0.00007239886,0.0002043238,0.00002809405,0.000711538,0.00013011567,0.00003615912],"category_scores_gemma":[0.0012814514,0.00015886051,0.00016004349,0.0005197651,0.00031414916,0.00013094184,0.00030000234,0.00030205684,0.00004086052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016536025,0.00012320722,0.0009176873,0.00007376727,0.00015252084,0.0000062802146,0.008090839,0.0000026159316,0.00001509264,0.9878969,0.002437498,0.0001182102],"study_design_scores_gemma":[0.002185171,0.00009973567,0.0004986205,0.00010492102,0.00015737665,0.000030446996,0.0010820302,0.00010837906,0.0005642792,0.994594,0.0003768769,0.00019818755],"about_ca_topic_score_codex":0.00016126652,"about_ca_topic_score_gemma":0.00005366477,"teacher_disagreement_score":0.013743869,"about_ca_system_score_codex":0.00004896121,"about_ca_system_score_gemma":0.00003581453,"threshold_uncertainty_score":0.64781433},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9911134,0.00035897153,0.003989661,0.0006375883,0.0006299195,0.00032496086,0.000001796155,0.00007446618,0.0028691862],"genre_scores_gemma":[0.9936835,0.000020348742,0.0061949478,0.000018904246,0.0000020820748,0.0000033587046,0.0000011595563,0.000004524285,0.000071145936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988145,0.00008930424,0.00024983793,0.0002550863,0.00039130088,0.00019993747],"domain_scores_gemma":[0.9986572,0.00008637216,0.00015483936,0.0006627041,0.00038968484,0.000049180726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046675964,0.000090464295,0.00018475957,0.00023006267,0.00003982376,0.000013539701,0.00077930884,0.000039778824,0.0000033010726],"category_scores_gemma":[0.00019428846,0.00008807775,0.000051339848,0.0012076728,0.000100920086,0.00040564412,0.00009708771,0.00010141884,0.0000052244427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015447406,0.00016145567,0.00027007842,0.000016871407,0.0000061928918,0.0000022540103,0.00024878592,0.000008155804,0.02787782,0.9424857,0.00013383281,0.028773444],"study_design_scores_gemma":[0.00042546293,0.0002807939,0.0056714546,0.000018215824,0.0000020355637,0.0000027386764,0.000009015515,0.00024048568,0.17037676,0.82278675,0.00011428777,0.00007198923],"about_ca_topic_score_codex":0.0000034416291,"about_ca_topic_score_gemma":1.5245496e-7,"teacher_disagreement_score":0.14249894,"about_ca_system_score_codex":0.000017617976,"about_ca_system_score_gemma":0.00005155893,"threshold_uncertainty_score":0.35917065},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97876465,0.000012563756,0.000120404926,0.00023029241,0.00013807495,0.00026406554,0.0000035740711,0.000011291618,0.020455077],"genre_scores_gemma":[0.99876744,7.306784e-7,0.00026871968,0.000022027485,0.00000296772,0.000032130636,0.0000011476839,0.0000074763357,0.00089736993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996178,0.000016762548,0.00012646067,0.00009991074,0.000052857,0.000086201384],"domain_scores_gemma":[0.99948126,0.00014419861,0.00007245487,0.00023613276,0.000034388693,0.000031561514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000043749526,0.000062617844,0.000100429694,0.000007530617,0.000084668936,0.000009919164,0.00007484287,0.000019536948,0.00024430972],"category_scores_gemma":[0.000017714712,0.000040226434,0.000033307937,0.000086352324,0.00006208181,0.000045988752,0.000055903136,0.000073265575,0.000031758438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016339205,0.0000660476,0.00020723566,0.0000028228176,0.0000088233055,1.7412415e-8,0.000045213914,0.00000804514,0.003304854,0.9946247,0.0003078734,0.0014227328],"study_design_scores_gemma":[0.0002902721,0.000014789441,0.0016680909,0.000024748264,0.000006760473,1.8144033e-7,0.00006090921,0.00029444383,0.004803209,0.9925847,0.00020394631,0.000047936377],"about_ca_topic_score_codex":0.000035937308,"about_ca_topic_score_gemma":2.3485791e-8,"teacher_disagreement_score":0.020002775,"about_ca_system_score_codex":0.0000044587914,"about_ca_system_score_gemma":0.000006299928,"threshold_uncertainty_score":0.267502},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.970945,0.00012801803,0.00014644933,0.00026483426,0.006500526,0.00018698252,6.507743e-7,0.00047611538,0.021351423],"genre_scores_gemma":[0.99664664,0.0000063362572,0.0027825383,0.0003928443,9.825883e-7,0.000012539891,9.01132e-7,0.000009987242,0.00014723743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988143,0.000056816545,0.00017451767,0.0004247277,0.00025302175,0.00027660196],"domain_scores_gemma":[0.9989036,0.000041203206,0.00006658233,0.0007800892,0.000092123664,0.00011644094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027718744,0.00013723479,0.00013502905,0.00013199438,0.00013097959,0.000048020807,0.0006475685,0.000042730826,0.000025025569],"category_scores_gemma":[0.000056500212,0.00012027072,0.00006842446,0.00046957715,0.00005668378,0.00019178294,0.00013282371,0.00014647136,0.0002998832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083173,0.00017193261,0.0007313395,0.0000027936173,0.000009856654,0.000012122217,0.00029886415,0.000001160055,0.00021596093,0.9909585,0.0057346704,0.0018544925],"study_design_scores_gemma":[0.00044005807,0.000252028,0.002198642,0.000013030253,0.0000037913974,0.000005455901,0.000002906782,0.00015392098,0.0054449337,0.9910574,0.00026559262,0.00016222104],"about_ca_topic_score_codex":0.000055182954,"about_ca_topic_score_gemma":9.834689e-7,"teacher_disagreement_score":0.025701633,"about_ca_system_score_codex":0.000010765249,"about_ca_system_score_gemma":0.000036176087,"threshold_uncertainty_score":0.4904498},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9964036,0.000099480734,0.000046375102,0.00012358562,0.00024392667,0.00024029979,0.000011006526,0.000081348335,0.002750376],"genre_scores_gemma":[0.9995078,0.00000370909,0.000096641335,0.00006961228,0.000010909357,0.000020643576,0.000005508254,0.000012549023,0.0002726395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910593,0.00006216263,0.00030258085,0.00015803018,0.00018968432,0.00018162945],"domain_scores_gemma":[0.99907404,0.00021920873,0.00015248988,0.00039987676,0.000085721535,0.00006864279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002522553,0.00011892704,0.00024854872,0.00006633161,0.00009067731,0.000018905741,0.00021915988,0.000080148806,0.00004686246],"category_scores_gemma":[0.00008163955,0.00011465715,0.00008348379,0.0002084588,0.000054260076,0.00008876186,0.000022819715,0.000115360825,0.00002315289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011352001,0.0002587089,0.0005205964,0.000031099487,0.000019658688,0.0000015108704,0.00015236024,0.000003971452,0.0020658935,0.9941261,0.0027015822,0.000107203596],"study_design_scores_gemma":[0.0005132186,0.00007917437,0.0027525781,0.00001818545,0.000020841697,0.000005122751,0.00013075539,0.00011037905,0.0017379911,0.9937123,0.0007998409,0.0001195924],"about_ca_topic_score_codex":0.000007671955,"about_ca_topic_score_gemma":3.3985737e-7,"teacher_disagreement_score":0.0031041864,"about_ca_system_score_codex":0.000020497922,"about_ca_system_score_gemma":0.000032137246,"threshold_uncertainty_score":0.4675583},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9685622,0.0006702128,0.0008683124,0.000023533565,0.02358451,0.0010204404,0.000060534934,0.00032765526,0.0048826025],"genre_scores_gemma":[0.9988202,0.000005498896,0.00065226003,0.000002120433,0.000040279836,0.00006059776,0.000013515846,0.00003178315,0.0003737681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911875,0.000029244286,0.00030203574,0.00017014248,0.00012578977,0.0002540254],"domain_scores_gemma":[0.9993569,0.000047987356,0.000072842486,0.00035585748,0.000081761216,0.00008460726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044395987,0.00013557207,0.00026075132,0.00008654438,0.000066131775,0.000025094107,0.00014998848,0.00010154552,0.000025417918],"category_scores_gemma":[0.000050696897,0.00013785003,0.000073587355,0.00019707021,0.0000185685,0.00013018127,0.0000143088655,0.00015470578,0.000010539772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026940863,0.000026969308,0.0005027295,0.0002983419,0.000063494146,7.1817584e-7,0.00019259917,0.00007537275,0.022041734,0.9638675,0.012440094,0.00046350335],"study_design_scores_gemma":[0.0077717258,0.00031957234,0.00061398523,0.00024023403,0.0001497727,0.00011197841,0.00083630026,0.012600006,0.14818844,0.6332729,0.19493866,0.0009564316],"about_ca_topic_score_codex":0.000030649317,"about_ca_topic_score_gemma":0.000009390628,"teacher_disagreement_score":0.3305946,"about_ca_system_score_codex":0.00001730535,"about_ca_system_score_gemma":0.00003529275,"threshold_uncertainty_score":0.5621361},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9884033,0.000014518159,0.00003078729,0.00012242793,0.0005945561,0.00039560907,0.000009732455,0.000085004234,0.01034402],"genre_scores_gemma":[0.9985255,0.0000052368414,0.0002477755,0.00012512413,0.0000068241557,0.000111739944,0.0000016513353,0.000029465675,0.00094668526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998225,0.00012782427,0.00018001696,0.0003239009,0.00063184893,0.0005114475],"domain_scores_gemma":[0.9988424,0.00020095681,0.000087825654,0.000618706,0.0001079097,0.00014218179],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046626426,0.00016746987,0.0001527893,0.000038579637,0.0002337976,0.00008382172,0.0006930582,0.000034380133,0.0028837966],"category_scores_gemma":[0.00021850035,0.00008665312,0.000025954965,0.00021612975,0.0001941817,0.00027666526,0.00017049145,0.00016715734,0.0007336394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022145654,0.0006966999,0.0011220558,0.000026671416,0.000040067982,0.00016115264,0.0009812713,0.000023298593,0.05559913,0.9356734,0.0030696932,0.00039198526],"study_design_scores_gemma":[0.0032368673,0.00425797,0.0032687502,0.00012291447,0.000025036958,0.000016792073,0.0007407579,0.00013988627,0.4729696,0.51191795,0.0027025656,0.0006009151],"about_ca_topic_score_codex":0.0001014721,"about_ca_topic_score_gemma":0.000019120846,"teacher_disagreement_score":0.42375547,"about_ca_system_score_codex":0.0000885859,"about_ca_system_score_gemma":0.00010740555,"threshold_uncertainty_score":0.9980277},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937255,0.000094842995,0.00015206782,0.00001845502,0.0030149973,0.00033025528,0.000022773242,0.00017640009,0.0024647282],"genre_scores_gemma":[0.99946696,0.00000867692,0.0002565906,0.000025761297,0.000015007675,0.000070631046,0.000008803143,0.00003154647,0.000116035495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992596,0.000011578813,0.00017344065,0.0001770441,0.00008523286,0.0002931131],"domain_scores_gemma":[0.9994615,0.00009288621,0.00002778228,0.0002722489,0.00004552801,0.00010007553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004029963,0.00014423484,0.00017362581,0.000049500275,0.00011491518,0.000045356872,0.00015450876,0.00012607174,0.000009761297],"category_scores_gemma":[0.000040127212,0.00014412066,0.000047232046,0.000117368436,0.000035521265,0.000120406796,0.000023729172,0.00018556598,0.000024399307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005123806,0.00007225272,0.0031544247,0.00026290276,0.000068418696,0.000010846844,0.0009444133,0.000017029557,0.07184613,0.9159687,0.0066964324,0.00090720254],"study_design_scores_gemma":[0.005021437,0.00028142767,0.007789483,0.00012221353,0.00005801596,0.000044895507,0.0003149285,0.009389637,0.06497891,0.85375416,0.057300355,0.00094454753],"about_ca_topic_score_codex":0.0000051772504,"about_ca_topic_score_gemma":0.000009589816,"teacher_disagreement_score":0.062214565,"about_ca_system_score_codex":0.000009575048,"about_ca_system_score_gemma":0.000009153608,"threshold_uncertainty_score":0.587707},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96409947,0.0003217885,0.000006567722,0.00006370609,0.0020551756,0.00010487456,0.0000014108103,0.00012994024,0.033217058],"genre_scores_gemma":[0.9996311,0.00002835409,0.000013806305,0.000019013609,0.000009440576,0.000006572554,9.379155e-7,0.000011744122,0.0002790216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940914,0.000037367005,0.00018595597,0.00007510884,0.00011329483,0.00017913677],"domain_scores_gemma":[0.99954534,0.00008383837,0.000030165655,0.00027257905,0.000027608052,0.00004045824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022027087,0.00009529542,0.00013401208,0.00001685989,0.000076535216,0.000018711271,0.0002041072,0.000058105943,0.000021959462],"category_scores_gemma":[0.000017546794,0.000072088566,0.000066579996,0.00015948957,0.00003426946,0.000056487104,0.000009199672,0.00010093963,0.0000924469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008734613,0.000022364895,0.0006679271,0.000011651075,0.000026003312,0.000002377189,0.00017470628,0.000061802406,0.0015255134,0.99279624,0.003239273,0.0014634221],"study_design_scores_gemma":[0.0006449212,0.00006884822,0.0065209717,0.000036553098,0.000017185086,0.0000138864825,0.0001577965,0.0007376275,0.009677175,0.9599377,0.021986881,0.00020047507],"about_ca_topic_score_codex":0.0000030757851,"about_ca_topic_score_gemma":7.987031e-7,"teacher_disagreement_score":0.035531633,"about_ca_system_score_codex":0.000018260296,"about_ca_system_score_gemma":0.0000056822487,"threshold_uncertainty_score":0.29396862},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16501053,0.00044250512,0.67878664,0.020363389,0.004054656,0.0046637384,0.00013865625,0.0003041381,0.12623575],"genre_scores_gemma":[0.9961471,0.000005190932,0.0012301705,0.00010240768,0.000074820324,0.00046180675,0.00001416862,0.000017565615,0.0019467784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994276,0.000018535351,0.00015149084,0.00011606648,0.00007867542,0.00020758982],"domain_scores_gemma":[0.9982913,0.0011564655,0.00007161196,0.00038708284,0.00005257618,0.000040949893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021486283,0.000096234595,0.00010633323,0.0000042994684,0.0006367197,0.00006109639,0.00027976325,0.000017183815,0.000050482697],"category_scores_gemma":[0.000033714834,0.00005058099,0.00009914332,0.00008096426,0.000069087735,0.000041791176,0.00005116604,0.00007047585,0.00003191074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064476158,0.000024144165,0.000042917556,0.000002234281,0.000023946932,4.9467848e-9,0.000033262753,0.0000181418,0.00003582221,0.9862465,0.0053457366,0.008220786],"study_design_scores_gemma":[0.00035847796,0.000012827254,0.000019791521,0.0000021743817,0.000014186699,7.280806e-8,0.00007293626,0.001692363,0.00039269228,0.7213302,0.2760469,0.000057350455],"about_ca_topic_score_codex":0.000014230994,"about_ca_topic_score_gemma":0.0000010056631,"teacher_disagreement_score":0.8311366,"about_ca_system_score_codex":0.00000712993,"about_ca_system_score_gemma":0.000009617597,"threshold_uncertainty_score":0.48971975},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8842306,0.00015771609,0.00033682614,0.000022724827,0.0012872233,0.000101440295,0.000008974873,0.000030147747,0.11382433],"genre_scores_gemma":[0.9991492,0.0000012367648,0.00025196944,0.0000043635864,0.00001081186,0.000015050868,0.0000041231265,0.000009890173,0.0005533438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993366,0.000026190684,0.00021015476,0.00014566716,0.00009380469,0.00018758472],"domain_scores_gemma":[0.9995666,0.00002584473,0.00009878473,0.00018378628,0.000064208245,0.000060754945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006775872,0.00011496757,0.00020925753,0.000036830712,0.00009694065,0.0000031546724,0.00015261103,0.000036596626,0.00053557736],"category_scores_gemma":[0.0000028451648,0.00009956381,0.00009909206,0.00015120467,0.000086082204,0.000065809785,0.000058137433,0.00013989751,0.00007868906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001708701,0.0003584354,0.07208604,0.0000074699,0.00014544178,0.0000012885827,0.001646434,0.000001320579,0.00006644593,0.9189723,0.0014774869,0.0052202325],"study_design_scores_gemma":[0.0021570188,0.0003453117,0.028129522,0.00005689426,0.0001554784,5.7924075e-7,0.0022976294,0.000031234646,0.028990638,0.9109299,0.026302047,0.000603707],"about_ca_topic_score_codex":0.0002629419,"about_ca_topic_score_gemma":5.9390857e-7,"teacher_disagreement_score":0.11491859,"about_ca_system_score_codex":0.00001528583,"about_ca_system_score_gemma":0.000020423115,"threshold_uncertainty_score":0.58641964},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9238574,0.00004226396,0.025582856,0.0046502417,0.014493579,0.0002886359,0.0000050929107,0.0006374652,0.03044249],"genre_scores_gemma":[0.9941325,0.0000020337673,0.0053463983,0.00032604672,0.000010673153,0.000021623331,0.0000012173163,0.000011881375,0.00014763487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848014,0.00007463726,0.00013855816,0.00039552935,0.0005343816,0.00037676495],"domain_scores_gemma":[0.99787426,0.000988576,0.000027084094,0.000761517,0.00014642098,0.00020212035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038351023,0.00012521689,0.00011431373,0.00017220332,0.0002285717,0.00011236911,0.0009776213,0.0000902074,0.00013926187],"category_scores_gemma":[0.0006867248,0.000120214936,0.00007443684,0.00049067824,0.00020132323,0.0004902864,0.0001959016,0.00076056697,0.00047690372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103361135,0.00014323845,0.00036967412,0.0000022862805,0.000005532905,0.00002133228,0.000024409168,0.0000025386698,0.001969065,0.994245,0.0013625275,0.0018440381],"study_design_scores_gemma":[0.00029653206,0.00012075584,0.001954153,0.0000043826017,0.0000011077209,0.00001762529,0.0000027597016,0.0008607454,0.0022572286,0.9916891,0.0026570726,0.0001385728],"about_ca_topic_score_codex":0.0000029952503,"about_ca_topic_score_gemma":0.0000015347674,"teacher_disagreement_score":0.07027511,"about_ca_system_score_codex":0.000018740735,"about_ca_system_score_gemma":0.000058222482,"threshold_uncertainty_score":0.6129792},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9891554,0.00053345034,0.00011446242,0.00006039759,0.0007417683,0.00010733593,0.000002389076,0.000065585984,0.009219174],"genre_scores_gemma":[0.9998153,0.000019851193,0.000096969845,0.000011026887,0.0000054075385,0.000004870661,0.0000034859586,0.000008807446,0.000034269928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994304,0.00006921028,0.00021760816,0.000067956986,0.00010290519,0.00011192039],"domain_scores_gemma":[0.9995285,0.00006170254,0.00004337419,0.00029416993,0.000043224398,0.000028996157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027864022,0.00007982094,0.00014705682,0.00005481851,0.000055057775,0.0000068054287,0.00018595238,0.000039129052,0.00001171269],"category_scores_gemma":[0.000008625408,0.00006530139,0.00006141445,0.00025458843,0.000038059155,0.00006421439,0.000011938695,0.000087453554,0.000007015625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005251228,0.000051580057,0.00032611025,0.000027895143,0.000024507053,9.910959e-7,0.0009578275,0.001643153,0.035522547,0.9600362,0.0006347142,0.000769206],"study_design_scores_gemma":[0.0005670853,0.00013613583,0.0025452422,0.000094134,0.00002459909,0.0000038104072,0.00019189798,0.0015453191,0.08088028,0.9127658,0.0011245967,0.000121118246],"about_ca_topic_score_codex":0.000041850395,"about_ca_topic_score_gemma":0.000005729267,"teacher_disagreement_score":0.047270436,"about_ca_system_score_codex":0.00001649872,"about_ca_system_score_gemma":0.000007127248,"threshold_uncertainty_score":0.26629135},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9872858,0.00014377758,0.0002065883,0.001727348,0.0030777599,0.00021733803,3.88581e-7,0.00045183438,0.006889186],"genre_scores_gemma":[0.99649864,0.000009398369,0.001926653,0.0011390317,6.1445064e-7,0.00003454547,0.0000013106427,0.00001123862,0.0003785792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870044,0.00005818246,0.00020018735,0.00039030277,0.00031871605,0.00033214228],"domain_scores_gemma":[0.998738,0.00011620625,0.00006964135,0.0007787435,0.00013224472,0.00016516844],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019889808,0.00015588406,0.00014841427,0.00015330472,0.00016159168,0.00019032661,0.0007080073,0.00007208795,0.000059998652],"category_scores_gemma":[0.00005182711,0.00013345479,0.00008082418,0.0005365755,0.000049363294,0.00035221048,0.00015301985,0.0001729255,0.0017422723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.1396925e-7,0.00009510948,0.0003457245,0.0000028504255,0.000008334647,0.0000040274585,0.00007595397,0.000009976433,0.00041052024,0.96977496,0.02702021,0.0022514244],"study_design_scores_gemma":[0.00045275484,0.00015656132,0.0016414995,0.000017625836,0.0000023361567,0.000003873705,0.0000048280303,0.0017274148,0.0012550359,0.9940239,0.0005384522,0.00017572817],"about_ca_topic_score_codex":0.00008561674,"about_ca_topic_score_gemma":7.306862e-7,"teacher_disagreement_score":0.026481757,"about_ca_system_score_codex":0.000015334399,"about_ca_system_score_gemma":0.00002431249,"threshold_uncertainty_score":0.999035},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99384,0.00008727532,0.0010329126,0.00046761188,0.0020003684,0.00036208818,0.000002868511,0.00003681791,0.002170102],"genre_scores_gemma":[0.9996721,0.00000718079,0.000097031225,0.000077484474,0.000009851604,0.000026499365,2.630901e-7,0.000008499069,0.00010104877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985959,0.00026364558,0.0003256476,0.00031498144,0.00026286102,0.00023698801],"domain_scores_gemma":[0.99832624,0.00046244558,0.0001582326,0.00070283614,0.00027386955,0.000076358505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047466104,0.00015231172,0.0003344926,0.00007310727,0.00012531244,0.000068402675,0.0005671485,0.000097158525,0.00003204528],"category_scores_gemma":[0.00013941654,0.000107721076,0.00013810223,0.0004198384,0.00018332053,0.00048090983,0.00028967,0.00016956103,0.0000060684565],"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.000005089085,0.00012994237,0.10440367,0.000034567765,0.00004388036,5.31092e-7,0.0011588335,0.000007718978,0.003948656,0.8883228,0.0011806278,0.00076369446],"study_design_scores_gemma":[0.0018146585,0.00043269712,0.51861995,0.00017221598,0.000022247383,0.000043569522,0.00058330514,0.012023043,0.021206385,0.4439667,0.0006747719,0.00044045574],"about_ca_topic_score_codex":0.0009178409,"about_ca_topic_score_gemma":0.000064119835,"teacher_disagreement_score":0.44435608,"about_ca_system_score_codex":0.000022214881,"about_ca_system_score_gemma":0.000043595996,"threshold_uncertainty_score":0.4392738},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99706644,0.0000029742762,0.000027267894,0.0000486166,0.0004113529,0.00047677784,0.000004378249,0.000020470341,0.0019417398],"genre_scores_gemma":[0.9994886,0.0000016195986,0.00021810684,0.000037832404,0.0000048210763,0.00003592359,0.0000028907066,0.000024939696,0.0001852553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888843,0.00015532944,0.0002840417,0.00016243373,0.0002735385,0.00023622827],"domain_scores_gemma":[0.9991205,0.00014990866,0.00010469186,0.0004914883,0.00007950745,0.00005392783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059705996,0.00010954008,0.0002075323,0.00014874208,0.000041496143,0.000011222823,0.0004067199,0.00006993972,0.00007444986],"category_scores_gemma":[0.00033858238,0.00008396031,0.000045079134,0.0005657278,0.000047758887,0.00006798671,0.0001611412,0.00015275451,0.000037800797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013403303,0.00049570284,0.036855724,0.00015840124,0.000025428088,0.000015521166,0.015412893,2.4535188e-7,0.0621725,0.88427514,0.00016135402,0.00029308884],"study_design_scores_gemma":[0.00083986437,0.00018114157,0.14776476,0.00017529332,0.00001208905,0.0000052945425,0.00017881324,0.000108336804,0.0535839,0.79690486,0.000083467436,0.00016215297],"about_ca_topic_score_codex":0.00007835378,"about_ca_topic_score_gemma":0.00002956354,"teacher_disagreement_score":0.11090904,"about_ca_system_score_codex":0.00005025096,"about_ca_system_score_gemma":0.000050534967,"threshold_uncertainty_score":0.3423802},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9748284,0.0000074867685,0.00027000176,0.0004937064,0.0022580046,0.0005058952,0.000005014448,0.00033355525,0.021297894],"genre_scores_gemma":[0.97945774,0.0000015984087,0.014676402,0.000057123692,0.000015086002,0.00006322563,0.000005479046,0.000057857334,0.005665464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986313,0.000034251145,0.00046673382,0.00024445824,0.00028817932,0.00033505016],"domain_scores_gemma":[0.99857014,0.00040141708,0.00013676117,0.0005866056,0.00012186845,0.00018320761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039730407,0.00019157414,0.0003029839,0.0001232566,0.00013079053,0.00008026021,0.00029810125,0.00015609786,0.00033832656],"category_scores_gemma":[0.0017834925,0.00018647619,0.000085498956,0.00026580013,0.00005610218,0.00032745203,0.00013109406,0.000300405,0.00058726984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008842583,0.000099837496,0.0000698874,0.000046132554,0.000018313925,0.000004076562,0.0006527183,6.076307e-7,0.0111558335,0.98351353,0.004159139,0.00027110288],"study_design_scores_gemma":[0.0005148747,0.000049411425,0.0001974522,0.000037039874,0.000021704896,0.000009971366,0.00010182384,0.00008075419,0.010349002,0.9863786,0.002036079,0.00022330014],"about_ca_topic_score_codex":0.000012443437,"about_ca_topic_score_gemma":0.00003795052,"teacher_disagreement_score":0.01563243,"about_ca_system_score_codex":0.000052442916,"about_ca_system_score_gemma":0.000032260978,"threshold_uncertainty_score":0.76042783},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99284875,0.00028071692,0.00059833727,0.0016676404,0.0010049936,0.0006087008,0.0000034366863,0.0005124469,0.002474983],"genre_scores_gemma":[0.99610066,0.00007416104,0.002986691,0.0005098075,0.0000036931115,0.00010768684,0.0000032009746,0.0000343513,0.0001797329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973353,0.00022438157,0.00030484117,0.00082320505,0.0005441768,0.0007680766],"domain_scores_gemma":[0.9972399,0.0007944402,0.00010437549,0.001247266,0.00024290608,0.00037113612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038382824,0.00034751173,0.00033649834,0.00048562337,0.00038514042,0.00036705018,0.001266306,0.0001417832,0.00004854537],"category_scores_gemma":[0.00029787348,0.00031077585,0.000111452624,0.0013170479,0.00032099357,0.00090811664,0.000446331,0.00045236346,0.0003356987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010553731,0.0001102242,0.0038755415,0.000011870065,0.000031724114,0.00002019901,0.0002621724,0.0000043610517,0.0027546678,0.9816066,0.00062884437,0.010683221],"study_design_scores_gemma":[0.0009000529,0.0003517432,0.047676675,0.000034041313,0.0000042432634,0.0000146300135,0.000022156559,0.0011577512,0.004463826,0.9446072,0.00040509124,0.00036258393],"about_ca_topic_score_codex":0.00011536744,"about_ca_topic_score_gemma":0.000014848954,"teacher_disagreement_score":0.043801133,"about_ca_system_score_codex":0.000044131048,"about_ca_system_score_gemma":0.000050131795,"threshold_uncertainty_score":0.99993443},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9855113,0.00031798327,0.00013228985,0.00012743812,0.0011787834,0.00040790008,0.0000021172555,0.00038810572,0.011934056],"genre_scores_gemma":[0.9994494,0.000015261881,0.000020865715,0.000028018481,0.0000088818,0.00012076226,0.0000015267923,0.00003466805,0.00032063425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922395,0.00006677742,0.00015026504,0.0001239153,0.00014518913,0.00028989313],"domain_scores_gemma":[0.99941653,0.00014407017,0.000022436507,0.00027448838,0.00005749331,0.000084983076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013292937,0.00015871572,0.00014148898,0.000029695353,0.00019549839,0.00007996362,0.00020070016,0.00006246675,0.000038097107],"category_scores_gemma":[0.0000058931123,0.0001045754,0.00004721641,0.00018912586,0.0000849909,0.00012890284,0.000007902807,0.00016418454,0.00028211542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003534112,0.00007168398,0.00091403,0.000057651734,0.00038177441,0.00003266536,0.0025663963,0.0017117505,0.010806223,0.9649563,0.01654232,0.0019239092],"study_design_scores_gemma":[0.004231953,0.0007636847,0.02213573,0.00025571467,0.00015639087,0.00016549217,0.002842746,0.02128255,0.029915662,0.89669037,0.01990563,0.0016541007],"about_ca_topic_score_codex":0.000031398173,"about_ca_topic_score_gemma":0.000009488273,"teacher_disagreement_score":0.06826591,"about_ca_system_score_codex":0.000026544765,"about_ca_system_score_gemma":0.000011937383,"threshold_uncertainty_score":0.42644614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9945451,0.000060139446,0.00012078535,0.00084973173,0.000515426,0.00018550832,0.0000016867651,0.000042564672,0.0036790306],"genre_scores_gemma":[0.9994525,0.000005178989,0.00026147498,0.000042136657,0.000011354503,0.000017767348,8.7551643e-7,0.000011340765,0.00019740358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927616,0.00010641117,0.00021371376,0.00011762224,0.00015245618,0.00013365265],"domain_scores_gemma":[0.9985802,0.0004976264,0.00015528231,0.00057670043,0.00015591024,0.000034279816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008780154,0.000080923244,0.00013001359,0.000032521046,0.00015204889,0.00001698951,0.00031474134,0.00004781073,0.000004526706],"category_scores_gemma":[0.0006318356,0.000054756936,0.00005740122,0.00029472704,0.00013075015,0.000055786455,0.000045428504,0.000119298624,0.000010403778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007832375,0.00011076211,0.0015346991,0.000014563705,0.000017902437,9.5052506e-8,0.00009805111,2.1017335e-7,0.00057500246,0.99532515,0.0018540191,0.0004617283],"study_design_scores_gemma":[0.00023815615,0.000033430297,0.0025516397,0.0000072541866,0.00001936637,0.0000010262941,0.00003088888,0.000011059982,0.003964701,0.9804858,0.0125910025,0.000065683045],"about_ca_topic_score_codex":0.000008842341,"about_ca_topic_score_gemma":0.000004342249,"teacher_disagreement_score":0.014839342,"about_ca_system_score_codex":0.000006996019,"about_ca_system_score_gemma":0.00001863258,"threshold_uncertainty_score":0.2232923},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95023686,0.006202605,0.00006434623,0.00009796424,0.0019332698,0.00018527741,0.00000683557,0.00044997435,0.040822875],"genre_scores_gemma":[0.99860024,0.000026739905,0.00042172865,0.000029480081,0.000010359568,0.000030735777,0.000012370164,0.000050603576,0.000817763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858075,0.000044344844,0.00036146844,0.0002434404,0.00030637067,0.00046360857],"domain_scores_gemma":[0.99913216,0.00009560452,0.00004899824,0.00048339466,0.000048101305,0.00019174443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016054677,0.00025968617,0.0002898009,0.00018742049,0.000040623945,0.000057437297,0.00042538156,0.000118182514,0.00001507931],"category_scores_gemma":[0.000038970073,0.00028462012,0.0000648527,0.0006525449,0.00007746145,0.00030459123,0.00005827158,0.00026693087,0.00008441686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022140701,0.00016149817,0.022360876,0.00025991397,0.00017272931,0.00029118013,0.003118009,0.0037701265,0.016922448,0.91326576,0.034906667,0.0045493706],"study_design_scores_gemma":[0.011825791,0.0003308689,0.029762434,0.00075475994,0.000096353855,0.000034392855,0.00075412093,0.0144310715,0.124951236,0.7628019,0.050849874,0.0034072043],"about_ca_topic_score_codex":0.00004619798,"about_ca_topic_score_gemma":0.0002724929,"teacher_disagreement_score":0.1504639,"about_ca_system_score_codex":0.00017234246,"about_ca_system_score_gemma":0.000040509593,"threshold_uncertainty_score":0.9999606},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9886452,0.000013523443,0.0070152427,0.00027814982,0.0010317694,0.00017393012,0.0000015038008,0.000054826836,0.0027858373],"genre_scores_gemma":[0.9912376,0.000007096253,0.0085870335,0.00002802048,0.0000045086763,0.00001012214,0.0000018443102,0.0000060750235,0.00011772556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989345,0.00012414553,0.0001939782,0.00026035772,0.00031052553,0.0001764864],"domain_scores_gemma":[0.9988378,0.00026410408,0.00011771425,0.00047873994,0.00021538541,0.00008622799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010412093,0.00008882464,0.00013468141,0.00013155935,0.000086318156,0.000043687047,0.00045320785,0.00007703231,0.000013195868],"category_scores_gemma":[0.00032756955,0.00009016133,0.000032783293,0.00041114827,0.00018413608,0.0006796198,0.0002388777,0.0002218868,0.000012565319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010760712,0.0000560127,0.0019228866,0.0000151879885,0.0000053705166,0.0000014601904,0.00048778305,9.1044285e-7,0.02076622,0.9676395,0.0000860078,0.009007871],"study_design_scores_gemma":[0.0008204772,0.00005748572,0.007128479,0.0000064040773,0.00000276915,0.000004799403,0.00003571082,0.003101261,0.028706672,0.959664,0.00036650783,0.00010544664],"about_ca_topic_score_codex":0.00003104301,"about_ca_topic_score_gemma":0.000027603834,"teacher_disagreement_score":0.008902425,"about_ca_system_score_codex":0.000020532561,"about_ca_system_score_gemma":0.000038789447,"threshold_uncertainty_score":0.36766726},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96339136,0.00011072343,0.026955493,0.00038866542,0.00036377308,0.0012454356,0.000016640091,0.00012278177,0.007405108],"genre_scores_gemma":[0.9720268,0.0000078870335,0.02702548,0.000057930753,0.000015064438,0.000299206,0.0000040582977,0.000033758886,0.0005297682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988945,0.000034934958,0.00031865094,0.00024249018,0.00026043004,0.00024895908],"domain_scores_gemma":[0.99852264,0.00047037692,0.000114053364,0.0005192806,0.00021590342,0.00015773071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012104734,0.00015259148,0.00027905017,0.00024023176,0.000062977684,0.000016040627,0.0003026042,0.000078911435,0.00019944574],"category_scores_gemma":[0.0003073773,0.00015403544,0.00007324607,0.00086497125,0.000063290136,0.00016288468,0.00007571216,0.00015162677,0.00016944642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033576364,0.00020595678,0.0003251881,0.000044844743,0.000034875236,7.8069144e-7,0.00038727478,0.0000030294218,0.0009987127,0.99281114,0.0011008265,0.0040839906],"study_design_scores_gemma":[0.00037432677,0.00010158559,0.0025186997,0.000018989595,0.000024149984,0.0000019542556,0.0003035152,0.000013859428,0.004720234,0.9904876,0.001272567,0.0001625479],"about_ca_topic_score_codex":0.00003016273,"about_ca_topic_score_gemma":0.000003101642,"teacher_disagreement_score":0.008635467,"about_ca_system_score_codex":0.00006284267,"about_ca_system_score_gemma":0.00003279099,"threshold_uncertainty_score":0.6281383},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9949493,0.000048682545,0.0008788497,0.00027318523,0.0005209334,0.0011719532,0.000040355655,0.00008748674,0.002029252],"genre_scores_gemma":[0.9875882,0.0000049560163,0.011646314,0.000117745956,0.00002100951,0.00018309399,0.000044696106,0.000054371463,0.00033960026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983495,0.00014689259,0.0005920003,0.0003039336,0.00026577016,0.00034192458],"domain_scores_gemma":[0.99740094,0.0008930514,0.00042208823,0.0004405315,0.00073746755,0.00010593941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055400917,0.00024850902,0.00062757614,0.00015693494,0.00013622156,0.000068773385,0.00024253728,0.00013386314,0.00041651598],"category_scores_gemma":[0.0007510313,0.00022612425,0.00020434828,0.00031165444,0.00012445622,0.00033226397,0.00006602726,0.00016484268,0.00007303283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005262586,0.00016681991,0.00035922232,0.00009340484,0.00027898647,0.000001135987,0.000927133,0.0000043010373,0.059278127,0.92924935,0.009423034,0.00016586586],"study_design_scores_gemma":[0.0016275,0.0002329865,0.0011213013,0.00009855752,0.00015554673,0.000004379351,0.00056905963,0.0039404705,0.025305891,0.9665118,0.00016451442,0.0002679952],"about_ca_topic_score_codex":0.00026070702,"about_ca_topic_score_gemma":0.000014281217,"teacher_disagreement_score":0.03726245,"about_ca_system_score_codex":0.000116309995,"about_ca_system_score_gemma":0.00007337827,"threshold_uncertainty_score":0.92210793},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9965496,0.000779583,0.000013714371,0.00007827597,0.00038726232,0.00044671408,0.000026492427,0.000014158994,0.001704181],"genre_scores_gemma":[0.99927014,0.000076516095,0.00037703884,0.000016284539,0.0000033398733,0.000018309578,0.0000025873844,0.000021452808,0.000214333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868494,0.00021117977,0.0004903314,0.00020683964,0.00022623224,0.00018047584],"domain_scores_gemma":[0.99833506,0.00028481486,0.00058342173,0.0006003531,0.00013507891,0.000061284605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004208725,0.00017243765,0.0003046795,0.000078302335,0.00016402472,0.000009018542,0.00032592547,0.00015299115,0.00006443776],"category_scores_gemma":[0.0001503515,0.00013715144,0.00011976121,0.00039498296,0.00039758123,0.00009838859,0.00014100461,0.0001554562,0.0000058347655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030339743,0.00042677263,0.011639471,0.00017773434,0.0000776511,4.4855128e-7,0.007226789,5.886547e-7,0.005060109,0.97483826,0.00014484132,0.00037699152],"study_design_scores_gemma":[0.0006268514,0.000095440075,0.016353007,0.00017515435,0.00020677179,0.000002978163,0.0006062002,0.000060231854,0.07290198,0.9085738,0.0002643935,0.00013318307],"about_ca_topic_score_codex":0.00020318653,"about_ca_topic_score_gemma":0.000023069822,"teacher_disagreement_score":0.067841865,"about_ca_system_score_codex":0.000013770688,"about_ca_system_score_gemma":0.00005530219,"threshold_uncertainty_score":0.55928737},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9947886,0.00038096763,0.000015227735,0.00027416446,0.00070886564,0.00030599904,0.0000044097856,0.00011654093,0.003405211],"genre_scores_gemma":[0.9943372,0.00003999135,0.004628036,0.00012648926,0.0000475409,0.000025875204,0.0000075151347,0.00006215092,0.00072519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811816,0.00015299954,0.00049564504,0.0003075604,0.00030321348,0.00062240544],"domain_scores_gemma":[0.99862444,0.0003563072,0.00017283886,0.0004977572,0.00010982585,0.00023881011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011492108,0.0002944215,0.00059860497,0.00024121118,0.00011334965,0.00006938817,0.00023249791,0.00020688697,0.00006185191],"category_scores_gemma":[0.0008018614,0.0002774938,0.0001039758,0.0005331045,0.00014628148,0.00033531387,0.00017906661,0.00035790322,0.00011555968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000254288,0.00030315976,0.036344733,0.00008311449,0.00010539354,0.000014174658,0.002715068,3.9762978e-7,0.00064405764,0.9581066,0.0014602394,0.00019763078],"study_design_scores_gemma":[0.0026684566,0.00010221365,0.003878426,0.00014310463,0.0001480152,0.000024070783,0.0010510349,0.00054946746,0.001927001,0.9820271,0.0068368646,0.0006442112],"about_ca_topic_score_codex":0.00018503604,"about_ca_topic_score_gemma":0.000049486276,"teacher_disagreement_score":0.032466307,"about_ca_system_score_codex":0.00011368992,"about_ca_system_score_gemma":0.000044025186,"threshold_uncertainty_score":0.9999677},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98974925,0.00007141009,0.0047597503,0.00059746776,0.00077362196,0.00042901604,3.4848497e-7,0.00013290861,0.0034862482],"genre_scores_gemma":[0.99693596,0.0000041835074,0.0026214086,0.000060394977,0.0000022130973,0.00009769824,0.0000013727868,0.000009882202,0.00026686338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862665,0.00014185786,0.00019772159,0.00033517208,0.0003243177,0.00037430567],"domain_scores_gemma":[0.9990185,0.00019666967,0.000049546066,0.00050863525,0.00012508137,0.00010155817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003728258,0.000117074196,0.000139205,0.00030029166,0.00007394478,0.00011985478,0.00074053963,0.000060063583,0.000051678206],"category_scores_gemma":[0.00011719433,0.000116980904,0.00004780114,0.001034004,0.00006563379,0.0011367651,0.00024382136,0.00018464694,0.0003188291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034555283,0.00007854158,0.0015065484,0.000003839784,0.0000035390487,0.000008510649,0.00020007325,0.000012841967,0.002912658,0.9854705,0.0003093305,0.009490203],"study_design_scores_gemma":[0.0007016762,0.000083686995,0.020020392,0.000008673267,5.462499e-7,0.0000044784338,0.000025440664,0.0053340746,0.0027024827,0.9709411,0.00003812996,0.00013928869],"about_ca_topic_score_codex":0.000049301918,"about_ca_topic_score_gemma":0.0000033556034,"teacher_disagreement_score":0.018513843,"about_ca_system_score_codex":0.00006350338,"about_ca_system_score_gemma":0.00003391495,"threshold_uncertainty_score":0.4770343},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9502454,0.000046848174,0.0000028846314,0.0004491798,0.007572857,0.0001687465,0.000013485568,0.00012319419,0.0413774],"genre_scores_gemma":[0.9970769,0.0000066853017,0.0001468584,0.0010087554,0.00006188404,0.000012314404,0.00001279287,0.00002909269,0.0016446763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691314,0.0001947815,0.0005253501,0.00064498733,0.0013631899,0.00035853495],"domain_scores_gemma":[0.9969642,0.0014135598,0.00019480391,0.0009776483,0.00012133057,0.00032844255],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019022658,0.0002394027,0.0003003603,0.00026043822,0.00038310635,0.00023000216,0.000842963,0.0002411505,0.0020916413],"category_scores_gemma":[0.0029353192,0.000194041,0.00015016763,0.00047504558,0.00022028422,0.0005879284,0.00020731536,0.0006609217,0.0021710603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010789796,0.00022532322,0.025073592,0.0000025559382,0.000016461097,0.000024967241,0.0003348616,0.000014203656,0.008759061,0.94421667,0.0147211775,0.0065032276],"study_design_scores_gemma":[0.0008346955,0.000155759,0.18159384,0.000011959697,0.000008793472,0.0000136457675,0.00013082517,0.00026658978,0.0011257904,0.7896878,0.02592373,0.00024653637],"about_ca_topic_score_codex":0.000019598336,"about_ca_topic_score_gemma":0.0000083187315,"teacher_disagreement_score":0.15652025,"about_ca_system_score_codex":0.000059785507,"about_ca_system_score_gemma":0.00009575743,"threshold_uncertainty_score":0.9988206},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99310803,0.0037924831,0.0000030711883,0.000026936337,0.0013150038,0.0001362943,0.0000020891534,0.00024384608,0.0013722661],"genre_scores_gemma":[0.99982584,0.00006213303,0.000005199874,0.000027668688,0.000013269608,0.000008961739,0.0000019702647,0.00001702104,0.000037966216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925375,0.00003166349,0.00023828192,0.00011730516,0.00014604881,0.00021295066],"domain_scores_gemma":[0.9995922,0.000011790463,0.000033481218,0.00027538274,0.00002783231,0.000059350215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001327828,0.0001408434,0.00022700959,0.0001064308,0.00003903816,0.000016395134,0.00018444697,0.00007141473,0.000006745237],"category_scores_gemma":[0.000010529948,0.00012349371,0.000093592,0.0002166512,0.000040096216,0.0001486965,0.0000093691915,0.0001002254,0.000027343298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008491641,0.00006259888,0.00047013484,0.0000968665,0.00005192662,0.000005657129,0.0004762552,0.00012720321,0.10977918,0.8878911,0.00048338703,0.00054720015],"study_design_scores_gemma":[0.0006714566,0.00014356732,0.004708967,0.00018831193,0.00002584312,0.000013026541,0.00012896195,0.0005285451,0.17814225,0.8143875,0.0007210947,0.00034048708],"about_ca_topic_score_codex":0.0000063496927,"about_ca_topic_score_gemma":4.2970908e-7,"teacher_disagreement_score":0.07350362,"about_ca_system_score_codex":0.000015006298,"about_ca_system_score_gemma":0.000007966925,"threshold_uncertainty_score":0.5035927},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8838705,0.000011455575,0.0008813753,0.0009479677,0.00045035663,0.00031514882,0.0000032932003,0.0002187074,0.11330121],"genre_scores_gemma":[0.9946486,0.0000042885185,0.0030438225,0.00019791206,0.000011321277,0.0000560134,0.000003366882,0.000032733813,0.0020019575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912566,0.000048034057,0.00022773247,0.00019234238,0.0002104001,0.00019580549],"domain_scores_gemma":[0.9983358,0.0007361638,0.000109328634,0.00068286766,0.000048638714,0.00008720779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000358244,0.0001339774,0.00019397141,0.000050266306,0.00012035246,0.000036278598,0.00026204003,0.000067222274,0.0001340089],"category_scores_gemma":[0.00045941904,0.00011839301,0.00006732774,0.00015307277,0.000031851585,0.00003449,0.000051319887,0.00013614784,0.0004443905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015682994,0.00020009624,0.000022291206,0.00002834112,0.000009580294,3.319411e-7,0.00009417033,6.2387437e-7,0.00008537932,0.9390405,0.06009573,0.0004214187],"study_design_scores_gemma":[0.00036618518,0.000058585778,0.000051862284,0.000037365047,0.000014560436,0.0000015555713,0.000013002989,0.00057872845,0.0006372177,0.9726353,0.025469827,0.00013579341],"about_ca_topic_score_codex":0.000003674212,"about_ca_topic_score_gemma":0.000002377925,"teacher_disagreement_score":0.111299254,"about_ca_system_score_codex":0.000025200568,"about_ca_system_score_gemma":0.000011515403,"threshold_uncertainty_score":0.5711889},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9955547,0.00096271647,0.000027562357,0.000010199185,0.00065327116,0.000066061686,0.000004842955,0.000056890876,0.0026637982],"genre_scores_gemma":[0.999798,0.000014995594,0.00015373819,0.0000019988615,0.000002859922,0.000005071753,0.000003172569,0.000012495568,0.0000076563765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995453,0.00003580116,0.00017779002,0.000070666145,0.00008270609,0.00008778433],"domain_scores_gemma":[0.9996468,0.000052775762,0.000036750404,0.00014664425,0.00005231993,0.00006474268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013992665,0.00007865857,0.00016988983,0.00008130213,0.0000221423,0.0000064590213,0.00008437341,0.000048484802,0.0000023686823],"category_scores_gemma":[0.0000147066585,0.00008069353,0.000035573972,0.00014041277,0.0000674368,0.00007990158,0.000021049023,0.000048414317,0.0000022012011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018027647,0.00016385857,0.009120128,0.00025246784,0.00013272502,0.0000024388823,0.0045812298,0.00037136555,0.04501804,0.9376819,0.0009800737,0.0016777427],"study_design_scores_gemma":[0.0006391652,0.00015734031,0.0027369114,0.00009475684,0.000028838838,0.0000074548593,0.0009154731,0.0002676586,0.08778565,0.9068893,0.00032880242,0.00014864565],"about_ca_topic_score_codex":0.00002383275,"about_ca_topic_score_gemma":0.0000059013173,"teacher_disagreement_score":0.042767607,"about_ca_system_score_codex":0.000011604396,"about_ca_system_score_gemma":0.000006870412,"threshold_uncertainty_score":0.32905868},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907699,0.00019826487,0.0002659639,0.0001222281,0.0044873697,0.00009421851,0.0000012518922,0.00015800812,0.003902767],"genre_scores_gemma":[0.993257,0.0000037551988,0.0065106205,0.00013766761,0.000006280013,0.000007777433,0.0000015124654,0.000012334266,0.000063058695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986072,0.000065563174,0.00028482574,0.00026201532,0.00034921113,0.0004311801],"domain_scores_gemma":[0.9989248,0.00014383909,0.00015177138,0.00050208217,0.000108563916,0.0001689474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005199876,0.000154758,0.00021001064,0.00013991188,0.0001412573,0.000059345562,0.0004393431,0.00007399911,0.000004824501],"category_scores_gemma":[0.00015219631,0.00014545309,0.000096113734,0.00049513933,0.00004758171,0.00033245567,0.00020857733,0.00018239785,0.000025703072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005456417,0.00014251063,0.0061506913,0.000010193626,0.0000114918785,0.0000029873484,0.00052573584,0.0000666939,0.0033960105,0.9880996,0.00039783004,0.0011908298],"study_design_scores_gemma":[0.0011734668,0.00032690194,0.017036075,0.00010662805,0.000016338923,0.000018285496,0.000016915532,0.0070396704,0.024328668,0.94913435,0.00038743054,0.00041528436],"about_ca_topic_score_codex":0.00007892912,"about_ca_topic_score_gemma":6.0826767e-7,"teacher_disagreement_score":0.038965233,"about_ca_system_score_codex":0.000028747068,"about_ca_system_score_gemma":0.00003257238,"threshold_uncertainty_score":0.5931405},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9653391,0.000074477764,0.009543159,0.00020839222,0.0020809893,0.00010392589,0.0000012220901,0.00022010338,0.022428602],"genre_scores_gemma":[0.9945055,0.000012786742,0.0051405104,0.00018584602,0.000010143302,0.000009381939,0.0000016432468,0.000011179344,0.00012299113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986837,0.00018985092,0.0002623732,0.00032151662,0.0002674904,0.00027509817],"domain_scores_gemma":[0.9986689,0.00016534256,0.00012966675,0.0008330882,0.00009758808,0.0001054344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005143235,0.00015689024,0.0002498882,0.000096370066,0.00010450439,0.000067748944,0.0010014817,0.00007446952,0.000067121706],"category_scores_gemma":[0.00004885088,0.00014961159,0.0001801045,0.0006787668,0.00009703689,0.00025091754,0.00021555669,0.000115858835,0.00009859075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010046764,0.00009417917,0.008587205,0.000009780553,0.000024380344,0.0000012102613,0.00020334587,0.0000028135485,0.0005743644,0.98396677,0.001332182,0.0051936954],"study_design_scores_gemma":[0.00088409183,0.00008075853,0.004978316,0.000019563138,0.000009882449,0.000006257637,0.000005943104,0.0008866204,0.0035153376,0.9810231,0.008394353,0.00019582921],"about_ca_topic_score_codex":0.000020787133,"about_ca_topic_score_gemma":0.0000011508023,"teacher_disagreement_score":0.02916639,"about_ca_system_score_codex":0.000009202505,"about_ca_system_score_gemma":0.000021264103,"threshold_uncertainty_score":0.6100983},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9962066,0.000011089706,0.000022519705,0.0003193138,0.0002161721,0.00016402024,0.0000028036932,0.000034633405,0.0030228428],"genre_scores_gemma":[0.998787,0.0000033161234,0.0008694109,0.000017537131,0.0000034929058,0.000049300277,9.88718e-7,0.000014123218,0.00025486853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943584,0.000035077235,0.00014781402,0.00011187356,0.00013519466,0.00013417877],"domain_scores_gemma":[0.99866444,0.0006099237,0.000106511565,0.0005099501,0.000068891655,0.000040294683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002541799,0.000086442225,0.00012042476,0.000027985041,0.00015517182,0.000019678026,0.00027678185,0.00005440445,0.000014892832],"category_scores_gemma":[0.000105513434,0.000051694886,0.000046135145,0.00018266155,0.00022146845,0.000046132467,0.00003253991,0.0001806758,0.000008716191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015963493,0.000103697734,0.0056101736,0.000005251792,0.000025438223,2.5336564e-7,0.00015711575,7.162359e-7,0.001673262,0.99108577,0.0006839265,0.00063843984],"study_design_scores_gemma":[0.00033251903,0.000053486656,0.0037553073,0.000007676162,0.00002303081,0.0000033540748,0.00011282729,0.000022588722,0.0070591588,0.9852849,0.0032700377,0.00007511745],"about_ca_topic_score_codex":0.000010376634,"about_ca_topic_score_gemma":0.00007572608,"teacher_disagreement_score":0.005800866,"about_ca_system_score_codex":0.0000035650612,"about_ca_system_score_gemma":0.00001890441,"threshold_uncertainty_score":0.21080562},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927817,0.000119514945,0.00049849984,0.0010472274,0.000113996546,0.0001597581,0.0000027828855,0.00004566561,0.005230861],"genre_scores_gemma":[0.99798834,0.000008463235,0.0013727376,0.0001666503,0.0000019531747,0.0000061430046,6.007502e-7,0.000006453746,0.0004486592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988436,0.0001008541,0.00012840753,0.00027412805,0.00037994332,0.00027306174],"domain_scores_gemma":[0.99905264,0.00014833386,0.00007511662,0.0005496413,0.00009270149,0.0000815583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040646415,0.0001229484,0.00015895799,0.000048415946,0.00012519614,0.000072200186,0.0007316278,0.000047267127,0.000026140568],"category_scores_gemma":[0.000016618591,0.000079595906,0.000030397467,0.00035602244,0.0001523137,0.00035473885,0.00018137893,0.00023635551,0.000012659836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003026352,0.000078618075,0.008680406,0.00000571064,0.000016355052,0.00001969061,0.0005246345,0.0000025361996,0.00044043394,0.98734397,0.00036273105,0.0024946795],"study_design_scores_gemma":[0.00084163394,0.00029036356,0.08402599,0.000012834733,0.0000039142665,0.00006218593,0.00008263247,0.00021482981,0.0031675522,0.9103619,0.0007978436,0.00013831395],"about_ca_topic_score_codex":0.0000045387283,"about_ca_topic_score_gemma":0.000019921692,"teacher_disagreement_score":0.076982036,"about_ca_system_score_codex":0.000015761318,"about_ca_system_score_gemma":0.000041284584,"threshold_uncertainty_score":0.32458267},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.988396,0.0000031549546,0.000028619745,0.000045047833,0.00011762495,0.00013996131,0.0000048396273,0.000025797011,0.011238991],"genre_scores_gemma":[0.9992645,0.0000010009638,0.00058976444,0.000021472,0.0000025739528,0.000017446053,0.0000020497062,0.000015680549,0.00008551369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993226,0.000069021895,0.00021220825,0.00012199507,0.00016065594,0.00011350837],"domain_scores_gemma":[0.9988357,0.0004810831,0.0001685596,0.0004013414,0.000070741735,0.000042596377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002443932,0.00009391714,0.00021267323,0.000041514213,0.00004276498,0.000003827064,0.00017713278,0.000051107854,0.000055295735],"category_scores_gemma":[0.000111204936,0.00007676498,0.00006175998,0.0001991275,0.000102916594,0.00003704396,0.000020416257,0.00008323431,0.000017667806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007575277,0.00030533026,0.0026446425,0.000041411906,0.000038114093,1.6311037e-7,0.00018664997,0.0000010782228,0.0011185657,0.994508,0.0009826432,0.0000975958],"study_design_scores_gemma":[0.0009116965,0.00014464151,0.0015986805,0.000048200644,0.000045709003,0.0000013125947,0.000028960292,0.00001536256,0.01769739,0.9792492,0.00017381967,0.000085035135],"about_ca_topic_score_codex":0.000013231355,"about_ca_topic_score_gemma":0.000002941626,"teacher_disagreement_score":0.016578825,"about_ca_system_score_codex":0.000006651207,"about_ca_system_score_gemma":0.000015755288,"threshold_uncertainty_score":0.31303853},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97125775,0.00022106916,0.01322299,0.0015709319,0.001239648,0.000368133,7.556464e-7,0.0005619182,0.0115567865],"genre_scores_gemma":[0.9941929,0.000006007671,0.0052522672,0.00015803274,0.0000032896094,0.00006659807,0.0000029688674,0.0000065088857,0.00031143616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927634,0.000018774686,0.00013490711,0.00023442139,0.00013980822,0.00019572121],"domain_scores_gemma":[0.99916005,0.000049821952,0.00004184317,0.0006055648,0.000056425917,0.00008631675],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008415668,0.00008404764,0.00008840098,0.00005314208,0.00012288806,0.00017135186,0.00069253525,0.000037646965,0.00006884512],"category_scores_gemma":[0.000009923788,0.00008047434,0.0000511292,0.00033128986,0.000025973193,0.00037011402,0.00016865619,0.00008018522,0.0012343315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.822291e-8,0.000038312483,0.00042415093,0.0000021422088,0.0000044026438,0.0000012149612,0.00008794416,0.0000010010438,0.002291708,0.98534864,0.0048122853,0.006988093],"study_design_scores_gemma":[0.0002738967,0.000016203405,0.007011238,0.0000047134354,0.0000028332734,0.0000060588973,0.000010094645,0.012309471,0.0055337045,0.96925795,0.0054320195,0.00014182407],"about_ca_topic_score_codex":0.000054298118,"about_ca_topic_score_gemma":6.4396176e-7,"teacher_disagreement_score":0.022935122,"about_ca_system_score_codex":0.000014365003,"about_ca_system_score_gemma":0.000021568192,"threshold_uncertainty_score":0.9995433},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98951757,0.000084446656,0.00023270113,0.00013190422,0.003431675,0.00013786786,0.00000353994,0.0001895242,0.0062707434],"genre_scores_gemma":[0.9978612,0.0000177087,0.001878968,0.00017062174,8.346773e-7,0.0000041985672,0.0000038677977,0.0000070092897,0.000055578577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998959,0.000060544113,0.00028662317,0.00027359455,0.00024659414,0.00017365217],"domain_scores_gemma":[0.9990558,0.000045106517,0.00015151233,0.0005529939,0.000122029516,0.000072528106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029542527,0.00010161007,0.00013760304,0.00015496771,0.00006764287,0.000018438806,0.0004439412,0.000062696425,0.0000045577567],"category_scores_gemma":[0.00005930545,0.00009293357,0.00006095931,0.0004177764,0.000052185,0.00022477328,0.000092004775,0.000075826676,0.00004107276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029520916,0.00014692053,0.00045481432,0.0000044303333,0.000009274794,0.0000033941642,0.00050371815,0.000008990483,0.00053138856,0.9961131,0.0015456888,0.0006487557],"study_design_scores_gemma":[0.00091941486,0.00036139862,0.0029780222,0.00002272604,0.000004529699,0.0000012644012,0.000005145213,0.000648469,0.01554852,0.97930574,0.00009396026,0.00011080776],"about_ca_topic_score_codex":0.00008265893,"about_ca_topic_score_gemma":8.7780495e-7,"teacher_disagreement_score":0.01680736,"about_ca_system_score_codex":0.000008515213,"about_ca_system_score_gemma":0.00002928167,"threshold_uncertainty_score":0.3789721},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98894536,0.00007034811,0.00048482063,0.00007327117,0.0009991024,0.00012467845,0.0000014018082,0.00015510977,0.009145913],"genre_scores_gemma":[0.99307734,0.0000042766565,0.0064692697,0.00034657677,4.3542943e-7,0.000007422622,4.2753166e-7,0.000013787563,0.00008046408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893427,0.00004662649,0.000204194,0.00030180239,0.00028824626,0.00022487316],"domain_scores_gemma":[0.99898756,0.000062719715,0.00013020102,0.0005840004,0.00014578336,0.00008972535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002513189,0.00013932423,0.00018619464,0.00013639024,0.000066724526,0.00002269661,0.0005224359,0.00005924331,0.00002703992],"category_scores_gemma":[0.000021436992,0.00010725679,0.000054408185,0.0004569279,0.000094254494,0.00015176082,0.00007812009,0.00011707968,0.000046570713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000300818,0.00019477155,0.002168899,0.0000062727972,0.00002343225,0.0000045969446,0.00059421564,0.000003984423,0.0006094774,0.995306,0.0005860473,0.00047222438],"study_design_scores_gemma":[0.0009476755,0.000725616,0.00090634724,0.00005519106,0.000008586465,0.0000035728738,0.000008126381,0.00014033962,0.011786836,0.9851401,0.00011983051,0.00015777304],"about_ca_topic_score_codex":0.00017087335,"about_ca_topic_score_gemma":0.000003817843,"teacher_disagreement_score":0.011177358,"about_ca_system_score_codex":0.000006991827,"about_ca_system_score_gemma":0.000038996466,"threshold_uncertainty_score":0.4373805},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99214333,0.00088352885,0.00024006718,0.00043216822,0.0029298556,0.00010550045,7.369934e-7,0.00024845928,0.003016357],"genre_scores_gemma":[0.9876848,0.000010095855,0.012092786,0.0001236524,5.9006106e-7,0.0000041833396,8.1588826e-7,0.00000830741,0.00007477912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987912,0.000055672128,0.00028270303,0.00026787093,0.00037021158,0.00023232351],"domain_scores_gemma":[0.99872965,0.000054983106,0.00011928758,0.00060415274,0.00031102775,0.00018089147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005500849,0.00011568398,0.00018749681,0.00014515663,0.000055010056,0.00004126606,0.00064097985,0.00006267908,0.0000016270885],"category_scores_gemma":[0.00009714935,0.0001074919,0.00006389711,0.0006795434,0.000057565372,0.00020813273,0.00021053979,0.00010879739,0.00004517679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026808384,0.000092721144,0.0013517496,0.0000064737346,0.00001291973,0.0000047825506,0.0003290167,0.00007275712,0.0016998566,0.99297917,0.0029497102,0.0004981785],"study_design_scores_gemma":[0.0008602051,0.000136558,0.000093363895,0.00002584597,0.000006262525,0.00000865092,0.000023235896,0.0023503613,0.0076005277,0.98838246,0.00037836822,0.00013418164],"about_ca_topic_score_codex":0.00004902873,"about_ca_topic_score_gemma":8.240241e-7,"teacher_disagreement_score":0.011852719,"about_ca_system_score_codex":0.0000136987965,"about_ca_system_score_gemma":0.00008919988,"threshold_uncertainty_score":0.43833926},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99542636,0.000037737223,0.0014382533,0.0000105832805,0.00025550427,0.00032645086,0.0000039215993,0.00017235798,0.0023288578],"genre_scores_gemma":[0.9995747,0.000003171484,0.00024750462,0.0000065788076,0.0000037597133,0.00012248236,0.000014020787,0.000021345264,0.000006389038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945813,0.000036285015,0.00014331963,0.00012078851,0.00010638111,0.00013509014],"domain_scores_gemma":[0.9995057,0.000021866968,0.000027410511,0.0003098955,0.00005246596,0.00008264478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010432825,0.00010763873,0.00013367998,0.00009136654,0.00003557798,0.000017015696,0.00013967132,0.00004345216,0.00001258975],"category_scores_gemma":[0.0000033230024,0.00009389486,0.000025460411,0.0003491198,0.000029929333,0.00014097047,0.00001100415,0.00005539223,0.000038755505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021614485,0.000119597775,0.04923627,0.00017498014,0.00007320169,7.528166e-7,0.0010443373,0.0012133144,0.018603306,0.9176039,0.00075250363,0.011156212],"study_design_scores_gemma":[0.0012486519,0.00091724197,0.36544424,0.00015418802,0.000046429584,0.0000073920037,0.0018112588,0.0053622522,0.019632347,0.60091436,0.0036593885,0.0008022618],"about_ca_topic_score_codex":0.00011361911,"about_ca_topic_score_gemma":0.000016371163,"teacher_disagreement_score":0.31668958,"about_ca_system_score_codex":0.000010718945,"about_ca_system_score_gemma":0.0000031313607,"threshold_uncertainty_score":0.38289213},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98468864,0.00007928065,0.000037470698,0.00032584326,0.0017501222,0.0003538099,0.0000020945135,0.0002567371,0.012505994],"genre_scores_gemma":[0.996363,0.000017622924,0.0014330716,0.00017610162,0.000019080933,0.000068030786,0.0000042864713,0.000053943673,0.0018648563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986341,0.000056045163,0.0003164734,0.00030127043,0.0002801215,0.000412007],"domain_scores_gemma":[0.9988593,0.00017106098,0.000121273035,0.00057959516,0.00010623371,0.00016252435],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020466272,0.00022105672,0.0002935838,0.00009426604,0.00014590053,0.00011686518,0.00035652425,0.0001144958,0.00054594595],"category_scores_gemma":[0.00019590862,0.00020274223,0.00012795259,0.0002021188,0.00007733887,0.00028028627,0.000098830016,0.00019256139,0.0011700111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002410694,0.0001616344,0.0021992875,0.000037632482,0.00003626399,0.000004279362,0.00028580826,1.0768842e-7,0.00074172625,0.93793905,0.05755211,0.001039675],"study_design_scores_gemma":[0.00063272484,0.0000626558,0.0061794287,0.000033022334,0.000019576106,0.0000049307673,0.00006798982,0.000025353671,0.0019755126,0.98818177,0.0025594675,0.00025755737],"about_ca_topic_score_codex":0.0000833347,"about_ca_topic_score_gemma":0.0000043278164,"teacher_disagreement_score":0.054992642,"about_ca_system_score_codex":0.00003217052,"about_ca_system_score_gemma":0.000025376086,"threshold_uncertainty_score":0.9996077},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9693274,0.00011689742,0.010294196,0.00030926501,0.001033588,0.0007084433,0.0000029843436,0.00007519321,0.018132055],"genre_scores_gemma":[0.9967087,0.000020548381,0.0030474244,0.000022157592,0.000002823342,0.000018089291,7.539977e-7,0.000009999523,0.00016949506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976878,0.00072763424,0.0003064292,0.00027245312,0.0007372465,0.0002684223],"domain_scores_gemma":[0.99746954,0.0011229877,0.000121788435,0.0010014503,0.0001989625,0.00008529065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002008864,0.00013188676,0.0002529931,0.00017391842,0.00008214094,0.000020260244,0.0016580629,0.000055002904,0.00010255872],"category_scores_gemma":[0.000489661,0.000084026186,0.000091762224,0.00080256374,0.00020037229,0.00011021698,0.00036127644,0.0001980779,0.000060801627],"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.000065127744,0.0003709431,0.0005282041,0.00005676052,0.000033520515,0.000015538837,0.0010989201,0.0001160271,0.0007465876,0.9895561,0.0007401887,0.0066720955],"study_design_scores_gemma":[0.004170222,0.012401345,0.01228467,0.00017924154,0.000041053987,0.000012858215,0.00007128902,0.40630856,0.4738046,0.089948036,0.000204448,0.00057367753],"about_ca_topic_score_codex":0.000043353677,"about_ca_topic_score_gemma":2.0936172e-7,"teacher_disagreement_score":0.8996081,"about_ca_system_score_codex":0.000019787933,"about_ca_system_score_gemma":0.00007962626,"threshold_uncertainty_score":0.34264883},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98952705,0.0039595827,0.00003844036,0.000027613405,0.0034074408,0.00045141083,0.0000057606026,0.00023881509,0.002343865],"genre_scores_gemma":[0.9994009,0.00004887295,0.00008123483,0.000008719061,0.000042501197,0.000119648226,0.0000011321977,0.000077452125,0.00021952452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981739,0.00020403978,0.00047071298,0.00019302918,0.00037643564,0.00058189285],"domain_scores_gemma":[0.9982643,0.0005763769,0.00014346557,0.0007081063,0.000104818675,0.00020289725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091210287,0.0003182348,0.0004502347,0.00006773412,0.0002200299,0.00006560698,0.00044987732,0.00014363306,0.000011674321],"category_scores_gemma":[0.00006099224,0.0002264433,0.00013651776,0.00044370678,0.000094396724,0.0002135173,0.00005240586,0.00022684199,0.00005430062],"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.000261497,0.00041162816,0.01874892,0.0010567434,0.0023225362,0.000020661973,0.0035012548,0.006331777,0.069907926,0.88802975,0.009085593,0.0003217057],"study_design_scores_gemma":[0.020512719,0.00444959,0.025794895,0.0033911308,0.0044896365,0.00128041,0.01626784,0.021795541,0.539326,0.23243408,0.12043132,0.009826817],"about_ca_topic_score_codex":0.00010637074,"about_ca_topic_score_gemma":0.000014849556,"teacher_disagreement_score":0.65559566,"about_ca_system_score_codex":0.000070638736,"about_ca_system_score_gemma":0.000020459649,"threshold_uncertainty_score":0.923409},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9689793,0.000021243102,0.0066745323,0.0033487778,0.007837654,0.0003388637,0.0000048903858,0.00043513198,0.01235961],"genre_scores_gemma":[0.9973846,0.0000030346603,0.0021601596,0.00022366049,0.0000073450346,0.0000446181,0.0000023537232,0.000016004129,0.00015822552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982839,0.00014733741,0.00017238106,0.00046820834,0.0005375061,0.00039065216],"domain_scores_gemma":[0.9973749,0.0012525914,0.000035310146,0.00093617727,0.00019770997,0.0002033134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048120634,0.00016083392,0.00014176167,0.00029248913,0.00030510328,0.00013703894,0.0008100598,0.00011375434,0.00004085185],"category_scores_gemma":[0.0014157445,0.00015527934,0.00008006624,0.0006337572,0.00021093703,0.0004461258,0.0001535302,0.000691863,0.0004276781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018486367,0.0002721051,0.000054086297,0.0000038897433,0.0000051310617,0.000017580673,0.00007005258,0.0000090034655,0.0024442223,0.99136114,0.00062541064,0.0051189093],"study_design_scores_gemma":[0.00048207978,0.0003674278,0.0025962333,0.000020421818,0.0000024383685,0.000011538926,0.0000043003047,0.0025336184,0.003719497,0.98978156,0.00030907962,0.00017180336],"about_ca_topic_score_codex":0.0000055230553,"about_ca_topic_score_gemma":0.000003203553,"teacher_disagreement_score":0.028405301,"about_ca_system_score_codex":0.0000442642,"about_ca_system_score_gemma":0.00005132956,"threshold_uncertainty_score":0.6332108},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.989875,0.00020468327,0.0023881418,0.00013556633,0.0022828674,0.0002172403,0.0000025069887,0.00016277055,0.0047312006],"genre_scores_gemma":[0.97968197,0.000005086724,0.020045582,0.00020388032,3.4700818e-7,0.000008201345,8.220864e-7,0.000010033487,0.000044102708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991056,0.00002431624,0.00022117715,0.00026723993,0.00016830159,0.00021338875],"domain_scores_gemma":[0.99907213,0.00010414631,0.00010497449,0.0004956115,0.0001581968,0.000064922795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031033257,0.000105551975,0.0001590179,0.000106582214,0.000071391776,0.000019414014,0.0004804206,0.00005081461,0.000011353404],"category_scores_gemma":[0.00006834202,0.000094903364,0.000077662735,0.00024023016,0.000044224475,0.00013561167,0.0000881148,0.0000727268,0.00003043813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000986618,0.00016492225,0.00033965323,0.000009143553,0.000011724422,0.0000017961635,0.0004093624,0.000005690723,0.0012208121,0.9961989,0.0010422918,0.00058584166],"study_design_scores_gemma":[0.00071627804,0.00030635262,0.0004716261,0.00003657877,0.0000050552967,0.0000015141719,0.0000082878705,0.0012849118,0.020282833,0.9766926,0.00007598659,0.00011797174],"about_ca_topic_score_codex":0.000019178216,"about_ca_topic_score_gemma":2.4133914e-7,"teacher_disagreement_score":0.01950629,"about_ca_system_score_codex":0.000008039313,"about_ca_system_score_gemma":0.000028160857,"threshold_uncertainty_score":0.38700467},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9868706,0.00015199541,0.0055911914,0.00083132193,0.001989169,0.00025961405,0.000002539783,0.00031363397,0.003989919],"genre_scores_gemma":[0.997793,0.000011118,0.0018161066,0.000099053665,0.000003896076,0.000021051928,0.0000030944404,0.000018416984,0.0002342154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979227,0.00034320305,0.00025136233,0.00048410043,0.0004247486,0.0005738506],"domain_scores_gemma":[0.99764395,0.00059502135,0.0000696242,0.0014109357,0.00010810521,0.00017235205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007228953,0.00018674588,0.00024682793,0.0003674931,0.0000996749,0.00008491086,0.0022162201,0.00010138311,0.000020904487],"category_scores_gemma":[0.0007806523,0.00018276993,0.00007657126,0.001414976,0.00011898847,0.0006232591,0.00058257417,0.00033368595,0.00005352279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061085693,0.000076802644,0.01298279,0.0000067384435,0.0000073168485,0.000008981602,0.00024553147,0.0000125783245,0.00036109882,0.983867,0.0008321511,0.0015928879],"study_design_scores_gemma":[0.0011085237,0.00012082741,0.020726021,0.000018535173,0.0000013031748,0.000003129054,0.00001989662,0.0015372036,0.002300466,0.9720578,0.0018899428,0.00021632842],"about_ca_topic_score_codex":0.000057442572,"about_ca_topic_score_gemma":0.00003137553,"teacher_disagreement_score":0.011809191,"about_ca_system_score_codex":0.000062517,"about_ca_system_score_gemma":0.000044156877,"threshold_uncertainty_score":0.7453141},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97292227,0.00003945561,0.00052205636,0.00019112763,0.00028869405,0.00021049127,0.000006443229,0.000075546086,0.025743896],"genre_scores_gemma":[0.986332,0.0000025140994,0.01316951,0.000011115189,0.000006046171,0.000021549487,0.0000025290544,0.000018027557,0.00043669422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992483,0.000020240946,0.00026910126,0.00011211948,0.00020892307,0.00014125973],"domain_scores_gemma":[0.9990945,0.00022976867,0.00016061842,0.00032709586,0.00009734087,0.00009070058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004049374,0.00008780092,0.00019760255,0.000060263574,0.000040386498,0.000014189939,0.00018374098,0.00004794332,0.00003025351],"category_scores_gemma":[0.00034865612,0.00008105864,0.000048383743,0.00019611556,0.00002690498,0.000046362205,0.00005843137,0.00007153932,0.000035931716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020409514,0.000110785906,0.00030993254,0.000048940754,0.000015507147,0.0000010182122,0.0006683923,0.000001096442,0.00038229986,0.9591549,0.03923626,0.000068811234],"study_design_scores_gemma":[0.00038774425,0.000031791715,0.000019500456,0.000044675406,0.00002045295,0.000004149563,0.0002691024,0.0005233603,0.0027239206,0.9928254,0.0030572626,0.000092660775],"about_ca_topic_score_codex":0.000008052938,"about_ca_topic_score_gemma":0.000001246875,"teacher_disagreement_score":0.036178995,"about_ca_system_score_codex":0.000029306835,"about_ca_system_score_gemma":0.000039590115,"threshold_uncertainty_score":0.33054757},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85014534,0.0003084821,0.12475494,0.009404477,0.007239451,0.0007349394,0.000012176075,0.0013211654,0.00607904],"genre_scores_gemma":[0.981889,0.0000035363857,0.017108634,0.0004854053,0.000024459428,0.000013063066,0.000011139647,0.000008288971,0.0004564805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891055,0.00006472079,0.0001985588,0.00034654647,0.00017023474,0.00030940093],"domain_scores_gemma":[0.9990238,0.00017515273,0.000073299925,0.00050016865,0.00011673113,0.00011084241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035903498,0.0001328733,0.00016185259,0.000073253024,0.0002955989,0.00015163157,0.0005484364,0.00005322324,0.00001635165],"category_scores_gemma":[0.00012844156,0.00012733738,0.00008248696,0.00033590873,0.000026249189,0.0003165362,0.00006332889,0.00017053075,0.000068689376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004224494,0.0001105423,0.00029269993,0.000007063348,0.000007980578,0.000004280217,0.00025298225,0.00011183326,0.0005785421,0.97813493,0.002770633,0.01772426],"study_design_scores_gemma":[0.0004849398,0.00031441968,0.010034878,0.000017516133,0.000006637426,0.000009866074,0.000009858229,0.025773963,0.00040246575,0.9565905,0.006160997,0.00019397866],"about_ca_topic_score_codex":0.000018511857,"about_ca_topic_score_gemma":0.0000012741041,"teacher_disagreement_score":0.13174367,"about_ca_system_score_codex":0.000030404808,"about_ca_system_score_gemma":0.000050274517,"threshold_uncertainty_score":0.5192668},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99098665,0.00005324992,0.0033169787,0.00024125002,0.00038447874,0.0010344189,0.000010212798,0.00009566631,0.0038771154],"genre_scores_gemma":[0.9964882,0.0000014267206,0.0022584405,0.00009065385,0.000042155072,0.0006829135,0.000009656138,0.000033156204,0.00039339464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990256,0.000100400066,0.00019482641,0.00018088565,0.00015802846,0.00034026444],"domain_scores_gemma":[0.9987877,0.0005019196,0.00009159448,0.0004648321,0.000031875123,0.00012205621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062148436,0.00016959466,0.00020998485,0.000053559117,0.0003460991,0.00004749418,0.00034249166,0.00006420026,0.000011363078],"category_scores_gemma":[0.000092242226,0.000109609915,0.000107994565,0.00016688203,0.000036702542,0.00008777793,0.00007680004,0.00014489256,0.0000202721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022139,0.0004433494,0.00196007,0.000035279812,0.000038775026,3.4154727e-8,0.003936927,0.0000019380323,0.00041012574,0.99171925,0.001131526,0.0003006179],"study_design_scores_gemma":[0.0004992261,0.000040768045,0.004366066,0.000017899447,0.000080566984,0.0000036385452,0.0008061907,0.000079048965,0.0008751039,0.99109995,0.0019603923,0.00017113694],"about_ca_topic_score_codex":0.000006459132,"about_ca_topic_score_gemma":0.000005908127,"teacher_disagreement_score":0.0055015744,"about_ca_system_score_codex":0.000026953265,"about_ca_system_score_gemma":0.000010138783,"threshold_uncertainty_score":0.44697627},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99529487,0.00013671735,0.00019710566,0.0007107753,0.0013760389,0.00019373176,0.0000014451213,0.0001883836,0.0019009287],"genre_scores_gemma":[0.99586195,0.0000103869315,0.003457274,0.0005458154,4.1975798e-7,0.000020058602,0.0000018802181,0.000010560853,0.00009165233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863875,0.000059575716,0.00032742185,0.00033606464,0.00034332724,0.0002948906],"domain_scores_gemma":[0.9986064,0.00015791086,0.0001448819,0.0007237749,0.00023618634,0.0001308401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024210323,0.00015049826,0.00022119362,0.00018689247,0.00010223214,0.00007661436,0.0006796224,0.00006178397,0.000038674327],"category_scores_gemma":[0.000059442005,0.00013207577,0.00008719991,0.0006168696,0.0000852708,0.00026640066,0.00015890524,0.00013776944,0.00046632107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001886397,0.00011654586,0.00052526,0.000009139498,0.000014163016,0.0000014240389,0.00012169402,0.000027339116,0.0075157806,0.9848744,0.0059554237,0.000836901],"study_design_scores_gemma":[0.00058982597,0.00023237854,0.0011217525,0.000043149324,0.0000041323005,0.00000199502,0.000005098405,0.005028592,0.0045256084,0.9880538,0.00024043127,0.0001532417],"about_ca_topic_score_codex":0.00013751235,"about_ca_topic_score_gemma":7.0877195e-7,"teacher_disagreement_score":0.0057149925,"about_ca_system_score_codex":0.000010114575,"about_ca_system_score_gemma":0.000024604686,"threshold_uncertainty_score":0.599377},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9635049,0.00005590883,0.000010332985,0.00031746464,0.0010412066,0.00037368323,0.0000036176002,0.000035120094,0.034657773],"genre_scores_gemma":[0.99804646,0.000007204003,0.0004114389,0.000019141795,0.0000046937403,0.0000310534,4.6046995e-7,0.000021576932,0.0014579628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870104,0.00034196512,0.00021103541,0.00011277519,0.0004091822,0.0002240213],"domain_scores_gemma":[0.997626,0.0011484803,0.00011793628,0.00088658277,0.0001815764,0.000039387836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014712949,0.000086858076,0.0001175967,0.00002164349,0.00039652197,0.000027932056,0.00072577415,0.000055734126,0.00014763657],"category_scores_gemma":[0.0015220945,0.00004845217,0.000093990806,0.0003102619,0.00033022065,0.000054832963,0.00022015651,0.00021470859,0.00009075062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000151323175,0.0000994667,0.0013729332,0.000012430099,0.000028240847,4.427048e-7,0.0017453455,1.7859789e-7,0.00014587211,0.9920884,0.0041801026,0.00031150546],"study_design_scores_gemma":[0.00028671854,0.000057177484,0.0043602334,0.000016381511,0.00002117482,0.0000015505696,0.0002174741,0.00013278813,0.0034875607,0.99020433,0.0011573298,0.000057273846],"about_ca_topic_score_codex":0.000023061013,"about_ca_topic_score_gemma":0.000012016204,"teacher_disagreement_score":0.034541573,"about_ca_system_score_codex":0.000031170435,"about_ca_system_score_gemma":0.00009551576,"threshold_uncertainty_score":0.30497664},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9905374,0.00017298038,0.0002735803,0.0025632996,0.00080593297,0.0005134438,8.243461e-7,0.00014449892,0.004988034],"genre_scores_gemma":[0.9986942,0.00006021271,0.0003919594,0.00046392213,0.000004656061,0.0001330879,8.580535e-7,0.000018538884,0.00023257233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979033,0.00032203348,0.0002441458,0.000464903,0.0004901598,0.0005754819],"domain_scores_gemma":[0.9978256,0.0006695259,0.00007016948,0.0012335846,0.000079617035,0.00012145293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000619609,0.00019325543,0.00018438826,0.00027391562,0.00018896666,0.00019106321,0.0018717266,0.0000759137,0.000051766307],"category_scores_gemma":[0.00014119217,0.0001395126,0.00008440935,0.0011786368,0.00017466542,0.0005465921,0.00029449238,0.00045067046,0.0006603394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052490523,0.000099544704,0.002312679,0.0000033613253,0.0000074664995,0.000011415982,0.00029290433,0.0000160758,0.0010704893,0.9918096,0.0014411116,0.0029300768],"study_design_scores_gemma":[0.00038430732,0.00011457806,0.0205097,0.0000270845,8.649747e-7,0.0000030175165,0.0000541481,0.0019913604,0.0037905138,0.9724896,0.00046349037,0.0001713597],"about_ca_topic_score_codex":0.00012946605,"about_ca_topic_score_gemma":0.000016250166,"teacher_disagreement_score":0.01932005,"about_ca_system_score_codex":0.00006581978,"about_ca_system_score_gemma":0.000040266164,"threshold_uncertainty_score":0.84875476},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9790031,0.000093590344,0.00018136237,0.00010756956,0.0006907724,0.0001799286,0.0000018413525,0.00010423117,0.019637631],"genre_scores_gemma":[0.9998251,0.000005881882,0.000055264303,0.000048279726,0.0000042253673,0.000038735318,0.0000016718511,0.000007932138,0.000012864449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944645,0.000050466286,0.00015065314,0.00009130657,0.00010725094,0.00015389646],"domain_scores_gemma":[0.9995684,0.00010381964,0.000009800497,0.00027611142,0.00001695074,0.000024888966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021806218,0.0000782197,0.0000994636,0.00003330041,0.000036603837,0.000016942853,0.00021941769,0.000045769368,0.00017365241],"category_scores_gemma":[0.000052917952,0.000063076455,0.00004436747,0.00015842685,0.000034647375,0.00007910066,0.000012329107,0.00013063566,0.000079458834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012643067,0.00025569295,0.017215474,0.000028287535,0.000028003002,0.0000041134344,0.008604796,0.000101648366,0.00021394494,0.96887684,0.00043579098,0.0042227423],"study_design_scores_gemma":[0.0005546292,0.00003415309,0.16628852,0.0000065180957,0.000010222336,8.6850986e-7,0.0004013862,0.0024372763,0.00034596655,0.8295039,0.00030328898,0.000113279675],"about_ca_topic_score_codex":0.00007166916,"about_ca_topic_score_gemma":0.000094187206,"teacher_disagreement_score":0.14907305,"about_ca_system_score_codex":0.000025432324,"about_ca_system_score_gemma":0.000008366767,"threshold_uncertainty_score":0.2572183},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.995669,0.00033423892,0.00016211992,0.00049107836,0.0013703734,0.00014131772,4.5281033e-7,0.00017443851,0.0016569567],"genre_scores_gemma":[0.9896698,0.000015694703,0.0099944975,0.00020021884,4.7372393e-7,0.000012758296,0.0000010555078,0.000009266626,0.00009623106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885684,0.000050052004,0.00028034442,0.00027650676,0.0002785582,0.00025769335],"domain_scores_gemma":[0.9988553,0.00008765088,0.00008145921,0.00061243447,0.0002541685,0.000108980705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026569757,0.00011986903,0.00017977135,0.00013570108,0.00008413038,0.00006922281,0.00062395807,0.00006180665,0.000038402253],"category_scores_gemma":[0.000041243264,0.00010588107,0.000076604476,0.0005283727,0.00006117292,0.0003796557,0.00018106592,0.000111502806,0.00016226716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.1747185e-7,0.00006758957,0.0018118849,0.000008954943,0.000013503034,0.0000011941689,0.00037462512,0.000009372065,0.011247528,0.9830742,0.0021575466,0.0012331114],"study_design_scores_gemma":[0.00041718024,0.00006918029,0.0006647081,0.000024962992,0.0000044345534,0.0000028523823,0.000027380729,0.0017718051,0.011624172,0.9851528,0.000106150364,0.00013441757],"about_ca_topic_score_codex":0.00024299412,"about_ca_topic_score_gemma":0.0000017545079,"teacher_disagreement_score":0.009832378,"about_ca_system_score_codex":0.000008172962,"about_ca_system_score_gemma":0.000029563187,"threshold_uncertainty_score":0.43177044},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92791104,0.0000991199,0.06272,0.00044062294,0.0005390204,0.00039984335,0.0000011994657,0.00013638545,0.007752746],"genre_scores_gemma":[0.99665666,0.00001879032,0.0031989953,0.000040252122,0.0000010614649,0.000030181667,0.0000011325884,0.0000054936477,0.00004742407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998998,0.00008010996,0.00021147175,0.0001710895,0.00030340822,0.00023593259],"domain_scores_gemma":[0.99908453,0.00010012461,0.00006346215,0.00048826385,0.00018516266,0.000078446225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026995837,0.00008516553,0.00012968041,0.00014172492,0.00007049014,0.00004130126,0.00076803274,0.0000444359,0.000032524924],"category_scores_gemma":[0.000033778775,0.000079210105,0.00006532174,0.0006129999,0.00008619294,0.0010760009,0.00009087087,0.00012592757,0.000095469004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021838855,0.000049157745,0.00031591416,0.000013590432,0.0000073440547,4.965337e-7,0.0003695806,0.000014488244,0.002697241,0.9902589,0.00015803965,0.006113091],"study_design_scores_gemma":[0.0003516097,0.00008231784,0.004500927,0.00000994539,0.0000011932084,0.0000019119054,0.000023563296,0.0029163184,0.022203293,0.96971,0.000114082184,0.00008484151],"about_ca_topic_score_codex":0.000041311687,"about_ca_topic_score_gemma":0.0000011230808,"teacher_disagreement_score":0.06874561,"about_ca_system_score_codex":0.000020578542,"about_ca_system_score_gemma":0.000029766788,"threshold_uncertainty_score":0.32300943},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98914176,0.00013349632,0.0061499965,0.0003344924,0.0018823303,0.00041599275,0.00003041148,0.00014738546,0.001764121],"genre_scores_gemma":[0.98919076,0.000008129095,0.010499563,0.0001491521,0.000008614202,0.000005822041,0.000039900413,0.000006625969,0.00009142256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882704,0.000072270595,0.000263722,0.00043471882,0.00018147046,0.0002207773],"domain_scores_gemma":[0.99889296,0.00025098657,0.000096523196,0.0004094692,0.00021148937,0.0001385411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005708524,0.00013553882,0.00015971571,0.00009274655,0.00018424474,0.0000802473,0.00030537913,0.000061285864,0.000004314125],"category_scores_gemma":[0.00018673843,0.00013298086,0.000041535608,0.00034082294,0.0000383244,0.000393926,0.000064299355,0.00008402948,0.000015165099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023239647,0.00027080983,0.0013029627,0.000030457742,0.000035289133,0.000013851274,0.0017471028,0.000049209764,0.00033269016,0.9782431,0.011192502,0.006549626],"study_design_scores_gemma":[0.0023671736,0.0008303469,0.038592424,0.000015210058,0.000015090854,0.000022978275,0.00004536553,0.019944984,0.0051322337,0.9288699,0.0038405883,0.00032370546],"about_ca_topic_score_codex":0.000044584984,"about_ca_topic_score_gemma":0.00000820632,"teacher_disagreement_score":0.049373202,"about_ca_system_score_codex":0.000036453173,"about_ca_system_score_gemma":0.000088605295,"threshold_uncertainty_score":0.5422802},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9620661,0.00008735247,0.00076480425,0.0000020629016,0.0009941774,0.00020213045,0.0000098795645,0.00055704266,0.03531644],"genre_scores_gemma":[0.99969393,0.0000028335203,0.00008655863,0.000019785584,0.0000134801985,0.00004336123,0.0000111201525,0.000059525486,0.00006943094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990587,0.000054697437,0.00018817894,0.00018389878,0.0001559559,0.00035854263],"domain_scores_gemma":[0.9993741,0.000053886273,0.0000393455,0.00037124363,0.000038788072,0.0001226518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018103514,0.00020486035,0.00020674591,0.00008851307,0.000098196804,0.0000320812,0.00022953047,0.00007590627,0.0004130434],"category_scores_gemma":[0.000010363578,0.00018517267,0.000052121715,0.00027216645,0.000047729827,0.00018395473,0.00002468588,0.00018609628,0.00011659106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007182046,0.00012458747,0.06403383,0.0001126729,0.00026075292,0.00011688284,0.0031842848,0.00068458746,0.0015671487,0.922939,0.0057398602,0.0011645538],"study_design_scores_gemma":[0.0031299095,0.00042213683,0.028210972,0.00019396556,0.0000668461,0.000066154746,0.00097322284,0.0036324244,0.016891833,0.9362774,0.00888151,0.0012536476],"about_ca_topic_score_codex":0.000053490952,"about_ca_topic_score_gemma":0.00002712298,"teacher_disagreement_score":0.037627798,"about_ca_system_score_codex":0.000035161625,"about_ca_system_score_gemma":0.00001328313,"threshold_uncertainty_score":0.75511223},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99182737,0.0001012446,0.00007571409,0.000072141134,0.0002122762,0.0001267411,0.000007201672,0.000035394547,0.007541936],"genre_scores_gemma":[0.99863386,0.000019511463,0.0011463377,0.000017336608,0.0000058894384,0.000018567755,0.000002122591,0.000012081006,0.00014429542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946433,0.000040968273,0.00015908168,0.0000899992,0.000076833174,0.00016877905],"domain_scores_gemma":[0.9993971,0.00018732488,0.000079492704,0.00023671964,0.000024160863,0.00007518986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024680656,0.000081817176,0.00014245702,0.000019922105,0.000058779257,0.000006130368,0.00008842993,0.000045966684,0.00005113724],"category_scores_gemma":[0.000045250254,0.00007666497,0.000046381512,0.00014080247,0.00010318823,0.00009510763,0.00002369831,0.00008473373,0.000012387687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000618189,0.00016644146,0.037369717,0.00002994597,0.000015472813,2.1099457e-7,0.0003490013,1.3928079e-8,0.00033436934,0.960718,0.0009506265,0.000060069808],"study_design_scores_gemma":[0.00025543463,0.000011781016,0.009828232,0.000012753433,0.000021291567,0.0000058286687,0.000051119943,0.000002061367,0.004618795,0.9838465,0.0012616271,0.00008461802],"about_ca_topic_score_codex":0.0000036451163,"about_ca_topic_score_gemma":0.0000010969475,"teacher_disagreement_score":0.027541483,"about_ca_system_score_codex":0.0000075052044,"about_ca_system_score_gemma":0.000005856491,"threshold_uncertainty_score":0.31263068},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9716634,0.000054778546,0.00008187332,0.000036865775,0.0018284927,0.000105359235,0.0000019119686,0.00008611423,0.026141204],"genre_scores_gemma":[0.9998236,0.000005424176,0.0000046569594,0.000058525948,0.000009378243,0.000016496573,0.0000015927451,0.000016219183,0.00006412536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994649,0.00007102213,0.00013993615,0.000074256066,0.00012152427,0.0001283607],"domain_scores_gemma":[0.9994136,0.00022912961,0.000026313468,0.00028591556,0.000017462764,0.000027545544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030536193,0.000089349625,0.0001145267,0.000035182908,0.00004735821,0.000011250037,0.00017911731,0.000039261176,0.000041980504],"category_scores_gemma":[0.000039485283,0.000065741944,0.000048942242,0.000117049975,0.000025001036,0.000033005963,0.000014628645,0.000089066445,0.00010410273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052353043,0.000022702869,0.00072890765,0.000030666695,0.000035453435,4.6164686e-7,0.00019667218,0.0005136926,0.00061444147,0.9955255,0.0018936824,0.0004326137],"study_design_scores_gemma":[0.000931616,0.00018036709,0.0047801384,0.000119674856,0.000023595974,0.0000012029373,0.00013191707,0.008214017,0.014056487,0.95527166,0.016036037,0.00025325696],"about_ca_topic_score_codex":0.0000028451966,"about_ca_topic_score_gemma":8.5435175e-7,"teacher_disagreement_score":0.04025378,"about_ca_system_score_codex":0.000009131992,"about_ca_system_score_gemma":0.0000015557105,"threshold_uncertainty_score":0.26808786},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6444088,0.002771734,0.3435093,0.0002797616,0.00537892,0.0006576301,0.000033105734,0.00027708034,0.0026836577],"genre_scores_gemma":[0.924913,0.0000074298587,0.07484995,0.000025260022,0.000021266353,0.000047137986,0.0000039867414,0.0000077331115,0.00012426976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928933,0.00003189332,0.00017706087,0.00024175651,0.000096217525,0.00016375782],"domain_scores_gemma":[0.9993364,0.0001242774,0.00008651116,0.00022065833,0.000111907924,0.0001202331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034059412,0.0000899687,0.00015059853,0.000035966063,0.00022930063,0.00014679003,0.0000844208,0.000032966185,1.268499e-7],"category_scores_gemma":[0.00012238088,0.00008540295,0.000012702158,0.00010068873,0.00006980753,0.0005816342,0.00014324333,0.000051020717,0.000001319349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016719638,0.0000043497953,0.0011858206,0.000032702606,0.000006637732,0.0000014442211,0.00037461086,0.000006559525,0.00006367568,0.99656135,0.0004436208,0.0013175292],"study_design_scores_gemma":[0.004634885,0.0005494847,0.0008517178,0.0003278318,0.000035003653,0.00081616064,0.0051992894,0.11149574,0.0006368891,0.6009952,0.2734793,0.0009784707],"about_ca_topic_score_codex":0.000048575494,"about_ca_topic_score_gemma":0.0000030201393,"teacher_disagreement_score":0.39556617,"about_ca_system_score_codex":0.00002176067,"about_ca_system_score_gemma":0.00005254671,"threshold_uncertainty_score":0.34826314},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9806034,0.000012919527,0.000009208854,0.00028942878,0.00027213703,0.00035848346,0.0000063222346,0.00003451569,0.018413564],"genre_scores_gemma":[0.9995123,0.0000083115965,0.00013275196,0.000114668015,0.0000017580185,0.00006324026,7.693986e-7,0.000015634461,0.00015057655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991341,0.00014828998,0.00022511421,0.00016132485,0.00019160648,0.00013956212],"domain_scores_gemma":[0.99846834,0.0006403484,0.00017422797,0.0006071196,0.000074562944,0.000035407564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005052236,0.00012368504,0.00014331107,0.000029889534,0.00023723413,0.000011880892,0.00032856077,0.00006397432,0.0001494066],"category_scores_gemma":[0.00023124518,0.00006905042,0.00009638942,0.00027580862,0.0002486269,0.000047755937,0.00007486603,0.00015393515,0.000019347124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011701545,0.00016686207,0.0022510649,0.0000142945955,0.000028010076,3.3640836e-7,0.0010518078,3.6072546e-8,0.00032748145,0.99477917,0.0012474381,0.00012181436],"study_design_scores_gemma":[0.00028027242,0.000021128182,0.010358139,0.00003292216,0.00004176795,0.000008464541,0.00016784908,0.000010296098,0.006164608,0.9827405,0.00008881982,0.00008521706],"about_ca_topic_score_codex":0.000018749904,"about_ca_topic_score_gemma":0.0000031288346,"teacher_disagreement_score":0.01890887,"about_ca_system_score_codex":0.00001031877,"about_ca_system_score_gemma":0.000014259294,"threshold_uncertainty_score":0.28157943},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.978158,0.00007601924,0.0097545395,0.00045927183,0.003204381,0.000108842854,0.0000011015921,0.0001567611,0.008081076],"genre_scores_gemma":[0.98573846,0.000005669152,0.014045205,0.00009365555,0.000006787311,0.0000061714354,0.0000010258216,0.00000550236,0.000097503915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992672,0.000018265699,0.0001724054,0.00019616635,0.00017672061,0.00016922396],"domain_scores_gemma":[0.99903727,0.00015994687,0.00010287502,0.0005335981,0.00010062488,0.00006569158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013308531,0.00008217432,0.00012280334,0.00015373976,0.00007742239,0.000031947664,0.00069168577,0.000056112603,0.000022218206],"category_scores_gemma":[0.00016085262,0.00007536305,0.000043768086,0.001052705,0.00005264859,0.0003568577,0.00015470268,0.00017674478,0.000049315837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.364744e-7,0.00006391219,0.0021852818,0.00000439538,0.0000047218264,0.0000019280687,0.00006645193,0.000005298926,0.0033918766,0.9893973,0.00014894936,0.00472946],"study_design_scores_gemma":[0.00029787785,0.00005601408,0.014489519,0.000004016748,0.000003860711,0.0000052692913,0.000006568276,0.0017198189,0.0060458677,0.97477144,0.002477969,0.00012176913],"about_ca_topic_score_codex":0.000008422075,"about_ca_topic_score_gemma":0.0000025971804,"teacher_disagreement_score":0.014625839,"about_ca_system_score_codex":0.000007688405,"about_ca_system_score_gemma":0.00003944199,"threshold_uncertainty_score":0.3073216},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9905625,0.00011829224,0.0045378474,0.000558105,0.0017870232,0.00019194279,0.0000019153001,0.00022668428,0.0020156829],"genre_scores_gemma":[0.9935906,0.000010141459,0.005891571,0.0001366065,0.00000998942,0.000016587219,0.0000012917128,0.000020207539,0.00032304093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818134,0.00009351048,0.00019890226,0.0005352921,0.00048045523,0.00051051273],"domain_scores_gemma":[0.9985885,0.00025612733,0.00008913629,0.00070299505,0.00009574968,0.00026747107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066195085,0.00019025075,0.00020064028,0.00013635421,0.0003051633,0.00022171736,0.0010045993,0.00010647699,0.000030303263],"category_scores_gemma":[0.00014201053,0.00018651609,0.00005097194,0.0003121463,0.0001766302,0.0006756237,0.0007197188,0.0006910678,0.000047946338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007725988,0.000038459613,0.003925279,0.0000074129334,0.000011486244,0.00004047269,0.0011206915,0.0000020212117,0.0130385,0.9726264,0.000063807754,0.009117727],"study_design_scores_gemma":[0.0009541037,0.00010184652,0.0074700895,0.000017015473,0.0000035761825,0.000085497,0.000095345735,0.007058652,0.0038625475,0.9789563,0.0010837759,0.00031124387],"about_ca_topic_score_codex":0.000028011984,"about_ca_topic_score_gemma":0.000017168906,"teacher_disagreement_score":0.009175953,"about_ca_system_score_codex":0.000028070514,"about_ca_system_score_gemma":0.00007130027,"threshold_uncertainty_score":0.7605905},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7259833,0.0006311177,0.21238576,0.001412252,0.021086369,0.00050024525,0.000009692991,0.00088329555,0.03710795],"genre_scores_gemma":[0.99159485,0.000005260011,0.007907655,0.00026233515,0.000039362192,0.000010548172,0.00000938562,0.0000072152807,0.0001634087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990653,0.000046549518,0.0001266467,0.0002059547,0.00026614923,0.00028940052],"domain_scores_gemma":[0.99918497,0.00004866246,0.000056301553,0.00054482115,0.000034704794,0.00013053116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021065281,0.00010979617,0.000098564706,0.000051763618,0.00013611525,0.000090217174,0.00047833912,0.000054158394,0.000019157853],"category_scores_gemma":[0.000019397294,0.00009510851,0.000035728022,0.00018112188,0.000015231089,0.0009785792,0.00018365266,0.00011575312,0.00053343456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045749944,0.00014967275,0.00087616924,0.0000020069176,0.000005126222,0.000002026207,0.00018748657,0.000007846347,0.00023720034,0.9789487,0.011150294,0.008428856],"study_design_scores_gemma":[0.00227748,0.0007058517,0.059071496,0.00007863486,0.000020064284,0.00004357217,0.000037459373,0.05907676,0.01708534,0.662428,0.19806936,0.0011059642],"about_ca_topic_score_codex":0.000008449518,"about_ca_topic_score_gemma":1.13574984e-7,"teacher_disagreement_score":0.31652072,"about_ca_system_score_codex":0.0000367741,"about_ca_system_score_gemma":0.000019158497,"threshold_uncertainty_score":0.68564004},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9771583,0.00010967493,0.018211275,0.00017674585,0.0009307334,0.00008861122,0.000001574128,0.000102160695,0.003220922],"genre_scores_gemma":[0.9991402,0.000006583709,0.00070711295,0.00009139407,0.0000037366099,0.0000037754921,7.535362e-7,0.0000044309145,0.00004202795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999209,0.00008461009,0.00015411756,0.00023358654,0.00016318419,0.00015551066],"domain_scores_gemma":[0.99922407,0.00012743763,0.00007488275,0.0004705678,0.000033627402,0.00006942006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046000513,0.000087495115,0.00015709079,0.000033605895,0.00005589254,0.000033554566,0.00040131347,0.000042863005,0.0000080930195],"category_scores_gemma":[0.00005977058,0.00007717032,0.000030166575,0.000120560995,0.00006844172,0.00021054488,0.00024446606,0.00005988589,0.0000067793567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026939047,0.00007056808,0.0024037445,0.000014445652,0.0000074102704,6.106485e-7,0.0002701333,5.430015e-7,0.0005491459,0.9800156,0.00036431284,0.016300796],"study_design_scores_gemma":[0.0005281099,0.00009989793,0.025253927,0.000016842268,0.0000035439107,0.000002783648,0.000021411794,0.020958256,0.009883075,0.94226384,0.00085300487,0.000115281764],"about_ca_topic_score_codex":0.000015362326,"about_ca_topic_score_gemma":4.0598044e-7,"teacher_disagreement_score":0.03775173,"about_ca_system_score_codex":0.00000675216,"about_ca_system_score_gemma":0.000013567854,"threshold_uncertainty_score":0.31469145},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98052186,0.00021812783,0.009722108,0.00043709434,0.005059646,0.00067502394,0.0000067821343,0.00017264938,0.0031867025],"genre_scores_gemma":[0.99709874,0.00003428212,0.002472552,0.00014245928,0.000008009028,0.000061936866,0.0000036558747,0.000029451827,0.00014891331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720806,0.00017017203,0.0004325873,0.00058379356,0.0008275952,0.0007778032],"domain_scores_gemma":[0.99651754,0.0005269967,0.00020716323,0.0021261605,0.00037374292,0.00024839715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011243385,0.00028088386,0.0003369018,0.00024641512,0.00039128328,0.000121362216,0.0032093402,0.00013576986,0.000056616867],"category_scores_gemma":[0.00015542214,0.0002106553,0.00021289127,0.0016715444,0.00048299338,0.0006738722,0.0007599244,0.00073831977,0.00007916282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028645114,0.00016893451,0.004384425,0.000024552442,0.000047816284,0.000009171619,0.0005154685,0.000010895722,0.013322416,0.97336453,0.0011812486,0.0069419243],"study_design_scores_gemma":[0.0008601207,0.00017610224,0.0047657546,0.000014128275,0.000012238665,0.0000127752,0.00005640571,0.003880911,0.027070347,0.9603938,0.002496855,0.00026056846],"about_ca_topic_score_codex":0.00017001893,"about_ca_topic_score_gemma":0.00011350691,"teacher_disagreement_score":0.016576873,"about_ca_system_score_codex":0.000028892757,"about_ca_system_score_gemma":0.00013705582,"threshold_uncertainty_score":0.8590274},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9478271,0.000120884775,0.00004785787,0.00007535335,0.0018389324,0.000120586235,0.0000036458307,0.00038218955,0.04958344],"genre_scores_gemma":[0.999578,0.000009803833,0.000026400914,0.000084809464,0.0000054782836,0.000007291312,0.0000038468543,0.000016097933,0.00026825521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992933,0.00004380811,0.00015277146,0.00015019331,0.00013900202,0.00022088086],"domain_scores_gemma":[0.99952364,0.000082387895,0.00002303512,0.0002754374,0.000018777373,0.000076722456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010464866,0.0001586711,0.00016676847,0.00006220023,0.00006643307,0.000022033331,0.0001600966,0.000094631156,0.00002008216],"category_scores_gemma":[0.000022007694,0.00014994643,0.0000600286,0.00018079783,0.000020396565,0.00008675608,0.000007660884,0.0002248659,0.00022495302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011110139,0.000038127233,0.00013110528,0.000008079945,0.000014711752,0.000010674982,0.00057569053,0.00017259477,0.0016003539,0.99362236,0.0007803702,0.0030348338],"study_design_scores_gemma":[0.00047443368,0.00019275103,0.012421989,0.000063678526,0.000009091837,0.0000038721723,0.00002893088,0.0011706755,0.0036554802,0.98064286,0.0010982327,0.00023798503],"about_ca_topic_score_codex":0.000001407872,"about_ca_topic_score_gemma":5.128564e-7,"teacher_disagreement_score":0.051750902,"about_ca_system_score_codex":0.000045266246,"about_ca_system_score_gemma":0.0000051526445,"threshold_uncertainty_score":0.6114638},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7796956,0.0001106726,0.020275958,0.0009171336,0.0011085323,0.00048387062,0.000045625562,0.0001969705,0.19716568],"genre_scores_gemma":[0.99668074,6.761492e-7,0.0026225094,0.00005041165,0.000031702097,0.000063055595,0.000016414178,0.000013711317,0.00052077783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933213,0.000018335662,0.0001622053,0.00016241123,0.0001285018,0.00019641477],"domain_scores_gemma":[0.99937165,0.000053327763,0.00006191454,0.00027977087,0.00006955526,0.00016376286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010492797,0.00011006093,0.00015250561,0.000018086384,0.000110478584,0.000040071573,0.0001838989,0.000020799418,0.00020884935],"category_scores_gemma":[0.000013528784,0.00009729718,0.000049482376,0.0001743764,0.00009672065,0.00010488401,0.00007124195,0.0000984477,0.00036789567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020629002,0.000059731563,0.0007988685,0.000002588576,0.000010969116,5.217915e-7,0.00014152272,0.000010163172,0.00008672654,0.99622184,0.0009169025,0.001748085],"study_design_scores_gemma":[0.00034867864,0.000024963443,0.000047268037,0.000007258838,0.000008135567,7.1310404e-7,0.00037878673,0.000106396605,0.00054060546,0.97054595,0.02786819,0.0001230376],"about_ca_topic_score_codex":0.000039840346,"about_ca_topic_score_gemma":2.7148144e-7,"teacher_disagreement_score":0.2169852,"about_ca_system_score_codex":0.000025187559,"about_ca_system_score_gemma":0.00005162139,"threshold_uncertainty_score":0.47286773},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97963154,0.00015661327,0.0061110766,0.00007067997,0.0012920878,0.00036849373,0.0000056891595,0.0002242522,0.012139572],"genre_scores_gemma":[0.98791385,0.000013230129,0.011909944,0.000034147433,0.0000035186815,0.000022393486,0.0000014010852,0.00001626675,0.00008526072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998001,0.0002108193,0.00034193214,0.0005156969,0.0004698991,0.00046065252],"domain_scores_gemma":[0.9979266,0.00016467745,0.00013641952,0.0013717924,0.00019666042,0.0002038842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075713143,0.00018961454,0.00030464964,0.00019146233,0.00011329358,0.00002615612,0.0017596042,0.00009095291,0.000047901714],"category_scores_gemma":[0.00016327125,0.00017997251,0.00012576087,0.0007747611,0.000374151,0.0005397826,0.0003182102,0.00028973148,0.000052547894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042203686,0.00023139514,0.07055273,0.000019055675,0.00002426513,0.000008256774,0.00061851245,4.778293e-7,0.0005441064,0.92555517,0.00016725929,0.0022365793],"study_design_scores_gemma":[0.00059450686,0.00019364001,0.055511966,0.0000148725385,0.0000045120137,0.0000061415176,0.000031326395,0.0001242517,0.011488639,0.931695,0.0001538001,0.00018134699],"about_ca_topic_score_codex":0.00006981678,"about_ca_topic_score_gemma":0.000006731892,"teacher_disagreement_score":0.015040763,"about_ca_system_score_codex":0.000041762098,"about_ca_system_score_gemma":0.0000849242,"threshold_uncertainty_score":0.73390657},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92201436,0.00004181753,1.7416262e-7,0.0000218002,0.0012797979,0.00007333719,0.000023580762,0.00005858888,0.07648653],"genre_scores_gemma":[0.99699265,0.000008661183,0.00007294432,0.000031258107,0.0000397039,0.0000070029714,0.000010986973,0.00001939268,0.0028174082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991485,0.000046321074,0.0002873494,0.00016060122,0.00017094378,0.00018627719],"domain_scores_gemma":[0.9994063,0.000016128424,0.0001320969,0.00024873298,0.00014624886,0.00005052556],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011521246,0.00013377299,0.00027756835,0.000028722328,0.000117350886,0.00006713308,0.00020148135,0.000043697837,0.013915043],"category_scores_gemma":[0.000014989749,0.00010868005,0.000119002885,0.000047188783,0.00015954593,0.00024180027,0.00006594999,0.00005785956,0.00049180567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021070418,0.00015668252,0.0030918038,0.00003529934,0.000092312795,0.000012289172,0.023549866,3.1048764e-8,0.001820063,0.9690915,0.0018853381,0.0002437406],"study_design_scores_gemma":[0.0023153354,0.0004939795,0.036098134,0.00017452256,0.00043541935,0.000021430886,0.008227751,0.000035351026,0.03240375,0.86332303,0.055239253,0.0012320224],"about_ca_topic_score_codex":0.0021778622,"about_ca_topic_score_gemma":0.00015495751,"teacher_disagreement_score":0.10576845,"about_ca_system_score_codex":0.000017201708,"about_ca_system_score_gemma":0.000014545428,"threshold_uncertainty_score":0.9869864},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9956402,0.00015893653,0.000013252808,0.000019712717,0.00080550794,0.00025409288,0.00009462507,0.000049548817,0.0029640766],"genre_scores_gemma":[0.99945426,0.0000091938855,0.00034512405,0.000010479552,0.000005312822,0.0000096844615,0.000015420133,0.000042652115,0.00010784826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979864,0.00024022207,0.0004968898,0.00015886189,0.0005356506,0.00058199384],"domain_scores_gemma":[0.99766845,0.0010501741,0.0002633187,0.0006633364,0.00018218986,0.00017252944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013139705,0.00018452878,0.0004763447,0.00021474413,0.00006237213,0.000008230659,0.00038842217,0.00011527897,0.00032356614],"category_scores_gemma":[0.0006098358,0.00016611008,0.00016777142,0.00050523836,0.00016192821,0.00019066602,0.0002055189,0.00020953099,0.00004227633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027854654,0.0006139332,0.12621582,0.00020541901,0.0000780509,9.3795785e-7,0.0015522355,7.041977e-8,0.0043069217,0.8650221,0.0019591996,0.000017469787],"study_design_scores_gemma":[0.0009978322,0.00015573604,0.01938426,0.00006321336,0.00004295771,0.0000018614329,0.0003289518,0.000031247397,0.023924991,0.95386386,0.0010194307,0.00018565592],"about_ca_topic_score_codex":0.00001751893,"about_ca_topic_score_gemma":0.0000035989156,"teacher_disagreement_score":0.10683155,"about_ca_system_score_codex":0.000030873867,"about_ca_system_score_gemma":0.000028313672,"threshold_uncertainty_score":0.6773773},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933004,0.00013883453,0.000023878154,0.00005099691,0.0010162322,0.00038055427,0.000022833998,0.000036513982,0.005029786],"genre_scores_gemma":[0.99902236,0.0000076087995,0.00077608536,0.000015672897,0.000007325348,0.000015771555,0.0000021758149,0.00004261379,0.00011036722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973356,0.00038741776,0.0007374785,0.0002195659,0.0010096567,0.0003102662],"domain_scores_gemma":[0.99682295,0.00094270695,0.0006163711,0.00096272863,0.0005473329,0.00010790274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002089473,0.00018461063,0.0005272443,0.00017507699,0.000047459016,0.0000094531215,0.0009711313,0.0001175424,0.00001788186],"category_scores_gemma":[0.0017121037,0.00014285713,0.0002031435,0.0006904069,0.00039443703,0.000109326684,0.00043684544,0.00029853187,0.0000063410266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000603156,0.00033838698,0.009519334,0.00022409706,0.00008872618,0.000004088579,0.0023777394,0.000004369368,0.011427791,0.97484356,0.00097039057,0.00014118776],"study_design_scores_gemma":[0.0015299482,0.00024789193,0.0036155484,0.00016906972,0.00004053989,0.00000572294,0.00083870604,0.00031354977,0.021238688,0.9718463,0.000028511371,0.00012555017],"about_ca_topic_score_codex":0.00021257979,"about_ca_topic_score_gemma":0.0000098422615,"teacher_disagreement_score":0.0098108975,"about_ca_system_score_codex":0.00006278723,"about_ca_system_score_gemma":0.0001404802,"threshold_uncertainty_score":0.58255446},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97065127,0.000078395395,0.0099843005,0.000054083015,0.00064949755,0.00033584927,0.000004437443,0.00022226409,0.018019885],"genre_scores_gemma":[0.9874279,0.000013886239,0.012342576,0.000045012363,0.0000025784118,0.00003093703,0.0000011883382,0.000024319676,0.00011159515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784523,0.00019877545,0.00026559635,0.00056415715,0.00059202843,0.00053422636],"domain_scores_gemma":[0.9970842,0.00023988319,0.00017869684,0.0020392663,0.00026829343,0.00018966403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005713393,0.00023069176,0.00034384872,0.00021050335,0.00017202344,0.000047914426,0.0022282724,0.00008941794,0.000028119406],"category_scores_gemma":[0.00010753565,0.00020140204,0.000107802975,0.0012559396,0.00045067669,0.00081660267,0.00048166467,0.00032119153,0.000021679636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009056097,0.00027472546,0.024105664,0.00001839627,0.00005794929,0.000037040096,0.0012111694,0.0000015839612,0.00016903793,0.9731303,0.00015002555,0.00075357186],"study_design_scores_gemma":[0.0013458715,0.00047509774,0.02042344,0.00002725346,0.000008104942,0.000017271386,0.000044538454,0.00015125412,0.00925683,0.9678474,0.0001507588,0.00025220166],"about_ca_topic_score_codex":0.00016744454,"about_ca_topic_score_gemma":0.00009439521,"teacher_disagreement_score":0.01790829,"about_ca_system_score_codex":0.000047049365,"about_ca_system_score_gemma":0.00011331883,"threshold_uncertainty_score":0.82129365},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98240453,0.00022570942,0.009011501,0.00068015826,0.00093897263,0.0003456727,6.31321e-7,0.0001238834,0.0062689665],"genre_scores_gemma":[0.98816603,0.000014905477,0.011240631,0.00004773238,0.000002629319,0.00002567698,3.8304202e-7,0.000009290939,0.00049271743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879205,0.00009624398,0.00020024735,0.00023965031,0.000381481,0.0002903306],"domain_scores_gemma":[0.9986916,0.000119837445,0.00008450184,0.00079693575,0.00019141071,0.00011572117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029134008,0.00009626791,0.0001562879,0.000119286415,0.000061405764,0.000049164566,0.0011555918,0.00004608552,0.000060102906],"category_scores_gemma":[0.000084191655,0.000089491004,0.00006012573,0.0004901893,0.00008885288,0.00061185996,0.00035827627,0.00012871643,0.00008436947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001726356,0.000060460057,0.00069381914,0.0000064089295,0.000012722437,0.000004034381,0.00008362031,0.0000029203486,0.0031577558,0.9864752,0.0014010591,0.0081002675],"study_design_scores_gemma":[0.00034044991,0.00010001047,0.002291649,0.000011909699,0.0000012425241,0.0000037829213,0.000018138937,0.0005641206,0.015206813,0.98088664,0.0004823484,0.000092921],"about_ca_topic_score_codex":0.00002022724,"about_ca_topic_score_gemma":2.2437142e-7,"teacher_disagreement_score":0.012049057,"about_ca_system_score_codex":0.000033783763,"about_ca_system_score_gemma":0.00002918984,"threshold_uncertainty_score":0.36493373},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902558,0.000572692,0.000755755,0.0008111629,0.0010321524,0.0010066662,0.000018104609,0.00010852304,0.005439179],"genre_scores_gemma":[0.99701905,0.000011328555,0.0022007267,0.00008239337,0.000026497833,0.00042316693,0.0000028032896,0.000026165284,0.00020784483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990718,0.00006751594,0.00022603168,0.00014313233,0.00013813957,0.00035342592],"domain_scores_gemma":[0.9976682,0.001409515,0.00008026564,0.00073176646,0.000043493063,0.00006676042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009041855,0.00013481901,0.00016233054,0.000068171816,0.0001931698,0.000022699498,0.0004900527,0.00007415829,0.000034422214],"category_scores_gemma":[0.00038281994,0.00009887034,0.00012194686,0.00028359776,0.00008816391,0.00012423651,0.00009075618,0.00013837205,0.00002055474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001734932,0.00026190613,0.0024471935,0.000021511854,0.00002422738,2.781999e-7,0.0006988852,2.3597204e-7,0.0001072334,0.98912513,0.006259487,0.001036559],"study_design_scores_gemma":[0.0008221375,0.000025968084,0.0049702185,0.000015639276,0.000046962454,0.0000033560095,0.0003392401,0.0000228399,0.000561136,0.9901945,0.0028705809,0.00012741034],"about_ca_topic_score_codex":0.000012336676,"about_ca_topic_score_gemma":0.00001603287,"teacher_disagreement_score":0.006763309,"about_ca_system_score_codex":0.000020294441,"about_ca_system_score_gemma":0.000013646113,"threshold_uncertainty_score":0.40318155},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6740043,0.000008245452,0.0040426836,0.00022144469,0.00023727697,0.00029196462,0.00001567155,0.00002761262,0.3211508],"genre_scores_gemma":[0.9992221,5.500113e-7,0.00039160132,0.00003196975,0.000006939852,0.000048215847,0.000002595738,0.000008541216,0.0002874772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995645,0.000016346374,0.00013708713,0.000095321215,0.000076318895,0.00011041234],"domain_scores_gemma":[0.99937725,0.0002117291,0.000069921,0.00027340624,0.00003471188,0.000033007065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008734395,0.00006772481,0.0001070396,0.000007858002,0.000071458926,0.0000044116705,0.00016493797,0.00001627412,0.00076133106],"category_scores_gemma":[0.000015914999,0.000046219895,0.000059616963,0.000102514685,0.00007030665,0.00002977176,0.000034272965,0.00008857822,0.00007899387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009228286,0.00016854661,0.00021257563,0.000002172766,0.000014692017,6.536076e-8,0.00016031317,3.4273182e-7,0.000039390976,0.9976534,0.00063446857,0.0011047868],"study_design_scores_gemma":[0.00017045344,0.000034596273,0.00017255002,0.000009344743,0.000007908688,7.031156e-8,0.0002244033,0.000010718594,0.008285935,0.9901405,0.00088902714,0.000054518758],"about_ca_topic_score_codex":0.000018361168,"about_ca_topic_score_gemma":1.2629589e-7,"teacher_disagreement_score":0.3252178,"about_ca_system_score_codex":0.0000049752452,"about_ca_system_score_gemma":0.000009759504,"threshold_uncertainty_score":0.8336041},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942747,0.000021539337,0.00016920977,0.00010073559,0.00009923003,0.00047337293,0.0000045852767,0.00009763179,0.004759004],"genre_scores_gemma":[0.9989115,0.000003894179,0.00078340556,0.000033327215,0.0000022855318,0.00011655281,0.0000027377953,0.000028723047,0.00011758235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990577,0.00008360251,0.00023036455,0.00022293192,0.00019101586,0.00021434824],"domain_scores_gemma":[0.99856496,0.0004898479,0.00018667958,0.0005475535,0.00012538812,0.00008558613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028326781,0.0001679862,0.00028867615,0.0000913609,0.00012960871,0.000025003821,0.0002498488,0.00008541837,0.000113776936],"category_scores_gemma":[0.000052922474,0.00013681398,0.00008591006,0.00041086593,0.0001597205,0.0001676417,0.000056780722,0.00019944926,0.000042694282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009669666,0.00027670187,0.01596013,0.000041904845,0.00005774013,7.689544e-7,0.00031137883,4.679793e-7,0.0012214292,0.98104477,0.000760838,0.0003142108],"study_design_scores_gemma":[0.000686294,0.000100705525,0.0122251455,0.000038508744,0.000036461108,0.0000072041034,0.00018352129,0.00004585875,0.0048927935,0.9815,0.00011536242,0.0001680907],"about_ca_topic_score_codex":0.00012343943,"about_ca_topic_score_gemma":0.000014720384,"teacher_disagreement_score":0.0046414216,"about_ca_system_score_codex":0.000017257553,"about_ca_system_score_gemma":0.000027423612,"threshold_uncertainty_score":0.5579112},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8823443,0.000019896675,0.00003326523,0.00007319083,0.0012316008,0.00006364599,0.000003863084,0.00002866662,0.11620157],"genre_scores_gemma":[0.99886507,0.0000020450407,0.00017612825,0.00017599092,0.0000029202492,0.000004383871,9.704993e-7,0.00000714024,0.00076534384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855804,0.00012783495,0.00036259452,0.00021826538,0.0005960736,0.0001371875],"domain_scores_gemma":[0.9978431,0.0011485541,0.00014407904,0.00061461766,0.00018015137,0.00006951207],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010812617,0.00008092059,0.0001759686,0.00016524742,0.000085448984,0.000019715742,0.00060875306,0.000059831207,0.001337285],"category_scores_gemma":[0.002398719,0.00006211381,0.000084367086,0.00051413017,0.00012866216,0.00014527471,0.00007268631,0.000093398325,0.0007833567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026898122,0.00014077342,0.0026422828,0.0000010026431,0.000006863704,0.0000023847092,0.0009322316,0.0000010763001,0.00014920761,0.9888452,0.006049032,0.0012030253],"study_design_scores_gemma":[0.00025821634,0.0001350562,0.022259887,0.0000066192506,0.0000032825803,7.3198385e-7,0.00018836306,0.00000970652,0.004648164,0.97183704,0.0005841245,0.00006877478],"about_ca_topic_score_codex":0.000013679911,"about_ca_topic_score_gemma":0.0000017239181,"teacher_disagreement_score":0.116520785,"about_ca_system_score_codex":0.000010959578,"about_ca_system_score_gemma":0.000035936417,"threshold_uncertainty_score":0.99999464},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9882258,0.00002258556,0.00064526085,0.00032072948,0.00014160469,0.00026813315,0.000033246353,0.0000710448,0.010271597],"genre_scores_gemma":[0.9993198,1.3276387e-7,0.00021586141,0.000043247375,0.00007301265,0.0000064611295,0.000104960425,0.000027249656,0.00020929534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986285,0.00008663843,0.00027405724,0.0003517178,0.00036711732,0.00029197749],"domain_scores_gemma":[0.9988131,0.0003121772,0.0001439667,0.00024841758,0.0001363969,0.0003459557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002145739,0.0002326681,0.0002878858,0.00010797438,0.00017957498,0.00011226373,0.00022710153,0.000070060014,0.000011150669],"category_scores_gemma":[0.000024791418,0.00018556563,0.000044760236,0.0004583519,0.00011132954,0.0002584734,0.000110827845,0.00026110306,0.000055263445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011737183,0.00007716675,0.11976401,0.0000051006728,0.0000614685,0.0000017359423,0.0013602967,0.0007347954,0.000008588805,0.8766908,0.00012972168,0.0010489329],"study_design_scores_gemma":[0.0014804632,0.00027317082,0.14259447,0.000027543309,0.00005018628,5.236209e-7,0.00032484037,0.00042361088,0.00022401621,0.8542802,0.000058788642,0.00026222834],"about_ca_topic_score_codex":0.00016835968,"about_ca_topic_score_gemma":0.000003913581,"teacher_disagreement_score":0.022830464,"about_ca_system_score_codex":0.000043646298,"about_ca_system_score_gemma":0.0000990097,"threshold_uncertainty_score":0.7567147},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9603216,0.000026120362,0.00054079987,0.00040067182,0.0010994306,0.00019185325,0.0000073352153,0.00008757688,0.03732462],"genre_scores_gemma":[0.9955471,0.0000021704286,0.0036484266,0.0002152557,0.0000061085975,0.000008629782,0.0000017063617,0.000018066448,0.0005525063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930316,0.000048403257,0.00017740429,0.00013320752,0.00015772332,0.00018009199],"domain_scores_gemma":[0.99909294,0.00028415376,0.0000678806,0.00034123377,0.0000901128,0.00012366405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030477604,0.00010659024,0.00021535743,0.00009399676,0.00003763959,0.0000027601402,0.0001827538,0.000091208654,0.000018485001],"category_scores_gemma":[0.00050892675,0.00009413282,0.000058945534,0.0001917034,0.00007225225,0.000045266876,0.00004042684,0.00012382364,0.00010577131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009675777,0.00015581997,0.00014181768,0.000011838101,0.00001545609,0.000007247033,0.0011540719,0.0000089608375,0.0001673481,0.99526685,0.0025254695,0.00044833135],"study_design_scores_gemma":[0.00074473,0.00033015967,0.00006953814,0.00002219437,0.000014935466,0.000003991489,0.00019342902,0.000011002773,0.0039116004,0.99238634,0.0022076948,0.000104403494],"about_ca_topic_score_codex":0.000006047623,"about_ca_topic_score_gemma":0.0000075026996,"teacher_disagreement_score":0.036772113,"about_ca_system_score_codex":0.000030426721,"about_ca_system_score_gemma":0.00003262709,"threshold_uncertainty_score":0.3838625},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81625223,0.00006003214,0.0017442198,0.0012734997,0.0004139106,0.0005678142,0.000019716283,0.0000984407,0.17957017],"genre_scores_gemma":[0.9963315,0.0000034085276,0.0015430135,0.00006394835,0.00004106742,0.00017121687,0.000017061091,0.000029514213,0.0017992547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989715,0.000023738405,0.00023452354,0.00028795548,0.0001323435,0.00034990048],"domain_scores_gemma":[0.99918103,0.00011075253,0.000089081055,0.00033872572,0.00004594653,0.00023448249],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000064106745,0.00020169478,0.0002289076,0.000025577143,0.0002260617,0.00010087636,0.00017110462,0.0000685907,0.0013822699],"category_scores_gemma":[0.000008980131,0.00017818862,0.000071655384,0.00014849755,0.00014550025,0.00022941665,0.00009499414,0.00024453073,0.00044288771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001926511,0.000106865,0.0031413687,0.000008855716,0.00002679527,6.6544754e-7,0.00015681246,0.0000012450978,0.00017738828,0.99186194,0.0010357314,0.0034804174],"study_design_scores_gemma":[0.00047412224,0.000027922886,0.0026306366,0.000016726306,0.000017995511,0.0000023679415,0.00068045786,0.00012401016,0.0005329757,0.9904744,0.0047904784,0.00022791425],"about_ca_topic_score_codex":0.0001303892,"about_ca_topic_score_gemma":7.507039e-7,"teacher_disagreement_score":0.18007931,"about_ca_system_score_codex":0.00001789297,"about_ca_system_score_gemma":0.000018900835,"threshold_uncertainty_score":0.9995306},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9745639,0.00040039574,0.022479894,0.00023789375,0.0013028329,0.00014130438,0.000004034452,0.000070861264,0.0007988597],"genre_scores_gemma":[0.9806512,0.0000054556317,0.01911379,0.00014350172,0.000010090087,0.000007914766,0.000013068268,0.0000061126957,0.00004888753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991591,0.00005067776,0.00014682711,0.00015805599,0.00026926675,0.00021610386],"domain_scores_gemma":[0.999349,0.0000810759,0.00008318696,0.00029554503,0.00009106452,0.00010011515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002140319,0.00009725153,0.00012374778,0.00008953707,0.000044552336,0.000025367786,0.00027260484,0.000036892216,0.0000047920303],"category_scores_gemma":[0.000015790969,0.00008184516,0.000040889987,0.00042828952,0.000030143581,0.00036097458,0.000048296966,0.00006007159,0.000011743606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009177403,0.00014315612,0.003794003,0.000009231074,0.000036793142,0.0000025644838,0.00032075643,0.000071693335,0.0009505854,0.9912124,0.0012791405,0.0021704512],"study_design_scores_gemma":[0.0027715454,0.00084666285,0.081324235,0.000060253435,0.00006757418,0.00009550616,0.00005593779,0.0059545925,0.041863374,0.8431746,0.023010977,0.0007747671],"about_ca_topic_score_codex":0.000009255607,"about_ca_topic_score_gemma":9.222315e-7,"teacher_disagreement_score":0.14803788,"about_ca_system_score_codex":0.000015737303,"about_ca_system_score_gemma":0.000025909343,"threshold_uncertainty_score":0.3337549},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93554014,0.00007408466,0.0000011217439,0.00038226348,0.0031365082,0.00019320929,0.000033950782,0.00008344632,0.06055528],"genre_scores_gemma":[0.9934174,0.0000013353556,0.00008538429,0.000085791384,0.0001611955,0.000025422616,0.000035600595,0.00002161237,0.006166263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867654,0.00007462382,0.0003872541,0.00031529262,0.00029434514,0.00025197509],"domain_scores_gemma":[0.998645,0.00004904431,0.00020021948,0.00051384274,0.0004482296,0.00014364088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019603626,0.00018398714,0.0003241948,0.00011042022,0.00029307796,0.00011605521,0.0003800878,0.00009947665,0.00090521615],"category_scores_gemma":[0.000097991375,0.00014419683,0.00013721257,0.00011654772,0.00035520524,0.00057640526,0.000049104798,0.0003585136,0.00003805097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026791975,0.00036903683,0.00049475883,0.000018019056,0.00007973597,0.0000044456688,0.0342362,2.4886072e-7,0.0026878035,0.9561507,0.0050523076,0.0008799704],"study_design_scores_gemma":[0.001111501,0.00053373165,0.0013450569,0.000035804736,0.00016334698,0.0000028005286,0.0026900524,0.00014397352,0.0046938295,0.6256461,0.36307934,0.00055443466],"about_ca_topic_score_codex":0.0012393434,"about_ca_topic_score_gemma":0.000722624,"teacher_disagreement_score":0.358027,"about_ca_system_score_codex":0.00005022586,"about_ca_system_score_gemma":0.00004945299,"threshold_uncertainty_score":0.99114823},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12447496,0.0001980737,0.0000020580703,0.0029338107,0.004944574,0.00007566073,0.0000030523402,0.000150842,0.86721694],"genre_scores_gemma":[0.9718698,0.000005524577,0.000008828714,0.0009332875,0.000082522776,0.0000020431312,0.0000017957182,0.0000044736107,0.027091712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992911,0.000018216962,0.0001304131,0.0001567612,0.00021238285,0.00019107842],"domain_scores_gemma":[0.9996146,0.000024328978,0.000036561352,0.00018343952,0.00005831892,0.00008276439],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009804294,0.000087246764,0.0001090633,0.000050072453,0.0004094579,0.00012775953,0.00024227051,0.000025094807,0.00093362044],"category_scores_gemma":[0.00002761634,0.00007833814,0.00005886463,0.00005360932,0.0001430396,0.00032763145,0.000015776832,0.0001022976,0.0004927743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025665254,0.00005128059,0.000008935617,0.0000013669144,0.0000019623835,0.00000596393,0.0032521042,3.386852e-7,0.00002616459,0.933945,0.06214994,0.00055439415],"study_design_scores_gemma":[0.00012349343,0.000086180946,0.00008872857,0.000003545173,0.0000034383627,8.3643914e-7,0.00007510327,0.0000074986065,0.000025276313,0.73307836,0.26641813,0.000089378154],"about_ca_topic_score_codex":0.000028375354,"about_ca_topic_score_gemma":0.0000067019473,"teacher_disagreement_score":0.8473949,"about_ca_system_score_codex":0.000047156118,"about_ca_system_score_gemma":0.000018741184,"threshold_uncertainty_score":0.9999797},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85682726,0.00009124719,0.13513201,0.0005782541,0.0053328103,0.0004739091,0.0000033359577,0.000110972986,0.0014502136],"genre_scores_gemma":[0.9970931,0.0000053455906,0.0026141803,0.00012368486,0.000015906691,0.0000350093,0.0000013276795,0.000010096866,0.00010134893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889165,0.00014024321,0.00027596383,0.0003205215,0.00014888734,0.00022271834],"domain_scores_gemma":[0.99810123,0.0009263496,0.00015164331,0.00039962973,0.00034416493,0.000077004646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000638609,0.00013628745,0.00030782085,0.000053164233,0.00013961602,0.00006642244,0.00032378762,0.000080191785,0.000006198461],"category_scores_gemma":[0.00027015858,0.00012477697,0.00006600147,0.00030628085,0.000057255344,0.0001748589,0.00012396286,0.00008470274,0.0000032567239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014576893,0.0000845853,0.0012540751,0.000040624836,0.000027085898,3.6395707e-7,0.00023552318,0.00002630892,0.0007712531,0.99401987,0.0018107282,0.0017150053],"study_design_scores_gemma":[0.0037242905,0.0008669603,0.010248409,0.00009367886,0.000019957815,0.000020350906,0.00006250159,0.15870589,0.0029950086,0.8093736,0.013426044,0.0004632775],"about_ca_topic_score_codex":0.00007742172,"about_ca_topic_score_gemma":0.00001995518,"teacher_disagreement_score":0.18464623,"about_ca_system_score_codex":0.000017355318,"about_ca_system_score_gemma":0.000026432284,"threshold_uncertainty_score":0.5088257},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9967992,0.000035859794,0.00012223265,0.000044304456,0.00039544218,0.00016358492,0.0000123376285,0.000049788847,0.0023772847],"genre_scores_gemma":[0.99901736,0.000009140285,0.00067766226,0.000041296968,0.00000456436,0.0000625401,0.000007286585,0.000023155659,0.00015701438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892807,0.00010737983,0.00041003685,0.00017750038,0.00020249156,0.00017450746],"domain_scores_gemma":[0.9985833,0.00037523624,0.00027262486,0.00059256837,0.000105092244,0.000071170325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040531435,0.00013656709,0.00032467922,0.00011885489,0.000065386586,0.000007299147,0.00030790726,0.00009856358,0.000043269934],"category_scores_gemma":[0.00010934696,0.000131264,0.00013506795,0.0002876197,0.00014206686,0.00008635975,0.000061902494,0.00009292508,0.000008927036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008708089,0.0005131526,0.001400303,0.000052828702,0.000031017313,6.2992643e-7,0.00011352799,5.618837e-7,0.005019448,0.9920856,0.0005451869,0.00022903598],"study_design_scores_gemma":[0.0005552091,0.000102218604,0.0017308267,0.000036765105,0.0001080209,0.0000024979613,0.00003235822,0.00002818437,0.019888386,0.977046,0.00034303273,0.00012650416],"about_ca_topic_score_codex":0.000023125507,"about_ca_topic_score_gemma":0.000004866488,"teacher_disagreement_score":0.015039602,"about_ca_system_score_codex":0.000009643328,"about_ca_system_score_gemma":0.00002337935,"threshold_uncertainty_score":0.53527904},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9230112,0.00004131197,0.000077009376,0.000014306385,0.0033955886,0.00005279215,6.652716e-7,0.00033005574,0.073077075],"genre_scores_gemma":[0.99977106,0.0000021906578,0.000007047899,0.000048803595,0.0000120480945,0.000010633084,0.000001844091,0.000021479495,0.00012491077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954236,0.000034155964,0.000095748925,0.000089505884,0.0000880097,0.00015023969],"domain_scores_gemma":[0.9996196,0.00007417789,0.000010372868,0.00023296503,0.000009477919,0.00005337786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015881643,0.00009175921,0.00010421534,0.0000411704,0.00003897398,0.00001692554,0.00011692426,0.000051674495,0.0000400586],"category_scores_gemma":[0.000019712812,0.000088862274,0.00003956915,0.00009475867,0.000013540705,0.000040537798,0.000008064696,0.00009570923,0.0005016167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026104453,0.000012599344,0.00015595776,0.000014287366,0.000010527462,0.0000010351586,0.00006222185,0.0002987247,0.00042070975,0.99467796,0.0036862127,0.0006571412],"study_design_scores_gemma":[0.00039158616,0.00007492921,0.00084039633,0.00002379266,0.0000044257945,0.0000021688923,0.000017581837,0.0025236607,0.0023314161,0.98349726,0.010136657,0.00015614979],"about_ca_topic_score_codex":0.0000013657766,"about_ca_topic_score_gemma":4.6496854e-7,"teacher_disagreement_score":0.076759845,"about_ca_system_score_codex":0.000015354693,"about_ca_system_score_gemma":0.0000013761273,"threshold_uncertainty_score":0.6447435},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98421943,0.000014876018,0.00024747627,0.00022870093,0.00023999158,0.00028699488,0.0000026211635,0.00015291333,0.014606965],"genre_scores_gemma":[0.99927896,0.0000063986695,0.00023223896,0.00017432788,0.0000058470505,0.00006842933,0.000004767357,0.000034110402,0.00019489106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989126,0.00011771789,0.00020280489,0.00026422148,0.00024197741,0.00026070004],"domain_scores_gemma":[0.99861,0.00046546763,0.00011457115,0.0006489357,0.000047504112,0.00011353026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038839836,0.00018076101,0.00022858538,0.00010593324,0.00020614221,0.000034636476,0.00029500652,0.0000764806,0.00006240118],"category_scores_gemma":[0.000082889506,0.00014164802,0.000071797855,0.00034106546,0.000110277164,0.000072864044,0.000035569272,0.00021687386,0.00011664428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005998323,0.00025889478,0.0014713036,0.000018561985,0.000037237493,0.000002211541,0.00012816305,0.0000019060715,0.00010461145,0.9962799,0.00073356874,0.00090365787],"study_design_scores_gemma":[0.0018591969,0.0002072771,0.001820449,0.00004832185,0.00004992031,0.0000055442974,0.00004397558,0.00013112932,0.001073749,0.99193287,0.0026299988,0.00019754184],"about_ca_topic_score_codex":0.000009450035,"about_ca_topic_score_gemma":0.000008887413,"teacher_disagreement_score":0.015059529,"about_ca_system_score_codex":0.000019580628,"about_ca_system_score_gemma":0.000018046452,"threshold_uncertainty_score":0.5776239},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97718084,0.000018192717,0.000021486741,0.0006324921,0.0002648689,0.00019002939,0.0000032574067,0.000049848306,0.021638984],"genre_scores_gemma":[0.9988205,0.0000055615315,0.000103641716,0.00025273702,0.0000020838288,0.00012400701,0.0000017420484,0.000013729749,0.0006760342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993715,0.000069386275,0.00017365853,0.0001138487,0.00014012276,0.00013143725],"domain_scores_gemma":[0.9985232,0.0007671148,0.0000980636,0.00050247257,0.00007053852,0.000038629456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018647229,0.00009378439,0.00012391532,0.00004282666,0.00011331481,0.000015535315,0.00027320406,0.000049785067,0.00030877758],"category_scores_gemma":[0.000088862136,0.000062629064,0.00008258208,0.00023934485,0.000094235096,0.000046216348,0.000033403605,0.00009383562,0.000104744824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027059784,0.00014273629,0.00007684656,0.0000064299975,0.000020861098,1.5866712e-7,0.0000935609,2.0410913e-7,0.0004359866,0.9660035,0.03305882,0.00015822143],"study_design_scores_gemma":[0.00016493576,0.000038454316,0.00029023533,0.000014830492,0.00001262957,6.4037954e-7,0.000075408294,0.000017653208,0.0035761145,0.9944679,0.001269937,0.00007127533],"about_ca_topic_score_codex":0.000023316934,"about_ca_topic_score_gemma":0.0000022549652,"teacher_disagreement_score":0.031788882,"about_ca_system_score_codex":0.0000064031715,"about_ca_system_score_gemma":0.000009044313,"threshold_uncertainty_score":0.3380898},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9642347,0.00062428083,0.00001651757,0.0003538623,0.003367813,0.00028236798,0.0000015381661,0.0002324268,0.030886464],"genre_scores_gemma":[0.99937314,0.000052352916,0.0000071977997,0.000069676105,0.000029885961,0.00004783731,0.0000010653105,0.00003559172,0.0003832685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989957,0.00012886463,0.0001980669,0.0001600235,0.00022503383,0.00029226457],"domain_scores_gemma":[0.9991327,0.00026642423,0.000034823046,0.0003977271,0.000059537964,0.00010881045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009841322,0.00017667993,0.00014595452,0.000031177176,0.0003368466,0.00015520162,0.00027171316,0.000073155046,0.0000066208972],"category_scores_gemma":[0.00010643453,0.000083675135,0.000054882574,0.00026017832,0.00008736638,0.00010540191,0.000042168656,0.00028216577,0.00010733152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020392421,0.00001778899,0.0014701913,0.000017850056,0.000060341943,0.0000046859845,0.0009290715,0.00026918665,0.0001665015,0.9885625,0.00764339,0.00083804753],"study_design_scores_gemma":[0.0010279425,0.00009262185,0.00049154635,0.00013512185,0.000031324656,0.000035634297,0.0020790726,0.0047775167,0.0018564208,0.91833925,0.07070108,0.000432438],"about_ca_topic_score_codex":0.000017831777,"about_ca_topic_score_gemma":0.0000048521297,"teacher_disagreement_score":0.07022327,"about_ca_system_score_codex":0.000027762915,"about_ca_system_score_gemma":0.000013552835,"threshold_uncertainty_score":0.34121728},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70808494,0.000029274099,0.28944167,0.0007380146,0.0003140806,0.0009372866,0.000009683915,0.0001394043,0.00030566927],"genre_scores_gemma":[0.9911566,0.0000014205016,0.008329001,0.000344138,0.000008726628,0.00011523354,0.000022309123,0.00001654885,0.0000060638044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836576,0.00028381878,0.00018945635,0.0003381165,0.0004960836,0.00032677437],"domain_scores_gemma":[0.99793047,0.000134126,0.000085551204,0.001443078,0.0001856884,0.0002210957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083957583,0.00014808592,0.00015310448,0.00021149471,0.00021438308,0.00006408464,0.0011449459,0.00004177563,0.0000045893494],"category_scores_gemma":[0.000021844135,0.0001024444,0.000037170026,0.0010628782,0.00009629122,0.0007222146,0.00006483808,0.00015542799,0.000020302235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008745015,0.00040018908,0.0035374716,0.0000039939564,0.0000066429834,3.8807735e-7,0.00037566994,0.0041262135,0.004489167,0.9816648,0.00003116605,0.005276859],"study_design_scores_gemma":[0.0018635208,0.00507873,0.050956164,0.000032311196,0.000015552489,0.0000046054233,0.000111386405,0.29855525,0.020887313,0.62095845,0.0010403978,0.00049633574],"about_ca_topic_score_codex":0.000029929832,"about_ca_topic_score_gemma":0.000049004208,"teacher_disagreement_score":0.36070636,"about_ca_system_score_codex":0.000027708056,"about_ca_system_score_gemma":0.00003683177,"threshold_uncertainty_score":0.41775614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9672842,0.00009791904,0.00005825415,0.000028290257,0.0034210607,0.00008805879,0.0000033489368,0.00038266517,0.028636187],"genre_scores_gemma":[0.99974024,0.000007465137,0.000014127086,0.0000735144,0.000010247167,0.000015479394,0.000004419146,0.000030738076,0.0001037775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992668,0.00005907865,0.00015423201,0.00014665548,0.00013871542,0.00023453186],"domain_scores_gemma":[0.999449,0.00009062675,0.000019290268,0.00034197225,0.000013539107,0.00008555227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002343964,0.00014019525,0.00016062723,0.000082241895,0.0000674154,0.000025070887,0.00018019661,0.00007508567,0.000027515245],"category_scores_gemma":[0.000020732201,0.00013102198,0.00006799336,0.00014473441,0.000022877886,0.000054923006,0.000012548946,0.00013701986,0.00031955287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007747148,0.000022611719,0.00042120283,0.000021413034,0.000020046175,0.0000043982945,0.00011649702,0.00025588323,0.00029601765,0.99238783,0.005007721,0.0014386309],"study_design_scores_gemma":[0.00051157275,0.000106294385,0.0016886857,0.00004868919,0.0000075527964,0.0000046174678,0.00002054789,0.0041514896,0.0012991359,0.9758373,0.016104857,0.00021927162],"about_ca_topic_score_codex":0.0000070228084,"about_ca_topic_score_gemma":0.0000020138723,"teacher_disagreement_score":0.032456014,"about_ca_system_score_codex":0.000018449004,"about_ca_system_score_gemma":0.0000024361361,"threshold_uncertainty_score":0.5342921},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.953268,0.000062312516,0.017513357,0.0014603841,0.001273164,0.00044053537,0.0000014823003,0.00009958176,0.025881216],"genre_scores_gemma":[0.9987309,0.0000042589463,0.000920587,0.00008217585,0.0000033390895,0.000031405107,6.938964e-7,0.000007845088,0.00021877227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985741,0.0002965414,0.00017078195,0.00021244833,0.0005406297,0.0002054943],"domain_scores_gemma":[0.9980365,0.0008488596,0.00009044897,0.00070034753,0.00023450637,0.000089357105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001239074,0.00009827954,0.00014821785,0.00008834153,0.000075476586,0.000041409516,0.0009802864,0.00004047012,0.000013276705],"category_scores_gemma":[0.000539366,0.000066820394,0.00007253059,0.00072038075,0.00012744544,0.0002576695,0.00017160292,0.00015541595,0.000099637386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082746956,0.00008056106,0.00030952523,0.000002302344,0.00001163616,0.0000033502288,0.00040535288,0.0000176654,0.00011998183,0.9947571,0.0018485263,0.0023612585],"study_design_scores_gemma":[0.002212156,0.000105964056,0.00029051572,0.000011658816,0.0000023911223,0.0000041105286,0.000041623243,0.0014130995,0.003907461,0.991685,0.00024957748,0.00007648547],"about_ca_topic_score_codex":0.000008338421,"about_ca_topic_score_gemma":0.0000016157489,"teacher_disagreement_score":0.045462955,"about_ca_system_score_codex":0.000034637647,"about_ca_system_score_gemma":0.000056277397,"threshold_uncertainty_score":0.27248564},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9530211,0.00013994426,0.00072996196,0.00010312468,0.0010569359,0.00023643606,0.000013339893,0.000064354426,0.044634823],"genre_scores_gemma":[0.9979783,0.0000073301426,0.00095538894,0.000052101324,0.00006269139,0.000044051012,0.000009877072,0.000017194508,0.00087302213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993875,0.000027722572,0.00018032662,0.00013622112,0.00008138104,0.00018684231],"domain_scores_gemma":[0.99939823,0.000109685425,0.00007815191,0.00030990297,0.000054017444,0.000050018152],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009747091,0.000110951216,0.00013863498,0.000016536356,0.00023827475,0.0000416596,0.0002545748,0.000023309383,0.00105373],"category_scores_gemma":[0.000015843101,0.00008006875,0.000069630696,0.00013707753,0.00009154214,0.00011044706,0.00010028846,0.00009817122,0.00014937342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008648536,0.000050906892,0.00058939477,0.0000023049986,0.00002262532,2.0549044e-7,0.00051433675,0.0000011028327,0.00025978786,0.9965481,0.0015834928,0.00041910424],"study_design_scores_gemma":[0.00027215388,0.000012664965,0.00036601862,0.0000055370665,0.000019077688,3.2994387e-7,0.00045442165,0.000028948187,0.0031089843,0.9934144,0.0022084566,0.00010901849],"about_ca_topic_score_codex":0.00008784471,"about_ca_topic_score_gemma":9.4298946e-7,"teacher_disagreement_score":0.04495726,"about_ca_system_score_codex":0.000012027742,"about_ca_system_score_gemma":0.000023565739,"threshold_uncertainty_score":0.99985945},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96356034,0.000017515431,0.0030367991,0.0034590152,0.0050118696,0.00028498578,0.0000014863156,0.00025513239,0.024372865],"genre_scores_gemma":[0.99474186,0.0000032321705,0.0036628405,0.00076381146,0.000018620303,0.00001878417,8.2038343e-7,0.000008648102,0.0007813928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905837,0.00010533563,0.00013277426,0.0002535634,0.00021864583,0.00023129469],"domain_scores_gemma":[0.9988095,0.00022774762,0.000058947222,0.00079392665,0.000042522362,0.00006733828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005748992,0.00011991333,0.00010528641,0.00003802631,0.00024039709,0.00016994558,0.001145616,0.000057355024,0.00014451759],"category_scores_gemma":[0.00005854484,0.000077343815,0.00006131309,0.00025069504,0.000051266714,0.00017590329,0.0001782222,0.00032914968,0.00027443742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002670636,0.000053679825,0.000022135187,0.0000020381415,0.000006640318,0.00000854964,0.000114577604,0.0000034440225,0.002032696,0.9928673,0.003262637,0.0016236319],"study_design_scores_gemma":[0.0003649454,0.000049206905,0.000118599986,0.000004746929,0.000001987255,0.000008075595,0.0000021994233,0.0034045377,0.008027722,0.98012376,0.007772935,0.00012130949],"about_ca_topic_score_codex":0.000008013811,"about_ca_topic_score_gemma":0.0000011491874,"teacher_disagreement_score":0.031181518,"about_ca_system_score_codex":0.0000067357882,"about_ca_system_score_gemma":0.000031888823,"threshold_uncertainty_score":0.35274294},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97124934,0.00022140564,0.00011075839,0.00012198378,0.0007045581,0.00021707326,0.0000026818643,0.0004516836,0.026920496],"genre_scores_gemma":[0.99950236,0.000037923975,0.00017778324,0.00017785584,0.000007760508,0.000013529357,0.0000038216613,0.000026677457,0.000052308274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998911,0.00006935943,0.00029674015,0.00019952716,0.0002083879,0.0003149592],"domain_scores_gemma":[0.9992708,0.00014871536,0.00002709502,0.0003477288,0.000027907476,0.00017778491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024962032,0.00022762117,0.00027762665,0.00010630952,0.00008079631,0.00005660683,0.00017578487,0.00012577872,0.00003587953],"category_scores_gemma":[0.00003899866,0.0002126172,0.00007118026,0.00020040075,0.000058049474,0.0000988217,0.000017265185,0.00019193561,0.00007634979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001039317,0.00007503609,0.000067049674,0.00006874064,0.000033843895,0.000020579731,0.00014817498,0.000056026158,0.006055211,0.99159867,0.0008245171,0.0010417734],"study_design_scores_gemma":[0.00062123017,0.0003984806,0.0047253887,0.00017243666,0.00002058646,0.00002632965,0.00003088778,0.0015596573,0.002291524,0.9896087,0.0002476709,0.00029709435],"about_ca_topic_score_codex":0.0000012359644,"about_ca_topic_score_gemma":4.907018e-7,"teacher_disagreement_score":0.02825298,"about_ca_system_score_codex":0.00003330456,"about_ca_system_score_gemma":0.000008690069,"threshold_uncertainty_score":0.8670278},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98228455,0.00009969656,0.0002757435,0.00032508586,0.0037787007,0.0010183384,0.000021748692,0.0002138698,0.011982271],"genre_scores_gemma":[0.993295,0.000008360003,0.005023559,0.0004142348,0.000037061513,0.00016945218,0.000015039796,0.000068646834,0.00096862705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839455,0.000081866245,0.0003912421,0.0003406664,0.00027476271,0.0005169019],"domain_scores_gemma":[0.9980789,0.0007573173,0.00015095128,0.0006545013,0.00020353941,0.00015478392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031900435,0.00027942998,0.0003964604,0.00010607527,0.0004666494,0.00012091591,0.00045612044,0.00017423778,0.00043763654],"category_scores_gemma":[0.0002842189,0.00023676129,0.0002721618,0.00019783681,0.00018426611,0.00020154375,0.00013698745,0.00020859756,0.00007930868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013939202,0.00007727805,0.0018796221,0.00007425507,0.000102216865,0.0000011542716,0.00048375566,3.633285e-7,0.00013750776,0.95795894,0.03893068,0.00034031319],"study_design_scores_gemma":[0.0012597784,0.00011261345,0.0022196681,0.000028281298,0.000059322912,0.000009805982,0.00011744794,0.00010530283,0.00018250103,0.988961,0.0066234586,0.00032081734],"about_ca_topic_score_codex":0.000037748825,"about_ca_topic_score_gemma":0.0000031311188,"teacher_disagreement_score":0.03230722,"about_ca_system_score_codex":0.000044492568,"about_ca_system_score_gemma":0.000024913537,"threshold_uncertainty_score":0.96548456},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9965473,0.0008475654,0.00013262594,0.00068988954,0.00074662967,0.00022289297,6.9863984e-7,0.00020900232,0.00060343876],"genre_scores_gemma":[0.99261326,0.00005826824,0.007010539,0.0002002756,7.924392e-7,0.000018958013,0.0000018630753,0.000013987055,0.0000820347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985469,0.000063139254,0.00028409387,0.0003910171,0.00038928958,0.00032557664],"domain_scores_gemma":[0.998469,0.00007139138,0.00016353419,0.00085699145,0.00030796696,0.00013113323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020698523,0.00017921643,0.00026112204,0.00023839538,0.000100629484,0.00010281535,0.000709444,0.00006732499,0.00001210231],"category_scores_gemma":[0.000019266941,0.0001388056,0.00008561371,0.000888699,0.00018922654,0.00076706597,0.0001373061,0.0001320773,0.000057742192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002617497,0.00012429849,0.006575582,0.000018332394,0.000029097117,0.0000056124345,0.00008082238,0.0000096261965,0.0039754105,0.98587483,0.002876231,0.00042751475],"study_design_scores_gemma":[0.00069791253,0.00024370261,0.00652899,0.000048468453,0.000010057085,0.0000111760055,0.000015038103,0.00085982855,0.0111251315,0.98016447,0.00009761785,0.00019761208],"about_ca_topic_score_codex":0.00015353457,"about_ca_topic_score_gemma":0.0000011710215,"teacher_disagreement_score":0.0071497206,"about_ca_system_score_codex":0.000007822585,"about_ca_system_score_gemma":0.000055276072,"threshold_uncertainty_score":0.5660328},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5394623,0.00016306671,0.45917603,0.0000063711677,0.00024279658,0.00026898214,0.00015710216,0.000014793847,0.0005085035],"genre_scores_gemma":[0.83786005,0.00005573141,0.16203082,0.0000034835355,0.0000018466299,0.00001225918,0.0000036173653,0.000011844921,0.00002032978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874455,0.00016013318,0.0004911562,0.00020847523,0.00019117162,0.00020454293],"domain_scores_gemma":[0.99645144,0.002840336,0.00024251232,0.00026101555,0.00013611751,0.000068581874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077228405,0.0001311069,0.0005096691,0.00006521566,0.000029119201,0.00000424384,0.00014887795,0.00008211759,0.000024809266],"category_scores_gemma":[0.0038448505,0.00011829063,0.00004145084,0.00042700866,0.00011672462,0.00006654209,0.000075774136,0.00010869119,3.8706065e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001374568,0.00035950285,0.006639013,0.00020267924,0.000029810984,0.0000028042934,0.0004117815,0.0000021552153,0.00016941951,0.9896938,0.000027484322,0.0023240896],"study_design_scores_gemma":[0.002661235,0.000085674255,0.015400944,0.00011758003,0.00003922898,0.0000014136239,0.00010686203,0.00012824764,0.0031640085,0.9781665,0.000014168736,0.000114116476],"about_ca_topic_score_codex":0.00017325112,"about_ca_topic_score_gemma":0.000008598352,"teacher_disagreement_score":0.29839772,"about_ca_system_score_codex":0.00002718379,"about_ca_system_score_gemma":0.000028132967,"threshold_uncertainty_score":0.48237517},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95652443,0.001983673,0.005832819,0.00051590573,0.021839948,0.00028250105,0.0000010962776,0.00016732384,0.012852275],"genre_scores_gemma":[0.99923325,0.000023049039,0.00016086733,0.00006961972,0.000026693946,0.000020681116,3.2865674e-7,0.0000075067073,0.00045799627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894714,0.00017155029,0.0002429608,0.00013753821,0.00017003303,0.00033078506],"domain_scores_gemma":[0.99869573,0.0004958539,0.00013700567,0.00049354776,0.00010664465,0.00007121884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086900266,0.00010535017,0.0001601414,0.000051449762,0.00023788738,0.000086285596,0.0006073207,0.000054976907,0.000005202474],"category_scores_gemma":[0.000057844074,0.000073692965,0.00010133691,0.0002759288,0.00007529313,0.00027645973,0.00013228662,0.00011291544,0.000019626657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029870548,0.00003703165,0.0029934654,0.000005941398,0.000023749573,4.2994697e-7,0.0008740649,0.000005972042,0.000083040126,0.99198276,0.0025541477,0.0014363899],"study_design_scores_gemma":[0.00091008143,0.00026603157,0.0070023453,0.00006952986,0.000014090877,0.000049763472,0.00073911063,0.007996395,0.0058331266,0.9367464,0.039969593,0.0004035396],"about_ca_topic_score_codex":0.0000538591,"about_ca_topic_score_gemma":0.000011499114,"teacher_disagreement_score":0.055236388,"about_ca_system_score_codex":0.000024521984,"about_ca_system_score_gemma":0.000024152605,"threshold_uncertainty_score":0.30051118},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97400934,0.000009221678,0.00003233069,0.00065034226,0.00022879659,0.0001985395,0.0000030882206,0.000049773687,0.024818582],"genre_scores_gemma":[0.99949473,0.000003541103,0.00013119321,0.000120367644,0.0000054961088,0.000029445206,0.0000014502549,0.000014133284,0.00019962854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992555,0.00012951673,0.00019168723,0.00012789071,0.00014443167,0.00015102419],"domain_scores_gemma":[0.9980872,0.001219827,0.000112962625,0.0005101398,0.000027656846,0.00004220644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049939356,0.00009996301,0.00015923877,0.00006040891,0.00012775662,0.000011205038,0.00028767536,0.00004790978,0.000072140625],"category_scores_gemma":[0.00030002277,0.0000693498,0.00010689385,0.00030642288,0.000097593314,0.000025663634,0.000020792182,0.00013971161,0.000047034733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009574088,0.00016463311,0.00019296387,0.000009178201,0.000018786679,1.8686129e-7,0.00014666766,3.4052482e-7,0.00036833898,0.99472135,0.004189808,0.00017819495],"study_design_scores_gemma":[0.00034769232,0.00008544842,0.00083818485,0.000013486576,0.000021559028,0.0000011106977,0.000034558514,0.00002549323,0.0056140674,0.99169856,0.0012417645,0.000078054414],"about_ca_topic_score_codex":0.0000035683017,"about_ca_topic_score_gemma":0.0000017249596,"teacher_disagreement_score":0.02548542,"about_ca_system_score_codex":0.000008660236,"about_ca_system_score_gemma":0.000007801034,"threshold_uncertainty_score":0.2828003},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9404281,0.0011293443,0.03876337,0.00029976715,0.004903864,0.00025986717,0.0000036477377,0.0003556743,0.013856385],"genre_scores_gemma":[0.99545646,0.00001749877,0.0041978816,0.00018128351,0.000020349056,0.000015300011,0.000004423291,0.000012551877,0.00009425157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862325,0.000076764154,0.00030434373,0.0002420117,0.00029891878,0.0004547065],"domain_scores_gemma":[0.99876803,0.00017294395,0.00015662574,0.00061948353,0.000097526536,0.00018538904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002873109,0.00016571653,0.00024700214,0.000096456046,0.00012545551,0.000039255174,0.00073808566,0.00007973099,0.00003959153],"category_scores_gemma":[0.00010880434,0.00015693791,0.00008410159,0.00048874354,0.00010647525,0.00078022503,0.00026167184,0.00015274079,0.00019472983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030092513,0.00016525415,0.0070761894,0.000015218879,0.00001198192,0.000002863882,0.00024889995,0.000004307895,0.00047568788,0.9894107,0.0005273356,0.0020585405],"study_design_scores_gemma":[0.00041011523,0.00010593113,0.014992553,0.000014725862,0.000009299724,0.000014559824,0.000024147856,0.00012571955,0.004662197,0.9785704,0.0008626287,0.00020775002],"about_ca_topic_score_codex":0.000008196269,"about_ca_topic_score_gemma":6.6735475e-7,"teacher_disagreement_score":0.055028383,"about_ca_system_score_codex":0.00004509589,"about_ca_system_score_gemma":0.00004719031,"threshold_uncertainty_score":0.63997424},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9948515,0.000053112475,0.0008365482,0.00064881577,0.0005018135,0.00038260306,0.000005122828,0.00009778139,0.002622696],"genre_scores_gemma":[0.9984344,0.000014434633,0.0008652482,0.000112588474,0.000018579147,0.00004243822,0.0000021095523,0.000044676843,0.00046552817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844027,0.00014112634,0.00036634863,0.00027995076,0.00040306887,0.0003692178],"domain_scores_gemma":[0.9979643,0.00076424977,0.00019631244,0.0007882268,0.00015921505,0.00012770211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075833406,0.00020076973,0.00034023763,0.00006637919,0.0002067499,0.00006339928,0.0004364629,0.000064409774,0.000013088241],"category_scores_gemma":[0.00070703326,0.00013213871,0.00008368205,0.0003209664,0.00011075771,0.000067275185,0.0001073796,0.00015270058,0.00003100849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106673455,0.000109428984,0.0021901685,0.000049388706,0.00007722157,0.0000031419431,0.00079899735,0.000009983986,0.00043966982,0.976203,0.019363662,0.0006486269],"study_design_scores_gemma":[0.0009486721,0.00042630875,0.0023104134,0.00009168756,0.000041314077,0.000003899884,0.00009304365,0.000051459916,0.0049969335,0.98325884,0.007571555,0.00020586734],"about_ca_topic_score_codex":0.000059734404,"about_ca_topic_score_gemma":0.00016312482,"teacher_disagreement_score":0.011792106,"about_ca_system_score_codex":0.000022459739,"about_ca_system_score_gemma":0.00005183885,"threshold_uncertainty_score":0.538846},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9800346,0.0005590629,0.018367443,0.00008416657,0.00045008986,0.00023513792,0.00004748038,0.00002600497,0.00019602117],"genre_scores_gemma":[0.99924695,0.00016782415,0.00027119048,0.00006691067,0.000020722591,0.000012920884,0.00017570764,0.000015623304,0.000022139637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872035,0.000084113126,0.0003552176,0.0003638274,0.00017562164,0.00030084405],"domain_scores_gemma":[0.9991798,0.00014154102,0.00015514431,0.00024942728,0.00014801278,0.00012609157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003824458,0.00019690832,0.0002935677,0.00006760536,0.00017742315,0.000037249978,0.00022433145,0.00015291946,0.000011753839],"category_scores_gemma":[0.00056754926,0.00015258483,0.00008509006,0.00042075705,0.00009141124,0.0000067941646,0.00023933973,0.00017253867,0.000001826857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014969909,0.0022391928,0.22841397,0.00030319951,0.00061762345,0.00008374105,0.000401259,0.0016577421,0.17664309,0.581005,0.00030631223,0.0068319086],"study_design_scores_gemma":[0.048276912,0.0054792664,0.071958035,0.0004353985,0.00033751348,0.0001307437,0.00087483117,0.000981584,0.14145185,0.72512764,0.0029542611,0.001991932],"about_ca_topic_score_codex":0.000056176857,"about_ca_topic_score_gemma":0.000016246073,"teacher_disagreement_score":0.15645593,"about_ca_system_score_codex":0.000038669867,"about_ca_system_score_gemma":0.00008266005,"threshold_uncertainty_score":0.6222229},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907308,0.0003111019,0.0038820552,0.00089969754,0.0015611966,0.00023014488,0.0000015425835,0.00014143888,0.0022420269],"genre_scores_gemma":[0.9971039,0.0000030268757,0.0027356807,0.000023374238,0.0000030997892,0.000019520085,8.465289e-7,0.000009710208,0.00010079802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984604,0.00017734355,0.00022787284,0.00027872418,0.0005612424,0.00029439267],"domain_scores_gemma":[0.9986266,0.00014893254,0.000047733167,0.00052665477,0.00047011065,0.00017996268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006397774,0.00011259786,0.0001757423,0.0001677707,0.00006777031,0.00005508141,0.00061021897,0.000061460225,0.0000035187395],"category_scores_gemma":[0.001148274,0.00010051212,0.000057222034,0.0005799843,0.00029082134,0.0006772514,0.00025549132,0.00015312439,0.0000244411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039401144,0.000115073955,0.00014204798,0.000018477996,0.000008045128,0.000010171642,0.0005223241,0.0000074281656,0.006706886,0.99053955,0.00027283552,0.0016177401],"study_design_scores_gemma":[0.0007778283,0.00028370434,0.00058269646,0.000032807377,0.000003128633,0.000014084347,0.00008916567,0.003187829,0.03069558,0.96416676,0.000039313414,0.00012710853],"about_ca_topic_score_codex":0.000011809315,"about_ca_topic_score_gemma":7.452755e-7,"teacher_disagreement_score":0.026372815,"about_ca_system_score_codex":0.000046643923,"about_ca_system_score_gemma":0.00013679828,"threshold_uncertainty_score":0.40987656},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99145633,0.0017664257,0.0003268105,0.0000064326186,0.0029983197,0.00027876874,0.00004720141,0.00021212219,0.0029075865],"genre_scores_gemma":[0.99942243,0.00010086095,0.00032286486,0.000003796367,0.000006761882,0.00005012821,0.000024890676,0.000046836987,0.00002140879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998376,0.00012122691,0.00053839356,0.00032621302,0.000267417,0.0003707459],"domain_scores_gemma":[0.999057,0.00006092277,0.00013969965,0.00057336706,0.00006209016,0.00010691584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002533901,0.00030336302,0.0005041837,0.00024252612,0.000071236005,0.00002617887,0.00032309818,0.0001892709,0.00006419604],"category_scores_gemma":[0.00001567857,0.00031965147,0.00017409843,0.00074494886,0.00032098513,0.00027908914,0.0000262074,0.00021650382,0.000010357522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074126016,0.000086564156,0.05760161,0.00009613266,0.00012343546,0.00001656675,0.0015736673,0.000017651728,0.0030148216,0.93694764,0.000093977265,0.00035381454],"study_design_scores_gemma":[0.0012441,0.000053995544,0.017536666,0.00019088926,0.000039057555,0.000003925093,0.0009403659,0.0002002061,0.023331776,0.9555612,0.0005419544,0.00035583592],"about_ca_topic_score_codex":0.00029663809,"about_ca_topic_score_gemma":0.00024678704,"teacher_disagreement_score":0.040064942,"about_ca_system_score_codex":0.000059144044,"about_ca_system_score_gemma":0.000016612787,"threshold_uncertainty_score":0.99992555},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93048674,0.0006815378,0.038889896,0.00032481764,0.018504363,0.00034105766,8.9389556e-7,0.00029091592,0.010479795],"genre_scores_gemma":[0.9987966,0.0000054966067,0.0006048575,0.00024438414,0.00005209231,0.000024567085,0.0000013961895,0.000012500893,0.00025809673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984437,0.00014047089,0.0003719731,0.0002709989,0.00025818407,0.0005146276],"domain_scores_gemma":[0.99914,0.00009565901,0.00009197707,0.00045006504,0.00008188219,0.00014039219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000677426,0.00015658738,0.00023448988,0.00011086269,0.00008680682,0.00012578811,0.0005327976,0.00010763706,0.000019536861],"category_scores_gemma":[0.000034921813,0.00014614125,0.000071479895,0.00045776847,0.000019971305,0.00063598756,0.00016006637,0.00021854615,0.00014513495],"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.000006973387,0.0001811576,0.008798946,0.00001556622,0.000013841543,0.000023462148,0.0022638747,0.0006410351,0.00017767298,0.98016584,0.0038821443,0.0038295148],"study_design_scores_gemma":[0.0025710044,0.00021228292,0.011610841,0.00034236477,0.0000080713135,0.00012873298,0.00035715807,0.89884603,0.0008560501,0.05160288,0.032593466,0.0008711141],"about_ca_topic_score_codex":0.00012160331,"about_ca_topic_score_gemma":0.000013356141,"teacher_disagreement_score":0.92856294,"about_ca_system_score_codex":0.0001253237,"about_ca_system_score_gemma":0.000032703407,"threshold_uncertainty_score":0.59594667},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95110637,0.0096406145,0.0000057698808,0.00008500795,0.021071631,0.000507807,0.00010372806,0.00010472928,0.017374316],"genre_scores_gemma":[0.99758226,0.00054659136,0.00087659265,0.00014847424,0.00007754702,0.000022067352,0.000010404932,0.00010246697,0.0006336001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967757,0.00025679206,0.0009025054,0.0003686819,0.00070982846,0.000986511],"domain_scores_gemma":[0.9961133,0.000808236,0.00061873347,0.0018596197,0.00021881783,0.00038126702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011334551,0.00051104167,0.00086496025,0.00025634395,0.00035257085,0.000038075872,0.0011873124,0.00047370497,0.0003664448],"category_scores_gemma":[0.00070423295,0.00048212483,0.00045397118,0.00059041864,0.00053874747,0.00032085594,0.0008927227,0.0005649231,0.000069486494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090087466,0.0006324614,0.0136574935,0.0004950618,0.00054443756,0.0000061779187,0.0044890638,3.3756723e-7,0.00017731932,0.9625736,0.017121883,0.00021210779],"study_design_scores_gemma":[0.001835904,0.00024087186,0.0045388406,0.00016728701,0.0005161906,0.000008121664,0.0003242477,0.000007853145,0.0027841204,0.96751106,0.021556782,0.0005087433],"about_ca_topic_score_codex":0.000021023869,"about_ca_topic_score_gemma":0.0000010592614,"teacher_disagreement_score":0.04647586,"about_ca_system_score_codex":0.000083718915,"about_ca_system_score_gemma":0.00006532214,"threshold_uncertainty_score":0.9997631},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9607006,0.0001304564,0.03136331,0.0007571376,0.0010171839,0.00027863155,0.0000059185104,0.0010840108,0.0046627624],"genre_scores_gemma":[0.9872475,0.000017830735,0.012476353,0.00012337933,0.000007444399,0.000027152844,0.000010013914,0.000024182084,0.00006609739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829507,0.0000490595,0.0004257225,0.00042652554,0.00047959902,0.00032400934],"domain_scores_gemma":[0.99807554,0.00005679473,0.00030923192,0.00075449556,0.0006383245,0.00016562646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005685229,0.00021224878,0.00028395804,0.00044970223,0.00006013632,0.000333169,0.0012296808,0.00011650026,0.0000021533265],"category_scores_gemma":[0.00028761796,0.00021624593,0.000090092064,0.0023087214,0.00010106147,0.0016898295,0.0004114828,0.00016619124,0.000019293411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016278662,0.00031637654,0.0127805825,0.00009660007,0.00003313542,0.000010206558,0.0006373088,3.163929e-7,0.09683382,0.8835283,0.0011000562,0.0046470235],"study_design_scores_gemma":[0.00048520605,0.00046736805,0.0062894574,0.00027830302,0.000019800058,0.00003209552,0.000030812036,0.0015670507,0.13162404,0.8581543,0.0005584789,0.00049310934],"about_ca_topic_score_codex":0.00003224823,"about_ca_topic_score_gemma":0.0000018273868,"teacher_disagreement_score":0.034790225,"about_ca_system_score_codex":0.000029457871,"about_ca_system_score_gemma":0.00012623664,"threshold_uncertainty_score":0.8818253},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9878032,0.00003377039,0.006543937,0.00033125142,0.0010257391,0.00025336107,0.0000052673777,0.00017203404,0.0038314369],"genre_scores_gemma":[0.983659,0.000004346076,0.01617443,0.00006396819,0.0000030434055,0.000015303092,0.000001947333,0.000018187571,0.000059770442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983891,0.00007166635,0.00021595982,0.00039659723,0.00050632417,0.0004203342],"domain_scores_gemma":[0.99808645,0.0002196304,0.00013112821,0.0011372013,0.0002667576,0.00015880221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043077912,0.00016818997,0.00024249764,0.00021394053,0.0001316208,0.00006250529,0.0014877903,0.000069328154,0.00002547701],"category_scores_gemma":[0.00006984376,0.0001418216,0.00007094664,0.00095964404,0.0003795804,0.00044255657,0.00033016346,0.0004518892,0.000034468318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022054935,0.00008050515,0.005663912,0.000012397984,0.000019725072,0.000017178525,0.00017689401,0.000002083013,0.0141025195,0.97741145,0.00013465964,0.002356637],"study_design_scores_gemma":[0.00076407334,0.00024079157,0.0045577227,0.000014966312,0.0000037578486,0.000024985502,0.000016622647,0.00031976536,0.011639651,0.9806905,0.0015417179,0.00018546688],"about_ca_topic_score_codex":0.00002057538,"about_ca_topic_score_gemma":0.000012561721,"teacher_disagreement_score":0.009630494,"about_ca_system_score_codex":0.000011619691,"about_ca_system_score_gemma":0.00007348048,"threshold_uncertainty_score":0.57833165},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98262674,0.00011645533,0.010203177,0.0047363485,0.0008328516,0.00018951409,0.000003992208,0.00042487672,0.0008660599],"genre_scores_gemma":[0.9981633,0.0000035072082,0.0011635855,0.0005653922,0.0000015772212,0.000022078846,0.00001065915,0.000009265027,0.00006067386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987958,0.00012955377,0.00015493076,0.00032977274,0.00027164255,0.00031829524],"domain_scores_gemma":[0.9985589,0.0002207737,0.000087538785,0.0008592905,0.00016719534,0.00010634871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040280318,0.00014591216,0.0001438303,0.000056048717,0.0004136636,0.00015849847,0.00075549807,0.000050595456,0.000007446487],"category_scores_gemma":[0.00007511964,0.00009094752,0.00005593937,0.00077940535,0.000117849144,0.0001655849,0.00014879616,0.00016631866,0.00006161594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030336926,0.000044235057,0.0007263845,0.0000025238412,0.000015579757,0.0000016092001,0.00010516354,0.000020389973,0.00018896228,0.9883235,0.009118326,0.0014502921],"study_design_scores_gemma":[0.000632102,0.00015915454,0.002294056,0.00000892465,0.0000115497905,0.000008314164,0.000012620082,0.0032758738,0.0011242457,0.9825868,0.009712671,0.00017366369],"about_ca_topic_score_codex":0.00007155558,"about_ca_topic_score_gemma":0.0000138561945,"teacher_disagreement_score":0.015536537,"about_ca_system_score_codex":0.0000149016005,"about_ca_system_score_gemma":0.000037155933,"threshold_uncertainty_score":0.37087324},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954995,0.0013381836,0.000056838882,0.000044768945,0.0005206259,0.00014789621,0.000004377583,0.00013149936,0.002256306],"genre_scores_gemma":[0.999726,0.000057660556,0.00009414908,0.000027117165,0.0000077980285,0.000012060574,0.0000020492714,0.00001094022,0.00006220291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996164,0.000009828526,0.00008979554,0.000097818105,0.00003885864,0.00014729748],"domain_scores_gemma":[0.9997777,0.000043724565,0.0000107572505,0.000098519595,0.000011823669,0.0000574981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115823845,0.00008613367,0.0001167891,0.00003036914,0.000059801958,0.000031087886,0.000042751028,0.0000501487,0.000002514515],"category_scores_gemma":[0.000010360796,0.00008523576,0.000019294328,0.00004903658,0.000018406734,0.0000850317,0.0000065897807,0.00004306838,0.0000028107827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009553464,0.000014111121,0.00089996436,0.00006027235,0.000016267366,0.0000020209193,0.00026658864,0.000013759165,0.0038868852,0.98840296,0.0013937876,0.0050338353],"study_design_scores_gemma":[0.00067466596,0.0001150265,0.0055429237,0.000029021461,0.000011815419,0.000009155099,0.00007642651,0.0012671532,0.0023994427,0.9860206,0.003693856,0.00015988883],"about_ca_topic_score_codex":0.0000014268716,"about_ca_topic_score_gemma":5.709676e-7,"teacher_disagreement_score":0.0048739463,"about_ca_system_score_codex":0.0000062108957,"about_ca_system_score_gemma":0.0000020064217,"threshold_uncertainty_score":0.34758136},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87325466,0.0039091352,0.0040031443,0.011917358,0.020715903,0.00095830805,0.000017506796,0.0005739191,0.08465006],"genre_scores_gemma":[0.9785408,0.00028134746,0.0028112668,0.00066067977,0.000012827633,0.000034430283,0.0000034489553,0.000053622243,0.017601607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541,0.0012632072,0.0003981102,0.0009187633,0.00083316636,0.0011767196],"domain_scores_gemma":[0.9960253,0.0014159656,0.00017720275,0.0015282423,0.00040595548,0.00044729313],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002131311,0.00040730493,0.00045464534,0.00028168797,0.00049413554,0.00039039186,0.0019587239,0.0002673843,0.00013870667],"category_scores_gemma":[0.0005085814,0.00043815485,0.0001735399,0.0017276496,0.0006437025,0.00095714047,0.00052466465,0.0008017899,0.0014218285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005275782,0.00037878985,0.0008838029,0.000055365963,0.000040568717,0.00003763463,0.00029473746,0.00048392316,0.0003118684,0.9804928,0.0064971587,0.010470596],"study_design_scores_gemma":[0.0009153659,0.0012952732,0.0012994638,0.00014489805,0.000010350795,0.00001174724,0.000024167084,0.012324051,0.0036389783,0.9097958,0.0701101,0.00042977824],"about_ca_topic_score_codex":0.00013607607,"about_ca_topic_score_gemma":0.000019498451,"teacher_disagreement_score":0.10528611,"about_ca_system_score_codex":0.00014875778,"about_ca_system_score_gemma":0.00018332532,"threshold_uncertainty_score":0.999807},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946313,0.000094425035,0.000044906366,0.000057967092,0.00021739362,0.00009523544,0.000018253078,0.000033298198,0.004807222],"genre_scores_gemma":[0.9993611,0.000014382892,0.00040391457,0.000027285885,0.0000050590597,0.000044224103,0.0000062442114,0.000016378284,0.000121398385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991172,0.00008841628,0.00031946058,0.000110936584,0.00016272815,0.00020123829],"domain_scores_gemma":[0.99877757,0.00044672185,0.00021825937,0.0004069138,0.00006739338,0.000083158404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026961375,0.00010843513,0.0002237009,0.00012568964,0.00005175784,0.000003300329,0.00017014625,0.00006780887,0.00008636908],"category_scores_gemma":[0.00009543923,0.000102232974,0.00011868063,0.00037433728,0.00012334921,0.00008415041,0.000036178084,0.00006543194,0.000015200356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001992547,0.0007625097,0.0012162492,0.000028237891,0.00004190719,1.7867829e-7,0.00024699402,5.528015e-7,0.004441971,0.9910238,0.002046874,0.00017082397],"study_design_scores_gemma":[0.000371651,0.000109104236,0.0011084178,0.000037074657,0.000041632058,0.0000010983442,0.000048890524,0.000010331804,0.05450972,0.9426123,0.0010591556,0.00009063401],"about_ca_topic_score_codex":0.0000121557805,"about_ca_topic_score_gemma":0.0000017917542,"teacher_disagreement_score":0.050067753,"about_ca_system_score_codex":0.000009470461,"about_ca_system_score_gemma":0.000012548772,"threshold_uncertainty_score":0.416894},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9861592,0.00004256802,0.00004698591,0.0000067280916,0.0048887813,0.00006597785,0.000007370645,0.00014377058,0.008638632],"genre_scores_gemma":[0.9998632,0.0000046596524,0.000030007262,0.0000032060211,0.000007963494,0.000006891534,0.0000054782377,0.000017531927,0.00006103363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995853,0.000011850872,0.00014547996,0.00006689081,0.00007663695,0.00011385907],"domain_scores_gemma":[0.99963546,0.000027913398,0.000021502381,0.00023123756,0.000037785303,0.000046097382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007795708,0.00007720975,0.000110463065,0.000050771447,0.0000341177,0.000010627536,0.00012937411,0.00007352969,0.00007310676],"category_scores_gemma":[0.000017710134,0.0000767833,0.00003947225,0.00015374827,0.00003219014,0.00006571065,0.000011064951,0.00011861647,0.000035472756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000113915,0.000020700996,0.006456304,0.000035610636,0.000024486317,0.0000011025147,0.00030263918,0.00007722009,0.124405354,0.8679195,0.0006267331,0.00012919484],"study_design_scores_gemma":[0.00089106796,0.000070425114,0.019829093,0.000037798192,0.00003567659,0.000012961102,0.00014495861,0.0011444823,0.31620654,0.6307134,0.030399187,0.0005143752],"about_ca_topic_score_codex":0.000008594978,"about_ca_topic_score_gemma":0.000005058201,"teacher_disagreement_score":0.23720609,"about_ca_system_score_codex":0.000005417897,"about_ca_system_score_gemma":0.000006750418,"threshold_uncertainty_score":0.31311318},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9817789,0.00030005843,0.0005484172,0.0012402256,0.00268263,0.0003017843,5.487767e-7,0.0006067565,0.012540664],"genre_scores_gemma":[0.99312544,0.000011461784,0.005781881,0.0005614303,6.780912e-7,0.00004796704,0.0000011131431,0.000011568505,0.0004584709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986831,0.000061062055,0.00021412973,0.0003993427,0.00027320482,0.0003691714],"domain_scores_gemma":[0.9988251,0.000072019066,0.00007547693,0.00064549706,0.00021395332,0.0001679864],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022222738,0.00015349286,0.00016180097,0.00014980318,0.00018198567,0.00023191232,0.00073255535,0.000074677315,0.000056713216],"category_scores_gemma":[0.000049003258,0.00013817968,0.000075245196,0.0007206722,0.000057388777,0.0007100383,0.00022945128,0.00016578936,0.0011354426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.1872345e-7,0.00007240729,0.0018021195,0.0000035754347,0.000012137574,0.0000026155055,0.00013237695,0.0000069016983,0.0010924409,0.9772744,0.017582085,0.0020182796],"study_design_scores_gemma":[0.00043801044,0.00008713447,0.004824312,0.000012158006,0.000002823971,0.000006981578,0.000013563109,0.0019398223,0.0019691067,0.98987114,0.0006471421,0.0001877847],"about_ca_topic_score_codex":0.0002695051,"about_ca_topic_score_gemma":0.0000011181812,"teacher_disagreement_score":0.016934942,"about_ca_system_score_codex":0.000021612406,"about_ca_system_score_gemma":0.000045383895,"threshold_uncertainty_score":0.9996423},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9796487,0.0000629578,0.0000059185363,0.0018688753,0.00023093342,0.0005775527,7.685632e-7,0.00006535916,0.01753891],"genre_scores_gemma":[0.99790514,0.000017344322,0.00028090164,0.0003996864,0.000008082401,0.000071484275,0.00000789661,0.000029736235,0.0012797432],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9985064,0.00007181168,0.00024941922,0.0003135325,0.00044084233,0.00041795865],"domain_scores_gemma":[0.9990725,0.00018502734,0.000041534815,0.00039292892,0.00009565006,0.0002123591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020752204,0.00015883695,0.00028075936,0.0003652953,0.00004768393,0.00003457702,0.00014178467,0.000109405606,0.00053850445],"category_scores_gemma":[0.000328187,0.0001412912,0.00009291487,0.00052152097,0.00010091067,0.00007051517,0.00006345598,0.00044103657,0.0007590537],"study_design_candidate":"observational","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.0008902389,0.0029065893,0.12261727,0.0002308827,0.00014694202,0.0018414226,0.0023514424,0.00004743931,0.548501,0.21741872,0.023078982,0.079969086],"study_design_scores_gemma":[0.019713704,0.0032791984,0.6508468,0.0009829932,0.000051331997,0.00010601667,0.00074519246,0.004074549,0.06054497,0.25498387,0.0038171075,0.0008542819],"about_ca_topic_score_codex":0.0002980576,"about_ca_topic_score_gemma":0.00001998761,"teacher_disagreement_score":0.5282295,"about_ca_system_score_codex":0.00010315446,"about_ca_system_score_gemma":0.00009968841,"threshold_uncertainty_score":0.97563523},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9629814,0.0004484074,0.0014848575,0.00032704344,0.0029137558,0.00023796003,9.69341e-7,0.0006644734,0.030941147],"genre_scores_gemma":[0.988785,0.000012853167,0.010713734,0.0002415332,4.6075206e-7,0.000008392736,9.284514e-7,0.0000127339645,0.00022433615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880016,0.000044864682,0.00017363863,0.00039207912,0.000265919,0.00032336582],"domain_scores_gemma":[0.9988933,0.000026790496,0.00007910907,0.000722649,0.00012542766,0.00015268133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002333462,0.00015856446,0.00015589393,0.00012948342,0.0001210114,0.000065043976,0.0007135868,0.00005003742,0.000033773904],"category_scores_gemma":[0.0000106935,0.00012124979,0.0000524189,0.00054560043,0.00009091386,0.00029605164,0.00016051123,0.0001468037,0.00021194504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063710127,0.00011722685,0.0031362516,0.0000050961494,0.000015471434,0.000040968935,0.00048499258,7.521909e-7,0.00016144561,0.9934477,0.0015165488,0.0010671295],"study_design_scores_gemma":[0.00066514884,0.00026159376,0.0036816464,0.00002383069,0.000008742141,0.000033936278,0.000016639766,0.00024497183,0.0044898256,0.9899266,0.00043115875,0.00021593287],"about_ca_topic_score_codex":0.00008879271,"about_ca_topic_score_gemma":0.0000038139503,"teacher_disagreement_score":0.030716812,"about_ca_system_score_codex":0.00001109022,"about_ca_system_score_gemma":0.000052820284,"threshold_uncertainty_score":0.49444228},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9681964,0.0005539153,0.016373383,0.0006691875,0.0011540545,0.00012188519,9.597259e-7,0.00023408579,0.01269612],"genre_scores_gemma":[0.9904986,0.000010763256,0.009122856,0.00029084118,0.0000075716016,0.0000019448719,8.578283e-7,0.0000040405926,0.000062517276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999072,0.000045012526,0.00020517301,0.00024055658,0.00021098077,0.00022626152],"domain_scores_gemma":[0.9992304,0.00005287712,0.000085776264,0.00050779403,0.000052886535,0.00007028295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001632825,0.00010884928,0.00019830323,0.000055509725,0.000062915424,0.000029458275,0.0006224539,0.0000467897,0.000005266849],"category_scores_gemma":[0.000026989263,0.0001023009,0.00008655119,0.00032801603,0.00003038562,0.0003679209,0.00009108829,0.00012035457,0.00001649912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022921045,0.00005562192,0.0011093363,0.000005167235,0.000005580585,0.000015284477,0.00011794231,0.000013705272,0.0012422838,0.9903712,0.0001825385,0.0068790363],"study_design_scores_gemma":[0.00027126365,0.0001652277,0.012876364,0.00001507711,0.000003978914,0.000013830264,0.000011925552,0.00042183168,0.0034271393,0.98226106,0.0004050909,0.00012720354],"about_ca_topic_score_codex":0.0000052879095,"about_ca_topic_score_gemma":1.4545077e-7,"teacher_disagreement_score":0.0223022,"about_ca_system_score_codex":0.00002293822,"about_ca_system_score_gemma":0.000033092987,"threshold_uncertainty_score":0.41717097},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98223215,0.0000323865,0.00019047783,0.007984675,0.006923559,0.00045183586,0.000003435172,0.00023058632,0.0019509186],"genre_scores_gemma":[0.9961672,0.000002313684,0.00073773216,0.0028870027,0.000002662656,0.000060001574,0.0000019032992,0.000013689472,0.00012753258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988076,0.00004894035,0.00016919634,0.0003834646,0.0002863415,0.0003044411],"domain_scores_gemma":[0.99804425,0.00074200105,0.000080223064,0.00093371235,0.0000999162,0.00009987011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004579373,0.00016843728,0.00013889113,0.000086337575,0.00034038693,0.00015458706,0.00089847896,0.0001107592,0.000016423512],"category_scores_gemma":[0.00021774527,0.00010723289,0.000110857,0.0003277302,0.00007746952,0.00010113535,0.00008361272,0.00038675364,0.00010064653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011227528,0.000097946424,0.00006108283,0.0000040574187,0.000013711432,0.0000019283652,0.00013949214,0.000015097131,0.0017542314,0.98121995,0.015930131,0.0007511586],"study_design_scores_gemma":[0.00074306544,0.0003333159,0.00018568737,0.000017078626,0.0000067695896,0.0000026735954,0.000004984889,0.0023671556,0.008126127,0.98503554,0.0030253958,0.00015222684],"about_ca_topic_score_codex":0.000012949229,"about_ca_topic_score_gemma":0.0000051307165,"teacher_disagreement_score":0.013935036,"about_ca_system_score_codex":0.000008446424,"about_ca_system_score_gemma":0.000041544045,"threshold_uncertainty_score":0.437283},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86170924,0.00006443236,0.11682702,0.00037397057,0.0012694835,0.00029680473,0.0000014360606,0.00022129396,0.019236298],"genre_scores_gemma":[0.99516124,0.00000447164,0.004659592,0.00004064743,0.00000357375,0.0000132170735,0.0000014454045,0.000010227028,0.000105604995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986494,0.00018687443,0.00021010543,0.00028832201,0.00039636725,0.00026892696],"domain_scores_gemma":[0.9986059,0.00035224008,0.00011089195,0.00067494466,0.00016128292,0.00009472364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067337614,0.00010768425,0.00017427151,0.00016882745,0.00009012789,0.000039289374,0.00092226063,0.000054522083,0.000011712202],"category_scores_gemma":[0.00021113276,0.00010745836,0.00007617722,0.00073671894,0.00012058747,0.00046549673,0.00019690728,0.00011395208,0.000040097213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009500467,0.000068109504,0.0007935676,0.000010293846,0.0000090744825,0.0000011753602,0.00022176011,0.000027295384,0.0031607049,0.98535633,0.00014399421,0.010198166],"study_design_scores_gemma":[0.0006912577,0.0001369009,0.0018400976,0.000011896388,0.0000024489914,0.0000017205173,0.000014940795,0.005410337,0.017769648,0.9735889,0.0004110726,0.000120807745],"about_ca_topic_score_codex":0.000016082851,"about_ca_topic_score_gemma":0.000002216845,"teacher_disagreement_score":0.13345195,"about_ca_system_score_codex":0.000026636015,"about_ca_system_score_gemma":0.000025612393,"threshold_uncertainty_score":0.4382025},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9983558,0.00009166333,0.000030425355,0.00018787746,0.0007972391,0.00010184178,5.442315e-7,0.00009558562,0.00033899237],"genre_scores_gemma":[0.9980461,0.00000532447,0.0018570544,0.00003147609,2.671534e-7,0.0000052450437,5.2866244e-7,0.000007645116,0.000046376532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999214,0.000022243732,0.00014568631,0.00024882102,0.00020222495,0.000167012],"domain_scores_gemma":[0.99923104,0.000036061727,0.000078888996,0.00042983692,0.00013237153,0.000091772104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015820161,0.000113566,0.00015695732,0.00008540196,0.00008608616,0.000050370265,0.0003452229,0.000056392797,0.000003038919],"category_scores_gemma":[0.000024772498,0.00007649333,0.000025415755,0.00031890636,0.00015745002,0.00022781089,0.00012140217,0.0001545824,0.0000021258168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059684885,0.00006959754,0.02279233,0.000018280556,0.000014338596,0.0000025202658,0.00058115955,0.000002678669,0.015701126,0.9601578,0.00013316254,0.00052105327],"study_design_scores_gemma":[0.00091464457,0.0002969443,0.014579554,0.00005097471,0.000011649863,0.000013463423,0.00004657737,0.0008118461,0.05782098,0.924967,0.00024340872,0.00024295205],"about_ca_topic_score_codex":0.000089330395,"about_ca_topic_score_gemma":0.000009555428,"teacher_disagreement_score":0.042119853,"about_ca_system_score_codex":0.0000026080438,"about_ca_system_score_gemma":0.000040668212,"threshold_uncertainty_score":0.31193072},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88654023,0.0000131340075,0.016865155,0.0019904606,0.0011555933,0.0022144148,0.000009813828,0.0003849148,0.09082628],"genre_scores_gemma":[0.94797266,0.0000010204078,0.04620632,0.00015537131,0.000016678216,0.0005305229,0.000020997188,0.00003509112,0.005061327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915564,0.000028253211,0.00029915397,0.00015659041,0.00016882631,0.00019156291],"domain_scores_gemma":[0.9989079,0.00049334794,0.00010128743,0.00024643223,0.00016655707,0.00008447842],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020704875,0.00012592749,0.00019158734,0.000031159743,0.000090091744,0.00007156131,0.00014250308,0.00007063882,0.0012964867],"category_scores_gemma":[0.0009451862,0.00009968945,0.00009252799,0.00009581489,0.000034338966,0.00018108089,0.000022589285,0.00007730402,0.00045083178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003016637,0.000119801596,0.000046169374,0.000082011196,0.000011415209,9.7101335e-8,0.00017142648,1.1268641e-8,0.000088687164,0.9224013,0.07625216,0.0008239054],"study_design_scores_gemma":[0.0005254839,0.00004968005,0.00013402471,0.000023589526,0.000014136987,0.0000015914413,0.000105092724,0.0027034667,0.00091334997,0.99166024,0.0037392608,0.00013009112],"about_ca_topic_score_codex":0.000012905715,"about_ca_topic_score_gemma":0.0000025723484,"teacher_disagreement_score":0.08576495,"about_ca_system_score_codex":0.00003949638,"about_ca_system_score_gemma":0.000015439926,"threshold_uncertainty_score":0.99961644},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5633743,0.0006420859,0.046136286,0.002563235,0.0062472005,0.0011058844,0.000017305858,0.0056813755,0.37423232],"genre_scores_gemma":[0.9682237,0.0000035789712,0.030654917,0.00060839107,0.00001486691,0.000027794065,0.0000032361638,0.000024050853,0.0004394924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986427,0.0000419751,0.00015614758,0.00032531758,0.00037540076,0.0004584861],"domain_scores_gemma":[0.9988041,0.00007573759,0.000095083495,0.0007152004,0.00013762563,0.00017226748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025493058,0.00018441888,0.00017214053,0.000101087375,0.00009851454,0.0003336512,0.0009245641,0.0000612164,0.000008164404],"category_scores_gemma":[0.00007323149,0.00016167898,0.000038368908,0.00036090543,0.00007175287,0.0017321237,0.00025778034,0.00016369582,0.0005495715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021442853,0.00055310037,0.004394445,0.00003589224,0.000025774172,0.000025992598,0.00040785334,2.581297e-7,0.00034401056,0.9554348,0.018549243,0.020207198],"study_design_scores_gemma":[0.0014153426,0.0012781541,0.01091974,0.00038683618,0.000019138828,0.0000991174,0.00001682577,0.00073540147,0.06662217,0.8806182,0.03668444,0.0012046469],"about_ca_topic_score_codex":0.0000066078755,"about_ca_topic_score_gemma":3.8569405e-7,"teacher_disagreement_score":0.40484938,"about_ca_system_score_codex":0.000058845275,"about_ca_system_score_gemma":0.00004998493,"threshold_uncertainty_score":0.70638126},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98637056,0.00010174181,0.010322951,0.00027521758,0.0006622448,0.00027057718,0.0000023716796,0.0002095681,0.001784747],"genre_scores_gemma":[0.994977,0.000004004897,0.004672361,0.000042279364,0.0000070431106,0.000026391303,0.0000054129923,0.000019361052,0.00024617597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813414,0.00019586498,0.00019569902,0.0005039554,0.0005395791,0.0004307615],"domain_scores_gemma":[0.99852157,0.00021424847,0.00009050089,0.0005945851,0.0002605472,0.00031855478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000510944,0.00020065845,0.0002195124,0.00020564483,0.00013817335,0.00017771318,0.00050847017,0.0000831105,0.0000043885434],"category_scores_gemma":[0.00013271646,0.00017818826,0.00003841433,0.000872767,0.00019232238,0.0010093983,0.00037104418,0.00024740424,0.00003073011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005795844,0.00009124323,0.0016417095,0.0000059761123,0.000028714176,0.000063942236,0.00091695244,0.000014966831,0.0002658714,0.9875627,0.0001654977,0.009184464],"study_design_scores_gemma":[0.00354348,0.00073598366,0.0037574375,0.000023286702,0.000009118635,0.00023043262,0.00020526715,0.0055754273,0.0017540307,0.9836891,0.00010193318,0.0003744542],"about_ca_topic_score_codex":0.00003542123,"about_ca_topic_score_gemma":0.000009237689,"teacher_disagreement_score":0.00881001,"about_ca_system_score_codex":0.000076091084,"about_ca_system_score_gemma":0.00010080653,"threshold_uncertainty_score":0.7266306},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8427499,0.00018587196,0.13466577,0.00047926625,0.0027527635,0.0003021123,0.00000350865,0.0005157664,0.01834505],"genre_scores_gemma":[0.99598247,0.000008607475,0.0037285308,0.00018512108,0.000009247567,0.000011362981,0.0000014336252,0.0000114203285,0.00006179486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985958,0.00019428604,0.00026033865,0.00036152973,0.0002707097,0.0003173659],"domain_scores_gemma":[0.99863553,0.00031873834,0.00012467183,0.00068353064,0.00012652663,0.00011101184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077953417,0.00017336248,0.00026985377,0.00015223295,0.00014530064,0.00005729548,0.00091700186,0.000087296474,0.000012653815],"category_scores_gemma":[0.000049572347,0.00017307122,0.00013915414,0.0006647359,0.00012914733,0.00029926156,0.00013810303,0.00015650375,0.000037262904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012766891,0.00012280601,0.00029736364,0.000012529644,0.000028253722,0.000004704177,0.0005759,0.000018287543,0.0038053321,0.99233866,0.0008140073,0.001969372],"study_design_scores_gemma":[0.0007703659,0.00036767288,0.0014564091,0.000042512627,0.000017917535,0.000009775148,0.000019239156,0.004451795,0.018501412,0.97199965,0.002120112,0.00024314251],"about_ca_topic_score_codex":0.000016034386,"about_ca_topic_score_gemma":0.0000012552455,"teacher_disagreement_score":0.1532326,"about_ca_system_score_codex":0.000020748315,"about_ca_system_score_gemma":0.00004791001,"threshold_uncertainty_score":0.70576394},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99430066,0.000006779394,0.00027798233,0.000037649905,0.00007316012,0.00013422316,0.000030361225,0.000013033723,0.005126176],"genre_scores_gemma":[0.9986114,0.000002982737,0.001211226,0.000008945887,0.0000030060799,0.000024276267,0.000017052716,0.0000117453865,0.000109402594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999481,0.000013665022,0.00017051159,0.000120315824,0.00009801891,0.00011649508],"domain_scores_gemma":[0.99930406,0.00020148263,0.00014441645,0.0002026635,0.000101781094,0.00004560756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006836011,0.00009769068,0.00021594558,0.000024428513,0.000054460448,0.0000065131007,0.00007232775,0.000029882829,0.0000790235],"category_scores_gemma":[0.000027902764,0.00007664212,0.000036027395,0.00020723889,0.0001515454,0.000043458138,0.000026306261,0.000102684025,0.0000018410377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014654257,0.00014867693,0.00597432,0.000008029579,0.000048168426,8.2635104e-8,0.00010308348,0.000005887196,0.002920397,0.9903892,0.00006481884,0.00032266596],"study_design_scores_gemma":[0.00077964715,0.000074302436,0.001297915,0.000024553015,0.00002440866,1.0954571e-7,0.00011238995,0.00005520025,0.013624129,0.98368233,0.00023345913,0.000091567876],"about_ca_topic_score_codex":0.00004926768,"about_ca_topic_score_gemma":0.0000068030054,"teacher_disagreement_score":0.010703732,"about_ca_system_score_codex":0.0000025266638,"about_ca_system_score_gemma":0.00001552879,"threshold_uncertainty_score":0.31253752},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942121,0.00013722912,0.00002308137,0.00029607036,0.00013176323,0.00023189445,0.0000032840092,0.000041212126,0.00492336],"genre_scores_gemma":[0.99915224,0.0000172009,0.00048764917,0.000017836172,0.0000037533594,0.000027876305,0.0000015703775,0.000016595804,0.00027529144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999302,0.00007083025,0.00016492071,0.00013569687,0.0001605621,0.00016595807],"domain_scores_gemma":[0.9990285,0.0003153782,0.000105741776,0.00034661227,0.00010764723,0.00009614636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036540514,0.00010944925,0.00015875608,0.000040357692,0.000148989,0.000024990613,0.00018110909,0.0000427555,0.00000523942],"category_scores_gemma":[0.00008661581,0.00007000579,0.00002816648,0.00035146278,0.00025268673,0.0000551208,0.000031626678,0.00010646457,0.000005521769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037639053,0.000090691996,0.0030366345,0.000010347508,0.00003680363,0.000001445102,0.0005442169,3.9637425e-7,0.000102557446,0.9948677,0.0010496639,0.0002219259],"study_design_scores_gemma":[0.00082179304,0.0001183683,0.00083095324,0.000014313482,0.000034183824,0.0000097771335,0.0004701698,0.0000135612045,0.0012687951,0.99485844,0.0014600313,0.00009959527],"about_ca_topic_score_codex":0.000014938876,"about_ca_topic_score_gemma":0.00003331316,"teacher_disagreement_score":0.0049401214,"about_ca_system_score_codex":0.000008712657,"about_ca_system_score_gemma":0.00003807546,"threshold_uncertainty_score":0.2854753},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98807603,0.000055663826,0.000012807499,0.00060615723,0.00015001727,0.00025668854,0.0000050867397,0.00004270736,0.010794826],"genre_scores_gemma":[0.99962395,0.000009922844,0.00011235721,0.00007998305,0.0000036620831,0.000034572964,0.0000012943502,0.000014766308,0.000119478784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992438,0.000109142275,0.00019200887,0.00014579097,0.00016849482,0.00014079583],"domain_scores_gemma":[0.99852747,0.00082644896,0.00011218866,0.000404156,0.000045758658,0.000083964835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005102433,0.000110457266,0.00017361138,0.0000774422,0.000092454844,0.000017069506,0.00021009667,0.00005469648,0.000016027197],"category_scores_gemma":[0.00027010252,0.00007706925,0.000054616692,0.00036316144,0.00013761572,0.000038180086,0.00003432291,0.00013158054,0.000018029214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016732083,0.00016586311,0.00038984994,0.0000103642,0.000021110382,8.498014e-7,0.0004501575,1.7580086e-7,0.00029255575,0.9955771,0.002898247,0.00017696944],"study_design_scores_gemma":[0.0005049852,0.000096771706,0.0007852011,0.000016394704,0.000025962823,0.000002766199,0.00025916763,0.000009094199,0.0033848302,0.9944465,0.00038088582,0.00008743977],"about_ca_topic_score_codex":0.000007274156,"about_ca_topic_score_gemma":0.0000027523654,"teacher_disagreement_score":0.011547917,"about_ca_system_score_codex":0.0000109165485,"about_ca_system_score_gemma":0.000017385224,"threshold_uncertainty_score":0.3142793},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99322313,0.00009405541,0.003297227,0.00017362219,0.0010398069,0.00021919892,0.0000056415724,0.000107122556,0.0018402188],"genre_scores_gemma":[0.9944915,0.000043181295,0.0053816587,0.000032444696,0.0000034623495,0.000021887121,0.00000196383,0.0000092245255,0.000014651059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844587,0.00011575657,0.00025189389,0.0004109624,0.00044038612,0.00033514027],"domain_scores_gemma":[0.9985596,0.00019502762,0.00013002146,0.00067651086,0.00027068777,0.00016817814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064056274,0.00016273127,0.00021921027,0.00021375813,0.00013845172,0.00007600445,0.0007870118,0.00012010028,0.000014343759],"category_scores_gemma":[0.00012721062,0.00016118037,0.00009844867,0.0020489667,0.0004955684,0.00051250844,0.00028901536,0.00031100557,0.000010913646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014619684,0.00008870743,0.11083977,0.000014552695,0.000020666488,0.000005704432,0.00006944221,2.3057271e-7,0.0017154667,0.8824924,0.00004362204,0.0046948],"study_design_scores_gemma":[0.0008845933,0.00007832697,0.06574441,0.000012032495,0.0000070127903,0.00004220392,0.000014108729,0.00031904978,0.0012112985,0.9313778,0.00015242946,0.00015669529],"about_ca_topic_score_codex":0.000035391997,"about_ca_topic_score_gemma":0.00003071599,"teacher_disagreement_score":0.048885424,"about_ca_system_score_codex":0.000009253447,"about_ca_system_score_gemma":0.000042137235,"threshold_uncertainty_score":0.65727454},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9558794,0.00031255404,0.000011073708,0.0000013459519,0.002114264,0.00008937784,0.0000041966728,0.00040348672,0.041184295],"genre_scores_gemma":[0.99980104,0.000016718332,0.0000747589,0.0000046136765,0.0000021518176,0.000012169573,0.0000024458031,0.000022873133,0.000063240295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994334,0.000031838186,0.00019656905,0.00009074855,0.000090724854,0.00015674242],"domain_scores_gemma":[0.99959993,0.00002418116,0.000032628024,0.00025166592,0.000036643392,0.000054964024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011553175,0.00010699164,0.0001774611,0.000085016276,0.00002375638,0.0000038159874,0.00016258207,0.000068568064,0.0001406401],"category_scores_gemma":[0.000009348248,0.0001071594,0.00007026666,0.00026690733,0.00004705603,0.00006603074,0.0000136020835,0.00008077656,0.00004754908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011689565,0.00006170328,0.006817578,0.0000570743,0.00007899309,0.0000067091737,0.0009810397,0.000007068124,0.006493716,0.98368376,0.0015337901,0.0002668765],"study_design_scores_gemma":[0.0006928943,0.000098697295,0.019758713,0.000057842302,0.000029691308,0.00000778025,0.00012079526,0.0003535288,0.07309894,0.90441287,0.001081763,0.00028647922],"about_ca_topic_score_codex":0.000023198136,"about_ca_topic_score_gemma":0.0000017284548,"teacher_disagreement_score":0.07927089,"about_ca_system_score_codex":0.000008425074,"about_ca_system_score_gemma":0.0000041930657,"threshold_uncertainty_score":0.43698335},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.801712,0.000027540666,0.0014934286,0.0061638765,0.00048745703,0.00073522225,0.000011368336,0.00043348692,0.18893564],"genre_scores_gemma":[0.9942736,0.0000050864955,0.0047258427,0.00028940363,0.0000073065276,0.00001634134,0.0000019893582,0.000013386763,0.0006670326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993203,0.000015036234,0.00017911557,0.0001454569,0.00018112149,0.00015891489],"domain_scores_gemma":[0.9992677,0.0001913126,0.000057570895,0.00038539828,0.00003281819,0.00006518471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014504079,0.00010802457,0.00015367045,0.00003836234,0.00007984989,0.00002330691,0.00016983846,0.000055577555,0.00008292527],"category_scores_gemma":[0.00007846393,0.00009658772,0.00006854782,0.00013329477,0.000014625852,0.00003137171,0.0000070406495,0.00010707797,0.00015644784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003723937,0.000300936,0.0000023457537,0.000010168187,0.0000049427053,0.000001754335,0.00028899932,4.3730128e-7,0.00042389054,0.9665426,0.031305525,0.0011146925],"study_design_scores_gemma":[0.00039476392,0.00010054182,0.00006983165,0.000025283709,0.00001569295,0.0000017483143,0.000014149332,0.00017931676,0.0020288301,0.98843026,0.008626882,0.00011266959],"about_ca_topic_score_codex":0.0000012424845,"about_ca_topic_score_gemma":6.498457e-7,"teacher_disagreement_score":0.19256164,"about_ca_system_score_codex":0.000024866293,"about_ca_system_score_gemma":0.000014532383,"threshold_uncertainty_score":0.39387327},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85473996,0.00068646413,0.07149956,0.009958182,0.004284783,0.0014380291,0.0000022863574,0.0008932056,0.05649756],"genre_scores_gemma":[0.9797181,0.000044547538,0.018513378,0.0004203566,0.000004213387,0.00003434085,0.0000015231562,0.000010421768,0.001253106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990285,0.00005590163,0.0001558254,0.00027953146,0.00021007749,0.00027018762],"domain_scores_gemma":[0.999179,0.00007462786,0.000040984178,0.00039732238,0.00012915909,0.00017888978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015231759,0.0001092043,0.00011920551,0.00006864306,0.000117638905,0.00028986565,0.00048866676,0.00005955663,0.0001014065],"category_scores_gemma":[0.00004231029,0.00009981694,0.000026363392,0.00025398185,0.00004194535,0.00062822225,0.0002737192,0.00011405578,0.00041126346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013286608,0.00008365965,0.001900112,0.000014502001,0.000014329744,0.0000060529323,0.00048597262,0.000028379876,0.00048452758,0.9518044,0.021806464,0.023370285],"study_design_scores_gemma":[0.0013094629,0.00018944072,0.0065288427,0.000022225844,0.0000035650255,0.00001403945,0.000025200477,0.16263832,0.00039787445,0.82144564,0.0070784106,0.00034699452],"about_ca_topic_score_codex":0.00005734879,"about_ca_topic_score_gemma":0.0000032708767,"teacher_disagreement_score":0.16260995,"about_ca_system_score_codex":0.000018092505,"about_ca_system_score_gemma":0.000037879705,"threshold_uncertainty_score":0.5286097},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9874752,0.001148919,0.00029639763,0.0005947312,0.0042432384,0.000100501675,4.9168403e-7,0.00012238476,0.006018132],"genre_scores_gemma":[0.9980525,0.000030512723,0.0016384175,0.000099599085,0.0000012126496,0.000007646612,3.1307516e-7,0.000005351172,0.00016444329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990884,0.00006321372,0.0001869057,0.00012374032,0.00023636113,0.00030137534],"domain_scores_gemma":[0.9989811,0.00016353656,0.00008886681,0.0005780979,0.00009415351,0.00009423584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006107514,0.00008131038,0.00009928111,0.000030597857,0.00017514412,0.000040936393,0.0005670257,0.000040585313,0.0000058921432],"category_scores_gemma":[0.000046645826,0.000054468368,0.00006727318,0.00039615456,0.000081606246,0.00022466123,0.00017702123,0.00009268046,0.00009477675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012945986,0.00006094412,0.011589344,0.0000027322017,0.000011294364,3.317837e-7,0.00021126585,8.109773e-7,0.00021969159,0.98382515,0.0028672025,0.0012099674],"study_design_scores_gemma":[0.00023910111,0.000020174703,0.0040209424,0.000008507832,0.0000044679714,0.000007980871,0.000012968897,0.0001412257,0.0019000794,0.99024576,0.0033172718,0.00008149498],"about_ca_topic_score_codex":0.000031569143,"about_ca_topic_score_gemma":6.0170305e-7,"teacher_disagreement_score":0.0105773,"about_ca_system_score_codex":0.0000064275578,"about_ca_system_score_gemma":0.000020694353,"threshold_uncertainty_score":0.22211556},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9956257,0.0005930004,0.00014770347,0.00008381251,0.001655835,0.0001435675,0.0000010418568,0.00004718525,0.0017021723],"genre_scores_gemma":[0.99842376,0.000028614353,0.0014488995,0.000018178323,4.581449e-7,0.000008698935,4.1686656e-7,0.000007196764,0.000063789375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879503,0.00007447073,0.00034688323,0.00022464183,0.0003170031,0.00024193981],"domain_scores_gemma":[0.9987866,0.00011196014,0.00019540028,0.0006422837,0.00018849962,0.000075221666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005398752,0.00011738676,0.00020421737,0.00006927935,0.00012816288,0.00002188137,0.00068384304,0.000057094254,0.000005024544],"category_scores_gemma":[0.000051155013,0.000085443775,0.00010480362,0.00039620974,0.00015371828,0.0001297889,0.0002256682,0.00010438425,0.000006593394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025379588,0.0001404882,0.0015733781,0.000014176731,0.00004003973,0.0000036806332,0.00088049076,0.0000052326945,0.0026688823,0.99235725,0.00040662245,0.001884376],"study_design_scores_gemma":[0.0011813472,0.00037936337,0.012300389,0.00006653012,0.00001906794,0.000010189477,0.00006068474,0.0014647761,0.06274908,0.9214029,0.00021201471,0.00015371277],"about_ca_topic_score_codex":0.0001178286,"about_ca_topic_score_gemma":0.000003942378,"teacher_disagreement_score":0.070954405,"about_ca_system_score_codex":0.000011915677,"about_ca_system_score_gemma":0.000051790703,"threshold_uncertainty_score":0.34842962},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99287933,0.00011140681,0.000120175406,0.00040330377,0.0033451177,0.00012071699,0.0000016328806,0.00009311113,0.0029251913],"genre_scores_gemma":[0.99892443,0.0000025721606,0.00073814596,0.00025107106,0.0000027564802,0.000009336167,0.0000021178726,0.000009820241,0.000059740938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873847,0.00009947666,0.00025491617,0.00019411602,0.0003740542,0.00033895677],"domain_scores_gemma":[0.9986918,0.00038334655,0.00013417547,0.0006200605,0.00006222736,0.0001084192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005433521,0.00014191093,0.0001742032,0.00004422084,0.00014337062,0.000063560394,0.0005065531,0.000050740095,0.00003452036],"category_scores_gemma":[0.0001715629,0.00009528859,0.000080351296,0.00029435978,0.00005914083,0.00019324936,0.00018357013,0.0001617227,0.00014212115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028404,0.00016797385,0.004301843,0.000013311282,0.000020961457,0.0000025213378,0.0008155779,0.0000062660397,0.0002167695,0.99004614,0.004132051,0.00027371637],"study_design_scores_gemma":[0.0005182603,0.00008073421,0.006940574,0.0001302352,0.000014044817,0.00003091515,0.000034289606,0.0014037469,0.002040124,0.98848873,0.000116190175,0.00020214547],"about_ca_topic_score_codex":0.00004168868,"about_ca_topic_score_gemma":4.3401585e-7,"teacher_disagreement_score":0.006045095,"about_ca_system_score_codex":0.000018491515,"about_ca_system_score_gemma":0.00001722543,"threshold_uncertainty_score":0.38857558},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9859101,0.000016817674,0.000011432936,0.0008677507,0.00018375911,0.00034840783,0.0000029639398,0.00004889285,0.012609835],"genre_scores_gemma":[0.99933505,0.0000051596567,0.00020890067,0.00009340448,0.0000030860704,0.000079381345,0.000001187356,0.000014483532,0.00025934636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999312,0.000080771104,0.00019001309,0.00012087901,0.00013798934,0.00015834837],"domain_scores_gemma":[0.99844825,0.0008080588,0.00009919497,0.0005519352,0.00004774625,0.00004478632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024142672,0.00009794389,0.00014119883,0.00004256105,0.00011562833,0.000016982574,0.000278675,0.000044612578,0.00038397263],"category_scores_gemma":[0.00014006851,0.000067128785,0.00009798119,0.00023525272,0.00011694179,0.000050540864,0.000028308317,0.0001372471,0.00016452231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036167776,0.00028793304,0.00014820886,0.000008194407,0.000022284798,2.4023478e-7,0.00019627008,2.5179358e-7,0.0008855015,0.9882187,0.010117608,0.00011115802],"study_design_scores_gemma":[0.00022661277,0.00007857027,0.001275621,0.000013878651,0.000014016335,0.000001226402,0.000116415446,0.00002945009,0.005990643,0.9919981,0.00017886382,0.00007663089],"about_ca_topic_score_codex":0.000024044686,"about_ca_topic_score_gemma":0.0000015302548,"teacher_disagreement_score":0.013424911,"about_ca_system_score_codex":0.000009784189,"about_ca_system_score_gemma":0.00001062438,"threshold_uncertainty_score":0.4204231},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946537,0.0001641026,0.0001151866,0.00002470297,0.0005189549,0.00022749919,0.000012690096,0.00006372535,0.004219448],"genre_scores_gemma":[0.9994413,0.0000019188708,0.00015501695,0.000016583386,0.000019413023,0.000051570718,0.0000055985606,0.00002133662,0.00028722564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903667,0.00008923597,0.00029493225,0.00012028184,0.0001970447,0.00026180662],"domain_scores_gemma":[0.9989103,0.0003514663,0.0001610643,0.00038640545,0.00008305079,0.000107714746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042311483,0.00012231279,0.00023567709,0.0000587085,0.00009283324,0.000013424235,0.00018635708,0.000084662264,0.00014153727],"category_scores_gemma":[0.0001051598,0.00011563456,0.00008315459,0.00020591587,0.000074909025,0.000113728376,0.000051062536,0.00011394077,0.000041660245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010101334,0.00032356064,0.016192924,0.00006507911,0.000031718926,4.213483e-7,0.00036921498,0.0000010219394,0.0014901041,0.97931427,0.002149904,0.000051663712],"study_design_scores_gemma":[0.00046875034,0.000027983406,0.0067121033,0.00001742415,0.000033981643,0.000009793658,0.00037954678,0.000067662986,0.001763335,0.9882904,0.0020889577,0.00014006198],"about_ca_topic_score_codex":0.000014470934,"about_ca_topic_score_gemma":6.4041376e-7,"teacher_disagreement_score":0.009480822,"about_ca_system_score_codex":0.000022016604,"about_ca_system_score_gemma":0.00002469708,"threshold_uncertainty_score":0.47154406},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98135954,0.000026866144,0.0001391808,0.00004642373,0.00011040435,0.00018769427,0.0000017819796,0.000018281433,0.018109836],"genre_scores_gemma":[0.9992379,0.0000046326395,0.00065526296,0.00002946406,0.0000017315026,0.000045094774,0.0000010632741,0.0000085822885,0.000016294814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938875,0.00007538303,0.00021549362,0.00009484052,0.000098181285,0.00012733795],"domain_scores_gemma":[0.9990899,0.0003086765,0.00010742889,0.00045082482,0.000026336202,0.00001683378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005820934,0.00007384087,0.00012625841,0.000040978717,0.00007155633,0.000005412166,0.00038764047,0.0000354035,0.000017440947],"category_scores_gemma":[0.00006444433,0.0000551335,0.000055683642,0.0003463309,0.00008624505,0.000049109065,0.00003310804,0.00013008024,0.0000061535334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056676868,0.00024525056,0.0056066695,0.000021333019,0.0000064557817,0.0000011361956,0.0045023253,4.8481702e-8,0.00015101071,0.98919696,0.00019184759,0.00007129587],"study_design_scores_gemma":[0.00023597038,0.000022142862,0.010106845,0.000027515774,0.000010526686,0.0000012769003,0.000945471,0.000006732512,0.0018787907,0.9866448,0.00005810709,0.00006179897],"about_ca_topic_score_codex":0.000027361963,"about_ca_topic_score_gemma":0.000015178303,"teacher_disagreement_score":0.01809354,"about_ca_system_score_codex":0.000005653893,"about_ca_system_score_gemma":0.000006058253,"threshold_uncertainty_score":0.22482789},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99134016,0.00037459383,0.00006069408,0.00025573405,0.0023460323,0.00010748381,0.000013613051,0.00004336857,0.0054583116],"genre_scores_gemma":[0.99466634,0.0000055536175,0.0015637839,0.00009690376,0.00072513305,0.0000061256787,0.000040344512,0.000021711408,0.0028741034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910235,0.000034212353,0.00016115893,0.00014713412,0.00013506597,0.00042005227],"domain_scores_gemma":[0.99939007,0.000025830393,0.000058911326,0.00023905284,0.000022521464,0.0002636373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010189589,0.00014339731,0.0001731816,0.000027217064,0.000101532,0.000043975808,0.0001577031,0.00004136135,0.00048102246],"category_scores_gemma":[0.0000031612844,0.00013264622,0.00010773262,0.00009353775,0.000031672767,0.00031077466,0.00006247367,0.00013463355,0.00025912386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045236266,0.000108340704,0.018654272,0.0000019808617,0.00003856727,6.492941e-7,0.00019886428,0.000016870295,0.0006198523,0.97344947,0.0058987746,0.0010078648],"study_design_scores_gemma":[0.0023516286,0.00007823102,0.0052835955,0.000018527473,0.00006657434,0.0000024455971,0.00022874761,0.00048323043,0.011754546,0.89375496,0.085363716,0.0006137697],"about_ca_topic_score_codex":0.00045287205,"about_ca_topic_score_gemma":3.6693422e-7,"teacher_disagreement_score":0.07969446,"about_ca_system_score_codex":0.000021847316,"about_ca_system_score_gemma":0.00007692237,"threshold_uncertainty_score":0.5409156},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97328764,0.0002237877,0.0027333398,0.0050756205,0.005469928,0.00047105167,0.000003578632,0.00080770295,0.011927323],"genre_scores_gemma":[0.9772157,0.0000064623114,0.02190433,0.00057404686,0.000017239798,0.000029405022,0.000004543104,0.000022826973,0.00022544636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973046,0.00030621106,0.00045987376,0.00073733786,0.0005779606,0.0006140144],"domain_scores_gemma":[0.99752223,0.000554362,0.00007646922,0.0010940767,0.0004622244,0.00029062098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079819665,0.0002851727,0.00041463051,0.00023843897,0.000096552496,0.0002489883,0.0012741768,0.00014767927,0.000019705452],"category_scores_gemma":[0.0012737238,0.00028461593,0.0000761394,0.0010782811,0.00014429446,0.00080095447,0.00065673876,0.0003584923,0.00020464128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042178373,0.0004736451,0.0017760037,0.000018780938,0.000008665798,0.00023041219,0.00031344898,0.00016151692,0.00015428336,0.9915525,0.0043318076,0.0009368025],"study_design_scores_gemma":[0.0013719781,0.0010201472,0.008163411,0.000042983058,0.000003952106,0.00005728361,0.000091800845,0.01858767,0.0006542639,0.96797556,0.0016515556,0.00037941342],"about_ca_topic_score_codex":0.00009932068,"about_ca_topic_score_gemma":0.00002686185,"teacher_disagreement_score":0.023576913,"about_ca_system_score_codex":0.00029734775,"about_ca_system_score_gemma":0.00030819429,"threshold_uncertainty_score":0.9999606},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.998846,0.0006049441,0.000006058249,0.00013088669,0.00006559908,0.000145925,7.5525634e-7,0.0000023860975,0.00019747905],"genre_scores_gemma":[0.9996769,0.00011901057,0.00006451081,0.00010436467,0.0000031934471,0.000008755409,0.00001496105,0.000002564619,0.0000057503635],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9995762,0.000066904424,0.000107509106,0.00012223792,0.0000445955,0.00008253323],"domain_scores_gemma":[0.9997957,0.00002944506,0.00004268354,0.000084532716,0.00003065622,0.000017002047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014107238,0.000058052312,0.00007309472,0.000017921857,0.000034440196,0.00001483543,0.00006356947,0.00005995668,0.0000023734876],"category_scores_gemma":[0.000017889268,0.000039705734,0.000015824982,0.00005019999,0.00007130989,0.000003223582,0.000051379182,0.00004549463,8.305113e-7],"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.000027209671,0.0001089168,0.04111113,0.000024809919,0.000013207594,0.0000011146676,0.00013978405,0.0000027890283,0.92605263,0.022600602,0.00021110784,0.009706669],"study_design_scores_gemma":[0.0013698076,0.00075640983,0.78551316,0.000027538345,0.0000136932185,0.000018072597,0.00018273512,0.00056009763,0.059693627,0.1514987,0.00018776319,0.00017840468],"about_ca_topic_score_codex":0.00003892515,"about_ca_topic_score_gemma":0.0000029391779,"teacher_disagreement_score":0.86635906,"about_ca_system_score_codex":0.0000025817158,"about_ca_system_score_gemma":0.0000042753654,"threshold_uncertainty_score":0.16191529},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9751031,0.000099140554,0.006176062,0.009935204,0.00450189,0.0006227226,0.0000014783113,0.00022577212,0.003334677],"genre_scores_gemma":[0.9973884,0.0000047705403,0.001440916,0.0010341811,0.000034150537,0.00004601739,7.1195313e-7,0.0000138089335,0.00003704115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981098,0.00037867232,0.00022010828,0.00051538856,0.00043513556,0.0003408943],"domain_scores_gemma":[0.9960832,0.0019082893,0.00009229262,0.0017230761,0.00009861067,0.000094534626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018422218,0.00022116167,0.00021891684,0.00004318534,0.000453549,0.0003644147,0.0019014064,0.000076157325,0.000027421616],"category_scores_gemma":[0.00037139663,0.00011482596,0.00010419756,0.00037023076,0.00051489286,0.00019725185,0.0008167664,0.0006241747,0.00005463392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000106173875,0.000077824,0.00024189247,0.0000028814366,0.000012759146,0.0000049829264,0.00055681623,0.000017147648,0.00009337131,0.99274105,0.00021131175,0.0060293367],"study_design_scores_gemma":[0.001160246,0.000086789005,0.0045684366,0.000005859178,0.000006164922,0.000017824786,0.000027206408,0.069152735,0.00014581576,0.9238748,0.0007998841,0.00015421501],"about_ca_topic_score_codex":0.000063483814,"about_ca_topic_score_gemma":0.000018576662,"teacher_disagreement_score":0.06913559,"about_ca_system_score_codex":0.000023492667,"about_ca_system_score_gemma":0.000030252988,"threshold_uncertainty_score":0.4682467},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5617074,0.000070797614,0.43748128,0.000051393,0.00038452644,0.00007712707,0.0000024632943,0.000079441714,0.00014560686],"genre_scores_gemma":[0.94797415,0.000003903937,0.051919203,0.00004737589,0.0000072105286,0.0000031409577,0.000005014956,0.000008912616,0.000031064246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989912,0.00006466451,0.00019314686,0.00029341184,0.00028957907,0.0001679984],"domain_scores_gemma":[0.99868727,0.00038967267,0.000138144,0.00049705326,0.0001576682,0.00013021023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015266986,0.00013277812,0.00017988891,0.00013889554,0.000065708744,0.00007033146,0.00035978624,0.00008353133,0.00000963135],"category_scores_gemma":[0.00015384701,0.0001240598,0.000052107043,0.0005132444,0.00007079039,0.00026591227,0.000088207256,0.00011792277,0.0000056743106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007699447,0.00010215452,0.0022633339,0.000009102329,0.00007446515,0.0000070415776,0.0021355872,0.008098242,0.0005391687,0.9775798,0.0001150033,0.008999157],"study_design_scores_gemma":[0.00077845476,0.00012262701,0.00016429207,0.000025629073,0.0000263611,0.0000045024467,0.000041170268,0.3409318,0.0017655451,0.6559861,0.000029073373,0.00012444079],"about_ca_topic_score_codex":0.00011159789,"about_ca_topic_score_gemma":0.0000082797915,"teacher_disagreement_score":0.38626683,"about_ca_system_score_codex":0.000032260203,"about_ca_system_score_gemma":0.00013709994,"threshold_uncertainty_score":0.5059012},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97707474,0.000022067534,0.000068179295,0.00006170483,0.00013485496,0.00018834608,0.000002562564,0.00005506802,0.022392476],"genre_scores_gemma":[0.9987474,0.00001498458,0.0008885048,0.000020386646,0.0000022411325,0.00004854872,0.0000010703451,0.000023633438,0.00025321232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999222,0.00007658714,0.0002149928,0.00014264205,0.00015901179,0.00018476196],"domain_scores_gemma":[0.9988169,0.0003431138,0.00016103608,0.0005540351,0.000073701725,0.000051201223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032125125,0.000117916796,0.00015607843,0.000033523585,0.00023448003,0.000013903356,0.00036878945,0.000054752694,0.000042016327],"category_scores_gemma":[0.000029521707,0.000076226126,0.0000649093,0.00032204282,0.00018569296,0.00007662851,0.000058172063,0.0001486513,0.00002117962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000187775,0.0001485914,0.00904467,0.000011281203,0.00004681814,6.495225e-7,0.00096593023,2.2854665e-7,0.00012164703,0.98897636,0.0002477601,0.00041729596],"study_design_scores_gemma":[0.00036098727,0.000037529844,0.0045706336,0.000026358302,0.000034412245,0.0000069711,0.000454076,0.0000064984083,0.0015552461,0.9922968,0.00054602115,0.00010444108],"about_ca_topic_score_codex":0.000053281034,"about_ca_topic_score_gemma":0.000020058334,"teacher_disagreement_score":0.022139264,"about_ca_system_score_codex":0.000008537061,"about_ca_system_score_gemma":0.000019953424,"threshold_uncertainty_score":0.3108411},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98750335,0.00023631273,0.00093693525,0.00011742703,0.0021121053,0.00014210836,0.000001369243,0.0001957469,0.008754631],"genre_scores_gemma":[0.99276453,0.00000934417,0.006892146,0.00019924085,7.6560593e-7,0.000003794397,0.0000010918192,0.000010537072,0.000118541546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885136,0.000042126423,0.00025005607,0.00031688373,0.00027511583,0.0002644584],"domain_scores_gemma":[0.99884164,0.00004653142,0.000118150645,0.0007453047,0.000088742985,0.00015963754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021372507,0.0001365258,0.00018359035,0.00015272068,0.00008301159,0.00003469512,0.00067891175,0.000067825546,0.00004110517],"category_scores_gemma":[0.000027472432,0.00012524956,0.00009146328,0.00050253887,0.00004700434,0.00015804691,0.00014943216,0.00011363696,0.00008602679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009102893,0.00011949875,0.0010870118,0.0000060086663,0.000017372617,0.000009373955,0.0005275206,0.0000018400933,0.00040712973,0.98653483,0.006094481,0.0051858346],"study_design_scores_gemma":[0.0006161259,0.00033969502,0.0019820542,0.000016909162,0.0000065387408,0.000004262606,0.000007692662,0.00014074864,0.010381409,0.98562235,0.00074133876,0.0001408907],"about_ca_topic_score_codex":0.0003960606,"about_ca_topic_score_gemma":0.0000040860045,"teacher_disagreement_score":0.009974279,"about_ca_system_score_codex":0.000010866567,"about_ca_system_score_gemma":0.00007678613,"threshold_uncertainty_score":0.51075286},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97270155,0.00012412133,0.006933013,0.0012511307,0.005138417,0.0002954612,0.0000016089241,0.00058717345,0.012967501],"genre_scores_gemma":[0.9902991,0.000008484586,0.008935947,0.000114595845,0.000010140821,0.000023359964,0.0000013312842,0.000016497688,0.00059056585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841386,0.00007518947,0.00016903687,0.00044067448,0.0004373039,0.00046392463],"domain_scores_gemma":[0.99803793,0.0001574841,0.000054442397,0.0014091993,0.00013637962,0.00020456887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052611466,0.0001477284,0.00015258741,0.00017476488,0.00019718154,0.00013800431,0.0018067723,0.00009468053,0.000040481988],"category_scores_gemma":[0.00015442826,0.00014038107,0.00008932217,0.0008238113,0.00016744014,0.0006009898,0.00042970257,0.0005158307,0.00020733934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037553614,0.000057040867,0.0010779737,0.0000034055495,0.000008694629,0.000023274895,0.00009488997,8.595356e-7,0.010491481,0.9798795,0.0008607873,0.0074983537],"study_design_scores_gemma":[0.0003786114,0.000060443574,0.002175722,0.0000042459274,0.0000016071942,0.000016718765,0.000006534941,0.0005179947,0.013243013,0.97050124,0.012917226,0.00017662434],"about_ca_topic_score_codex":0.000007553434,"about_ca_topic_score_gemma":0.0000053636977,"teacher_disagreement_score":0.017597504,"about_ca_system_score_codex":0.000015192625,"about_ca_system_score_gemma":0.000053797314,"threshold_uncertainty_score":0.5724574},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98645395,0.00019362601,0.00006321658,0.00018477358,0.0006404379,0.00029769473,0.0000142224,0.000042192034,0.01210988],"genre_scores_gemma":[0.9989052,0.000012937238,0.0006119237,0.000008718336,0.0000063810508,0.000017964541,0.0000051103893,0.000031352803,0.00040045317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767447,0.0007233879,0.0004931725,0.00015933294,0.00063881243,0.00031081843],"domain_scores_gemma":[0.99574834,0.0023051694,0.00028733848,0.00084345485,0.0006941989,0.00012150745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00290873,0.00015292465,0.00036498473,0.00007589976,0.00011107191,0.000021157957,0.00069314067,0.000106949636,0.000014362357],"category_scores_gemma":[0.0027650362,0.00011028607,0.000089161884,0.0005052497,0.0004155788,0.00010070086,0.0002598361,0.00029386542,0.000020058038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012258191,0.00030961452,0.0018819529,0.00006361201,0.00006867882,0.0000046989758,0.0009234402,0.0000021832539,0.0019596457,0.98676276,0.007133884,0.0007669265],"study_design_scores_gemma":[0.0011644225,0.00030598431,0.0006858965,0.000029695668,0.000022108517,0.0000041331227,0.0004997217,0.00044414584,0.013741962,0.9826435,0.00034761959,0.0001108001],"about_ca_topic_score_codex":0.000053262702,"about_ca_topic_score_gemma":0.000035553858,"teacher_disagreement_score":0.012451202,"about_ca_system_score_codex":0.000071332106,"about_ca_system_score_gemma":0.00016575836,"threshold_uncertainty_score":0.44973356},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99692893,0.00033478503,0.00008319216,0.00005535909,0.0012954576,0.000054598804,5.999166e-7,0.00007160412,0.0011755012],"genre_scores_gemma":[0.99811274,0.000019196916,0.0017648871,0.000049506965,4.715165e-7,0.0000024215117,5.5782743e-7,0.0000058000915,0.00004440856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990873,0.000044239936,0.00017553769,0.00017738037,0.00026500842,0.00025058904],"domain_scores_gemma":[0.9992422,0.00008570197,0.00008663737,0.00035749804,0.00007890406,0.000149059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035409743,0.000103753,0.00014385156,0.00006571369,0.00006871089,0.000028202398,0.00030239162,0.00007282327,0.000011395038],"category_scores_gemma":[0.000039127815,0.000089223315,0.000038604823,0.0003336813,0.00007469985,0.00045995717,0.00018515773,0.00011377789,0.000019962034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.855481e-7,0.00005516441,0.25436583,0.000006114761,0.0000068719164,3.9855215e-7,0.0003954978,3.9568215e-7,0.0005004997,0.74418944,0.00021340867,0.00026571265],"study_design_scores_gemma":[0.00028880776,0.00003367402,0.067088164,0.000016063537,0.0000059987633,0.000008408036,0.000026167425,0.00013313336,0.008078042,0.9240828,0.000107549895,0.00013117469],"about_ca_topic_score_codex":0.000063011175,"about_ca_topic_score_gemma":4.854862e-7,"teacher_disagreement_score":0.18727766,"about_ca_system_score_codex":0.000005979962,"about_ca_system_score_gemma":0.000018133673,"threshold_uncertainty_score":0.36384213},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99577475,0.000045294928,0.00012600645,0.000026755628,0.0011140335,0.00004230686,9.2368595e-7,0.000070677044,0.0027992835],"genre_scores_gemma":[0.9962101,0.0000111846,0.0036993923,0.000026326152,2.617717e-7,0.000002102995,9.687957e-7,0.000005368017,0.000044303146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927264,0.000029158793,0.00016762454,0.00020754826,0.00017807334,0.00014497105],"domain_scores_gemma":[0.9994408,0.00006534709,0.00009307371,0.0002448565,0.00007523584,0.000080684076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017502188,0.00008950106,0.000120621065,0.00009215985,0.000085660584,0.000021030537,0.0002270258,0.000052570344,0.000037041493],"category_scores_gemma":[0.000024462515,0.00007927141,0.00004200893,0.00030237477,0.00006727608,0.00026834515,0.00010961566,0.00008978644,0.000020432388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017115465,0.000059653306,0.11600497,0.000004707833,0.000013167145,0.0000015871686,0.00043895424,2.2480708e-7,0.0006871128,0.88238627,0.00025350312,0.00014811041],"study_design_scores_gemma":[0.0002781245,0.00004646456,0.033294667,0.000014617628,0.0000053533045,0.000006725484,0.000027053042,0.00012830358,0.008640863,0.9573916,0.0000643787,0.00010180038],"about_ca_topic_score_codex":0.00009003504,"about_ca_topic_score_gemma":6.0969006e-7,"teacher_disagreement_score":0.08271031,"about_ca_system_score_codex":0.0000057547827,"about_ca_system_score_gemma":0.00002031171,"threshold_uncertainty_score":0.32325944},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98986,0.00049384014,0.0010080008,0.0003821678,0.0028498266,0.00012529473,0.000002812473,0.00020216087,0.0050759222],"genre_scores_gemma":[0.99890316,0.000024436098,0.0007650324,0.00023692216,0.000007821803,0.000008399065,0.0000015477686,0.000009863619,0.000042827076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870116,0.0000978548,0.00028984112,0.00030177349,0.0003575292,0.00025184083],"domain_scores_gemma":[0.9986514,0.00018853197,0.0001609202,0.00073480327,0.000096412085,0.00016797375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005796061,0.00014924184,0.00023246148,0.0001430654,0.00006237848,0.00005659904,0.0008546293,0.00006741508,0.000007689316],"category_scores_gemma":[0.00011683175,0.00013578177,0.000106593594,0.00047017226,0.00008270861,0.0003248256,0.00011516185,0.00014132887,0.00003584887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020956206,0.00017147763,0.0018017174,0.0000056258245,0.000020674965,0.000010608279,0.0002970224,0.000006104513,0.0012151292,0.9941209,0.0018015341,0.000528228],"study_design_scores_gemma":[0.00062180375,0.00040576168,0.0007468262,0.000026770866,0.0000069199336,0.0000049361274,0.000026823389,0.00011123481,0.0140979765,0.98230225,0.0014867776,0.00016194927],"about_ca_topic_score_codex":0.000009433709,"about_ca_topic_score_gemma":0.0000014690442,"teacher_disagreement_score":0.012882847,"about_ca_system_score_codex":0.000030156443,"about_ca_system_score_gemma":0.00009305339,"threshold_uncertainty_score":0.553702},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99003404,0.0006654829,0.000008536423,0.000041792668,0.0014909592,0.00008347443,0.0000019688682,0.00010944415,0.007564301],"genre_scores_gemma":[0.99961543,0.000031018633,0.000012775313,0.000044112894,0.00001733066,0.0000052776595,0.0000019607676,0.000011308449,0.0002607651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943644,0.000029300301,0.00018208456,0.00007310863,0.00012700546,0.00015204206],"domain_scores_gemma":[0.99963796,0.00002911198,0.00003066627,0.00025529662,0.00001862428,0.000028339002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015588234,0.000098343226,0.0001367347,0.00004455188,0.000061160645,0.00002574219,0.00022288653,0.000045474953,0.000015673697],"category_scores_gemma":[0.00001017083,0.00007480235,0.0000666771,0.00014003039,0.000043775533,0.00011127878,0.000013723086,0.000096838245,0.000010065776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002857606,0.000015774716,0.0019092675,0.00003154971,0.00002973442,0.0000041766125,0.0011474276,0.0005036043,0.010190178,0.98299265,0.0027975969,0.00037516776],"study_design_scores_gemma":[0.00034312328,0.000053213284,0.018778251,0.000054967877,0.000018707093,0.000010523498,0.00037497745,0.0019000681,0.017377038,0.9603843,0.00052731147,0.00017749291],"about_ca_topic_score_codex":0.000007301659,"about_ca_topic_score_gemma":0.0000010393198,"teacher_disagreement_score":0.02260834,"about_ca_system_score_codex":0.000014640329,"about_ca_system_score_gemma":0.0000033566414,"threshold_uncertainty_score":0.30503514},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9909496,0.00019392345,0.000062189625,0.000005917922,0.0052939476,0.00010696232,0.000048876827,0.0002041317,0.0031345014],"genre_scores_gemma":[0.99981177,0.0000058877563,0.00006397666,0.000010376691,0.000017100312,0.000011656903,0.000017308634,0.0000347363,0.000027202328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992541,0.00003423647,0.0002171179,0.00013437461,0.00013106066,0.00022913079],"domain_scores_gemma":[0.9993778,0.00008446431,0.000037891292,0.00038647372,0.000030669144,0.00008272168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018780194,0.00013813748,0.00021187338,0.000052128467,0.000043298565,0.0000142405825,0.00022921024,0.00013910892,0.00017574996],"category_scores_gemma":[0.000019056035,0.00014218212,0.00007849313,0.00013547826,0.000029770772,0.000069181915,0.00002684043,0.00021586403,0.00008861857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001211881,0.00010039824,0.003707725,0.00004692139,0.00010842081,0.000031030853,0.0010009783,0.000048624275,0.1822849,0.81061983,0.0016046048,0.0004344501],"study_design_scores_gemma":[0.0013332642,0.000079528145,0.0059522926,0.00003828507,0.000041462437,0.00001900097,0.0002374641,0.0016937833,0.11065194,0.87496656,0.0045544216,0.0004320099],"about_ca_topic_score_codex":0.000021925873,"about_ca_topic_score_gemma":0.000025696008,"teacher_disagreement_score":0.07163297,"about_ca_system_score_codex":0.000009125912,"about_ca_system_score_gemma":0.000008066143,"threshold_uncertainty_score":0.57980186},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99428743,0.00027984902,0.0008040012,0.00025264785,0.0012848707,0.00015114486,0.0000013562411,0.00021143566,0.0027272408],"genre_scores_gemma":[0.99360347,0.0000067457427,0.0062219147,0.00007135807,7.6076486e-7,0.00001024917,0.0000022285114,0.00001270426,0.00007056067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857235,0.000056004195,0.00025440962,0.00035168132,0.00045119395,0.0003143458],"domain_scores_gemma":[0.9987061,0.00007367232,0.00014882376,0.0006681611,0.00018828303,0.0002149296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039058074,0.00016755245,0.00024328569,0.00015369555,0.000072399875,0.0000539663,0.00069913064,0.00007108512,0.0000019609106],"category_scores_gemma":[0.000042157244,0.00013718524,0.00004616183,0.0006774884,0.000085289896,0.0002781645,0.00019304623,0.00015109412,0.000035424706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024297357,0.00012892138,0.008776829,0.000015361411,0.0000323454,0.000027180064,0.0005747575,0.0002561838,0.001015669,0.9868052,0.0011078827,0.001235352],"study_design_scores_gemma":[0.001882105,0.00059641927,0.0019899732,0.00006163839,0.00001379564,0.000030263429,0.000080608894,0.0008774321,0.010392684,0.9834051,0.0004092743,0.0002606659],"about_ca_topic_score_codex":0.00011823578,"about_ca_topic_score_gemma":0.000009259698,"teacher_disagreement_score":0.009377015,"about_ca_system_score_codex":0.00002186491,"about_ca_system_score_gemma":0.000090844194,"threshold_uncertainty_score":0.5594252},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97674716,0.00042026283,0.0056284103,0.000392851,0.0017494854,0.00013696584,8.286285e-7,0.0002261086,0.014697926],"genre_scores_gemma":[0.9959617,0.000008616723,0.003776888,0.00010316649,0.0000025695645,0.000007663089,5.943663e-7,0.000005604548,0.00013314515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916625,0.000029063687,0.0001634014,0.0002098843,0.00023282116,0.00019856302],"domain_scores_gemma":[0.999209,0.00005008081,0.000089957044,0.0004039533,0.000114954986,0.00013209622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001624356,0.00009385989,0.00015700556,0.000062878215,0.000036488374,0.000026200269,0.00065511564,0.000041296113,0.000002417356],"category_scores_gemma":[0.0000592034,0.000085664324,0.000047123347,0.00040212384,0.000054473,0.0003232068,0.00019537873,0.00008475683,0.000036781297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039654446,0.000058827263,0.0018800391,0.0000035562903,0.000006507969,0.000010651649,0.00026161928,0.000018521487,0.00022079068,0.9953381,0.00082980265,0.0013676209],"study_design_scores_gemma":[0.000653065,0.00021663854,0.0018522565,0.000006945835,0.0000030530248,0.000006939545,0.000030091194,0.0003802576,0.005261414,0.98683894,0.004627229,0.00012320047],"about_ca_topic_score_codex":0.000014851298,"about_ca_topic_score_gemma":6.8628816e-7,"teacher_disagreement_score":0.019214591,"about_ca_system_score_codex":0.000025928473,"about_ca_system_score_gemma":0.00005725634,"threshold_uncertainty_score":0.34932896},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99767774,0.00044677695,0.000026560603,0.000024776498,0.0005786253,0.0001761868,0.000009078984,0.00012438153,0.0009358552],"genre_scores_gemma":[0.9996339,0.000033713626,0.0002480832,0.000010241326,0.0000024722956,0.00003593337,0.000007392892,0.000017831588,0.000010408628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940646,0.0000380273,0.00021850782,0.00010514484,0.00008122281,0.00015061753],"domain_scores_gemma":[0.99957955,0.00007057542,0.000031634965,0.00019344568,0.00004316373,0.000081660626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008215854,0.00011270932,0.00018217393,0.00009628369,0.0000669486,0.000024761548,0.00009910308,0.000046935897,0.000040775976],"category_scores_gemma":[0.000006370041,0.00011336299,0.000046876314,0.00015273405,0.00008246645,0.00015536552,0.000025575753,0.00007821752,0.00004525246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047980952,0.000063112246,0.01507563,0.00019915384,0.00011848599,0.000002121646,0.0012115161,0.00028009177,0.1419296,0.83846784,0.0017252377,0.0009224307],"study_design_scores_gemma":[0.000768285,0.00007622519,0.06160468,0.00009546139,0.000024768338,0.000006821959,0.00029378908,0.005739759,0.010149264,0.9201346,0.00081668043,0.00028966583],"about_ca_topic_score_codex":0.00013908798,"about_ca_topic_score_gemma":0.0000098581595,"teacher_disagreement_score":0.13178033,"about_ca_system_score_codex":0.000009455609,"about_ca_system_score_gemma":0.000002733571,"threshold_uncertainty_score":0.46228087},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8447638,0.00012340624,0.14146651,0.00034989833,0.0013213205,0.00081089226,0.0000045078045,0.00056262093,0.010597029],"genre_scores_gemma":[0.9758349,0.0000052943406,0.023490945,0.00018734932,0.000004689051,0.000057566187,8.329218e-7,0.00003041248,0.0003879759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976371,0.00017266377,0.00024409342,0.0007196044,0.0005324958,0.00069405354],"domain_scores_gemma":[0.9977776,0.0001462626,0.00007696847,0.0014119287,0.00020226608,0.0003850178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047391857,0.00025718973,0.00026071607,0.00039182836,0.00022643562,0.000090782385,0.0018394358,0.000092292066,0.00003888707],"category_scores_gemma":[0.00010780838,0.0002229055,0.00008427727,0.0015025393,0.00014257313,0.00058167474,0.00053764,0.00039242048,0.00016322592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011966678,0.00022726136,0.014224417,0.0000056837243,0.00003540446,0.00015817196,0.0018568449,0.0000067702795,0.0004315027,0.9803557,0.00046007326,0.0021185062],"study_design_scores_gemma":[0.0018266251,0.0009677992,0.10673214,0.00004845774,0.000008777472,0.00004314224,0.00010662702,0.00074769795,0.0095425695,0.87864864,0.00071719807,0.0006103486],"about_ca_topic_score_codex":0.00013229322,"about_ca_topic_score_gemma":0.0000772079,"teacher_disagreement_score":0.13107112,"about_ca_system_score_codex":0.000048551137,"about_ca_system_score_gemma":0.00009972882,"threshold_uncertainty_score":0.9089822},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98903173,0.000059569888,0.0012196366,0.00009191646,0.0062940842,0.0009186322,0.000025014973,0.0001564614,0.0022029334],"genre_scores_gemma":[0.9695999,0.0000033541394,0.030024951,0.0000151207,0.000036794634,0.000101646096,0.0000036273616,0.00007628403,0.00013832442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849933,0.000025148065,0.00057342334,0.00026606245,0.00028724392,0.0003487807],"domain_scores_gemma":[0.9970491,0.0013272769,0.00040178403,0.00080897345,0.00030481716,0.00010806438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005127634,0.00024049818,0.0005486238,0.000112490445,0.00010048858,0.00002102192,0.0004949575,0.00020700568,0.00005401497],"category_scores_gemma":[0.0019370631,0.0002291533,0.00020119819,0.00023696269,0.00012976676,0.00012778399,0.0001032979,0.00024848568,0.000017059412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003530439,0.00025137016,0.0003409968,0.00016747192,0.00006250704,0.0000012096127,0.00014139882,6.484272e-7,0.010115828,0.9862072,0.0016753062,0.001000746],"study_design_scores_gemma":[0.0012893087,0.00015903855,0.00011613433,0.000030191566,0.000078450066,0.000004697143,0.0000197849,0.00009311453,0.0268294,0.9697326,0.0014121624,0.00023514885],"about_ca_topic_score_codex":0.000007927967,"about_ca_topic_score_gemma":0.000027911536,"teacher_disagreement_score":0.028805314,"about_ca_system_score_codex":0.000023970997,"about_ca_system_score_gemma":0.00007321259,"threshold_uncertainty_score":0.93446004},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.984739,0.000013527946,0.00014253502,0.00019151237,0.0014529239,0.00028433677,0.000017401575,0.0000710045,0.013087764],"genre_scores_gemma":[0.9948115,0.0000037701263,0.0036491968,0.00001739937,0.000011844318,0.000013857099,0.0000023381465,0.00003120036,0.0014589328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989182,0.000044871456,0.00033615433,0.00017705423,0.00030877593,0.0002149831],"domain_scores_gemma":[0.9984095,0.0006768614,0.00018985929,0.00051080255,0.00012890213,0.00008405688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015663674,0.00016111037,0.00027040023,0.000038727398,0.00016936942,0.00003531765,0.00031359936,0.00010086795,0.00020228467],"category_scores_gemma":[0.0010709377,0.00012267655,0.00008349388,0.0001882229,0.00036826186,0.00015488906,0.00019835173,0.0002914603,0.000012425129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022876332,0.00011424577,0.004550208,0.00007552237,0.000023175038,0.0000010304556,0.0006015489,4.1948837e-7,0.0060041333,0.98755527,0.0010446598,0.000027511593],"study_design_scores_gemma":[0.000395934,0.000017693705,0.0073088575,0.000025820445,0.00003992901,0.000014775408,0.00024910292,0.00006863732,0.003939814,0.9872674,0.0005380634,0.00013399648],"about_ca_topic_score_codex":0.000022304232,"about_ca_topic_score_gemma":0.0000522955,"teacher_disagreement_score":0.011628832,"about_ca_system_score_codex":0.000019679032,"about_ca_system_score_gemma":0.000034613484,"threshold_uncertainty_score":0.5002604},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9972486,0.00010347334,0.0001718477,0.0002638709,0.001477962,0.00008282157,0.0000015081494,0.000023776503,0.00062617473],"genre_scores_gemma":[0.99914557,0.0000057325283,0.00074823806,0.000047847403,4.7485904e-7,0.0000013364836,5.922264e-7,0.000005956564,0.000044228298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890876,0.00013363977,0.00031551256,0.00017790872,0.00032881668,0.00013538181],"domain_scores_gemma":[0.9987,0.0002205145,0.00022481971,0.0006457905,0.00017377913,0.000035085475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048291014,0.0000965505,0.00021880842,0.00006872832,0.000047952693,0.000009905835,0.00047959803,0.0000476176,0.0000044767894],"category_scores_gemma":[0.0001944586,0.0000667372,0.00008953256,0.0003481896,0.000118456155,0.00008227512,0.00020752281,0.00009584002,0.0000049131263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043291725,0.00011781107,0.002045448,0.000030766965,0.000011384442,1.1293392e-7,0.00029864992,0.00029526534,0.017824365,0.9785054,0.00021009654,0.00065639743],"study_design_scores_gemma":[0.00071720005,0.00030413628,0.004530145,0.00019664972,0.00001004881,0.0000013844477,0.00001944046,0.005812965,0.09244952,0.8958414,0.000024446554,0.00009266741],"about_ca_topic_score_codex":0.00008088978,"about_ca_topic_score_gemma":0.0000019374568,"teacher_disagreement_score":0.08266398,"about_ca_system_score_codex":0.000008794456,"about_ca_system_score_gemma":0.000033240336,"threshold_uncertainty_score":0.2721464},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940169,0.000328088,0.001629584,0.0006781193,0.00052981416,0.00023537542,0.000002970831,0.0001324657,0.0024467171],"genre_scores_gemma":[0.994099,0.000062395084,0.0056663956,0.00007276473,0.000003271201,0.000009960012,9.765633e-7,0.000012156787,0.00007304029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978825,0.00019707803,0.0003852213,0.00045162172,0.00052527036,0.00055832806],"domain_scores_gemma":[0.9980573,0.00032433833,0.00012473286,0.0012691532,0.00010678254,0.000117687225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000762845,0.00019776281,0.00033875316,0.000551987,0.00011352396,0.000062548446,0.0022112757,0.00009636452,0.0000051457714],"category_scores_gemma":[0.0002928908,0.00020340679,0.00010917409,0.0014977818,0.00015453741,0.00062273385,0.0003527022,0.0003126721,0.000013284686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017833698,0.00016478832,0.017654868,0.000012245974,0.000008090674,0.000042545624,0.000491742,0.00002732225,0.0017755529,0.97213024,0.00013228992,0.007542503],"study_design_scores_gemma":[0.00091510353,0.00027141353,0.08930926,0.000052273874,0.0000017965904,0.000006380498,0.000055798864,0.0008445094,0.004054618,0.9042375,0.00006281875,0.0001885003],"about_ca_topic_score_codex":0.00003229293,"about_ca_topic_score_gemma":0.000035034314,"teacher_disagreement_score":0.07165439,"about_ca_system_score_codex":0.00006741285,"about_ca_system_score_gemma":0.00006794286,"threshold_uncertainty_score":0.8294688},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9627566,0.0003377104,0.033839058,0.00086471223,0.0005963877,0.00030572765,0.000005501652,0.00023961619,0.0010546957],"genre_scores_gemma":[0.9887284,0.0000067836527,0.0109413015,0.00009602587,0.000015519869,0.000026644724,0.000012567782,0.000009952833,0.00016277577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998877,0.0000573566,0.00019645804,0.00037402494,0.00023320953,0.00026197228],"domain_scores_gemma":[0.99901104,0.00021101967,0.00007981692,0.00047076764,0.00007400783,0.00015336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017461856,0.00013700634,0.00017236092,0.00006809566,0.00021091373,0.00025418997,0.0005433573,0.0000886253,0.000020455414],"category_scores_gemma":[0.000080205544,0.00012355528,0.00002722942,0.00027522762,0.00003751886,0.0011580958,0.0004455547,0.00017801649,0.00015400273],"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.0000012359461,0.00004067105,0.18208086,0.000015810834,0.000010039365,0.0000043685263,0.0002033416,0.000010760724,0.00023872948,0.80101585,0.004920279,0.011458066],"study_design_scores_gemma":[0.0004128827,0.00004261833,0.50172466,0.000017409011,0.0000041571775,0.000002882849,0.0000069268976,0.029162955,0.00008856995,0.46725032,0.0011328316,0.0001538073],"about_ca_topic_score_codex":0.00013886293,"about_ca_topic_score_gemma":5.649516e-7,"teacher_disagreement_score":0.33376554,"about_ca_system_score_codex":0.000026472657,"about_ca_system_score_gemma":0.000028845283,"threshold_uncertainty_score":0.5038438},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.974628,0.0001453719,0.0003507263,0.001034707,0.007728306,0.00011679647,6.3669387e-7,0.00047136,0.015524115],"genre_scores_gemma":[0.9974621,0.00000279474,0.0016342867,0.00072243466,0.0000010378192,0.000007843994,0.000001284806,0.000008218603,0.00016000784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988751,0.00005995169,0.0001521807,0.0003075238,0.00035950533,0.0002457508],"domain_scores_gemma":[0.99894166,0.000067139415,0.000051241128,0.0005900106,0.000121091725,0.00022884717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036789576,0.00011828813,0.00012621903,0.00012273615,0.00008194715,0.00009446699,0.0005673797,0.000057760848,0.000004186866],"category_scores_gemma":[0.00009601226,0.00010493489,0.00005770352,0.00046729567,0.00003857423,0.00018692527,0.00013930343,0.00013111552,0.00039819078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057885463,0.000081583334,0.0003126764,0.000001083746,0.000005830128,0.000010963413,0.0001363759,0.00002822433,0.000055675573,0.9718189,0.026510831,0.0010320474],"study_design_scores_gemma":[0.00087063917,0.00026872396,0.00018382531,0.000009663336,0.000002404775,0.000004860456,0.0000060090615,0.001140622,0.00060500565,0.995543,0.00122587,0.00013936005],"about_ca_topic_score_codex":0.000033287048,"about_ca_topic_score_gemma":8.3621853e-7,"teacher_disagreement_score":0.02528496,"about_ca_system_score_codex":0.000021578837,"about_ca_system_score_gemma":0.00006694386,"threshold_uncertainty_score":0.51180696},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9793367,0.00041479408,0.00038200791,0.00066954753,0.00965529,0.00011074739,6.9700576e-7,0.00043051605,0.008999705],"genre_scores_gemma":[0.99591696,0.0000063171124,0.00298503,0.0008900976,0.0000040777627,0.000008600078,0.00000125654,0.0000103398625,0.00017730263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988541,0.000057603174,0.00016283529,0.00022935987,0.00028194085,0.00041417667],"domain_scores_gemma":[0.9990078,0.00012397108,0.000055708,0.0005596507,0.000060036054,0.00019278825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000419121,0.00012732958,0.00012600911,0.00009403349,0.00014362803,0.00006793495,0.00046992372,0.00006581838,0.000017560176],"category_scores_gemma":[0.000081114835,0.000113693655,0.00005811571,0.00034838807,0.000028491482,0.00031355082,0.000146883,0.00015449912,0.00074043666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000299636,0.00015312366,0.0011301568,0.0000022298732,0.0000071718764,0.0000018290627,0.0001701537,0.000008171036,0.0004165429,0.9891615,0.0071357056,0.0018104258],"study_design_scores_gemma":[0.00055371603,0.000115905714,0.0007407497,0.000014892279,0.000004195493,0.0000050470976,0.0000041483913,0.00061042135,0.0023146751,0.9932273,0.002226794,0.00018216696],"about_ca_topic_score_codex":0.000016448666,"about_ca_topic_score_gemma":2.4806445e-7,"teacher_disagreement_score":0.016580284,"about_ca_system_score_codex":0.000021082928,"about_ca_system_score_gemma":0.000024227005,"threshold_uncertainty_score":0.95170623},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12957516,0.0001534109,0.6265801,0.0028284318,0.004735333,0.0004159232,0.0000020123525,0.004744276,0.23096532],"genre_scores_gemma":[0.9589207,0.000004136627,0.039979525,0.0008371502,0.000006251572,0.000015252354,0.0000014486466,0.000015147826,0.00022039909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986053,0.000062720384,0.00019417504,0.0004402172,0.00039014363,0.00030744073],"domain_scores_gemma":[0.9987941,0.00009920186,0.00009911052,0.00077452546,0.0001240575,0.00010903366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003725224,0.00017083877,0.00016294666,0.00015921475,0.00011737935,0.0005530192,0.0015081898,0.00007154322,0.000005069639],"category_scores_gemma":[0.00017824642,0.00016129983,0.00007060365,0.0005059485,0.00009447287,0.00091391994,0.000271328,0.00016617173,0.00015014652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016194275,0.00007089757,0.000060205217,0.0000072796024,0.0000051226916,0.000008872725,0.000028239967,0.0000022045058,0.0004157002,0.9437325,0.0025026798,0.053164706],"study_design_scores_gemma":[0.00020195007,0.00020660338,0.00021067954,0.000043603606,0.0000027399594,0.000008908616,9.028762e-7,0.0018544993,0.008073835,0.98548657,0.003700368,0.00020936895],"about_ca_topic_score_codex":0.000010049533,"about_ca_topic_score_gemma":8.140057e-7,"teacher_disagreement_score":0.8293455,"about_ca_system_score_codex":0.000032131444,"about_ca_system_score_gemma":0.000054513763,"threshold_uncertainty_score":0.65776163},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99041414,0.0003450034,0.000057742887,0.0015451624,0.0027023877,0.00052876776,0.00002319192,0.00037472666,0.004008861],"genre_scores_gemma":[0.9937825,0.000046015903,0.004179685,0.0011341451,0.00009348492,0.000009310913,0.00007694221,0.00006492032,0.00061298284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976136,0.0002565283,0.000484966,0.00058976916,0.0005139642,0.00054118264],"domain_scores_gemma":[0.9979913,0.00029037351,0.00014146698,0.00079987035,0.00038445115,0.0003925034],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004083717,0.00044350454,0.0006175192,0.00017368393,0.00031197327,0.00021142911,0.0005167094,0.0003035595,0.0006342033],"category_scores_gemma":[0.00013874326,0.00040458035,0.000105003266,0.00084520807,0.00008377402,0.0002478215,0.000102187645,0.0004058672,0.0010293437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026556075,0.00062198547,0.0012758062,0.000020743924,0.00013082713,0.00010263274,0.0017281488,0.0000032704843,0.01880559,0.9421416,0.034379,0.000524861],"study_design_scores_gemma":[0.0018367658,0.0008678418,0.0011085783,0.00020572275,0.00013668115,0.000013136609,0.00034497725,0.00024831147,0.044282585,0.9414645,0.008637425,0.0008535094],"about_ca_topic_score_codex":0.00007439763,"about_ca_topic_score_gemma":0.000010232167,"teacher_disagreement_score":0.025741579,"about_ca_system_score_codex":0.0001499901,"about_ca_system_score_gemma":0.00011567874,"threshold_uncertainty_score":0.9998406},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9033483,0.000061739025,0.00029615668,0.0034539304,0.0007693765,0.0005274375,0.000001731237,0.00023136254,0.09130996],"genre_scores_gemma":[0.9949066,0.0000027109668,0.0017530732,0.00035688834,0.00001650542,0.000027246206,2.693596e-7,0.000037132864,0.0028995404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991075,0.000120808734,0.00020524839,0.00020548899,0.00017413536,0.00018682623],"domain_scores_gemma":[0.99775577,0.0015163197,0.00008620597,0.0005582627,0.000035637055,0.000047833404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005897952,0.00014233254,0.00019927551,0.000021945803,0.00012313496,0.000028469296,0.0001721386,0.00005178387,0.000105216],"category_scores_gemma":[0.0032736803,0.00008794844,0.00003542149,0.00010448236,0.00014153674,0.000048845483,0.000069343754,0.00018916532,0.000084106614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066623384,0.00006146361,0.000048273247,0.00003082732,0.000017747852,5.9713796e-7,0.00036196716,3.0348863e-7,0.000052791427,0.99698514,0.0018028137,0.00063142675],"study_design_scores_gemma":[0.00028673105,0.000065575354,0.00003783364,0.00004478366,0.000014807596,0.000004526111,0.000042010473,0.000059374415,0.0015209122,0.9908779,0.0069287536,0.00011677051],"about_ca_topic_score_codex":0.000001106657,"about_ca_topic_score_gemma":4.623043e-7,"teacher_disagreement_score":0.09155832,"about_ca_system_score_codex":0.000017648397,"about_ca_system_score_gemma":0.000006635857,"threshold_uncertainty_score":0.39191377},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99156153,0.00010589981,0.0008163142,0.0010909082,0.0011734633,0.000117230455,5.018763e-7,0.00008257173,0.005051598],"genre_scores_gemma":[0.9986095,0.0000040887776,0.0007800266,0.0005085549,8.4371084e-7,0.0000061475716,5.3314e-7,0.0000073139154,0.000082999664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988371,0.00011462044,0.0002102035,0.00026349307,0.0003354643,0.00023909585],"domain_scores_gemma":[0.9985055,0.0003933352,0.00007836823,0.00083627,0.0001240297,0.000062549785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068658724,0.000115044866,0.00014065349,0.00007751268,0.00012696238,0.000050283685,0.0008361195,0.00004459269,0.000012892644],"category_scores_gemma":[0.00020700015,0.0000741187,0.00007009541,0.00041276737,0.00009390984,0.00010688643,0.0001557785,0.00013048301,0.00011620336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002213602,0.00009394714,0.0006111586,0.0000057591524,0.0000035853213,6.2944173e-7,0.00019555671,0.00006030301,0.00030432822,0.9955968,0.0027598517,0.00036582933],"study_design_scores_gemma":[0.00031978684,0.00025197034,0.0010084355,0.000023728744,0.0000038328003,0.0000016475336,0.000009960835,0.01098146,0.001176247,0.98567617,0.00044897856,0.00009777983],"about_ca_topic_score_codex":0.00003635302,"about_ca_topic_score_gemma":0.000002336968,"teacher_disagreement_score":0.010921157,"about_ca_system_score_codex":0.000010179921,"about_ca_system_score_gemma":0.000035909554,"threshold_uncertainty_score":0.3022473},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75822794,0.0014498337,0.22015116,0.0009215249,0.007970611,0.00037792948,0.000004964256,0.00072627625,0.0101697575],"genre_scores_gemma":[0.99712306,0.00003184133,0.0023732178,0.00036050478,0.00001458505,0.0000217019,0.00000361167,0.000010955265,0.00006052762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986658,0.00012576907,0.00022722613,0.00020672107,0.00029153752,0.0004829522],"domain_scores_gemma":[0.9991119,0.0000802433,0.000063352825,0.0004865028,0.000057780006,0.00020025359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056705374,0.00017275724,0.00015861195,0.0001881065,0.00025791745,0.00010213118,0.0006968194,0.00007793932,0.000025182115],"category_scores_gemma":[0.000010050775,0.00015794997,0.00014559204,0.0007673321,0.00007593964,0.0015629389,0.00007022437,0.00015804419,0.00015068201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022994777,0.00012907053,0.00053615175,0.0000066530165,0.00002479176,0.0000010722474,0.0017586638,0.000011376623,0.00014219194,0.9948023,0.00028698787,0.0022984664],"study_design_scores_gemma":[0.00044677907,0.000051197752,0.0047164243,0.0000095939295,0.000010191495,0.0000147912,0.00012418242,0.00029890655,0.0032081776,0.9899672,0.00092356524,0.0002289598],"about_ca_topic_score_codex":0.00000723109,"about_ca_topic_score_gemma":3.4694747e-7,"teacher_disagreement_score":0.23889512,"about_ca_system_score_codex":0.000018824765,"about_ca_system_score_gemma":0.000022395068,"threshold_uncertainty_score":0.64410126},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99101293,0.00031704252,0.00062875997,0.0024223553,0.0012260282,0.00016354171,0.0000013772335,0.0001552005,0.0040727644],"genre_scores_gemma":[0.9987222,0.000004212964,0.000337924,0.0008781755,8.741938e-7,0.0000029134042,9.0886726e-7,0.0000048890206,0.000047934445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892557,0.00007780809,0.00020788149,0.0002582167,0.00031612744,0.00021438171],"domain_scores_gemma":[0.9989397,0.00018019314,0.00013403791,0.000602326,0.000080968246,0.000062788175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028911213,0.0001278487,0.00016758089,0.00006839384,0.00013992412,0.0000557335,0.00067409343,0.00007101523,0.0000073224865],"category_scores_gemma":[0.00006282313,0.00008562567,0.000068208,0.00041254712,0.00006836,0.00010425472,0.00006954376,0.00021685082,0.000017024153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007958161,0.000060611907,0.000278541,0.0000017267238,0.000009253685,0.0000057821867,0.0004714258,0.00022605686,0.00037823446,0.9917267,0.0031207611,0.0037129722],"study_design_scores_gemma":[0.00078609923,0.0005611956,0.003056064,0.000039000417,0.000004769713,0.00000638845,0.000017667257,0.004442242,0.0016207614,0.98885936,0.0004896628,0.00011678969],"about_ca_topic_score_codex":0.0000227538,"about_ca_topic_score_gemma":0.0000021826932,"teacher_disagreement_score":0.0077092373,"about_ca_system_score_codex":0.000014100585,"about_ca_system_score_gemma":0.000051735326,"threshold_uncertainty_score":0.34917134},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925912,0.000008874627,0.0000019648733,0.000042526754,0.0010455735,0.00020267967,0.000014297066,0.000044034583,0.006048819],"genre_scores_gemma":[0.9994128,0.0000018478595,0.00029293285,0.000009674596,0.0000040520863,0.0000101486885,0.0000051847724,0.000032089076,0.00023130837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869937,0.000107387794,0.00030789324,0.00018423631,0.00033423817,0.0003668668],"domain_scores_gemma":[0.99826986,0.00091369194,0.00009012954,0.0005554126,0.000086116794,0.00008478039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010908279,0.00013043334,0.0002733995,0.000178918,0.00003644748,0.000013625616,0.00037761463,0.00015223089,0.00042273957],"category_scores_gemma":[0.0013318764,0.00012021242,0.00006662042,0.0003626278,0.000075665106,0.00010088673,0.00015151809,0.0005226428,0.000044547505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016144482,0.00037050483,0.076504074,0.000057174686,0.000011636489,0.000008605528,0.00093799696,3.2663618e-8,0.00685943,0.9142782,0.0009212713,0.000034901444],"study_design_scores_gemma":[0.00096174155,0.000061494604,0.012638481,0.000021761316,0.000005269202,0.0000015401865,0.00019786418,0.000051333478,0.015988234,0.96951133,0.00043945445,0.00012149789],"about_ca_topic_score_codex":0.00002466747,"about_ca_topic_score_gemma":0.00010733948,"teacher_disagreement_score":0.063865595,"about_ca_system_score_codex":0.000026652895,"about_ca_system_score_gemma":0.00004920225,"threshold_uncertainty_score":0.490212},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9971066,0.00020229029,0.00024652228,0.00033235713,0.0010302899,0.00016658517,3.2093297e-7,0.00014914408,0.00076585484],"genre_scores_gemma":[0.99593645,0.000013904593,0.0036624374,0.0003244654,6.541441e-7,0.000026880258,0.0000010646063,0.000009659351,0.00002449479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986846,0.00012982906,0.00027717935,0.0003927066,0.00020569991,0.00031000644],"domain_scores_gemma":[0.999073,0.00017706507,0.00008308665,0.0004820619,0.000055936544,0.00012883854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005262707,0.00015549248,0.00023705265,0.00018915895,0.000107011416,0.00011132469,0.00044332354,0.00008657735,0.0000025553404],"category_scores_gemma":[0.000104868755,0.00014276712,0.000041340303,0.00048644107,0.0000803933,0.0002311913,0.00021380086,0.00013451638,0.000033909466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036912152,0.00009060102,0.005161412,0.000021549686,0.000006808662,0.000008302124,0.00037018757,0.000007639914,0.0012909523,0.98894644,0.00045816804,0.0036342738],"study_design_scores_gemma":[0.001254734,0.000223718,0.019290451,0.000051382074,0.0000044709277,0.000011147867,0.0000097934835,0.019174144,0.00072732836,0.95893496,0.00012787303,0.00019000394],"about_ca_topic_score_codex":0.000044852397,"about_ca_topic_score_gemma":0.000017239341,"teacher_disagreement_score":0.03001146,"about_ca_system_score_codex":0.000018041004,"about_ca_system_score_gemma":0.00002320556,"threshold_uncertainty_score":0.5821875},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9842919,0.000050868086,0.0000075408147,0.000088584995,0.0011577365,0.00020699261,0.0000058279516,0.00001804812,0.014172467],"genre_scores_gemma":[0.99929833,0.000005307582,0.00050996145,0.000028938442,0.000021570817,0.000006975773,5.4264484e-7,0.000018538214,0.00010984214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988783,0.00011723584,0.00026782067,0.00012351474,0.00038627902,0.0002268594],"domain_scores_gemma":[0.99841315,0.00057290896,0.0002298961,0.00061986514,0.00012254622,0.000041632822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000730268,0.00012563467,0.00022172407,0.000031015537,0.00008238338,0.0000051778256,0.00033182072,0.000089446185,0.00009063569],"category_scores_gemma":[0.00067497225,0.00007959812,0.000069052236,0.00016628196,0.00016087567,0.00008828636,0.00012720299,0.00022654833,0.000008282275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023057513,0.00015072664,0.009766396,0.000069453155,0.000034218196,3.9227413e-7,0.0017251614,4.126923e-7,0.00034269848,0.98697037,0.0006860743,0.0002310684],"study_design_scores_gemma":[0.00024688704,0.000035029156,0.0061714444,0.00005317716,0.000028618226,0.0000042514966,0.00012522629,0.000004619457,0.029743198,0.9633471,0.00014856749,0.00009190119],"about_ca_topic_score_codex":0.0000107531905,"about_ca_topic_score_gemma":5.958221e-7,"teacher_disagreement_score":0.0294005,"about_ca_system_score_codex":0.000018124823,"about_ca_system_score_gemma":0.000026355638,"threshold_uncertainty_score":0.3245917},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98819166,0.000026249147,0.000024344221,0.00038307803,0.000083253406,0.0002834488,0.0000024272576,0.00007030084,0.010935227],"genre_scores_gemma":[0.9942309,0.0000038549597,0.004922555,0.00006254201,0.0000076248393,0.000087568376,0.000002028806,0.00001966892,0.0006632522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993851,0.000033268698,0.0001236213,0.00017390569,0.000092844995,0.00019121634],"domain_scores_gemma":[0.99936914,0.0001994025,0.00005050553,0.0002575423,0.000029379938,0.00009400357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009110332,0.00011878075,0.00014689112,0.00004083647,0.00009477155,0.00004932117,0.00011012861,0.000047208552,0.00015012707],"category_scores_gemma":[0.00002829956,0.00009338992,0.00003110989,0.00012002865,0.00010556658,0.00011825178,0.000024600473,0.00010187266,0.0000750069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009769417,0.00009675217,0.0034047018,0.000011825527,0.000025213327,0.0000022939394,0.0002657684,1.8233157e-8,0.000492161,0.9914746,0.0033600617,0.0008568163],"study_design_scores_gemma":[0.00063340063,0.00011969208,0.0093513625,0.000011756725,0.000027982218,0.000014619436,0.00013129397,0.00002210146,0.001318936,0.9875334,0.00069622946,0.00013921523],"about_ca_topic_score_codex":0.000012400245,"about_ca_topic_score_gemma":0.00001174009,"teacher_disagreement_score":0.010271976,"about_ca_system_score_codex":0.000008348245,"about_ca_system_score_gemma":0.000009935511,"threshold_uncertainty_score":0.38083306},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9845133,0.00021926896,0.006006739,0.00022848825,0.002665754,0.00033100662,0.0000013893917,0.00015858676,0.0058755125],"genre_scores_gemma":[0.99718213,0.00000650443,0.0025462068,0.000043719177,0.00001012345,0.000040627932,0.0000027698359,0.0000130174185,0.00015488299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981413,0.00024781632,0.00022849909,0.00032041242,0.00041866017,0.0006433283],"domain_scores_gemma":[0.9988217,0.00024507305,0.00006878583,0.0005807156,0.0000868489,0.0001968952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010664567,0.00015545526,0.00018221303,0.0002763775,0.00011541587,0.00006696898,0.00072344416,0.000092750844,0.000027754359],"category_scores_gemma":[0.00015110563,0.00016359896,0.00007125377,0.0012321628,0.00012092811,0.0015278966,0.00030969427,0.00027759682,0.0001290499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013596784,0.00020534989,0.01723638,0.000007694829,0.0000064219807,0.0000072727134,0.0006369624,0.000003899468,0.000982204,0.9755271,0.00021419709,0.0051589296],"study_design_scores_gemma":[0.0010876062,0.00006563172,0.048381906,0.000011798285,0.0000021968592,0.000011432792,0.000052321648,0.0005546729,0.0031234343,0.9462982,0.00017481155,0.0002360269],"about_ca_topic_score_codex":0.000028221008,"about_ca_topic_score_gemma":0.000004992194,"teacher_disagreement_score":0.031145524,"about_ca_system_score_codex":0.0001388078,"about_ca_system_score_gemma":0.000040797804,"threshold_uncertainty_score":0.6671372},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99058384,0.00016634444,0.00018480553,0.0013442563,0.003480834,0.00019619272,4.6389084e-7,0.00039392064,0.0036493193],"genre_scores_gemma":[0.9960502,0.0000044695307,0.0023935465,0.0008479298,0.0000010177428,0.000026116963,0.0000018402848,0.000013261675,0.0006616581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986179,0.000051001523,0.00021172815,0.00041289994,0.00035434254,0.00035216825],"domain_scores_gemma":[0.9987814,0.00009596498,0.00006394556,0.0007413257,0.0001487376,0.00016865246],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019584461,0.00016656486,0.00016425276,0.00010344917,0.00016009287,0.00020038501,0.0005937546,0.00008416231,0.000070516915],"category_scores_gemma":[0.0000720046,0.00014672434,0.00007198956,0.00038477578,0.000044287284,0.0003548008,0.0001877387,0.00017433739,0.002057896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012124841,0.00010290558,0.000079868165,0.0000035784506,0.000010926418,0.000005159694,0.00009382031,0.00003147319,0.0013234806,0.9749593,0.02062286,0.0027654234],"study_design_scores_gemma":[0.0006073813,0.00017649289,0.00090167206,0.00002759813,0.0000032675741,0.0000076008387,0.0000057207994,0.010739378,0.0019376308,0.9851217,0.00027008815,0.00020146288],"about_ca_topic_score_codex":0.000076951,"about_ca_topic_score_gemma":2.9690716e-7,"teacher_disagreement_score":0.020352772,"about_ca_system_score_codex":0.000025308413,"about_ca_system_score_gemma":0.00003342049,"threshold_uncertainty_score":0.9987191},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92025834,0.00007796792,0.07651213,0.0008423987,0.0008581462,0.00011802295,0.0000015941139,0.00023107031,0.001100316],"genre_scores_gemma":[0.9940937,0.0000057937864,0.005634118,0.00012836342,0.000021627593,0.000016128643,0.0000029440457,0.000008418814,0.00008890949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990654,0.00006659628,0.00017287715,0.0003127542,0.00012480991,0.0002575458],"domain_scores_gemma":[0.9991941,0.00020516542,0.00007189846,0.00035932267,0.00005553905,0.0001139829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017998899,0.00012357313,0.0001851041,0.00008492588,0.0006129057,0.00029305049,0.0002942639,0.000064336265,0.0000049013],"category_scores_gemma":[0.00009854503,0.000116125324,0.00003982727,0.00041420702,0.000120082914,0.00041373566,0.00014661526,0.00012629555,0.00003200616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002627649,0.00009452049,0.033352993,0.000010268741,0.000028203125,0.0000039534657,0.00061380165,0.00008304076,0.0012596255,0.9273724,0.0009676991,0.036210846],"study_design_scores_gemma":[0.00065377145,0.00014494146,0.122195415,0.00001551906,0.0000113545675,0.0000053882327,0.000018495784,0.004525267,0.00081822684,0.86740506,0.0040044575,0.00020213157],"about_ca_topic_score_codex":0.000017116756,"about_ca_topic_score_gemma":0.0000125368715,"teacher_disagreement_score":0.08884242,"about_ca_system_score_codex":0.000020988482,"about_ca_system_score_gemma":0.000034856144,"threshold_uncertainty_score":0.4735453},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9771258,0.00007110577,0.0075832545,0.00017282992,0.0037029414,0.00020205998,9.598702e-7,0.00013155947,0.011009467],"genre_scores_gemma":[0.9993645,0.0000013175279,0.0003225682,0.00010023407,0.000013448154,0.000015477915,0.0000010124834,0.000012274675,0.0001691903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986168,0.00018100684,0.00023712046,0.00034922126,0.0003749845,0.00024086307],"domain_scores_gemma":[0.9985441,0.00015463204,0.00016840592,0.00072021264,0.00026722302,0.00014541947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006014447,0.00015643869,0.00028490022,0.000116809315,0.00007278338,0.00006207286,0.0005273812,0.00006283841,0.0000038785033],"category_scores_gemma":[0.00005714144,0.00012449962,0.000068205736,0.0005354366,0.00006248272,0.00027460293,0.00009613866,0.00015298308,0.00003154596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030820054,0.000121224,0.0014529543,0.0000068988265,0.000028727813,0.00001301543,0.00035444842,0.00023685336,0.0000902784,0.99244314,0.0047083627,0.00051327515],"study_design_scores_gemma":[0.0031609808,0.0016173314,0.0016118943,0.0001391949,0.000011810628,0.000057186375,0.000091734175,0.011226369,0.0057516,0.97398514,0.0019814032,0.00036533657],"about_ca_topic_score_codex":0.00014377973,"about_ca_topic_score_gemma":0.000027722983,"teacher_disagreement_score":0.022238655,"about_ca_system_score_codex":0.00005908415,"about_ca_system_score_gemma":0.0000671595,"threshold_uncertainty_score":0.5076947},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9645892,0.000103512226,0.010934702,0.003111314,0.0013540674,0.0004419765,0.0000021880248,0.00026996582,0.019193117],"genre_scores_gemma":[0.99727774,0.000008453737,0.0023158411,0.0003469759,0.0000025282625,0.0000089131345,0.0000011054344,0.0000036794083,0.000034766454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862653,0.000119981625,0.00016593694,0.0003574922,0.00038608344,0.0003440005],"domain_scores_gemma":[0.9991685,0.000105922016,0.00004561977,0.0005288318,0.000063806794,0.00008727776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041434338,0.00011965567,0.00013295117,0.00018541739,0.00006996931,0.000068411406,0.00081115076,0.000062888575,0.0000033350584],"category_scores_gemma":[0.00011952791,0.00012000061,0.000050118004,0.0013825109,0.00003820056,0.00041748837,0.00008373937,0.00018617908,0.00007471671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002508591,0.00014129537,0.00070275454,0.0000012993747,0.0000013921585,0.000031997974,0.00008970986,0.00003483489,0.00016721735,0.9566016,0.00012748827,0.042075325],"study_design_scores_gemma":[0.0008775199,0.00028007547,0.034394644,0.000016735385,5.876944e-7,0.000003909348,0.000003741116,0.0019309804,0.0008589559,0.96133417,0.00017697534,0.000121723315],"about_ca_topic_score_codex":0.000006951107,"about_ca_topic_score_gemma":0.0000055708956,"teacher_disagreement_score":0.0419536,"about_ca_system_score_codex":0.00016630927,"about_ca_system_score_gemma":0.000040582538,"threshold_uncertainty_score":0.48934826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9658514,0.00015570153,0.0012007848,0.000022384493,0.0042222925,0.00014215731,0.0000017467162,0.0007024646,0.027701022],"genre_scores_gemma":[0.9996385,0.0000053232884,0.000118644115,0.000034437373,0.000021891985,0.000016857415,0.0000032011997,0.000045031557,0.00011611122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916726,0.00007545461,0.0001834413,0.0001535919,0.00014149443,0.00027877415],"domain_scores_gemma":[0.99944645,0.00007874771,0.000027424534,0.00033166172,0.00002461937,0.000091114984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035064673,0.0001619266,0.00019978394,0.00006449654,0.00008877965,0.000041150386,0.0001970109,0.00009807528,0.000030594692],"category_scores_gemma":[0.000028571361,0.00016484004,0.00006215334,0.00016007855,0.000026450807,0.000090204296,0.000021116266,0.00016462742,0.00020113582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076268802,0.000030924177,0.0052278438,0.000090992624,0.000052322273,0.0000050238846,0.0005628547,0.0010067319,0.00803916,0.9791266,0.0028764561,0.0029734706],"study_design_scores_gemma":[0.0016594882,0.00013909758,0.0032990167,0.00017733834,0.000054144242,0.000030376288,0.00010794062,0.040618453,0.020590212,0.8904759,0.041965213,0.00088277087],"about_ca_topic_score_codex":0.000006665829,"about_ca_topic_score_gemma":0.000002277469,"teacher_disagreement_score":0.088650644,"about_ca_system_score_codex":0.000030360457,"about_ca_system_score_gemma":0.000006012415,"threshold_uncertainty_score":0.6721982},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9796808,0.000042616077,0.0000024249005,0.0000018895756,0.001115139,0.00014087465,0.0000015907126,0.00019985285,0.018814828],"genre_scores_gemma":[0.9998629,0.0000051248544,0.000012316837,0.000011916713,0.0000016360834,0.00002145621,0.0000029172625,0.000032661315,0.00004903262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992984,0.00004060364,0.00016698209,0.00014677286,0.00010702887,0.00024021292],"domain_scores_gemma":[0.9996051,0.00003838779,0.000022273933,0.00025453922,0.000012981928,0.00006667896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011626925,0.00016862944,0.00018960133,0.00015724325,0.000028935587,0.000013078807,0.00014717465,0.000075861186,0.0000749461],"category_scores_gemma":[0.000005955289,0.00013671897,0.000040194987,0.00029081936,0.00002688395,0.00010110772,0.000007731727,0.00015741323,0.00004833193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000489111,0.00008166905,0.06195419,0.000028953811,0.000042826603,0.00002669077,0.0022109183,0.000100363024,0.00034849686,0.93485975,0.00024338275,0.000053822943],"study_design_scores_gemma":[0.0014286658,0.00033822344,0.1429414,0.00014753459,0.00001229703,0.000004906333,0.00025245466,0.00012242605,0.014132889,0.83990407,0.00023326656,0.00048187707],"about_ca_topic_score_codex":0.000056362223,"about_ca_topic_score_gemma":0.000023161752,"teacher_disagreement_score":0.09495572,"about_ca_system_score_codex":0.000024438677,"about_ca_system_score_gemma":0.0000043592545,"threshold_uncertainty_score":0.5575238},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83285,0.000050743514,0.00000541192,0.0011946938,0.0027877926,0.00018442403,0.0000027148037,0.00009046305,0.1628338],"genre_scores_gemma":[0.9926048,0.000004662411,0.00006611749,0.0015820514,0.000017412067,0.000023379505,0.0000021127469,0.000018216808,0.0056812633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971273,0.000311522,0.00050641986,0.0004909158,0.0011916881,0.00037214987],"domain_scores_gemma":[0.99522513,0.0031293132,0.00015223213,0.0009996517,0.00026140644,0.00023224308],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001936296,0.0001780844,0.00029185537,0.00020555212,0.00021974611,0.0003384928,0.0010490979,0.00011626919,0.0025775984],"category_scores_gemma":[0.0037112306,0.00013012007,0.0001408709,0.00059224904,0.00012619334,0.00039046185,0.00015824981,0.00023688508,0.030318923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000117765285,0.00006895875,0.0014405597,0.00000103073,0.0000067793303,0.0000071797335,0.0001813107,0.000006597863,0.00012041254,0.8612658,0.1297505,0.0071390998],"study_design_scores_gemma":[0.00044396834,0.00013343451,0.014636913,0.000009531251,0.0000029390858,0.000002729179,0.0001838605,0.00004193741,0.0003097447,0.9777437,0.0063249436,0.00016629932],"about_ca_topic_score_codex":0.00004893615,"about_ca_topic_score_gemma":0.0000029066048,"teacher_disagreement_score":0.15975483,"about_ca_system_score_codex":0.000039353054,"about_ca_system_score_gemma":0.000041088326,"threshold_uncertainty_score":0.99833417},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.973788,0.000037961323,0.014664581,0.00080612535,0.0005022406,0.00017015645,0.0000014090894,0.00010939297,0.009920125],"genre_scores_gemma":[0.9987549,0.0000024241153,0.001024612,0.00011247037,0.0000028359736,0.000020008509,0.0000021349802,0.0000062178824,0.00007438669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991673,0.00005194231,0.00019038894,0.0002401159,0.00018544593,0.00016477058],"domain_scores_gemma":[0.9990206,0.00015962958,0.00007473437,0.0006561717,0.00003467576,0.000054220145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002456368,0.000086998945,0.00015417159,0.0000907968,0.000035784848,0.000027440292,0.0006233596,0.00004857319,0.000006307272],"category_scores_gemma":[0.00004071996,0.000086366104,0.00004101702,0.0003932299,0.000034860055,0.00008257346,0.00007091639,0.000099499965,0.000072791794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015505648,0.00015041429,0.0006840182,0.000005766712,0.000002996748,9.628786e-7,0.00014155969,0.00002541833,0.005368642,0.9914804,0.00047179445,0.0016664445],"study_design_scores_gemma":[0.00097223703,0.00013993119,0.014736851,0.00004593423,0.0000037975838,0.0000026361552,0.0000070389087,0.022429949,0.03709481,0.9199662,0.0044092955,0.00019127976],"about_ca_topic_score_codex":0.000025846935,"about_ca_topic_score_gemma":0.0000052959376,"teacher_disagreement_score":0.07151419,"about_ca_system_score_codex":0.00002772435,"about_ca_system_score_gemma":0.00002916286,"threshold_uncertainty_score":0.35219076},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96929944,0.0003626057,0.000028888313,0.000008818478,0.0038141136,0.00011383424,0.0000029602934,0.00036293842,0.026006404],"genre_scores_gemma":[0.9997233,0.000008050416,0.000009426132,0.000045669745,0.000029184013,0.000026304047,0.000006375921,0.0000394883,0.00011216773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919003,0.00005344456,0.0001498085,0.000098254444,0.0001308443,0.00037764246],"domain_scores_gemma":[0.99944186,0.000095478026,0.0000139354015,0.00029855917,0.000011546427,0.00013861498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023554021,0.00014865011,0.00015391097,0.00006437518,0.00006859221,0.000020296013,0.00014732387,0.00008527774,0.00015356556],"category_scores_gemma":[0.000019265572,0.00014522568,0.00006470411,0.00016131054,0.000019460527,0.00015713877,0.000014164039,0.00014223972,0.0007730509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056828794,0.000060416478,0.0033281432,0.000024327162,0.00003110745,0.000002147032,0.00033342675,0.00008076401,0.00310268,0.9815607,0.011068554,0.00040202696],"study_design_scores_gemma":[0.0011465334,0.00014571314,0.010151491,0.0000475572,0.000029875871,0.000017508835,0.00020186209,0.00038261875,0.029163836,0.9262589,0.03177934,0.0006747346],"about_ca_topic_score_codex":0.000005081601,"about_ca_topic_score_gemma":5.3408024e-7,"teacher_disagreement_score":0.055301797,"about_ca_system_score_codex":0.000039326427,"about_ca_system_score_gemma":0.000003381456,"threshold_uncertainty_score":0.9936263},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9689152,0.00003473752,0.010190698,0.0014889558,0.0014946981,0.00052670744,0.0000013724673,0.00032438833,0.01702324],"genre_scores_gemma":[0.9893092,0.000004284504,0.008419371,0.00007468462,0.000010272354,0.00008806315,0.0000033581007,0.000015656866,0.0020750915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983418,0.00014613979,0.00021752504,0.00040356992,0.00044633672,0.0004446391],"domain_scores_gemma":[0.9985799,0.00022301037,0.00007275022,0.0007408786,0.00021396932,0.0001694853],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003756363,0.0001510947,0.00015536394,0.0001030087,0.00015835,0.0002095006,0.00093037455,0.000078467434,0.00020926668],"category_scores_gemma":[0.0001788596,0.00014888385,0.00006511991,0.00064366404,0.00009995501,0.0011730304,0.00032875975,0.00022229971,0.0016199428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046157484,0.0000669987,0.00046860368,0.00000558699,0.000008389649,0.000012218647,0.00017893505,0.000005414861,0.0026390657,0.9817533,0.0017386745,0.013118221],"study_design_scores_gemma":[0.00069451105,0.00007538368,0.010099557,0.000010061908,0.0000015436325,0.000025250383,0.000031650376,0.003812644,0.003112508,0.98158586,0.00036188043,0.00018916256],"about_ca_topic_score_codex":0.00003704175,"about_ca_topic_score_gemma":0.0000011174176,"teacher_disagreement_score":0.020394016,"about_ca_system_score_codex":0.00007636013,"about_ca_system_score_gemma":0.000054123477,"threshold_uncertainty_score":0.9991574},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990852,0.00029799063,0.0000067590818,0.000023860533,0.0025454618,0.000121704754,0.000010467173,0.00008578552,0.0060559986],"genre_scores_gemma":[0.99981713,0.0000482383,0.000019115834,0.0000059358867,0.0000070071887,0.000016362257,0.0000021601118,0.000021612179,0.00006245184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992899,0.00004191155,0.00021167143,0.00011045361,0.0001330171,0.00021304922],"domain_scores_gemma":[0.99933,0.00019525866,0.000041388397,0.00032088556,0.00004164296,0.00007082772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031572842,0.0001210021,0.000171142,0.00006793109,0.00011650691,0.000032186043,0.00019729088,0.00007533115,0.000014014615],"category_scores_gemma":[0.000031860825,0.00009474856,0.00006083419,0.00041334602,0.0001095882,0.000073712865,0.000031105603,0.00021237571,0.00002698559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046740993,0.000015520822,0.017097998,0.000031694937,0.000043733104,0.0000011573992,0.00014044643,0.0000109307375,0.0063502337,0.975276,0.00046042234,0.000567213],"study_design_scores_gemma":[0.00079055474,0.00003937868,0.037335295,0.000029056273,0.00003524148,0.000026292233,0.00011292664,0.0026111647,0.0037806793,0.9394863,0.015466884,0.00028617296],"about_ca_topic_score_codex":0.000026302007,"about_ca_topic_score_gemma":0.000018698845,"teacher_disagreement_score":0.03578962,"about_ca_system_score_codex":0.000005157575,"about_ca_system_score_gemma":0.0000050452327,"threshold_uncertainty_score":0.3863734},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9824771,0.0026837604,0.0063844556,0.00065708655,0.0014497322,0.00036525677,7.4170924e-7,0.00011619919,0.0058656675],"genre_scores_gemma":[0.99951595,0.000101117745,0.00027129415,0.000021657155,0.0000032702217,0.000024831368,2.68002e-7,0.000005273057,0.000056314788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990089,0.00011043308,0.00017449292,0.0000888392,0.00030530957,0.00031200875],"domain_scores_gemma":[0.99924165,0.00010296244,0.000055737797,0.00043740915,0.0000947876,0.0000674581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006600138,0.00007396212,0.00008533414,0.000059329228,0.00020953409,0.00004477876,0.0007332853,0.0000287547,0.000001536806],"category_scores_gemma":[0.000056234498,0.000046636524,0.000053078573,0.0004173448,0.00013698034,0.0009715032,0.00008705634,0.00010929535,0.0000196038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009138413,0.00004217499,0.0007322766,0.000010578936,0.000008983937,9.885409e-8,0.0015650182,0.000001517345,0.0023165199,0.98349524,0.000046826557,0.011771643],"study_design_scores_gemma":[0.00040959826,0.00009169497,0.0030915823,0.00002432476,0.0000036819213,0.0000048352385,0.00021989232,0.0007822671,0.087930135,0.901434,0.0058680302,0.0001399332],"about_ca_topic_score_codex":0.000004423911,"about_ca_topic_score_gemma":7.546441e-7,"teacher_disagreement_score":0.085613616,"about_ca_system_score_codex":0.000016303798,"about_ca_system_score_gemma":0.00002340921,"threshold_uncertainty_score":0.19017822},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7593499,0.00050163275,0.20581484,0.0036562234,0.007953758,0.001459228,0.0000107856185,0.0018008987,0.019452738],"genre_scores_gemma":[0.9494259,0.0000036863503,0.050269727,0.000111862595,0.000009916793,0.00005541992,6.986165e-7,0.00001539472,0.00010742634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895334,0.000016355487,0.00026076217,0.000274846,0.00023320096,0.00026146954],"domain_scores_gemma":[0.99830157,0.00045406263,0.00018186786,0.00079562695,0.00021457412,0.000052326122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057185075,0.0001319736,0.00015985638,0.00008682792,0.0001433982,0.0002522741,0.0016996448,0.00007155659,0.0000018861582],"category_scores_gemma":[0.00033474583,0.000100471996,0.000106391635,0.0004022502,0.00016932315,0.0006195998,0.0003483572,0.00021096405,0.0000045443408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027766926,0.000055778233,0.0006157742,0.000030242398,0.000011210977,9.723934e-7,0.00012144038,2.728572e-7,0.007036924,0.96683496,0.001727161,0.023562482],"study_design_scores_gemma":[0.00021162281,0.0000849945,0.0010106674,0.000029572577,0.000009676921,0.000008779535,0.00001686393,0.0048677325,0.06256956,0.9283383,0.002699359,0.00015288193],"about_ca_topic_score_codex":0.000011732038,"about_ca_topic_score_gemma":0.0000038094977,"teacher_disagreement_score":0.19007598,"about_ca_system_score_codex":0.000009451625,"about_ca_system_score_gemma":0.000059310263,"threshold_uncertainty_score":0.4097129},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9889145,0.00062025705,0.0010354625,0.00008264374,0.0012828469,0.0005928049,0.000079702666,0.000039100352,0.007352678],"genre_scores_gemma":[0.9966875,0.000045484776,0.0014267571,0.00003909509,0.000023688368,0.000151173,0.00032604468,0.000026805896,0.0012735081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916714,0.00001629944,0.00014610233,0.00028546219,0.0000888193,0.00029619405],"domain_scores_gemma":[0.99936223,0.000005163555,0.000052867912,0.00036531469,0.00012251023,0.000091890535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012397165,0.00013620536,0.00010976472,0.000032935703,0.000121761346,0.000017225604,0.00021532018,0.00011313989,0.00006117565],"category_scores_gemma":[0.000018981182,0.00014021965,0.00012249078,0.000096893236,0.00005826262,0.0000041978606,0.00008452407,0.000054432927,0.000036038113],"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.0005468165,0.0012752604,0.01677167,0.000091210684,0.0008068626,0.000012975317,0.0006450946,0.0000026788537,0.16745183,0.73628116,0.07180247,0.004312014],"study_design_scores_gemma":[0.010813267,0.0017780684,0.02212625,0.000019535115,0.00023633213,0.000027325179,0.00029244708,0.00004131261,0.38230866,0.29897237,0.2821046,0.00127984],"about_ca_topic_score_codex":0.000030936557,"about_ca_topic_score_gemma":0.0000074223044,"teacher_disagreement_score":0.43730876,"about_ca_system_score_codex":0.000013330426,"about_ca_system_score_gemma":0.000037330214,"threshold_uncertainty_score":0.57179916},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9796335,0.00033375435,0.0060372474,0.001632502,0.0012645462,0.00037715613,7.172561e-7,0.00022346879,0.010497107],"genre_scores_gemma":[0.9968332,0.000015199907,0.0028005964,0.00016088558,0.000002969724,0.000012518544,0.0000013881961,0.000005733844,0.00016752795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998663,0.00012050102,0.00019254905,0.00034574352,0.00031478968,0.00036342107],"domain_scores_gemma":[0.9990937,0.00012553063,0.0000492908,0.00055797637,0.000082794824,0.000090692396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005183572,0.00011701941,0.00014404167,0.0003552529,0.000074869466,0.000072984476,0.0009155631,0.00006251184,0.000006427394],"category_scores_gemma":[0.000106382686,0.00012071952,0.0000502374,0.0012801486,0.000047280922,0.0006381731,0.000106048166,0.00020814041,0.000059309114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008980249,0.000112276044,0.00069561094,0.0000020635675,0.0000018474888,0.00003642395,0.00022532878,0.000007697628,0.0008364525,0.9632967,0.00030598725,0.034470614],"study_design_scores_gemma":[0.0007676821,0.0001375999,0.022193473,0.000012235723,7.2922165e-7,0.000006281436,0.000010233425,0.0012600144,0.0028934684,0.97217685,0.00040579593,0.00013564945],"about_ca_topic_score_codex":0.000005475347,"about_ca_topic_score_gemma":0.0000034907903,"teacher_disagreement_score":0.034334965,"about_ca_system_score_codex":0.00007387823,"about_ca_system_score_gemma":0.00003806478,"threshold_uncertainty_score":0.4922799},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96711934,0.000012080861,0.000014583305,0.000046925095,0.00016058059,0.00049305847,0.00001143879,0.000056027508,0.032085992],"genre_scores_gemma":[0.99960226,0.0000023452405,0.00018780943,0.000041991407,0.0000018238505,0.00009272833,0.000001966603,0.000012379155,0.00005669706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991824,0.00014247544,0.00020408368,0.00018439161,0.00014990072,0.00013673847],"domain_scores_gemma":[0.9986021,0.00046831873,0.0001269171,0.00068750535,0.00008140118,0.000033788354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005766827,0.00010897096,0.00015560782,0.000044401037,0.00011793988,0.000005197566,0.0002893174,0.000060467934,0.00013065209],"category_scores_gemma":[0.00020752249,0.00007430961,0.00009812366,0.0002522915,0.00016569377,0.000034908688,0.000035677836,0.00015352172,0.000028219862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000276413,0.0004501453,0.0009355523,0.000023414634,0.00004530207,7.5527754e-7,0.0013854209,6.707017e-8,0.0003562706,0.99603903,0.00068194675,0.00005442537],"study_design_scores_gemma":[0.0001923016,0.00009616049,0.002975088,0.000017657014,0.000028465267,0.0000014426862,0.00031545377,0.000003849006,0.021850957,0.9743154,0.00012167872,0.0000815444],"about_ca_topic_score_codex":0.000028638227,"about_ca_topic_score_gemma":0.0000019410527,"teacher_disagreement_score":0.03248295,"about_ca_system_score_codex":0.000013329029,"about_ca_system_score_gemma":0.000021618267,"threshold_uncertainty_score":0.30302578},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51795435,0.00040450683,0.35615972,0.0077818567,0.0029598058,0.0012174161,0.0000094604275,0.00074386137,0.11276903],"genre_scores_gemma":[0.98876405,0.0000056928566,0.010749202,0.0002829047,0.0000042127613,0.000010250732,9.070905e-7,0.000005840942,0.00017694474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993797,0.00008983974,0.00013648767,0.00017060433,0.0001083926,0.00011498273],"domain_scores_gemma":[0.999353,0.00017516124,0.00007021272,0.0003078323,0.00004080087,0.000052996704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020914047,0.000082213926,0.00009791543,0.00004382322,0.00015790689,0.000072742296,0.00024791338,0.00005895367,0.000059468126],"category_scores_gemma":[0.000050468974,0.000058275196,0.000035923647,0.0001989918,0.0001241025,0.00027507538,0.00007764398,0.0001259089,0.000040406634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036049119,0.000008151628,0.045091238,8.960331e-7,0.000016328946,6.735261e-7,0.0011191391,0.0000030545843,7.652584e-7,0.9434242,0.00033549254,0.009996459],"study_design_scores_gemma":[0.0018415508,0.000044810633,0.320887,0.000009560431,0.000024651868,0.0000070376846,0.00004103756,0.005050757,0.00008248218,0.67095166,0.00089923723,0.00016024648],"about_ca_topic_score_codex":0.00006265217,"about_ca_topic_score_gemma":0.000009652937,"teacher_disagreement_score":0.4708097,"about_ca_system_score_codex":0.000013484498,"about_ca_system_score_gemma":0.00002322012,"threshold_uncertainty_score":0.23763935},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.992433,0.00014959153,0.000064535,0.0020095413,0.0025187875,0.00010537433,8.5955975e-7,0.00009839086,0.002619898],"genre_scores_gemma":[0.99897414,0.0000040537634,0.0003135073,0.0006498976,6.5813475e-7,0.0000065834533,4.7340828e-7,0.000004585133,0.000046100897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898005,0.00011952494,0.00018424168,0.0002009369,0.00035063544,0.00016463725],"domain_scores_gemma":[0.9987371,0.00018666284,0.00009268787,0.000744295,0.00014104729,0.00009818605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008422343,0.000089542365,0.00012931829,0.00006203635,0.0000698465,0.000038620175,0.00068861316,0.00004092135,0.0000030218196],"category_scores_gemma":[0.00017180796,0.000058666836,0.00006488073,0.00039439238,0.000082649785,0.00014753926,0.00015256253,0.00011260931,0.00005408915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040521,0.00008042111,0.00036991038,0.0000020648358,0.000008207226,0.0000013895855,0.0001965738,0.0000144911555,0.00012982576,0.989111,0.009826596,0.00025547],"study_design_scores_gemma":[0.00037612644,0.00014429295,0.000428795,0.000011156884,0.0000028657728,0.0000010413413,0.000012217526,0.00055146095,0.0026225687,0.9955522,0.00022352213,0.00007375341],"about_ca_topic_score_codex":0.00006789369,"about_ca_topic_score_gemma":5.8338776e-7,"teacher_disagreement_score":0.009603074,"about_ca_system_score_codex":0.000011660942,"about_ca_system_score_gemma":0.00006114704,"threshold_uncertainty_score":0.23923641},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73906374,0.0013790764,0.000024982883,0.00033783726,0.0023377219,0.0001211492,0.000049598533,0.000040405568,0.2566455],"genre_scores_gemma":[0.9993542,0.000052072966,0.00026394025,0.00009309153,0.000016551803,0.00000619978,0.000007738841,0.00001799611,0.00018820801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898666,0.00000730592,0.00048145765,0.0002522822,0.000031217198,0.00024107576],"domain_scores_gemma":[0.99925977,0.000020358113,0.00023155747,0.00030782179,0.000028340835,0.00015214265],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003285962,0.00012004749,0.00036784503,0.000107932785,0.00002577425,0.000025240512,0.00026458298,0.000094023766,0.00008403542],"category_scores_gemma":[0.00006705353,0.00015258255,0.000095058036,0.00018222792,0.00005171502,0.00019134556,0.00004132863,0.00009923479,0.0007838455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060050616,0.00008874592,0.011220531,0.000008060569,0.00002952177,0.0000033512872,0.00018473495,0.000019493313,0.0000068172067,0.9857008,0.0026032277,0.00012873317],"study_design_scores_gemma":[0.001077043,0.00011503459,0.006470909,0.000005543293,0.0000039149104,0.000005352389,0.00007622288,0.00040123315,0.00041995262,0.9685423,0.02270428,0.0001782184],"about_ca_topic_score_codex":0.00017328818,"about_ca_topic_score_gemma":0.000004167881,"teacher_disagreement_score":0.26029047,"about_ca_system_score_codex":0.00011250372,"about_ca_system_score_gemma":0.00003645885,"threshold_uncertainty_score":0.99999416},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98763955,0.00026248302,0.00032146185,0.0017779078,0.0031100647,0.00030127954,5.576833e-7,0.00064182567,0.0059448495],"genre_scores_gemma":[0.9923174,0.000014282473,0.0062398016,0.0010247438,0.0000011493416,0.000033549994,0.0000016961416,0.000015489994,0.00035188833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848425,0.000065479835,0.00025552913,0.0004483428,0.00035597253,0.00039042297],"domain_scores_gemma":[0.9986283,0.0001081839,0.000088483874,0.0008257503,0.0001736072,0.00017563121],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027524855,0.00018115087,0.00017485232,0.00016852736,0.00019817671,0.00021495795,0.0007552334,0.00008597159,0.000033518972],"category_scores_gemma":[0.000055541892,0.0001594234,0.0000812692,0.0005590411,0.000044952845,0.00038634994,0.00018929824,0.00021041799,0.0014799051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001100902,0.00011145871,0.00044575264,0.0000035759572,0.000011900537,0.0000035828857,0.00011319839,0.000021108675,0.0030181,0.9864619,0.0059567546,0.003851577],"study_design_scores_gemma":[0.0005558227,0.00014692338,0.00077988685,0.000033508255,0.0000035167368,0.000003851128,0.0000075500907,0.0048403125,0.0054024137,0.9875856,0.00042332115,0.00021729659],"about_ca_topic_score_codex":0.0000992885,"about_ca_topic_score_gemma":5.4704276e-7,"teacher_disagreement_score":0.0059183394,"about_ca_system_score_codex":0.000020669024,"about_ca_system_score_gemma":0.000038406757,"threshold_uncertainty_score":0.99929756},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9385501,0.0001815483,0.00003769667,0.000046172732,0.002192734,0.00011446461,0.0000012569345,0.0004984773,0.058377523],"genre_scores_gemma":[0.9996351,0.0000096744825,0.0000127792655,0.00012071346,0.00001168914,0.000007404785,0.0000025149009,0.000019054842,0.0001810886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935174,0.00003483069,0.00014328955,0.0001260963,0.00012210592,0.00022194127],"domain_scores_gemma":[0.99956495,0.000051854906,0.000016023687,0.00027898935,0.000012045523,0.00007613914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012702314,0.00013700893,0.0001454747,0.000069345515,0.000055027103,0.000026218595,0.00015878261,0.00007734997,0.00004446942],"category_scores_gemma":[0.000013654859,0.00013587186,0.00006093259,0.00017501283,0.000012677035,0.00006964042,0.000004675981,0.00014080766,0.00038784035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007633323,0.00003979451,0.000050274073,0.000008292038,0.00001464494,0.000010899678,0.00010606024,0.0003970728,0.0037149137,0.987242,0.0069451216,0.0014632805],"study_design_scores_gemma":[0.00046955814,0.00017241649,0.0018635779,0.000035884812,0.00000726154,0.0000051736383,0.000020117337,0.00047144011,0.007344461,0.9866632,0.0027280962,0.00021880612],"about_ca_topic_score_codex":0.0000013112009,"about_ca_topic_score_gemma":2.3416133e-7,"teacher_disagreement_score":0.061084956,"about_ca_system_score_codex":0.00003137532,"about_ca_system_score_gemma":0.0000036967708,"threshold_uncertainty_score":0.55406934},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3302396,0.00002090449,0.012188944,0.005177804,0.00072053686,0.000527094,0.000019857081,0.00010181394,0.6510035],"genre_scores_gemma":[0.99872595,2.856962e-7,0.00031769372,0.00016340148,0.000029167277,0.00004299724,0.0000037153598,0.000011686358,0.0007050895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995101,0.00002569257,0.0000977895,0.00011157368,0.00011342282,0.0001414268],"domain_scores_gemma":[0.9992403,0.00025684497,0.00004313557,0.0003366423,0.000044805394,0.000078279765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015726827,0.000086257714,0.00008915964,0.0000079808415,0.0001115886,0.000027390712,0.00018078217,0.000014902661,0.00016873033],"category_scores_gemma":[0.000032223445,0.000052528983,0.000046090878,0.00010889784,0.000068823545,0.00003666574,0.000047157875,0.00011151415,0.00044954277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004645587,0.00007711296,0.000037053687,6.330275e-7,0.0000074642803,1.7072315e-7,0.00019409436,0.000008371386,0.000020306543,0.9957789,0.0025557529,0.0013155031],"study_design_scores_gemma":[0.00020801574,0.000028346692,0.000010934903,0.000005991331,0.0000059109416,1.9552172e-7,0.00040121196,0.00010321033,0.0010565508,0.9778679,0.020240933,0.00007082262],"about_ca_topic_score_codex":0.000005567019,"about_ca_topic_score_gemma":6.85569e-8,"teacher_disagreement_score":0.66848636,"about_ca_system_score_codex":0.000013606025,"about_ca_system_score_gemma":0.000021725027,"threshold_uncertainty_score":0.57781124},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9078856,0.000038003378,0.060450293,0.0023950725,0.0047358605,0.0002585372,0.000001226971,0.0005105774,0.023724806],"genre_scores_gemma":[0.99257785,0.0000039416645,0.0047287527,0.0021476038,0.000014801227,0.00001948288,0.00000312748,0.000009505278,0.0004949282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990109,0.00008413635,0.00014734437,0.00031240605,0.00021629258,0.00022890393],"domain_scores_gemma":[0.99896604,0.00023046501,0.000071458235,0.0006054609,0.000041259453,0.00008529161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015387125,0.00012575694,0.000140412,0.00007618022,0.00017840581,0.00007324822,0.00056468794,0.000050322342,0.000022939857],"category_scores_gemma":[0.00015770298,0.00010963406,0.000051027797,0.00030414076,0.000024191138,0.00019709961,0.00007891436,0.00012606378,0.00031277933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044023627,0.00008314413,0.0000615946,0.0000017032665,0.00000448701,0.0000019001478,0.000055233577,0.0002699932,0.000133932,0.9935545,0.0020586115,0.0037705223],"study_design_scores_gemma":[0.00093971414,0.00025182604,0.0012735217,0.000009212357,0.0000024906203,0.0000011338382,0.000001731064,0.010101001,0.0012968171,0.9762587,0.009710148,0.00015371157],"about_ca_topic_score_codex":0.0000039320275,"about_ca_topic_score_gemma":0.0000010771042,"teacher_disagreement_score":0.08469223,"about_ca_system_score_codex":0.000033232634,"about_ca_system_score_gemma":0.000018362105,"threshold_uncertainty_score":0.4470747},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42628226,0.0003999101,0.5142873,0.0019789934,0.02877556,0.002488457,0.000004558652,0.0018424175,0.023940548],"genre_scores_gemma":[0.9929333,0.0000041241196,0.0053256494,0.00075741776,0.00012299768,0.000057112637,0.00000860943,0.00001421841,0.00077656884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848616,0.0000734229,0.00030946604,0.00041391628,0.00018006063,0.0005369732],"domain_scores_gemma":[0.9988195,0.000108773034,0.00011370997,0.00062466925,0.00017473588,0.00015862021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000525868,0.00017672704,0.00025424815,0.00006938393,0.00022967572,0.000285864,0.00068364857,0.000117251475,0.000007743658],"category_scores_gemma":[0.000016100788,0.00016145827,0.00012495778,0.00040363456,0.000013553173,0.00064732414,0.000052499276,0.00011814742,0.000020354888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040846517,0.00010387721,0.00011995653,0.000004566771,0.000019877923,0.0000027112042,0.00021012573,0.00028086023,0.00011845473,0.961261,0.030613286,0.007224435],"study_design_scores_gemma":[0.003305637,0.0016021538,0.00090502086,0.000057040656,0.000015493111,0.000028075547,0.000018182833,0.25283024,0.00059071934,0.7131761,0.026945842,0.0005255421],"about_ca_topic_score_codex":0.0000289356,"about_ca_topic_score_gemma":0.000027264914,"teacher_disagreement_score":0.56665105,"about_ca_system_score_codex":0.00006140657,"about_ca_system_score_gemma":0.000038337046,"threshold_uncertainty_score":0.65840775},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93298703,0.0000105196095,0.01800031,0.002498592,0.0027363782,0.0006566156,0.000016686014,0.00018141571,0.042912453],"genre_scores_gemma":[0.99850786,0.00000295727,0.0007583519,0.0001055457,0.000016610007,0.000048831815,0.000009275904,0.000015710491,0.00053485774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992029,0.000050662627,0.00025616866,0.00011754858,0.00021273615,0.00015996299],"domain_scores_gemma":[0.99831814,0.0010795725,0.00007753839,0.0004034097,0.00006428136,0.000057090198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025993754,0.00011261076,0.00013662734,0.000034550285,0.00020968412,0.000040339906,0.00018705835,0.00007935497,0.00023632236],"category_scores_gemma":[0.00057795126,0.00007044617,0.000073861855,0.00015160229,0.00004495015,0.00008519341,0.00001740755,0.00031866398,0.00011303334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000647921,0.000098783574,0.000023138397,0.000009666582,0.000010553259,5.1045924e-7,0.00015658913,0.0000062616396,0.00049841206,0.9974783,0.0008548716,0.00085640635],"study_design_scores_gemma":[0.00034683076,0.000041922616,0.00012596947,0.000018749426,0.000011403863,0.0000014293084,0.000043098687,0.004415716,0.00036067536,0.99159724,0.0029373444,0.00009959993],"about_ca_topic_score_codex":0.000007316092,"about_ca_topic_score_gemma":0.0000276813,"teacher_disagreement_score":0.06552083,"about_ca_system_score_codex":0.000015310838,"about_ca_system_score_gemma":0.000014039438,"threshold_uncertainty_score":0.28727114},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9822853,0.000096993026,0.006061039,0.00081886165,0.0011653198,0.0006303455,5.197006e-7,0.00020831301,0.008733267],"genre_scores_gemma":[0.9964242,0.000008847789,0.0030399892,0.00010474504,0.0000027361377,0.00011727191,0.000001862637,0.000013629958,0.00028674345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983608,0.00018761419,0.00023590913,0.00040067767,0.00036317224,0.00045182605],"domain_scores_gemma":[0.998782,0.0002451811,0.00006573508,0.0006260072,0.00015107072,0.00013005061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004695851,0.0001437729,0.00016877071,0.00032683907,0.000093124014,0.00013470394,0.0010482802,0.00007786814,0.000058937094],"category_scores_gemma":[0.0001387636,0.00014667257,0.00005685167,0.0013202811,0.00009206002,0.0012587673,0.00025228565,0.00022541292,0.0004596797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042521197,0.00008883012,0.0036242553,0.0000059023037,0.0000049969517,0.000009089119,0.0003312493,0.000007437001,0.0019056032,0.98339194,0.0008204464,0.009805981],"study_design_scores_gemma":[0.0008041509,0.00006539558,0.012077132,0.0000119775605,8.5410386e-7,0.0000030004355,0.000042338026,0.0030407142,0.002605429,0.981019,0.00015645142,0.00017351059],"about_ca_topic_score_codex":0.000093306386,"about_ca_topic_score_gemma":0.000010662149,"teacher_disagreement_score":0.014138832,"about_ca_system_score_codex":0.00009380791,"about_ca_system_score_gemma":0.00004607088,"threshold_uncertainty_score":0.59811336},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9361813,0.00019189387,0.00001246464,0.0000012770029,0.0018270509,0.00011677887,0.0000029124658,0.00041227348,0.061254054],"genre_scores_gemma":[0.999799,0.000011928253,0.00006511754,0.0000068558334,0.0000030789067,0.0000165105,0.000001948365,0.000028769315,0.00006680492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930274,0.00004769334,0.00021412101,0.00012866363,0.00011459928,0.00019218783],"domain_scores_gemma":[0.999475,0.000081913124,0.000041123552,0.0003058652,0.00003331775,0.00006278882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013981295,0.00014097945,0.00020019885,0.000121183395,0.00003494191,0.0000060241073,0.00017419034,0.00008057691,0.0001062465],"category_scores_gemma":[0.0000267763,0.00013920008,0.00008832903,0.00024894104,0.000037045003,0.00006405269,0.000014441215,0.00011966483,0.000070599854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041440115,0.00015913552,0.005606166,0.00011537174,0.00013293755,0.000013450838,0.0021549119,0.00006927021,0.0065755644,0.9827832,0.0018050618,0.0005435165],"study_design_scores_gemma":[0.0022198376,0.00036545555,0.03750618,0.00047018338,0.00006548784,0.00000999501,0.0003649274,0.004053946,0.15825047,0.7947712,0.0011544115,0.0007679056],"about_ca_topic_score_codex":0.00005487464,"about_ca_topic_score_gemma":0.0000045841152,"teacher_disagreement_score":0.18801196,"about_ca_system_score_codex":0.000013022494,"about_ca_system_score_gemma":0.0000039423344,"threshold_uncertainty_score":0.56764144},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9949971,0.00012994542,0.0002778154,0.000090218324,0.00354282,0.00022175413,0.000004735297,0.000025193434,0.00071041525],"genre_scores_gemma":[0.9989647,0.000011139855,0.0002757481,0.000031542513,0.00013436416,0.000038023627,0.00011240269,0.000009056041,0.0004230199],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947065,0.000021161566,0.00012118917,0.00020188086,0.00004615859,0.00013897922],"domain_scores_gemma":[0.9996246,0.000014716271,0.000049638576,0.00015922877,0.00010769513,0.000044092376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016163339,0.00007578753,0.000075575816,0.000015226805,0.00011029411,0.000029407363,0.00010634461,0.00015024413,0.0000033689173],"category_scores_gemma":[0.00012787794,0.000064805085,0.000055399392,0.00004479544,0.00003669482,0.0000020030266,0.00003390801,0.00008409818,0.0000068258946],"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.000023194356,0.000044923854,0.00055630604,0.000010476837,0.000015540065,2.923961e-7,0.000012579818,0.000016179634,0.91186225,0.08428171,0.0023884806,0.0007880551],"study_design_scores_gemma":[0.0050595654,0.0028494534,0.013984308,0.000043578137,0.000100140904,0.0001720822,0.00047907987,0.0043112445,0.34850153,0.18323134,0.43982375,0.0014439211],"about_ca_topic_score_codex":0.000006233451,"about_ca_topic_score_gemma":9.132588e-7,"teacher_disagreement_score":0.5633607,"about_ca_system_score_codex":0.000004095801,"about_ca_system_score_gemma":0.000022369153,"threshold_uncertainty_score":0.26426744},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93751955,0.0001903505,0.000030804822,0.0000023756818,0.001272229,0.00015112484,0.000006124086,0.00043035523,0.060397096],"genre_scores_gemma":[0.9995742,0.000016152697,0.000034586632,0.000021561718,0.0000031882907,0.000034994402,0.0000084157045,0.000038904087,0.0002679976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999142,0.00003935569,0.0001701539,0.00019219963,0.000141773,0.0003145113],"domain_scores_gemma":[0.9993888,0.000041711053,0.000034002485,0.00037207108,0.00005266048,0.0001107328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010883704,0.00018844154,0.00020230033,0.000073421106,0.00010885083,0.00002096048,0.00021684603,0.000087103355,0.0002929052],"category_scores_gemma":[0.0000093939425,0.00017035478,0.00003962035,0.00037249387,0.000057173755,0.0001572435,0.000027669934,0.00013530454,0.0001642124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049974507,0.000053043193,0.020981027,0.00005991741,0.00011003918,0.00003699465,0.0009109432,0.00005340122,0.0044700596,0.97176737,0.0014155115,0.00009171336],"study_design_scores_gemma":[0.0026801873,0.00045036798,0.024868777,0.00017044766,0.00007149024,0.0000978066,0.0003236116,0.00076296506,0.051383886,0.91522473,0.002915133,0.0010505847],"about_ca_topic_score_codex":0.0000470172,"about_ca_topic_score_gemma":0.000019821056,"teacher_disagreement_score":0.062054656,"about_ca_system_score_codex":0.00004422353,"about_ca_system_score_gemma":0.000012216638,"threshold_uncertainty_score":0.6946866},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6095985,0.000011502166,0.0013014472,0.0004811397,0.0003348504,0.0002615932,0.00001590794,0.000056230292,0.38793883],"genre_scores_gemma":[0.99805903,0.0000010702275,0.00017739143,0.00009851528,0.000015677886,0.00008834249,0.000004070005,0.000011217682,0.0015446775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954927,0.000013558839,0.00010951105,0.00010649659,0.0000866441,0.00013453948],"domain_scores_gemma":[0.9994772,0.00012127053,0.00004860748,0.0002883196,0.000027627177,0.000036969377],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006406687,0.00008549732,0.00008985056,0.000009044346,0.0001609935,0.000019705967,0.0001901159,0.00001449763,0.0013288701],"category_scores_gemma":[0.000008437224,0.000056895027,0.00006158739,0.000089007546,0.000077738165,0.000058444653,0.000042738357,0.00009665113,0.00024879837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033100969,0.00009154952,0.00033022216,0.0000014934684,0.000016437445,2.1137797e-7,0.00042420416,3.3587045e-7,0.0000105501085,0.99629325,0.0023638213,0.0004646149],"study_design_scores_gemma":[0.00013551435,0.000015475714,0.00018254499,0.0000065935187,0.000008797063,1.6045227e-7,0.0009690105,0.000009317355,0.0020578457,0.99423176,0.0023093673,0.00007362987],"about_ca_topic_score_codex":0.000017683686,"about_ca_topic_score_gemma":1.00726666e-7,"teacher_disagreement_score":0.38846055,"about_ca_system_score_codex":0.000007129992,"about_ca_system_score_gemma":0.000007582233,"threshold_uncertainty_score":0.9995841},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99357295,0.00034883452,0.000017199107,0.00036816314,0.00025184147,0.0002190786,0.00001779483,0.00011797872,0.0050861854],"genre_scores_gemma":[0.9974009,0.000036247187,0.0018049965,0.000014470457,0.000004850794,0.000038467202,0.000015300147,0.000022253354,0.0006625618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901026,0.00015074718,0.0003287232,0.000187521,0.00016265758,0.00016008146],"domain_scores_gemma":[0.9988488,0.00029524253,0.0001578794,0.0004243577,0.00013909522,0.00013462773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004857929,0.00013893528,0.0002590715,0.00008327151,0.00009841386,0.000017357022,0.00017665919,0.000108787106,0.000036684378],"category_scores_gemma":[0.00030853905,0.0001250214,0.000064995285,0.00029132832,0.00017833311,0.000092357324,0.000061279476,0.00012451225,0.00001711966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001439197,0.00018959395,0.0026698972,0.0000131186025,0.00004832288,0.0000015634479,0.00070239557,0.0000026577995,0.0006899507,0.9926481,0.002812071,0.00020791139],"study_design_scores_gemma":[0.0010223805,0.00007149695,0.0016402793,0.000029759874,0.00007919172,0.0000084918665,0.00018528248,0.0000898578,0.0015810785,0.99393713,0.0012204393,0.00013462047],"about_ca_topic_score_codex":0.00009421435,"about_ca_topic_score_gemma":0.000040814142,"teacher_disagreement_score":0.004423624,"about_ca_system_score_codex":0.000018560626,"about_ca_system_score_gemma":0.000040499046,"threshold_uncertainty_score":0.5098225},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71477807,0.00016577776,0.2750852,0.0015680653,0.0015740495,0.00035248033,0.000010588081,0.0004239252,0.006041828],"genre_scores_gemma":[0.9972447,0.000003012772,0.0025598102,0.000049362705,0.0000058824694,0.000010613073,0.000026846705,0.0000060451093,0.00009369479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926966,0.000052319545,0.00017906698,0.00019865873,0.00016977664,0.00013052269],"domain_scores_gemma":[0.99915093,0.00006727247,0.00009230189,0.0005719257,0.000065387474,0.000052205716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017772146,0.00007838458,0.000119815064,0.000050940755,0.00007405845,0.000043856166,0.000552276,0.00004700593,0.0000055751875],"category_scores_gemma":[0.000022128308,0.0000799224,0.000036525234,0.0002944259,0.00002787102,0.00017088691,0.00007441208,0.00006599985,0.000056825233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.3790036e-7,0.00006079847,0.0004362133,0.0000061575665,0.0000054646944,5.068021e-7,0.00011878083,0.000011514259,0.0041257218,0.99044776,0.0014405678,0.0033456667],"study_design_scores_gemma":[0.0010606098,0.0001269679,0.010629856,0.000025606232,0.000016017984,0.00000849172,0.000015601683,0.06929219,0.054655027,0.8451579,0.018711332,0.0003003617],"about_ca_topic_score_codex":0.000036045516,"about_ca_topic_score_gemma":0.000005691141,"teacher_disagreement_score":0.28246665,"about_ca_system_score_codex":0.000014378184,"about_ca_system_score_gemma":0.000031357606,"threshold_uncertainty_score":0.32591408},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9354865,0.0014582893,0.047399282,0.007174654,0.002611788,0.002402003,0.0000023763764,0.00040242096,0.0030626783],"genre_scores_gemma":[0.9935512,0.000030612693,0.006066712,0.00013466513,0.0000071948734,0.00011215483,0.0000010883542,0.000011461088,0.00008489371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980964,0.00033141027,0.00045391897,0.00043492505,0.00040028014,0.0002830615],"domain_scores_gemma":[0.99658316,0.0015292027,0.0002234401,0.0011691995,0.00038283403,0.000112136906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008002464,0.00020109606,0.00035767443,0.00007736858,0.00018457854,0.00019959224,0.0012926804,0.000082776176,0.000014968074],"category_scores_gemma":[0.00035062138,0.00014329437,0.00008188617,0.00056037726,0.00039421863,0.0004720605,0.0006429258,0.00018652559,0.00005359881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043656983,0.00016643682,0.0025731358,0.000024371204,0.000020676525,8.148316e-7,0.0009231027,0.000015110955,0.00013145019,0.9900272,0.0006905329,0.0054228017],"study_design_scores_gemma":[0.001602428,0.00010391335,0.031002112,0.000010749183,0.000009974371,0.000006665049,0.00005959169,0.06267682,0.00082435086,0.9034209,0.00011090267,0.00017155844],"about_ca_topic_score_codex":0.0003393747,"about_ca_topic_score_gemma":0.0000037582922,"teacher_disagreement_score":0.086606264,"about_ca_system_score_codex":0.00004413683,"about_ca_system_score_gemma":0.00006528059,"threshold_uncertainty_score":0.5843375},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93336385,0.000057557263,0.000084811654,0.0000452126,0.0010560967,0.00014452623,0.0000014399911,0.00013311308,0.06511337],"genre_scores_gemma":[0.99985176,0.0000032696776,0.000019666883,0.000029442992,0.0000073347987,0.0000174902,0.0000010648872,0.000022143593,0.000047848705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993761,0.00007549834,0.00016803348,0.00009024576,0.00012955593,0.00016054552],"domain_scores_gemma":[0.99939716,0.00020867337,0.000036875153,0.0003036596,0.000022265569,0.00003138504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004207342,0.00010450911,0.00013938195,0.00003913595,0.000054232176,0.000015147544,0.00019471975,0.000051778075,0.000035038236],"category_scores_gemma":[0.000025115314,0.00007530299,0.000056092238,0.00014488357,0.00003342109,0.00003917249,0.000016782868,0.00012635902,0.00006742087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036477272,0.000016555969,0.00028394637,0.00004630691,0.000023116263,4.3883873e-7,0.00020145706,0.00033010455,0.0012722235,0.99557465,0.0015248735,0.000722695],"study_design_scores_gemma":[0.00023121071,0.00006337867,0.00035359204,0.00007471356,0.000007003483,0.0000015087334,0.000056920544,0.0009042759,0.007258533,0.9875217,0.0034230417,0.000104124476],"about_ca_topic_score_codex":0.0000050792187,"about_ca_topic_score_gemma":9.4945494e-7,"teacher_disagreement_score":0.06648786,"about_ca_system_score_codex":0.000011967192,"about_ca_system_score_gemma":0.0000031699021,"threshold_uncertainty_score":0.3070767},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83348864,0.0005424531,0.027018605,0.022264762,0.008936601,0.0014290194,0.000011354334,0.0011693523,0.10513923],"genre_scores_gemma":[0.99793005,0.0000046854475,0.0009935662,0.0007151805,0.000007998524,0.000030229847,0.000001042729,0.000012723154,0.00030453314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998268,0.00027246002,0.00014339086,0.00032923598,0.00060332974,0.00038356252],"domain_scores_gemma":[0.99795,0.00046690027,0.000053588272,0.0011694188,0.00016367962,0.00019636753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009305254,0.00013644062,0.00013229677,0.000108721826,0.00019902713,0.00012743259,0.0019208232,0.000039697563,0.000011477359],"category_scores_gemma":[0.00023931472,0.0000935525,0.00006576188,0.0008028489,0.0001582318,0.00026094372,0.00040723162,0.0002926637,0.0005777047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010784112,0.0000484223,0.00023812972,0.0000011484957,0.00000948847,0.000012518985,0.00022963774,0.000019884306,0.00009778554,0.98971546,0.008739739,0.0008770338],"study_design_scores_gemma":[0.00042845923,0.00020287573,0.00040743814,0.000007705451,0.0000011867086,0.0000057408615,0.000045610483,0.0011700169,0.00066072604,0.9859134,0.011033381,0.00012347159],"about_ca_topic_score_codex":0.00000900538,"about_ca_topic_score_gemma":0.0000013581017,"teacher_disagreement_score":0.16444142,"about_ca_system_score_codex":0.000050040402,"about_ca_system_score_gemma":0.000063801446,"threshold_uncertainty_score":0.74254173},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.996794,0.00024741286,0.000028370425,0.00070829294,0.0015833965,0.00045913304,0.000044640256,0.000020954774,0.00011383043],"genre_scores_gemma":[0.9975949,0.000021707727,0.00045795273,0.0002558042,0.00006708744,0.000019603736,0.00005931854,0.0000048795496,0.0015187257],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992381,0.000041129002,0.00015674217,0.0001903887,0.0001402022,0.00023343555],"domain_scores_gemma":[0.99947375,0.00015473411,0.000053203137,0.0001704885,0.00006271466,0.000085130174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002023685,0.00011406552,0.00012363284,0.000022988852,0.0004798217,0.00019953339,0.00012353201,0.00003758268,0.00047172536],"category_scores_gemma":[0.00004243178,0.00006283112,0.000047892696,0.00009958451,0.00004954401,0.00016002053,0.000014034904,0.00007007267,0.00010365028],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022465322,0.00017950615,0.77925956,0.00007176028,0.00036256708,0.0000048827173,0.0009211552,0.0020614953,0.0077439295,0.011266513,0.04469904,0.15320492],"study_design_scores_gemma":[0.003475107,0.00061435637,0.75111145,0.000022163638,0.00012601922,0.000012520105,0.00030207145,0.12808646,0.0006703179,0.08998871,0.024969714,0.000621098],"about_ca_topic_score_codex":0.0037679703,"about_ca_topic_score_gemma":0.00051819975,"teacher_disagreement_score":0.15258382,"about_ca_system_score_codex":0.0000026535802,"about_ca_system_score_gemma":0.00003040844,"threshold_uncertainty_score":0.5696069},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.777123,0.00008212036,0.12302926,0.00024853376,0.00456151,0.0007145548,0.00004018513,0.0005623189,0.09363854],"genre_scores_gemma":[0.5761414,0.000010598876,0.41597033,0.000098758836,0.0000046583277,0.000035844914,0.0000020473678,0.000039767037,0.007696583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893177,0.00008284564,0.00028319287,0.00023028253,0.00018360365,0.00028830755],"domain_scores_gemma":[0.9991574,0.00021787419,0.00006590485,0.0003138916,0.000097455784,0.00014742829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026226445,0.00015397671,0.00025632026,0.000053667332,0.0001022893,0.000021345768,0.00018391512,0.00007806088,0.00032605443],"category_scores_gemma":[0.00073515443,0.00014441805,0.00005591921,0.0001483456,0.000066889916,0.00023325288,0.000104767794,0.00014173274,0.00011850795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030981468,0.00006746667,0.000085832246,0.00002259235,0.00002332722,0.000024299774,0.0019468329,7.663498e-7,0.000067567125,0.9940092,0.0029823564,0.00073876133],"study_design_scores_gemma":[0.00030772228,0.00015610018,0.00035463227,0.000025155092,0.000021830721,0.000011463032,0.00020711325,0.00003158097,0.0012345352,0.9968262,0.0006260571,0.00019765066],"about_ca_topic_score_codex":0.000011538444,"about_ca_topic_score_gemma":0.0000028770235,"teacher_disagreement_score":0.29294106,"about_ca_system_score_codex":0.000035050194,"about_ca_system_score_gemma":0.000019080378,"threshold_uncertainty_score":0.5889197},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9382176,0.000039718092,0.056275595,0.0005876494,0.0036363343,0.00013408049,0.0000023209775,0.00008243999,0.001024285],"genre_scores_gemma":[0.9750289,0.0000013726419,0.024750605,0.000058911104,0.000021341217,0.000004817859,0.00002226815,0.0000043399164,0.00010746313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992194,0.00003953612,0.00020581033,0.0001827006,0.00024397866,0.00010852853],"domain_scores_gemma":[0.9992639,0.00009850685,0.00010535887,0.00030520518,0.00017273457,0.000054317054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025083558,0.000076154196,0.00009670819,0.00007953892,0.00011808387,0.00008336564,0.00030609543,0.000063268555,0.000022610233],"category_scores_gemma":[0.00008461325,0.000079414946,0.00003938283,0.00043538338,0.000031296087,0.00039736117,0.000042652806,0.00011927868,0.000029429246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034211043,0.000050743292,0.0006951697,0.000003322021,0.0000072903254,0.0000010474071,0.00018518745,0.00044084404,0.01453657,0.97723037,0.000722381,0.0061236764],"study_design_scores_gemma":[0.0010750911,0.00014796769,0.0362127,0.000008551865,0.000010310308,0.0000158743,0.000007879433,0.14615026,0.036321834,0.77157605,0.008220957,0.00025254756],"about_ca_topic_score_codex":0.00001688655,"about_ca_topic_score_gemma":0.000008384244,"teacher_disagreement_score":0.20565432,"about_ca_system_score_codex":0.000010703564,"about_ca_system_score_gemma":0.000115632174,"threshold_uncertainty_score":0.32384476},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857256,0.00011194135,0.0000772236,0.000048355338,0.0019143695,0.00071056845,0.000006956126,0.00023685978,0.011168131],"genre_scores_gemma":[0.9777322,0.000053772004,0.021758186,0.00005018003,0.000008122391,0.000086500964,0.0000045978663,0.00010676476,0.00019967786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723446,0.00018497824,0.00077640434,0.0005834105,0.00051988027,0.0007008486],"domain_scores_gemma":[0.9981667,0.0003459574,0.00031476363,0.0007955656,0.000108145454,0.00026889364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005514554,0.000473332,0.0007190396,0.00021828916,0.00013009929,0.0000508446,0.00048665807,0.00026084407,0.00021106299],"category_scores_gemma":[0.00044015198,0.0004872035,0.00013956915,0.00046240498,0.00017431966,0.00035755758,0.0003038933,0.0004814162,0.0000627988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000855256,0.00057629193,0.013221151,0.00013649461,0.000061820225,0.00012229537,0.0048256954,1.9572695e-7,0.0001420567,0.9798464,0.00063568377,0.0003463844],"study_design_scores_gemma":[0.0033494702,0.00014286429,0.0022615416,0.00010748905,0.00005689726,0.000060081118,0.0010294197,0.000051114068,0.0011964991,0.99097776,0.00022615983,0.0005407291],"about_ca_topic_score_codex":0.00024494022,"about_ca_topic_score_gemma":0.0001013962,"teacher_disagreement_score":0.021680962,"about_ca_system_score_codex":0.00017985732,"about_ca_system_score_gemma":0.000058864774,"threshold_uncertainty_score":0.99975795},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96773773,0.0003946536,0.000079966005,0.000006633927,0.0026902836,0.000089160174,0.0000017575078,0.0001830288,0.028816802],"genre_scores_gemma":[0.999804,0.000016921485,0.000041402916,0.000011552091,0.0000062316303,0.000010447711,0.0000026222096,0.00002616682,0.000080647165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992891,0.000055649798,0.00021558827,0.00011070892,0.0001389972,0.00018997473],"domain_scores_gemma":[0.99943995,0.00010281886,0.000036463174,0.00030334154,0.000056264344,0.00006113539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027413637,0.000120856246,0.00021305314,0.0002067956,0.000032964017,0.000010773679,0.00018478073,0.000078081204,0.000034372457],"category_scores_gemma":[0.000055899163,0.000119261036,0.0000708836,0.0009049973,0.000033054694,0.00006660689,0.000017177317,0.00010453687,0.00007127745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025917725,0.000025745818,0.0021650805,0.00008211636,0.00003773501,6.9700013e-7,0.00007671475,0.00017613258,0.001509805,0.994089,0.000824078,0.001010304],"study_design_scores_gemma":[0.0007699388,0.00009735476,0.0038379384,0.000047350084,0.000026250254,0.000004706889,0.000045900375,0.0030222728,0.009869262,0.97594976,0.006070682,0.00025859216],"about_ca_topic_score_codex":0.000010616892,"about_ca_topic_score_gemma":0.00000105805,"teacher_disagreement_score":0.032066293,"about_ca_system_score_codex":0.000011488382,"about_ca_system_score_gemma":0.000004722593,"threshold_uncertainty_score":0.4863324},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99311787,0.0002452301,0.00005103502,0.000014030562,0.0013668506,0.00014956931,9.713599e-7,0.00015021105,0.0049042036],"genre_scores_gemma":[0.99980867,0.000010671131,0.000085751366,0.000008913568,0.000003715825,0.000038634436,0.000004485166,0.00001744897,0.000021710346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999468,0.00003145572,0.00018977643,0.000084694715,0.00009276996,0.00013326293],"domain_scores_gemma":[0.99964005,0.000032936336,0.000028770182,0.00019899495,0.000044541513,0.00005472461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009078114,0.000096162126,0.00014592493,0.00008344518,0.00003351047,0.000015941265,0.00012409326,0.000063000174,0.00008507213],"category_scores_gemma":[0.0000054226944,0.000097125885,0.00006408914,0.00019099015,0.000024322735,0.00014337276,0.000014057068,0.000073903655,0.00014464026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004534251,0.000052154795,0.0021451712,0.00014240858,0.00006789807,0.0000016903743,0.0006303152,0.00023314997,0.05496,0.9373943,0.0026874829,0.0016808797],"study_design_scores_gemma":[0.00037239108,0.000055180626,0.0046126535,0.000048435963,0.000010569712,0.0000038217386,0.00009123487,0.0014608294,0.02665442,0.96614015,0.00040025183,0.00015007281],"about_ca_topic_score_codex":0.000061961895,"about_ca_topic_score_gemma":0.0000026420596,"teacher_disagreement_score":0.028745826,"about_ca_system_score_codex":0.000016691676,"about_ca_system_score_gemma":0.0000033774334,"threshold_uncertainty_score":0.39606786},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92487127,0.00004838,0.000008663312,0.000051387884,0.0015547841,0.00010046213,0.0000059486715,0.00011489295,0.07324421],"genre_scores_gemma":[0.99985486,0.0000061186447,0.000007668084,0.00003839284,0.0000068740655,0.000010173088,0.0000020862149,0.000015797692,0.000058011337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992688,0.00011071693,0.00021609364,0.000107346015,0.00014123894,0.00015580663],"domain_scores_gemma":[0.9991304,0.00029993991,0.000043376695,0.00046136562,0.000027922128,0.00003699203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006324886,0.000107729764,0.00015080726,0.00004608801,0.000057228273,0.000011552403,0.00023617601,0.00004553055,0.0000097991],"category_scores_gemma":[0.00008263466,0.000077481156,0.000075028605,0.0001945841,0.00005306806,0.000032331478,0.000016664857,0.00014273362,0.000047612215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017535553,0.000020792979,0.00019945331,0.000014979984,0.000025414598,4.1793425e-7,0.0001646415,0.00047474593,0.0011418915,0.9954711,0.0022474355,0.00022159301],"study_design_scores_gemma":[0.0011902773,0.00013836952,0.0031672118,0.00008045064,0.000013683027,0.0000017813996,0.000078246514,0.003174387,0.029961085,0.9554683,0.006536669,0.00018951624],"about_ca_topic_score_codex":0.000018123448,"about_ca_topic_score_gemma":0.0000037871062,"teacher_disagreement_score":0.074983604,"about_ca_system_score_codex":0.000011005924,"about_ca_system_score_gemma":0.0000035257178,"threshold_uncertainty_score":0.315959},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9369946,0.00010024169,0.05951004,0.000058043137,0.0006566002,0.00015667928,0.0000039065512,0.00008044811,0.0024394451],"genre_scores_gemma":[0.9892405,0.0000033270846,0.010648307,0.00006308574,0.0000031741145,0.000008460938,0.000006853418,0.000004804638,0.000021481272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906063,0.00006113232,0.00018185657,0.00026357078,0.00026240398,0.00017039086],"domain_scores_gemma":[0.99920595,0.000043678683,0.00009180161,0.0004310808,0.00015587742,0.00007160038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030613277,0.000097859585,0.00013740221,0.0000967139,0.000076683005,0.000018024351,0.00039381467,0.000041285333,0.00002331435],"category_scores_gemma":[0.000024349389,0.00008700554,0.00004855557,0.0005689313,0.00003789365,0.0002874379,0.000056990422,0.00007631248,0.000013640895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010977042,0.00023267066,0.015993595,0.000014893526,0.000022600332,0.000005739809,0.00052581466,0.000013467283,0.00021056416,0.9821704,0.00015149689,0.00064778596],"study_design_scores_gemma":[0.00085578504,0.0002876171,0.12361214,0.000013072909,0.0000100244015,0.000011364648,0.000023506556,0.0015367139,0.008454913,0.86440015,0.00061748637,0.00017723415],"about_ca_topic_score_codex":0.00002650856,"about_ca_topic_score_gemma":0.0000045542947,"teacher_disagreement_score":0.117770255,"about_ca_system_score_codex":0.00001619788,"about_ca_system_score_gemma":0.000070136375,"threshold_uncertainty_score":0.35479826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98946047,0.00057613035,0.000048976977,0.000022177423,0.0012951876,0.00016218646,6.73869e-7,0.00025667853,0.008177537],"genre_scores_gemma":[0.99970436,0.00002559725,0.000046622998,0.000024889316,0.000008163571,0.00004492065,0.0000014810057,0.00002301024,0.00012093455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994797,0.000029973959,0.00012439686,0.00010759858,0.00007235496,0.00018595197],"domain_scores_gemma":[0.999662,0.000044293625,0.000012816192,0.00017253084,0.000020462458,0.00008791992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010470017,0.00011154773,0.00012365036,0.00004321075,0.000051298903,0.000050758692,0.000094138784,0.00006493311,0.000090145986],"category_scores_gemma":[0.000008414412,0.00010778996,0.000026405507,0.00010424409,0.000030694257,0.00016930516,0.000017766273,0.00009275499,0.0002808055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018832665,0.000018428036,0.0033827329,0.000062929554,0.000040894683,0.0000044339954,0.00037023524,0.000029206878,0.007613548,0.9792081,0.007072394,0.0021952153],"study_design_scores_gemma":[0.000521225,0.000050210645,0.012220532,0.000028426663,0.000010905814,0.000017701665,0.0001642648,0.0017423098,0.003139154,0.9800862,0.0017431554,0.0002759321],"about_ca_topic_score_codex":0.000017577071,"about_ca_topic_score_gemma":6.8873703e-7,"teacher_disagreement_score":0.010243928,"about_ca_system_score_codex":0.000012786778,"about_ca_system_score_gemma":0.000002787748,"threshold_uncertainty_score":0.4395547},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98268056,0.00036862353,0.010155222,0.0015717783,0.0012176837,0.00017135359,0.000006770955,0.00011885494,0.0037091572],"genre_scores_gemma":[0.9973289,0.000019829278,0.0021298972,0.00014566656,0.00000646557,0.000013842148,0.000020948597,0.0000032162832,0.0003312602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990079,0.00005225293,0.00024831135,0.00024444427,0.00025543803,0.00019168307],"domain_scores_gemma":[0.9990726,0.00009147236,0.00010867763,0.00051320886,0.00013418528,0.00007982634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017052752,0.000095292104,0.00018294636,0.00018267536,0.00008904104,0.0001370948,0.000725441,0.00006045118,0.0001557775],"category_scores_gemma":[0.0001109026,0.00007604747,0.000069729744,0.00124596,0.00007151979,0.00066300144,0.0002594,0.00009203194,0.00036484428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.7765994e-7,0.00011520343,0.008840778,0.0000058442565,0.00002420112,0.0000027634615,0.00005844202,0.000013811861,0.00026391953,0.9644325,0.010016832,0.016224843],"study_design_scores_gemma":[0.00030126216,0.0001431074,0.049784143,0.0000055289033,0.000010729266,0.0000027927,0.000013569873,0.0029635725,0.0011283353,0.9368947,0.008601009,0.00015125528],"about_ca_topic_score_codex":0.00039069244,"about_ca_topic_score_gemma":0.0000072890307,"teacher_disagreement_score":0.040943366,"about_ca_system_score_codex":0.000019336581,"about_ca_system_score_gemma":0.00003183133,"threshold_uncertainty_score":0.46894568},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9813917,0.0018751269,0.0014971015,0.00018873755,0.001356549,0.00032430372,6.4594144e-7,0.00015554311,0.013210241],"genre_scores_gemma":[0.99860525,0.0000470585,0.0010082269,0.000018066085,0.0000014873341,0.00002324851,7.464342e-8,0.000007378874,0.00028918037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897265,0.00010586967,0.00017385189,0.00018923229,0.00027967052,0.00027870334],"domain_scores_gemma":[0.99883056,0.00008646597,0.00007043658,0.000803613,0.00014796064,0.000060968287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043986394,0.00008677463,0.00010568918,0.00006310346,0.00019788559,0.000036197176,0.0015421185,0.000030093719,0.0000041760723],"category_scores_gemma":[0.00009479009,0.000054410895,0.00006235072,0.0004660342,0.00029742683,0.00030236016,0.00033559612,0.00012266607,0.000026248827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015865915,0.000055460016,0.000855929,0.000007671665,0.0000140841,0.0000021954718,0.001099397,2.4479016e-7,0.0013787585,0.993811,0.0000755195,0.0026838442],"study_design_scores_gemma":[0.00018399702,0.000103863895,0.0012634037,0.00001839446,0.0000015667567,0.00000242458,0.00008328072,0.00015231133,0.07832761,0.9192261,0.0005585461,0.00007847566],"about_ca_topic_score_codex":0.000022112687,"about_ca_topic_score_gemma":0.0000035049698,"teacher_disagreement_score":0.07694885,"about_ca_system_score_codex":0.00001087808,"about_ca_system_score_gemma":0.00004081715,"threshold_uncertainty_score":0.28656656},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9620793,0.00009284813,0.00017309618,0.00014149596,0.00016375695,0.00018592496,0.0000068077966,0.000041140323,0.037115652],"genre_scores_gemma":[0.9925267,0.000008626497,0.0070337458,0.000023965413,0.000005241862,0.000020420755,0.0000018306571,0.000015585345,0.0003638974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993428,0.000019233275,0.00022157482,0.00011650148,0.00017575499,0.00012413047],"domain_scores_gemma":[0.9992104,0.00016389381,0.000118520315,0.0003165752,0.00009468243,0.00009593719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033029777,0.000085494656,0.00019231059,0.000032019445,0.000035031047,0.000018651897,0.00012150963,0.000038842678,0.000020660264],"category_scores_gemma":[0.0001674128,0.00007778814,0.000028859502,0.00010534936,0.000042718064,0.000052447886,0.00008283194,0.00006380152,0.000013400383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023431485,0.00014654017,0.0004293318,0.0000499648,0.000011828556,7.107975e-7,0.000394711,6.0253296e-7,0.00032923048,0.98800075,0.010457643,0.00017634708],"study_design_scores_gemma":[0.0007532769,0.000039396935,0.000052364117,0.000025222836,0.000020205916,0.0000035556939,0.00013406265,0.0003548799,0.0019638361,0.9947563,0.0018105549,0.0000863405],"about_ca_topic_score_codex":0.000020479192,"about_ca_topic_score_gemma":0.0000024328522,"teacher_disagreement_score":0.036751755,"about_ca_system_score_codex":0.000016626587,"about_ca_system_score_gemma":0.000036490543,"threshold_uncertainty_score":0.31721085},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9809045,0.000030898304,0.0000934451,0.00015717941,0.0008124407,0.00029517026,0.000008388566,0.000069638685,0.017628314],"genre_scores_gemma":[0.9991683,0.000003536199,0.00023693313,0.00011086811,0.0000111736235,0.000022441382,0.0000037769262,0.000030044532,0.00041296918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879515,0.0002537193,0.00029103612,0.00020149496,0.00025912185,0.00019947844],"domain_scores_gemma":[0.9987558,0.00031804433,0.00013075798,0.00058298267,0.00014086596,0.00007154709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005827491,0.00017334297,0.00026974827,0.00007147376,0.0001830584,0.000016910111,0.00026501354,0.00009521994,0.00052337826],"category_scores_gemma":[0.00017232998,0.00012059451,0.00010979611,0.00029209055,0.00013744668,0.00007464063,0.00005051845,0.00021805153,0.00018507037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006396723,0.0003106085,0.00067698344,0.00001899374,0.0000807894,0.0000049826003,0.0009421349,0.000001274123,0.0012036922,0.991729,0.004943968,0.00002358086],"study_design_scores_gemma":[0.0011446496,0.0005870191,0.0027931358,0.00012421768,0.00017779885,0.0000089784135,0.0010859126,0.00023798435,0.052886683,0.94037306,0.00026324874,0.00031733615],"about_ca_topic_score_codex":0.0000296276,"about_ca_topic_score_gemma":0.0000025393456,"teacher_disagreement_score":0.05168299,"about_ca_system_score_codex":0.00005637301,"about_ca_system_score_gemma":0.00004645266,"threshold_uncertainty_score":0.5730625},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9969445,0.00013120436,0.000006809347,0.0005107766,0.0002809869,0.00038420237,0.000018167497,0.000028143479,0.0016951987],"genre_scores_gemma":[0.9992953,0.0000090015765,0.00052533275,0.00006037062,0.00000337573,0.000036663674,0.0000017748008,0.000014420145,0.00005374661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908346,0.00013380148,0.00030175765,0.00013112495,0.00020555848,0.00014432169],"domain_scores_gemma":[0.997768,0.0012588858,0.0002660029,0.00053299655,0.00011195133,0.00006217309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060227246,0.00012017762,0.00026595962,0.000026673586,0.00011995366,0.000012998002,0.00035436958,0.00004829545,0.000006303497],"category_scores_gemma":[0.00052963255,0.000071934366,0.00010616318,0.00025929342,0.0007718157,0.00008181589,0.000116111776,0.00012160749,0.0000043593695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026683514,0.00009165774,0.008201376,0.000040554958,0.000056059213,1.01768656e-7,0.001210177,0.0000043388227,0.00038549243,0.9885828,0.0013716639,0.00002911155],"study_design_scores_gemma":[0.0017743219,0.000017439259,0.0022907453,0.000037471247,0.00008547588,0.0000028925833,0.0002610118,0.00019298964,0.0023556792,0.992394,0.00050859083,0.00007942604],"about_ca_topic_score_codex":0.00017663793,"about_ca_topic_score_gemma":0.00002014213,"teacher_disagreement_score":0.0059106303,"about_ca_system_score_codex":0.000008698659,"about_ca_system_score_gemma":0.000022789398,"threshold_uncertainty_score":0.29333982},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9848927,0.00022721456,0.00005109632,0.0001106779,0.0005579991,0.00021907485,0.000023015857,0.000035970348,0.013882244],"genre_scores_gemma":[0.9990094,0.0000019751153,0.00008204844,0.00003932446,0.000022679746,0.00006090866,0.000008269043,0.000019164852,0.0007562435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99920225,0.000020583093,0.0001826931,0.00013780696,0.0001664482,0.00029021275],"domain_scores_gemma":[0.9992538,0.000049061284,0.00013461844,0.00043841434,0.00006331015,0.000060761075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013805683,0.00012388967,0.00016572721,0.000013649422,0.000098843906,0.000008985754,0.00025638854,0.00010437843,0.00011280592],"category_scores_gemma":[0.00009837873,0.00009182568,0.00017041102,0.00010658496,0.00005572236,0.00008139078,0.000070630515,0.00013452159,0.000005087801],"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.00009825911,0.00067620556,0.044716313,0.00019705168,0.00015918245,4.784678e-7,0.00096748816,0.000002069427,0.29444513,0.6557066,0.0019231883,0.0011080666],"study_design_scores_gemma":[0.00096524163,0.000035789,0.009147123,0.000028493863,0.000047219946,0.000001604965,0.000040646897,0.00003656907,0.8913025,0.094543554,0.0037230784,0.00012815713],"about_ca_topic_score_codex":0.000024436671,"about_ca_topic_score_gemma":0.0000074730133,"teacher_disagreement_score":0.59685737,"about_ca_system_score_codex":0.00006454392,"about_ca_system_score_gemma":0.000041548003,"threshold_uncertainty_score":0.37445426},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009204624,0.0024163572,0.0019782057,0.0039801677,0.11265167,0.0069393963,0.0013673287,0.0034022129,0.85806006],"genre_scores_gemma":[0.007283957,0.00039491503,0.007789578,0.0006510932,0.00025995908,0.0008939952,0.002154658,0.00093064475,0.9796412],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931485,0.00019624676,0.002441564,0.0010047939,0.0016445889,0.0015643005],"domain_scores_gemma":[0.9949852,0.0008952393,0.00085360237,0.001970604,0.0007340105,0.00056129135],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.00068660337,0.0013766869,0.0021163505,0.0008048619,0.0006168303,0.00036400137,0.0014850205,0.0016734977,0.0004431794],"category_scores_gemma":[0.0011737741,0.0014272003,0.000650686,0.0013385455,0.00024300728,0.0012801874,0.00035615134,0.0026438513,0.0017540174],"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.000010019571,0.00030848294,0.0000016576032,0.00065682334,0.00013487022,0.000026850483,0.0005710321,0.0000124899325,0.000012459048,0.49178505,0.5064473,0.000032953674],"study_design_scores_gemma":[0.0013264074,0.00017045865,0.000017237246,0.0010618061,0.00039743222,0.00003324567,0.00022005152,0.00021656681,0.00010032521,0.8336487,0.1615308,0.0012769998],"about_ca_topic_score_codex":0.00008032087,"about_ca_topic_score_gemma":0.00013634961,"teacher_disagreement_score":0.34491652,"about_ca_system_score_codex":0.0007547942,"about_ca_system_score_gemma":0.0004805856,"threshold_uncertainty_score":0.9998984},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9788225,0.00027736768,0.016728982,0.00062286586,0.00070452376,0.00025611717,0.0000016487012,0.00012170652,0.0024642488],"genre_scores_gemma":[0.9925812,0.000007448452,0.0071042664,0.00005064912,0.0000043733103,0.000007600604,0.0000017594268,0.0000068211793,0.00023586366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985833,0.00010670849,0.00022741806,0.00031569597,0.0004582625,0.00030860296],"domain_scores_gemma":[0.9988234,0.00010868253,0.00009382135,0.0006850065,0.0001912133,0.00009789039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004091216,0.00012727806,0.00018939238,0.00025439242,0.00008295114,0.000042067706,0.00077408116,0.000066050125,0.000010864683],"category_scores_gemma":[0.000091263064,0.00012492563,0.000107315405,0.00087507133,0.00009058558,0.0005306005,0.0001227212,0.00013772809,0.000022497263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016085509,0.00013313955,0.00019309616,0.0000049473465,0.000009163416,0.000011490736,0.00023279327,0.000016038686,0.007575034,0.9711792,0.0002444543,0.020384567],"study_design_scores_gemma":[0.0007049414,0.0003001046,0.009928501,0.00001612605,0.0000032425291,0.000015490052,0.000016482862,0.0010252806,0.02752412,0.960191,0.0001380852,0.00013662274],"about_ca_topic_score_codex":0.000003803199,"about_ca_topic_score_gemma":2.796805e-7,"teacher_disagreement_score":0.020247944,"about_ca_system_score_codex":0.00003579284,"about_ca_system_score_gemma":0.000035199457,"threshold_uncertainty_score":0.5094319},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6375908,0.00027121344,0.31561846,0.01583325,0.012308355,0.0034293758,0.00032199084,0.0012009667,0.013425578],"genre_scores_gemma":[0.98399043,0.0000035523462,0.014304772,0.00093483686,0.000010562899,0.00032055125,0.00003211929,0.000023717706,0.00037943825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980959,0.00009659186,0.00022848333,0.00049831497,0.0005870552,0.00049362786],"domain_scores_gemma":[0.9976941,0.00045340104,0.00007362674,0.000748167,0.0005520169,0.00047872728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005750999,0.00017717916,0.00020152384,0.00036646295,0.00027960914,0.00013092085,0.0010875434,0.000081596416,0.000016592481],"category_scores_gemma":[0.00043036553,0.00018607007,0.00014042981,0.0011269457,0.000101199075,0.0007605877,0.0002716739,0.00019308225,0.000104207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037994418,0.00011262779,0.00048208438,0.000004210056,0.000030193707,0.000005908082,0.0001889465,0.000071904375,0.00038124123,0.97057605,0.02756719,0.0005416678],"study_design_scores_gemma":[0.0012185595,0.00032875058,0.0013068005,0.0000073946594,0.0000055147552,0.000011397924,0.000058945818,0.00073407026,0.0011714597,0.98151106,0.01341921,0.00022682574],"about_ca_topic_score_codex":0.000014752935,"about_ca_topic_score_gemma":0.000009326222,"teacher_disagreement_score":0.34639964,"about_ca_system_score_codex":0.000097863325,"about_ca_system_score_gemma":0.00018963887,"threshold_uncertainty_score":0.7587717},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98419535,0.0013491445,0.00054458814,0.0024115483,0.007203882,0.00020600278,8.5941053e-7,0.0003798894,0.0037087577],"genre_scores_gemma":[0.9971232,0.00001970327,0.0012549238,0.0014289977,0.0000041380113,0.000020236504,0.000001190277,0.00001285263,0.00013478186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985084,0.0001141112,0.00021924132,0.00026591323,0.00037336617,0.0005189577],"domain_scores_gemma":[0.99851143,0.00026513665,0.00008728045,0.0008841284,0.00008055268,0.00017144356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083989283,0.00016310859,0.00013506587,0.000090632035,0.00037461214,0.00012392539,0.0007897195,0.0000638468,0.000013011105],"category_scores_gemma":[0.00009295006,0.00011029166,0.000084443906,0.00061819516,0.000053755404,0.00036575974,0.00020244071,0.00023587358,0.00044198273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025534275,0.00011944213,0.00092273345,0.0000025438558,0.000014099546,0.0000014946872,0.0004225769,0.00004843147,0.00046936594,0.990883,0.0060904985,0.0010232616],"study_design_scores_gemma":[0.0004032969,0.000086129185,0.0006566014,0.000024601757,0.000008832138,0.000008389728,0.000017691136,0.0013130729,0.0026465463,0.99205124,0.0025977606,0.00018581281],"about_ca_topic_score_codex":0.000020805182,"about_ca_topic_score_gemma":8.074989e-7,"teacher_disagreement_score":0.012927849,"about_ca_system_score_codex":0.000017467622,"about_ca_system_score_gemma":0.000022090368,"threshold_uncertainty_score":0.56809413},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952669,0.0008595846,0.00012427152,0.0010289055,0.00028266624,0.0004058805,0.000009969691,0.00026441048,0.0017573765],"genre_scores_gemma":[0.9984488,0.00017203834,0.00061943993,0.00026362308,0.000012097012,0.00005737616,0.000010338344,0.00003100033,0.00038526964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984376,0.00009952715,0.00036563096,0.0004133585,0.00023767535,0.00044620287],"domain_scores_gemma":[0.9986442,0.00021461901,0.00015097776,0.0007113413,0.000078697,0.00020016341],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047675226,0.0002717888,0.00032761303,0.00015672932,0.00032725575,0.0000805571,0.0003276348,0.00014166995,0.000055702847],"category_scores_gemma":[0.00007790459,0.00026768414,0.00016005531,0.0005742074,0.00016004418,0.00018838464,0.00006546814,0.00027015115,0.00005423954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014906717,0.0002446405,0.00030635478,0.000023933524,0.000046404875,0.0000060112247,0.00022500377,4.773654e-7,0.006357346,0.98699063,0.0049662394,0.0008180472],"study_design_scores_gemma":[0.00083431404,0.00013129272,0.0021017883,0.000043819637,0.00009642313,0.000016055235,0.000060081726,0.000029814613,0.010333447,0.9839391,0.0021140566,0.00029980682],"about_ca_topic_score_codex":0.000004604957,"about_ca_topic_score_gemma":0.000002029064,"teacher_disagreement_score":0.0039761006,"about_ca_system_score_codex":0.000023678744,"about_ca_system_score_gemma":0.000025664363,"threshold_uncertainty_score":0.9999775},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99531066,0.0013447611,0.00032769714,0.000041300867,0.0011408431,0.00013064085,0.0000019888967,0.00015188163,0.0015502211],"genre_scores_gemma":[0.9955102,0.00008915496,0.0042834715,0.00007733958,3.159219e-7,0.000006717703,8.0471074e-7,0.000009637915,0.000022361486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879456,0.00008683403,0.00027052473,0.00039006514,0.00021381807,0.00024421053],"domain_scores_gemma":[0.9988539,0.000110302644,0.00014110307,0.0005775799,0.00017884801,0.00013825175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004935155,0.00015816114,0.00026394182,0.00034877754,0.00010483519,0.000030076282,0.00044393865,0.000083399354,0.000008356175],"category_scores_gemma":[0.00009190786,0.00014077226,0.00007806247,0.0013293546,0.00014101909,0.00026403993,0.0002481035,0.00013737348,0.000008666118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068182276,0.0002408225,0.014401766,0.00001667018,0.000021234418,0.00000580073,0.0004692097,3.685299e-7,0.0011965283,0.98091006,0.00024565213,0.0024850578],"study_design_scores_gemma":[0.00072681735,0.00039826508,0.016990244,0.000022494249,0.000011591869,0.000008436613,0.000013466171,0.00061964575,0.01305757,0.96794426,0.000032981163,0.00017423143],"about_ca_topic_score_codex":0.00020881763,"about_ca_topic_score_gemma":0.0000020693878,"teacher_disagreement_score":0.012965816,"about_ca_system_score_codex":0.0000062456807,"about_ca_system_score_gemma":0.000034168508,"threshold_uncertainty_score":0.5740526},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99326885,0.000071774,0.00037082977,0.0004883739,0.00055863685,0.0008221916,0.0000025441477,0.0002557767,0.0041610105],"genre_scores_gemma":[0.9592773,0.00001529622,0.02864931,0.00007194068,0.000007676329,0.0002133812,0.000002716212,0.000060990387,0.011701439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985726,0.000049289214,0.00042071534,0.0002972862,0.00029205842,0.0003680801],"domain_scores_gemma":[0.99855787,0.0005120408,0.00012888385,0.00037505626,0.00027342833,0.00015273165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019264162,0.00023843303,0.0003775909,0.0001239683,0.00016846198,0.00017958679,0.00021103187,0.00007492399,0.00034442465],"category_scores_gemma":[0.0013289936,0.0002156469,0.00004204366,0.00029614102,0.0001349725,0.0007238505,0.00026168194,0.00016547792,0.00029865422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027902163,0.000077361925,0.00022758894,0.000120479745,0.00004745499,0.0000037950208,0.0015846766,0.0000019882127,0.00095249736,0.9928461,0.003984945,0.00015032598],"study_design_scores_gemma":[0.0006566698,0.00007279465,0.0004933592,0.00010493229,0.000027290655,0.0000098294395,0.00061310624,0.000055664834,0.003895155,0.99370384,0.0000976531,0.00026969175],"about_ca_topic_score_codex":0.000045145265,"about_ca_topic_score_gemma":0.000006563031,"teacher_disagreement_score":0.033991612,"about_ca_system_score_codex":0.00005713338,"about_ca_system_score_gemma":0.000019653813,"threshold_uncertainty_score":0.87938255},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9624379,0.00038392565,0.00003955211,0.000018389594,0.0058601117,0.00012891872,0.0000024316664,0.00033593184,0.030792795],"genre_scores_gemma":[0.9996604,0.000007212453,0.00001407739,0.000029178902,0.0000684118,0.000027071486,0.000004277975,0.000037147944,0.0001522224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904555,0.000105633764,0.00019052906,0.00011319969,0.0001546903,0.00039041525],"domain_scores_gemma":[0.99942076,0.00012764479,0.000027760454,0.0002732402,0.000013540482,0.00013703994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047550813,0.00015567323,0.00016998862,0.00008867121,0.000114939015,0.00002843642,0.0001257488,0.0001010482,0.00008221542],"category_scores_gemma":[0.000047038302,0.00015484387,0.000071900686,0.00022131915,0.00001858396,0.00014604125,0.000018971365,0.00025848037,0.0003507029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015039709,0.00005815676,0.0056237,0.000051665862,0.000039763767,0.0000042058828,0.0009560761,0.00023307893,0.00182765,0.9860187,0.004571579,0.0006003567],"study_design_scores_gemma":[0.0066960426,0.0006940788,0.03768767,0.0011347365,0.00020232881,0.00006294426,0.0022483962,0.011744129,0.15161653,0.58157694,0.2026604,0.0036758233],"about_ca_topic_score_codex":0.000004792274,"about_ca_topic_score_gemma":6.4495083e-7,"teacher_disagreement_score":0.4044418,"about_ca_system_score_codex":0.000046390433,"about_ca_system_score_gemma":0.00000438869,"threshold_uncertainty_score":0.631435},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9674044,0.00010845469,0.02533915,0.0001907759,0.0056708097,0.0000636548,0.000002073011,0.00022350565,0.0009971679],"genre_scores_gemma":[0.9824819,0.000018523026,0.01696823,0.00026193773,0.00003542228,0.000009887907,0.0000019857368,0.000007817258,0.00021431783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897313,0.000024779536,0.00016124513,0.00036450932,0.00022405316,0.00025227442],"domain_scores_gemma":[0.9989376,0.00014665231,0.000066659326,0.0006700979,0.00006673212,0.000112281035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006931392,0.00014770073,0.00015481599,0.000048895337,0.000113938375,0.00011499668,0.0011223626,0.000079792226,0.00003730795],"category_scores_gemma":[0.00007605555,0.00012562353,0.00005145687,0.00020380432,0.00006797791,0.0003043187,0.00029301434,0.00032748544,0.00014854356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021746228,0.000056088105,0.0070401346,0.000001426364,0.000004342484,0.000017830977,0.0001898007,0.0000022060756,0.02640424,0.9398733,0.000089548135,0.026318932],"study_design_scores_gemma":[0.00033780743,0.000035179775,0.07444985,0.000007868902,0.0000024073363,0.0000043660334,0.000008415698,0.0019443186,0.0060948352,0.9159307,0.0010086788,0.00017559875],"about_ca_topic_score_codex":0.00006192095,"about_ca_topic_score_gemma":0.000018836925,"teacher_disagreement_score":0.06740972,"about_ca_system_score_codex":0.000010122955,"about_ca_system_score_gemma":0.000034335288,"threshold_uncertainty_score":0.5122779},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9889394,0.000016541311,0.000033213277,0.0004239141,0.00015156675,0.00014564025,0.0000022589625,0.00003490804,0.010252533],"genre_scores_gemma":[0.9994757,0.0000054054926,0.00006211412,0.00015286631,0.0000016791159,0.00010749216,0.0000014238724,0.000010571013,0.00018270542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994637,0.00006093147,0.00015135443,0.00009583411,0.00011913506,0.00010906643],"domain_scores_gemma":[0.99873483,0.0006541785,0.00008230982,0.00044059232,0.000056435394,0.000031655214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015414908,0.00007599807,0.0001071669,0.000034618843,0.0000839894,0.000011002136,0.00022532794,0.000037121063,0.0002372194],"category_scores_gemma":[0.00008950404,0.00004879485,0.00007268668,0.00017743626,0.00007402096,0.000029184775,0.000025679692,0.0000671039,0.00005936151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014423514,0.00012965105,0.00006410111,0.0000054956554,0.000019940231,1.7134515e-7,0.00007960976,1.940476e-7,0.0014634484,0.98693645,0.011163104,0.00013636932],"study_design_scores_gemma":[0.00012481373,0.000028023538,0.00036003863,0.000012658052,0.000010395761,9.2199946e-7,0.000053640964,0.00001929406,0.008322924,0.99066585,0.0003439624,0.000057462206],"about_ca_topic_score_codex":0.00003391016,"about_ca_topic_score_gemma":9.456385e-7,"teacher_disagreement_score":0.010819143,"about_ca_system_score_codex":0.0000054560014,"about_ca_system_score_gemma":0.0000075081157,"threshold_uncertainty_score":0.2597386},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99042344,0.00018874354,0.00006240922,0.00025845185,0.00072526373,0.00037739897,0.000029934141,0.00011220565,0.007822161],"genre_scores_gemma":[0.99669915,0.000036381985,0.0023460616,0.00007781222,0.00001915879,0.000058466663,0.000016066293,0.0000540346,0.0006928509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809784,0.00016581827,0.00046947328,0.00029309714,0.00055487844,0.00041889644],"domain_scores_gemma":[0.9925812,0.0059495983,0.00019578054,0.000843411,0.00028953832,0.00014047316],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00045318474,0.00020867398,0.00045260845,0.0002703117,0.00007736632,0.000077263074,0.00059117266,0.00014367924,0.0018482747],"category_scores_gemma":[0.0033739405,0.0001923217,0.00012020711,0.00070799084,0.00022054667,0.00026706737,0.00026596698,0.00034457343,0.0007924255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023118868,0.00031581175,0.007290702,0.000066364606,0.000118459895,0.0000059454733,0.00045745552,0.000001321252,0.004591721,0.9740391,0.012037377,0.001052623],"study_design_scores_gemma":[0.0010224096,0.000117949254,0.0033615222,0.000052069718,0.000023645793,7.596949e-7,0.00025822408,0.00012111149,0.016225966,0.97755754,0.001067257,0.00019151543],"about_ca_topic_score_codex":0.0005423227,"about_ca_topic_score_gemma":0.000010582385,"teacher_disagreement_score":0.0116342455,"about_ca_system_score_codex":0.000052084062,"about_ca_system_score_gemma":0.000059982518,"threshold_uncertainty_score":0.9999856},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8697958,0.000009347032,0.014590943,0.00026533147,0.00014484876,0.00023166364,0.000020987349,0.00002090841,0.11492019],"genre_scores_gemma":[0.99931675,3.982926e-7,0.00018837058,0.00006595849,0.000014294743,0.000033012893,0.0000035248408,0.000009827979,0.00036786182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952084,0.000024661553,0.00013800025,0.00010656388,0.00009073637,0.000119224576],"domain_scores_gemma":[0.99900264,0.00056657946,0.00010331068,0.00024608124,0.000048545633,0.000032823362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014717723,0.00007821767,0.000121263874,0.000015092384,0.000104937666,0.000014851228,0.0001508636,0.000018303754,0.00044648215],"category_scores_gemma":[0.000025491525,0.0000538695,0.0000496563,0.00012676918,0.000058454592,0.00003816381,0.000041860818,0.00011230603,0.00004264661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028145782,0.00008461512,0.00038541717,0.000006504193,0.00001358869,2.0692854e-8,0.00004426929,0.000010188462,0.00013520085,0.9983028,0.0002497087,0.00076484244],"study_design_scores_gemma":[0.00021096239,0.000025413226,0.00029267874,0.000016885428,0.00000614304,4.8522367e-8,0.00011554745,0.00028957808,0.0042707655,0.99154514,0.0031637345,0.00006307996],"about_ca_topic_score_codex":0.0000042462016,"about_ca_topic_score_gemma":1.6510249e-7,"teacher_disagreement_score":0.12952097,"about_ca_system_score_codex":0.000005958851,"about_ca_system_score_gemma":0.000008992176,"threshold_uncertainty_score":0.48886666},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96005696,0.00006768341,0.000083399704,0.0042492994,0.0013131535,0.0004981101,0.000013012362,0.0001366485,0.033581737],"genre_scores_gemma":[0.9982872,0.00004307895,0.00013656759,0.00070047466,0.000024785842,0.00012809107,0.0000051825937,0.00005617307,0.0006184307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806374,0.0004252587,0.0003767744,0.00037616288,0.00033894132,0.00041914833],"domain_scores_gemma":[0.9959244,0.0022721442,0.00022439533,0.0013568545,0.00009497704,0.00012720258],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010508123,0.0003150296,0.00031455985,0.000100271776,0.0005677747,0.00014006428,0.00069484016,0.00017475423,0.00017380164],"category_scores_gemma":[0.000581508,0.0002276511,0.0002422909,0.00051981886,0.00026851645,0.00005859623,0.00011438993,0.00042100257,0.0010228581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016544001,0.00041323042,0.00014631361,0.000052748688,0.00004801404,0.0000010452646,0.00036842184,0.0000042027527,0.0006300906,0.9920959,0.0055096243,0.0007138862],"study_design_scores_gemma":[0.00047082425,0.00018585636,0.00048250717,0.00012936548,0.0001105331,0.0000024307433,0.000057634734,0.00037886415,0.0028373597,0.96986353,0.025210302,0.00027077357],"about_ca_topic_score_codex":0.000007804398,"about_ca_topic_score_gemma":0.0000015878368,"teacher_disagreement_score":0.03823026,"about_ca_system_score_codex":0.000029261244,"about_ca_system_score_gemma":0.000030038691,"threshold_uncertainty_score":0.99975497},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97507685,0.000027403605,0.00011009404,0.000051012637,0.0001930474,0.00035851006,0.000006232917,0.0000805151,0.024096338],"genre_scores_gemma":[0.9992332,0.0000070255896,0.0004327091,0.000054843884,0.0000015627265,0.00007308565,0.0000028198629,0.000026488779,0.00016828501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989601,0.00007768157,0.0002726826,0.00023351153,0.0002372618,0.00021879081],"domain_scores_gemma":[0.99869204,0.0002528376,0.00017312108,0.000708608,0.0000807702,0.00009262887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020304795,0.0001670919,0.00023548289,0.000110733716,0.00009568277,0.000009675301,0.00036466628,0.00009532575,0.00016519164],"category_scores_gemma":[0.000055463697,0.00013770931,0.00008498387,0.00030900253,0.00012737898,0.000082510735,0.000051447343,0.0002014774,0.000021443975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009644296,0.0007090192,0.0016432559,0.0000280389,0.000088390705,0.0000039942024,0.0009924946,6.308977e-7,0.00022282875,0.9953493,0.00068032043,0.00018528407],"study_design_scores_gemma":[0.0008551319,0.0002720871,0.0027568655,0.000051119256,0.00008157789,0.00000258007,0.00018814948,0.0000194454,0.010954558,0.9845259,0.00013205715,0.00016053254],"about_ca_topic_score_codex":0.00006851079,"about_ca_topic_score_gemma":0.00002561992,"teacher_disagreement_score":0.024156334,"about_ca_system_score_codex":0.000012802329,"about_ca_system_score_gemma":0.000027959075,"threshold_uncertainty_score":0.56156224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96436083,0.000023761564,0.00001597058,0.00036706618,0.00029415626,0.00042260977,0.000005950887,0.000017773238,0.034491878],"genre_scores_gemma":[0.99865425,0.000009234559,0.0006876397,0.0000074427653,0.0000041469452,0.00004591034,3.4244934e-7,0.000014411822,0.000576652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992313,0.0000481875,0.00029727438,0.000102035934,0.0001986836,0.00012254964],"domain_scores_gemma":[0.99856037,0.00024595324,0.00024552963,0.00082166254,0.00010038369,0.000026114758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021520045,0.00009172605,0.00017273394,0.000009372439,0.00011244258,0.0000066627317,0.00040105745,0.000028720771,0.00008875898],"category_scores_gemma":[0.00016772507,0.00004700817,0.00010014061,0.00013159723,0.00012083129,0.000017203232,0.00009179526,0.00008055711,0.0000072748376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002030146,0.00025715068,0.0032985122,0.00006133632,0.00003642572,5.7890155e-8,0.0011255743,9.357001e-9,0.00021911516,0.9877227,0.0071106036,0.00016647553],"study_design_scores_gemma":[0.00014182006,0.000011236055,0.0030228014,0.000030118703,0.000047057565,0.00000140549,0.00021312467,0.0000158232,0.034545414,0.96152943,0.00038613912,0.000055633864],"about_ca_topic_score_codex":0.000022735694,"about_ca_topic_score_gemma":0.000010701096,"teacher_disagreement_score":0.0343263,"about_ca_system_score_codex":0.000009346728,"about_ca_system_score_gemma":0.000021326177,"threshold_uncertainty_score":0.19169375},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96962607,0.00006393279,0.00004429145,0.00012570557,0.00029137105,0.0001597382,0.00000212876,0.00005240129,0.029634373],"genre_scores_gemma":[0.9993712,0.000016589027,0.00035455835,0.000010886967,0.0000017034725,0.00003117778,3.3599005e-7,0.000009095917,0.00020450135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995165,0.000040360857,0.00015965215,0.000079723075,0.00008251169,0.00012125629],"domain_scores_gemma":[0.99918324,0.00025932342,0.00008949162,0.00040731253,0.00003118922,0.000029432129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028613734,0.000060828752,0.000087805674,0.000024542313,0.00014430056,0.0000055691257,0.00025518294,0.000030433308,0.00004185206],"category_scores_gemma":[0.00006188352,0.000041830666,0.00006783003,0.00018935413,0.00012033353,0.000027835891,0.000034044235,0.00007154761,0.000019487488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000082857005,0.00010612622,0.00039806668,0.000005675775,0.00002050089,3.248903e-7,0.00046425214,7.2614053e-9,0.00013251798,0.9977122,0.0010268266,0.00012521833],"study_design_scores_gemma":[0.00015107807,0.00003425796,0.0010957448,0.000005836326,0.000015679037,0.0000013904427,0.00012175423,0.0000014593003,0.009454419,0.9883002,0.0007692451,0.000048960654],"about_ca_topic_score_codex":0.000009611246,"about_ca_topic_score_gemma":0.0000055540218,"teacher_disagreement_score":0.029745094,"about_ca_system_score_codex":0.000003951434,"about_ca_system_score_gemma":0.000009605935,"threshold_uncertainty_score":0.1705805},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9941892,0.0001643578,0.0004741414,0.00016998203,0.0014469167,0.000105388855,0.0000015786622,0.0001275839,0.0033208346],"genre_scores_gemma":[0.99652594,0.0000040875207,0.0029680855,0.00040757764,0.0000012430133,0.0000070461206,7.318355e-7,0.000013295585,0.0000719727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989428,0.000046516067,0.00017855938,0.00020720718,0.00031553616,0.0003093813],"domain_scores_gemma":[0.9990728,0.00009631955,0.00010933913,0.0004954665,0.00010068771,0.00012537013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030754058,0.00013235662,0.00017222091,0.00011792472,0.00007370449,0.0000259739,0.00038357347,0.000056736826,0.000012353756],"category_scores_gemma":[0.000024026733,0.00010121603,0.00005174952,0.00046686045,0.000072695184,0.00022059136,0.0000693389,0.0001179644,0.000050719947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014095744,0.00021102194,0.008214588,0.000006260008,0.000019803028,8.1345496e-7,0.0003680161,0.000011789539,0.00090644613,0.9889122,0.0009115383,0.0004233829],"study_design_scores_gemma":[0.0011800858,0.0004867161,0.0020049845,0.000058638554,0.000012982149,0.0000055027467,0.000013905082,0.00018818837,0.008562443,0.9864772,0.00078770076,0.00022168257],"about_ca_topic_score_codex":0.0000685908,"about_ca_topic_score_gemma":0.0000015447048,"teacher_disagreement_score":0.0076559973,"about_ca_system_score_codex":0.000009463533,"about_ca_system_score_gemma":0.00002702262,"threshold_uncertainty_score":0.412747},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.995629,0.000067924586,0.0000030606282,0.0006009519,0.000702685,0.00047698565,0.000014597236,0.000019202918,0.0024856008],"genre_scores_gemma":[0.9983898,0.0000072210787,0.00027512293,0.000020106974,0.000011006032,0.000010866948,0.000001675042,0.000027337468,0.0012568663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985853,0.00021492936,0.00032403212,0.00012871934,0.00047816327,0.0002688994],"domain_scores_gemma":[0.99688315,0.0016782793,0.00020603594,0.0008672747,0.00032264862,0.000042603253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039863287,0.00012934898,0.00022941284,0.00003772678,0.0001358636,0.000026045022,0.00078830624,0.00009397063,0.00048067223],"category_scores_gemma":[0.0012895592,0.00006808166,0.00007397456,0.00038066268,0.0002528708,0.00006378346,0.0002700998,0.00028991577,0.000024505467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023668876,0.00006309351,0.0022458537,0.00008506148,0.00006475017,5.607549e-7,0.00039584617,0.0000018735575,0.015044129,0.9700107,0.0115876375,0.00047685014],"study_design_scores_gemma":[0.00051397685,0.000066813904,0.0052470444,0.00003555476,0.000016617303,0.000003624253,0.00017797649,0.0000691162,0.015872125,0.977487,0.00043380493,0.00007632211],"about_ca_topic_score_codex":0.00006237562,"about_ca_topic_score_gemma":0.000029552955,"teacher_disagreement_score":0.011153833,"about_ca_system_score_codex":0.000025066758,"about_ca_system_score_gemma":0.000058068068,"threshold_uncertainty_score":0.5263024},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9546065,0.00021615188,0.03051383,0.0010041862,0.0012847268,0.0005461764,0.0000025365207,0.0006433674,0.01118253],"genre_scores_gemma":[0.98301053,0.000004220866,0.016422754,0.0001231198,0.000005257142,0.000045634304,0.0000024105486,0.000026086393,0.00035998665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977991,0.00028260436,0.00021710011,0.00051037123,0.0006414063,0.0005494415],"domain_scores_gemma":[0.997927,0.000287186,0.00010704817,0.00094960997,0.00036876136,0.00036035987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010880772,0.00021077474,0.00022947244,0.00021641894,0.0001635644,0.00013894794,0.0013546816,0.00007600884,0.000004306237],"category_scores_gemma":[0.00021959393,0.00018081079,0.000055508768,0.0012576345,0.00017903425,0.00076465006,0.00042637545,0.0003109288,0.000058596495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034544173,0.00006584745,0.0028735672,0.000008745778,0.000019363966,0.00009063103,0.00093921367,0.000027713357,0.00020367974,0.991938,0.0010910517,0.002707628],"study_design_scores_gemma":[0.0014611068,0.00047296542,0.0003713795,0.00003475901,0.0000039558913,0.00004058914,0.0002267489,0.0033532018,0.0036279478,0.98912454,0.0009976684,0.0002851235],"about_ca_topic_score_codex":0.00001881524,"about_ca_topic_score_gemma":0.0000059343847,"teacher_disagreement_score":0.028404037,"about_ca_system_score_codex":0.00009093384,"about_ca_system_score_gemma":0.00021493007,"threshold_uncertainty_score":0.737325},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13375628,0.00018032434,0.86004055,0.0008313991,0.0020451623,0.00080306985,0.00004839342,0.0005571268,0.0017376842],"genre_scores_gemma":[0.9054481,0.0000044309113,0.09381459,0.0003166283,0.000022304024,0.00015392738,0.000027427404,0.000032861084,0.00017976233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823785,0.00013091999,0.00021124618,0.0005014799,0.00038790543,0.00053059706],"domain_scores_gemma":[0.9979078,0.00022312909,0.00007157592,0.0010034839,0.00037376795,0.00042025017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060952775,0.00017949936,0.00020132115,0.00017445533,0.0002505138,0.0001908217,0.001382993,0.00009113804,0.000006115967],"category_scores_gemma":[0.00006682359,0.00018013956,0.00007573294,0.0004836367,0.00014051008,0.0009794534,0.00020940951,0.00016631852,0.00007240812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062650925,0.00012108429,0.00017921551,0.000003047041,0.000017814347,0.000006938213,0.0001594902,0.00005216607,0.00042171744,0.9689197,0.0012887507,0.02882384],"study_design_scores_gemma":[0.0012754643,0.00035555288,0.00217284,0.0000068317227,0.0000046612986,0.000016655693,0.000113743925,0.026061416,0.0016931683,0.96683955,0.001226121,0.00023398442],"about_ca_topic_score_codex":0.000021229778,"about_ca_topic_score_gemma":0.00000829549,"teacher_disagreement_score":0.7716918,"about_ca_system_score_codex":0.00011932828,"about_ca_system_score_gemma":0.00017732737,"threshold_uncertainty_score":0.7345878},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8391622,0.0002581749,0.15001939,0.00051189086,0.0061892653,0.0015417569,0.000016914739,0.00081296935,0.001487439],"genre_scores_gemma":[0.9841713,0.000005077371,0.015430778,0.000118329626,0.000013316312,0.000077291836,0.000031293675,0.000024252922,0.00012841301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832135,0.00014713356,0.00022070474,0.0004987473,0.00033528698,0.00047675744],"domain_scores_gemma":[0.9977448,0.00018424686,0.000095748896,0.0009633149,0.000651262,0.0003606419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008353208,0.00017351031,0.00020101471,0.00018481283,0.00017097144,0.00014853539,0.001265805,0.00010661677,0.000004880898],"category_scores_gemma":[0.00027739047,0.00017176576,0.000073289,0.0007080546,0.000111544265,0.0010598544,0.00015527158,0.00018397653,0.00004402238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007399606,0.00012235082,0.000352526,0.000008213953,0.000016363409,0.0000050715853,0.0002410635,0.000012488065,0.005579598,0.98709,0.0010765311,0.0054217945],"study_design_scores_gemma":[0.0018080169,0.0010903585,0.0006634707,0.0000062714794,0.000005282658,0.000005754797,0.000048000788,0.015657948,0.0045746393,0.97468084,0.0012333696,0.00022603369],"about_ca_topic_score_codex":0.000012623542,"about_ca_topic_score_gemma":0.000005899941,"teacher_disagreement_score":0.14500904,"about_ca_system_score_codex":0.00007669068,"about_ca_system_score_gemma":0.00016645149,"threshold_uncertainty_score":0.70044047},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55212206,0.00006695132,0.4445364,0.00070456683,0.0017931609,0.00034949905,0.0000024669719,0.0001102574,0.0003146759],"genre_scores_gemma":[0.9970644,0.00001106057,0.0025761463,0.00021358124,0.00002124262,0.00003908138,0.0000059665813,0.000009216471,0.000059319358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991438,0.00004922603,0.00022184633,0.00022353021,0.00015467856,0.0002069192],"domain_scores_gemma":[0.99882364,0.0003838447,0.0001893385,0.00046004768,0.00010478959,0.000038316084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003688515,0.000103570426,0.00015183406,0.00005364903,0.00016454629,0.000050046332,0.00064804737,0.000046795976,0.0000023060234],"category_scores_gemma":[0.00010255313,0.00007608552,0.00008076101,0.00031242715,0.000056558958,0.00024195266,0.00011538435,0.00007638925,0.000005672833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044210224,0.000028725197,0.0010695292,0.000018539738,0.00000935805,1.6736432e-7,0.000120669014,0.000012988777,0.009138056,0.9734777,0.000034621928,0.01608518],"study_design_scores_gemma":[0.00095960236,0.00026038665,0.025487311,0.000030073028,0.000019872277,0.0000039801694,0.000023815124,0.062445197,0.009964005,0.8938578,0.0067235483,0.00022444247],"about_ca_topic_score_codex":0.0000023815965,"about_ca_topic_score_gemma":5.180811e-7,"teacher_disagreement_score":0.44494236,"about_ca_system_score_codex":0.000009704494,"about_ca_system_score_gemma":0.000015605945,"threshold_uncertainty_score":0.31026772},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9410834,0.0036165044,0.003969378,0.0000044287203,0.010904272,0.00016901962,0.000005904928,0.00084924477,0.0393979],"genre_scores_gemma":[0.9993896,0.000028086075,0.00020988428,0.0000013190755,0.000019092116,0.00001943432,0.0000021881297,0.00004838673,0.00028201198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993002,0.000007798347,0.0002177862,0.00011539968,0.00012730653,0.00023151159],"domain_scores_gemma":[0.9994957,0.000020527481,0.00003480112,0.00032781545,0.000046485737,0.0000746637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012152332,0.00014974807,0.00025018404,0.00006230075,0.000024167439,0.000010288332,0.00017435376,0.00010197635,0.000020316314],"category_scores_gemma":[0.000011117886,0.00014813105,0.000048904632,0.00017547255,0.000020110976,0.00008497476,0.000022935259,0.00010292115,0.00007473423],"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.000015471103,0.00009374739,0.012725484,0.000839121,0.0003631558,0.000020419788,0.0014618221,0.08740289,0.0049393633,0.87908906,0.012497875,0.0005515967],"study_design_scores_gemma":[0.006750977,0.001205441,0.059297785,0.0025199666,0.00043596156,0.00013325801,0.0015113169,0.6447422,0.10296068,0.11063196,0.06455042,0.005260046],"about_ca_topic_score_codex":0.000307789,"about_ca_topic_score_gemma":0.0000113923725,"teacher_disagreement_score":0.7684571,"about_ca_system_score_codex":0.000034219902,"about_ca_system_score_gemma":0.000009345225,"threshold_uncertainty_score":0.6040609},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9858247,0.00015863356,0.000010346061,0.00016651844,0.0018139369,0.0001519342,0.0000017768778,0.0000743297,0.011797801],"genre_scores_gemma":[0.9997835,0.0000034787868,0.000001807212,0.00013500478,0.0000046365853,0.0000060579337,5.0578024e-7,0.000012466505,0.00005251988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993878,0.00007129232,0.00014415392,0.00008431859,0.00016382504,0.00014859515],"domain_scores_gemma":[0.99935704,0.00008195303,0.00002968979,0.00048945803,0.000016730983,0.000025104971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024227897,0.00010577247,0.00011473012,0.000022824424,0.00007218782,0.000013240406,0.0003322514,0.00005481365,0.00003155531],"category_scores_gemma":[0.000023668415,0.000060542978,0.00009695875,0.00020736954,0.000035416466,0.000039369188,0.000013876281,0.0001554866,0.000024176727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004659064,0.000032740572,0.00013803293,0.0000051245897,0.000017560309,9.174645e-7,0.00021422586,0.00029918118,0.0045649237,0.993242,0.0014108188,0.000069787326],"study_design_scores_gemma":[0.00025950026,0.000093587085,0.01815108,0.000044454027,0.000008924709,0.0000025775596,0.00007862929,0.00045505023,0.006579682,0.9730255,0.0011867337,0.00011429378],"about_ca_topic_score_codex":0.0000025224376,"about_ca_topic_score_gemma":5.063407e-7,"teacher_disagreement_score":0.020216541,"about_ca_system_score_codex":0.00001631847,"about_ca_system_score_gemma":0.0000026407013,"threshold_uncertainty_score":0.2468871},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9945617,0.00022958445,0.00035162776,0.0000927764,0.002514077,0.0003571773,0.000020898276,0.00016433648,0.0017078789],"genre_scores_gemma":[0.9996476,0.0000035157982,0.000053116855,0.000086666914,0.000012290857,0.00011851915,0.000015110719,0.000019872812,0.00004328843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994553,0.000022836426,0.00012672195,0.00012708356,0.00009422106,0.00017386978],"domain_scores_gemma":[0.9995823,0.000050380862,0.00001545462,0.0001378827,0.000049257083,0.00016475498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002518226,0.000101428566,0.0001357732,0.00008726612,0.000047166617,0.00003231084,0.00007530629,0.000052513667,0.0000034506302],"category_scores_gemma":[0.00003229891,0.00010508995,0.000035442652,0.00017210614,0.00001962357,0.00007781675,0.000016627011,0.000049695333,0.000010936239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053923108,0.000060918628,0.0007484482,0.00009913581,0.000050458326,0.0000048636707,0.0024802429,0.001059014,0.0016060063,0.9493191,0.04416193,0.00035590766],"study_design_scores_gemma":[0.0037532146,0.0007806768,0.0019458832,0.00008432061,0.00006088636,0.000023755736,0.0024159004,0.004325352,0.00491992,0.9195173,0.06148263,0.0006902066],"about_ca_topic_score_codex":0.0000088639235,"about_ca_topic_score_gemma":0.0000041132234,"teacher_disagreement_score":0.029801896,"about_ca_system_score_codex":0.000023222176,"about_ca_system_score_gemma":0.000008968385,"threshold_uncertainty_score":0.42854437},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.609653,0.00029677973,0.1284504,0.0005104,0.008187355,0.0018682823,0.000010579579,0.0049438714,0.24607936],"genre_scores_gemma":[0.99342716,0.00002061176,0.006224616,0.000047199337,0.0000104234405,0.0000450216,0.000006937772,0.000033775177,0.0001842388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945647,0.000008089824,0.00011643999,0.00012187584,0.000095867195,0.0002012439],"domain_scores_gemma":[0.99966204,0.00004867423,0.000020203612,0.0001816153,0.000031821986,0.0000556311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000035270838,0.0001187411,0.000099509365,0.000051447558,0.000052585012,0.0000410749,0.000088265115,0.00005866182,0.0000617415],"category_scores_gemma":[0.000028564797,0.00011744975,0.000024019115,0.00008067536,0.000014675889,0.0001188873,0.000016347107,0.0001453077,0.00030367103],"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.0000033599351,0.000040647676,0.0000742949,0.00005115474,0.000017288603,0.000003942649,0.00019867808,0.79786044,0.0004830631,0.18831044,0.0052902726,0.0076664253],"study_design_scores_gemma":[0.00079061725,0.00011037325,0.0009644643,0.000079929574,0.000012231977,0.0000031967777,0.000022204136,0.12932816,0.010962683,0.8524348,0.004833897,0.00045743713],"about_ca_topic_score_codex":0.000013996917,"about_ca_topic_score_gemma":6.962332e-7,"teacher_disagreement_score":0.66853225,"about_ca_system_score_codex":0.00006170268,"about_ca_system_score_gemma":0.00000480135,"threshold_uncertainty_score":0.4789462},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906023,0.000061071434,0.0017716192,0.0005005149,0.0023314978,0.00017125529,6.7367006e-7,0.00020974567,0.0043512895],"genre_scores_gemma":[0.9934614,0.0000117706,0.0062381383,0.00010852327,0.000005124504,0.000026146718,8.698499e-7,0.000012942056,0.00013511692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985284,0.00012308764,0.00022633284,0.00040416015,0.00029506016,0.00042290936],"domain_scores_gemma":[0.9987157,0.0001806042,0.00005076508,0.00083273853,0.00009170607,0.00012846968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071777025,0.00013765179,0.00017047818,0.00029942393,0.00006898668,0.00010163729,0.0015115482,0.00008860682,0.00003221004],"category_scores_gemma":[0.00016899631,0.00013486399,0.00007101065,0.00080064265,0.00013351065,0.0006587803,0.00045916083,0.00064017734,0.00008059016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008243844,0.00009063754,0.011716667,0.000004006337,0.000003939168,0.000035429402,0.00021884897,6.6459546e-7,0.0045552375,0.9756434,0.00020221579,0.0075206934],"study_design_scores_gemma":[0.0004455814,0.000078892546,0.0104440395,0.000011692779,6.2574145e-7,0.000009259802,0.000011437485,0.0009100871,0.004783158,0.98181933,0.0013305723,0.00015529944],"about_ca_topic_score_codex":0.000027656213,"about_ca_topic_score_gemma":0.00007813434,"teacher_disagreement_score":0.007365394,"about_ca_system_score_codex":0.0000260208,"about_ca_system_score_gemma":0.000049449074,"threshold_uncertainty_score":0.54995936},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9961651,0.0001855965,0.0000044127437,0.000017720791,0.0014068192,0.00018476027,0.000010415007,0.00004612914,0.00197905],"genre_scores_gemma":[0.9999285,0.000013092627,0.00001004979,0.0000026326127,0.000005926376,0.000012222175,0.0000015236809,0.000014567245,0.000011539834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991102,0.00014623142,0.00034362767,0.00012308752,0.00014218282,0.0001346522],"domain_scores_gemma":[0.99902767,0.00041511815,0.00012360714,0.00027398876,0.0000931875,0.00006641054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081052457,0.00012036517,0.0002607796,0.000053164615,0.00005139093,0.000015952486,0.00014194087,0.000055902165,0.0000010722546],"category_scores_gemma":[0.00041873456,0.000089582005,0.000053069372,0.00016242883,0.0001654493,0.00007020788,0.000026914622,0.0001377132,0.0000018096125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010407089,0.00021581633,0.05672,0.00043545789,0.00039347738,0.0000046915866,0.022678977,0.00018112341,0.010157415,0.9027514,0.00033477266,0.005086176],"study_design_scores_gemma":[0.0036266672,0.00070886203,0.050388247,0.00047233808,0.00006384882,0.000008859416,0.012185221,0.0015365852,0.043123834,0.88726914,0.00023243108,0.00038397856],"about_ca_topic_score_codex":0.000033767876,"about_ca_topic_score_gemma":0.00001025709,"teacher_disagreement_score":0.03296642,"about_ca_system_score_codex":0.000027286193,"about_ca_system_score_gemma":0.000011258857,"threshold_uncertainty_score":0.3653048},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917523,0.000050073133,0.00032818384,0.00006585147,0.0012423703,0.00014594784,0.000026140942,0.00004149873,0.00634762],"genre_scores_gemma":[0.9972847,6.926284e-7,0.0003631515,0.000024465373,0.00006397818,0.000012082442,0.00003674177,0.000022495587,0.0021917024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916095,0.00003198655,0.00014753317,0.0001928226,0.00018914486,0.0002775946],"domain_scores_gemma":[0.99939936,0.000021685659,0.0000613557,0.0002416097,0.00010480536,0.0001711875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112624184,0.00014249801,0.00016819099,0.000035442135,0.00009782979,0.000085752086,0.00016607514,0.000027502681,0.0000735527],"category_scores_gemma":[0.0000031800696,0.00012000905,0.000059735463,0.000111843234,0.00007403302,0.00010631186,0.000070986665,0.00013427967,0.00015761865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071464,0.000945067,0.12277643,0.000010504871,0.00015806564,0.000018990651,0.0014032733,0.00023567196,0.00013005234,0.8630883,0.010465684,0.0006964654],"study_design_scores_gemma":[0.053313494,0.002739548,0.053847358,0.00025875328,0.00056568725,0.000034219494,0.019938558,0.024795366,0.025052166,0.7266778,0.08825223,0.0045248275],"about_ca_topic_score_codex":0.00019733996,"about_ca_topic_score_gemma":0.0000044051767,"teacher_disagreement_score":0.13641055,"about_ca_system_score_codex":0.00004336697,"about_ca_system_score_gemma":0.00015574445,"threshold_uncertainty_score":0.48938268},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99733335,0.000026950283,0.000011574607,0.0001541007,0.00064656034,0.00033382833,0.000021014104,0.00006757652,0.0014050376],"genre_scores_gemma":[0.9979064,0.0000072876683,0.0017307274,0.000036413305,0.00000974461,0.00013115144,0.00000663236,0.000019382856,0.00015229211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993364,0.00002068748,0.00023203301,0.00014778359,0.00010453999,0.00015854252],"domain_scores_gemma":[0.9986533,0.0006793487,0.00016963332,0.00037864107,0.00006512111,0.000053986747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028452682,0.00010083572,0.00018485318,0.000098507655,0.000110016386,0.000014153189,0.00026437748,0.00008093216,0.00003972555],"category_scores_gemma":[0.00021755113,0.000092468545,0.00011045316,0.00019966603,0.00012151566,0.00010616326,0.00003106384,0.00014107156,0.000012515638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007648118,0.00022394514,0.0012318543,0.00006018992,0.000028034818,1.7093532e-7,0.00011862533,2.3003501e-8,0.01528479,0.9808959,0.0019056266,0.00024318982],"study_design_scores_gemma":[0.00044045984,0.00005186649,0.00081707933,0.000010333623,0.000037460624,0.0000013434179,0.000042161024,0.000005308203,0.035671867,0.95952636,0.0032975525,0.00009822034],"about_ca_topic_score_codex":0.0000043902155,"about_ca_topic_score_gemma":0.0000063935795,"teacher_disagreement_score":0.021369556,"about_ca_system_score_codex":0.0000032348705,"about_ca_system_score_gemma":0.000021522646,"threshold_uncertainty_score":0.37707576},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946264,0.00025597436,0.0009947189,0.0003491622,0.002097721,0.00020716681,0.0000028108657,0.00016026245,0.0013057705],"genre_scores_gemma":[0.99645746,0.00000852496,0.0031499981,0.00029356938,0.0000012659362,0.00001644413,0.0000026623502,0.000012656976,0.000057442925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846375,0.00016455608,0.0003575691,0.00024542006,0.00035590035,0.0004128271],"domain_scores_gemma":[0.9985673,0.00021107392,0.00018190136,0.00075471646,0.00010579701,0.00017919946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006247331,0.00017188268,0.00028514155,0.00020037265,0.00011137522,0.00003531766,0.0005815007,0.00007483815,0.000011051187],"category_scores_gemma":[0.000048976264,0.00015225484,0.00010498478,0.0007262686,0.00007994664,0.00028732707,0.00013515502,0.00013646689,0.00010295405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067983988,0.00026171652,0.0012516113,0.000030440007,0.000015651105,0.0000019969175,0.00061461685,0.000024931058,0.004823582,0.99157125,0.0005273785,0.00087003084],"study_design_scores_gemma":[0.0010656955,0.00024528406,0.003695367,0.00011227304,0.000014145982,0.0000068220265,0.000012306485,0.0037201801,0.015294427,0.9748334,0.00074724236,0.0002528145],"about_ca_topic_score_codex":0.000059700425,"about_ca_topic_score_gemma":0.0000013742001,"teacher_disagreement_score":0.016737806,"about_ca_system_score_codex":0.000025353964,"about_ca_system_score_gemma":0.00003952381,"threshold_uncertainty_score":0.62087727},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98645675,0.00005286288,0.0033077057,0.0018101919,0.0010399659,0.00040119572,0.0000011595077,0.000089308494,0.006840876],"genre_scores_gemma":[0.9977115,0.000011630844,0.0020429888,0.00011546545,0.0000030198178,0.000036934372,4.6915196e-7,0.0000071035925,0.00007090889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891645,0.00014072885,0.0001631579,0.00021680433,0.0003362425,0.00022659036],"domain_scores_gemma":[0.9984597,0.00050303416,0.00008504041,0.00072917336,0.00015596795,0.00006708364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027854944,0.00009733121,0.00011899053,0.00011053883,0.00012187699,0.000064414555,0.000972868,0.000042709496,0.00006452295],"category_scores_gemma":[0.00015461372,0.000067308414,0.0000658288,0.0005899096,0.000261527,0.0003306861,0.0001487105,0.00018337772,0.00011253581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004221145,0.00003362655,0.0005299572,0.0000030570286,0.000011674585,9.71358e-7,0.0001122543,0.000008113126,0.0007403334,0.9913242,0.0009588599,0.006272751],"study_design_scores_gemma":[0.00023341081,0.00011902389,0.0024484093,0.000011086764,0.0000012304658,0.0000037837258,0.000032336728,0.00085816334,0.0056493627,0.99042076,0.0001485948,0.000073815674],"about_ca_topic_score_codex":0.000021709438,"about_ca_topic_score_gemma":6.415738e-7,"teacher_disagreement_score":0.011254745,"about_ca_system_score_codex":0.000019338311,"about_ca_system_score_gemma":0.000038637343,"threshold_uncertainty_score":0.27447575},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8826545,0.0014637653,0.1118161,0.00009790324,0.0019008493,0.00020270742,0.00004383646,0.00016653913,0.0016538022],"genre_scores_gemma":[0.99554074,0.000010484168,0.0041794083,0.00001735722,0.0000068493214,0.00001876014,0.000012330798,0.000011349676,0.00020274533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983824,0.000098041746,0.00024055142,0.00025290775,0.00037636177,0.0006497352],"domain_scores_gemma":[0.9986577,0.00018093069,0.00011083968,0.0006840838,0.00014412595,0.00022232436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005470703,0.00013491181,0.00018546479,0.0001036664,0.00039861226,0.00012490501,0.00084402825,0.00006273405,0.000021381065],"category_scores_gemma":[0.00012728861,0.00013599421,0.00008371452,0.0010394928,0.00026258203,0.0010653874,0.00034925615,0.00018625926,0.000034883193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050126732,0.00020431286,0.012370611,0.000009647501,0.000016578904,0.0000012300975,0.00036660014,0.00000523386,0.0044770213,0.978471,0.0027442388,0.0013285236],"study_design_scores_gemma":[0.0009418127,0.00014114876,0.0036083157,0.000035485566,0.000011752836,0.00001705004,0.00008991704,0.0013015107,0.10122047,0.8649899,0.027238313,0.0004043264],"about_ca_topic_score_codex":0.000021560947,"about_ca_topic_score_gemma":4.1090246e-7,"teacher_disagreement_score":0.1134811,"about_ca_system_score_codex":0.00007040947,"about_ca_system_score_gemma":0.00006225795,"threshold_uncertainty_score":0.5545683},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9962118,0.00024878923,0.00011410132,0.00053731626,0.0012154157,0.00014591035,4.7925096e-7,0.0001515493,0.0013746278],"genre_scores_gemma":[0.9957321,0.000010922972,0.0039276914,0.00023577774,3.8476955e-7,0.0000138609275,7.8240606e-7,0.0000053683866,0.00007309469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989968,0.00005239574,0.00024949198,0.0002450403,0.00024475763,0.00021150522],"domain_scores_gemma":[0.99894315,0.00005559191,0.000105136525,0.0006290826,0.00017104916,0.00009598975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025333866,0.00009743756,0.00016237407,0.0000914099,0.00006122566,0.000051834555,0.0005884277,0.00005311959,0.000020067127],"category_scores_gemma":[0.00003351836,0.00008567784,0.0000723009,0.00036945505,0.00007189364,0.0004896477,0.0001869622,0.00008987056,0.00012429769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.4104436e-7,0.000087439985,0.0023995112,0.000010081587,0.000009127601,7.7000624e-7,0.00008261158,0.0000023550072,0.0032684216,0.9910393,0.0020060276,0.0010938359],"study_design_scores_gemma":[0.00032142704,0.00006518135,0.009207308,0.000011639263,0.000002633579,0.0000016043952,0.000004237591,0.0006926062,0.008298857,0.981199,0.000094901014,0.00010056618],"about_ca_topic_score_codex":0.00017748968,"about_ca_topic_score_gemma":3.9180935e-7,"teacher_disagreement_score":0.009840239,"about_ca_system_score_codex":0.0000086625,"about_ca_system_score_gemma":0.000034111115,"threshold_uncertainty_score":0.3493841},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9875039,0.0015544245,0.0000071152763,0.00076107256,0.0016816037,0.00008368953,0.000004326151,0.000024953155,0.008378958],"genre_scores_gemma":[0.9983553,0.00005934736,0.0001036678,0.0007678287,0.0000364817,0.000012553531,0.000023425388,0.000011488577,0.000629856],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993015,0.00006124472,0.00011053301,0.00025217648,0.000061374834,0.0002132034],"domain_scores_gemma":[0.99949807,0.000009994695,0.00006169296,0.00024032367,0.00009732038,0.000092574635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016730731,0.0001205405,0.00013929968,0.000021639742,0.000076160446,0.0000068406175,0.00015102346,0.00018007595,0.0000073166157],"category_scores_gemma":[0.0001900783,0.00011096128,0.000050683793,0.000058803525,0.00019036885,0.0000025812544,0.00012982322,0.00008528745,0.00008697144],"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.00026722485,0.00036622863,0.5421061,0.000013861276,0.00038283414,0.000060143822,0.00015211204,0.000011222687,0.040238727,0.04279483,0.3727669,0.0008398205],"study_design_scores_gemma":[0.0076611433,0.0022939423,0.20372322,0.00002795435,0.00011728703,0.00012642694,0.0015505272,0.00002363736,0.15265527,0.16716215,0.46332672,0.0013316938],"about_ca_topic_score_codex":0.0000061678993,"about_ca_topic_score_gemma":0.000010869026,"teacher_disagreement_score":0.33838287,"about_ca_system_score_codex":0.000010958017,"about_ca_system_score_gemma":0.0000470745,"threshold_uncertainty_score":0.45248696},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9979071,0.00023705374,0.0000064623755,0.00010930683,0.0001423201,0.00017662597,0.0000036948643,0.000039885355,0.0013775715],"genre_scores_gemma":[0.9992766,0.000011910413,0.0005037357,0.000017149749,0.0000039743536,0.000022035727,7.9576347e-7,0.0000108447375,0.00015298747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994438,0.00004239991,0.00015901671,0.000112520174,0.0001132898,0.00012896139],"domain_scores_gemma":[0.99952084,0.000043904267,0.00006871043,0.00022480312,0.000062616884,0.00007914091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029805538,0.00007869872,0.00015478369,0.00004895572,0.000048669055,0.000015208648,0.000110543704,0.000038730024,0.0000067382225],"category_scores_gemma":[0.000113328046,0.00006617137,0.00002610167,0.00013932296,0.00008297634,0.00014061951,0.0000462143,0.00006657778,0.0000068439745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016349786,0.00013888885,0.0005361071,0.000037971786,0.000019827185,6.990697e-7,0.0007202817,2.7270818e-7,0.0038757403,0.9938482,0.000783338,0.000022292663],"study_design_scores_gemma":[0.0005193984,0.00005648388,0.00018467623,0.00002726217,0.000019682951,0.0000035735288,0.00027477538,0.000016756583,0.024600113,0.9740825,0.00013609779,0.000078655314],"about_ca_topic_score_codex":0.000022234432,"about_ca_topic_score_gemma":0.0000033286055,"teacher_disagreement_score":0.020724371,"about_ca_system_score_codex":0.000008833709,"about_ca_system_score_gemma":0.000034256256,"threshold_uncertainty_score":0.26983902},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9631537,0.00035622547,0.000022024547,0.000012152003,0.004273038,0.000110638066,0.0000020864777,0.0006670908,0.031403013],"genre_scores_gemma":[0.99973744,0.0000044025173,0.000026982654,0.000018328547,0.0000086094715,0.000020153486,0.000005256358,0.000032094624,0.00014675265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932206,0.00004656523,0.00015325996,0.000119442426,0.00014210085,0.00021655216],"domain_scores_gemma":[0.99947053,0.000025355725,0.000018651397,0.00027224232,0.000052331605,0.00016090841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021942773,0.0001328275,0.00016828357,0.000075374504,0.000035467954,0.00002768649,0.0001617902,0.0000774648,0.000018388877],"category_scores_gemma":[0.000029515817,0.0001315019,0.00005136119,0.00027130713,0.0000283271,0.00011126171,0.000016421665,0.00011925428,0.00022613184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011329941,0.00002419544,0.006878888,0.000022046244,0.000058014743,0.000010228243,0.00052969076,0.00021174771,0.0010975444,0.9823997,0.008518059,0.00023856609],"study_design_scores_gemma":[0.0012632271,0.00006800189,0.0011936743,0.000028073386,0.000018036173,0.000018723114,0.0002684827,0.001454611,0.0041547576,0.98204046,0.009176685,0.00031529163],"about_ca_topic_score_codex":0.000010048919,"about_ca_topic_score_gemma":0.0000027913832,"teacher_disagreement_score":0.036583688,"about_ca_system_score_codex":0.000028484936,"about_ca_system_score_gemma":0.000011531228,"threshold_uncertainty_score":0.53624916},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9912402,0.0019144204,0.0022466686,0.00030294203,0.0018250993,0.00007566948,9.0525066e-7,0.0007202992,0.0016738198],"genre_scores_gemma":[0.99870205,0.000025705693,0.0009655363,0.00022470366,0.0000133338435,0.000005595396,4.9913666e-7,0.000016102422,0.00004650076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993251,0.000047843165,0.00009623175,0.00015990328,0.00008864871,0.00028225724],"domain_scores_gemma":[0.9993147,0.00011594923,0.000034702167,0.00039147775,0.00001724994,0.00012590394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028026383,0.00010523977,0.000109444845,0.00003987306,0.0000556928,0.00008516533,0.0003793213,0.00003924054,0.000004360538],"category_scores_gemma":[0.000021312368,0.00008066364,0.000027400914,0.00014020667,0.00004148322,0.00064261345,0.00029873653,0.00007354267,0.000017871847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.7023545e-7,0.00004897785,0.00318352,0.000004174081,0.000007772775,9.2768346e-7,0.0010090759,1.08737e-7,0.00061315985,0.98321843,0.0013698748,0.010543124],"study_design_scores_gemma":[0.00037438804,0.00005423107,0.023629274,0.000012930954,0.0000030369713,0.000026215095,0.00013586074,0.0018323166,0.008328182,0.94956994,0.015800098,0.00023351768],"about_ca_topic_score_codex":0.000007725319,"about_ca_topic_score_gemma":1.7595889e-7,"teacher_disagreement_score":0.033648465,"about_ca_system_score_codex":0.000012665507,"about_ca_system_score_gemma":0.000010378625,"threshold_uncertainty_score":0.3289368},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9899381,0.000030108138,0.003330439,0.00020570381,0.0025652407,0.0000645213,0.0000013332769,0.00012659034,0.0037379996],"genre_scores_gemma":[0.99433786,0.0000034730192,0.0055286665,0.00006416593,0.000007066072,0.0000059205713,7.456572e-7,0.000006446008,0.00004563168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999191,0.00004508677,0.0001702796,0.00022154755,0.00018349172,0.00018862996],"domain_scores_gemma":[0.99904466,0.000104567065,0.00008180155,0.00062381214,0.00006757957,0.000077557794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003425597,0.000099814584,0.00014562231,0.000092527145,0.00006637659,0.000046444027,0.00096526096,0.0000683846,0.000028331857],"category_scores_gemma":[0.000028116685,0.00009608676,0.000092051705,0.00032378224,0.000098155826,0.00022654502,0.00022684244,0.00021333469,0.000029373025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009345253,0.00009243933,0.0026487238,0.0000051642846,0.000013387759,0.000007776726,0.0002675068,0.0000030968386,0.010253609,0.983578,0.0003938919,0.0027270566],"study_design_scores_gemma":[0.00059887813,0.00020973821,0.003018345,0.000014385148,0.000007488188,0.00001819834,0.000016459115,0.005300948,0.024239155,0.9620036,0.0043691294,0.0002037057],"about_ca_topic_score_codex":0.000014181551,"about_ca_topic_score_gemma":0.000002158708,"teacher_disagreement_score":0.02157443,"about_ca_system_score_codex":0.00000484978,"about_ca_system_score_gemma":0.00003566583,"threshold_uncertainty_score":0.39183044},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99342954,0.000086288266,0.001533883,0.00010763557,0.0018293147,0.00044883994,0.000034492572,0.000045830944,0.0024842024],"genre_scores_gemma":[0.9984509,0.0000063628963,0.0012916711,0.000055540662,0.000018467917,0.00004076211,0.0000026428895,0.000016953303,0.00011672386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926823,0.00006585532,0.00021293589,0.00013072813,0.0001632175,0.00015900815],"domain_scores_gemma":[0.99744874,0.0018159585,0.00016038422,0.00042636282,0.00011531953,0.000033254182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003667276,0.000106299376,0.00018748664,0.000026250751,0.000183321,0.000013349316,0.0002862109,0.00007001318,0.00003130957],"category_scores_gemma":[0.000729556,0.00006755362,0.0001150101,0.00007376621,0.00012979607,0.000048529215,0.00005469002,0.000085945634,0.0000016270099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023217419,0.00003345308,0.00035032575,0.000069012916,0.000032253203,1.9299868e-7,0.0005738889,2.1239134e-7,0.00020985639,0.9960673,0.0012471322,0.0013931413],"study_design_scores_gemma":[0.0005921525,0.00012263806,0.0027966604,0.000029299421,0.000040523064,0.0000021617684,0.00008281007,0.0002462959,0.0017069741,0.9926514,0.001638879,0.00009022848],"about_ca_topic_score_codex":0.0000049589976,"about_ca_topic_score_gemma":0.000002521066,"teacher_disagreement_score":0.0050213626,"about_ca_system_score_codex":0.0000129250575,"about_ca_system_score_gemma":0.000013535432,"threshold_uncertainty_score":0.27547568},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93886894,0.000011533844,0.00007322761,0.00027586668,0.001316732,0.00026048723,0.000004849703,0.0002094346,0.05897893],"genre_scores_gemma":[0.9979874,0.0000040614204,0.0006251395,0.00018673672,0.000021293123,0.00003306543,0.0000050279577,0.000059001755,0.0010783112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803597,0.00030753788,0.00027255225,0.00031813,0.0005523404,0.00051348127],"domain_scores_gemma":[0.9973049,0.0014967049,0.00008647625,0.0008298064,0.00010878693,0.0001732799],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013204697,0.00020917997,0.00028262154,0.00020996162,0.00015902796,0.000057321096,0.0004835229,0.00014085083,0.00020197616],"category_scores_gemma":[0.0013843996,0.00019215717,0.00011925433,0.00038372894,0.00011132295,0.00010478652,0.00014548066,0.0004258389,0.0009107377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068339046,0.00021655542,0.00063395244,0.000045448916,0.000020592192,0.000010422092,0.00030123946,9.469254e-7,0.00040146278,0.98953986,0.0074545387,0.0013066183],"study_design_scores_gemma":[0.0011172295,0.0003964543,0.0007082135,0.000040806055,0.000013640345,0.0000057273865,0.000021322656,0.00029007968,0.002927907,0.9896263,0.0046297573,0.00022258496],"about_ca_topic_score_codex":0.00002071275,"about_ca_topic_score_gemma":0.000008215458,"teacher_disagreement_score":0.059118427,"about_ca_system_score_codex":0.000063100626,"about_ca_system_score_gemma":0.000035516372,"threshold_uncertainty_score":0.99986714},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9740333,0.000052191783,0.000006727853,0.00007158941,0.0014122596,0.00021553841,0.0000022472975,0.00006719507,0.024138976],"genre_scores_gemma":[0.99799377,0.000011431126,0.0014797351,0.0000742416,0.000009472501,0.000013592832,0.0000015343097,0.000027624155,0.0003886088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989982,0.000064171705,0.00030323758,0.00016995915,0.00023325962,0.00023113652],"domain_scores_gemma":[0.99889165,0.00028302553,0.00012814598,0.0004953476,0.00012385816,0.00007794158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019317275,0.00014679556,0.0002961676,0.000058471647,0.00010177974,0.00001891261,0.00031232904,0.00011342491,0.00056182366],"category_scores_gemma":[0.00022198944,0.00011971074,0.00011725917,0.0001571822,0.0001313521,0.00012438107,0.00011915313,0.00015100914,0.00005636857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029881162,0.000068932946,0.006044197,0.00004715641,0.00005055854,0.000001692214,0.00057202915,3.5519128e-7,0.0007272183,0.9822552,0.009746972,0.000482688],"study_design_scores_gemma":[0.00039865027,0.000038821687,0.005701741,0.0000222724,0.000026174986,0.000006641595,0.00015600228,0.000018097082,0.0027624045,0.99020696,0.0005182467,0.00014399143],"about_ca_topic_score_codex":0.00007066843,"about_ca_topic_score_gemma":0.0000010707398,"teacher_disagreement_score":0.023960486,"about_ca_system_score_codex":0.000016938855,"about_ca_system_score_gemma":0.000016556432,"threshold_uncertainty_score":0.61515754},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9833535,0.00023607988,0.0140062515,0.000008529847,0.0010126972,0.0005762912,0.0000021130638,0.00014398199,0.00066054775],"genre_scores_gemma":[0.99836606,0.0000079278525,0.0014894782,0.000006331058,0.0000068271233,0.00006019623,0.0000012150531,0.000036562433,0.000025396002],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877906,0.00016108894,0.00045951566,0.00016053951,0.00019204764,0.00024776626],"domain_scores_gemma":[0.9990612,0.00027824228,0.00011509428,0.0003624021,0.0001047593,0.00007827675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003948617,0.00018871625,0.0004070391,0.00015142023,0.000036739893,0.000015926375,0.00029174256,0.000116196024,0.000045963156],"category_scores_gemma":[0.000047688667,0.00019067565,0.000078941055,0.00034343672,0.000064219246,0.00014455942,0.00003862818,0.00012732585,0.00003409575],"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.00013135208,0.0002459037,0.003493988,0.0010672997,0.0005593521,0.000010423724,0.007110326,0.10466192,0.7335932,0.14155678,0.0061902627,0.0013791488],"study_design_scores_gemma":[0.0022360438,0.00039525167,0.0019180026,0.0003911427,0.000041589286,0.0000105920735,0.0006860647,0.29406753,0.09184064,0.60773575,0.00011291426,0.00056450523],"about_ca_topic_score_codex":0.000051373154,"about_ca_topic_score_gemma":4.2490478e-7,"teacher_disagreement_score":0.6417526,"about_ca_system_score_codex":0.000032331587,"about_ca_system_score_gemma":0.00001940625,"threshold_uncertainty_score":0.7775527},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9965307,0.00001889332,0.00028344232,0.000097593416,0.0007073917,0.00053762377,0.00004688232,0.00006389806,0.0017135751],"genre_scores_gemma":[0.99795735,0.000002028669,0.0015784362,0.000064720756,0.0000064601127,0.00008469583,0.000014776947,0.000025454417,0.00026609117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915916,0.000040171453,0.00030453666,0.00016679757,0.00014593922,0.00018342155],"domain_scores_gemma":[0.9984181,0.0006934311,0.00019682135,0.00043402018,0.00015015852,0.00010748068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047041813,0.00012790631,0.00025969133,0.00009047211,0.00007349022,0.000013789484,0.00021580035,0.00007745485,0.000014858337],"category_scores_gemma":[0.0005068672,0.00011880213,0.00011815815,0.00016306191,0.00005935354,0.00006335507,0.000031213895,0.00007450896,0.000026656298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008553016,0.00021576497,0.000058418274,0.000041144256,0.000030423278,3.4777938e-7,0.00018472163,4.2864866e-7,0.00076553674,0.9912188,0.0071172337,0.00028164324],"study_design_scores_gemma":[0.001118903,0.00024095882,0.00012072898,0.00003148857,0.00004425036,0.0000013806396,0.00006005522,0.000039283408,0.0053309216,0.9913042,0.0015843055,0.00012348527],"about_ca_topic_score_codex":0.0000054270395,"about_ca_topic_score_gemma":0.0000011337502,"teacher_disagreement_score":0.0055329283,"about_ca_system_score_codex":0.000021851494,"about_ca_system_score_gemma":0.000040120267,"threshold_uncertainty_score":0.484461},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97089547,0.000021073301,0.009826271,0.00018961544,0.0053588967,0.00016573025,0.0000013569901,0.00012753504,0.013414041],"genre_scores_gemma":[0.99966115,0.0000032460462,0.000082154234,0.00014389778,0.000010587368,0.000011929172,0.0000013112023,0.000010440007,0.00007526956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854404,0.00030499723,0.00027091446,0.00036114172,0.0002719778,0.00024692388],"domain_scores_gemma":[0.998481,0.0005496626,0.00010055317,0.00058495085,0.00020166834,0.00008218774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038611187,0.00015284431,0.00028022396,0.00014884338,0.00009665947,0.00004657528,0.0004782988,0.000106763764,0.000008726121],"category_scores_gemma":[0.0001453323,0.00013976167,0.00011281303,0.0005420503,0.000047884758,0.0001910286,0.000060701295,0.00018499781,0.00002219098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017916018,0.000118097574,0.00084497593,0.000008794362,0.000024755504,0.0000026896075,0.00035827854,0.000041808882,0.00056341715,0.99532366,0.001430416,0.0012652163],"study_design_scores_gemma":[0.0015860845,0.0010201843,0.019220036,0.00012160594,0.0000112949765,0.00001213246,0.000035248842,0.05845573,0.006844912,0.9115466,0.00079738064,0.0003487781],"about_ca_topic_score_codex":0.00013928096,"about_ca_topic_score_gemma":0.000013596879,"teacher_disagreement_score":0.083777025,"about_ca_system_score_codex":0.00003797341,"about_ca_system_score_gemma":0.000030451474,"threshold_uncertainty_score":0.56993157},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9960117,0.0008458128,0.00032379696,0.00068218925,0.0008788546,0.00025734378,0.0000011597325,0.00014085045,0.0008583176],"genre_scores_gemma":[0.99219257,0.00014655487,0.0073165484,0.00020271984,6.3499147e-7,0.000021603344,0.0000017942871,0.000012652691,0.000104924904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864197,0.000051500996,0.00031975587,0.00039398362,0.00026830152,0.00032446816],"domain_scores_gemma":[0.9987772,0.00012598961,0.00015920488,0.0005595787,0.0002146789,0.0001633524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022782589,0.00017578389,0.00025633886,0.00021584581,0.00013292735,0.000102496815,0.00055057264,0.00009656773,0.00001568083],"category_scores_gemma":[0.000024560899,0.00015913574,0.00007926999,0.00061477587,0.0001549345,0.000455935,0.00029623086,0.00013996912,0.000031414314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002025023,0.00006939749,0.004945911,0.000020880909,0.000023962313,0.0000025573163,0.00035618013,0.0000035020216,0.0036991355,0.9883124,0.001521969,0.0010420369],"study_design_scores_gemma":[0.00066183216,0.00015557463,0.0027680635,0.00003429728,0.000009690384,0.0000066856305,0.0000367893,0.0025723302,0.0060833734,0.987387,0.000095133524,0.00018923279],"about_ca_topic_score_codex":0.00014811534,"about_ca_topic_score_gemma":0.0000011608041,"teacher_disagreement_score":0.0069927513,"about_ca_system_score_codex":0.000005483527,"about_ca_system_score_gemma":0.000026988866,"threshold_uncertainty_score":0.64893675},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9886131,0.000027901917,0.00006844845,0.000046631067,0.0012501305,0.00015554101,6.22598e-7,0.00015523368,0.00968239],"genre_scores_gemma":[0.9961292,0.000004538811,0.0036234725,0.00015979294,3.5895886e-7,0.000015212504,9.2166965e-7,0.000015575219,0.0000509307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984801,0.00010815442,0.00036019573,0.00037723588,0.00036881168,0.00030554505],"domain_scores_gemma":[0.99855614,0.00009103106,0.00019328963,0.00088790635,0.00013670998,0.00013494868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037188688,0.00019299488,0.0002824612,0.00019264089,0.00009529591,0.000029393774,0.0007471103,0.00010228504,0.000054056713],"category_scores_gemma":[0.00005668948,0.00016906147,0.000118392556,0.00079974136,0.00007816231,0.000202017,0.00012654862,0.00017035475,0.00016393763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009126767,0.00027225164,0.011409759,0.000017422,0.00002988248,0.0000063102902,0.00092118426,6.634997e-7,0.0015072861,0.9850987,0.00038516268,0.00034223357],"study_design_scores_gemma":[0.0007705461,0.0002443455,0.006519503,0.00007205572,0.000010646332,0.000008328606,0.000016122307,0.00041282785,0.015131668,0.97660846,0.000006469441,0.00019904107],"about_ca_topic_score_codex":0.00019012163,"about_ca_topic_score_gemma":0.0000029813411,"teacher_disagreement_score":0.013624381,"about_ca_system_score_codex":0.000012813689,"about_ca_system_score_gemma":0.000047625177,"threshold_uncertainty_score":0.68941265},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99362147,0.0011699187,0.000014492722,0.000022868015,0.00036252936,0.00005106765,0.000002412301,0.000008084359,0.004747136],"genre_scores_gemma":[0.9994708,0.00004160338,0.00025805653,0.00009444905,0.000034135322,0.0000022368974,0.00001435001,0.000006817047,0.00007759939],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994344,0.000036300793,0.0001192106,0.00013338523,0.000058276404,0.0002184284],"domain_scores_gemma":[0.99967504,0.000015092246,0.000053511507,0.00014734342,0.000031543306,0.00007748828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020130113,0.00008347713,0.00010972356,0.000013195786,0.00003854795,0.000006857237,0.00009048073,0.00008016098,0.0000088511115],"category_scores_gemma":[0.000051150622,0.000067858324,0.000037466536,0.00004881085,0.0000644127,0.0000031836335,0.00016756612,0.00004926803,0.000003924214],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031143478,0.000160165,0.22944029,0.000019914927,0.000033529977,9.745052e-7,0.00004633961,0.0000014870409,0.69546545,0.069841675,0.00057966006,0.004379351],"study_design_scores_gemma":[0.002341318,0.0009862949,0.12655224,0.000036702364,0.00004167568,0.000027283158,0.0001431131,0.000053294407,0.8092284,0.039897017,0.020135323,0.0005573345],"about_ca_topic_score_codex":0.000009926269,"about_ca_topic_score_gemma":8.149506e-7,"teacher_disagreement_score":0.11376294,"about_ca_system_score_codex":0.0000034229938,"about_ca_system_score_gemma":0.000009529902,"threshold_uncertainty_score":0.27671823},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919574,0.0003504525,0.00007529839,0.0020293153,0.00352354,0.00019835682,8.2900164e-7,0.00011494276,0.0017498679],"genre_scores_gemma":[0.99594903,0.0000098514965,0.0034450628,0.00041198282,0.0000015824271,0.000011317615,5.4133574e-7,0.000009282159,0.00016133516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988137,0.00007496262,0.00027196293,0.00026314016,0.00031659423,0.00025963833],"domain_scores_gemma":[0.9986624,0.00010157186,0.00010042121,0.00084635103,0.0002169439,0.000072314884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025588684,0.000121735255,0.00015855665,0.000060146842,0.0001451905,0.000086797736,0.00102565,0.000055258643,0.000037182395],"category_scores_gemma":[0.0000776481,0.00008253583,0.00012327805,0.00052576297,0.000091230126,0.0003359929,0.0003729229,0.00015678971,0.00018216342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.9610406e-7,0.0000748566,0.0051249014,0.000009611743,0.000016304575,5.928657e-7,0.00024168327,0.00005663994,0.00798433,0.9800276,0.005501355,0.0009616315],"study_design_scores_gemma":[0.00043258475,0.000032957803,0.0038222135,0.000040014376,0.000008008049,0.000005461196,0.0000176893,0.0055159475,0.009246379,0.98045415,0.0002869023,0.00013768247],"about_ca_topic_score_codex":0.00023267351,"about_ca_topic_score_gemma":0.0000011335229,"teacher_disagreement_score":0.005459307,"about_ca_system_score_codex":0.000011314393,"about_ca_system_score_gemma":0.000044174896,"threshold_uncertainty_score":0.33657134},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57917315,0.00023735836,0.410023,0.0010103668,0.0074267765,0.00097268407,0.000023696095,0.0007920224,0.00034091898],"genre_scores_gemma":[0.9955841,0.000008008787,0.0035359077,0.0004800503,0.00009655764,0.000100438956,0.00010328834,0.000041044415,0.000050655555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726295,0.00019167805,0.00040055788,0.0007363683,0.00062916667,0.0007792715],"domain_scores_gemma":[0.99696356,0.0008372162,0.00021706088,0.0011415428,0.00048281133,0.0003578038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007605681,0.0003487388,0.00039354584,0.00014367879,0.00024476316,0.00029580845,0.0010750758,0.00028269226,0.0000041793846],"category_scores_gemma":[0.00040676145,0.00036881244,0.00015829524,0.0010930584,0.0000850512,0.00035958402,0.00017925967,0.0003749446,0.00003525175],"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.00015993652,0.00047293308,0.0020954905,0.000045342436,0.000055643362,0.000021644917,0.00023786997,0.037476968,0.000034794604,0.93405974,0.021112554,0.004227098],"study_design_scores_gemma":[0.0022738543,0.00051565835,0.000524411,0.00007235659,0.000021143507,0.000009386743,0.000021858332,0.94391286,0.001178209,0.046516452,0.004490563,0.0004632258],"about_ca_topic_score_codex":0.000021198892,"about_ca_topic_score_gemma":0.000003058643,"teacher_disagreement_score":0.9064359,"about_ca_system_score_codex":0.00036988576,"about_ca_system_score_gemma":0.00017587277,"threshold_uncertainty_score":0.9998764},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9884829,0.000004489187,0.000021009622,0.00037467288,0.0001152729,0.00045730814,0.0000029257728,0.00009652183,0.010444892],"genre_scores_gemma":[0.9990809,0.000004061522,0.00045071318,0.00007995948,0.0000023852724,0.00025681677,0.0000032618454,0.000018133818,0.00010375542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896884,0.00008976098,0.00020524232,0.00026500397,0.0002308848,0.00024024099],"domain_scores_gemma":[0.9987997,0.0005318696,0.000099219455,0.00040087808,0.00009402153,0.00007435157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019740591,0.0001561817,0.00020007836,0.0000871961,0.00009786395,0.000043769032,0.0002902839,0.00010086783,0.00027090163],"category_scores_gemma":[0.00011692641,0.00012780611,0.000039409962,0.00052809156,0.000086884174,0.00015284088,0.00003072108,0.00027644428,0.0003198153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013583318,0.00023287325,0.0109963855,0.00001398151,0.000013419201,0.0000041064045,0.00047268448,0.0000010397118,0.0002811604,0.98708355,0.000579162,0.00030803296],"study_design_scores_gemma":[0.0006394709,0.00008619976,0.014896625,0.000076856835,0.0000101209625,0.000005460884,0.00017266908,0.000031746364,0.0011426983,0.98269254,0.0000684321,0.00017715551],"about_ca_topic_score_codex":0.00014201822,"about_ca_topic_score_gemma":0.00006520063,"teacher_disagreement_score":0.010598005,"about_ca_system_score_codex":0.000024468643,"about_ca_system_score_gemma":0.00003385336,"threshold_uncertainty_score":0.5211782},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85036445,0.000037184498,0.020136988,0.00020349912,0.00018966463,0.00018980415,0.000034552693,0.00003039522,0.12881346],"genre_scores_gemma":[0.9974692,8.019e-7,0.0023109976,0.00001661902,0.000007370294,0.000014443501,0.000008489403,0.000008494422,0.0001635867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959874,0.000008147375,0.00011632775,0.00010666225,0.00007854775,0.00009154358],"domain_scores_gemma":[0.99953574,0.00011449062,0.000055954264,0.00016706773,0.00005371594,0.00007301449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048334838,0.000072595736,0.00012043862,0.000007645458,0.000048158396,0.000010260018,0.00006830793,0.000015891546,0.00010758792],"category_scores_gemma":[0.000008843275,0.000065670414,0.000026431811,0.00007975283,0.00006315212,0.000051418996,0.000029320378,0.000054730375,0.00005280143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009430228,0.00009585301,0.0020304874,0.0000045435913,0.000013791454,1.1167518e-7,0.000069276306,0.000013147729,0.000015831281,0.99616015,0.00085305906,0.000734329],"study_design_scores_gemma":[0.0003539029,0.000023720746,0.00016315073,0.000016229314,0.000009609062,3.2955035e-7,0.00012181955,0.00008017679,0.00048720354,0.9970287,0.0016427895,0.00007234814],"about_ca_topic_score_codex":0.00001780966,"about_ca_topic_score_gemma":9.393041e-7,"teacher_disagreement_score":0.14710474,"about_ca_system_score_codex":0.000009488812,"about_ca_system_score_gemma":0.000013397096,"threshold_uncertainty_score":0.2677962},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99611413,0.00003304742,3.0778963e-8,0.0007865114,0.00003627819,0.000057501573,0.0000018764794,0.000010498271,0.002960123],"genre_scores_gemma":[0.9997664,0.000012313025,0.000005442337,0.000074234675,0.0000070481965,0.000006632813,0.0000020152138,4.1309255e-7,0.0001254724],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9995224,0.00002138434,0.000077382254,0.0001224994,0.00014253956,0.00011378998],"domain_scores_gemma":[0.99961746,0.00020130868,0.00004699099,0.00005233772,0.00003919448,0.000042734133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000058072274,0.00007366678,0.00009460856,0.0000021070546,0.000087094115,0.000035566783,0.0001467322,0.000041073636,0.0006383755],"category_scores_gemma":[0.000025081321,0.000020452298,0.00002698296,0.00014105222,0.00009593226,0.00007574344,0.000024000765,0.00008571468,0.000024519079],"study_design_candidate":"observational","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.00015855407,0.00055298005,0.3198145,0.000035703048,0.0002668828,0.000012159766,0.0005962237,0.00000448854,0.40606987,0.25941426,0.0055474318,0.007526952],"study_design_scores_gemma":[0.00046014244,0.00078817375,0.55912125,0.000065001484,0.000079028265,0.000016401356,0.0011649043,0.000073740666,0.23602472,0.20117192,0.0006512231,0.00038351316],"about_ca_topic_score_codex":0.00038716898,"about_ca_topic_score_gemma":0.000042225063,"teacher_disagreement_score":0.23930675,"about_ca_system_score_codex":0.000005041661,"about_ca_system_score_gemma":0.0000032865369,"threshold_uncertainty_score":0.6989764},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937699,0.00014640667,0.00008351111,0.0003551446,0.00021768746,0.00021967954,0.0000036977033,0.000039081544,0.0051649148],"genre_scores_gemma":[0.999638,0.000035639085,0.000095428855,0.000024045048,0.0000037659515,0.000031374624,8.424271e-7,0.000011097745,0.00015976485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993215,0.00011110246,0.00020897435,0.00011095433,0.00012200267,0.00012545809],"domain_scores_gemma":[0.99804676,0.0011748427,0.00012507652,0.0005627123,0.000044407385,0.000046221307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007527462,0.00008348146,0.00017053548,0.0000409349,0.00019866756,0.000017396525,0.00028280084,0.000049812596,0.000008269463],"category_scores_gemma":[0.0004928296,0.000057891426,0.00006308129,0.00018408426,0.00017777986,0.00003459474,0.00006560527,0.00009362015,0.0000033974472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027236314,0.000050544415,0.0013348978,0.0000165743,0.000022965363,1.0097614e-7,0.00013793612,6.345268e-8,0.00008056419,0.9950454,0.0016684344,0.0016152388],"study_design_scores_gemma":[0.0016934988,0.000045373356,0.0015513285,0.000011937151,0.000026123327,0.0000013150402,0.000067421024,0.000033861168,0.0005435902,0.99257016,0.003389068,0.000066326975],"about_ca_topic_score_codex":0.0000052487076,"about_ca_topic_score_gemma":0.0000066558905,"teacher_disagreement_score":0.005868165,"about_ca_system_score_codex":0.000003510306,"about_ca_system_score_gemma":0.000008798852,"threshold_uncertainty_score":0.23607437},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98842645,0.0000051244815,0.000006995536,0.0005314678,0.0003986514,0.0001825291,0.0000048416364,0.000042121996,0.010401845],"genre_scores_gemma":[0.9993478,0.0000027350122,0.00040429874,0.00007638769,0.0000040465516,0.00003743608,8.778088e-7,0.000011601472,0.00011478303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947435,0.000044355013,0.00014608544,0.00010153306,0.00012878599,0.000104918174],"domain_scores_gemma":[0.9985166,0.0007721761,0.000087112196,0.0005435809,0.0000502204,0.000030299501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039717232,0.00007781688,0.000104349456,0.000035833702,0.00011839982,0.000009154029,0.00026951148,0.00005434127,0.00009801212],"category_scores_gemma":[0.0002594443,0.0000515209,0.000079965124,0.00018578842,0.00012670258,0.00002294906,0.00002828376,0.00020994653,0.00004186267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039862375,0.00014372113,0.00017860567,0.000006624941,0.000011369125,2.26374e-7,0.00026367384,6.316813e-8,0.007577336,0.98991656,0.0017066011,0.00019123987],"study_design_scores_gemma":[0.00013000725,0.00003145844,0.00052015204,0.000008324665,0.000015079608,9.019233e-7,0.000035994803,0.000008642273,0.03416164,0.96354425,0.0014865542,0.000056969886],"about_ca_topic_score_codex":0.0000043459213,"about_ca_topic_score_gemma":0.00000425101,"teacher_disagreement_score":0.026584303,"about_ca_system_score_codex":0.0000026165467,"about_ca_system_score_gemma":0.00001238334,"threshold_uncertainty_score":0.21009614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9400153,0.00036312712,0.00048546324,0.0050098854,0.0040618354,0.00019825199,7.124884e-7,0.000817146,0.04904824],"genre_scores_gemma":[0.9957858,0.000011916243,0.0020279346,0.0017997964,6.443349e-7,0.000002207496,0.0000011455779,0.000005762333,0.00036483776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988233,0.000046465244,0.00017651319,0.00036395856,0.00029832093,0.0002914747],"domain_scores_gemma":[0.99900615,0.000059695365,0.000057741803,0.0006810678,0.000067810004,0.00012754377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022672096,0.0001416711,0.00013891484,0.00015282162,0.000120793164,0.00010777074,0.0006300019,0.00006107555,0.000012214681],"category_scores_gemma":[0.00003407574,0.00012589298,0.00007707272,0.00056274707,0.000028569902,0.00018702826,0.00005771043,0.00016081105,0.00038610288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029254015,0.00012920993,0.00007770354,0.0000011882021,0.000004016333,0.000009245837,0.00004858454,0.000015498588,0.00039727695,0.98299444,0.01257385,0.0037460704],"study_design_scores_gemma":[0.00052511966,0.00033961594,0.0014015511,0.000018799827,0.000002694407,0.0000060861976,0.0000025620238,0.0010952599,0.0009996613,0.99465466,0.0007924022,0.00016160074],"about_ca_topic_score_codex":0.00000693497,"about_ca_topic_score_gemma":2.5268375e-7,"teacher_disagreement_score":0.05577042,"about_ca_system_score_codex":0.000015424983,"about_ca_system_score_gemma":0.000024377723,"threshold_uncertainty_score":0.5133767},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98684424,0.00005216953,0.00062968617,0.00037673913,0.0008693779,0.0003065593,0.000008314987,0.00009165287,0.010821231],"genre_scores_gemma":[0.9759017,0.0000073202323,0.023826161,0.00001777243,0.0000124326025,0.00003878974,0.0000017407708,0.000038670136,0.00015541118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983821,0.00006866914,0.0005210727,0.00027022348,0.00037021365,0.00038775158],"domain_scores_gemma":[0.9962725,0.0027953496,0.00014360885,0.0004902065,0.0001829279,0.00011541919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045516726,0.00021719944,0.00048314282,0.000112597205,0.000050141425,0.00003281238,0.00029794403,0.00016614402,0.0002999494],"category_scores_gemma":[0.00614396,0.00019612315,0.00008990387,0.00031170962,0.00040078888,0.00024816656,0.00013688137,0.0005022662,0.000034015768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013371889,0.00039657278,0.0016890399,0.00034343541,0.00001336399,0.000012341429,0.000512854,0.000003427627,0.0026303483,0.9941426,0.00007429178,0.00016838829],"study_design_scores_gemma":[0.00064596103,0.0001049269,0.00065018673,0.00013245446,0.000018197488,0.000007880383,0.00012339787,0.00020352115,0.0031608152,0.9945619,0.00018692385,0.00020383832],"about_ca_topic_score_codex":0.000005732348,"about_ca_topic_score_gemma":0.00007138088,"teacher_disagreement_score":0.023196476,"about_ca_system_score_codex":0.000022166381,"about_ca_system_score_gemma":0.00006119246,"threshold_uncertainty_score":0.79976696},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9798729,0.00032874424,0.0003771875,0.00026271248,0.0002061009,0.00028862618,0.0000062067706,0.00009896777,0.018558543],"genre_scores_gemma":[0.9946522,0.00007382782,0.0048016594,0.00004483724,0.000012566029,0.00007509527,0.0000030947047,0.000017660905,0.00031905074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937606,0.000017987633,0.00020223985,0.00007897588,0.00011927931,0.00020543145],"domain_scores_gemma":[0.99937344,0.00019620887,0.000055712288,0.00023278779,0.000032144028,0.00010973299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021822909,0.00010068745,0.00014419848,0.000039099446,0.00012616639,0.000027629467,0.00009088206,0.000049648563,0.00007991226],"category_scores_gemma":[0.000048743466,0.00008968691,0.00003422845,0.000094202216,0.000035174227,0.00015881908,0.0000229653,0.00007663418,0.00009698943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.980433e-7,0.00016906144,0.0003158964,0.000056108816,0.000011536311,8.3409155e-8,0.0010011116,6.135014e-8,0.00017695232,0.98880184,0.008886337,0.0005802974],"study_design_scores_gemma":[0.00028091652,0.000013463311,0.00039992476,0.00001381749,0.00003618363,0.0000133723515,0.00015262615,0.00012535487,0.0012036047,0.9752109,0.022414675,0.00013517283],"about_ca_topic_score_codex":0.0000031429854,"about_ca_topic_score_gemma":6.9944605e-7,"teacher_disagreement_score":0.018239493,"about_ca_system_score_codex":0.000012696495,"about_ca_system_score_gemma":0.000009033391,"threshold_uncertainty_score":0.3657326},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98121303,0.00038525162,0.0008371803,0.003367796,0.0033040023,0.00018358513,0.0000016569364,0.00081790204,0.009889581],"genre_scores_gemma":[0.9956011,0.000013394498,0.0012478075,0.002966389,6.339542e-7,0.0000038158487,0.0000018088269,0.0000064037185,0.00015864853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987297,0.000048285285,0.00017780547,0.00037188528,0.00030371122,0.00036860313],"domain_scores_gemma":[0.99900657,0.000055864577,0.000059641814,0.00067033013,0.00007204886,0.00013552753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028836867,0.00014544095,0.0001455036,0.0001425924,0.0001894527,0.00011052616,0.0006200471,0.00006716278,0.000009361136],"category_scores_gemma":[0.000038541595,0.00013108591,0.00008141136,0.00052367593,0.00001890522,0.0001795166,0.00006854386,0.00017283471,0.00024134638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032767732,0.00022372951,0.00009580621,0.0000011622423,0.000005128753,0.000019289673,0.00009875037,0.00000737581,0.0003201901,0.9842108,0.012740159,0.0022743507],"study_design_scores_gemma":[0.0008143883,0.00033922234,0.0013465261,0.00001632127,0.0000028254206,0.0000053923022,0.0000024017909,0.0012314613,0.001421128,0.99368566,0.0009668324,0.00016781631],"about_ca_topic_score_codex":0.000005086912,"about_ca_topic_score_gemma":3.3124167e-7,"teacher_disagreement_score":0.014388053,"about_ca_system_score_codex":0.000015954014,"about_ca_system_score_gemma":0.000024740311,"threshold_uncertainty_score":0.5345528},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9795766,0.00014880419,0.004900024,0.00009930929,0.00079334376,0.00031956582,0.000002002178,0.00018691951,0.013973416],"genre_scores_gemma":[0.9971857,0.000011177905,0.0023823592,0.00012766306,0.0000014514482,0.00004290241,0.000001048671,0.000015996657,0.00023170208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984111,0.00017071809,0.00022949697,0.00041424955,0.00033486437,0.00043954395],"domain_scores_gemma":[0.99871004,0.00021810636,0.000063240535,0.0008364396,0.000042319614,0.0001298569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045472497,0.00015592629,0.0001885053,0.00018164096,0.000066437104,0.00004384607,0.0012136209,0.000067412235,0.000048105012],"category_scores_gemma":[0.00012387091,0.00015057882,0.000047799946,0.0006434204,0.00007110815,0.0004150529,0.0002563119,0.00025813343,0.00034934637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012194487,0.00024183988,0.0009625883,0.0000072975627,0.0000059528475,0.000047293182,0.0007677713,0.0000026064365,0.0005334026,0.99363476,0.001038076,0.0027461904],"study_design_scores_gemma":[0.0006317116,0.00024578423,0.0026691176,0.000030896124,8.845536e-7,0.0000034030818,0.000019796746,0.001562992,0.0072583263,0.98732555,0.000079244,0.00017230173],"about_ca_topic_score_codex":0.000031569445,"about_ca_topic_score_gemma":0.000002255275,"teacher_disagreement_score":0.017609082,"about_ca_system_score_codex":0.00007778951,"about_ca_system_score_gemma":0.000037458765,"threshold_uncertainty_score":0.61404264},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8449961,0.00043308095,0.138603,0.00063854415,0.00546274,0.0008066991,0.000010136313,0.002835467,0.006214261],"genre_scores_gemma":[0.9547841,0.000011164591,0.044698477,0.00030160803,0.000012778926,0.000037304602,0.0000028752518,0.0000293973,0.00012229505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793285,0.00012788507,0.00030657958,0.00079784455,0.0003925813,0.00044225916],"domain_scores_gemma":[0.9979485,0.0003766429,0.00020195515,0.0011753736,0.00016313598,0.00013439466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074366713,0.0002899212,0.00031681327,0.00027982352,0.00024499977,0.00013572755,0.00096043193,0.00009373099,0.000012486534],"category_scores_gemma":[0.0004448207,0.00029579326,0.000057315116,0.000694546,0.00011683755,0.00039883383,0.0002727023,0.00035443276,0.000022664397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068977824,0.00046740088,0.017993327,0.00009163112,0.000030688963,0.00008894836,0.0013269207,0.00004681191,0.00073546596,0.9658489,0.0020754044,0.011225511],"study_design_scores_gemma":[0.0029056475,0.0030581176,0.038691226,0.0010128899,0.00006505438,0.000045405286,0.00015338733,0.084536776,0.188711,0.6743067,0.003830744,0.0026830616],"about_ca_topic_score_codex":0.00020624952,"about_ca_topic_score_gemma":0.000023882698,"teacher_disagreement_score":0.29154223,"about_ca_system_score_codex":0.0001391264,"about_ca_system_score_gemma":0.00008018681,"threshold_uncertainty_score":0.9999494},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6222976,0.0014104424,0.09321367,0.0076442664,0.010195209,0.000775282,0.0000051265592,0.010391881,0.2540665],"genre_scores_gemma":[0.97401553,0.0000059864856,0.025262425,0.0005155215,0.000006648212,0.000020066705,0.0000020195944,0.0000132581945,0.00015852552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876904,0.000038810053,0.00019446088,0.0003496883,0.00034929885,0.0002986736],"domain_scores_gemma":[0.9988877,0.000029703657,0.0001005741,0.00058937137,0.00019849565,0.00019416508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040395884,0.00014770984,0.00015596129,0.00013487806,0.00006655301,0.00060518057,0.001307896,0.000059535083,0.000001512882],"category_scores_gemma":[0.00012789025,0.00014469083,0.00004517534,0.0006308447,0.0000797986,0.002260501,0.0003988125,0.00013935224,0.00010223575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020323641,0.00007489826,0.0010562902,0.00001008964,0.0000080339305,0.000050439645,0.00045787197,2.3383912e-7,0.0019263853,0.9757762,0.003281679,0.017355848],"study_design_scores_gemma":[0.00023278105,0.00009144067,0.00033134455,0.000037390302,0.0000024423534,0.000033588927,0.000016987788,0.00097434275,0.019360138,0.9733866,0.005292452,0.0002404878],"about_ca_topic_score_codex":0.0000127253425,"about_ca_topic_score_gemma":4.0566454e-7,"teacher_disagreement_score":0.35171795,"about_ca_system_score_codex":0.00006061374,"about_ca_system_score_gemma":0.00014926701,"threshold_uncertainty_score":0.59003204},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96544784,0.00013215306,0.029187683,0.0008635162,0.0034326448,0.00025118783,0.0000018649449,0.000061269486,0.000621812],"genre_scores_gemma":[0.9974481,0.000004944302,0.0020703133,0.00021613308,0.000011188889,0.000022648728,0.000005983471,0.000006008792,0.00021470913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988125,0.000098609424,0.00024486915,0.0002465433,0.0003954718,0.00020202338],"domain_scores_gemma":[0.99906397,0.00008631089,0.00012592596,0.00043668767,0.00021998677,0.000067145724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021957236,0.00011655345,0.00012843842,0.00013443406,0.00014657059,0.00006179945,0.00044774366,0.00007355585,0.00004068516],"category_scores_gemma":[0.00004530918,0.000092122995,0.00009472679,0.0011083386,0.000078532714,0.0004580518,0.0002675983,0.00013312473,0.00008035595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004162001,0.00017717054,0.0038645708,0.000016645034,0.000023222865,0.00000137433,0.00023436238,0.0014088422,0.0020132866,0.9670741,0.010616317,0.014565966],"study_design_scores_gemma":[0.0007225554,0.00011494817,0.22741103,0.00002441667,0.000009598114,0.000021444526,0.000029685,0.07310209,0.011724005,0.6854893,0.0011155558,0.00023536875],"about_ca_topic_score_codex":0.000079005855,"about_ca_topic_score_gemma":0.0000037197788,"teacher_disagreement_score":0.28158477,"about_ca_system_score_codex":0.000042753767,"about_ca_system_score_gemma":0.00007431187,"threshold_uncertainty_score":0.37566668},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99459213,0.00011691542,0.0019165264,0.000028388478,0.0003688001,0.000104838015,8.027759e-7,0.000059847753,0.0028117541],"genre_scores_gemma":[0.98166746,0.00003068551,0.01823341,0.00003634937,4.530409e-7,0.0000070968736,1.6745862e-7,0.0000060580146,0.000018320989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914014,0.000079057005,0.00014167215,0.00023636413,0.00018496925,0.0002177999],"domain_scores_gemma":[0.9991653,0.00010739392,0.000058185844,0.00049761723,0.00007110326,0.0001004165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027805066,0.000087730645,0.00014841477,0.00012017242,0.000052906216,0.000014863666,0.00060929713,0.000039087878,0.0000053120984],"category_scores_gemma":[0.00005996055,0.00008223695,0.00004061082,0.0004168136,0.00020547901,0.00029268593,0.0002718775,0.00010995985,0.000006807465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009138933,0.000056958903,0.00882811,0.0000074290556,0.000011688193,0.000004773634,0.0005674778,2.5040185e-7,0.000622269,0.9848321,0.000028605415,0.0050311894],"study_design_scores_gemma":[0.00028372803,0.00013547884,0.016285872,0.0000067374526,0.0000023319421,0.000004190475,0.000018592493,0.00019623397,0.018211547,0.9647339,0.00003275737,0.000088614055],"about_ca_topic_score_codex":0.00004520238,"about_ca_topic_score_gemma":0.0000011824409,"teacher_disagreement_score":0.020098194,"about_ca_system_score_codex":0.000007433039,"about_ca_system_score_gemma":0.000017270342,"threshold_uncertainty_score":0.3353525},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99774814,0.000011677385,0.00029409854,0.00012902897,0.0003116958,0.0003996162,0.000012897595,0.000105220264,0.0009876325],"genre_scores_gemma":[0.99813867,0.000003877982,0.0015236036,0.000075174015,0.000008620423,0.00013361315,0.00005794058,0.000023408591,0.000035098783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924755,0.00007744034,0.00021071002,0.00019766166,0.000077513774,0.00018914777],"domain_scores_gemma":[0.9991078,0.00030772545,0.00007743231,0.00036538547,0.00007711076,0.00006455295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036363633,0.00010996157,0.00017169477,0.00009839909,0.00011829746,0.000023244209,0.00017432951,0.000086524,0.000026081785],"category_scores_gemma":[0.00007861114,0.00010919105,0.000051632873,0.00026556113,0.000043628144,0.00010286737,0.000013158858,0.00008611298,0.000020738655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002701902,0.00024348829,0.0008680779,0.000023006793,0.00000896988,1.7803907e-7,0.00013498202,4.866749e-7,0.002686962,0.99428654,0.0013378813,0.00038239622],"study_design_scores_gemma":[0.0007295935,0.0001477357,0.0024570185,0.000017042768,0.000017642109,0.0000012917882,0.000052556243,0.0003544493,0.004830542,0.9896943,0.0015630962,0.00013472978],"about_ca_topic_score_codex":0.000009884358,"about_ca_topic_score_gemma":0.000015256269,"teacher_disagreement_score":0.0045922496,"about_ca_system_score_codex":0.000016981801,"about_ca_system_score_gemma":0.000011773965,"threshold_uncertainty_score":0.44526818},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9941959,0.00007783044,0.0028713215,0.0006285917,0.00022850737,0.00021321607,4.972115e-7,0.00015520545,0.0016289226],"genre_scores_gemma":[0.99251765,0.000008746942,0.007295541,0.00011707218,0.0000025254728,0.000016140826,7.3092554e-7,0.00000965155,0.00003196912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983859,0.00016609048,0.00017593525,0.00044605436,0.00036583573,0.0004601968],"domain_scores_gemma":[0.99880356,0.00034517428,0.00007127263,0.0005928206,0.00008694323,0.00010025285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005460089,0.00015988635,0.00021795576,0.00029860265,0.00012623894,0.00009950774,0.0008382266,0.000054085944,0.0000042727706],"category_scores_gemma":[0.000110340974,0.00014239908,0.000036303085,0.00130548,0.000086224005,0.0007188597,0.00012429885,0.00029388437,0.000014416775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025416002,0.00013029134,0.0050481004,0.0000033056795,0.0000050833046,0.00008114674,0.00029896118,0.000060425493,0.0010778519,0.9790206,0.000019775254,0.014229026],"study_design_scores_gemma":[0.0012034443,0.00033227648,0.060682815,0.00004327603,0.0000012498778,0.000012990271,0.000041174702,0.0007475677,0.004170274,0.93256027,0.000015664407,0.00018897899],"about_ca_topic_score_codex":0.00003200762,"about_ca_topic_score_gemma":0.000017880222,"teacher_disagreement_score":0.055634715,"about_ca_system_score_codex":0.00006371256,"about_ca_system_score_gemma":0.000049254402,"threshold_uncertainty_score":0.58068657},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930302,0.00079598336,0.00009900279,0.000014156863,0.003308233,0.000872589,0.000007258514,0.00029749077,0.0015751027],"genre_scores_gemma":[0.9992175,0.000008592377,0.0000590062,0.000007334316,0.000033635453,0.0004425179,0.000005948325,0.000038546146,0.00018689029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924725,0.00004088549,0.0001595523,0.00018207877,0.00011041003,0.0002598036],"domain_scores_gemma":[0.999483,0.00009816069,0.000031937598,0.00021665539,0.000071063536,0.00009916738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018137475,0.00017332436,0.00023121372,0.00007094315,0.00011292572,0.000076162476,0.00012700012,0.00008852817,0.000005676328],"category_scores_gemma":[0.000010278387,0.00014345122,0.000048765873,0.00015316243,0.000038893995,0.00020824152,0.000015932968,0.0001005478,0.00003689627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022674854,0.00019001054,0.025730848,0.0051758313,0.0013838056,0.000019109355,0.0089965835,0.0011982888,0.0106113255,0.88283634,0.0588868,0.0047443355],"study_design_scores_gemma":[0.03778659,0.0055386494,0.04876585,0.0039448133,0.00144171,0.0005324574,0.03774457,0.09205887,0.06405806,0.6130912,0.08715527,0.007882011],"about_ca_topic_score_codex":0.000053678737,"about_ca_topic_score_gemma":0.0000052621845,"teacher_disagreement_score":0.26974517,"about_ca_system_score_codex":0.000029536479,"about_ca_system_score_gemma":0.000007887917,"threshold_uncertainty_score":0.5849771},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95750815,0.00014879084,0.00000860842,0.000028038588,0.007648356,0.0002482118,0.0000050683566,0.0001240924,0.034280676],"genre_scores_gemma":[0.9993454,0.000005014407,0.000005853744,0.000012952263,0.000013521435,0.000038543352,0.0000016924372,0.000024771647,0.00055225636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921155,0.00006492364,0.00024340519,0.000118820746,0.00017931123,0.0001820043],"domain_scores_gemma":[0.99912083,0.00020106682,0.00005387399,0.0005280285,0.000047293324,0.000048885715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038583676,0.0001344599,0.00019446008,0.000050388764,0.00006425799,0.00002560124,0.00031465897,0.00009223465,0.000071357674],"category_scores_gemma":[0.000054478034,0.00009549158,0.00006789786,0.00020497954,0.000058548598,0.000051094517,0.000018211562,0.0002629532,0.00010878993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008532551,0.000027176973,0.00015879759,0.000060310984,0.00003035928,0.0000020055625,0.00013648588,0.00018091053,0.009959648,0.9867366,0.0026564747,0.000042689477],"study_design_scores_gemma":[0.0028455537,0.00039287898,0.0024932323,0.00037696207,0.000071690956,0.000038806455,0.0013153676,0.013518009,0.055264745,0.88130563,0.04140944,0.0009676719],"about_ca_topic_score_codex":0.000022249176,"about_ca_topic_score_gemma":0.0000044049443,"teacher_disagreement_score":0.10543097,"about_ca_system_score_codex":0.000009740768,"about_ca_system_score_gemma":0.000008711821,"threshold_uncertainty_score":0.38940337},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9980203,0.000036706,0.00008556869,0.0001343854,0.00014410671,0.00011010978,0.0000053833332,0.000051255174,0.0014121684],"genre_scores_gemma":[0.9996222,0.00000971072,0.00025429923,0.00002801748,0.0000018942742,0.0000044354924,0.000005011674,0.0000066657444,0.000067759334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946994,0.000028888579,0.00017579652,0.00012082032,0.00010320297,0.00010137844],"domain_scores_gemma":[0.9993793,0.00022798053,0.00009539211,0.00018866362,0.00005999201,0.000048671685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001162837,0.00008839721,0.000147,0.00005983279,0.00008698179,0.000009309851,0.00008945264,0.00006354692,0.000042053176],"category_scores_gemma":[0.00006164487,0.00008088951,0.000047191166,0.00021827876,0.000053865948,0.000082575854,0.000012739601,0.00009338933,0.000002633763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010828465,0.00018624177,0.0025381432,0.000008616111,0.000016687658,3.950591e-7,0.00017023517,1.7842918e-7,0.0013768639,0.9949842,0.0004758312,0.00023179682],"study_design_scores_gemma":[0.00027439135,0.00007059468,0.018207172,0.000011769386,0.000021760781,0.0000026554717,0.00006818173,0.000021234124,0.0022973043,0.9787233,0.00021903294,0.000082629325],"about_ca_topic_score_codex":0.0000037493523,"about_ca_topic_score_gemma":4.9210445e-7,"teacher_disagreement_score":0.016260907,"about_ca_system_score_codex":0.0000061126066,"about_ca_system_score_gemma":0.000009964202,"threshold_uncertainty_score":0.32985786},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98937094,0.000015142399,0.0011243476,0.0018051646,0.00036667203,0.00022060469,0.0000012633619,0.00007886138,0.0070170253],"genre_scores_gemma":[0.99831384,0.0000063388156,0.001297374,0.00026556553,0.0000043096065,0.000009303674,0.0000017156314,0.0000071208397,0.00009445671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985593,0.00023992853,0.00018561482,0.00028785842,0.00046292393,0.00026436907],"domain_scores_gemma":[0.9984317,0.00028255547,0.00008562234,0.0009681473,0.00015319142,0.00007881356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073626457,0.00011697846,0.00012913802,0.00010325012,0.00017110087,0.000084786276,0.0011589011,0.000054190245,0.000026952603],"category_scores_gemma":[0.00012636158,0.00008604759,0.00006649972,0.0007032681,0.00013234824,0.00046195398,0.000052531,0.0001962333,0.000036973466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024045523,0.00016770892,0.00049433374,0.0000016256905,0.0000058282717,0.0000042578163,0.00028793135,0.0000068228305,0.0024886262,0.99137187,0.00025787967,0.004889045],"study_design_scores_gemma":[0.0003931729,0.00029670857,0.015292274,0.000012127831,0.00000179725,0.000004282144,0.000028049546,0.00079811906,0.0079785595,0.9749717,0.00012539457,0.000097806675],"about_ca_topic_score_codex":0.0000045304946,"about_ca_topic_score_gemma":6.274126e-7,"teacher_disagreement_score":0.016400188,"about_ca_system_score_codex":0.000029470979,"about_ca_system_score_gemma":0.000040291994,"threshold_uncertainty_score":0.35089192},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9968478,0.00010114551,0.00017660408,0.000033624623,0.00013804935,0.00015542521,0.0000018332166,0.000047799556,0.0024977361],"genre_scores_gemma":[0.999108,0.000005574745,0.0007438537,0.000009651478,0.0000055578253,0.0000309862,0.0000013917838,0.000016358266,0.00007863883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994079,0.000038416998,0.00016478106,0.00009006417,0.00010996948,0.00018887913],"domain_scores_gemma":[0.9992879,0.00023481832,0.00010636784,0.0002655418,0.000039420967,0.00006597168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002570016,0.00009587868,0.00016819859,0.000047669942,0.00007431959,0.000008816901,0.00014540966,0.000038632603,0.000043594893],"category_scores_gemma":[0.000050605635,0.00007488248,0.00003830712,0.00017763487,0.00006566175,0.00009611236,0.00003277477,0.000081298116,0.000010058636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003828878,0.00025600032,0.034024853,0.000045213583,0.00004019827,4.183875e-7,0.0007289744,0.0000011885813,0.000977336,0.9636527,0.000060508723,0.00017435067],"study_design_scores_gemma":[0.0010404879,0.00006689088,0.015276539,0.00005184609,0.000068056004,0.000005300506,0.0003097537,0.000025239504,0.010270047,0.9722296,0.0005220314,0.0001342213],"about_ca_topic_score_codex":0.00001286334,"about_ca_topic_score_gemma":0.000020701447,"teacher_disagreement_score":0.018748313,"about_ca_system_score_codex":0.000008767861,"about_ca_system_score_gemma":0.0000137462175,"threshold_uncertainty_score":0.3053619},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98494625,0.00004781915,0.000005300735,0.0013833323,0.00043379367,0.0004099208,0.0000012993612,0.00012097646,0.01265128],"genre_scores_gemma":[0.9981635,0.000024628094,0.00004741551,0.0001738432,0.0000052328382,0.00028241618,0.0000013411369,0.000021000516,0.0012805854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917185,0.00007434058,0.00018857846,0.000163693,0.00016193718,0.00023959052],"domain_scores_gemma":[0.99841046,0.0007621806,0.000084169274,0.0006157883,0.000055241904,0.00007217136],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025090584,0.0001219101,0.000110315465,0.00004677191,0.0004258121,0.00007835963,0.00036505458,0.00006243377,0.000122873],"category_scores_gemma":[0.00012428776,0.00008208788,0.00008697726,0.0002771435,0.00010805363,0.00006844059,0.000045190518,0.000201706,0.0009303414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003439072,0.00010357785,0.00047634044,0.000003777231,0.00002116415,2.999831e-7,0.0000646455,9.003886e-8,0.0001911326,0.97483623,0.023054847,0.0012444606],"study_design_scores_gemma":[0.0002731652,0.000036886762,0.0038659307,0.000009494171,0.000010120463,0.0000012543268,0.000051997104,0.000027928683,0.0010172277,0.9886739,0.005928797,0.000103269835],"about_ca_topic_score_codex":0.000015188535,"about_ca_topic_score_gemma":0.0000022979066,"teacher_disagreement_score":0.017126052,"about_ca_system_score_codex":0.00001669175,"about_ca_system_score_gemma":0.000012586015,"threshold_uncertainty_score":0.99984753},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.976002,0.00036480153,0.0025296486,0.000231205,0.01235742,0.00033495494,0.000005260411,0.00023951687,0.007935227],"genre_scores_gemma":[0.99729866,0.000003250279,0.0024471332,0.000074275486,0.000045844023,0.000026761396,0.000005495132,0.00001534183,0.000083265135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981092,0.00016855924,0.00039030547,0.0004196844,0.0005374424,0.00037475867],"domain_scores_gemma":[0.99832165,0.0000899723,0.00021791735,0.00087473344,0.00025529158,0.00024042334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077648176,0.0002077669,0.00034305517,0.00012021416,0.00006402959,0.00009527898,0.0013888576,0.00008639319,0.000010129984],"category_scores_gemma":[0.00012945574,0.00019408323,0.00009983039,0.00055536884,0.00010631731,0.00051977433,0.00047126526,0.00017904108,0.000033632805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018316861,0.00025155145,0.0009846372,0.000013092789,0.00001895584,0.000017544122,0.00073310063,0.000008252609,0.00044072932,0.9886068,0.0028350567,0.0060719284],"study_design_scores_gemma":[0.0027526007,0.00037397604,0.00039514623,0.000043721942,0.000009385636,0.000020620599,0.000023683095,0.0063905576,0.016857684,0.97191894,0.0009467164,0.00026699426],"about_ca_topic_score_codex":0.000050044015,"about_ca_topic_score_gemma":0.0000010899028,"teacher_disagreement_score":0.021296669,"about_ca_system_score_codex":0.0000735229,"about_ca_system_score_gemma":0.00025114385,"threshold_uncertainty_score":0.7914484},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.996296,0.00026138843,0.000026148022,0.00014398989,0.0018463103,0.000028111719,8.382654e-7,0.000038616246,0.001358629],"genre_scores_gemma":[0.9996401,0.000008221716,0.00012508126,0.000033722226,0.0000063150037,0.000002272117,0.000004931922,0.0000082014085,0.00017112096],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994597,0.00002404745,0.00014287596,0.00009016732,0.00017963703,0.00010356192],"domain_scores_gemma":[0.9997049,0.00006286703,0.000018918416,0.000076629585,0.000036252935,0.0001004166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021155499,0.000069038426,0.00013871967,0.00009539747,0.000011136011,0.00000689169,0.00004073341,0.000046677185,0.000017472212],"category_scores_gemma":[0.000099747005,0.00006436389,0.000021688455,0.00017369092,0.000039058854,0.000064151216,0.000023917744,0.00012383853,0.000009361069],"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.00009011999,0.00061939715,0.42447364,0.0002666937,0.000312798,0.00008765157,0.0039122757,0.13111366,0.006116843,0.016553113,0.39405903,0.022394752],"study_design_scores_gemma":[0.0023542636,0.000052358006,0.0135153765,0.00015987393,0.000036913294,0.00001807142,0.0003108286,0.95640725,0.0019531804,0.021956863,0.0029657288,0.0002693025],"about_ca_topic_score_codex":0.00006366426,"about_ca_topic_score_gemma":0.000007339424,"teacher_disagreement_score":0.8252936,"about_ca_system_score_codex":0.000031276068,"about_ca_system_score_gemma":0.000017851518,"threshold_uncertainty_score":0.26246834},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927649,0.00006401769,0.004527853,0.00024857998,0.00034258113,0.0002030315,0.000004381078,0.000058625323,0.0017860119],"genre_scores_gemma":[0.9968504,0.000010555931,0.0029839678,0.00010187222,0.000001392357,0.0000029296411,0.000002088034,0.0000066227435,0.000040219722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985753,0.00010879182,0.0002929234,0.0002637492,0.0004958033,0.00026339944],"domain_scores_gemma":[0.9987287,0.00022321507,0.00015116474,0.00067181996,0.00014887247,0.00007624526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004730488,0.0001241833,0.00025266805,0.00022972362,0.000060801096,0.000015026205,0.0010226296,0.000036196154,0.000016819879],"category_scores_gemma":[0.0000792557,0.00011591277,0.000095106094,0.0006662538,0.00007992887,0.00020284834,0.00014577634,0.0001628974,0.000011381998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003256429,0.00026660098,0.0005683614,0.000012597932,0.000013262879,0.000003872534,0.00020079174,0.00003296611,0.0056415573,0.9863174,0.00018287868,0.0067271627],"study_design_scores_gemma":[0.0007574728,0.001124122,0.0037814542,0.00003921171,0.0000025318016,0.0000016377521,0.000008102428,0.00060179573,0.038989212,0.9545559,0.0000427963,0.000095746494],"about_ca_topic_score_codex":0.000009097511,"about_ca_topic_score_gemma":4.4131255e-7,"teacher_disagreement_score":0.033347655,"about_ca_system_score_codex":0.00002050037,"about_ca_system_score_gemma":0.00002795364,"threshold_uncertainty_score":0.47267857},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9821664,0.0008656454,0.0106851095,0.00022368724,0.0009679531,0.00031520295,0.0000025680552,0.0001667769,0.0046066283],"genre_scores_gemma":[0.98601705,0.000052842213,0.012986033,0.000057796362,0.0000032344683,0.000025702793,0.0000013736662,0.000017863726,0.00083811185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778694,0.00038959054,0.00035899653,0.00042109855,0.0005371302,0.00050621986],"domain_scores_gemma":[0.9981816,0.00029582405,0.0001569242,0.0010674965,0.00014557374,0.00015259295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064103364,0.00019313072,0.00031605264,0.00019774625,0.00019197767,0.000046983587,0.0012628773,0.00007664406,0.000053039228],"category_scores_gemma":[0.00037881167,0.00018372116,0.000105429164,0.0010197539,0.00016940483,0.00048156793,0.0003092631,0.00017608887,0.000028606537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000805848,0.0001463441,0.0006553204,0.000026406331,0.00001967097,0.0000113546785,0.00021712406,0.000033957393,0.016732702,0.9806087,0.0002772329,0.0012631197],"study_design_scores_gemma":[0.0009842722,0.00029436807,0.00071211724,0.000040900028,0.000005803863,0.0000134416105,0.00002876334,0.0016860791,0.059057817,0.9357835,0.0011737661,0.00021919352],"about_ca_topic_score_codex":0.000022238499,"about_ca_topic_score_gemma":0.0000043349364,"teacher_disagreement_score":0.044825234,"about_ca_system_score_codex":0.00006989281,"about_ca_system_score_gemma":0.00015406254,"threshold_uncertainty_score":0.74919313},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062325507,0.0005091679,0.0000321172,0.0016515533,0.05984919,0.002951995,0.0002482387,0.0003751405,0.8720571],"genre_scores_gemma":[0.73860854,0.00032094782,0.0011915605,0.0012615822,0.00019560795,0.0011015122,0.00014455608,0.00039294522,0.25678277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822694,0.00019142352,0.0004744954,0.00039096538,0.00039379884,0.0003224025],"domain_scores_gemma":[0.9970749,0.0006382409,0.00039852952,0.0015977875,0.0001800901,0.00011043844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064894045,0.0003765482,0.000535662,0.00019234218,0.00021654982,0.000025981906,0.001047082,0.00042281472,0.00017559777],"category_scores_gemma":[0.00047828193,0.00026942042,0.00032253473,0.00054506754,0.00017501085,0.000032041782,0.00015142815,0.00090377516,0.00019523416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008152621,0.00015372974,0.0000028306245,0.000046804576,0.00004959858,8.69546e-7,0.00044532088,2.9626282e-8,0.000021208449,0.51802194,0.48120287,0.000046639358],"study_design_scores_gemma":[0.00012237897,0.00015070016,0.000060700822,0.00025049818,0.00011036237,0.0000012192653,0.000057637477,0.0000015678492,0.0008301903,0.8899541,0.108209096,0.00025157476],"about_ca_topic_score_codex":0.000024624283,"about_ca_topic_score_gemma":0.000009882046,"teacher_disagreement_score":0.676283,"about_ca_system_score_codex":0.000028620861,"about_ca_system_score_gemma":0.000107827575,"threshold_uncertainty_score":0.9999758},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925372,0.00026894952,0.000012373612,0.000005511175,0.0018174972,0.00011977242,0.0000033915483,0.0000380187,0.0051972866],"genre_scores_gemma":[0.9998777,0.0000020849423,0.000006006709,0.0000059190183,0.000008503698,0.000007974651,4.6982592e-7,0.00002186954,0.000069482536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994112,0.000041641688,0.00015179065,0.00006274714,0.00015686352,0.00017574024],"domain_scores_gemma":[0.9995283,0.000042128726,0.00005777684,0.00030160203,0.000028620523,0.000041610307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022942174,0.000103770806,0.0001707794,0.000032501448,0.000036660167,0.0000072651833,0.00017327924,0.00005553961,0.000035041077],"category_scores_gemma":[0.000009689673,0.00006925304,0.00006428933,0.00019091433,0.000057149486,0.00012289672,0.000024743586,0.0001289968,0.000006419799],"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.00008127608,0.00026033475,0.2353597,0.00043665504,0.00029934014,0.0000020710531,0.004369761,0.0003622395,0.018141173,0.73938555,0.00093429326,0.00036760632],"study_design_scores_gemma":[0.0044959793,0.00057424576,0.5881536,0.0010284245,0.0002636398,0.00014173653,0.0016917684,0.00091665576,0.14578359,0.24830683,0.007398001,0.0012455689],"about_ca_topic_score_codex":0.00004217387,"about_ca_topic_score_gemma":0.0000041969033,"teacher_disagreement_score":0.49107873,"about_ca_system_score_codex":0.00001875201,"about_ca_system_score_gemma":0.000010176323,"threshold_uncertainty_score":0.2824057},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99316204,0.00003071811,0.00006809422,0.00018933727,0.00036430568,0.00017014563,0.000004957481,0.0000304633,0.0059799175],"genre_scores_gemma":[0.9995336,0.0000027187234,0.00023888383,0.000100568286,0.000004051435,0.000044853954,0.0000015315422,0.000011748295,0.00006202081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994148,0.00008085228,0.00015023419,0.000073912706,0.00011984262,0.00016036327],"domain_scores_gemma":[0.9986088,0.00082976464,0.00007982423,0.0004073552,0.000030248124,0.00004400655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043397196,0.00008327696,0.000117928226,0.000038901635,0.0000721207,0.0000064277624,0.00019378099,0.00003946642,0.000099370416],"category_scores_gemma":[0.0001911272,0.00005134954,0.00009827398,0.00017167868,0.00008550449,0.000041544474,0.00002035919,0.00012263416,0.00004507854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042259944,0.00023544303,0.001427581,0.0000082994775,0.000024972025,1.02337516e-7,0.00040935332,3.717815e-8,0.0008124124,0.99390954,0.0030689833,0.00009906858],"study_design_scores_gemma":[0.00012677751,0.000026176294,0.0015530281,0.000016673252,0.000022048285,0.0000014242648,0.00010615337,0.0000026015134,0.008520059,0.98924357,0.00031909818,0.00006239123],"about_ca_topic_score_codex":0.0000037254888,"about_ca_topic_score_gemma":3.716017e-7,"teacher_disagreement_score":0.0077076466,"about_ca_system_score_codex":0.0000081423605,"about_ca_system_score_gemma":0.0000053031467,"threshold_uncertainty_score":0.20939735},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9644156,0.0012095502,0.00007860945,0.000041176543,0.002618267,0.00014003698,0.0000022974434,0.00014628147,0.031348146],"genre_scores_gemma":[0.9998056,0.000008744044,0.00003226281,0.000013579264,0.00002510916,0.000009800113,0.000001394443,0.000021930968,0.00008152912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992551,0.000074573414,0.00019292043,0.00006116018,0.00012364487,0.00029255133],"domain_scores_gemma":[0.9994718,0.00013597548,0.000038745307,0.00028724177,0.000013546952,0.0000526853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005754611,0.00009980232,0.00015049479,0.000034892873,0.00008101421,0.000012343043,0.0002041081,0.000044019474,0.000060352017],"category_scores_gemma":[0.000018220728,0.00007686222,0.000057265635,0.00018944411,0.000044343396,0.00009274461,0.000025622669,0.00012540855,0.000066559056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000463188,0.000027404612,0.007812106,0.000048355632,0.000037980266,5.5818134e-7,0.00064340734,0.00017787173,0.004416707,0.98340786,0.0033465584,0.000076593205],"study_design_scores_gemma":[0.0013556118,0.00014176725,0.027706936,0.00018718108,0.00008387674,0.00003845762,0.0016216263,0.00322299,0.11268247,0.79963607,0.052565902,0.00075712404],"about_ca_topic_score_codex":0.000016006794,"about_ca_topic_score_gemma":9.69964e-7,"teacher_disagreement_score":0.18377176,"about_ca_system_score_codex":0.000018915323,"about_ca_system_score_gemma":0.0000038764597,"threshold_uncertainty_score":0.31343505},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9803839,0.00002651686,0.0013747297,0.0037346769,0.001028548,0.0006308319,6.172081e-7,0.00009369821,0.012726482],"genre_scores_gemma":[0.9982777,0.00000644115,0.00085935456,0.00032681494,0.0000040268183,0.00015936194,7.426819e-7,0.000011238581,0.00035427196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848914,0.0002423774,0.00018136179,0.00033090328,0.00038675513,0.00036946457],"domain_scores_gemma":[0.9982933,0.0006901056,0.00005808246,0.000764236,0.00011926204,0.0000750165],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00059613684,0.00013253372,0.00012501092,0.00014536966,0.00012763566,0.00013530634,0.0011294541,0.000062771505,0.00009435069],"category_scores_gemma":[0.00020612529,0.000096750846,0.00005714989,0.001012167,0.00010164295,0.0005345452,0.0002300499,0.00031189658,0.0011210921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005325536,0.00008464483,0.001066996,0.0000028773131,0.0000034120715,0.0000080099735,0.0003896536,0.0000049054593,0.00043849339,0.98801285,0.0017508528,0.008231954],"study_design_scores_gemma":[0.00047939725,0.00005260537,0.009919221,0.000017102397,7.2280363e-7,0.00000364435,0.00002252454,0.0025630968,0.003195358,0.9830704,0.00055306894,0.0001228687],"about_ca_topic_score_codex":0.000052062638,"about_ca_topic_score_gemma":0.000008112441,"teacher_disagreement_score":0.017893849,"about_ca_system_score_codex":0.00007578994,"about_ca_system_score_gemma":0.000033977034,"threshold_uncertainty_score":0.9996567},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9961744,0.0003726518,0.00017884788,0.00047341659,0.0019309251,0.00025042854,0.0000044144863,0.00002467002,0.0005902719],"genre_scores_gemma":[0.9981969,0.000013288616,0.0016338022,0.00007200455,8.003668e-7,0.0000136829485,4.2710414e-7,0.000006597647,0.00006249751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989238,0.00006267517,0.000354476,0.00014493198,0.00036011264,0.00015400696],"domain_scores_gemma":[0.9982713,0.00030171053,0.00027796582,0.00079903955,0.00030554744,0.000044477863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063059176,0.00009583233,0.00021717357,0.000047697627,0.000080098616,0.00001805536,0.00097377086,0.000047585516,0.000001415686],"category_scores_gemma":[0.00015000625,0.000054517724,0.00014834195,0.00049553043,0.00026446366,0.00014224903,0.00020489306,0.00006591082,0.000002298299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048188467,0.000089328125,0.00446755,0.0000436997,0.00003337636,8.2508464e-8,0.001060705,0.000027611026,0.0006732847,0.9916552,0.0017487654,0.00019563611],"study_design_scores_gemma":[0.00077006005,0.00009676705,0.0018685153,0.000052396495,0.00002194923,0.0000020010457,0.00017689001,0.0015683572,0.010271689,0.98497367,0.0001329977,0.00006469525],"about_ca_topic_score_codex":0.00010152779,"about_ca_topic_score_gemma":0.0000027233566,"teacher_disagreement_score":0.009598404,"about_ca_system_score_codex":0.000008274401,"about_ca_system_score_gemma":0.0001104943,"threshold_uncertainty_score":0.22231683},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9323168,0.014889802,0.015103743,0.00014673013,0.0019946396,0.00069959566,0.000023348624,0.0025397616,0.03228559],"genre_scores_gemma":[0.99362546,0.0018830758,0.004339749,0.000008270513,0.0000027894444,0.00004697226,0.000002884991,0.000035447545,0.00005532631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992107,0.00003974534,0.00029692223,0.000113128975,0.00013573552,0.00020377788],"domain_scores_gemma":[0.9988285,0.00014908354,0.00009551435,0.00081452326,0.00006934965,0.000043052907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019718947,0.00013052297,0.00016354294,0.000046918383,0.0001293148,0.000012287972,0.00065657584,0.00006751632,0.000009689128],"category_scores_gemma":[0.000044180484,0.000116291274,0.000048993606,0.00026428702,0.00011427856,0.00016805892,0.00012038134,0.00023402311,0.000011030083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019813368,0.00008873696,0.003048931,0.00010431065,0.000052307336,0.000004058057,0.0008061159,0.00023316403,0.00488021,0.98054147,0.0016851766,0.008535688],"study_design_scores_gemma":[0.0007734879,0.00011755139,0.02508835,0.00027645487,0.000040523817,0.0000059966037,0.00045485952,0.010794044,0.13043933,0.79885805,0.03237194,0.0007794196],"about_ca_topic_score_codex":0.000016377116,"about_ca_topic_score_gemma":0.000006821921,"teacher_disagreement_score":0.18168344,"about_ca_system_score_codex":0.000063986685,"about_ca_system_score_gemma":0.000012185234,"threshold_uncertainty_score":0.47422203},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.993827,0.000109736495,0.0027397794,0.0010867204,0.00031758833,0.00023928512,0.0000025833033,0.0000418597,0.0016354818],"genre_scores_gemma":[0.9993372,0.000010518805,0.00047600517,0.00013766572,0.0000012630984,0.000005030015,0.0000010507626,0.0000047331346,0.000026535043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884206,0.00016523358,0.00019832654,0.0002019288,0.0004105857,0.00018186595],"domain_scores_gemma":[0.99853516,0.00047569518,0.00013955125,0.00064905355,0.0001587216,0.00004183111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044419107,0.00009994325,0.00015688686,0.00012683927,0.00007537413,0.000017909282,0.00083204056,0.0000483737,0.000010118764],"category_scores_gemma":[0.00019778742,0.000069413756,0.000082870785,0.00072767923,0.0001195326,0.00015920079,0.00006147204,0.0001795976,0.0000063608813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016073649,0.00009175257,0.00016921242,0.0000051066377,0.000008163745,0.0000028718569,0.00048524071,0.00005736892,0.0030312012,0.99200803,0.00019050963,0.003934488],"study_design_scores_gemma":[0.00030838457,0.00048105526,0.0040633287,0.000020303763,0.0000023804203,0.000002174747,0.000031928204,0.0005900432,0.027076319,0.96732634,0.000030727228,0.00006700491],"about_ca_topic_score_codex":0.000003244205,"about_ca_topic_score_gemma":4.249081e-7,"teacher_disagreement_score":0.02468166,"about_ca_system_score_codex":0.000015049572,"about_ca_system_score_gemma":0.00003755258,"threshold_uncertainty_score":0.2830611},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98231626,0.000008875672,0.000301585,0.00045286104,0.0023018399,0.00008583362,4.0444522e-7,0.0001436048,0.014388712],"genre_scores_gemma":[0.99877137,0.0000020669709,0.00081945694,0.00032530335,0.0000073769647,0.00001035571,5.713815e-7,0.0000067399264,0.000056773868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991375,0.000063223044,0.00013504508,0.00026520962,0.00016554495,0.00023348606],"domain_scores_gemma":[0.9990251,0.00019378761,0.000038576152,0.0006368078,0.000030605763,0.00007509133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043052118,0.00010871387,0.00011356007,0.00019267225,0.00007347457,0.00008475522,0.0008037176,0.00007484062,0.00002289451],"category_scores_gemma":[0.000079275036,0.00010566563,0.00005592691,0.00065649865,0.000044573088,0.00021397756,0.00013954574,0.0003598191,0.0001385475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072957578,0.00011145996,0.0014873422,0.000001668819,0.0000023321209,0.000017140808,0.0002665957,0.0000017851754,0.0010372282,0.98847884,0.0002822487,0.008306064],"study_design_scores_gemma":[0.00063147105,0.00015223338,0.007497392,0.000013146653,0.0000012138015,0.0000040731707,0.0000046337254,0.0004593811,0.0026596677,0.98381364,0.0046139057,0.00014925476],"about_ca_topic_score_codex":0.000011846844,"about_ca_topic_score_gemma":0.000019258268,"teacher_disagreement_score":0.016455071,"about_ca_system_score_codex":0.0000114846835,"about_ca_system_score_gemma":0.000030230934,"threshold_uncertainty_score":0.43089193},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94465035,0.00025328455,0.0000209711,0.00012702287,0.0021404754,0.00026468816,0.000004378817,0.00020877982,0.052330066],"genre_scores_gemma":[0.99789554,0.00001566781,0.0008376723,0.00008219211,0.00004918651,0.00003942026,0.000005629652,0.00006181548,0.0010128814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979565,0.00023235804,0.00030993362,0.00019826765,0.000533833,0.0007690848],"domain_scores_gemma":[0.99718523,0.0016687795,0.00009711585,0.0006569938,0.000111370035,0.00028048808],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016594519,0.0001980502,0.00027686372,0.00035712752,0.0001344188,0.00004941686,0.00042203994,0.00014014234,0.0004024786],"category_scores_gemma":[0.0018660813,0.00018649311,0.00010268168,0.0011341721,0.00008799855,0.000355288,0.00024094823,0.00037654155,0.0010714437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016894193,0.00033845002,0.011504125,0.000052407177,0.00003615264,0.0000044670805,0.00044720955,3.4360816e-8,0.00018970849,0.97769576,0.00911778,0.0005970091],"study_design_scores_gemma":[0.0007126646,0.000085950946,0.005206891,0.00001822683,0.000023280805,0.000014081959,0.000117330324,0.00002553957,0.00071230636,0.9865741,0.006274516,0.00023511887],"about_ca_topic_score_codex":0.000007663664,"about_ca_topic_score_gemma":7.262802e-7,"teacher_disagreement_score":0.0532452,"about_ca_system_score_codex":0.000110145746,"about_ca_system_score_gemma":0.000030207513,"threshold_uncertainty_score":0.9997063},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9864639,0.00006965443,0.00016012207,0.00025090427,0.00021748141,0.0002317377,0.000006333664,0.000050400933,0.012549472],"genre_scores_gemma":[0.99884784,0.000010048986,0.00071874267,0.000009230275,0.0000034860109,0.000035278037,0.0000012918669,0.0000138099995,0.00036029337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991696,0.00006470942,0.00017854756,0.00013795914,0.000274132,0.00017506046],"domain_scores_gemma":[0.9988627,0.00031890106,0.00014161531,0.00046862956,0.00012609207,0.00008208685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004315721,0.00010119158,0.00014140172,0.000015063224,0.00013564648,0.000021574953,0.0003486462,0.000043097374,0.000009251964],"category_scores_gemma":[0.000102674996,0.00006684602,0.000044468037,0.00029059852,0.00023138372,0.00007434583,0.00003177948,0.00015177118,0.000017652312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004500934,0.00009692997,0.005619011,0.000009065178,0.000026534375,0.000002290028,0.00040591974,8.5227254e-7,0.000038159204,0.9917071,0.0019710334,0.00007809707],"study_design_scores_gemma":[0.0005196808,0.000061988176,0.0009199799,0.000019905103,0.000021446001,0.000010753606,0.00033119906,0.000009977842,0.0016435237,0.99482137,0.0015476396,0.00009254663],"about_ca_topic_score_codex":0.000013934038,"about_ca_topic_score_gemma":0.00002437869,"teacher_disagreement_score":0.012383926,"about_ca_system_score_codex":0.000020719483,"about_ca_system_score_gemma":0.000051995456,"threshold_uncertainty_score":0.27259016},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9867469,0.00014118399,0.00021984997,0.00024412501,0.00489771,0.00009602051,0.0000019311617,0.00013219936,0.0075200894],"genre_scores_gemma":[0.99715376,0.000005134773,0.0025954077,0.00012298276,0.000005618926,0.000002914417,0.0000022519673,0.000009172034,0.00010275286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986955,0.00006113359,0.00025914758,0.0002964053,0.00044687028,0.00024096355],"domain_scores_gemma":[0.9989382,0.00009103841,0.0001147904,0.00050608994,0.00017467358,0.00017519572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043326383,0.00013248209,0.0001981476,0.00016434217,0.000066286404,0.000043837146,0.00048758963,0.00007004107,0.0000065735835],"category_scores_gemma":[0.00007631862,0.00012214824,0.00006912204,0.0005212048,0.000059481405,0.00015989596,0.00008122943,0.0001421372,0.00010860928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011756039,0.0001291032,0.00032880937,0.000004474849,0.000012205405,0.000011346505,0.0004141011,0.00011311653,0.00031780623,0.98895544,0.009144933,0.0005569301],"study_design_scores_gemma":[0.00094840705,0.00033255437,0.00013376721,0.000029433299,0.0000048670927,0.000006947412,0.000018361809,0.0012193025,0.0030566016,0.9938145,0.00029180467,0.0001434355],"about_ca_topic_score_codex":0.00003585039,"about_ca_topic_score_gemma":0.0000011427662,"teacher_disagreement_score":0.010406874,"about_ca_system_score_codex":0.000019416086,"about_ca_system_score_gemma":0.00007029803,"threshold_uncertainty_score":0.49810603},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9868267,0.00011439155,0.000015144459,0.000008526369,0.00080875005,0.00025380802,0.000001135321,0.00016227654,0.01180923],"genre_scores_gemma":[0.9996368,0.0000041735498,0.000030276102,0.000021919906,0.0000063648763,0.000112009235,0.0000032543903,0.000030265512,0.00015491639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922824,0.000035198515,0.00019867979,0.00012891868,0.00013201493,0.0002769328],"domain_scores_gemma":[0.9996331,0.000025051359,0.000021874825,0.00023373263,0.000021958067,0.000064284985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013634881,0.0001357369,0.00015873926,0.00009168766,0.000027081978,0.0000375989,0.00014884108,0.00004247314,0.000118796874],"category_scores_gemma":[0.0000041065077,0.00012367456,0.000027696766,0.000244831,0.000019109799,0.00020627242,0.000014870335,0.0001330922,0.00032493845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001713835,0.00015093425,0.20939203,0.00016297227,0.00014672447,0.00004804969,0.000993917,0.0013557567,0.007180077,0.774168,0.004334985,0.0020494],"study_design_scores_gemma":[0.005543376,0.00022981345,0.08340276,0.0002731158,0.000025891663,0.000036885478,0.0006520673,0.0052797394,0.00368322,0.89758664,0.0023701487,0.00091634627],"about_ca_topic_score_codex":0.000077815006,"about_ca_topic_score_gemma":0.00001562538,"teacher_disagreement_score":0.12598927,"about_ca_system_score_codex":0.000050845516,"about_ca_system_score_gemma":0.000007763584,"threshold_uncertainty_score":0.50433016},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98412067,0.001963352,0.009254269,0.0019215369,0.0002830082,0.00024352215,6.7779206e-7,0.00014933028,0.0020636334],"genre_scores_gemma":[0.9973487,0.00029397244,0.002125817,0.0000761298,0.0000019145264,0.000027935774,0.0000037356795,0.000008447531,0.00011329188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900544,0.00017870736,0.0001479012,0.0002828944,0.00019895546,0.00018611767],"domain_scores_gemma":[0.9989925,0.0000966436,0.00006520893,0.00058759196,0.00013850199,0.0001195539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047859494,0.00012489677,0.00015405122,0.00009348275,0.0001244513,0.00016876553,0.0004911056,0.000040520983,0.0000023089772],"category_scores_gemma":[0.000048674065,0.00010821572,0.00001579351,0.00064017193,0.0001000877,0.00040750194,0.00017206484,0.00014145781,0.0000061320716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013147753,0.00005093927,0.014429802,0.0000049058604,0.000007226329,0.0000032270564,0.0019536444,0.000011653889,0.00008081137,0.9808292,0.00018826289,0.0024271898],"study_design_scores_gemma":[0.0029942705,0.00032256966,0.022945369,0.00012257868,0.000010477472,0.000019194287,0.00030936574,0.048758656,0.0010089772,0.91682696,0.006207917,0.00047365527],"about_ca_topic_score_codex":0.000013940445,"about_ca_topic_score_gemma":0.00026976137,"teacher_disagreement_score":0.064002216,"about_ca_system_score_codex":0.000072278766,"about_ca_system_score_gemma":0.000084048115,"threshold_uncertainty_score":0.4412909},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9895921,0.00006865104,0.00012698812,0.0011565476,0.00033024562,0.00043774117,0.0000031839936,0.00013384192,0.008150723],"genre_scores_gemma":[0.99703556,0.0000044039907,0.0014813747,0.00013072848,0.00001111099,0.00013408682,0.0000023185607,0.000029527142,0.0011708718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989065,0.0001219385,0.00019653808,0.00021650012,0.00028936093,0.00026914393],"domain_scores_gemma":[0.9985349,0.00032964683,0.0000815749,0.0006973378,0.00015375987,0.0002027347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064079463,0.00014917934,0.00016573952,0.000059679027,0.00028320053,0.00007655819,0.00038786864,0.000054406,0.0000113617725],"category_scores_gemma":[0.00021187878,0.00009495186,0.000055459685,0.00050660374,0.00009838947,0.000059464717,0.00007237832,0.00014254682,0.000056165016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117018135,0.000082579536,0.00089991087,0.000002975289,0.000032746106,0.0000036062968,0.0005333453,0.0000029043492,0.00010584932,0.98114127,0.016907142,0.00017066396],"study_design_scores_gemma":[0.00093274296,0.00012550353,0.00045282065,0.000013034501,0.000022674943,0.000007474095,0.00030703295,0.000017243303,0.00071717973,0.98137325,0.015878504,0.00015252504],"about_ca_topic_score_codex":0.000016805228,"about_ca_topic_score_gemma":0.000038961323,"teacher_disagreement_score":0.0074435,"about_ca_system_score_codex":0.000032062188,"about_ca_system_score_gemma":0.000060660474,"threshold_uncertainty_score":0.38720244},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98404,0.0007268522,0.001828096,0.00040250973,0.00047509305,0.0002686387,0.0000040610344,0.00033088616,0.011923813],"genre_scores_gemma":[0.99666154,0.00017777282,0.002210835,0.000105007086,0.0000015306582,0.00002328083,0.000001758537,0.0000127811545,0.00080550706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844044,0.00010906866,0.00019137509,0.00049698685,0.00034390306,0.000418233],"domain_scores_gemma":[0.99881893,0.0001427765,0.00003956145,0.0007508564,0.00006027852,0.00018759091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029518997,0.00016719034,0.00017495606,0.00011423143,0.00023334468,0.00016986809,0.00083556154,0.000059761445,0.00006987153],"category_scores_gemma":[0.000024282572,0.00016196426,0.00005575548,0.00083167147,0.00022080589,0.0006401604,0.00011237756,0.0002239065,0.00005568141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014900541,0.000049749626,0.0012436294,0.000006926142,0.000010641749,0.00002098451,0.00015991673,0.000003700239,0.00019657546,0.9709309,0.00030457333,0.02705755],"study_design_scores_gemma":[0.00052090845,0.00009735465,0.004879062,0.000011805729,0.0000022040874,0.000010684991,0.000012093568,0.00062418036,0.000648888,0.99102336,0.0019760926,0.00019333493],"about_ca_topic_score_codex":0.00000949031,"about_ca_topic_score_gemma":0.000005563725,"teacher_disagreement_score":0.026864216,"about_ca_system_score_codex":0.000017087159,"about_ca_system_score_gemma":0.000030352669,"threshold_uncertainty_score":0.6604711},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95283914,0.005346682,0.00028310184,0.005425248,0.006227873,0.00027235644,0.000011900747,0.000079936995,0.029513739],"genre_scores_gemma":[0.9936205,0.0013316105,0.00015402041,0.0008066941,0.00011995628,0.00001427459,0.000009372465,0.000015113629,0.003928454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794966,0.00037174067,0.00032342147,0.0003193709,0.0004607003,0.00057509594],"domain_scores_gemma":[0.999156,0.0001205007,0.000103631544,0.0002464472,0.00017056649,0.00020285379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069297006,0.00021152938,0.00024059475,0.000047529193,0.00066033547,0.000148707,0.0003031773,0.00018882212,0.00044843383],"category_scores_gemma":[0.00013398382,0.0002265373,0.00014439774,0.0004990017,0.00087460893,0.0005293399,0.000036816364,0.00018242783,0.00052483304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011992317,0.00018438228,0.0038236233,0.000042559208,0.000028413266,0.0000053929666,0.009639778,0.000041360305,0.0001530113,0.9117683,0.01542958,0.058871586],"study_design_scores_gemma":[0.00054166483,0.00024660028,0.006802086,0.00017509509,0.0000643734,0.000002209024,0.0010607723,0.00021399664,0.0006247497,0.69468194,0.2953192,0.00026731726],"about_ca_topic_score_codex":0.006362263,"about_ca_topic_score_gemma":0.0037844032,"teacher_disagreement_score":0.27988964,"about_ca_system_score_codex":0.0003111521,"about_ca_system_score_gemma":0.00013234274,"threshold_uncertainty_score":0.9617881},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9190957,0.00005526028,0.0035569812,0.0014386629,0.00030269145,0.0005311727,0.000016697586,0.00007465461,0.07492816],"genre_scores_gemma":[0.9970433,0.000002264072,0.0017909056,0.00004884507,0.000024215673,0.000109957735,0.000006988896,0.000013801223,0.0009597121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994428,0.00001340939,0.00014994158,0.00015578872,0.00005625201,0.00018177897],"domain_scores_gemma":[0.9995024,0.00009513146,0.0000562108,0.00021153416,0.000028154964,0.00010653262],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000047583504,0.00010408388,0.00014391453,0.000015947326,0.00012512143,0.000061921055,0.00009261826,0.000022882468,0.00096756086],"category_scores_gemma":[0.000006806905,0.00008873027,0.00003421934,0.000082138955,0.000051373838,0.00013189667,0.00006655653,0.00007268431,0.0002672865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.9437685e-7,0.00004568372,0.0005273329,0.0000037235445,0.00001385963,8.4332775e-8,0.000053971635,5.073969e-7,0.00048023553,0.99309397,0.0009114467,0.0048682895],"study_design_scores_gemma":[0.00026872547,0.000014236907,0.0012785324,0.000007360876,0.000008828757,3.87132e-7,0.00013319877,0.000083544146,0.0011018576,0.993444,0.0035460342,0.00011327547],"about_ca_topic_score_codex":0.000080291094,"about_ca_topic_score_gemma":1.16219134e-7,"teacher_disagreement_score":0.07794759,"about_ca_system_score_codex":0.000006712622,"about_ca_system_score_gemma":0.000010085287,"threshold_uncertainty_score":0.9999457},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920125,0.00028746593,0.000002949406,0.00042322217,0.0005391388,0.0002636315,0.000012615504,0.000024783672,0.0064337025],"genre_scores_gemma":[0.99948543,0.000029876901,0.00019036393,0.000031366846,0.000007789014,0.00003143835,9.909944e-7,0.000014592507,0.00020813124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990012,0.00015004977,0.0003166189,0.000090249836,0.00021093352,0.00023095746],"domain_scores_gemma":[0.9981844,0.00076016266,0.00025928597,0.00065902784,0.00008653507,0.000050635386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000893488,0.00010868198,0.00017418175,0.000028074339,0.00024593956,0.000009430402,0.00045872672,0.000066410415,0.000015638234],"category_scores_gemma":[0.00027741355,0.000063173415,0.00017263474,0.0002776583,0.00026247706,0.000071192655,0.00010711541,0.00013895235,0.000010305587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011664379,0.0002653502,0.013642419,0.000024827472,0.000042861415,5.21414e-8,0.00079674344,8.206372e-8,0.0011160366,0.9816818,0.0023336315,0.00008449692],"study_design_scores_gemma":[0.00020699951,0.000031550804,0.014951357,0.000024124089,0.00005443489,0.0000018518732,0.0004123806,0.0000026482194,0.02663045,0.95568204,0.0019314867,0.00007069378],"about_ca_topic_score_codex":0.000008384204,"about_ca_topic_score_gemma":0.000006237539,"teacher_disagreement_score":0.025999812,"about_ca_system_score_codex":0.000008778345,"about_ca_system_score_gemma":0.000021055257,"threshold_uncertainty_score":0.25761372},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9944899,0.00009923647,0.0019884582,0.00020595058,0.0013875559,0.00028601568,0.0000055340265,0.0001864973,0.0013508416],"genre_scores_gemma":[0.9990753,0.00001545361,0.00063696486,0.0000852372,0.000007552296,0.00002795218,0.0000059597264,0.000028040346,0.00011757471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748445,0.00041569263,0.00035125506,0.00067019975,0.0005441772,0.0005342479],"domain_scores_gemma":[0.99688256,0.0013272212,0.00009659487,0.0010841214,0.00036984423,0.00023967042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048271834,0.00026999382,0.0004081976,0.00040716561,0.00018932862,0.000091442096,0.0008761218,0.00014835941,0.00002458099],"category_scores_gemma":[0.0008310426,0.0002511244,0.0000866861,0.0013688606,0.00033022912,0.0005015848,0.00041177147,0.00034489852,0.000025863841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058361784,0.00017035294,0.00224206,0.000028097731,0.000027005817,0.000009498631,0.00035076417,0.000014029927,0.0042194976,0.9904938,0.0002911914,0.0020953876],"study_design_scores_gemma":[0.0020068137,0.0006875867,0.018041467,0.00005617654,0.000008842353,0.000022323355,0.000051262876,0.0025550602,0.012130021,0.96391726,0.00016125498,0.00036191152],"about_ca_topic_score_codex":0.000032645203,"about_ca_topic_score_gemma":0.0000032653365,"teacher_disagreement_score":0.026576474,"about_ca_system_score_codex":0.00003397995,"about_ca_system_score_gemma":0.00006593817,"threshold_uncertainty_score":0.9999941},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959403,0.00019813012,0.0014095338,0.00031692928,0.0012290017,0.00010316002,0.0000050890712,0.00015472302,0.0006431132],"genre_scores_gemma":[0.998604,0.000030549978,0.0010789451,0.00024879177,0.0000122193915,0.0000048657057,0.000007900853,0.000005789981,0.000006956477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988222,0.00012427857,0.00025649375,0.0003223688,0.00026074128,0.00021392136],"domain_scores_gemma":[0.9990555,0.00023032953,0.00013275271,0.0004543335,0.000050349667,0.000076736134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028316895,0.00014310298,0.00020893266,0.00019912413,0.00013748967,0.00006537466,0.00057352684,0.00006796093,0.00001339297],"category_scores_gemma":[0.00004520196,0.00014229283,0.00013633148,0.00048577503,0.00005257764,0.0004183983,0.00005533473,0.00012502859,0.00001558645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049390812,0.00019414269,0.0006460754,0.0000024884123,0.000016952768,0.000008976922,0.00050320773,0.000034628196,0.0052929446,0.9797625,0.00024208002,0.013246599],"study_design_scores_gemma":[0.00071007217,0.000525447,0.011446515,0.000042316475,0.000011710233,9.540281e-7,0.000025357353,0.0028882967,0.019574728,0.96448517,0.000121974896,0.00016744554],"about_ca_topic_score_codex":0.000011986375,"about_ca_topic_score_gemma":5.035024e-7,"teacher_disagreement_score":0.015277332,"about_ca_system_score_codex":0.000019472644,"about_ca_system_score_gemma":0.000028635937,"threshold_uncertainty_score":0.58025336},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99572426,0.000045836194,0.00029417436,0.0010068055,0.0016826539,0.0003440884,0.0000035316325,0.00005359337,0.0008450817],"genre_scores_gemma":[0.9985691,0.0000012213434,0.0012620483,0.00004765742,0.0000093564895,0.000012830205,4.56178e-7,0.000010306352,0.000087053035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983424,0.00023600714,0.0002559568,0.0003803199,0.00043442773,0.00035087258],"domain_scores_gemma":[0.9981917,0.00021954282,0.00011768268,0.0012820946,0.000116010924,0.000072942195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007033833,0.00012814614,0.00021012998,0.00009816623,0.00010572987,0.00004452075,0.0015436129,0.00007372029,0.000013053252],"category_scores_gemma":[0.0004213695,0.000099653174,0.00006889174,0.0008503286,0.00018158637,0.0002917195,0.00047327348,0.000695928,0.0000066721136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045299485,0.00009967781,0.024493767,0.000020767002,0.000007462301,0.000002014629,0.0010075633,0.0000038819644,0.06445951,0.9083947,0.000026738566,0.001479388],"study_design_scores_gemma":[0.00045795177,0.000042574567,0.059552092,0.000027062286,0.0000016719341,0.0000033831013,0.000023189828,0.00021670198,0.15841775,0.7808409,0.00027047034,0.00014625023],"about_ca_topic_score_codex":0.00007219092,"about_ca_topic_score_gemma":0.000116506664,"teacher_disagreement_score":0.12755379,"about_ca_system_score_codex":0.000035384117,"about_ca_system_score_gemma":0.00012489344,"threshold_uncertainty_score":0.40637386},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9735461,0.00068815215,0.017155288,0.0006132253,0.0034692409,0.00014869879,0.0000014533275,0.00035697772,0.0040209],"genre_scores_gemma":[0.9843891,0.000011819497,0.015345307,0.00017303533,9.2431446e-7,0.000005353459,0.0000013882236,0.000009595291,0.00006346619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987254,0.00009016697,0.00030871676,0.000327581,0.00029481584,0.00025330592],"domain_scores_gemma":[0.99873954,0.00013500777,0.00014784459,0.00071762665,0.00016284068,0.000097132455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006157378,0.00012866639,0.00021340155,0.000104103325,0.00010321824,0.00004949991,0.0006798189,0.000045324865,0.000003935976],"category_scores_gemma":[0.00009041158,0.000120307996,0.000076800694,0.00055788184,0.00007528922,0.00018746124,0.00015199304,0.00011844457,0.00002890044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021540802,0.00006280197,0.0019095731,0.000012701435,0.000008718886,0.0000012137996,0.000120821955,0.00007311499,0.0037168409,0.9915581,0.00044419867,0.0020897666],"study_design_scores_gemma":[0.0007624531,0.00007420344,0.00020163092,0.000046897814,0.000005390349,0.0000021138837,0.000004311338,0.00992033,0.009978285,0.9781254,0.00073242997,0.00014656954],"about_ca_topic_score_codex":0.00006977861,"about_ca_topic_score_gemma":0.0000044786807,"teacher_disagreement_score":0.013432709,"about_ca_system_score_codex":0.00000935928,"about_ca_system_score_gemma":0.000024695437,"threshold_uncertainty_score":0.49060178},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96954554,0.000107082866,0.008258884,0.0008157824,0.0018411039,0.000371079,9.0392655e-7,0.00021396996,0.018845668],"genre_scores_gemma":[0.9953237,0.000004432827,0.004185561,0.00009257038,0.0000034424706,0.000037057023,0.0000020452783,0.000012852314,0.0003383282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983531,0.00021763818,0.00020606112,0.0003625641,0.0004813717,0.00037921744],"domain_scores_gemma":[0.9988431,0.0001588663,0.00005400416,0.0005735246,0.00019218658,0.00017833877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009438303,0.00012840345,0.00015965015,0.00022149856,0.000054700595,0.00008349138,0.00088010746,0.00007254564,0.000018019999],"category_scores_gemma":[0.00024390065,0.00012926328,0.000048714603,0.0012271982,0.00007287973,0.0008520397,0.0002730208,0.00020181653,0.00033405604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016290629,0.00009693465,0.012636801,0.0000028786403,0.0000041192234,0.00002374366,0.0005028648,0.000013442336,0.00018080391,0.983036,0.00086943666,0.0026166895],"study_design_scores_gemma":[0.0013490882,0.00006508703,0.0038300161,0.0000099353065,9.680383e-7,0.0000074686204,0.000052517717,0.0019025512,0.001503219,0.99041563,0.00070425606,0.00015928205],"about_ca_topic_score_codex":0.000023186165,"about_ca_topic_score_gemma":0.0000058173337,"teacher_disagreement_score":0.025778186,"about_ca_system_score_codex":0.00011659805,"about_ca_system_score_gemma":0.00009103278,"threshold_uncertainty_score":0.52712035},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47525674,0.00033393202,0.50553745,0.001615205,0.0050054747,0.0016608062,0.000005963007,0.0010884281,0.009496011],"genre_scores_gemma":[0.99222463,0.0000057560574,0.007191061,0.00014711687,0.000007793194,0.000058498033,0.00000189366,0.000020727719,0.0003425348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841166,0.00014374254,0.00016748528,0.00046061972,0.00031570878,0.0005007599],"domain_scores_gemma":[0.99853706,0.00021506882,0.00006359892,0.00080942374,0.00021154089,0.00016327939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006239574,0.00016357008,0.00018795628,0.00022402036,0.00026184967,0.00010568473,0.0013927314,0.000051521656,0.0000045492334],"category_scores_gemma":[0.00014471401,0.0001484131,0.00012376066,0.0007012708,0.00016133026,0.00056552415,0.00028014043,0.00016464008,0.000037012203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024598623,0.00005528493,0.00022612876,0.000012629417,0.000016241074,0.0000019867666,0.00013776595,0.00003089995,0.0017214285,0.9913497,0.00061233144,0.0058109886],"study_design_scores_gemma":[0.0014773487,0.00025034376,0.000107646396,0.000014242592,0.000004152738,0.0000035078099,0.000016896402,0.007382877,0.0066797347,0.97899383,0.0048611583,0.00020824843],"about_ca_topic_score_codex":0.000013847741,"about_ca_topic_score_gemma":0.0000034530788,"teacher_disagreement_score":0.5169679,"about_ca_system_score_codex":0.000039771294,"about_ca_system_score_gemma":0.000054485725,"threshold_uncertainty_score":0.6052111},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67119,0.0008705222,0.22764657,0.00078096264,0.029344123,0.0015899406,0.00000924807,0.0012285892,0.06734002],"genre_scores_gemma":[0.88045,0.000005298478,0.11910643,0.00011381944,0.000033295473,0.00007963607,0.0000047982358,0.000013354266,0.00019336544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984457,0.00030198166,0.00028171434,0.00025393258,0.0002925925,0.00042411083],"domain_scores_gemma":[0.998521,0.00007936731,0.000118852666,0.00079149456,0.00031158523,0.00017774448],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010833422,0.00014698997,0.00017085577,0.00007272522,0.00020044719,0.00012103607,0.0007548409,0.000090396345,0.00002008134],"category_scores_gemma":[0.00017272934,0.0001345212,0.00004629748,0.0004980365,0.000029893929,0.0012256199,0.00017716135,0.00017373348,0.00094452966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036260901,0.0001456672,0.0044596777,0.000020394566,0.000010511971,9.128528e-7,0.0004477192,0.0000013578864,0.0014479579,0.9913155,0.0015103605,0.0006363371],"study_design_scores_gemma":[0.006779826,0.0017951796,0.23423895,0.0006225594,0.00013544604,0.00046181877,0.0004301812,0.117740154,0.080364354,0.39149165,0.16163476,0.004305113],"about_ca_topic_score_codex":0.000028070452,"about_ca_topic_score_gemma":0.0000012153197,"teacher_disagreement_score":0.59982383,"about_ca_system_score_codex":0.000118905235,"about_ca_system_score_gemma":0.000062242434,"threshold_uncertainty_score":0.99983335},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96827096,0.00028737134,0.007381418,0.00041728507,0.011648842,0.00030788424,0.0000049104874,0.00023882726,0.011442532],"genre_scores_gemma":[0.999275,0.000003991021,0.00036865592,0.00006382145,0.000023092898,0.000017468798,0.000001944379,0.00001105971,0.00023496049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838084,0.00026343382,0.00038472627,0.0003280905,0.00036665922,0.00027627833],"domain_scores_gemma":[0.99796253,0.0002760534,0.00016318732,0.0010111646,0.00040710584,0.0001799802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064529636,0.00015606775,0.00035887933,0.00016632507,0.00007027896,0.00007843422,0.0010747793,0.00011823043,0.000009460336],"category_scores_gemma":[0.00048280664,0.00014116183,0.00013559754,0.00082365214,0.000052736457,0.00043050662,0.00028488258,0.00015719175,0.000031592364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002033772,0.00013869867,0.0028986149,0.00000815146,0.000032471147,0.000009673468,0.0005520786,0.000023297627,0.00016390177,0.9621407,0.033276785,0.00073529925],"study_design_scores_gemma":[0.0056168414,0.00075533404,0.0047180518,0.000060678187,0.00001719161,0.000044204513,0.00021335468,0.014339635,0.0028389017,0.9620291,0.008932108,0.00043460773],"about_ca_topic_score_codex":0.00025196627,"about_ca_topic_score_gemma":0.00002322236,"teacher_disagreement_score":0.031004075,"about_ca_system_score_codex":0.00006407651,"about_ca_system_score_gemma":0.0001251345,"threshold_uncertainty_score":0.5756412},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99078137,0.00012218326,0.0026532845,0.0008619589,0.00386415,0.00024655688,0.0000015220924,0.00018808781,0.0012808818],"genre_scores_gemma":[0.9966846,0.0000026091284,0.0027206826,0.0005176699,0.0000032425387,0.000017870867,0.0000018496008,0.000008968001,0.00004249829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988278,0.00009455101,0.0002122462,0.00025109187,0.00028099833,0.00033328735],"domain_scores_gemma":[0.99906373,0.00009739588,0.000106009305,0.00044515054,0.00010369727,0.00018402329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004950222,0.0001349998,0.00017544525,0.0002025025,0.00011316701,0.000030550786,0.0002830532,0.00006745485,0.000007489264],"category_scores_gemma":[0.00007962368,0.00012460997,0.00008201267,0.0007456795,0.00003670906,0.00022471318,0.00009115172,0.00012619469,0.000066624874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014656603,0.00016935065,0.001401165,0.0000075924804,0.00001732611,8.518775e-7,0.0009823384,0.000099735196,0.004802832,0.98808986,0.0034277088,0.0009866116],"study_design_scores_gemma":[0.0017433628,0.0005419155,0.0018031923,0.000081149476,0.000015661108,0.000018612145,0.0000408585,0.0011669149,0.021143597,0.9719795,0.0011650309,0.00030019242],"about_ca_topic_score_codex":0.00015261711,"about_ca_topic_score_gemma":0.0000051282373,"teacher_disagreement_score":0.016340764,"about_ca_system_score_codex":0.000034542172,"about_ca_system_score_gemma":0.000028894854,"threshold_uncertainty_score":0.50814474},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9763284,0.0001640484,0.00012827122,0.00049349683,0.0015393035,0.00016120427,0.0000028798725,0.00011264991,0.021069743],"genre_scores_gemma":[0.99721277,0.0000074380096,0.0013092,0.00013434059,0.000009667705,0.00001605351,0.0000034345692,0.000019065985,0.001288046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989435,0.0001845804,0.00023601392,0.0002027967,0.00016155097,0.0002715512],"domain_scores_gemma":[0.9990665,0.00031510324,0.00007919499,0.00036528788,0.00005812179,0.00011583812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007844562,0.00013148708,0.0002510448,0.000057987898,0.00004149692,0.0000107093765,0.00019108262,0.00013963728,0.000059009235],"category_scores_gemma":[0.0007706289,0.00012491143,0.000039540526,0.0001782485,0.00011872989,0.00012748051,0.00008256457,0.00024310511,0.0001286463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035215322,0.0001512717,0.0062488955,0.000013109381,0.000009782688,0.000034065783,0.00094629294,0.0000033459887,0.000015713356,0.9885258,0.0038126647,0.00020385376],"study_design_scores_gemma":[0.0011993033,0.000048540765,0.0005450439,0.000014820951,0.000007122088,0.0000076080896,0.00044334645,0.000025786952,0.00039772052,0.9933818,0.0037811534,0.00014777594],"about_ca_topic_score_codex":0.000021539337,"about_ca_topic_score_gemma":0.000030741605,"teacher_disagreement_score":0.020884352,"about_ca_system_score_codex":0.00009126725,"about_ca_system_score_gemma":0.000051503364,"threshold_uncertainty_score":0.509374},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9247254,0.00014920252,0.0064553884,0.003241779,0.0032714743,0.00145553,0.000033894186,0.0006161194,0.06005119],"genre_scores_gemma":[0.9919306,0.000004191087,0.0057437313,0.00024633465,0.000043173066,0.00026683672,0.000010408113,0.00003726496,0.0017174477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989618,0.00004419858,0.00027098128,0.00020647526,0.00031825114,0.00019828492],"domain_scores_gemma":[0.9988943,0.00017591649,0.000119197364,0.0005369021,0.00010720535,0.0001664933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031955368,0.0001560554,0.00026394447,0.00004039367,0.00008729012,0.000040528088,0.00016423326,0.00007282065,0.00016573911],"category_scores_gemma":[0.00019374718,0.0001274006,0.00011814423,0.00013164888,0.00002556403,0.000042919695,0.000053005424,0.00011158284,0.00035018675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016783475,0.00030705426,0.000010914244,0.000012823539,0.00008377233,0.000001271806,0.00019119178,0.0000073782808,0.00007109318,0.8695729,0.12962283,0.00010202634],"study_design_scores_gemma":[0.00090564654,0.000118875425,0.000009498226,0.000009990961,0.00023495685,0.0000019008836,0.000023755952,0.0007998258,0.0010524185,0.9454425,0.051254973,0.00014563835],"about_ca_topic_score_codex":0.000015559248,"about_ca_topic_score_gemma":0.0000041165536,"teacher_disagreement_score":0.07836786,"about_ca_system_score_codex":0.000052692365,"about_ca_system_score_gemma":0.000047041958,"threshold_uncertainty_score":0.51952463},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9320061,0.000040350853,0.0010398601,0.00003094234,0.0005133901,0.00021644466,0.000018452274,0.000031703858,0.06610275],"genre_scores_gemma":[0.9979298,0.0000043831224,0.0018287491,0.000010813052,0.00001929998,0.00003742623,0.00000932676,0.000016016646,0.00014418089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993205,0.000018280718,0.00023053725,0.00016753361,0.000094228475,0.00016890166],"domain_scores_gemma":[0.99940574,0.00007572107,0.000112953996,0.0002559407,0.00006205969,0.000087568544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000084186526,0.00012206177,0.00023239595,0.000019158262,0.000080243015,0.000009939659,0.00013063852,0.00003467557,0.00045096286],"category_scores_gemma":[0.000009115721,0.00011280552,0.0000618374,0.00011474088,0.00011668809,0.000084053696,0.000079607096,0.00008306804,0.000016955904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015520895,0.00013739383,0.0028670428,0.000010257765,0.00003210409,2.6944937e-7,0.0002907367,1.5368627e-7,0.00040234058,0.9954153,0.00018024519,0.00064865226],"study_design_scores_gemma":[0.000902714,0.00004083087,0.00040179203,0.000009893882,0.000023981163,4.557554e-7,0.00017204508,0.000017272672,0.011152114,0.9859333,0.0012216825,0.00012391563],"about_ca_topic_score_codex":0.000105200634,"about_ca_topic_score_gemma":2.8980193e-7,"teacher_disagreement_score":0.06595857,"about_ca_system_score_codex":0.0000066286802,"about_ca_system_score_gemma":0.000016119951,"threshold_uncertainty_score":0.49377272},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.933589,0.0002751733,0.008383071,0.00004845486,0.0018687197,0.00010416594,7.192673e-7,0.0001860942,0.05554461],"genre_scores_gemma":[0.98356915,0.000015836258,0.016238995,0.00008069723,0.0000026257253,0.0000041017797,3.0534343e-7,0.0000046891414,0.0000835889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993406,0.000027545548,0.00015006936,0.0001834933,0.00013267147,0.0001656213],"domain_scores_gemma":[0.9993327,0.000047489,0.00008184808,0.0004306488,0.000057772122,0.00004954153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009907441,0.00008294655,0.00013039293,0.00005317165,0.000041324452,0.000010629187,0.00064775895,0.000027162134,0.00002231373],"category_scores_gemma":[0.0000231432,0.00007303477,0.00004146209,0.00025272422,0.000059430946,0.0003295008,0.0001763027,0.00006852319,0.00005243178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019572665,0.000059748276,0.0027596673,0.0000050325184,0.000006397192,0.000006206968,0.0007498096,0.0000021871797,0.00021630674,0.9922658,0.00005832863,0.0038685433],"study_design_scores_gemma":[0.00038094918,0.00009048827,0.0076826965,0.0000075673547,0.0000035063042,0.0000028203785,0.000049047758,0.0003587102,0.008448911,0.98253787,0.000333088,0.00010437849],"about_ca_topic_score_codex":0.00003466723,"about_ca_topic_score_gemma":0.0000023977937,"teacher_disagreement_score":0.055461023,"about_ca_system_score_codex":0.000008932544,"about_ca_system_score_gemma":0.000022407208,"threshold_uncertainty_score":0.29782715},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.938382,0.0002425099,0.034632366,0.0003620386,0.0036880164,0.0002833795,0.000002059816,0.00040216072,0.022005456],"genre_scores_gemma":[0.99770707,0.0000060629195,0.0018024592,0.00016159085,0.000011443928,0.00001903918,8.295602e-7,0.000013976259,0.00027750607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864113,0.00010888313,0.00012308455,0.00023791296,0.00034198596,0.0005469923],"domain_scores_gemma":[0.9987076,0.00028031995,0.000043732052,0.0007135098,0.00004970737,0.0002051587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047312558,0.0001240342,0.0001203193,0.00011536015,0.00012052416,0.00006202569,0.0008268794,0.000052241016,0.000026514903],"category_scores_gemma":[0.00012413153,0.00011789208,0.000051196934,0.0004042837,0.000050750787,0.00072478305,0.00030304055,0.00024174355,0.00040255312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008151614,0.00010131128,0.0017181339,0.0000034246152,0.0000074865316,0.0000040150508,0.00012319288,0.000021937578,0.00031112594,0.9950334,0.0006011164,0.0020666986],"study_design_scores_gemma":[0.00042408612,0.00015683794,0.0032020742,0.000012559775,0.0000012903296,0.0000057378948,0.0000104635965,0.00063833897,0.0066664782,0.98564106,0.0030582945,0.00018276602],"about_ca_topic_score_codex":0.000004481632,"about_ca_topic_score_gemma":3.2435614e-7,"teacher_disagreement_score":0.05932508,"about_ca_system_score_codex":0.000076467244,"about_ca_system_score_gemma":0.000030651536,"threshold_uncertainty_score":0.51741403},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.837471,0.00017158782,0.03367943,0.00055661873,0.0060772635,0.00067141815,0.0000032935557,0.001189243,0.120180115],"genre_scores_gemma":[0.98891467,0.0000073644483,0.010616392,0.00021648464,0.0000046941127,0.000023169407,7.1604336e-7,0.000020159887,0.00019636602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983334,0.00012805466,0.00017955898,0.00047345363,0.000383944,0.000501584],"domain_scores_gemma":[0.99851966,0.00012827462,0.00006952413,0.0010032488,0.00009126712,0.00018800404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000434294,0.00017249271,0.00016893465,0.0002508208,0.00019425541,0.000069114496,0.0014221654,0.000069847025,0.00004117013],"category_scores_gemma":[0.00009932906,0.00016586889,0.00008713307,0.00080196466,0.000106390864,0.00047256058,0.00033757943,0.00030109184,0.00035819213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022807482,0.000097067124,0.000733522,0.0000037171599,0.000009931646,0.00005645295,0.00096334645,0.0000022731224,0.00041079748,0.9914211,0.00022855024,0.0060504256],"study_design_scores_gemma":[0.00047062783,0.00029413556,0.0048378464,0.000022569691,0.0000019393217,0.000006880506,0.00001607225,0.00048787106,0.0078109517,0.98491037,0.0009363282,0.00020439184],"about_ca_topic_score_codex":0.00001757254,"about_ca_topic_score_gemma":0.000001582446,"teacher_disagreement_score":0.15144362,"about_ca_system_score_codex":0.00004104372,"about_ca_system_score_gemma":0.000044377157,"threshold_uncertainty_score":0.6763937},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9718015,0.00019810682,0.019055815,0.0004030761,0.0022157275,0.00017194892,0.0000036533172,0.000308917,0.0058412636],"genre_scores_gemma":[0.992368,0.0000063123666,0.007290019,0.00022452051,0.000006245998,0.0000115659195,0.0000031497493,0.000012067102,0.00007810646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986757,0.00013348163,0.00028824294,0.00031997214,0.00031156192,0.00027105527],"domain_scores_gemma":[0.99846363,0.00023297011,0.00015669892,0.00096747186,0.00008276262,0.00009646736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005898841,0.00014778995,0.00028397617,0.000104495724,0.00008299608,0.000051985782,0.0011708876,0.000060938262,0.000030469133],"category_scores_gemma":[0.0000657573,0.00013955754,0.000109444496,0.00037236974,0.00011738969,0.00023516364,0.00026320785,0.000103758844,0.00006088621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004686324,0.00006446563,0.0004970646,0.000012843797,0.000013752797,0.0000029906844,0.00010681263,0.0000020711943,0.0018192129,0.9887438,0.0014557168,0.007276582],"study_design_scores_gemma":[0.000789245,0.00017818657,0.0040363525,0.000026241543,0.000006259388,0.0000121988305,0.000007984249,0.006151357,0.011238022,0.97182906,0.0055535845,0.00017149461],"about_ca_topic_score_codex":0.000026570995,"about_ca_topic_score_gemma":5.365427e-7,"teacher_disagreement_score":0.020566521,"about_ca_system_score_codex":0.0000152284265,"about_ca_system_score_gemma":0.000021101048,"threshold_uncertainty_score":0.5690991},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8697391,0.00023081707,0.10107455,0.0017830116,0.006761093,0.00090527354,0.0000065779213,0.0006304144,0.018869158],"genre_scores_gemma":[0.98987377,0.0000040543296,0.00916668,0.00014964963,0.000009335443,0.0001427871,0.0000030419887,0.000007828318,0.0006428327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990842,0.000045282217,0.00017322204,0.000300827,0.00013203848,0.00026442815],"domain_scores_gemma":[0.99884903,0.0002884521,0.00006942745,0.0005322236,0.00016814277,0.00009273408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002727273,0.00010737321,0.000105330866,0.00006517905,0.00029983665,0.0002797034,0.00075648254,0.00006299092,0.00009121534],"category_scores_gemma":[0.000106851214,0.00010798052,0.00010127942,0.00043607742,0.00006891376,0.00075409346,0.00013268623,0.00011230631,0.00034143863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020999196,0.000045347693,0.0040377816,0.0000040639948,0.00000815548,4.0395264e-7,0.00023713276,0.0000041227077,0.00004596108,0.981585,0.006459388,0.007570512],"study_design_scores_gemma":[0.00037556555,0.000072765484,0.008593094,0.000012670929,0.0000033900749,0.0000024443932,0.000009578626,0.0020099424,0.0002804969,0.97757876,0.010907382,0.00015391281],"about_ca_topic_score_codex":0.00002017868,"about_ca_topic_score_gemma":0.0000012032825,"teacher_disagreement_score":0.12013469,"about_ca_system_score_codex":0.000020495938,"about_ca_system_score_gemma":0.00003346866,"threshold_uncertainty_score":0.4403318},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9702181,0.00013809612,0.00000984722,0.0000048538955,0.009190222,0.00018178335,0.0000059599006,0.00018781403,0.020063316],"genre_scores_gemma":[0.9993552,0.0000034491293,0.00003566321,0.000003682515,0.000020033634,0.00003172185,0.0000038733856,0.00003565337,0.00051070866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991766,0.000039638006,0.00031040382,0.000111204856,0.00016118438,0.0002009204],"domain_scores_gemma":[0.99937695,0.000054874006,0.00005069485,0.00039750594,0.000046747027,0.00007321588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025197468,0.0001415611,0.00027113257,0.000053981563,0.000034679702,0.000022607204,0.00019411226,0.00012197138,0.00016536452],"category_scores_gemma":[0.00002365333,0.00013128885,0.00007998219,0.0001937183,0.000039540384,0.00010370454,0.00001789635,0.00019331295,0.00023673635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004702473,0.00005132211,0.0077743605,0.00037413204,0.00008232949,0.000004401994,0.00029227452,0.000081846905,0.02955133,0.95845807,0.0032303042,0.00009492856],"study_design_scores_gemma":[0.010384366,0.0003138178,0.031502124,0.0010608246,0.00034236093,0.0004802549,0.0017298496,0.033506114,0.10302637,0.7387272,0.07577901,0.0031477201],"about_ca_topic_score_codex":0.00002361835,"about_ca_topic_score_gemma":0.0000021186243,"teacher_disagreement_score":0.21973087,"about_ca_system_score_codex":0.000012628263,"about_ca_system_score_gemma":0.000009628574,"threshold_uncertainty_score":0.53538036},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954529,0.000033572545,0.00010771907,0.00012511003,0.00011839283,0.000184336,0.000006295235,0.000022185202,0.0039495034],"genre_scores_gemma":[0.99967057,0.000006645329,0.00018501814,0.000018186727,0.0000026183898,0.000021640883,0.00000229192,0.000012988601,0.00008003706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914116,0.0001473037,0.00031192528,0.00011418846,0.00014777282,0.00013764758],"domain_scores_gemma":[0.99784243,0.0013155184,0.0002375489,0.00044035574,0.00012553933,0.0000386053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047540423,0.000096096934,0.00019593952,0.0000509701,0.00011235195,0.000007050342,0.0003080268,0.00006197579,0.000008392635],"category_scores_gemma":[0.00023855192,0.00007102512,0.00009775185,0.00029618666,0.00023248118,0.000036529043,0.000056198023,0.0000915707,0.000003881724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020768524,0.00015340782,0.0012643031,0.000014856523,0.000044253124,1.0637044e-7,0.00026548599,3.23588e-7,0.006603855,0.99064183,0.00033633204,0.0006544532],"study_design_scores_gemma":[0.00044271236,0.000093846465,0.0056869336,0.000022531152,0.00003487088,7.511573e-7,0.000121898,0.000087806526,0.024810227,0.9684854,0.0001408313,0.000072201205],"about_ca_topic_score_codex":0.000015141139,"about_ca_topic_score_gemma":0.0000059565264,"teacher_disagreement_score":0.022156462,"about_ca_system_score_codex":0.0000061413966,"about_ca_system_score_gemma":0.00001588034,"threshold_uncertainty_score":0.28963205},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9555675,0.0001244065,0.000009163277,0.000038574843,0.0018019775,0.00010670648,0.000021270618,0.00019151962,0.04213892],"genre_scores_gemma":[0.99980026,0.000012924351,0.000017176966,0.000041530304,0.000013227061,0.0000037386644,0.000014130175,0.000014864605,0.000082144994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992073,0.000042875192,0.00027226075,0.00013482377,0.00015190501,0.0001908448],"domain_scores_gemma":[0.99940336,0.0001103839,0.000045537323,0.00035516376,0.000025742842,0.00005979435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023506573,0.0001344917,0.00019577051,0.00008315298,0.00003311561,0.000011728331,0.00017450265,0.0000650362,0.000010717633],"category_scores_gemma":[0.000039602062,0.00013391298,0.00007172067,0.00022820826,0.000020427038,0.00006738777,0.000007926719,0.00013588628,0.000079600795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008465709,0.000077908655,0.00014196393,0.00002361863,0.000028091503,0.000011713983,0.00038076556,0.0025853938,0.002027494,0.99053377,0.0030957013,0.00100892],"study_design_scores_gemma":[0.004305799,0.0007027152,0.008586437,0.0002148674,0.000026058002,0.0000059846125,0.00013271523,0.002531448,0.028911266,0.94956994,0.004530146,0.0004826328],"about_ca_topic_score_codex":0.0000052058313,"about_ca_topic_score_gemma":0.0000012204861,"teacher_disagreement_score":0.0442328,"about_ca_system_score_codex":0.000020850155,"about_ca_system_score_gemma":0.0000047277763,"threshold_uncertainty_score":0.5460813},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9890258,0.000951162,0.0011663265,0.0017118404,0.0009318991,0.0002192218,7.43007e-7,0.000083210696,0.0059098215],"genre_scores_gemma":[0.9986492,0.00010939254,0.0009584217,0.000105209474,0.0000015883145,0.0000040030795,1.6800362e-7,0.000004970103,0.00016706368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895406,0.00008480981,0.00015410676,0.0002297728,0.00028797175,0.00028926396],"domain_scores_gemma":[0.9988758,0.00026907222,0.00005450217,0.00062385254,0.00009144675,0.000085339765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000411753,0.000095428106,0.00011750965,0.00006341479,0.00018512538,0.00006805762,0.0007833177,0.000037567595,0.0000034665056],"category_scores_gemma":[0.000078525925,0.000069220056,0.000051572388,0.0004459252,0.00020814453,0.00024215125,0.00021050693,0.00014686552,0.000010066949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011419545,0.00003773298,0.0009226738,0.000001960822,0.0000070575798,0.000004448544,0.00012569722,0.0000019366,0.00031573328,0.98329186,0.0002703458,0.015009149],"study_design_scores_gemma":[0.0003036655,0.00016959643,0.008248077,0.0000087026165,0.0000019908061,0.0000062796835,0.000018182394,0.0003600407,0.0010361632,0.9889733,0.00079107546,0.00008289429],"about_ca_topic_score_codex":0.000004688815,"about_ca_topic_score_gemma":0.0000010518629,"teacher_disagreement_score":0.014926255,"about_ca_system_score_codex":0.000012200817,"about_ca_system_score_gemma":0.000024936135,"threshold_uncertainty_score":0.28227118},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9436171,0.0008372571,0.0000113230535,0.00007092763,0.00064306415,0.000038289087,0.0000022779532,0.00005017255,0.054729592],"genre_scores_gemma":[0.99894834,0.000028203816,0.00022240946,0.000023499137,0.000030845727,0.0000127402445,0.0000037575842,0.000024309715,0.0007058808],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990266,0.00002168168,0.00027702612,0.00012383543,0.00025806398,0.00029279705],"domain_scores_gemma":[0.99912626,0.00015905233,0.00012420294,0.00041513232,0.000070028735,0.000105305575],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022149397,0.00014323287,0.00026538703,0.000035100846,0.00006228127,0.000015310829,0.0002531091,0.00009491302,0.0021458974],"category_scores_gemma":[0.0001273261,0.00012087687,0.00008404189,0.000112125665,0.000063611544,0.00013412477,0.00008670607,0.000102165286,0.000054634573],"study_design_candidate":"observational","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.00035640594,0.0016624613,0.81682736,0.00080329605,0.00056268496,0.0000050626627,0.004679921,0.000014752005,0.075874485,0.049353242,0.011523753,0.038336553],"study_design_scores_gemma":[0.012437272,0.0002055291,0.055803888,0.0008419481,0.00036972042,0.00006195284,0.0020665429,0.0015558904,0.63141423,0.20249505,0.09056648,0.002181486],"about_ca_topic_score_codex":0.000075261945,"about_ca_topic_score_gemma":0.0000013963626,"teacher_disagreement_score":0.7610235,"about_ca_system_score_codex":0.000029653453,"about_ca_system_score_gemma":0.000036163132,"threshold_uncertainty_score":0.9987663},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9956259,0.00011555903,0.000042083208,0.0011248343,0.00070682756,0.00014498737,0.0000010243195,0.000051707564,0.0021870427],"genre_scores_gemma":[0.9991529,0.00000869721,0.0004033209,0.0003913316,5.659746e-7,0.0000047302788,6.731583e-7,0.0000042289744,0.00003355729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988277,0.00008810317,0.00029438132,0.00022507677,0.00036966914,0.00019506612],"domain_scores_gemma":[0.99875873,0.00016337766,0.00018709598,0.0007100197,0.00012554043,0.00005526125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039616248,0.00011384317,0.00019354232,0.00011051249,0.00008733294,0.00003224742,0.000742886,0.000045186116,0.0000039631245],"category_scores_gemma":[0.00005466603,0.00007919623,0.00009853235,0.0005674959,0.000094758136,0.000104937724,0.00007614645,0.00011365903,0.000009475916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011051968,0.00023818447,0.0004350158,0.000003447339,0.000014264931,0.0000018649872,0.00030242422,0.000021236561,0.010054694,0.9870929,0.0010191965,0.00080572814],"study_design_scores_gemma":[0.0007618082,0.0004370307,0.003343874,0.000045682442,0.000006137581,0.0000013300238,0.000012826933,0.0010612478,0.03239996,0.9617572,0.000086219574,0.00008671509],"about_ca_topic_score_codex":0.000030540552,"about_ca_topic_score_gemma":9.27871e-7,"teacher_disagreement_score":0.025335724,"about_ca_system_score_codex":0.000009950776,"about_ca_system_score_gemma":0.00003531199,"threshold_uncertainty_score":0.32295284},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86951643,0.0003378904,0.023488354,0.0003825309,0.004155176,0.0006245724,0.0000031317925,0.0010319076,0.10046001],"genre_scores_gemma":[0.9948833,0.000011471966,0.0044493843,0.00020071414,0.0000036223926,0.000028551805,8.848089e-7,0.00001893774,0.00040312987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982702,0.00013096347,0.00017832873,0.0004855621,0.00045050768,0.0004844327],"domain_scores_gemma":[0.9982272,0.00015649959,0.000060710336,0.001262246,0.00010102692,0.00019231539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038777463,0.00017753325,0.0001704887,0.00023117589,0.00016868567,0.000060749495,0.0016481428,0.00007284332,0.000066547276],"category_scores_gemma":[0.00009656689,0.00016443725,0.00010048892,0.0007868561,0.00013449694,0.00047428912,0.00032653013,0.00025671403,0.0004387741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018847155,0.00015834557,0.0004910648,0.0000036064048,0.00001596125,0.000044601897,0.0003674715,0.0000013888036,0.00020050093,0.99366945,0.0008477029,0.0041810567],"study_design_scores_gemma":[0.00045960804,0.00030243944,0.0022808528,0.00001354527,0.000002145405,0.0000060549264,0.000011557126,0.00021441789,0.008979017,0.98658097,0.0009528909,0.0001965259],"about_ca_topic_score_codex":0.000011910539,"about_ca_topic_score_gemma":0.0000011461241,"teacher_disagreement_score":0.12536688,"about_ca_system_score_codex":0.000035801044,"about_ca_system_score_gemma":0.00003775853,"threshold_uncertainty_score":0.67055565},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.861386,0.008737967,0.01714348,0.0030770325,0.033712298,0.0025100613,0.00003948372,0.00092297734,0.07247069],"genre_scores_gemma":[0.98859763,0.00017921333,0.004930952,0.00014872325,0.000040754938,0.000046441037,0.000018745779,0.00007828998,0.005959229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99416596,0.00093204406,0.0006619782,0.0012018337,0.001691953,0.0013462168],"domain_scores_gemma":[0.99508923,0.00046720452,0.00033025397,0.0019849732,0.0012475528,0.000880794],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0036123684,0.0005109681,0.0005701664,0.00064080564,0.0004277185,0.00053552305,0.0024300169,0.0002995474,0.000067391025],"category_scores_gemma":[0.00097046694,0.0005572891,0.00021371007,0.0029838104,0.0003047465,0.0020538894,0.0011420819,0.00079876074,0.0011674671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012591887,0.00038192607,0.00045090498,0.00004658638,0.000055286073,0.00020202603,0.001368663,0.000077881916,0.00056778465,0.97340107,0.009604199,0.013717765],"study_design_scores_gemma":[0.0029484937,0.00055863016,0.00031498194,0.000091077985,0.000024992261,0.00006947267,0.0002624148,0.011894154,0.0042784116,0.9518277,0.027117217,0.0006124712],"about_ca_topic_score_codex":0.00008580092,"about_ca_topic_score_gemma":0.000013792312,"teacher_disagreement_score":0.12721163,"about_ca_system_score_codex":0.0005034716,"about_ca_system_score_gemma":0.00068901945,"threshold_uncertainty_score":0.99968785},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9829952,0.000020059622,0.0000054697302,0.0000083030345,0.003760247,0.0002212225,0.000008386045,0.00016341287,0.012817708],"genre_scores_gemma":[0.99978524,0.0000025878394,0.000039145136,0.000012610167,0.00001168226,0.000053809403,0.000010515622,0.00002274957,0.00006167481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992956,0.000030711948,0.000185347,0.00013854375,0.00010775609,0.00024204848],"domain_scores_gemma":[0.9996154,0.00007313719,0.000021251228,0.00022230257,0.000017645423,0.000050310355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021352877,0.00012842951,0.00014997067,0.00011587299,0.0000378977,0.000022349825,0.00017108434,0.00008238213,0.000074839234],"category_scores_gemma":[0.000023221437,0.00013248758,0.000032621505,0.00022616971,0.000023549299,0.00009960407,0.000020593532,0.00030854635,0.000117688076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024982148,0.00012758272,0.06196778,0.000092064634,0.000064010455,0.00004815914,0.0025826795,0.0003444657,0.0122021055,0.91986656,0.0018633943,0.00081619155],"study_design_scores_gemma":[0.003947455,0.00013977052,0.07381539,0.00010547469,0.000020040528,0.000031859636,0.0007766584,0.009024689,0.010112865,0.8835774,0.017505882,0.00094253547],"about_ca_topic_score_codex":0.000038022266,"about_ca_topic_score_gemma":0.00007810891,"teacher_disagreement_score":0.036289208,"about_ca_system_score_codex":0.000021547932,"about_ca_system_score_gemma":0.000009534007,"threshold_uncertainty_score":0.54026866},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7586583,0.000015562022,0.0057564713,0.0024768005,0.002789065,0.0006080858,0.000004653442,0.00050374796,0.2291873],"genre_scores_gemma":[0.9852443,0.0000016645085,0.0023736414,0.0007180182,0.000039927214,0.00006460405,0.000015483723,0.0000410629,0.011501349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986891,0.00010840328,0.00035589884,0.0002441471,0.0003627735,0.00023969139],"domain_scores_gemma":[0.99870026,0.00047716527,0.00011805974,0.00047828103,0.000114941075,0.00011131386],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004770244,0.00019227705,0.0002482955,0.00008886406,0.0001689313,0.000092969145,0.00017396852,0.0001269627,0.0012656562],"category_scores_gemma":[0.0009835674,0.00015434255,0.000106182604,0.00014902084,0.000048283957,0.00019119475,0.000033970504,0.00021025472,0.0015158984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014978574,0.00035073952,0.00001920177,0.00004274573,0.000020946401,5.65503e-7,0.00015709804,7.5800165e-7,0.00006959654,0.961006,0.03744988,0.0008674833],"study_design_scores_gemma":[0.0005766165,0.00021537355,0.000055835644,0.000045914538,0.000026318743,0.0000021378914,0.000055506356,0.0031343505,0.0007223985,0.97683734,0.018141594,0.00018658936],"about_ca_topic_score_codex":0.0000040392065,"about_ca_topic_score_gemma":0.0000026315602,"teacher_disagreement_score":0.22658594,"about_ca_system_score_codex":0.00007835576,"about_ca_system_score_gemma":0.000021652375,"threshold_uncertainty_score":0.9996473},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9587437,0.0032113849,0.01852441,0.0032987609,0.010840116,0.0003007128,0.0000023010994,0.00056881394,0.004509801],"genre_scores_gemma":[0.9978488,0.000033328426,0.0007111534,0.0012580233,0.00006161939,0.000018182336,0.0000011233482,0.000009957679,0.000057801335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988544,0.0001892671,0.00014633313,0.00020024153,0.00022455759,0.00038520969],"domain_scores_gemma":[0.9988183,0.00025880855,0.00006317039,0.00072190573,0.0000228072,0.0001150095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077623496,0.00013494772,0.00011909602,0.000061637445,0.00028154158,0.00014393008,0.0011618641,0.000053468644,0.000015519052],"category_scores_gemma":[0.0000149330635,0.00009409498,0.000091574904,0.00034174672,0.000093862865,0.0008502341,0.0003985039,0.0001805369,0.0001135217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004311302,0.00011975607,0.0023200843,0.0000025887766,0.000024537154,0.0000027798662,0.00042566122,0.0000016638893,0.00027740325,0.99455714,0.0013070526,0.0009570329],"study_design_scores_gemma":[0.0002508056,0.00005659691,0.0155499615,0.000010081177,0.000008978081,0.000017900134,0.00005896442,0.00028999956,0.00035736433,0.9781801,0.0050638593,0.00015535706],"about_ca_topic_score_codex":0.000015915917,"about_ca_topic_score_gemma":9.5237135e-7,"teacher_disagreement_score":0.039105114,"about_ca_system_score_codex":0.000021384,"about_ca_system_score_gemma":0.000016398022,"threshold_uncertainty_score":0.3837082},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9547833,0.000041701933,0.000030143494,0.00035003983,0.00020628927,0.000117024494,0.0000014504001,0.000015908152,0.0444541],"genre_scores_gemma":[0.99957114,0.000007745459,0.000060866572,0.00024455908,0.000014262995,0.0000091815655,0.000016389247,0.0000075021203,0.00006837699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937165,0.000012500827,0.00020900005,0.00013074186,0.00015207526,0.00012402947],"domain_scores_gemma":[0.9994184,0.00002647662,0.0001675667,0.0002725319,0.000110988876,0.0000040751925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003347953,0.00007814001,0.000120699544,0.00010174055,0.00004771829,0.000056118944,0.00027215815,0.000031065803,0.000083073595],"category_scores_gemma":[0.00006729019,0.000059679434,0.00004644868,0.00040059895,0.000032992808,0.00041976065,0.000039570743,0.000080074955,0.000079504134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018017807,0.00020361162,0.042227164,0.000041780102,0.0000168653,0.000007421337,0.00028290972,0.0000013332925,0.00023257454,0.95294034,0.0032358586,0.0007921006],"study_design_scores_gemma":[0.0006644567,0.00002123132,0.49221742,0.000050466722,0.0000695434,6.81419e-7,0.0012387644,0.0050619845,0.00016589029,0.4940685,0.0062377686,0.00020330146],"about_ca_topic_score_codex":0.0004825441,"about_ca_topic_score_gemma":0.00010246391,"teacher_disagreement_score":0.45887187,"about_ca_system_score_codex":0.000010525351,"about_ca_system_score_gemma":0.0000079720885,"threshold_uncertainty_score":0.24336568},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99004614,0.00003090924,0.007223119,0.000860713,0.0009619964,0.00011769,5.129725e-7,0.000023869252,0.00073504815],"genre_scores_gemma":[0.9981227,0.0000026000378,0.0016100261,0.00022704384,0.0000042056577,0.0000059025547,0.0000019327606,0.000002628373,0.000022989247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907374,0.00010088722,0.00016767938,0.00017725147,0.00035430366,0.00012611195],"domain_scores_gemma":[0.9991225,0.0002785119,0.00007527763,0.000308715,0.00015921377,0.00005575374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007257766,0.0000719403,0.00010365451,0.00024345287,0.00004020637,0.000041562234,0.00042861886,0.000036412905,0.000002639855],"category_scores_gemma":[0.00036503718,0.000055677323,0.00002950051,0.0017312018,0.00002542562,0.00020793983,0.000111325,0.000104705876,0.000029630224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000115897965,0.0001490575,0.0050311075,0.0000040633377,0.000005414406,0.0000119761735,0.00079762354,0.002698657,0.00043169293,0.9792685,0.0010442857,0.010546011],"study_design_scores_gemma":[0.0011635043,0.00041341395,0.07625018,0.00003106833,0.0000043401105,0.0000142142635,0.00005357976,0.078239985,0.020091018,0.8229874,0.0005209109,0.00023041217],"about_ca_topic_score_codex":0.00005904096,"about_ca_topic_score_gemma":0.000009913811,"teacher_disagreement_score":0.15628114,"about_ca_system_score_codex":0.00007233506,"about_ca_system_score_gemma":0.00013402989,"threshold_uncertainty_score":0.22704554},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91454124,0.0006056732,0.07165041,0.0023920794,0.004717882,0.00044654816,4.2565756e-7,0.0005328461,0.005112911],"genre_scores_gemma":[0.9910609,0.0000020798493,0.008320025,0.00022525321,0.00002105026,0.0000140090015,4.381604e-7,0.000013654389,0.00034256733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983663,0.00020533809,0.00024086486,0.0004189117,0.00035770386,0.00041089248],"domain_scores_gemma":[0.9988782,0.00021808583,0.00008784764,0.0005944992,0.00006193454,0.00015944112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009219899,0.00016948802,0.0002099472,0.00015419026,0.000078544654,0.0001393159,0.0009035251,0.00006798052,0.0000020000266],"category_scores_gemma":[0.00015033309,0.00016690159,0.000044187014,0.00069742376,0.000028693421,0.0000538924,0.0004078182,0.00023132855,0.00012255674],"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.000035601217,0.0003562801,0.0034411051,0.000027539623,0.000029880126,0.00029334126,0.0059871105,0.28418115,0.000056245608,0.6915413,0.0069781966,0.0070722234],"study_design_scores_gemma":[0.0016609343,0.00017244145,0.002498254,0.00008992622,0.000004658603,0.000007288861,0.00010199646,0.855337,0.00021129273,0.13447727,0.005089618,0.00034929355],"about_ca_topic_score_codex":0.00008942238,"about_ca_topic_score_gemma":0.000003827164,"teacher_disagreement_score":0.5711559,"about_ca_system_score_codex":0.00011938281,"about_ca_system_score_gemma":0.0000822606,"threshold_uncertainty_score":0.68060493},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9538549,0.000015873084,0.0037929933,0.0074286903,0.013587952,0.00039582988,0.0000013564276,0.00049920735,0.020423185],"genre_scores_gemma":[0.995068,0.0000013162899,0.003654422,0.0010088219,0.000027808097,0.000026211574,8.1225295e-7,0.000013990681,0.0001986225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982329,0.00013567248,0.00022756131,0.00052445487,0.0004739076,0.00040549136],"domain_scores_gemma":[0.99698937,0.00093796337,0.00008926824,0.0017281108,0.00011421406,0.00014107767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008138923,0.00020564724,0.00017916756,0.00005649715,0.0002746507,0.00026854352,0.0022727966,0.00011061008,0.00012068687],"category_scores_gemma":[0.0003822989,0.0001461226,0.00011095727,0.00051663606,0.00014314977,0.00023216491,0.0005534941,0.0006683503,0.00058444083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021696005,0.00013045454,0.00057594734,0.0000019445495,0.000009031253,0.00000850071,0.00022856849,0.000008716695,0.00021424128,0.98749167,0.0058036526,0.005525082],"study_design_scores_gemma":[0.0003359254,0.00010461718,0.004520136,0.000004635511,0.0000030803062,0.000014777118,0.000011222124,0.010057138,0.000999103,0.97751874,0.0062151267,0.0002155166],"about_ca_topic_score_codex":0.000058254234,"about_ca_topic_score_gemma":0.000018628547,"teacher_disagreement_score":0.04121308,"about_ca_system_score_codex":0.00004495538,"about_ca_system_score_gemma":0.00008275431,"threshold_uncertainty_score":0.75119996},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99368155,0.000058502465,0.0024216322,0.00022872536,0.00030879516,0.00016063672,7.6491625e-7,0.000026641488,0.0031127275],"genre_scores_gemma":[0.9979921,0.00001007357,0.001851067,0.00009472918,0.0000033382344,0.000014534216,9.0510446e-7,0.000007851847,0.000025418492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780846,0.0006934352,0.00029710372,0.00032609067,0.00050091353,0.00037398317],"domain_scores_gemma":[0.9983428,0.0006092862,0.000085729,0.0008455724,0.000068634756,0.000047978516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002547542,0.00012217066,0.00021264839,0.0002155204,0.000060358998,0.000049842936,0.001369042,0.00007363144,0.0000043473674],"category_scores_gemma":[0.00019941169,0.00009942189,0.00006586546,0.0015637592,0.00014976751,0.00031572676,0.00019523005,0.00036649007,0.000010509477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001238599,0.00014198454,0.069906905,0.000009889114,0.0000028834986,0.000012457514,0.0012731133,0.000009170564,0.00035329792,0.92544794,0.000024422692,0.0028055434],"study_design_scores_gemma":[0.00061030436,0.0000404774,0.09438747,0.000035326648,8.500437e-7,0.000010300651,0.00005057852,0.0017007468,0.0009294073,0.9019827,0.00014742506,0.00010438176],"about_ca_topic_score_codex":0.00019493833,"about_ca_topic_score_gemma":0.00006890265,"teacher_disagreement_score":0.024480566,"about_ca_system_score_codex":0.000037144873,"about_ca_system_score_gemma":0.000044667006,"threshold_uncertainty_score":0.40543073},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9699549,0.000088011635,0.0000091369975,0.000027788165,0.0028404077,0.00017099315,0.0000022669774,0.00033241193,0.026574051],"genre_scores_gemma":[0.9993269,0.00000854023,0.000009664095,0.000051437797,0.0000052672017,0.000060877977,0.000003756413,0.000027703607,0.0005058534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992961,0.000037054062,0.00014948407,0.00014022614,0.00013227545,0.0002448113],"domain_scores_gemma":[0.9994609,0.00008413087,0.000018826242,0.00032074848,0.000021382119,0.000094060626],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007573509,0.00015263603,0.00015639146,0.00005377374,0.000056528403,0.000046574736,0.00019849843,0.00008220862,0.00022725681],"category_scores_gemma":[0.000016994923,0.00013973303,0.000052429452,0.00010253195,0.000024507528,0.000083388506,0.000019011537,0.00016196215,0.0013367491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032588307,0.00004131764,0.0010562246,0.00004051006,0.00003338044,0.0000045292372,0.00031550063,0.0001226957,0.0025171565,0.98266613,0.011571384,0.0016278826],"study_design_scores_gemma":[0.0004191149,0.00007690484,0.014194001,0.000052026266,0.000006407305,0.000003682938,0.00006745016,0.0018249942,0.002346256,0.97981524,0.00093621004,0.00025772408],"about_ca_topic_score_codex":0.000017580818,"about_ca_topic_score_gemma":0.0000015346322,"teacher_disagreement_score":0.029371966,"about_ca_system_score_codex":0.000028292061,"about_ca_system_score_gemma":0.000004015011,"threshold_uncertainty_score":0.99944085},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7337517,0.00025421174,0.24135534,0.0101727,0.0028227477,0.00066772546,0.0000052222294,0.0007432651,0.010227092],"genre_scores_gemma":[0.9968033,0.000005483382,0.0019323925,0.00078419794,0.0000059228787,0.000012916794,0.0000033985646,0.000004549173,0.00044783315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987183,0.00009125465,0.00014299076,0.0003119093,0.00046740272,0.0002681356],"domain_scores_gemma":[0.9987533,0.00044497257,0.000045186775,0.0005625218,0.00009292222,0.00010109271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023111945,0.00010876067,0.00010382868,0.00013579939,0.00018750191,0.000103965474,0.0008424511,0.00004103634,0.000017818706],"category_scores_gemma":[0.00025151932,0.000102557555,0.000042916017,0.00041075452,0.00004469698,0.00046642422,0.00008310528,0.0001856087,0.00021515238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070720766,0.000112249894,0.000033220065,7.8354066e-7,0.0000029701152,0.000005376076,0.000056735436,0.000062470186,0.0008042451,0.98966265,0.00029130242,0.008960918],"study_design_scores_gemma":[0.00036598172,0.0002386973,0.004645067,0.000008028314,7.3312845e-7,0.0000013655425,0.0000018815431,0.0072610746,0.0014720625,0.9858147,0.000074063384,0.000116362055],"about_ca_topic_score_codex":8.274775e-7,"about_ca_topic_score_gemma":1.8426788e-7,"teacher_disagreement_score":0.2630516,"about_ca_system_score_codex":0.000055192766,"about_ca_system_score_gemma":0.00006484506,"threshold_uncertainty_score":0.41821757},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99529636,0.00042820207,0.0012371389,0.00008079058,0.0015017112,0.0003687416,0.000004623066,0.00011977874,0.00096266036],"genre_scores_gemma":[0.997173,0.0000067514056,0.0027117904,0.00001735225,0.00001572512,0.000024762747,0.0000013527639,0.000014948429,0.000034309338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997712,0.00037689204,0.00041319965,0.00049048965,0.00040187806,0.0006055095],"domain_scores_gemma":[0.99789375,0.00049679383,0.0001584408,0.00097389217,0.00016430859,0.00031280017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020792224,0.00021451316,0.00037920268,0.00013424769,0.00015224922,0.00005642168,0.0006848922,0.00010123005,0.00002154021],"category_scores_gemma":[0.00074905844,0.00020335935,0.00012693327,0.0006116601,0.00040795628,0.0011985372,0.0007005146,0.0003559504,0.0000104765695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006918503,0.00036767015,0.37755567,0.00006746414,0.000032822387,0.0000010874136,0.0018557791,0.0000013463456,0.0025265028,0.60897154,0.000041994732,0.008508927],"study_design_scores_gemma":[0.0019210933,0.00031697954,0.23295952,0.00003724904,0.000012914326,0.000033942008,0.00037339292,0.0005190209,0.01447923,0.74883795,0.00011101142,0.00039768426],"about_ca_topic_score_codex":0.000051463285,"about_ca_topic_score_gemma":0.0000046164564,"teacher_disagreement_score":0.14459613,"about_ca_system_score_codex":0.00010531658,"about_ca_system_score_gemma":0.000057225057,"threshold_uncertainty_score":0.8292753},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98613507,0.000104140585,0.00015750725,0.0012400313,0.0074948226,0.00011054061,7.5492335e-7,0.0004896671,0.0042674686],"genre_scores_gemma":[0.9915368,0.0000075273783,0.007767468,0.00041059646,0.0000013906431,0.000012373931,0.000001954138,0.000011669829,0.00025020225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998724,0.000035163524,0.00021157078,0.00040113242,0.0002944009,0.00033374858],"domain_scores_gemma":[0.9986119,0.00008078965,0.00007656356,0.0009212187,0.00013132798,0.00017815025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036949822,0.00015209262,0.00014995105,0.00014190114,0.00019435036,0.00015159156,0.0009167216,0.00010757455,0.000032781616],"category_scores_gemma":[0.00006940565,0.00013895854,0.000091286565,0.0005983929,0.000070392554,0.00032801117,0.00022974602,0.0003609586,0.00025353505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011895781,0.000071514216,0.0020478794,0.000002947286,0.0000074165555,0.000008909473,0.00008900067,0.0000014038138,0.005955626,0.9840203,0.005471173,0.0023226687],"study_design_scores_gemma":[0.00044754412,0.000053587064,0.0022829226,0.0000060802927,0.000003642149,0.000016614074,0.0000034885256,0.0009080276,0.0043379837,0.98673177,0.0050173583,0.0001910057],"about_ca_topic_score_codex":0.000038409933,"about_ca_topic_score_gemma":0.000008683723,"teacher_disagreement_score":0.007609961,"about_ca_system_score_codex":0.0000059551044,"about_ca_system_score_gemma":0.000047616933,"threshold_uncertainty_score":0.5666565},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8602808,0.0010437744,0.09184701,0.00011121012,0.018232198,0.00044749744,8.076577e-7,0.00034994,0.027686736],"genre_scores_gemma":[0.9988751,0.00001627325,0.0008309473,0.00006369188,0.000013809952,0.0000088027255,6.472595e-7,0.000008893181,0.00018187836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988704,0.000097546785,0.00033779314,0.00027288377,0.00018646066,0.00023496614],"domain_scores_gemma":[0.9989193,0.00009119363,0.00017696731,0.00058254757,0.00014996468,0.000080010774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039266062,0.000116866955,0.00022281062,0.00014646116,0.000066415254,0.000025231157,0.00061073917,0.00008416499,0.000019060573],"category_scores_gemma":[0.000027046004,0.00010293871,0.00009267191,0.0008095778,0.000031554042,0.00022585629,0.0001864883,0.000105250656,0.000038909806],"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.000010599507,0.00012987155,0.0025001024,0.000008642867,0.000030257406,0.000007650816,0.00052098604,0.00011670424,0.00018632818,0.99029696,0.0037239445,0.0024679299],"study_design_scores_gemma":[0.0021637944,0.0012653894,0.016158883,0.00015868488,0.000040611474,0.00006325289,0.00016242468,0.62923276,0.01423191,0.3318878,0.0037662808,0.00086821674],"about_ca_topic_score_codex":0.00008371679,"about_ca_topic_score_gemma":0.00000193936,"teacher_disagreement_score":0.6584092,"about_ca_system_score_codex":0.000023936347,"about_ca_system_score_gemma":0.00001747019,"threshold_uncertainty_score":0.41977188},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78377336,0.00015247906,0.2115407,0.00057608885,0.0017484864,0.00094577373,0.000005031874,0.0002227578,0.0010353207],"genre_scores_gemma":[0.98152006,0.0000025022782,0.017632391,0.00020255712,0.000009821238,0.00024441336,0.0000025474149,0.000020464424,0.000365244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804956,0.000119851364,0.00021806934,0.0005129552,0.00055128173,0.00054826034],"domain_scores_gemma":[0.99818546,0.00019001162,0.00007012795,0.00079251605,0.00022958919,0.0005322914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063741056,0.00018868255,0.0002306744,0.0002879808,0.00012456838,0.00016571989,0.001649499,0.00006704752,0.0000027305975],"category_scores_gemma":[0.0002014123,0.00016671846,0.00009171103,0.00073637406,0.000057193003,0.000352125,0.000524119,0.00018581127,0.000043081996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006639332,0.00014385034,0.0012096922,0.000009783176,0.000015375472,0.0000083005,0.0006735721,0.000017822778,0.0005153931,0.9909985,0.00089944876,0.0054418542],"study_design_scores_gemma":[0.0015120738,0.00048023788,0.001903643,0.000017674565,0.0000038138628,0.000006655513,0.0000467577,0.0017909812,0.002786331,0.9900379,0.0011974993,0.00021643448],"about_ca_topic_score_codex":0.0000113886645,"about_ca_topic_score_gemma":0.0000037733798,"teacher_disagreement_score":0.1977467,"about_ca_system_score_codex":0.000098409306,"about_ca_system_score_gemma":0.00009450693,"threshold_uncertainty_score":0.67985815},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9546096,0.00004354128,0.00005504998,0.0005625389,0.0005292951,0.0002794979,0.000010662707,0.000037937523,0.04387188],"genre_scores_gemma":[0.9988464,0.000009988221,0.00022122863,0.00007622437,0.00001652907,0.000026685288,0.0000023674188,0.000027019734,0.0007735542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987931,0.00011296606,0.00034162245,0.00009754868,0.00031357762,0.00034114916],"domain_scores_gemma":[0.9964275,0.0025964305,0.00018707027,0.0006389248,0.000069224545,0.000080848324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009168827,0.00013873693,0.00020983157,0.000009673607,0.00018141558,0.000035377056,0.00032076368,0.00007190395,0.00038654375],"category_scores_gemma":[0.00092600274,0.000070636095,0.00010762958,0.00016206792,0.00010073852,0.00006052714,0.000091552094,0.00018033353,0.00027692926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008259831,0.00027774982,0.0019647784,0.000026460124,0.000038884522,3.806591e-7,0.00017873618,1.7638509e-7,0.00006112284,0.98602533,0.011164584,0.0002535051],"study_design_scores_gemma":[0.00021001614,0.000020717314,0.0009116463,0.00002586933,0.000023823271,0.0000022587392,0.00010510712,0.0002920932,0.0006448797,0.9894777,0.008190748,0.00009514362],"about_ca_topic_score_codex":0.000010070647,"about_ca_topic_score_gemma":0.000004146631,"teacher_disagreement_score":0.044236805,"about_ca_system_score_codex":0.000021449492,"about_ca_system_score_gemma":0.000013829454,"threshold_uncertainty_score":0.4232383},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23623648,0.003283128,0.00002585998,0.0005006097,0.013671095,0.00013463311,0.00003984031,0.00004230415,0.74606603],"genre_scores_gemma":[0.9833915,0.0002473951,0.000013097198,0.00006853245,0.000014058597,0.000014517046,0.0000026401874,0.0000057594357,0.01624248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993394,0.0000055339337,0.00024921252,0.00010845168,0.00001992624,0.0002774647],"domain_scores_gemma":[0.9996122,0.000042982083,0.0000963793,0.00018298237,0.000010694217,0.00005472694],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00064612285,0.000067999455,0.00011827061,0.00004599376,0.0003364651,0.00007174817,0.00015706901,0.0000295951,0.00047189862],"category_scores_gemma":[0.000031276875,0.00005860878,0.000071178394,0.00011550919,0.00007160175,0.00037837986,0.000027025373,0.000054180106,0.010196244],"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.0000021364272,0.000021598167,0.010870915,0.0000018054552,0.000021823249,3.7278795e-8,0.0009879762,6.11327e-7,5.465964e-7,0.94316846,0.044571225,0.00035288886],"study_design_scores_gemma":[0.00025723662,0.000008403257,0.010758035,0.0000014427,0.0000026745342,5.516423e-7,0.0005052652,0.000051219962,0.000026780233,0.2707631,0.71752584,0.000099468125],"about_ca_topic_score_codex":0.00002538861,"about_ca_topic_score_gemma":0.0000015529291,"teacher_disagreement_score":0.7471551,"about_ca_system_score_codex":0.000037189482,"about_ca_system_score_gemma":0.0000029296612,"threshold_uncertainty_score":0.9905744},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.984426,0.000046261313,0.00014735431,0.000050693005,0.0032412452,0.00018126743,0.0000026440207,0.00016434683,0.011740169],"genre_scores_gemma":[0.9997301,0.0000021470466,0.00005793171,0.00002393807,0.0000068094505,0.000025329413,8.8420666e-7,0.000022080189,0.00013079715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994085,0.000054545908,0.00015517334,0.00008925612,0.00013206183,0.00016045738],"domain_scores_gemma":[0.9992457,0.000269904,0.0000323734,0.0003802286,0.00002796039,0.000043835476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041042152,0.00010882005,0.0001327971,0.00004919076,0.00006138032,0.000017577266,0.00025332932,0.000079610036,0.0001638974],"category_scores_gemma":[0.00004754906,0.00007829416,0.000058390724,0.0001873484,0.00005930417,0.000043711287,0.000014093358,0.00024306343,0.00009405541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066609896,0.000028779818,0.000103558086,0.000013892536,0.000026419226,0.0000018318558,0.00015938483,0.00022821134,0.025021192,0.9692312,0.004980332,0.00019856311],"study_design_scores_gemma":[0.00030193053,0.000083230225,0.0004508269,0.000027430591,0.000009903219,0.0000057498532,0.000035822595,0.0018106343,0.087913916,0.90840113,0.0008433989,0.00011603411],"about_ca_topic_score_codex":0.000007527014,"about_ca_topic_score_gemma":0.0000020160744,"teacher_disagreement_score":0.06289273,"about_ca_system_score_codex":0.000011671919,"about_ca_system_score_gemma":0.000011066288,"threshold_uncertainty_score":0.3192743},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97301424,0.00027258947,0.0031353105,0.006899718,0.0013457916,0.00021991156,0.0000019349193,0.00015175113,0.014958748],"genre_scores_gemma":[0.99768716,0.000013042793,0.00048572465,0.001741989,0.000009979146,0.0000061049705,5.0465445e-7,0.0000045795964,0.00005092319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998908,0.00018643413,0.00018499354,0.00021938795,0.00028312058,0.00021807391],"domain_scores_gemma":[0.99812233,0.0008036907,0.000107561114,0.0008517886,0.00006773871,0.000046876237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008564355,0.0001248837,0.00013780325,0.00004738949,0.0003894958,0.00008541099,0.0014086978,0.000041165258,0.000015898777],"category_scores_gemma":[0.00015138258,0.00007164952,0.00010657388,0.00055368413,0.00020305502,0.00013414642,0.00013002024,0.00022770342,0.000019903127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014625509,0.00006199819,0.00017310548,0.0000017116229,0.0000131231955,0.0000028975276,0.0008658211,0.000019851113,0.00016593278,0.9951136,0.0009906278,0.0025766713],"study_design_scores_gemma":[0.00017482834,0.00030885058,0.0021224273,0.000037428388,0.000006895183,0.000004164034,0.000098444674,0.0014039294,0.0015712038,0.9919795,0.0021836895,0.000108662716],"about_ca_topic_score_codex":0.000006756872,"about_ca_topic_score_gemma":6.3644234e-7,"teacher_disagreement_score":0.024672907,"about_ca_system_score_codex":0.00001094928,"about_ca_system_score_gemma":0.000048289658,"threshold_uncertainty_score":0.29957262},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900435,0.00006655846,0.0006298468,0.000012887179,0.0004244653,0.00014599337,0.0000047609524,0.00003366116,0.008638316],"genre_scores_gemma":[0.98835486,0.000024269091,0.011498585,0.000010784884,9.024321e-7,0.0000055098676,5.580737e-7,0.000012902312,0.000091635586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985367,0.00011931293,0.00037524413,0.00029171453,0.00040483038,0.00027219846],"domain_scores_gemma":[0.99827355,0.00022731647,0.00028776066,0.0008139893,0.00031472716,0.00008263103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005320976,0.00013882536,0.00032705395,0.00016901677,0.00003447554,0.0000068522086,0.001275428,0.00007240386,0.00004411295],"category_scores_gemma":[0.00009524206,0.00013080254,0.00012181208,0.00072482525,0.00027383096,0.00021627764,0.0002950974,0.00015085257,0.000017233891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048540605,0.00028001328,0.022416433,0.000052954765,0.00003638464,0.000003861516,0.0012592656,0.000008768621,0.0035460608,0.97120523,0.000060352446,0.001082103],"study_design_scores_gemma":[0.00047589946,0.00028726834,0.009935001,0.000053335494,0.000005162555,0.000002299747,0.000050994,0.00025579735,0.15861613,0.83017135,0.000033596767,0.00011319769],"about_ca_topic_score_codex":0.00009075554,"about_ca_topic_score_gemma":0.0000028414945,"teacher_disagreement_score":0.15507007,"about_ca_system_score_codex":0.000013448565,"about_ca_system_score_gemma":0.000048744663,"threshold_uncertainty_score":0.53339726},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9815266,0.00009155042,0.000054116368,0.0009760639,0.0027317377,0.00012475204,8.63453e-7,0.00014786248,0.01434643],"genre_scores_gemma":[0.9980065,0.0000020817417,0.0013993444,0.00036446855,0.000001291568,0.000010897224,0.0000011790363,0.000012961003,0.00020126016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841475,0.00013445347,0.00031674522,0.00030054792,0.0005505848,0.00028293836],"domain_scores_gemma":[0.9982987,0.0002958618,0.00016535781,0.0008730369,0.0002277013,0.00013932957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008799773,0.00016327595,0.00021383773,0.00007052551,0.00016749778,0.00015386939,0.0007426372,0.0000663786,0.000014865125],"category_scores_gemma":[0.0004507632,0.000114111215,0.000101836886,0.00058391015,0.000109835244,0.00019505354,0.0002314271,0.00018634595,0.00014407354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002958362,0.00010303283,0.0029154625,0.000008807893,0.000019606528,0.000004975539,0.0008445698,0.000016426786,0.0001087185,0.98707014,0.008629587,0.00027569424],"study_design_scores_gemma":[0.0005005953,0.000102676895,0.001067286,0.00008352075,0.000008733043,0.000019884685,0.00006401794,0.0035984225,0.00085552485,0.99335295,0.00019473078,0.00015163736],"about_ca_topic_score_codex":0.00010486994,"about_ca_topic_score_gemma":0.0000010424815,"teacher_disagreement_score":0.016479893,"about_ca_system_score_codex":0.000029512992,"about_ca_system_score_gemma":0.000081824866,"threshold_uncertainty_score":0.46533203},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99714524,0.00002943758,0.0010040757,0.00023610932,0.00087511964,0.00019729263,0.0000042330344,0.00018967659,0.00031884265],"genre_scores_gemma":[0.9684975,0.0000037782906,0.031281605,0.00014743197,9.1514534e-7,0.00001202852,0.0000030194192,0.000014965094,0.00003875275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840784,0.000082430175,0.0003861968,0.0003611842,0.00041263344,0.00034970633],"domain_scores_gemma":[0.9984195,0.0001983662,0.00022683368,0.00080391846,0.00019466085,0.00015667247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005025865,0.00019235058,0.00032094115,0.00015973988,0.00017674261,0.00008396655,0.0007424727,0.00007919355,0.000025412883],"category_scores_gemma":[0.00004278044,0.0001381913,0.000068869216,0.0007550602,0.00013781132,0.00029811644,0.00015764545,0.00030019175,0.000019099827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028549675,0.0001579922,0.0009657511,0.000039134407,0.000035191784,0.000016293034,0.00061934476,0.00003180031,0.030509405,0.96695524,0.00033554647,0.00030576016],"study_design_scores_gemma":[0.0015674339,0.00041254365,0.0019836011,0.00007914478,0.000017962002,0.00002828902,0.00003969243,0.007530397,0.007810788,0.98000175,0.00025047027,0.00027793474],"about_ca_topic_score_codex":0.00029578074,"about_ca_topic_score_gemma":0.00011110232,"teacher_disagreement_score":0.03027753,"about_ca_system_score_codex":0.00000965993,"about_ca_system_score_gemma":0.00009839959,"threshold_uncertainty_score":0.56352776},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940381,0.0017884205,0.0016133708,0.000088434506,0.00047790707,0.00025989523,0.0000035258,0.00007968842,0.0016506742],"genre_scores_gemma":[0.9942832,0.00007026424,0.005513116,0.0000230746,0.0000051120746,0.000021509572,8.3801433e-7,0.000012846039,0.00007001509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981206,0.00013201547,0.00024126624,0.0003578532,0.00032816106,0.0008200804],"domain_scores_gemma":[0.9986193,0.0003240293,0.00009480706,0.0005970548,0.00008852679,0.0002762442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016826681,0.00016085917,0.00029457128,0.00013467015,0.000226091,0.00006541811,0.0005048,0.0000718046,0.0000061776855],"category_scores_gemma":[0.00015449758,0.00015544203,0.00003437294,0.00046651004,0.00029772086,0.0012429451,0.0007867914,0.00019664338,0.000004724429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018085355,0.0000827016,0.20533629,0.00005228964,0.000016187858,0.0000010361076,0.00036151306,0.0000011355152,0.0023291258,0.790467,0.000043765805,0.0012908453],"study_design_scores_gemma":[0.0008081618,0.00015945251,0.041946992,0.000030539315,0.000008662571,0.000014352955,0.00010254258,0.00031881506,0.0081821745,0.9479523,0.0002708596,0.0002052048],"about_ca_topic_score_codex":0.000041902298,"about_ca_topic_score_gemma":0.0000032549963,"teacher_disagreement_score":0.1633893,"about_ca_system_score_codex":0.000038976228,"about_ca_system_score_gemma":0.000036519083,"threshold_uncertainty_score":0.6338742},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9852516,0.000030401692,0.0001871454,0.0004538344,0.00023265868,0.00041873255,0.0000041518815,0.0001891858,0.0132322665],"genre_scores_gemma":[0.9970123,0.0000013397632,0.0019964147,0.00011187813,0.00000917131,0.00009566179,0.0000026478995,0.0000329107,0.0007376666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885255,0.0000824772,0.00021463106,0.00027704166,0.00030167852,0.00027163085],"domain_scores_gemma":[0.9986704,0.00021544333,0.00008484581,0.0005994906,0.00014303956,0.00028677835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000457421,0.00016781274,0.00021813392,0.00017300494,0.0001208564,0.000044432163,0.0003095248,0.000073365314,0.00002467467],"category_scores_gemma":[0.00026979562,0.00013865434,0.000056184643,0.0009227142,0.00006251754,0.0001025037,0.000062914616,0.00017209804,0.00015039022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009755959,0.00020657282,0.0028212992,0.0000072440566,0.000026730764,0.000007695337,0.0005951554,0.0000020898053,0.00012898953,0.986836,0.009052559,0.00021810495],"study_design_scores_gemma":[0.0011802544,0.00020488954,0.0013906461,0.000023942945,0.000028024966,0.00001241893,0.00033654197,0.000009138584,0.0008721657,0.9917858,0.003953201,0.00020296784],"about_ca_topic_score_codex":0.000015152792,"about_ca_topic_score_gemma":0.000014832075,"teacher_disagreement_score":0.012494599,"about_ca_system_score_codex":0.00004109442,"about_ca_system_score_gemma":0.000060076065,"threshold_uncertainty_score":0.565416},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9573814,0.00024875504,0.0058471523,0.0093294885,0.005997131,0.0005254142,0.000001860557,0.00047812244,0.020190654],"genre_scores_gemma":[0.9964066,0.000005016129,0.0024598206,0.0008957096,0.000017216278,0.000019250903,7.6407207e-7,0.00001235881,0.00018323782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998229,0.00022399015,0.00021196798,0.00050391565,0.00048405986,0.00034705113],"domain_scores_gemma":[0.9978904,0.000612274,0.000081246115,0.0010391886,0.00013676623,0.00024012433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010134606,0.00019843558,0.00019881221,0.000054515927,0.00016588712,0.0002681549,0.0011579099,0.00007845368,0.000012322986],"category_scores_gemma":[0.00039237327,0.00014269777,0.000054791995,0.00043187654,0.00014253723,0.00026805775,0.000654263,0.00026413862,0.00017502568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050977173,0.00009909554,0.0009680275,0.0000027814597,0.000011489775,0.000012028393,0.0007003862,0.000020532249,0.000006220696,0.98118716,0.012457639,0.004529562],"study_design_scores_gemma":[0.00067385886,0.00022507343,0.0023561697,0.00000881157,0.000004305942,0.000021939606,0.00006109511,0.011893265,0.00013728779,0.97977686,0.0046329848,0.0002083484],"about_ca_topic_score_codex":0.000089414505,"about_ca_topic_score_gemma":0.00000675052,"teacher_disagreement_score":0.039025202,"about_ca_system_score_codex":0.000097523414,"about_ca_system_score_gemma":0.0001000356,"threshold_uncertainty_score":0.5819046},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93733203,0.0005213775,0.015631147,0.000814935,0.0055460883,0.0018724113,0.0000039298347,0.00030909726,0.037969004],"genre_scores_gemma":[0.8847686,0.000002894021,0.11292202,0.00034476057,0.000019167734,0.00019666924,0.0000022769054,0.000042654647,0.0017009277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958652,0.0007275331,0.0007590566,0.0007487468,0.0013388905,0.00056051783],"domain_scores_gemma":[0.99390423,0.0038604445,0.00035895704,0.0010070904,0.00055232225,0.0003169421],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0027040725,0.00031684418,0.0005058081,0.0002280102,0.00044367713,0.0008221669,0.0012002938,0.00014869178,0.002054944],"category_scores_gemma":[0.0052570496,0.0002532598,0.00012489528,0.001705988,0.000159025,0.0013150113,0.00040336014,0.00027956223,0.0055019087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057464684,0.00066365465,0.03495907,0.00004269357,0.00008243558,0.00007160083,0.0010815993,0.00051468227,0.11129296,0.75573546,0.06625628,0.02924209],"study_design_scores_gemma":[0.0010377347,0.0003517111,0.008791636,0.000035049212,0.0000109351495,0.000010851007,0.00031818287,0.014445937,0.031531032,0.94144315,0.0015910962,0.0004326807],"about_ca_topic_score_codex":0.00040788602,"about_ca_topic_score_gemma":0.0000059855083,"teacher_disagreement_score":0.18570769,"about_ca_system_score_codex":0.00011993265,"about_ca_system_score_gemma":0.00010528621,"threshold_uncertainty_score":0.99999195},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99397624,0.00057929754,0.000011399512,0.000038344864,0.0024316304,0.000077144054,0.000003060002,0.000098368844,0.0027845274],"genre_scores_gemma":[0.9998368,0.000022343163,0.00005242533,0.000004467803,0.000013038046,0.000006965044,0.000003142946,0.000016020407,0.000044822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995433,0.000019047457,0.00015106189,0.000092618466,0.00007685119,0.00011710405],"domain_scores_gemma":[0.9996647,0.00004845523,0.000028258886,0.00017379913,0.000029663785,0.000055108685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001256053,0.00009365587,0.0001422051,0.000044908145,0.000050505645,0.000027238711,0.00009064496,0.000080686055,0.00005608143],"category_scores_gemma":[0.0000095995965,0.00009364344,0.000029892055,0.000089269,0.00006335663,0.00011888964,0.000016765169,0.00013992401,0.000015242755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022523122,0.000077661105,0.009472399,0.00032706882,0.00008555816,0.0000056789568,0.00078176335,0.00009245078,0.4380256,0.54611105,0.0030530368,0.0019452211],"study_design_scores_gemma":[0.005042026,0.00046424722,0.06298391,0.0004637564,0.00018816095,0.00009048164,0.00054933137,0.0061027887,0.41568634,0.4594118,0.047709744,0.0013074038],"about_ca_topic_score_codex":0.000016125794,"about_ca_topic_score_gemma":0.000019562569,"teacher_disagreement_score":0.08669924,"about_ca_system_score_codex":0.000005269423,"about_ca_system_score_gemma":0.0000048230045,"threshold_uncertainty_score":0.38186684},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.986168,0.00009211085,0.0011659272,0.00083360635,0.0012995638,0.00026954905,5.103587e-7,0.00009308035,0.010077654],"genre_scores_gemma":[0.9985261,0.000019121213,0.0010424897,0.00020493651,0.0000047632648,0.000015672776,4.799328e-7,0.000009879923,0.00017654296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881464,0.000050646115,0.00026670718,0.0003175365,0.00028607744,0.00026437963],"domain_scores_gemma":[0.9988102,0.00034009037,0.00011861288,0.0004981161,0.000120049,0.00011298911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020874826,0.00013968519,0.00018336142,0.00010028176,0.00008588086,0.0001424642,0.0005896694,0.00007208836,0.000076374294],"category_scores_gemma":[0.00008961322,0.00013326918,0.000045929864,0.00032865282,0.00016306361,0.0005163239,0.00017576056,0.00013425283,0.00022952707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007952602,0.00006908821,0.0015111982,0.00000790664,0.000016480108,0.0000031011534,0.0006229186,0.000025995887,0.00030915329,0.98403215,0.00470256,0.008691487],"study_design_scores_gemma":[0.0003580179,0.0002361427,0.0022687851,0.0000276073,0.000005661574,0.0000038012065,0.00026124244,0.0033033649,0.022011088,0.97082883,0.0004754988,0.00021998708],"about_ca_topic_score_codex":0.000692313,"about_ca_topic_score_gemma":0.0000109246075,"teacher_disagreement_score":0.021701934,"about_ca_system_score_codex":0.000031603915,"about_ca_system_score_gemma":0.000043023407,"threshold_uncertainty_score":0.5434559},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99529004,0.00050836755,0.00069721945,0.00042255488,0.0010239705,0.0002080419,6.523687e-7,0.00018099476,0.0016681348],"genre_scores_gemma":[0.9981465,0.000009858338,0.0017302792,0.000026239557,5.9055753e-7,0.000011462725,9.909919e-7,0.000009803581,0.000064323256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859476,0.00009856957,0.00027320237,0.00023698398,0.00052601873,0.00027046746],"domain_scores_gemma":[0.9983909,0.00015289571,0.00018751767,0.00081127137,0.00030794035,0.00014945469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041389992,0.00013312927,0.00017466923,0.00010264247,0.00015149511,0.00009246407,0.0008305723,0.000053329088,8.4068057e-7],"category_scores_gemma":[0.00009429816,0.00008108772,0.000040388873,0.001013386,0.00016110604,0.00020161505,0.00016588066,0.00014493574,0.000010799124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012716722,0.00006360546,0.005936683,0.0000062379686,0.000028438628,0.000006062391,0.0002593196,0.0001591593,0.00007178268,0.99081194,0.0019051151,0.00073891954],"study_design_scores_gemma":[0.0014850936,0.00043324917,0.0060796146,0.000053743577,0.000011630603,0.000011016825,0.0000927427,0.012929542,0.00048711651,0.9780587,0.00019938483,0.00015819636],"about_ca_topic_score_codex":0.00012854126,"about_ca_topic_score_gemma":0.000013118134,"teacher_disagreement_score":0.012770383,"about_ca_system_score_codex":0.000021971331,"about_ca_system_score_gemma":0.00018003488,"threshold_uncertainty_score":0.33066612},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9220075,0.0004602444,0.0735316,0.00041137973,0.0011371569,0.0009319631,0.0000057529433,0.00020087948,0.0013135494],"genre_scores_gemma":[0.982769,0.00004396582,0.016888062,0.000036026096,0.000003687131,0.00012997196,0.0000029008722,0.000013220416,0.000113173934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998644,0.00013151566,0.00027984063,0.00042931823,0.00022566193,0.00028968058],"domain_scores_gemma":[0.99867934,0.00022267638,0.00009679538,0.0007142624,0.00020961436,0.00007732412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010854674,0.00012297744,0.00015056752,0.00031867134,0.00012187429,0.00008842846,0.0009449789,0.00006736831,0.0000045436136],"category_scores_gemma":[0.00032002517,0.00012689109,0.000045433848,0.0004883119,0.0001336542,0.0008852937,0.00027655961,0.00011124415,0.0000057354723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003214675,0.00009174091,0.0052411715,0.000018126459,0.000006742507,0.0000035663572,0.0012112366,4.3646767e-7,0.00059582974,0.98545355,0.00021922313,0.0071262293],"study_design_scores_gemma":[0.0009192095,0.00010870518,0.036342736,0.000014436486,0.0000029520259,0.0000033094398,0.00005405463,0.0011385691,0.0074441256,0.9537576,0.00007766149,0.00013666638],"about_ca_topic_score_codex":0.00002025645,"about_ca_topic_score_gemma":0.000013020181,"teacher_disagreement_score":0.060761515,"about_ca_system_score_codex":0.000037347214,"about_ca_system_score_gemma":0.000030181262,"threshold_uncertainty_score":0.5174469},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9699764,0.000014035269,0.00003531921,0.00009498217,0.00012055825,0.00028926664,0.000004608763,0.00005510981,0.029409697],"genre_scores_gemma":[0.99882305,0.0000047911485,0.00089321577,0.000048650407,0.0000019609529,0.00004512563,0.0000014124145,0.000020940051,0.00016086159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925023,0.00008266818,0.00018283426,0.00015276804,0.00015082545,0.0001806485],"domain_scores_gemma":[0.9987107,0.00042566925,0.00013237116,0.00063703343,0.000044229633,0.00005003164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022166898,0.00013110637,0.00016664113,0.00005695414,0.00011568299,0.0000074891,0.00035045145,0.00005004672,0.00015994834],"category_scores_gemma":[0.000054081254,0.000081713995,0.00007924084,0.0003241592,0.00018115914,0.000037972633,0.000026539406,0.00016237923,0.000028041164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040334755,0.00030077435,0.00065283244,0.000008909518,0.000053013606,0.000002342801,0.0004969344,8.2402146e-8,0.00022259846,0.99712676,0.0009452378,0.00015018556],"study_design_scores_gemma":[0.00045031702,0.00020001171,0.0028080803,0.00002715426,0.000044227454,0.0000050709837,0.00015726518,0.000004499012,0.012347369,0.9837836,0.00006720553,0.00010521136],"about_ca_topic_score_codex":0.000016844435,"about_ca_topic_score_gemma":0.000009758717,"teacher_disagreement_score":0.029248836,"about_ca_system_score_codex":0.000010099881,"about_ca_system_score_gemma":0.000017777738,"threshold_uncertainty_score":0.33322},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8557291,0.000083477826,0.008532758,0.006418575,0.031738367,0.00057098625,8.711974e-7,0.000113573384,0.0968123],"genre_scores_gemma":[0.9986262,0.0000010514527,0.000063427986,0.0004450242,0.000039718965,0.000013943514,2.291332e-7,0.0000054773286,0.0008049272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989456,0.0002476142,0.0001928274,0.00014522165,0.00031381386,0.00015494392],"domain_scores_gemma":[0.99880016,0.0002478514,0.00013883995,0.0006008296,0.00017378724,0.0000385307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086179236,0.00008058013,0.000105727304,0.000012006615,0.00012566944,0.00006524214,0.0007835198,0.000048265054,0.000013214873],"category_scores_gemma":[0.000103701735,0.000043113225,0.00006999136,0.00036198756,0.00003848597,0.00012641957,0.00015748142,0.00013103512,0.00007572422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032397793,0.000022393999,0.0007316527,0.0000011480527,0.000007661278,3.8101416e-7,0.00030395467,0.00046505308,0.0000034413633,0.92095,0.07723879,0.0002723103],"study_design_scores_gemma":[0.00041225296,0.000063124746,0.0009528365,0.000048777267,0.0000038832077,0.000011750603,0.00006059652,0.043174922,0.00029440966,0.9450292,0.009855147,0.000093090464],"about_ca_topic_score_codex":0.000032593427,"about_ca_topic_score_gemma":0.0000056623726,"teacher_disagreement_score":0.14289711,"about_ca_system_score_codex":0.000046277124,"about_ca_system_score_gemma":0.000043055355,"threshold_uncertainty_score":0.17581064},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9870875,0.0003828651,0.00735835,0.0015424996,0.001343856,0.00063097494,0.000019608564,0.00018004152,0.0014542975],"genre_scores_gemma":[0.9960099,0.00014061853,0.0034110215,0.00021638726,0.000009685372,0.000091499474,0.000010958855,0.000011778832,0.000098191485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852234,0.00015546224,0.00025777053,0.0006019497,0.00013972387,0.0003227587],"domain_scores_gemma":[0.9973513,0.00094968773,0.000095098454,0.0011391718,0.0002702188,0.00019455646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009723286,0.00019411108,0.0002751162,0.00007160881,0.0008652911,0.00023781182,0.0005734265,0.00010345287,0.000028703002],"category_scores_gemma":[0.00049153453,0.00019264828,0.000059859354,0.00026362334,0.00031713521,0.0006410205,0.00054934365,0.00035221787,0.0000075505377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000090513395,0.00015718398,0.0059864093,0.000017755337,0.00001925239,9.876242e-7,0.00024490114,8.6397006e-7,0.0040783538,0.9694015,0.0007819593,0.019301828],"study_design_scores_gemma":[0.0018894251,0.00022601912,0.13824876,0.000022635068,0.00002352747,0.00003176988,0.000034230867,0.036048193,0.0019166528,0.81457746,0.0065441644,0.0004371544],"about_ca_topic_score_codex":0.000023762346,"about_ca_topic_score_gemma":0.00024674556,"teacher_disagreement_score":0.15482399,"about_ca_system_score_codex":0.0000342037,"about_ca_system_score_gemma":0.00008596856,"threshold_uncertainty_score":0.7855969},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99080884,0.00022622582,0.00037088463,0.0012826286,0.003129153,0.0003598622,7.1318e-7,0.00014948321,0.0036722166],"genre_scores_gemma":[0.9993952,0.00009399375,0.00019874885,0.00016623863,0.000013094143,0.000038182716,6.7789097e-7,0.000022313265,0.0000715533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742633,0.0005587659,0.00029163875,0.00056555175,0.0005343658,0.00062336016],"domain_scores_gemma":[0.9970065,0.0016927567,0.00009125751,0.000962386,0.00007759367,0.00016954984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001942648,0.00023403838,0.00025459242,0.00020922608,0.00048443177,0.00029278253,0.0012155419,0.00009484557,0.000003880903],"category_scores_gemma":[0.00037373477,0.00017849583,0.00007216171,0.0007564061,0.0002640701,0.00036548713,0.0004368931,0.000524547,0.00006876587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048864204,0.00007718269,0.003047328,0.000007746362,0.000008667093,0.0000076095025,0.00038889472,0.00000560781,0.000322032,0.9874476,0.00024724376,0.008391225],"study_design_scores_gemma":[0.0014237373,0.00040986703,0.003065131,0.000033196313,0.0000021577675,0.0000070438095,0.000029867215,0.0025545962,0.0026821468,0.98586315,0.0037083663,0.00022075123],"about_ca_topic_score_codex":0.000025448408,"about_ca_topic_score_gemma":0.0000103191105,"teacher_disagreement_score":0.008586365,"about_ca_system_score_codex":0.000052383784,"about_ca_system_score_gemma":0.000034829616,"threshold_uncertainty_score":0.7278849},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9871474,0.004187768,0.0024211393,0.0017683246,0.00089675805,0.0005874721,0.0000036298152,0.00020321226,0.0027843162],"genre_scores_gemma":[0.9994718,0.000045540888,0.0003470463,0.000052516472,6.5378424e-7,0.000049003385,0.0000014345778,0.0000034523514,0.000028577506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929833,0.00009094452,0.0001602134,0.0001679308,0.00016465872,0.000117923926],"domain_scores_gemma":[0.9990594,0.00018280177,0.00009581516,0.0002850897,0.00029621337,0.000080715225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004273831,0.00006956821,0.00008872504,0.000036157115,0.0001570692,0.00005914142,0.00025568047,0.00003246291,5.3287175e-7],"category_scores_gemma":[0.000080042686,0.000048361722,0.000021087695,0.00034770518,0.000085647036,0.00014619133,0.00008672603,0.000062495295,0.000009728995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003713962,0.000029650502,0.00019942447,0.0000025472173,0.000009690116,2.581723e-7,0.00043209008,0.000004469523,0.00054781383,0.99736,0.00039562242,0.001014717],"study_design_scores_gemma":[0.0003951493,0.00007630223,0.0002367301,0.000007798367,0.000004465095,0.00000233302,0.000057352758,0.0028785865,0.0077280956,0.9878962,0.00065435976,0.00006260495],"about_ca_topic_score_codex":0.000007463066,"about_ca_topic_score_gemma":0.0000014420627,"teacher_disagreement_score":0.012324395,"about_ca_system_score_codex":0.00000643069,"about_ca_system_score_gemma":0.000037227917,"threshold_uncertainty_score":0.19721338},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9951363,0.000068701724,0.0013419971,0.002047843,0.00036351936,0.00032121054,0.000002628486,0.00017239361,0.00054535794],"genre_scores_gemma":[0.99275386,0.000003752471,0.006307764,0.00087555277,0.0000012299503,0.00001962157,0.0000041217017,0.00000687082,0.000027202192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868035,0.0000417082,0.00024801702,0.00042894704,0.00037448743,0.00022651511],"domain_scores_gemma":[0.99820703,0.000084532614,0.00010544026,0.0013331725,0.00012584063,0.0001440084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027241214,0.00014605543,0.00019578605,0.00016152265,0.000082561906,0.00003703587,0.00076356163,0.000054186756,0.0000020094521],"category_scores_gemma":[0.000053661333,0.00012080396,0.000043599644,0.0006614902,0.00003600773,0.00019388612,0.0000816621,0.00010842797,0.000033252618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027840179,0.00027804807,0.00033925136,0.000005614394,0.000006822792,0.0000015399107,0.00011461151,0.0003888847,0.0044090203,0.9901685,0.001495367,0.0027645093],"study_design_scores_gemma":[0.0008762186,0.00091243844,0.004394532,0.000027689752,0.000004914416,0.0000027521337,0.000002921284,0.0005864355,0.012457737,0.98047864,0.00010101243,0.00015472902],"about_ca_topic_score_codex":0.000040096096,"about_ca_topic_score_gemma":0.0000022861677,"teacher_disagreement_score":0.009689871,"about_ca_system_score_codex":0.000020448593,"about_ca_system_score_gemma":0.000036218335,"threshold_uncertainty_score":0.49262425},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99780333,0.0000054339903,0.0000919219,0.00008612815,0.00017412599,0.00030699553,0.000011512125,0.00009870872,0.0014218526],"genre_scores_gemma":[0.98915756,0.0000021578232,0.010633961,0.000028371565,0.000003946983,0.000045950444,0.0000044951894,0.000027468062,0.000096102456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990848,0.00005272338,0.00028114414,0.00017856268,0.00019952821,0.00020325618],"domain_scores_gemma":[0.9985884,0.00050637533,0.00018977036,0.00053610007,0.000098435456,0.00008096534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035727888,0.00015166517,0.0002545313,0.000074327356,0.00013852662,0.00001901729,0.0002824452,0.000087635264,0.0001476433],"category_scores_gemma":[0.00012264783,0.00010911308,0.00006314752,0.0003444115,0.00013302483,0.00009293292,0.000041475665,0.00027578571,0.000011073541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003759121,0.0002567824,0.00053518405,0.00008868468,0.00004532151,0.0000032138212,0.00058554916,6.248785e-7,0.013159862,0.98491627,0.00029351123,0.000077386045],"study_design_scores_gemma":[0.00055739685,0.00010091319,0.00096882175,0.00004420564,0.000047544145,0.000011915615,0.00022112203,0.00003371044,0.012006762,0.98570174,0.0001559506,0.00014990289],"about_ca_topic_score_codex":0.000042367363,"about_ca_topic_score_gemma":0.000097673605,"teacher_disagreement_score":0.01054204,"about_ca_system_score_codex":0.000008352658,"about_ca_system_score_gemma":0.000043498912,"threshold_uncertainty_score":0.44495025},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959962,0.0008087382,0.00028176088,0.0003804676,0.0016770633,0.00016676348,0.0000031204238,0.00023118868,0.0004546969],"genre_scores_gemma":[0.9980457,0.00004311549,0.0016209944,0.00022658451,0.0000036032498,0.0000075363437,0.0000064370156,0.000018106164,0.00002796011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833274,0.000091616625,0.00040274457,0.00039285675,0.00034396118,0.00043609433],"domain_scores_gemma":[0.9984189,0.0003976751,0.00022558164,0.0005106533,0.00022081406,0.00022636607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007517897,0.0002200713,0.00034050795,0.00029065993,0.00018435178,0.000063526415,0.0003716861,0.00012996019,0.0000074720906],"category_scores_gemma":[0.00022363337,0.00020466137,0.000073340896,0.00077010255,0.00012343322,0.00046851402,0.00017999286,0.00023362291,0.00003491247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007021403,0.00015970522,0.028989764,0.000024844363,0.000039606053,8.8152035e-7,0.0003878747,0.000002863775,0.0042540305,0.9635889,0.00073415035,0.0018103663],"study_design_scores_gemma":[0.0014103707,0.00032642452,0.011860876,0.00009206866,0.000040958046,0.000007757442,0.00001907247,0.0006728127,0.018681085,0.9664164,0.0001701522,0.00030200017],"about_ca_topic_score_codex":0.00007069006,"about_ca_topic_score_gemma":4.815195e-7,"teacher_disagreement_score":0.017128889,"about_ca_system_score_codex":0.000017756542,"about_ca_system_score_gemma":0.000025810956,"threshold_uncertainty_score":0.83458483},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97711474,0.0001909563,0.0012928033,0.00017709396,0.0011137275,0.00038809224,0.000005034215,0.000027147675,0.019690404],"genre_scores_gemma":[0.9983731,0.0000051316624,0.0013500187,0.00003431192,0.000002753416,0.000011889167,8.5070275e-7,0.000003770881,0.00021821089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989249,0.00005477416,0.00026623573,0.00016581561,0.00042187914,0.00016635741],"domain_scores_gemma":[0.99864614,0.00009830844,0.00026523258,0.00046521574,0.00048672553,0.00003840258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024561601,0.000091603695,0.00019287817,0.000036962174,0.000058424208,0.000018113089,0.0009803744,0.000075137345,0.000051773073],"category_scores_gemma":[0.00007001743,0.000060371956,0.00007698739,0.000303558,0.00013587812,0.0003376499,0.00032729437,0.00010349938,0.000019156247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002544043,0.00016420161,0.0112210475,0.000039250393,0.000013991238,3.8904932e-7,0.00039155563,0.000009781419,0.003320198,0.9834986,0.0009858692,0.00035261776],"study_design_scores_gemma":[0.00044406104,0.00016744046,0.04313428,0.000057083358,0.000006990881,0.0000075338066,0.00002532539,0.0023111762,0.06558193,0.8880962,0.000075190546,0.00009278201],"about_ca_topic_score_codex":0.00015585091,"about_ca_topic_score_gemma":0.000004767007,"teacher_disagreement_score":0.09540235,"about_ca_system_score_codex":0.000026823473,"about_ca_system_score_gemma":0.0001593846,"threshold_uncertainty_score":0.2461897},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9766891,0.000021715625,0.0016663673,0.0015222805,0.00022227403,0.00036866104,0.0000019948054,0.00012468305,0.019382928],"genre_scores_gemma":[0.99761605,0.0000020389307,0.0002920121,0.00022025197,0.000022170034,0.00009735407,0.0000040250266,0.000025771153,0.0017203237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907297,0.00009113072,0.00015734372,0.00020291172,0.0002347072,0.00024091206],"domain_scores_gemma":[0.99876845,0.00043130448,0.0001018637,0.000536565,0.00009292265,0.00006891713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005881406,0.0001544912,0.00017974124,0.00004052092,0.00034415396,0.000046488833,0.000326113,0.00007138878,0.000085403284],"category_scores_gemma":[0.000044391665,0.000094496616,0.000055571832,0.00033944647,0.00015410005,0.000069490205,0.000051909446,0.00022970923,0.000063813444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008428215,0.00013902347,0.00081093004,0.000012535796,0.000035553818,7.0660786e-7,0.0005545324,0.0000041645458,0.00006867433,0.9945199,0.0036466587,0.00012302767],"study_design_scores_gemma":[0.0023508614,0.00006706688,0.000837995,0.000016320731,0.000040265775,0.000009266704,0.00017247822,0.00019436833,0.00034987216,0.9875046,0.00830158,0.00015531576],"about_ca_topic_score_codex":0.000011082974,"about_ca_topic_score_gemma":0.000025688165,"teacher_disagreement_score":0.020926956,"about_ca_system_score_codex":0.000013826908,"about_ca_system_score_gemma":0.000035075194,"threshold_uncertainty_score":0.385346},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928141,0.00007098031,0.000004597309,0.000011109887,0.00023379123,0.00013839688,0.0000090744925,0.000032366464,0.0066855424],"genre_scores_gemma":[0.99934644,0.00001612957,0.0005378639,0.000011450766,0.0000011713513,0.000017512506,0.000002117471,0.000012236324,0.000055079345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993339,0.000040096253,0.0002726955,0.00011033746,0.00012619635,0.00011675255],"domain_scores_gemma":[0.99912995,0.00017704723,0.00021292672,0.0003740397,0.00006442761,0.000041611296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023561133,0.000085465574,0.00020795148,0.00009113495,0.00003929119,0.0000023402088,0.00026109195,0.00006321206,0.000094202034],"category_scores_gemma":[0.000062554056,0.00007907089,0.0000890537,0.00022866309,0.00014114956,0.00008769202,0.000042403208,0.00007398576,0.000012515592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011873085,0.000290504,0.004018571,0.00006569409,0.00004443557,4.6328395e-7,0.0010693455,1.3291511e-8,0.0021788613,0.99178076,0.0004266026,0.00011285857],"study_design_scores_gemma":[0.00031571725,0.00007096541,0.004149761,0.000027133461,0.000038909664,7.013123e-7,0.00013759185,0.0000015950551,0.06544764,0.9296795,0.00005880659,0.000071655966],"about_ca_topic_score_codex":0.000026139525,"about_ca_topic_score_gemma":0.0000018883595,"teacher_disagreement_score":0.06326878,"about_ca_system_score_codex":0.0000040758177,"about_ca_system_score_gemma":0.000015834094,"threshold_uncertainty_score":0.32244173},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9588779,0.000052806947,0.001964106,0.0008025237,0.000086464126,0.0003136354,0.000008727597,0.000046443354,0.03784738],"genre_scores_gemma":[0.98969644,0.0000039254755,0.006689971,0.000060205857,0.0000186006,0.00012410474,0.00002721834,0.000018491619,0.0033610389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941933,0.00001558044,0.00013511779,0.00017738991,0.000081456754,0.0001711059],"domain_scores_gemma":[0.999457,0.000091915856,0.000060639963,0.0002263371,0.00006212005,0.00010196446],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000029812216,0.00011392394,0.00014740345,0.000011805893,0.00015515099,0.00005613294,0.00007052278,0.000025219064,0.0010040975],"category_scores_gemma":[0.000004404699,0.00009476995,0.000034004803,0.00010943911,0.0000738892,0.00023173203,0.0000415256,0.00009573943,0.00017325154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015334252,0.000062671425,0.0026257655,0.0000035519927,0.000026427131,2.0366018e-7,0.00008960052,0.00000968279,0.00010749533,0.99476844,0.0019259087,0.00037874238],"study_design_scores_gemma":[0.00055624015,0.000014174272,0.0006082528,0.000011001486,0.000018903194,0.0000010010547,0.0003091523,0.00012092382,0.00031835178,0.993991,0.0039109006,0.00014010697],"about_ca_topic_score_codex":0.00013644274,"about_ca_topic_score_gemma":0.0000011848407,"teacher_disagreement_score":0.034486342,"about_ca_system_score_codex":0.000010727328,"about_ca_system_score_gemma":0.00001818631,"threshold_uncertainty_score":0.9999091},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20703337,0.00012951742,0.7608159,0.0001793882,0.02006859,0.0005522768,0.0000017881406,0.000561131,0.010658015],"genre_scores_gemma":[0.97556233,0.0000046367913,0.022794165,0.0003908124,0.000108988934,0.000053349253,0.0000035139656,0.000024622874,0.0010576004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981758,0.000106923675,0.00035360962,0.00057660404,0.00026649694,0.00052058423],"domain_scores_gemma":[0.9983837,0.000035968354,0.00010027231,0.0009566938,0.00017984101,0.00034354333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048254177,0.000225496,0.000262132,0.00012236334,0.00021796871,0.00024938013,0.0013020196,0.00014374542,0.000091079855],"category_scores_gemma":[0.000005371701,0.00021056611,0.00009090771,0.0005604601,0.000027975713,0.0006974705,0.00022376548,0.000214825,0.00022752701],"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.00003773842,0.00027249553,0.0005246717,0.0000041562002,0.000045663222,0.000060840837,0.0019871918,0.0016050083,0.000050115195,0.95987874,0.01224773,0.023285665],"study_design_scores_gemma":[0.002566306,0.0016163357,0.0043471144,0.000078022415,0.000018652878,0.00011171527,0.00013381997,0.9438845,0.0019459614,0.030966677,0.013221269,0.001109657],"about_ca_topic_score_codex":0.00018681724,"about_ca_topic_score_gemma":0.000009235346,"teacher_disagreement_score":0.94227946,"about_ca_system_score_codex":0.000059332975,"about_ca_system_score_gemma":0.000041603762,"threshold_uncertainty_score":0.8586637},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78286564,0.000042010153,0.11805732,0.010673812,0.021188214,0.0004407205,7.7784705e-7,0.00047306332,0.06625845],"genre_scores_gemma":[0.9973305,0.0000018583908,0.00018289966,0.0018722744,0.000053210686,0.000025692252,4.039178e-7,0.000008796422,0.00052438956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987648,0.00034960976,0.00016559545,0.00027440957,0.00022073096,0.00022481628],"domain_scores_gemma":[0.99849385,0.0005760957,0.00007990615,0.00072165293,0.000072418414,0.000056048022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008159235,0.00011984233,0.00015264392,0.000040359304,0.0002443755,0.000180299,0.0006891538,0.000060175276,0.000023314347],"category_scores_gemma":[0.00013288185,0.00007866667,0.00008097548,0.00022197832,0.000026851052,0.00013445973,0.00010679399,0.00016155149,0.0002567905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032302744,0.000025561973,0.00006682138,0.0000013704027,0.0000072959024,0.0000011591605,0.0001600501,0.00008027569,0.000115903305,0.9860632,0.011744104,0.0017310266],"study_design_scores_gemma":[0.0007338093,0.00025058613,0.000608022,0.000029435672,0.000003527735,0.000012560447,0.000011033281,0.2017384,0.0020048455,0.7039761,0.090393014,0.00023865823],"about_ca_topic_score_codex":0.00004634101,"about_ca_topic_score_gemma":0.000009318444,"teacher_disagreement_score":0.2820871,"about_ca_system_score_codex":0.00003774525,"about_ca_system_score_gemma":0.000016537339,"threshold_uncertainty_score":0.3300608},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9759428,0.000031931355,0.0000034921895,0.0017586605,0.00048214965,0.00022388897,0.000014271436,0.0002351677,0.021307632],"genre_scores_gemma":[0.99841726,0.000011811106,0.00039093225,0.0004270464,0.000014322699,0.000016458533,0.000009942853,0.00001256515,0.00069964584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909467,0.000052969946,0.0002367939,0.00022882406,0.00016765062,0.00021909468],"domain_scores_gemma":[0.99899197,0.00026004095,0.00008713851,0.0005352747,0.000041856587,0.00008369573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029345244,0.00014137726,0.00016321229,0.00008607223,0.00014793288,0.00002599531,0.00024646622,0.000077589946,0.000012649248],"category_scores_gemma":[0.0001891609,0.00012372927,0.000107565604,0.00024361906,0.000044106648,0.000084631734,0.00001442263,0.00019903174,0.00014123014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050017436,0.00032770875,0.000013491939,0.000002877352,0.000009903345,0.0000032379464,0.00012702112,3.2782074e-7,0.00027568135,0.9806371,0.017859925,0.00069271185],"study_design_scores_gemma":[0.00079233496,0.00020905469,0.00076729583,0.00002465209,0.00001451553,0.00000228242,0.000030870207,0.000007767847,0.0032747053,0.99246114,0.0022732175,0.00014213411],"about_ca_topic_score_codex":0.0000022454687,"about_ca_topic_score_gemma":5.765102e-7,"teacher_disagreement_score":0.02247447,"about_ca_system_score_codex":0.000019608193,"about_ca_system_score_gemma":0.000011909206,"threshold_uncertainty_score":0.5045533},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99464905,0.00015962585,0.0022699758,0.00018464832,0.0010654033,0.000100349425,0.0000011920151,0.000060122547,0.0015096499],"genre_scores_gemma":[0.9987091,0.000004934025,0.0011648822,0.000077860124,0.0000031210882,0.0000079994825,0.0000032251803,0.0000040665277,0.000024799825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991782,0.00006132068,0.00021171538,0.00018629518,0.00020898855,0.00015351117],"domain_scores_gemma":[0.99932396,0.00005884166,0.00008210615,0.0003945553,0.000071149516,0.00006937327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005022386,0.00008349736,0.00014979183,0.0001253561,0.000018771038,0.00003155984,0.00047896468,0.00005268272,0.000003822881],"category_scores_gemma":[0.000048381655,0.00008210649,0.00003319643,0.00050050183,0.000029935802,0.00034789482,0.00011114361,0.0000858454,0.0000345999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065461163,0.00015159618,0.012043834,0.000010401607,0.0000069329417,0.000014058895,0.0017091442,0.000050884963,0.0030236256,0.97676474,0.0028186245,0.0033996354],"study_design_scores_gemma":[0.0014893195,0.00018253014,0.011449297,0.00004622128,0.0000032381236,0.000006873379,0.00010437965,0.02937368,0.015156251,0.9415839,0.0004010238,0.0002033266],"about_ca_topic_score_codex":0.000069590256,"about_ca_topic_score_gemma":0.0000063397147,"teacher_disagreement_score":0.035180856,"about_ca_system_score_codex":0.00002839201,"about_ca_system_score_gemma":0.000070019254,"threshold_uncertainty_score":0.33482054},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9850744,0.00011303284,0.007595912,0.000949457,0.0006544497,0.00028557077,4.719038e-7,0.00017591042,0.005150822],"genre_scores_gemma":[0.99508715,0.000014991646,0.004638652,0.00015267907,0.000005037857,0.000017383449,0.0000015910845,0.0000070744204,0.000075438154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842197,0.00013603456,0.0002471161,0.00038771017,0.00039440155,0.00041278324],"domain_scores_gemma":[0.99904835,0.00018593704,0.000081785925,0.00050578656,0.00008749269,0.00009067017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000635909,0.00013062899,0.00016226184,0.0003731181,0.000097308584,0.00010984534,0.0010445627,0.000055629633,0.0000047399203],"category_scores_gemma":[0.00018201639,0.0001354671,0.000054028493,0.0011350123,0.000044494886,0.0007518809,0.00013788289,0.00025128154,0.000028604372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012203654,0.00010487938,0.0019280681,0.0000025396077,0.0000030966987,0.00003725639,0.00037305176,0.000053283427,0.0020907419,0.9628869,0.000051554758,0.032456394],"study_design_scores_gemma":[0.0009357117,0.00015126186,0.02638312,0.000021530186,7.867554e-7,0.0000050386116,0.000017744487,0.007994827,0.005402824,0.95882016,0.000117029595,0.0001499625],"about_ca_topic_score_codex":0.000013071207,"about_ca_topic_score_gemma":0.000005717205,"teacher_disagreement_score":0.032306433,"about_ca_system_score_codex":0.00009137326,"about_ca_system_score_gemma":0.000034069522,"threshold_uncertainty_score":0.5524188},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93242633,0.0007529479,0.026831402,0.0009813006,0.0029089083,0.0010256646,0.0000055040346,0.00026115237,0.034806773],"genre_scores_gemma":[0.99885434,0.000030777934,0.00074680353,0.000024503512,0.0000024671044,0.000015400406,3.6019884e-7,0.000011362564,0.00031396098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839103,0.00024755727,0.00030329745,0.00025509717,0.0004764989,0.00032652722],"domain_scores_gemma":[0.99790484,0.00041850653,0.00016318998,0.0011870856,0.00024550754,0.000080876816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011052922,0.00011454782,0.00020966512,0.00010148419,0.0001609499,0.0000363878,0.0018812865,0.000045981313,0.0000036445665],"category_scores_gemma":[0.00023611017,0.000066597815,0.00010038434,0.00068829564,0.00035635868,0.00021356449,0.00033862333,0.00016787594,0.000014217766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008943025,0.000052756088,0.0014750551,0.000019306917,0.000016395888,7.5453545e-7,0.0001749166,0.0000045606685,0.0038914757,0.97943056,0.00018318958,0.014742092],"study_design_scores_gemma":[0.00037452613,0.00021356028,0.0033645155,0.000019180587,0.00000273664,0.0000029559894,0.000017624232,0.0008047192,0.012168433,0.98065394,0.0022866183,0.00009120865],"about_ca_topic_score_codex":0.000023757091,"about_ca_topic_score_gemma":0.000004187223,"teacher_disagreement_score":0.06642801,"about_ca_system_score_codex":0.000017501068,"about_ca_system_score_gemma":0.00005815955,"threshold_uncertainty_score":0.34959298},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98668057,0.0051711244,0.00010255619,0.0003251019,0.006121595,0.0002740222,0.000006447746,0.00016718973,0.0011513826],"genre_scores_gemma":[0.9981192,0.0002077625,0.0013993352,0.00014025878,0.0000030580093,0.000016157479,0.000005269252,0.00003243536,0.000076528166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972149,0.0003060325,0.0007037571,0.0004027179,0.0006185693,0.0007540073],"domain_scores_gemma":[0.9974641,0.00023563168,0.00044808935,0.0011885754,0.0003023384,0.00036121582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012045284,0.00034708652,0.0005730376,0.0003522409,0.00018915601,0.000117398944,0.000980922,0.00021980827,0.00004586676],"category_scores_gemma":[0.000093755974,0.00033339945,0.00020887579,0.0015052267,0.0003111234,0.00063693896,0.0003874118,0.00027188845,0.00017082758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060432394,0.00060166355,0.030864844,0.00027001256,0.00007542441,0.000004816468,0.0007394956,0.000008858368,0.0034912964,0.9621199,0.0009243317,0.00089333905],"study_design_scores_gemma":[0.001068067,0.00027065052,0.023758141,0.00050123647,0.00008098684,0.000026669231,0.000035542886,0.0011194721,0.016519168,0.95559555,0.00054427946,0.000480254],"about_ca_topic_score_codex":0.000114279246,"about_ca_topic_score_gemma":5.004675e-7,"teacher_disagreement_score":0.013027873,"about_ca_system_score_codex":0.000037390928,"about_ca_system_score_gemma":0.0001345968,"threshold_uncertainty_score":0.9999118},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7244144,0.005718998,0.10562473,0.0074487124,0.021782937,0.0014380557,0.000016414184,0.003091876,0.13046384],"genre_scores_gemma":[0.98883647,0.000032462285,0.009417662,0.00029243345,0.000015956319,0.000040789055,0.0000021769713,0.000027054606,0.0013350159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997579,0.00022856917,0.00024134031,0.0005637432,0.00067581574,0.0007115759],"domain_scores_gemma":[0.9973791,0.00039631975,0.000046111425,0.001231891,0.00041700696,0.00052952924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009485748,0.0002028307,0.00024176786,0.00024534966,0.00019767239,0.00023305647,0.0016485947,0.000102275655,0.000018712852],"category_scores_gemma":[0.00058742147,0.00019872628,0.00008930785,0.0012305761,0.0002700511,0.0010019777,0.00045260534,0.00033861084,0.0005717854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012856538,0.00013779571,0.00052170834,0.000010236796,0.000010273344,0.000042526117,0.00037361908,0.000010139713,0.00035292405,0.98710376,0.01033648,0.0010876727],"study_design_scores_gemma":[0.00072450365,0.00022609286,0.00012611126,0.00001662421,0.0000036460026,0.000015352389,0.000057995698,0.0021157686,0.00454199,0.97441936,0.017501496,0.00025106195],"about_ca_topic_score_codex":0.000018681476,"about_ca_topic_score_gemma":0.0000026551022,"teacher_disagreement_score":0.26442203,"about_ca_system_score_codex":0.000089452726,"about_ca_system_score_gemma":0.00016674571,"threshold_uncertainty_score":0.81038225},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892594,0.00021584812,0.000064867934,0.00067681976,0.0022462602,0.00070992234,0.000004949109,0.00007611933,0.00674582],"genre_scores_gemma":[0.9968311,0.000029232542,0.0010581013,0.0003611391,0.000023861177,0.00014872177,0.0000018359593,0.00003783789,0.0015081594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907833,0.000045008615,0.00020781814,0.00021272976,0.00016219029,0.00029394365],"domain_scores_gemma":[0.99801385,0.00126859,0.000072575596,0.00046884496,0.000098901975,0.00007722943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029264478,0.00017337207,0.00019960408,0.000024751036,0.00054618163,0.00010691238,0.00028264447,0.00010513236,0.00033685548],"category_scores_gemma":[0.00025182107,0.000107944594,0.00010461813,0.00007748124,0.00017097378,0.00014244104,0.00014277635,0.0001447264,0.00003622323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009132527,0.000029304256,0.0030276855,0.000028904093,0.000070227754,3.8131296e-7,0.00059920916,4.692695e-8,0.000028241235,0.94847214,0.046297446,0.0014373079],"study_design_scores_gemma":[0.0007368451,0.000042121508,0.0058194017,0.000011760832,0.000056442466,0.000011316834,0.00018718038,0.0001491331,0.0001661495,0.9821724,0.01048387,0.00016332928],"about_ca_topic_score_codex":0.000035208464,"about_ca_topic_score_gemma":0.0000026119246,"teacher_disagreement_score":0.035813577,"about_ca_system_score_codex":0.000017857677,"about_ca_system_score_gemma":0.0000136979925,"threshold_uncertainty_score":0.44018528},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9874375,0.000025650534,0.00012328959,0.0012966834,0.00033460517,0.00066535745,0.000005435856,0.000045830777,0.010065631],"genre_scores_gemma":[0.9936416,0.000005459305,0.0041977037,0.000060598577,0.000009148793,0.00014154908,0.0000015516104,0.000021630922,0.0019207726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909097,0.000064588574,0.0003469011,0.00012268586,0.00021692236,0.00015795248],"domain_scores_gemma":[0.9986661,0.0002823661,0.0002066255,0.00067533366,0.00011681003,0.000052785497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002202515,0.000110526875,0.00024612836,0.000026462822,0.000093029055,0.000024977737,0.00038453925,0.000065029264,0.00036610075],"category_scores_gemma":[0.00021039016,0.000072223476,0.00013764942,0.00021677805,0.00006351924,0.000046357367,0.00010371384,0.00009562348,0.00006622605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001156418,0.00015896364,0.00012276,0.00003559364,0.000021655887,8.687061e-8,0.00020176625,4.678085e-7,0.0017427764,0.9455437,0.052004084,0.00016699426],"study_design_scores_gemma":[0.00069175113,0.000014181515,0.00043104446,0.000022553217,0.000028619435,0.0000013116892,0.000059416063,0.0004626003,0.0052272887,0.990378,0.0025942784,0.00008894407],"about_ca_topic_score_codex":0.00004425317,"about_ca_topic_score_gemma":0.0000033217714,"teacher_disagreement_score":0.049409803,"about_ca_system_score_codex":0.00001883695,"about_ca_system_score_gemma":0.000031799304,"threshold_uncertainty_score":0.40085465},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9947528,0.00009730886,0.000044763005,0.000090599395,0.00027769324,0.00014433157,0.0000032083187,0.00006317878,0.0045260848],"genre_scores_gemma":[0.99931896,0.000005608658,0.0004195777,0.000025442543,0.000002255728,0.000025370711,0.0000015443453,0.000014173963,0.00018708583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993282,0.000053199117,0.00021015533,0.00011745242,0.00016017145,0.00013079827],"domain_scores_gemma":[0.9991325,0.00015291687,0.00011067131,0.0003837839,0.00012413927,0.000095968055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003742582,0.000085214684,0.00016271403,0.000068151145,0.0000401072,0.000007917016,0.00019692496,0.000059425816,0.00002190161],"category_scores_gemma":[0.0001750849,0.0000811345,0.000069156304,0.0002836665,0.0000792581,0.000053805965,0.000044595363,0.00009508101,0.000035525427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012330084,0.00016815518,0.0028163353,0.000014229401,0.00002134117,0.0000012129975,0.00029572617,3.700315e-7,0.00029330293,0.99148476,0.0047357283,0.00015648085],"study_design_scores_gemma":[0.0006177941,0.00004237168,0.00082415785,0.000014696569,0.000022995671,0.0000033980364,0.00013035048,0.00001804588,0.0047128485,0.992882,0.0006460109,0.00008529809],"about_ca_topic_score_codex":0.000010006285,"about_ca_topic_score_gemma":0.0000021178835,"teacher_disagreement_score":0.0045661083,"about_ca_system_score_codex":0.000014241526,"about_ca_system_score_gemma":0.000039268773,"threshold_uncertainty_score":0.3308569},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68480444,0.00017799145,0.2661218,0.002896941,0.0007806484,0.0069760857,0.00011213348,0.0006145639,0.037515394],"genre_scores_gemma":[0.9480512,0.0000242328,0.05089995,0.000049356735,0.000015159557,0.0004305808,0.000028801156,0.00004265704,0.00045807287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988954,0.000019365407,0.00044610325,0.00019080991,0.000185744,0.000262594],"domain_scores_gemma":[0.9991756,0.0001308969,0.00013654162,0.0003015607,0.00010698592,0.00014841142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003495269,0.00019200092,0.00025583376,0.000075161166,0.00020529871,0.000053766144,0.00018988553,0.00011258742,0.00011872277],"category_scores_gemma":[0.00005339767,0.00017550377,0.00008703372,0.0001534967,0.000029980865,0.00033286092,0.000015416394,0.00010393779,0.00002126479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014275385,0.00013583558,0.00001775864,0.00030814338,0.000026488733,1.36932e-7,0.009417988,1.0706515e-7,0.00030795517,0.97777396,0.0095297955,0.0024675543],"study_design_scores_gemma":[0.0012774139,0.000108098124,0.00006496331,0.00004616871,0.00007527438,0.000007218613,0.0004321331,0.0007228365,0.010368905,0.97669715,0.009976327,0.00022352186],"about_ca_topic_score_codex":0.000026012094,"about_ca_topic_score_gemma":0.000022510445,"teacher_disagreement_score":0.26324674,"about_ca_system_score_codex":0.00002778165,"about_ca_system_score_gemma":0.000052609234,"threshold_uncertainty_score":0.7156836},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9714348,0.00025111204,0.0014531728,0.006577601,0.0037912289,0.0002537934,0.0000015323426,0.0008740697,0.015362733],"genre_scores_gemma":[0.99565244,0.0000063828684,0.0030802193,0.0009788912,0.0000017841967,0.0000039146116,0.0000015345056,0.0000069499933,0.0002679105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867177,0.000049974988,0.00019955916,0.00040388788,0.00034014936,0.00033465552],"domain_scores_gemma":[0.99889725,0.00006464414,0.00007297952,0.0007456332,0.000074821786,0.00014468926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023654976,0.00016168966,0.00016418632,0.00012612711,0.00014576523,0.00011994125,0.000651316,0.000073494106,0.0000074540008],"category_scores_gemma":[0.000042701322,0.000144943,0.00008061057,0.00044798022,0.000027717846,0.00021949137,0.000065928754,0.00019072744,0.00023716128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059516356,0.00016422769,0.00008401376,9.508553e-7,0.0000040542805,0.000015711003,0.00012931915,0.00009372458,0.00061920565,0.98220015,0.0039847633,0.0126979435],"study_design_scores_gemma":[0.00084048824,0.00058751507,0.0034216177,0.00002437805,0.0000040872683,0.0000049947444,0.000003347902,0.004431768,0.0019238988,0.9868729,0.0016846878,0.00020033475],"about_ca_topic_score_codex":0.000011692473,"about_ca_topic_score_gemma":0.0000017035329,"teacher_disagreement_score":0.024217656,"about_ca_system_score_codex":0.000030154502,"about_ca_system_score_gemma":0.00004233737,"threshold_uncertainty_score":0.5910604},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58024204,0.0009939838,0.0864634,0.00514192,0.11316414,0.000529088,0.0000031317404,0.0012586911,0.2122036],"genre_scores_gemma":[0.998513,0.0000020083417,0.0003489824,0.000605515,0.0000697802,0.000013210478,5.277042e-7,0.0000087940925,0.0004382277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890816,0.0000995979,0.00017370861,0.00019933213,0.00022996332,0.00038925154],"domain_scores_gemma":[0.99899316,0.00029181037,0.000032257325,0.00045259006,0.00005982643,0.00017033104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003618768,0.00011169268,0.00013684195,0.00005885324,0.0001280601,0.000106176776,0.00041306324,0.00007253979,0.0000525161],"category_scores_gemma":[0.00010892426,0.00009734466,0.00006847368,0.00019790197,0.000028458082,0.0004368749,0.000090135945,0.00015027418,0.00057126686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024648348,0.000110230176,0.0005269814,0.0000028914717,0.0000058246637,0.0000032011976,0.0002143206,0.000005024252,0.000020377229,0.97648257,0.021634191,0.0009918973],"study_design_scores_gemma":[0.0008307598,0.00046439067,0.0048349984,0.00008389191,0.000008747146,0.000069736736,0.000052111674,0.014548068,0.0009548272,0.9326481,0.04498877,0.00051558594],"about_ca_topic_score_codex":0.000012136619,"about_ca_topic_score_gemma":0.000001194934,"teacher_disagreement_score":0.41827092,"about_ca_system_score_codex":0.00005165353,"about_ca_system_score_gemma":0.0000145407885,"threshold_uncertainty_score":0.734267},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9812404,0.000026272775,0.00033432248,0.0002750822,0.0013044009,0.00010885569,4.643693e-7,0.00007563457,0.016634597],"genre_scores_gemma":[0.99855906,0.0000046664936,0.0011122191,0.0002322022,2.1787025e-7,0.0000096447575,4.1025362e-7,0.0000052659525,0.00007632561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920547,0.00007470869,0.00016607998,0.00018283546,0.00022916813,0.00014175997],"domain_scores_gemma":[0.9990501,0.00016339931,0.00009352226,0.0005388021,0.000114124196,0.000040073635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038966644,0.00008401812,0.00009848785,0.000056535202,0.000087954184,0.000019307474,0.00053939986,0.00004227213,0.00005038362],"category_scores_gemma":[0.00007486077,0.000057106634,0.00006163596,0.00038723781,0.00006246483,0.00012054244,0.00009064918,0.00009158723,0.00012803002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050031117,0.00011405021,0.00058929063,0.0000026429998,0.000010235049,0.0000014850727,0.0005776989,7.720671e-7,0.00019197458,0.99568886,0.002169201,0.0006488157],"study_design_scores_gemma":[0.00031135813,0.00007514246,0.0020197697,0.000019836469,0.0000041858298,0.000002841578,0.000012711008,0.00067118905,0.006198871,0.99057597,0.000036827125,0.00007131157],"about_ca_topic_score_codex":0.00006079146,"about_ca_topic_score_gemma":7.613946e-7,"teacher_disagreement_score":0.017318677,"about_ca_system_score_codex":0.0000071909167,"about_ca_system_score_gemma":0.000019567153,"threshold_uncertainty_score":0.2328741},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98982805,0.00023910067,0.00015223249,0.0001862214,0.0010842114,0.00011108247,3.5911214e-7,0.00018507754,0.008213666],"genre_scores_gemma":[0.9937523,0.000008613879,0.0059243585,0.0002298756,6.6473063e-7,0.000014151197,0.0000012278327,0.00000958551,0.000059241484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998864,0.000088288165,0.00021429156,0.00034553447,0.00017510752,0.00031280098],"domain_scores_gemma":[0.9991919,0.000055137043,0.00005694144,0.0005513707,0.000038896913,0.0001057546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002785675,0.00013870849,0.00016385203,0.00021096894,0.00006573099,0.000032983833,0.00066599034,0.00007713163,0.000017973573],"category_scores_gemma":[0.000033567114,0.0001231377,0.0000540486,0.00047686283,0.00005133818,0.00010348098,0.00022243695,0.00020089856,0.00005643352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001951178,0.00026251024,0.013462801,0.0000089713785,0.000012591151,0.00011292744,0.0021926411,0.000019747791,0.0025671336,0.9744605,0.00073184795,0.0061488063],"study_design_scores_gemma":[0.00093841244,0.0001372699,0.045582302,0.000027623455,0.0000026941227,0.000010454648,0.000012370661,0.0019545367,0.0036772054,0.9473748,0.000094751624,0.00018754804],"about_ca_topic_score_codex":0.00018519862,"about_ca_topic_score_gemma":0.000033881082,"teacher_disagreement_score":0.0321195,"about_ca_system_score_codex":0.000017103761,"about_ca_system_score_gemma":0.000041518444,"threshold_uncertainty_score":0.50214094},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99105436,0.00010086996,0.000026746897,0.00022839059,0.00025394472,0.00023403633,0.000004691258,0.00004730313,0.00804966],"genre_scores_gemma":[0.9994226,0.000008555534,0.0003353062,0.000013290643,0.0000074730574,0.00003812983,0.0000012552983,0.00001583103,0.00015756415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928516,0.00008655704,0.00014752353,0.00009412515,0.00013684579,0.00024978668],"domain_scores_gemma":[0.99866,0.00072008115,0.000119774224,0.00038260175,0.000045753924,0.000071767776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004582973,0.000101919446,0.00014940172,0.00003202808,0.00021735414,0.000013678058,0.00019664649,0.000040656843,0.000017906017],"category_scores_gemma":[0.000078035664,0.000066715125,0.00006298001,0.00024169097,0.0001782235,0.00009352327,0.000024635492,0.00012186763,0.000012492761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027194976,0.00020329354,0.008780681,0.000011341104,0.000052015042,3.8621482e-7,0.0004755825,1.10921356e-7,0.00030096105,0.9890823,0.00089823414,0.00016793277],"study_design_scores_gemma":[0.00040206453,0.00007195528,0.0061475853,0.000011933366,0.00003955371,0.000007863836,0.00023599391,0.0000030989806,0.006361799,0.9846361,0.0019881856,0.0000938185],"about_ca_topic_score_codex":0.000007814313,"about_ca_topic_score_gemma":0.000011551954,"teacher_disagreement_score":0.008368238,"about_ca_system_score_codex":0.000013286481,"about_ca_system_score_gemma":0.000015796777,"threshold_uncertainty_score":0.27205637},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99528366,0.000020150406,0.0013862564,0.001201456,0.0005462215,0.00023328306,4.9366565e-7,0.000014145462,0.0013143069],"genre_scores_gemma":[0.9988954,3.6535076e-7,0.00081546296,0.00016057891,0.0000040851096,0.0000136631925,3.8786052e-7,0.00000376885,0.00010626928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923956,0.00007584816,0.00014052569,0.0001547777,0.0002881641,0.00010113603],"domain_scores_gemma":[0.99905616,0.0001486095,0.00012141187,0.0004559791,0.00019654894,0.000021283548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017054522,0.00007284757,0.0000880565,0.000027799777,0.00017174473,0.000080366415,0.00044541925,0.000016465654,0.000017128847],"category_scores_gemma":[0.00005339679,0.000037771624,0.000042960703,0.0006287381,0.00011192222,0.00017076233,0.00007256821,0.00007481906,0.000011326337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029921566,0.00007147537,0.0030928599,0.0000072822977,0.000014872301,2.027736e-7,0.00050305435,0.00032443873,0.0010708133,0.9916654,0.0013431166,0.0019034705],"study_design_scores_gemma":[0.00037807657,0.00010560469,0.07532387,0.00006163041,0.00000825498,0.000010749509,0.000029820749,0.005414359,0.03420613,0.8841714,0.00017787486,0.00011222696],"about_ca_topic_score_codex":0.000060399558,"about_ca_topic_score_gemma":0.0000029364626,"teacher_disagreement_score":0.10749403,"about_ca_system_score_codex":0.0000102137765,"about_ca_system_score_gemma":0.0000923232,"threshold_uncertainty_score":0.1540282},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9229853,0.0018118244,0.019615984,0.033468492,0.0068797073,0.0010012806,0.0000018611538,0.0011049074,0.01313065],"genre_scores_gemma":[0.99798954,0.000043282376,0.0010761446,0.0006139255,0.000013667034,0.000012372927,0.0000029662456,0.0000034487207,0.00024464892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915355,0.00005262159,0.00014709037,0.00022991351,0.00018488146,0.00023191143],"domain_scores_gemma":[0.9992168,0.00007043133,0.00006469089,0.000536066,0.00006374201,0.000048250316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017980713,0.000089937945,0.00007547045,0.000023045259,0.00026639743,0.00014169155,0.00050349004,0.000024439087,0.000005886792],"category_scores_gemma":[0.0000738199,0.00006349502,0.00003456815,0.00026997912,0.000028715083,0.0004483641,0.000053557997,0.00009582382,0.0000729441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021770395,0.00004362233,0.00010052736,7.996622e-7,0.0000039401148,0.0000024019103,0.00008493577,0.00003512149,0.0002228295,0.97692597,0.004823891,0.017753791],"study_design_scores_gemma":[0.00023327777,0.00006762319,0.010491144,0.0000037204293,0.0000023964053,0.000003146579,0.0000047350863,0.0013238752,0.0008466237,0.9576523,0.029271796,0.00009940561],"about_ca_topic_score_codex":0.0000023944738,"about_ca_topic_score_gemma":0.0000023180116,"teacher_disagreement_score":0.07500425,"about_ca_system_score_codex":0.00002807294,"about_ca_system_score_gemma":0.000026559606,"threshold_uncertainty_score":0.25892517},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82639235,0.00028886713,0.02831046,0.00008180221,0.0009137951,0.0016660313,0.000020143483,0.0006074218,0.14171913],"genre_scores_gemma":[0.95653915,0.000024530016,0.04062439,0.000008228361,0.0000055703163,0.00015304357,0.0000023358252,0.000033203065,0.0026095314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991008,0.000020512562,0.0003560796,0.00014573151,0.00020184259,0.00017502852],"domain_scores_gemma":[0.9989425,0.00018848447,0.000171934,0.00049680244,0.00014125764,0.000059015958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014214266,0.0001228185,0.00025256196,0.000065302615,0.00006919455,0.000008198959,0.0002367517,0.00006764236,0.00017804897],"category_scores_gemma":[0.00022741329,0.00011364664,0.000073199284,0.00016938518,0.00012383955,0.00028979525,0.00010668628,0.00008483206,0.000057394398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000130797725,0.00023054576,0.00008516373,0.00017147415,0.000016778034,0.0000011749574,0.0010582702,4.2149463e-8,0.0004501859,0.9972329,0.00049182423,0.00024857212],"study_design_scores_gemma":[0.00022607842,0.00008457801,0.00007256,0.00004283111,0.000029333487,0.00000431624,0.00046004573,0.0000056565636,0.03199479,0.96647,0.0004957574,0.00011407607],"about_ca_topic_score_codex":0.000009881177,"about_ca_topic_score_gemma":0.0000047501103,"teacher_disagreement_score":0.13910961,"about_ca_system_score_codex":0.000023459981,"about_ca_system_score_gemma":0.000021365226,"threshold_uncertainty_score":0.46343753},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9889826,0.000079531594,0.001572892,0.00037404135,0.0012309795,0.00018341052,0.0000011883596,0.000074433825,0.00750089],"genre_scores_gemma":[0.997784,0.000010840896,0.0018400649,0.00020384886,0.000006539516,0.00002066559,6.5824236e-7,0.000013441982,0.000119896045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984317,0.00029086636,0.00018270669,0.00019979377,0.0004448867,0.00045009164],"domain_scores_gemma":[0.9982105,0.0006021765,0.00009805303,0.0008872486,0.00009127537,0.0001107334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008469694,0.00012893228,0.00015787719,0.000076299344,0.00014548903,0.00004028311,0.0010189209,0.000044113287,0.00006752518],"category_scores_gemma":[0.00015637404,0.000089666406,0.000103049446,0.00059233746,0.00012750518,0.00037765788,0.0002849112,0.00020187048,0.0001379064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010031959,0.00007908544,0.0058853896,0.0000040509253,0.000019617619,0.0000017755053,0.00042531991,0.000003293341,0.0009106295,0.99141896,0.00063368893,0.00060818007],"study_design_scores_gemma":[0.00035406035,0.00003695596,0.002573148,0.000013925994,0.0000029621174,0.00000704378,0.000026655047,0.00020207943,0.0069535826,0.98924434,0.0004717993,0.00011345198],"about_ca_topic_score_codex":0.000008533372,"about_ca_topic_score_gemma":3.326486e-7,"teacher_disagreement_score":0.008801411,"about_ca_system_score_codex":0.000026605427,"about_ca_system_score_gemma":0.000021161617,"threshold_uncertainty_score":0.36564898},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97836256,0.000026913598,0.0000489774,0.000033758424,0.010906748,0.00035401064,0.00002252887,0.00012488784,0.010119627],"genre_scores_gemma":[0.99414754,0.0000053686217,0.005052534,0.0000047640715,0.00016833241,0.000013077642,0.000004299147,0.000036870675,0.0005671978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985464,0.000064964195,0.0005914052,0.00020886784,0.0003673304,0.00022101476],"domain_scores_gemma":[0.998131,0.00041269712,0.0004671662,0.00065229076,0.00026866878,0.000068224486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031019497,0.00016344884,0.00055567024,0.00010607354,0.000041795513,0.000010230991,0.00034741842,0.00017629078,0.0001241811],"category_scores_gemma":[0.00093013234,0.00016040872,0.00010059808,0.00030808154,0.00016756335,0.00008703971,0.000095045274,0.00031174562,0.00001306731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011931429,0.00025779835,0.0013772062,0.00014719622,0.000043448043,0.0000060046523,0.00017489123,6.573244e-7,0.015248244,0.9769536,0.005661298,0.00011770531],"study_design_scores_gemma":[0.0012664712,0.00007706707,0.0012877038,0.000061945546,0.000040577797,0.000008509941,0.00003970374,0.00011721686,0.027892407,0.9635849,0.005466867,0.00015660083],"about_ca_topic_score_codex":0.000016399172,"about_ca_topic_score_gemma":0.000008706591,"teacher_disagreement_score":0.015785007,"about_ca_system_score_codex":0.00002940211,"about_ca_system_score_gemma":0.00006709947,"threshold_uncertainty_score":0.6541278},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97970766,0.0003923889,0.000028571227,0.00007458296,0.00048049944,0.00008142979,0.0000015771287,0.00021823675,0.019015059],"genre_scores_gemma":[0.99983,0.000027561691,0.00003602584,0.00003446954,0.000010106254,0.000007032359,0.0000021556032,0.000010724617,0.000041917163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956787,0.000015409829,0.00009392891,0.00009953515,0.000072998584,0.00015028018],"domain_scores_gemma":[0.9997297,0.000023402199,0.000008572178,0.00015317068,0.0000149034,0.00007028728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000058517755,0.00009510747,0.00010774125,0.000038336464,0.00006710363,0.000037528407,0.000065589,0.000038252947,0.00001515587],"category_scores_gemma":[0.000003622619,0.000084612606,0.000017241431,0.00012418958,0.000030116898,0.00012432224,0.0000047965927,0.000078882615,0.000025755871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002420626,0.000053985405,0.0010598231,0.000028099379,0.000043071155,0.000017632065,0.00043178527,0.00039108435,0.002646613,0.990788,0.0024387105,0.0020770347],"study_design_scores_gemma":[0.0013615901,0.00035454132,0.051278297,0.00010396736,0.000057384863,0.000045773522,0.00025753235,0.00092568155,0.011995053,0.91870487,0.014364685,0.0005506572],"about_ca_topic_score_codex":0.0000016268053,"about_ca_topic_score_gemma":0.0000020936318,"teacher_disagreement_score":0.072083116,"about_ca_system_score_codex":0.0000110617075,"about_ca_system_score_gemma":0.0000030879614,"threshold_uncertainty_score":0.3450402},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9817394,0.00004807452,0.008987919,0.000053472657,0.00053319626,0.00023101376,0.0000011326636,0.00006199533,0.008343796],"genre_scores_gemma":[0.9961562,0.000020646368,0.003708308,0.000027070164,9.260267e-7,0.000015235259,7.9689585e-7,0.000007846216,0.000062976076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987542,0.00012227657,0.00018548539,0.0003094557,0.00043204502,0.00019655025],"domain_scores_gemma":[0.99895453,0.00022358728,0.00012229153,0.00043150838,0.00018956304,0.000078529076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006284559,0.000108180044,0.00013724223,0.00025517636,0.000082881634,0.00002403365,0.0005482473,0.00007288684,0.000014027504],"category_scores_gemma":[0.00017967226,0.00010726823,0.000036212,0.0005372839,0.00014930897,0.00059943413,0.00016569221,0.00016698155,0.000013918572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035439294,0.000094606556,0.0015713166,0.000010443792,0.0000081717,0.0000051720244,0.0009157559,0.0000012824759,0.00075991475,0.9879416,0.000037373484,0.008618925],"study_design_scores_gemma":[0.0006713241,0.00023656625,0.012829228,0.000020916405,0.0000026623068,0.0000048634083,0.000038900605,0.00062471785,0.023605973,0.96184874,0.00001000557,0.00010611649],"about_ca_topic_score_codex":0.000026210753,"about_ca_topic_score_gemma":0.0000032853757,"teacher_disagreement_score":0.026092874,"about_ca_system_score_codex":0.00002979965,"about_ca_system_score_gemma":0.000029162153,"threshold_uncertainty_score":0.43742716},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920474,0.00023455785,0.00013937986,0.0001476777,0.0022706853,0.00035150905,0.000020776584,0.00025438942,0.0045335703],"genre_scores_gemma":[0.9890744,0.000031677744,0.0101788845,0.00020728119,0.000044469238,0.000047920304,0.00005027473,0.00007449106,0.0002905998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806356,0.00029507672,0.00044112693,0.00045315037,0.00035377432,0.00039332738],"domain_scores_gemma":[0.9985554,0.0001958641,0.00016779364,0.0006774138,0.00017025715,0.00023323593],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004550345,0.00035746317,0.00052494055,0.00010191357,0.00027712918,0.000109046414,0.00045864613,0.00025093224,0.00092195475],"category_scores_gemma":[0.00007959703,0.0003249193,0.00013361449,0.00025209525,0.00016782843,0.00026221955,0.0001607549,0.0002859861,0.00039700267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011094119,0.00042042046,0.003588326,0.000028254772,0.00014754519,0.000055695346,0.00570035,4.85656e-7,0.008041505,0.97504985,0.006634319,0.00022230708],"study_design_scores_gemma":[0.002194516,0.0001377342,0.000783837,0.00006646791,0.00011263793,0.0000065347062,0.0007827798,0.000106821506,0.076696046,0.91756916,0.0010374469,0.00050601043],"about_ca_topic_score_codex":0.000836618,"about_ca_topic_score_gemma":0.00007356009,"teacher_disagreement_score":0.068654545,"about_ca_system_score_codex":0.00011139805,"about_ca_system_score_gemma":0.00007193659,"threshold_uncertainty_score":0.99999136},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9887537,0.000092482325,0.00016680341,0.00033000836,0.00010574181,0.00024728075,0.00001031211,0.00019753957,0.010096153],"genre_scores_gemma":[0.99864787,0.000012947996,0.000986572,0.00015086742,0.0000031264158,0.000031996005,0.000009991536,0.000021062608,0.00013555851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918866,0.00003481929,0.00017101337,0.00021512508,0.00014350704,0.00024688916],"domain_scores_gemma":[0.9992055,0.00013325039,0.00010202128,0.00042720104,0.000046727022,0.00008524226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001851859,0.00016976696,0.00018099867,0.000063496525,0.00018989688,0.000038134967,0.0002787242,0.00007141207,0.000037386675],"category_scores_gemma":[0.00002529476,0.00013303792,0.0000525546,0.00038740368,0.000062095954,0.00010632009,0.000022627328,0.00017409153,0.00001727383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001266845,0.00021272397,0.00047247487,0.000009191322,0.000025888407,0.0000021698409,0.00029695217,2.5185943e-7,0.0007223906,0.9919695,0.0036301033,0.002645648],"study_design_scores_gemma":[0.00056086056,0.00012080852,0.0007331485,0.000025355701,0.000022204049,0.00000772546,0.00012988882,0.0000057008133,0.0041976147,0.9914708,0.0025416599,0.00018424865],"about_ca_topic_score_codex":0.0000047574713,"about_ca_topic_score_gemma":0.000003793592,"teacher_disagreement_score":0.009960595,"about_ca_system_score_codex":0.000014704707,"about_ca_system_score_gemma":0.000016259164,"threshold_uncertainty_score":0.5425129},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97304547,0.00050172705,0.004738132,0.00009506649,0.0028422833,0.00043660743,0.0000062550275,0.00028836864,0.018046066],"genre_scores_gemma":[0.9920646,0.000026175323,0.0076460396,0.00002936428,0.0000060108673,0.00003348196,9.0674894e-7,0.000018958226,0.0001744927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981428,0.00016749845,0.00034862783,0.00041932781,0.00043955634,0.00048223766],"domain_scores_gemma":[0.9977051,0.00024312874,0.00015365197,0.0015505446,0.00017076092,0.00017681195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069367024,0.00017544963,0.00031476247,0.00026559757,0.00012021857,0.000032679392,0.0027942713,0.00008587936,0.000041123003],"category_scores_gemma":[0.00030049536,0.00017440082,0.00014924885,0.0009770464,0.00019191628,0.00066551415,0.0009188764,0.00023469281,0.000054239503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046994333,0.00016767844,0.0031274217,0.00001546079,0.000028954497,0.00002089635,0.00077324477,7.618996e-7,0.0017980606,0.9900604,0.0004609145,0.0034992273],"study_design_scores_gemma":[0.0014509705,0.00031681661,0.0056256624,0.00001858482,0.0000055476394,0.0000066315906,0.000039859762,0.00014147357,0.030189004,0.9615219,0.0004956087,0.00018790823],"about_ca_topic_score_codex":0.000044575838,"about_ca_topic_score_gemma":0.0000052962478,"teacher_disagreement_score":0.028538452,"about_ca_system_score_codex":0.00004635611,"about_ca_system_score_gemma":0.00007645256,"threshold_uncertainty_score":0.71118593},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9960558,0.0017788503,0.00008315065,0.000004169459,0.0009806475,0.000116914096,0.000007970736,0.000049876635,0.00092264713],"genre_scores_gemma":[0.99980706,0.00003169717,0.00012369684,0.0000024101264,0.000005691868,0.000007716375,0.0000056291756,0.000014551086,0.0000015328344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942195,0.000043691318,0.00023577466,0.000065527245,0.0000936086,0.00013944172],"domain_scores_gemma":[0.99960786,0.00008332614,0.000057849225,0.00016321303,0.000029173725,0.000058549893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024831758,0.0000980538,0.0002243609,0.00008442364,0.000030697658,0.000004723137,0.00008149539,0.000058519177,0.000008231176],"category_scores_gemma":[0.000008988887,0.00009677331,0.000055467426,0.00013614721,0.000058112073,0.00012676902,0.000018966748,0.000061347986,0.0000030821373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002059699,0.000066127795,0.028895754,0.00024098842,0.00007802044,4.807015e-7,0.0010484679,0.000018361665,0.036326207,0.9316891,0.00008931779,0.0015266048],"study_design_scores_gemma":[0.0015750575,0.00017833083,0.06575201,0.00015093749,0.00006429013,0.000009716816,0.00030508885,0.00074170996,0.03614624,0.8943955,0.0004055441,0.00027559645],"about_ca_topic_score_codex":0.000023108523,"about_ca_topic_score_gemma":0.0000050733584,"teacher_disagreement_score":0.03729359,"about_ca_system_score_codex":0.000009139341,"about_ca_system_score_gemma":0.0000025768004,"threshold_uncertainty_score":0.3946301},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99530977,0.000017352972,0.00013617142,0.0000711188,0.00020291256,0.00022646313,0.000036607318,0.000013625939,0.0039859693],"genre_scores_gemma":[0.9918798,0.0000095976975,0.007986462,0.000004688135,0.0000018386276,0.000014502925,0.0000035648752,0.000014331991,0.0000851706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919593,0.0000140681805,0.00040041117,0.000110506844,0.00018124358,0.00009784569],"domain_scores_gemma":[0.99871755,0.00035440264,0.00033815452,0.00038215364,0.000155409,0.0000523043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021524442,0.000087768436,0.00025471835,0.000066433975,0.00003467927,0.000004587244,0.00014961163,0.00006094402,0.000065881766],"category_scores_gemma":[0.00026226294,0.00008205413,0.000059471484,0.00015154186,0.0001991373,0.00004137331,0.00005571229,0.000093058916,0.0000017592763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000271667,0.00032046327,0.0016395586,0.00016720418,0.00002718629,1.523574e-7,0.0017771578,1.7641206e-7,0.01919574,0.97568625,0.0010526832,0.00013072275],"study_design_scores_gemma":[0.0005112042,0.000059550686,0.0019133146,0.000040480307,0.000051943407,0.0000012825103,0.0005773687,0.00007769868,0.02323019,0.9731698,0.00027826635,0.000088907414],"about_ca_topic_score_codex":0.000020112255,"about_ca_topic_score_gemma":0.000005943038,"teacher_disagreement_score":0.00785029,"about_ca_system_score_codex":0.0000044479325,"about_ca_system_score_gemma":0.000031804273,"threshold_uncertainty_score":0.33460703},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99543864,0.00005557865,0.0005898397,0.000094881885,0.000423848,0.00040774114,0.000004465462,0.00011265957,0.0028723273],"genre_scores_gemma":[0.99898636,0.000006973838,0.00085501804,0.000013298638,0.000014518534,0.000032870772,0.000011891386,0.000020631229,0.000058412927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984996,0.000339965,0.00042766833,0.0002259427,0.00028658137,0.00022029596],"domain_scores_gemma":[0.99856377,0.0006092067,0.00018439021,0.00050744973,0.00009646473,0.00003872101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046351494,0.00014913808,0.00033670908,0.0000800884,0.00007203713,0.000020939127,0.00026580464,0.000062457955,0.000008715829],"category_scores_gemma":[0.00069152866,0.000104644954,0.00007029207,0.00043972998,0.000068431546,0.00007403769,0.000027300348,0.00014172758,0.0000064708647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013709629,0.000422066,0.009537229,0.00009087019,0.000019444711,0.0000015180432,0.0010001387,0.000010700675,0.002834122,0.98389417,0.00020319763,0.0019728274],"study_design_scores_gemma":[0.0008122195,0.00005925564,0.061440375,0.000105631945,0.000028108396,0.000002630006,0.000121165205,0.004047747,0.0016662717,0.93125784,0.0002733202,0.0001854296],"about_ca_topic_score_codex":0.00018155649,"about_ca_topic_score_gemma":0.00013156753,"teacher_disagreement_score":0.05263633,"about_ca_system_score_codex":0.00003142051,"about_ca_system_score_gemma":0.000016455582,"threshold_uncertainty_score":0.42672974},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7647784,0.0005538296,0.2229797,0.005437491,0.0015457121,0.0014351199,0.000013441362,0.00046046948,0.0027958965],"genre_scores_gemma":[0.99595314,0.000002406712,0.0034519427,0.000120570745,0.000011736941,0.00020445551,0.000004766886,0.000011882497,0.00023908816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991585,0.000026059606,0.000111602436,0.00026971515,0.00020400628,0.00023010683],"domain_scores_gemma":[0.9987328,0.00030586778,0.00006348531,0.0006729044,0.00012313222,0.00010183114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030474403,0.00010948811,0.00011669305,0.000034906534,0.00018193024,0.00014620538,0.00077871786,0.000038575323,0.0000026383561],"category_scores_gemma":[0.000041442046,0.00007470338,0.00005478953,0.00034065355,0.00006575354,0.00023136631,0.00012416799,0.00007575442,0.00003760591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011033236,0.00009609767,0.0008035456,0.0000052898463,0.000022607132,0.0000023216846,0.00035896842,0.000011512964,0.0001682978,0.98627603,0.01019823,0.0020460533],"study_design_scores_gemma":[0.0041925837,0.0007440419,0.007791563,0.000028139384,0.00005851333,0.000048831793,0.00031942845,0.08351503,0.013448596,0.8228481,0.06640024,0.0006049653],"about_ca_topic_score_codex":0.0000460654,"about_ca_topic_score_gemma":0.000025202671,"teacher_disagreement_score":0.2311748,"about_ca_system_score_codex":0.000026662325,"about_ca_system_score_gemma":0.00011444706,"threshold_uncertainty_score":0.30463153},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925327,0.0019836146,0.00005744901,0.00025385336,0.0026187925,0.0001462913,0.0000010437668,0.0004644964,0.001941801],"genre_scores_gemma":[0.99449354,0.00016951565,0.0047709257,0.0004284727,6.935168e-7,0.000013564949,0.0000010705305,0.0000135936625,0.000108627224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985957,0.00006388962,0.00024391463,0.00048358523,0.0002487503,0.00036412847],"domain_scores_gemma":[0.99887335,0.000050955256,0.000092726936,0.0006775298,0.000092696486,0.00021272378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035447485,0.00018943675,0.00020021189,0.0002239066,0.00020319448,0.00009507169,0.0005980395,0.00009389887,0.000009537997],"category_scores_gemma":[0.000027122334,0.00017250115,0.00007892532,0.0005386263,0.00013637198,0.00055536884,0.00027645618,0.00017217784,0.000061074315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036716312,0.00009677675,0.004190488,0.000007571187,0.000018518887,0.000016271164,0.00056868506,2.0028754e-7,0.0003153996,0.9920061,0.0014662417,0.0013100401],"study_design_scores_gemma":[0.0006083558,0.00015049762,0.0063605066,0.000018123354,0.00000935754,0.000016742906,0.000015461783,0.00026367602,0.001899127,0.9901666,0.00026179332,0.00022975702],"about_ca_topic_score_codex":0.00009552503,"about_ca_topic_score_gemma":0.0000022422075,"teacher_disagreement_score":0.0047134766,"about_ca_system_score_codex":0.000007362493,"about_ca_system_score_gemma":0.00002772836,"threshold_uncertainty_score":0.7034393},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9707167,0.00011437149,0.02701842,0.00025965142,0.00044566797,0.00009743578,0.0000010288246,0.00004157168,0.001305132],"genre_scores_gemma":[0.99432653,0.000009335412,0.0055210763,0.000050789233,0.000006183367,0.0000030208857,8.250148e-7,0.000005798972,0.000076419325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910617,0.000052295225,0.0002117035,0.00023925345,0.00022767417,0.00016291821],"domain_scores_gemma":[0.99914944,0.0001508572,0.00015892711,0.00033371514,0.00013937899,0.00006768756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002243602,0.000106298656,0.00020729423,0.000066238645,0.00004309638,0.000024796327,0.00039723108,0.000037237085,0.000006179308],"category_scores_gemma":[0.000050466268,0.00008857484,0.000023493822,0.00034652697,0.00010971713,0.00024270095,0.00019071862,0.00006747641,0.0000050069175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015114042,0.000081756334,0.0028612416,0.000053603766,0.000017516793,0.0000014152781,0.0005395902,0.00006813508,0.0016224261,0.97003716,0.00026487725,0.024437154],"study_design_scores_gemma":[0.0030830617,0.0015463005,0.042466003,0.00024147506,0.000031670148,0.000024652103,0.000046886402,0.058853928,0.029408509,0.86239797,0.0013826187,0.0005169361],"about_ca_topic_score_codex":0.00009001636,"about_ca_topic_score_gemma":0.0000038198523,"teacher_disagreement_score":0.10763921,"about_ca_system_score_codex":0.000009281071,"about_ca_system_score_gemma":0.000059210724,"threshold_uncertainty_score":0.3611977},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99445796,0.0008051251,0.0012030521,0.0014799695,0.0007298289,0.00025031224,0.0000041469702,0.00023277914,0.00083680503],"genre_scores_gemma":[0.9891602,0.00007219436,0.010236096,0.000498893,6.0204735e-7,0.0000060074776,0.00000461395,0.000007865474,0.000013519287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862623,0.0000735764,0.00033321505,0.0003981946,0.000296007,0.00027275993],"domain_scores_gemma":[0.99888676,0.00011177643,0.00013952139,0.00058088324,0.00014890717,0.000132175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003173386,0.00017306783,0.0002505113,0.00027361407,0.00022043085,0.00007339094,0.00042349062,0.00007004303,0.000001989525],"category_scores_gemma":[0.000024730503,0.00016381776,0.00008168886,0.0006936845,0.00009248934,0.00019278463,0.00007918718,0.00015569168,0.000007387544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004451082,0.00017422816,0.00017521455,0.000010166025,0.000015724438,0.000003792303,0.00018898697,0.00018206722,0.012068521,0.98549765,0.000512871,0.0011662979],"study_design_scores_gemma":[0.00079358974,0.00051164656,0.0014226742,0.000114550894,0.000010545137,0.000011979974,0.000005229239,0.0023920406,0.0023292021,0.9921397,0.00008714261,0.00018169847],"about_ca_topic_score_codex":0.00001820323,"about_ca_topic_score_gemma":0.0000010486608,"teacher_disagreement_score":0.00973932,"about_ca_system_score_codex":0.000009597309,"about_ca_system_score_gemma":0.000017947905,"threshold_uncertainty_score":0.6680294},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9863591,0.00005563726,0.000003932445,0.003253647,0.004647493,0.00070878357,0.000030728264,0.0002087827,0.0047318805],"genre_scores_gemma":[0.9935035,0.00002149956,0.0011012184,0.0022545862,0.00014044817,0.000042404106,0.00002174599,0.00010922761,0.002805371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974142,0.00038165384,0.00042166913,0.0006135241,0.00062009506,0.0005488696],"domain_scores_gemma":[0.9962613,0.0014635148,0.00014249986,0.0013787403,0.000421353,0.00033260492],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008445497,0.00051994063,0.0005508735,0.00015703324,0.00038541082,0.0003010951,0.0010389023,0.00033653958,0.001978673],"category_scores_gemma":[0.0012864262,0.00033933503,0.00011320412,0.0006954685,0.00016840125,0.0001044241,0.00020201284,0.0011250166,0.0018062199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023893893,0.00037378733,0.0005762805,0.000013726872,0.000135508,0.00003835036,0.0011506025,0.0000033115273,0.017376574,0.9561563,0.023807522,0.00012905835],"study_design_scores_gemma":[0.0016599789,0.001427467,0.0004954125,0.00026012893,0.000113784314,0.000008138635,0.0009106977,0.00027810087,0.038805194,0.93381757,0.0213296,0.000893909],"about_ca_topic_score_codex":0.0001417543,"about_ca_topic_score_gemma":0.00017113787,"teacher_disagreement_score":0.022338752,"about_ca_system_score_codex":0.000058424543,"about_ca_system_score_gemma":0.00020013475,"threshold_uncertainty_score":0.9999059},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927214,0.00076140475,0.00008238943,0.00017566224,0.0010743004,0.00032603103,0.000030134695,0.00012267788,0.0047060074],"genre_scores_gemma":[0.99769014,0.000033725526,0.000657555,0.00007703102,0.00003472216,0.000031944553,0.000032325534,0.00008313464,0.0013594107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753195,0.00034173322,0.0005099521,0.0002741296,0.000599199,0.00074300845],"domain_scores_gemma":[0.9967795,0.0018640838,0.00021907009,0.0006788061,0.00022063684,0.00023790573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011956752,0.0002757434,0.0004509235,0.00016118659,0.000115945135,0.000041079307,0.00047910752,0.00020008096,0.000696942],"category_scores_gemma":[0.00080360705,0.0002576202,0.00010341478,0.00061117497,0.00016487454,0.00029897923,0.00021911519,0.0003188882,0.00028449474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047603487,0.0006343069,0.0025900574,0.00015576907,0.00011751462,0.0000033192623,0.0006721468,0.0000036751303,0.013094502,0.97016644,0.01231841,0.00019623467],"study_design_scores_gemma":[0.0017486976,0.00020728543,0.0013451333,0.00007040945,0.00008937456,0.0000080969185,0.00021517671,0.00043304585,0.025617315,0.96755975,0.0022691584,0.00043652955],"about_ca_topic_score_codex":0.000022076589,"about_ca_topic_score_gemma":0.0000043051477,"teacher_disagreement_score":0.012522812,"about_ca_system_score_codex":0.00008228002,"about_ca_system_score_gemma":0.000050916595,"threshold_uncertainty_score":0.9999876},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9851128,0.00034913557,0.000003941559,0.00018919258,0.012444166,0.00035325394,0.000020076775,0.000089924855,0.0014375038],"genre_scores_gemma":[0.9992317,0.000008430191,0.0003252569,0.000175718,0.00006067577,0.000034282413,0.000002477701,0.000040140225,0.00012131123],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997685,0.00046156746,0.00050028827,0.00026084424,0.0004963718,0.00059590477],"domain_scores_gemma":[0.9983544,0.0001862607,0.00028651272,0.0009335395,0.00011115017,0.00012815652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012087489,0.00023127515,0.00039696772,0.00005538467,0.00016784934,0.00007626863,0.000854553,0.00015013116,0.0005400612],"category_scores_gemma":[0.00039596466,0.00017009715,0.00013567456,0.00025378715,0.00017063407,0.0003025529,0.00035561898,0.000089616595,0.00045430582],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001808019,0.00013772472,0.008193361,0.000026527568,0.0000152068405,0.0000010709063,0.0004812681,0.0000014870043,0.9283691,0.0606921,0.0020350406,0.000029038316],"study_design_scores_gemma":[0.00048832304,0.000041580606,0.013239681,0.000034038098,0.00004096116,0.000009821764,0.00009831196,0.000001602066,0.9715858,0.012647633,0.0016036712,0.00020858456],"about_ca_topic_score_codex":0.00017821492,"about_ca_topic_score_gemma":0.0000030701347,"teacher_disagreement_score":0.048044465,"about_ca_system_score_codex":0.00007604037,"about_ca_system_score_gemma":0.000097148266,"threshold_uncertainty_score":0.69363606},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946683,0.0002567073,0.00006559614,0.00005193574,0.0006522541,0.00016954872,0.0000023242658,0.000057142308,0.00407618],"genre_scores_gemma":[0.99984765,0.000023408666,0.000029251527,0.000006498779,0.000004652667,0.000013280048,0.0000021317524,0.000006559209,0.00006659502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966896,0.00001831308,0.00012067083,0.00005323932,0.000048036803,0.00009081227],"domain_scores_gemma":[0.9996507,0.0001631659,0.000023953036,0.000104066894,0.000037842627,0.000020281179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013476335,0.000057435223,0.00008806826,0.000014181975,0.000060009188,0.0000135217315,0.00006156382,0.00003786163,0.0000022501067],"category_scores_gemma":[0.000033454915,0.00004470906,0.000027384807,0.000073982046,0.00002225112,0.000043983706,0.0000031875054,0.000032942567,0.0000020163723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016425241,0.00000990188,0.00024787599,0.000016633723,0.000015951544,1.7956481e-7,0.00015098238,0.00000987514,0.0026923397,0.9892275,0.00081240415,0.0067999824],"study_design_scores_gemma":[0.0011046521,0.00007243598,0.008729811,0.000021542153,0.000015901374,0.000004888581,0.00011742087,0.0026894803,0.010610618,0.973711,0.0028182897,0.00010392403],"about_ca_topic_score_codex":0.0000010620655,"about_ca_topic_score_gemma":0.0000017007526,"teacher_disagreement_score":0.0155164115,"about_ca_system_score_codex":0.0000072169964,"about_ca_system_score_gemma":0.0000024074723,"threshold_uncertainty_score":0.18231826},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.927668,0.00018683802,0.000013035727,0.0008646932,0.002603747,0.00012092176,4.1592696e-7,0.00014306282,0.06839931],"genre_scores_gemma":[0.99715555,0.000020557238,0.00004716681,0.0013963222,0.00022913395,0.0000043218793,0.000007650388,0.000020428812,0.0011188478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990261,0.0000063097555,0.00021099272,0.00021390078,0.00020755063,0.00033510372],"domain_scores_gemma":[0.99954313,0.000017735354,0.00013290317,0.00022867013,0.0000635593,0.000013985468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022860753,0.00017950597,0.0001725683,0.00010816311,0.0005826516,0.00046341997,0.0002630395,0.00006631708,0.0002537431],"category_scores_gemma":[0.000022334827,0.00016689234,0.00006629403,0.00029835905,0.000024308829,0.0012618168,0.000062375395,0.00019347457,0.00023411054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004123711,0.00017134177,0.0058147823,0.0000415947,0.000021759517,0.000009299873,0.000091702874,0.00009973912,0.0012326166,0.95802295,0.029481014,0.0049719573],"study_design_scores_gemma":[0.0031776384,0.0001326564,0.032204434,0.00026628713,0.000054752392,0.0000059738927,0.00024753608,0.002299401,0.0005494109,0.6585935,0.30162162,0.00084681157],"about_ca_topic_score_codex":0.00018008752,"about_ca_topic_score_gemma":0.000009867943,"teacher_disagreement_score":0.29942948,"about_ca_system_score_codex":0.000039636416,"about_ca_system_score_gemma":0.000013061276,"threshold_uncertainty_score":0.6805672},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6334421,0.0009674296,0.085895255,0.0045960117,0.07100812,0.0077496227,0.00008543478,0.0028466994,0.19340932],"genre_scores_gemma":[0.98918194,0.000021324711,0.0033640496,0.00013038363,0.00015266778,0.0003420235,0.0000052778378,0.00009784856,0.006704488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820536,0.000096476455,0.00047429488,0.0002917411,0.00046925741,0.00046284666],"domain_scores_gemma":[0.993173,0.0055366764,0.00021423756,0.0007543605,0.00022674915,0.00009499446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009396139,0.00026393414,0.00042015768,0.00005474233,0.00045135742,0.00017147665,0.0006381829,0.00012257237,0.000104215396],"category_scores_gemma":[0.0035469597,0.00020005114,0.00021987864,0.00016289786,0.00025369093,0.0002988789,0.00017364259,0.00021406387,0.00011172619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001885528,0.00011283149,0.000046503745,0.00015019652,0.000063355015,8.4511424e-7,0.00032767077,0.000001593501,0.00003803764,0.9716421,0.027473532,0.00012450096],"study_design_scores_gemma":[0.0014691919,0.000097848424,0.000033342116,0.000042474647,0.000116971365,0.0000065537624,0.00032883286,0.00040419272,0.0009366281,0.98679334,0.009514762,0.0002558776],"about_ca_topic_score_codex":0.000012929916,"about_ca_topic_score_gemma":0.00000865286,"teacher_disagreement_score":0.35573983,"about_ca_system_score_codex":0.000075957076,"about_ca_system_score_gemma":0.000031769727,"threshold_uncertainty_score":0.8157849},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940088,0.000012900602,0.00001315478,0.0005957472,0.0016441267,0.0003180429,0.0000039931506,0.00004830078,0.003354931],"genre_scores_gemma":[0.9990962,0.000012961893,0.00056037394,0.00004787049,0.00001420357,0.000016123617,6.6231e-7,0.000027031776,0.00022456778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990238,0.00007614521,0.0002758227,0.00016095887,0.00026722605,0.00019607204],"domain_scores_gemma":[0.9977828,0.0012651032,0.00027512724,0.00054774684,0.00009333853,0.00003588271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005466632,0.00013287159,0.00024675962,0.000016656904,0.00024008071,0.00002549967,0.0004140654,0.00012625597,0.000014746308],"category_scores_gemma":[0.0012188184,0.00008102657,0.00007664064,0.00016645169,0.00040522317,0.00006125373,0.00020197176,0.00046537598,0.0000025482168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013300599,0.000061473766,0.004986194,0.000022781902,0.00003627893,8.233325e-7,0.0011641104,8.1065696e-7,0.00062989333,0.9927113,0.00030220984,0.00007079869],"study_design_scores_gemma":[0.0016589428,0.000012533006,0.0036391055,0.000038639842,0.000041917316,0.0000024274448,0.00012473956,0.00008163202,0.003084921,0.991018,0.00019857814,0.00009855636],"about_ca_topic_score_codex":0.00006927538,"about_ca_topic_score_gemma":0.0001400344,"teacher_disagreement_score":0.0050874017,"about_ca_system_score_codex":0.00002926473,"about_ca_system_score_gemma":0.0000308163,"threshold_uncertainty_score":0.33041677},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99578893,0.000009509232,0.00013634675,0.00007286966,0.00036291758,0.00009750689,0.0000053983504,0.00002586037,0.0035006653],"genre_scores_gemma":[0.9904192,0.0000021231654,0.0092233885,0.000007270631,0.0000054507213,0.0000074452346,0.0000015551717,0.000010603971,0.00032295924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994912,0.000022107455,0.00021698797,0.00008884977,0.00009362917,0.00008719753],"domain_scores_gemma":[0.99902207,0.00038710193,0.00012810585,0.0003552404,0.000061675484,0.000045810004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014423521,0.000073856,0.0001772036,0.000051221406,0.000021225484,0.000004712477,0.000202912,0.0000636081,0.00015278395],"category_scores_gemma":[0.00020020636,0.000062378254,0.000085851214,0.00015354587,0.00008242296,0.000047430884,0.00003157294,0.00013341784,0.0000071752534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062280533,0.0001278451,0.0032798045,0.000017306415,0.00001914929,1.300468e-7,0.00020083961,3.385077e-8,0.03394319,0.95962113,0.001839652,0.0009447031],"study_design_scores_gemma":[0.00025096707,0.000041759897,0.002585903,0.000013378992,0.000023965653,6.777917e-7,0.00005556263,0.000003426769,0.09232624,0.90404207,0.00060189946,0.00005417635],"about_ca_topic_score_codex":0.000026126818,"about_ca_topic_score_gemma":0.000033956927,"teacher_disagreement_score":0.058383048,"about_ca_system_score_codex":0.0000025240142,"about_ca_system_score_gemma":0.000028572416,"threshold_uncertainty_score":0.25437114},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99553907,0.0000969639,0.000039989936,0.000017786246,0.0002738898,0.00010619121,0.000004235847,0.00002174564,0.003900144],"genre_scores_gemma":[0.99926037,0.000005274837,0.00063072133,0.000011439564,0.000003666657,0.0000075653716,0.0000024549502,0.000010656159,0.000067837216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945617,0.000040764782,0.00020294817,0.000063213985,0.00011097672,0.00012595368],"domain_scores_gemma":[0.99926335,0.0001644747,0.00013666028,0.00029566686,0.000091324415,0.00004850915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023212691,0.00006883284,0.00016622375,0.00006114218,0.00003100359,0.0000020052366,0.00013636121,0.000050063143,0.000038815157],"category_scores_gemma":[0.00004331213,0.000062887106,0.000058698428,0.0003196592,0.00008161082,0.00006521313,0.00003612873,0.00006302643,0.000009374229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013409427,0.00035559072,0.029483931,0.000037942347,0.00003073614,6.7615616e-8,0.00033850496,4.7280238e-7,0.0073968163,0.96178615,0.0004988758,0.000057525936],"study_design_scores_gemma":[0.00026057102,0.000031415315,0.008348885,0.000019449777,0.000030932526,0.0000012145908,0.000043536456,0.000006401496,0.018115506,0.972753,0.00032623383,0.00006287214],"about_ca_topic_score_codex":0.0000072953294,"about_ca_topic_score_gemma":3.9038684e-7,"teacher_disagreement_score":0.021135045,"about_ca_system_score_codex":0.000004788418,"about_ca_system_score_gemma":0.000009010814,"threshold_uncertainty_score":0.25644618},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9247154,0.00047708052,0.06624835,0.0002735649,0.00071079115,0.00050376105,0.00000133604,0.000548038,0.006521701],"genre_scores_gemma":[0.9681972,0.000012940711,0.031578217,0.00012871418,0.000009978285,0.000018122731,0.000003893272,0.000013744108,0.00003714801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978289,0.00019892615,0.00027907407,0.00059818086,0.00046353324,0.00063136965],"domain_scores_gemma":[0.99878764,0.000109985616,0.000085354055,0.00077238074,0.00009090762,0.00015371421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009742322,0.00019633672,0.00024421499,0.00045080046,0.0001737973,0.00020620231,0.0014142247,0.00008523308,0.0000027031404],"category_scores_gemma":[0.000072474686,0.00020423987,0.000064492124,0.0016596686,0.000086369,0.0013198868,0.0001524649,0.00039655188,0.00001317324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010272978,0.00026480365,0.0033565224,0.0000037324703,0.0000059188487,0.00004035218,0.00079942367,0.0002670071,0.0009581147,0.95727897,0.00003660118,0.036978308],"study_design_scores_gemma":[0.0009036184,0.0002654557,0.019922396,0.000027631862,0.0000019805998,0.00001532613,0.0001655489,0.080366895,0.00056301506,0.897323,0.00015246155,0.00029264367],"about_ca_topic_score_codex":0.0000240963,"about_ca_topic_score_gemma":0.000004820844,"teacher_disagreement_score":0.08009989,"about_ca_system_score_codex":0.00006281085,"about_ca_system_score_gemma":0.000050899194,"threshold_uncertainty_score":0.832866},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9626055,0.00009970145,0.010088914,0.0021093378,0.014264097,0.00020241269,0.0000031310074,0.00019053943,0.010436373],"genre_scores_gemma":[0.9982444,0.000009464401,0.00020812017,0.00052079395,0.000039275128,0.000013710214,8.420589e-7,0.000009545028,0.00095382717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906564,0.00004539178,0.00019129168,0.00029025032,0.00016385308,0.00024355769],"domain_scores_gemma":[0.9991615,0.000093597046,0.00005717358,0.0004551454,0.00011182263,0.0001207856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028018467,0.00011537876,0.00015079061,0.00006627113,0.00023822694,0.00030344984,0.00031209813,0.0001261892,0.00009451766],"category_scores_gemma":[0.000018822147,0.00010851846,0.000041668776,0.00019008624,0.000047336824,0.0004901563,0.000099728706,0.0003149411,0.000044720084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024870164,0.000040481096,0.0045506973,0.0000032892722,0.000020116,0.0000030053318,0.00027202157,0.0000063128614,0.0009538476,0.9844562,0.009140113,0.0005514432],"study_design_scores_gemma":[0.002073293,0.00017362602,0.04084658,0.00003111913,0.00001420387,0.00017780815,0.00026962426,0.041609664,0.0019494571,0.7546656,0.15756123,0.00062781136],"about_ca_topic_score_codex":0.0002644917,"about_ca_topic_score_gemma":0.00016563764,"teacher_disagreement_score":0.2297906,"about_ca_system_score_codex":0.000019327323,"about_ca_system_score_gemma":0.00004860291,"threshold_uncertainty_score":0.44252545},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99393153,0.0009535266,0.00015762103,0.000113983515,0.0011715634,0.0003323399,0.00001533651,0.00013740546,0.0031866971],"genre_scores_gemma":[0.9979834,0.000027845801,0.0007991908,0.00006327812,0.000037330527,0.00002569082,0.000031493288,0.00009312314,0.00093866425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974162,0.0003912862,0.00051199016,0.00029470574,0.0006155255,0.0007702839],"domain_scores_gemma":[0.9968007,0.0017901278,0.00023700192,0.0006830633,0.00025862895,0.00023046214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013036043,0.00029058004,0.00047127786,0.00018984012,0.00015139155,0.000053254866,0.00044583887,0.00021245472,0.00043290082],"category_scores_gemma":[0.0011173572,0.0002777558,0.00011004828,0.00076774845,0.0001570598,0.00034594358,0.00019905432,0.0003482099,0.00016746404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050196435,0.00066684955,0.0036982095,0.00018701522,0.00016249501,0.0000046629284,0.0007830855,0.0000045225574,0.018650375,0.9689839,0.0066130017,0.00019568569],"study_design_scores_gemma":[0.0014177958,0.00019852593,0.0008790383,0.000077073615,0.00010364258,0.000010864144,0.00016273397,0.00050907093,0.03800437,0.9572735,0.0009628758,0.00040055485],"about_ca_topic_score_codex":0.000023098439,"about_ca_topic_score_gemma":0.0000052062096,"teacher_disagreement_score":0.019353995,"about_ca_system_score_codex":0.00011328852,"about_ca_system_score_gemma":0.000064645275,"threshold_uncertainty_score":0.99996746},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920422,0.0009730656,0.0000010964342,0.000003666807,0.0045059975,0.0001859261,0.000014071767,0.00017585063,0.0020981373],"genre_scores_gemma":[0.9998085,0.000038959475,0.000016431999,0.0000014974297,0.00001273109,0.000014900343,0.000004287653,0.000023556275,0.00007912949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991852,0.000053802112,0.000344263,0.00011727381,0.00013808324,0.00016138834],"domain_scores_gemma":[0.999364,0.00011746424,0.00009223286,0.00030208562,0.00005378442,0.00007042725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023494055,0.00013544536,0.00037589303,0.00008855722,0.000031841024,0.000013467903,0.00014595667,0.00012744746,0.000008880608],"category_scores_gemma":[0.00002988484,0.0001335271,0.000054164884,0.00019055893,0.00009067898,0.00010222727,0.000022688431,0.00017689264,0.0000021879232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027659293,0.00014232997,0.009923121,0.00056764274,0.00016161523,0.0000048035163,0.00047407806,0.00006794282,0.14993536,0.8372258,0.0012432548,0.0002263633],"study_design_scores_gemma":[0.007981904,0.0005674218,0.06562209,0.00076362374,0.00029643142,0.00011654098,0.0017730986,0.017341392,0.30658397,0.59072125,0.0066760117,0.0015562592],"about_ca_topic_score_codex":0.00010130768,"about_ca_topic_score_gemma":0.00001622997,"teacher_disagreement_score":0.24650456,"about_ca_system_score_codex":0.0000090797475,"about_ca_system_score_gemma":0.00000956091,"threshold_uncertainty_score":0.5445077},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9447866,0.0010856014,0.019556047,0.005074285,0.0017303406,0.0029953753,0.000064949665,0.00010719354,0.024599593],"genre_scores_gemma":[0.99783325,0.0000033149724,0.00031165048,0.00020884842,0.00009243329,0.00066318,0.000005209382,0.000019159552,0.00086296286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936575,0.00003206309,0.00014967169,0.00010114734,0.00009281497,0.000258531],"domain_scores_gemma":[0.9986958,0.0007777182,0.00007441134,0.00035941467,0.000041687676,0.000050955292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022761573,0.0001151053,0.00012397107,0.000014892176,0.00042378638,0.00004105892,0.00023900204,0.00001886026,0.00012579696],"category_scores_gemma":[0.000053449257,0.000054648517,0.0000975759,0.00018110113,0.00007580653,0.000054356722,0.000047725363,0.00009026442,0.00006258887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011830476,0.000103125516,0.000049857255,0.0000035995133,0.00004180721,5.5211014e-9,0.00012928368,0.000008383308,0.00027972175,0.99553066,0.0020674244,0.0017742797],"study_design_scores_gemma":[0.00033875369,0.00002218272,0.000076750315,0.0000060461725,0.000035361547,1.3502458e-7,0.00022096286,0.00027875468,0.004322294,0.9713211,0.02328011,0.00009751473],"about_ca_topic_score_codex":0.000013889807,"about_ca_topic_score_gemma":7.2409115e-8,"teacher_disagreement_score":0.05304663,"about_ca_system_score_codex":0.000015136606,"about_ca_system_score_gemma":0.000012715561,"threshold_uncertainty_score":0.32594648},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96385694,0.0001580912,0.000027492228,0.000055339435,0.0038732109,0.00014914376,0.000019510888,0.0000117366135,0.031848554],"genre_scores_gemma":[0.9992863,0.000009915832,0.0002911389,0.000038991217,0.00012040552,0.00000342855,0.000003087936,0.00001739532,0.00022933814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99662423,0.00022282079,0.0010988625,0.0002692257,0.0013931766,0.00039165484],"domain_scores_gemma":[0.99601406,0.001621977,0.0007771272,0.00072012714,0.0007335077,0.00013322123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042739743,0.00017441744,0.0006441589,0.00028181713,0.00007781423,0.000022512897,0.00085315946,0.00016444248,0.00036303457],"category_scores_gemma":[0.0022631276,0.00014383483,0.00018710396,0.0013139877,0.00037874974,0.000457034,0.00022498972,0.0001809993,0.000097470846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013026262,0.00050025206,0.14306316,0.000047663467,0.00004374385,0.0000017377589,0.0034453901,0.0000073510814,0.006471331,0.8393783,0.004668342,0.0022424825],"study_design_scores_gemma":[0.0015536684,0.00024243945,0.09180563,0.0000726567,0.000038214996,0.0000040003106,0.0022181193,0.00006747558,0.017089063,0.88345706,0.003193829,0.00025784317],"about_ca_topic_score_codex":0.000054975855,"about_ca_topic_score_gemma":0.000011546077,"teacher_disagreement_score":0.05125752,"about_ca_system_score_codex":0.000028482067,"about_ca_system_score_gemma":0.000097338656,"threshold_uncertainty_score":0.58654135},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9734421,0.00015959164,0.008741091,0.00027377193,0.0016611941,0.00008848218,0.0000010425598,0.00019561985,0.015437122],"genre_scores_gemma":[0.9983037,0.0000050551894,0.0014561265,0.00012717555,0.000004890414,0.0000038166772,6.0623023e-7,0.0000075719518,0.00009106579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990352,0.000112853035,0.00018341815,0.00024324076,0.00020866493,0.00021666054],"domain_scores_gemma":[0.99893713,0.00014859933,0.000096573756,0.0006746144,0.0000649147,0.00007819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005097434,0.00011458587,0.00018270516,0.00011233175,0.0001344563,0.000034327342,0.0008477847,0.00005532586,0.000025587278],"category_scores_gemma":[0.000062544466,0.00010855463,0.00009697673,0.0003948465,0.00008479596,0.00020432853,0.00027484554,0.000104752304,0.000026763611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005392299,0.000102228216,0.0012671133,0.000004002677,0.000015891777,7.878478e-7,0.00042401906,7.7340763e-7,0.0013952722,0.99205047,0.00046776404,0.0042662965],"study_design_scores_gemma":[0.0004745956,0.00042884354,0.004320192,0.000024393259,0.0000071910968,0.0000036309166,0.000011413558,0.00046227768,0.014488723,0.97172254,0.0078857625,0.00017041988],"about_ca_topic_score_codex":0.000008383805,"about_ca_topic_score_gemma":5.6752316e-7,"teacher_disagreement_score":0.024861608,"about_ca_system_score_codex":0.000009836951,"about_ca_system_score_gemma":0.000027127433,"threshold_uncertainty_score":0.44267294},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7529187,0.0000029375938,0.0413986,0.011336641,0.0017321889,0.0023913507,0.0000109901885,0.00035303348,0.18985552],"genre_scores_gemma":[0.97954726,6.8307395e-7,0.016674317,0.0011686888,0.000037350783,0.00031701944,0.00000648709,0.00003537659,0.002212835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897915,0.00010116938,0.0002923054,0.0001792573,0.00024712342,0.00020099805],"domain_scores_gemma":[0.9969184,0.0023621526,0.00012963534,0.00040805188,0.00012431425,0.00005748921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008274836,0.00015222905,0.0002112071,0.000023182947,0.00016846784,0.00006523707,0.00022493559,0.00007455276,0.00043001046],"category_scores_gemma":[0.0026001395,0.00009208516,0.00011551775,0.00010959175,0.000043890755,0.00007112587,0.000028210203,0.00014423707,0.00050227187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020575697,0.00016182334,0.0000062943263,0.000043499917,0.000011036619,8.836431e-8,0.00032384,2.687265e-7,0.00010786835,0.97283363,0.025738165,0.0007529082],"study_design_scores_gemma":[0.0008160601,0.00009685761,0.000011520385,0.000040924067,0.000020150948,0.0000015239707,0.000043718574,0.017488277,0.0036336123,0.9641995,0.01352762,0.00012024993],"about_ca_topic_score_codex":0.0000026464622,"about_ca_topic_score_gemma":0.000002996803,"teacher_disagreement_score":0.2266285,"about_ca_system_score_codex":0.000042568918,"about_ca_system_score_gemma":0.000016996606,"threshold_uncertainty_score":0.6455856},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9381284,0.0004216917,0.037627887,0.0007904798,0.010385104,0.000223526,0.0000012305579,0.0004839457,0.011937737],"genre_scores_gemma":[0.9955277,0.000007509112,0.0032299277,0.0009756395,0.000030928975,0.000012117723,7.691789e-7,0.000009124014,0.00020630022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989559,0.00004882824,0.00012940906,0.00022110366,0.00026069864,0.00038406212],"domain_scores_gemma":[0.9991596,0.00007348705,0.000046277666,0.0005190859,0.000037536407,0.00016403044],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020136272,0.00012523682,0.00012446071,0.000059053582,0.00013674304,0.00009190579,0.0006672628,0.000053943015,0.00002608343],"category_scores_gemma":[0.00006121346,0.00011001834,0.00005159911,0.00032297953,0.000024465693,0.001499968,0.0001997939,0.00014714806,0.0011596058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018659752,0.00010859928,0.0011239944,0.0000023354423,0.0000037416553,0.0000052520554,0.00023553916,0.000005658733,0.00030766203,0.99500227,0.00068796886,0.0025151123],"study_design_scores_gemma":[0.000639728,0.00016303515,0.010231812,0.000014815167,0.000004972987,0.000012355453,0.000012605999,0.00053241703,0.0045197876,0.9676723,0.015865231,0.000330962],"about_ca_topic_score_codex":0.000003550723,"about_ca_topic_score_gemma":7.278718e-7,"teacher_disagreement_score":0.057399288,"about_ca_system_score_codex":0.000052011714,"about_ca_system_score_gemma":0.000022970982,"threshold_uncertainty_score":0.9996181},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98518986,0.000058203233,0.0004043982,0.0011344431,0.0028494739,0.00018701337,4.7254525e-7,0.00016809115,0.010008048],"genre_scores_gemma":[0.99855334,0.0000027259207,0.0009482231,0.0004104255,0.0000015606021,0.000013769041,4.1388648e-7,0.000010304594,0.00005923054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987508,0.00013116746,0.00023992539,0.00029963764,0.00032789377,0.00025059804],"domain_scores_gemma":[0.99852407,0.00042304758,0.00013035294,0.0007148969,0.00013950745,0.00006811328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009526004,0.00013078141,0.0001728116,0.0000804196,0.0002278745,0.000092195536,0.00083503657,0.000052353324,0.000003406757],"category_scores_gemma":[0.000563261,0.00008683297,0.00007508189,0.00045484662,0.0000802251,0.0001202832,0.00021594529,0.00019915451,0.000037132995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038645335,0.00006003241,0.0005799334,0.000010633021,0.000008024594,0.0000012842663,0.00041224662,0.000027851396,0.0014991713,0.99392635,0.00106247,0.0024081515],"study_design_scores_gemma":[0.0004269949,0.00021078798,0.00088009913,0.000112669244,0.0000064915043,0.0000022066959,0.000009856647,0.011143635,0.010338012,0.9755784,0.0011460043,0.00014479634],"about_ca_topic_score_codex":0.000051330753,"about_ca_topic_score_gemma":0.0000018733574,"teacher_disagreement_score":0.018347891,"about_ca_system_score_codex":0.000014971983,"about_ca_system_score_gemma":0.000034061555,"threshold_uncertainty_score":0.3540946},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99164474,0.000085056905,0.001950491,0.00011625613,0.0021033569,0.00026623908,0.0000026013975,0.00004825046,0.0037829857],"genre_scores_gemma":[0.9996831,0.000007659247,0.00015269594,0.00004496992,0.0000068879544,0.000017019167,8.988942e-7,0.000006688629,0.00008011696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860704,0.00024901817,0.0004073139,0.0003040189,0.00023073849,0.0002018596],"domain_scores_gemma":[0.9982497,0.00054582657,0.0002662571,0.0005635442,0.00028732774,0.000087313674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039338088,0.00013574687,0.00033329593,0.00012842282,0.00006694175,0.000043508506,0.00039596503,0.00010566996,0.000014085022],"category_scores_gemma":[0.00014947983,0.00012025736,0.00007871051,0.00044406825,0.00009052804,0.00026537327,0.00015100163,0.00013245607,0.00001009897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011409898,0.00015603067,0.0034408325,0.000038206814,0.000026949809,9.597345e-7,0.00031866584,0.000005036026,0.0014514296,0.98918766,0.0032425954,0.0021202073],"study_design_scores_gemma":[0.0016674721,0.0010195079,0.1441454,0.00014903958,0.000011623621,0.0000098794035,0.00008705549,0.015328078,0.0068531106,0.83021235,0.00019364018,0.00032282833],"about_ca_topic_score_codex":0.0004955157,"about_ca_topic_score_gemma":0.0000120685945,"teacher_disagreement_score":0.15897532,"about_ca_system_score_codex":0.000023087705,"about_ca_system_score_gemma":0.000034743036,"threshold_uncertainty_score":0.4903953},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99691606,0.00009918699,0.00004302467,0.000009392916,0.0020110847,0.00019373013,0.000020309119,0.00014100384,0.0005662129],"genre_scores_gemma":[0.9994372,0.000022450107,0.0004281061,0.000008048236,0.000009791237,0.000015145981,0.000010622387,0.000040140087,0.000028483262],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990185,0.000055571636,0.000373371,0.00017834853,0.00018214568,0.00019210187],"domain_scores_gemma":[0.99914205,0.00006598526,0.000095168165,0.0004692013,0.00012791943,0.00009969713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017217177,0.00018370179,0.00030352332,0.00013155305,0.000046452817,0.000014140426,0.0002406273,0.00017051457,0.00020301456],"category_scores_gemma":[0.000017260989,0.00016996863,0.00009218449,0.0003768123,0.000080214304,0.00025461247,0.000019479987,0.00021065594,0.000012550879],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017518106,0.0005387539,0.01595066,0.00088009256,0.00023978078,0.000011089726,0.013525145,0.00045099048,0.8418729,0.1231889,0.0007211349,0.0024454081],"study_design_scores_gemma":[0.0044259867,0.0010639594,0.02605586,0.0004419212,0.0001097519,0.000033520384,0.001612279,0.012988835,0.6222923,0.32676917,0.0030218158,0.001184589],"about_ca_topic_score_codex":0.00022878505,"about_ca_topic_score_gemma":0.00017756388,"teacher_disagreement_score":0.21958056,"about_ca_system_score_codex":0.000014711681,"about_ca_system_score_gemma":0.000017977543,"threshold_uncertainty_score":0.69311196},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36466375,0.0027562522,0.45791945,0.002455949,0.009050839,0.0006453307,0.0000050263106,0.007233545,0.15526988],"genre_scores_gemma":[0.95066065,0.000008457401,0.048919957,0.00021655115,0.000014010819,0.000014645898,0.0000016395871,0.000013215723,0.00015089182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987107,0.00004173156,0.0001964415,0.00025578315,0.00033059402,0.0004647311],"domain_scores_gemma":[0.99899787,0.000045638197,0.00009202672,0.0005792535,0.00010289238,0.00018231063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039827183,0.00015111157,0.00015018454,0.00013188063,0.00010735211,0.0003783908,0.001247246,0.00007133133,0.0000059787726],"category_scores_gemma":[0.00006719677,0.00014613985,0.00006699334,0.0006033007,0.00008775488,0.0029803638,0.00038394882,0.00014246693,0.00013268934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.738365e-7,0.00008748098,0.007844875,0.0000098162345,0.000010482831,0.0000064288515,0.00013452015,1.07615996e-7,0.0007525818,0.96286446,0.0019651563,0.026323518],"study_design_scores_gemma":[0.0001665943,0.000051354473,0.0043569487,0.00002744311,0.0000071017575,0.000025654737,0.000005918751,0.00011282271,0.019700017,0.97033703,0.0049106767,0.0002984245],"about_ca_topic_score_codex":0.000008323851,"about_ca_topic_score_gemma":2.0374424e-7,"teacher_disagreement_score":0.5859969,"about_ca_system_score_codex":0.00003646632,"about_ca_system_score_gemma":0.000058507154,"threshold_uncertainty_score":0.595941},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91878814,0.0000062976096,0.00043046355,0.0016585855,0.00039142155,0.00023372557,0.0000016988381,0.00004861382,0.078441046],"genre_scores_gemma":[0.9983635,0.0000014244101,0.00018472748,0.00012128683,0.000009151586,0.000011302147,4.0624684e-7,0.000020534637,0.0012876637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987608,0.00029605586,0.00019317961,0.00013585528,0.0004174863,0.00019662034],"domain_scores_gemma":[0.9958071,0.0032618758,0.00009231824,0.00067757483,0.00011322158,0.00004788514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017426214,0.00009629154,0.00019515138,0.00004009655,0.00008188416,0.000014861722,0.00043678025,0.00006038114,0.00018913383],"category_scores_gemma":[0.0021080603,0.000060618862,0.000072577306,0.00018947656,0.00014062673,0.000028835891,0.00009591167,0.00023044512,0.00019064311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021125361,0.000104109495,0.00020877608,0.000029074063,0.000021052047,9.146516e-7,0.00030577157,4.8985623e-7,0.00023725347,0.9944983,0.0042786123,0.0002944886],"study_design_scores_gemma":[0.00032737854,0.00008742752,0.00013857383,0.000041074916,0.000014949402,0.000001786199,0.000067670466,0.00046633545,0.00314991,0.9944099,0.0012259675,0.00006900874],"about_ca_topic_score_codex":0.000012185994,"about_ca_topic_score_gemma":0.000002531678,"teacher_disagreement_score":0.07957535,"about_ca_system_score_codex":0.000026158448,"about_ca_system_score_gemma":0.00003154765,"threshold_uncertainty_score":0.25236973},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9961438,0.000107393455,0.00077482255,0.000235009,0.0003786278,0.00051556784,0.0000011708507,0.00011046193,0.0017331494],"genre_scores_gemma":[0.9923569,0.000013289107,0.007410465,0.00005738182,0.0000010662421,0.00010355741,0.0000013809038,0.000016378917,0.00003956578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979611,0.0001652154,0.00041600657,0.0004515069,0.00042616995,0.0005800006],"domain_scores_gemma":[0.998348,0.00039589143,0.00014431663,0.0007537266,0.00021011698,0.0001479458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004941405,0.00018480871,0.0003362382,0.0005628053,0.00008563673,0.00007178395,0.0014023115,0.0000795007,0.00002643262],"category_scores_gemma":[0.00014809622,0.00018689115,0.00010186366,0.001722164,0.00022344221,0.0008417435,0.00045711113,0.00030565765,0.00006878816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010831389,0.0001242333,0.03435959,0.000018905605,0.000013701354,0.000011885088,0.00044101724,0.0000424823,0.011990727,0.9516128,0.0000655397,0.001308344],"study_design_scores_gemma":[0.0010967936,0.00015632629,0.09845846,0.000037632777,0.0000017490978,0.0000031475392,0.000070328715,0.004986303,0.0053087617,0.8895734,0.00011160999,0.00019546575],"about_ca_topic_score_codex":0.00026103604,"about_ca_topic_score_gemma":0.000010230153,"teacher_disagreement_score":0.06409887,"about_ca_system_score_codex":0.000049946884,"about_ca_system_score_gemma":0.000041608215,"threshold_uncertainty_score":0.76212},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.969291,0.00012710712,0.00808933,0.0011717551,0.0044751205,0.00017126219,0.0000011306363,0.0003384642,0.016334843],"genre_scores_gemma":[0.99415016,0.0000060915395,0.0037936182,0.0016849149,0.000020962943,0.000019736235,0.000002767926,0.000009440759,0.00031232391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990539,0.000056613546,0.00012997136,0.00021071377,0.00021654967,0.00033227433],"domain_scores_gemma":[0.99907345,0.00018189,0.000062055144,0.0005207467,0.000032253898,0.0001295884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013548111,0.00012578403,0.00011708738,0.00007069262,0.00016399841,0.000049764,0.000462665,0.000050153696,0.000035507466],"category_scores_gemma":[0.00007887273,0.00010863276,0.000047091427,0.00030505485,0.000023010247,0.00043015875,0.000089757246,0.00012934634,0.00052110973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031587851,0.00015863552,0.00044225817,0.0000015478976,0.0000059064823,0.0000017726787,0.00014353641,0.0000720292,0.000134013,0.99568737,0.0016217852,0.0017280001],"study_design_scores_gemma":[0.00060698204,0.00013890774,0.0056100693,0.000010457777,0.0000036110978,0.0000025510856,0.000005372264,0.00071025646,0.0022230411,0.9834826,0.007009759,0.00019639079],"about_ca_topic_score_codex":0.0000027144572,"about_ca_topic_score_gemma":3.3263228e-7,"teacher_disagreement_score":0.024859155,"about_ca_system_score_codex":0.000044084143,"about_ca_system_score_gemma":0.000016528797,"threshold_uncertainty_score":0.6697985},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9779127,0.000082757746,0.00036943975,0.00002985382,0.00022580462,0.00043666782,0.000024199013,0.00010087385,0.020817686],"genre_scores_gemma":[0.9969226,0.000007646187,0.002621641,0.0000118322405,0.0000032060893,0.000047133202,0.0000066671637,0.000058366255,0.00032087252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982054,0.0002733332,0.00035484214,0.00027424603,0.0004975174,0.00039466054],"domain_scores_gemma":[0.9977863,0.00074934296,0.00021308892,0.0008518414,0.00027766766,0.00012175698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005564461,0.00020573936,0.00042240645,0.00013414149,0.000112206675,0.00001691506,0.00055287435,0.00009435708,0.000168445],"category_scores_gemma":[0.0002812841,0.00018504537,0.00009774297,0.00050625566,0.00049356394,0.00018345698,0.00012838228,0.0002963098,0.000037010584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003060702,0.00058511924,0.006186204,0.00013753385,0.00016621228,0.000025799964,0.005329308,1.729707e-7,0.0006400245,0.98555714,0.00067062123,0.0003957872],"study_design_scores_gemma":[0.0013736278,0.00060413475,0.0072523174,0.00011781785,0.00004562059,0.000006125957,0.0013143594,0.000019128109,0.021078486,0.96782774,0.00012741717,0.00023321882],"about_ca_topic_score_codex":0.000056069235,"about_ca_topic_score_gemma":0.0000345847,"teacher_disagreement_score":0.020496814,"about_ca_system_score_codex":0.000049259088,"about_ca_system_score_gemma":0.00006170606,"threshold_uncertainty_score":0.7545931},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9953726,0.00055624836,0.00009816655,0.00008064703,0.0007527824,0.000057355282,0.0000020479204,0.000021137652,0.0030590186],"genre_scores_gemma":[0.9992817,0.000019905072,0.00014775395,0.00030087074,0.00007019987,0.0000046339637,0.00006277355,0.000007400694,0.0001047763],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994646,0.000038343605,0.00008913349,0.00012525442,0.000056665518,0.00022605763],"domain_scores_gemma":[0.9997453,0.0000071762643,0.000024695515,0.00012579447,0.00002135424,0.00007569887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013136049,0.00007975638,0.0000664345,0.000010549146,0.00006105831,0.000008592099,0.000092694805,0.00009954961,0.000017075565],"category_scores_gemma":[0.000017442388,0.00006687356,0.00005573676,0.00004910934,0.000026781096,0.000003153233,0.00003527896,0.000053235988,0.000033503235],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052679086,0.0002478339,0.07922348,0.000009917556,0.000033289212,0.0000013948243,0.00006631017,0.0000023628047,0.8107033,0.10351074,0.0018230747,0.0043256613],"study_design_scores_gemma":[0.0017922997,0.0010876664,0.23057058,0.000023181425,0.000046705733,0.000038582155,0.00011047997,0.0000365169,0.65725064,0.037439782,0.07082719,0.00077634776],"about_ca_topic_score_codex":0.0000020113398,"about_ca_topic_score_gemma":3.2291973e-7,"teacher_disagreement_score":0.1534526,"about_ca_system_score_codex":0.000005985168,"about_ca_system_score_gemma":0.0000057172365,"threshold_uncertainty_score":0.27270246},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9402092,0.000021455184,0.0000021826284,0.00014873978,0.004858516,0.00013938038,0.0000038537423,0.00010177768,0.05451487],"genre_scores_gemma":[0.99728316,0.000008608161,0.000664994,0.00032200018,0.000035594556,0.000008613907,0.0000017512666,0.00003592755,0.0016393331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989825,0.000042038966,0.00020110581,0.00027069953,0.00023223714,0.00027141077],"domain_scores_gemma":[0.9987919,0.0003880659,0.00008583827,0.0005519927,0.000049676783,0.00013255668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034086074,0.00019447751,0.00022311747,0.00006178016,0.00029460565,0.000064248605,0.00022815706,0.0001868015,0.00025374745],"category_scores_gemma":[0.00029433717,0.00016160577,0.000076345634,0.00010699294,0.00020653447,0.00008500724,0.00011147278,0.00048015095,0.00001963787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000344995,0.00008034408,0.001597034,0.000015362377,0.00003187311,0.000011176713,0.00041175136,5.7268366e-8,0.0002810419,0.98200184,0.015017717,0.00051729905],"study_design_scores_gemma":[0.00067529624,0.000117838594,0.001841045,0.000015035958,0.000021735423,0.000016345375,0.000034068707,0.000008222026,0.0004986205,0.9782181,0.018346444,0.00020724372],"about_ca_topic_score_codex":0.000009789852,"about_ca_topic_score_gemma":0.000015261296,"teacher_disagreement_score":0.05707395,"about_ca_system_score_codex":0.000013945482,"about_ca_system_score_gemma":0.000017617996,"threshold_uncertainty_score":0.65900916},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7187483,0.0005204034,0.26348105,0.0000677351,0.005824049,0.00025400936,3.5676283e-7,0.00012939965,0.010974711],"genre_scores_gemma":[0.99887156,0.000010940863,0.0010248821,0.00003176573,0.000011400381,0.0000063572343,4.4242054e-7,0.0000049808264,0.000037652233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993104,0.000060832368,0.0002190727,0.00017526382,0.000103049286,0.00013138709],"domain_scores_gemma":[0.9994322,0.000051002076,0.0001280024,0.00024381177,0.00010210343,0.000042891603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003714427,0.000072313545,0.00013076459,0.000050430965,0.000062614425,0.000030485879,0.00023384648,0.00005222118,0.0000053746885],"category_scores_gemma":[0.000020462914,0.00006740823,0.000029041681,0.00018330911,0.000027486722,0.00020844987,0.00008949089,0.00006801935,0.0000038069036],"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.000002675105,0.0000311744,0.0025401823,0.000013291009,0.0000103912935,0.0000029439457,0.0011781353,0.000039289116,0.000082904866,0.9903853,0.0001978494,0.0055158455],"study_design_scores_gemma":[0.001142172,0.00033941458,0.021960523,0.00016342574,0.000015802156,0.00007302689,0.00024894674,0.6882818,0.002894976,0.28410655,0.00039545548,0.00037794822],"about_ca_topic_score_codex":0.00009337687,"about_ca_topic_score_gemma":0.0000039920874,"teacher_disagreement_score":0.70627874,"about_ca_system_score_codex":0.000015686586,"about_ca_system_score_gemma":0.000012004361,"threshold_uncertainty_score":0.2748828},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9735782,0.00008112381,0.02295236,0.0003715286,0.0016101709,0.00072068383,1.7637025e-7,0.00007111718,0.0006146318],"genre_scores_gemma":[0.99938715,0.000010429755,0.0003239453,0.00007026554,0.000013960244,0.00012821559,0.0000012037044,0.0000091901165,0.000055628927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988982,0.00009932114,0.00032339385,0.00035569313,0.00013153003,0.0001918294],"domain_scores_gemma":[0.9993232,0.000054493546,0.00010911417,0.00030196353,0.00013891577,0.00007234029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037285904,0.000113698465,0.00018297815,0.00011692075,0.00007028738,0.000072692725,0.00026266824,0.00005966039,0.000007506037],"category_scores_gemma":[0.00001684684,0.000109818255,0.000031099415,0.0005355415,0.000009402446,0.00051415386,0.00017058512,0.00011931816,0.000029516908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008160497,0.000090943075,0.008129128,0.000041352563,0.000012184251,8.9152957e-7,0.002901692,0.0019140004,0.0037797762,0.96573937,0.0006789908,0.016703539],"study_design_scores_gemma":[0.00090638734,0.00024188375,0.036801923,0.00035467587,0.0000073162287,0.0000538087,0.00033686706,0.38741738,0.004271569,0.56863755,0.00045463536,0.00051602366],"about_ca_topic_score_codex":0.0007616329,"about_ca_topic_score_gemma":0.00010438082,"teacher_disagreement_score":0.3971018,"about_ca_system_score_codex":0.000046084388,"about_ca_system_score_gemma":0.000010165651,"threshold_uncertainty_score":0.44782585},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9729276,0.00011537899,0.000011661664,0.0008410453,0.0007438019,0.0004890617,0.000006627703,0.00004085429,0.024823986],"genre_scores_gemma":[0.99907696,0.000052048443,0.00011630837,0.00007886711,0.0000050463705,0.00007200774,6.595367e-7,0.00001828633,0.0005798022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998922,0.00024585918,0.00028122382,0.00015341764,0.00018291004,0.00021459434],"domain_scores_gemma":[0.99788076,0.0010118928,0.00020031551,0.00078529754,0.00007525244,0.00004647857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093411875,0.00014474675,0.0001858559,0.000019903027,0.0005217035,0.000029437299,0.00065751176,0.00006765953,0.000025017587],"category_scores_gemma":[0.00023511793,0.00006623662,0.00017289563,0.00030218545,0.0011425907,0.000057795616,0.00014443383,0.00026175738,0.000009031115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044165143,0.00007131917,0.0029643972,0.000010624512,0.000064756685,2.0681459e-7,0.0026072215,3.1208764e-8,0.000032973407,0.9909161,0.0031688977,0.000119323995],"study_design_scores_gemma":[0.0007502048,0.00001561537,0.0018930513,0.000020140596,0.00007593332,0.000005326965,0.0016598109,0.000006341882,0.0013241321,0.9927457,0.0014168984,0.00008682031],"about_ca_topic_score_codex":0.00021816755,"about_ca_topic_score_gemma":0.00012892473,"teacher_disagreement_score":0.026149392,"about_ca_system_score_codex":0.000010175432,"about_ca_system_score_gemma":0.000023601902,"threshold_uncertainty_score":0.4209923},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057731518,0.0003303785,0.99029946,0.0016695487,0.00083619426,0.00044595078,0.0000015756019,0.00014831182,0.00049541],"genre_scores_gemma":[0.94451773,0.000047729,0.054538332,0.00061901525,0.000015155915,0.00006752354,0.0000021297221,0.000012587244,0.0001798127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888515,0.000103491424,0.00014721895,0.0002858542,0.00027371384,0.00030453943],"domain_scores_gemma":[0.9982735,0.0008746179,0.00005977842,0.000589832,0.00013752669,0.000064761545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077830383,0.00010814043,0.00011441159,0.00008402056,0.00030545983,0.000120758545,0.0010139131,0.00004109326,0.0000024122355],"category_scores_gemma":[0.00019520782,0.000083276325,0.00008615124,0.0006633254,0.0000330492,0.00033191906,0.000108616885,0.00011785986,0.000007739074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000096536605,0.000032245873,0.00006624605,0.0000030443907,0.000011319845,0.0000013609961,0.00013284881,0.0006269691,0.00078926474,0.97727793,0.0005402063,0.020508917],"study_design_scores_gemma":[0.00041116067,0.00012131915,0.0008427472,0.000006194859,0.000004837644,0.000004911587,0.000009587052,0.03343435,0.0044833664,0.9563504,0.0042238296,0.00010732102],"about_ca_topic_score_codex":0.0000034790473,"about_ca_topic_score_gemma":8.314476e-7,"teacher_disagreement_score":0.93874454,"about_ca_system_score_codex":0.00003037298,"about_ca_system_score_gemma":0.000032881417,"threshold_uncertainty_score":0.339591},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9880911,0.000048993687,0.000033913555,0.000008680932,0.00751042,0.00010758413,0.0000075854973,0.000082458726,0.004109231],"genre_scores_gemma":[0.9996056,0.000002231665,0.000020756219,0.00000574185,0.000013208054,0.0000070464193,0.0000029347596,0.000016644733,0.00032584308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995541,0.00003073651,0.00015077193,0.00006645305,0.00009438476,0.000103539314],"domain_scores_gemma":[0.99960136,0.00002592197,0.000036575577,0.0002781571,0.00002944045,0.00002852977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011438087,0.00007945712,0.00010742514,0.000027829596,0.000041833977,0.000012354663,0.00018187241,0.00008008089,0.0001782674],"category_scores_gemma":[0.00001533646,0.0000609121,0.000058838425,0.00015991465,0.000026584425,0.000060473856,0.000017569913,0.00014275959,0.0000148001145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020207003,0.000010770084,0.0042138644,0.000036668025,0.000019965373,2.4987688e-7,0.00019209328,0.00007236055,0.20639934,0.7882426,0.0007551146,0.000054991702],"study_design_scores_gemma":[0.0011293984,0.000024906823,0.020863922,0.000025352012,0.00002546613,0.000007354142,0.000053560787,0.0012368369,0.34505364,0.60752773,0.02376514,0.000286701],"about_ca_topic_score_codex":0.0000046541245,"about_ca_topic_score_gemma":0.000011718521,"teacher_disagreement_score":0.18071485,"about_ca_system_score_codex":0.000007116845,"about_ca_system_score_gemma":0.000007098362,"threshold_uncertainty_score":0.24839234},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9973972,0.000029439268,0.00012554468,0.0002495919,0.00050528464,0.0001937572,0.000018193765,0.000099004086,0.0013820218],"genre_scores_gemma":[0.9980576,0.000003581527,0.001482387,0.000025324232,0.000008094373,0.000045704342,0.000028703396,0.000018348404,0.00033022367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992778,0.00004350359,0.00024055761,0.00015505879,0.00015374154,0.000129363],"domain_scores_gemma":[0.9991166,0.00019827126,0.00013842506,0.00042692086,0.000064841515,0.000054943554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028731604,0.000107143016,0.00016527365,0.00004540377,0.000113071306,0.00001596748,0.0002022926,0.00010346577,0.00009144022],"category_scores_gemma":[0.00008366398,0.000104392886,0.000065918626,0.00016779952,0.00010739419,0.0000954738,0.000027348799,0.00016350103,0.000024893578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029389098,0.00021603025,0.00017387126,0.000009850264,0.000014255905,3.0020286e-7,0.000107999,7.405851e-8,0.19535546,0.7963982,0.0074176886,0.00030331712],"study_design_scores_gemma":[0.0003681663,0.00003839933,0.00048050788,0.0000067779374,0.00002659286,0.0000018425461,0.000017690923,0.000046957135,0.07327261,0.9192232,0.006416673,0.0001006207],"about_ca_topic_score_codex":0.000012825045,"about_ca_topic_score_gemma":0.0000107367405,"teacher_disagreement_score":0.12282495,"about_ca_system_score_codex":0.0000071546997,"about_ca_system_score_gemma":0.0000121116955,"threshold_uncertainty_score":0.42570183},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99471444,0.000011798646,0.00040866292,0.0002816768,0.00006659478,0.0003146336,0.000006220182,0.000028462007,0.004167486],"genre_scores_gemma":[0.99912924,0.000005634005,0.0005129475,0.00012345596,0.0000034515551,0.00006256658,0.0000021139215,0.000025131067,0.00013546963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917054,0.0001380506,0.00017531193,0.00019047994,0.00015420103,0.00017139308],"domain_scores_gemma":[0.99835795,0.00087253505,0.00012988769,0.0005215578,0.000057959172,0.000060136834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041263908,0.00014433493,0.00020618021,0.000055881133,0.00015887393,0.000022535416,0.00020970462,0.00005555602,0.000028140783],"category_scores_gemma":[0.0000891226,0.00009251309,0.000044062817,0.00029219312,0.00022040051,0.000046597514,0.000038909104,0.00013988992,0.000012695778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020226462,0.0001453112,0.0016148103,0.000023162487,0.000040452807,3.4184743e-7,0.00041718237,0.0000029774997,0.0005232877,0.99645,0.00049356255,0.00026864908],"study_design_scores_gemma":[0.0005365914,0.00018394679,0.0022165081,0.000058980608,0.000048219827,0.0000016756297,0.00012245911,0.00023376114,0.0022549885,0.9938224,0.00039202717,0.00012841739],"about_ca_topic_score_codex":0.000010203499,"about_ca_topic_score_gemma":0.000014260471,"teacher_disagreement_score":0.0044147642,"about_ca_system_score_codex":0.0000060479906,"about_ca_system_score_gemma":0.000012907762,"threshold_uncertainty_score":0.37725744},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9519708,0.00012257216,0.012277962,0.0005881658,0.003655731,0.0004578263,0.0000046944824,0.00024554136,0.030676672],"genre_scores_gemma":[0.99787647,0.0000031811212,0.0016399388,0.00007104213,0.0000054523302,0.000018835646,0.0000028858785,0.000014318736,0.00036785429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820924,0.00015438825,0.00023564426,0.0003638767,0.00071418256,0.00032268566],"domain_scores_gemma":[0.99832505,0.00024614506,0.000120180295,0.0007849,0.0003275052,0.00019619436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007689773,0.00014696798,0.00019935134,0.00023933375,0.000077382625,0.000073204596,0.001038645,0.00007486979,0.0000127434305],"category_scores_gemma":[0.00027379335,0.0001418794,0.00008612085,0.00095232954,0.00014576426,0.0005792073,0.00021620805,0.00017008616,0.000087698885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074888754,0.00020553924,0.00045198516,0.0000065195118,0.000015362846,0.000012362749,0.00046734023,0.000024253726,0.00071648206,0.9939965,0.0016986906,0.0023300739],"study_design_scores_gemma":[0.0013447729,0.000614142,0.0005007022,0.000022939706,0.0000031624404,0.0000027841563,0.000046383288,0.001033589,0.0077301585,0.9875523,0.0009773925,0.0001716944],"about_ca_topic_score_codex":0.000015557871,"about_ca_topic_score_gemma":0.0000022996353,"teacher_disagreement_score":0.045905653,"about_ca_system_score_codex":0.00009232668,"about_ca_system_score_gemma":0.000102649436,"threshold_uncertainty_score":0.5785674},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9843687,0.000059452825,0.00095681596,0.00021945864,0.0003800549,0.00007216511,0.0000015083132,0.00006110474,0.013880757],"genre_scores_gemma":[0.99912155,0.000011579322,0.0005159559,0.00003060618,0.000004525988,0.000024177338,0.0000010378958,0.000012851818,0.0002777058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993499,0.00009511165,0.0001967176,0.000100894846,0.00012212315,0.00013523368],"domain_scores_gemma":[0.9985004,0.00088595337,0.000114967756,0.00041813817,0.000045651086,0.000034861292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046656988,0.0000775245,0.00011778953,0.00002750682,0.00021789149,0.000016270818,0.0002632888,0.000038722665,0.0000113905835],"category_scores_gemma":[0.00009892548,0.00005534064,0.000076809556,0.00015148963,0.00009016619,0.000034825418,0.00004444952,0.00006871921,0.0000058320575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044368644,0.00005460551,0.00009993286,0.000008206301,0.0000151143895,1.0592983e-7,0.00011754975,3.3965776e-7,0.00072134676,0.9961354,0.00087677257,0.0019661963],"study_design_scores_gemma":[0.0001766424,0.000020566342,0.00017777091,0.000011372044,0.000014515707,0.000001396684,0.00005349835,0.000038152037,0.0028022514,0.992259,0.004381731,0.000063081476],"about_ca_topic_score_codex":0.000014007387,"about_ca_topic_score_gemma":0.000007775262,"teacher_disagreement_score":0.014752877,"about_ca_system_score_codex":0.0000047034196,"about_ca_system_score_gemma":0.000007453723,"threshold_uncertainty_score":0.22567257},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99554855,0.00017963706,0.00043617742,0.00017399264,0.0017470095,0.000112146176,8.684535e-7,0.00013736542,0.0016642606],"genre_scores_gemma":[0.9970541,0.0000044139897,0.0027895109,0.000066524866,0.0000014343937,0.00000505349,0.00000215655,0.0000103908515,0.00006641476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986955,0.000081623504,0.00031322148,0.00033251068,0.00031146212,0.0002656995],"domain_scores_gemma":[0.99901885,0.00014989574,0.00014565593,0.00044581434,0.000100182835,0.00013957749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041860127,0.00015134209,0.00024785558,0.00007730902,0.00012331933,0.000088863846,0.0002931576,0.00005904954,0.000006479896],"category_scores_gemma":[0.000222117,0.00014457793,0.00005508121,0.00027719117,0.000080066726,0.00020296738,0.00026774307,0.00011773836,0.000014467333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004276124,0.00012464712,0.0028477034,0.000064821485,0.000029637382,0.000004615649,0.00068505335,0.00006198391,0.0026965651,0.98921263,0.0008291681,0.003438916],"study_design_scores_gemma":[0.0026364601,0.00040189145,0.015383027,0.00032348212,0.000032637818,0.000083916464,0.00007072409,0.1734381,0.0043258225,0.802744,0.00010552362,0.00045445326],"about_ca_topic_score_codex":0.0001275632,"about_ca_topic_score_gemma":0.0000015260782,"teacher_disagreement_score":0.18646866,"about_ca_system_score_codex":0.000024136849,"about_ca_system_score_gemma":0.00003084503,"threshold_uncertainty_score":0.5895717},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95702595,0.00015812882,0.0008240411,0.00008527859,0.0025537414,0.00011215664,9.65698e-7,0.00022098981,0.039018728],"genre_scores_gemma":[0.98772395,0.000011317563,0.011977315,0.000080636986,6.439787e-7,0.0000075781627,5.283398e-7,0.000009252666,0.0001887642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989407,0.000053942797,0.00025850532,0.00027861513,0.00022422435,0.00024402853],"domain_scores_gemma":[0.9989279,0.00004052311,0.00011734657,0.0006511545,0.00015297037,0.0001101301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002812885,0.000121964105,0.00017898825,0.00009113276,0.00006971669,0.000021592386,0.0006868936,0.00006957923,0.000049304224],"category_scores_gemma":[0.00002852372,0.00011137113,0.00009548182,0.00054174993,0.00007264905,0.00021697531,0.00019790232,0.00010800314,0.00016634267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034686996,0.00015238638,0.009604363,0.000008228992,0.000016521319,0.0000048544925,0.0005528142,3.5327128e-7,0.00048713683,0.98623,0.0022366347,0.0007032398],"study_design_scores_gemma":[0.00046540378,0.00006757938,0.0032571745,0.000022883321,0.0000071500845,0.000012726972,0.00001984466,0.00016996509,0.0081864875,0.9873837,0.00026834197,0.0001387006],"about_ca_topic_score_codex":0.00013059298,"about_ca_topic_score_gemma":0.00000210029,"teacher_disagreement_score":0.038829964,"about_ca_system_score_codex":0.0000072581374,"about_ca_system_score_gemma":0.00004189104,"threshold_uncertainty_score":0.4541583},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9785847,0.00008570339,0.000056307093,0.000010222977,0.0008998696,0.000087951346,0.0000029286637,0.00013838058,0.02013395],"genre_scores_gemma":[0.9998277,0.0000033202987,0.00008827923,0.000017673805,0.0000072944677,0.0000044926346,0.0000036829488,0.000013001123,0.00003455755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993384,0.0000287907,0.0002164775,0.000098235774,0.00015571712,0.00016237092],"domain_scores_gemma":[0.9995621,0.00007224064,0.000037042926,0.00024994076,0.00002254212,0.000056176992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001452547,0.00012273544,0.00019757044,0.000069240996,0.000028275215,0.000009254179,0.00013358517,0.000048285925,0.000044365825],"category_scores_gemma":[0.000023695517,0.000118359465,0.00006903869,0.00017470424,0.000018394756,0.000055938996,0.0000051200477,0.00012215921,0.000050797917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007816263,0.00007216293,0.00010505125,0.000042452768,0.000025152223,0.00000339005,0.00012384939,0.0010836257,0.0033819906,0.9941179,0.00047576436,0.00056085404],"study_design_scores_gemma":[0.000753427,0.0001638366,0.0007355191,0.00012718524,0.0000126036775,0.0000038461476,0.00004686604,0.0022297234,0.020747086,0.9749008,0.000110146735,0.00016899608],"about_ca_topic_score_codex":7.878174e-7,"about_ca_topic_score_gemma":3.8626516e-7,"teacher_disagreement_score":0.021243012,"about_ca_system_score_codex":0.000016216029,"about_ca_system_score_gemma":0.0000067318874,"threshold_uncertainty_score":0.4826559},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99473494,0.00007703436,0.0005836395,0.0004885487,0.0028102403,0.000100845544,9.585086e-7,0.000041934607,0.0011618822],"genre_scores_gemma":[0.99965614,0.000013595746,0.0002442237,0.000053552885,0.000005391654,0.0000043513733,2.3798925e-7,0.0000062824133,0.000016200425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894184,0.00020399484,0.0002615131,0.00015794294,0.00025408936,0.00018061507],"domain_scores_gemma":[0.99795526,0.0006140859,0.00024032145,0.0010598054,0.0000989884,0.0000315587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090402237,0.00010259265,0.0001356751,0.00005511179,0.00027765174,0.00006168542,0.0017902442,0.000061710336,0.0000055720175],"category_scores_gemma":[0.000148663,0.000060971604,0.00015358946,0.0005549792,0.00032372453,0.00015422245,0.00046604685,0.00032702615,0.0000017231644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009308446,0.00004142113,0.016933516,0.0000072839066,0.000018326466,3.1144242e-7,0.00043832668,0.000001060933,0.008665376,0.9706771,0.0002795897,0.002928379],"study_design_scores_gemma":[0.00023949558,0.00006219366,0.031111643,0.000037461672,0.0000073647548,0.0000024423389,0.000068535024,0.00027211776,0.055047486,0.9121424,0.00092405156,0.00008478706],"about_ca_topic_score_codex":0.00007542345,"about_ca_topic_score_gemma":0.000046399477,"teacher_disagreement_score":0.058534678,"about_ca_system_score_codex":0.000005177666,"about_ca_system_score_gemma":0.000037119888,"threshold_uncertainty_score":0.3326749},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2556777,0.00004515218,0.7371766,0.00008918138,0.005953204,0.00039701813,0.0000040809714,0.00015771727,0.00049934676],"genre_scores_gemma":[0.9905398,0.0000019667611,0.009199669,0.00008003749,0.00004072316,0.00005480984,0.0000038828252,0.000014829432,0.00006428354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865335,0.00018615981,0.00031789715,0.00040708468,0.00015498727,0.00028050438],"domain_scores_gemma":[0.9984129,0.00022451498,0.00019748286,0.00080504705,0.00025220227,0.00010781914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009457876,0.00015002182,0.0003143279,0.000096022166,0.00013923411,0.00008215313,0.00067837455,0.00011287139,0.000002592308],"category_scores_gemma":[0.000053870695,0.00014276619,0.00014450104,0.00027232635,0.00004703371,0.00038911268,0.00007120066,0.000095911724,0.0000036677989],"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.000005514846,0.0001337736,0.00019957876,0.000017352364,0.000025608097,3.964271e-7,0.00017987232,0.000012894061,0.002994781,0.9387721,0.000815898,0.056842234],"study_design_scores_gemma":[0.001007548,0.0007204627,0.0007667889,0.000020364158,0.000007572917,0.000005959301,0.000020952202,0.5694831,0.008644923,0.41662246,0.0025024794,0.00019741878],"about_ca_topic_score_codex":0.000075092226,"about_ca_topic_score_gemma":0.000010433903,"teacher_disagreement_score":0.7348621,"about_ca_system_score_codex":0.00002848121,"about_ca_system_score_gemma":0.000024195893,"threshold_uncertainty_score":0.5821836},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98470324,0.00047942862,0.006393874,0.0008433705,0.0014908887,0.00009185468,0.0000012460463,0.0002015968,0.0057944683],"genre_scores_gemma":[0.9969291,0.000022648366,0.002654551,0.00020995433,0.000009104348,0.000001845032,0.0000012788408,0.000004884061,0.00016662851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989784,0.000051282725,0.00022848975,0.000263299,0.00024947338,0.00022909325],"domain_scores_gemma":[0.99915653,0.000069757705,0.00010482922,0.0004937814,0.00010417953,0.00007093161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021412043,0.00011636264,0.00020172048,0.00008581051,0.00009099287,0.00007784924,0.0006677889,0.000039779454,0.000003940898],"category_scores_gemma":[0.000040264757,0.000118356125,0.0000881922,0.00027106248,0.000032039527,0.00034527102,0.00010392227,0.0001355067,0.000015251202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073736383,0.000110057765,0.00037598066,0.0000046966943,0.000012985182,0.000016490269,0.00022370133,0.00012364164,0.0069777234,0.98268247,0.00095404394,0.008510827],"study_design_scores_gemma":[0.0064893956,0.0019677866,0.022726318,0.0004890896,0.000069120106,0.00012316617,0.00028944606,0.10779304,0.03126277,0.82315516,0.0041131494,0.0015215423],"about_ca_topic_score_codex":0.00004999509,"about_ca_topic_score_gemma":0.0000011709312,"teacher_disagreement_score":0.1595273,"about_ca_system_score_codex":0.00003642464,"about_ca_system_score_gemma":0.000067554756,"threshold_uncertainty_score":0.48264226},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9956385,0.00013325842,0.00012203032,0.00073496404,0.0005700847,0.00096195424,0.000033644075,0.00006237866,0.0017431906],"genre_scores_gemma":[0.9977676,0.00001425647,0.00095234823,0.000076346325,0.0000080278105,0.0005587442,0.000010237182,0.00002688315,0.000585502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915224,0.00005049081,0.00026677398,0.00016411235,0.00013865903,0.00022772924],"domain_scores_gemma":[0.998159,0.0009361847,0.00013335019,0.0005604232,0.00015424815,0.000056781508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042038603,0.00012933616,0.0001900676,0.00004992622,0.0002688894,0.000038246173,0.0003827416,0.00008113348,0.0001735095],"category_scores_gemma":[0.00017948599,0.00009342614,0.0001682945,0.00023162666,0.00012906936,0.00009180664,0.000048283848,0.00010546854,0.000058877715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005775924,0.0001684921,0.001713215,0.000035413435,0.000053063726,7.5087456e-8,0.00018935878,2.743577e-7,0.00070494524,0.97958785,0.017285787,0.00025576827],"study_design_scores_gemma":[0.00047811502,0.00004541936,0.0050736694,0.000014459365,0.000059245605,0.0000012221782,0.00016030861,0.00006781764,0.0039209365,0.98407054,0.0059957346,0.000112514346],"about_ca_topic_score_codex":0.00002848314,"about_ca_topic_score_gemma":0.000007435735,"teacher_disagreement_score":0.011290051,"about_ca_system_score_codex":0.000010349616,"about_ca_system_score_gemma":0.00002185988,"threshold_uncertainty_score":0.38098073},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99662465,0.000067058965,0.0001257698,0.00009224229,0.00022152143,0.00012909881,0.0000013000184,0.0000556383,0.0026827487],"genre_scores_gemma":[0.9998231,0.0000115244775,0.000072522664,0.000023094764,0.0000064080327,0.000014359607,0.000004682307,0.000017451455,0.000026886455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953496,0.000014274106,0.000115525305,0.00008398626,0.00013656888,0.00011469212],"domain_scores_gemma":[0.9996023,0.00004656888,0.00003105887,0.0002388002,0.00005254985,0.00002872695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000359489,0.00009641954,0.00012499276,0.000040095358,0.00004283956,0.00003041769,0.0001374118,0.000028756098,0.00014099372],"category_scores_gemma":[0.0000046593195,0.000060013866,0.00003527528,0.0001678749,0.000022992435,0.00010140059,0.000013647913,0.00008999191,0.000020448844],"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.0000115616795,0.000051530158,0.0014623824,0.000026768403,0.00020975045,0.0000012779648,0.00030591394,0.34429842,0.00248633,0.6467264,0.002873843,0.0015458037],"study_design_scores_gemma":[0.0020454808,0.00047011304,0.05948884,0.00011292746,0.0001886183,0.000004233382,0.00027002554,0.47007287,0.034389358,0.4317183,0.00045036103,0.000788909],"about_ca_topic_score_codex":0.00004212993,"about_ca_topic_score_gemma":0.0000031384047,"teacher_disagreement_score":0.21500812,"about_ca_system_score_codex":0.000023608914,"about_ca_system_score_gemma":0.0000051143243,"threshold_uncertainty_score":0.24472944},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9749203,0.0004132851,0.0059991647,0.00008814013,0.0024038844,0.00023658377,0.0000027694578,0.00014651069,0.015789393],"genre_scores_gemma":[0.9973812,0.000028593257,0.0022736292,0.000062702784,0.0000075316125,0.000022951977,0.0000010956501,0.000014713185,0.00020756411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981659,0.00011675215,0.00021707652,0.0002614094,0.0004892679,0.00074957043],"domain_scores_gemma":[0.9983885,0.000433909,0.000088874884,0.000804305,0.000108783956,0.0001756013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009039326,0.0001441366,0.00021797414,0.00024488618,0.00014524514,0.00003380002,0.001052111,0.00006122051,0.00001942877],"category_scores_gemma":[0.00015965065,0.00013991454,0.00007899041,0.0009248264,0.000120135264,0.0007550204,0.00051877653,0.00021870785,0.000093821196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016324471,0.00017088339,0.00334231,0.000014990448,0.000015536378,0.00000269975,0.00032901522,0.00003627966,0.0017872291,0.9920619,0.0005029042,0.0017199125],"study_design_scores_gemma":[0.0005940303,0.00025012554,0.0021620842,0.000026175996,0.000003247001,0.000003010942,0.00005826376,0.00020420027,0.02267294,0.97273767,0.0011087856,0.00017945716],"about_ca_topic_score_codex":0.000017649187,"about_ca_topic_score_gemma":8.23768e-7,"teacher_disagreement_score":0.022460949,"about_ca_system_score_codex":0.000057948033,"about_ca_system_score_gemma":0.000038668757,"threshold_uncertainty_score":0.5705549},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9714142,0.00009021248,0.007134544,0.00000955475,0.0009144571,0.0002530304,0.0000051123016,0.00021392074,0.019964954],"genre_scores_gemma":[0.9693653,0.000009167307,0.030164922,0.000013822574,0.0000067526576,0.000014669706,0.0000025101551,0.00003995917,0.0003828699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877566,0.00007022652,0.00039783545,0.0002467459,0.0002728094,0.00023674507],"domain_scores_gemma":[0.99826866,0.00042257528,0.00018730284,0.000797457,0.00020755656,0.00011641869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004241412,0.00016661563,0.00035294803,0.00019741703,0.000073300216,0.000007130341,0.00025666374,0.00009627031,0.00042168016],"category_scores_gemma":[0.0011135071,0.00014553354,0.000085085776,0.0006708696,0.00013444347,0.00024446216,0.00007074743,0.000132392,0.000121357305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034374905,0.00070289953,0.00031059294,0.00007643596,0.000022694327,0.0000039798833,0.00043151836,5.069754e-7,0.001603439,0.9952996,0.00043111792,0.0010828696],"study_design_scores_gemma":[0.00037734903,0.00026411982,0.00048533507,0.000032546013,0.000044077053,0.000007794306,0.00033599272,0.00004688883,0.013973481,0.9841034,0.00016896911,0.00016007338],"about_ca_topic_score_codex":0.000005764115,"about_ca_topic_score_gemma":5.6062873e-7,"teacher_disagreement_score":0.023030378,"about_ca_system_score_codex":0.000027698834,"about_ca_system_score_gemma":0.000020081166,"threshold_uncertainty_score":0.59346855},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8951338,0.0003739486,0.07396856,0.007437053,0.010309993,0.0010933215,0.000008061778,0.00046906926,0.011206203],"genre_scores_gemma":[0.99388915,0.0000069324983,0.0053779595,0.000507004,0.0000022448332,0.000037158316,8.5136855e-7,0.0000108094855,0.00016787114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896663,0.000052826017,0.00021359872,0.00026637586,0.00024994882,0.0002506113],"domain_scores_gemma":[0.99841946,0.0005566236,0.000110125926,0.00072326866,0.00013024767,0.000060256694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070360984,0.00011860886,0.000166486,0.000053420714,0.00020492746,0.00007223401,0.0006625247,0.000061147446,0.0000054030716],"category_scores_gemma":[0.00009917856,0.00008227102,0.00012263181,0.0003464041,0.000073340365,0.000107832515,0.000078118304,0.00010589549,0.000034044588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011280468,0.00009664487,0.00020307154,0.000011511586,0.000013769805,2.8031462e-7,0.0001837552,0.0000587966,0.0003268809,0.99156475,0.0038896468,0.0036396286],"study_design_scores_gemma":[0.00086209155,0.00019213541,0.00020927963,0.000023975465,0.000010971442,0.0000027024246,0.00000615273,0.013700904,0.0023995512,0.97561085,0.006873173,0.0001082343],"about_ca_topic_score_codex":0.000046020108,"about_ca_topic_score_gemma":0.000002432938,"teacher_disagreement_score":0.098755375,"about_ca_system_score_codex":0.000009392362,"about_ca_system_score_gemma":0.000031741765,"threshold_uncertainty_score":0.33549148},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9743834,0.000018701205,0.000007132543,0.0002494768,0.004086742,0.0001260849,0.0000644612,0.000048238846,0.021015737],"genre_scores_gemma":[0.998969,0.00000423908,0.000064948654,0.000084464366,0.00015233074,0.000006685376,0.000053546588,0.000016820495,0.0006479235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990304,0.000022215487,0.00025292736,0.00024571427,0.00017431445,0.00027440113],"domain_scores_gemma":[0.9992572,0.000060912505,0.00013925682,0.0003418824,0.00007511915,0.00012563706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001876514,0.0001412932,0.00016878547,0.000041998803,0.00019739615,0.0000939978,0.00029157236,0.00008680141,0.0000648295],"category_scores_gemma":[0.000016913742,0.00014233241,0.00008721876,0.00013565467,0.00008583702,0.00020961472,0.000076194934,0.00040886868,0.00012838237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008621087,0.000084613326,0.0052740155,0.0000022100498,0.000021342803,9.093283e-7,0.00036615774,0.00000974694,0.0004732321,0.9914582,0.00077962334,0.00152133],"study_design_scores_gemma":[0.0013093353,0.000031680018,0.018865878,0.000011047398,0.000009157833,2.0613831e-7,0.000098332144,0.00078024535,0.0004663467,0.97287834,0.0052882275,0.00026119023],"about_ca_topic_score_codex":0.0004069278,"about_ca_topic_score_gemma":0.000006059739,"teacher_disagreement_score":0.024585616,"about_ca_system_score_codex":0.000011411322,"about_ca_system_score_gemma":0.00007136293,"threshold_uncertainty_score":0.5804148},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9865142,0.00005305562,0.0057359817,0.0012083416,0.0040874975,0.0006342594,0.00009992739,0.00015693321,0.0015097974],"genre_scores_gemma":[0.9939039,0.0000013271207,0.005004107,0.00075793103,0.00003701409,0.00014996954,0.00003256234,0.0000339484,0.00007929087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849,0.00008842949,0.0003157006,0.00031129172,0.00043226485,0.00036230922],"domain_scores_gemma":[0.9978516,0.0009692258,0.00007094021,0.0003413878,0.00045342743,0.00031341228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000570246,0.0001918951,0.00025886818,0.0002020219,0.00028322465,0.000046950903,0.00022066815,0.0001392753,0.000055645356],"category_scores_gemma":[0.0019105406,0.00017575978,0.00016682292,0.00032384187,0.0001295595,0.00011487213,0.000080236816,0.00017276505,0.000009983058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012068044,0.00022027997,0.00012675383,0.000029754325,0.000043652166,0.000004641591,0.00090066245,0.00000891833,0.000092611066,0.94941646,0.048984636,0.00005096002],"study_design_scores_gemma":[0.001205795,0.00038867953,0.00021063711,0.000019686137,0.000057048233,0.00001643981,0.00040287434,0.00013302929,0.00048367685,0.9898441,0.00700464,0.00023339032],"about_ca_topic_score_codex":0.000008191312,"about_ca_topic_score_gemma":0.0000046293467,"teacher_disagreement_score":0.041979995,"about_ca_system_score_codex":0.00006929204,"about_ca_system_score_gemma":0.00006098442,"threshold_uncertainty_score":0.71672755},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92097867,0.000034782886,0.073941745,0.00019458463,0.003610505,0.00058949704,0.000012265369,0.000127909,0.0005100298],"genre_scores_gemma":[0.9787903,0.0000023412852,0.0210036,0.000031277614,0.000018574658,0.000061609346,0.00000879156,0.000015745049,0.00006780716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861234,0.00006209318,0.00027902532,0.0003398058,0.00033180517,0.00037495422],"domain_scores_gemma":[0.9982998,0.00037565676,0.00014380818,0.00065528933,0.0004125977,0.000112891496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006133254,0.00013527834,0.0002084999,0.00020047105,0.0001866464,0.00007371392,0.0008617702,0.00007842474,0.000009754106],"category_scores_gemma":[0.0003486229,0.00013639031,0.00011081319,0.0005079419,0.00013925172,0.00053927774,0.00019475466,0.0002409399,0.000030370853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029656458,0.000056234676,0.004688216,0.000018853234,0.00001308894,0.0000014688384,0.00013006826,0.000020256675,0.05185383,0.94081855,0.00033446844,0.0020353254],"study_design_scores_gemma":[0.00096692203,0.00024859278,0.0051886477,0.000013649816,0.000004238918,0.0000031185814,0.000003215278,0.01637646,0.020976659,0.9531362,0.0029205387,0.00016177057],"about_ca_topic_score_codex":0.000010512489,"about_ca_topic_score_gemma":0.00002599112,"teacher_disagreement_score":0.057811573,"about_ca_system_score_codex":0.000012671858,"about_ca_system_score_gemma":0.000058812275,"threshold_uncertainty_score":0.5561836},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9807511,0.0011703641,0.000023633249,0.000008925581,0.0016093114,0.00010725745,0.000004204492,0.00020275064,0.016122473],"genre_scores_gemma":[0.9998289,0.000046161807,0.000036151872,0.00002364665,0.0000042134884,0.0000045824445,0.000002361029,0.000013965896,0.00004003107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993132,0.000026027243,0.00022806301,0.00010647839,0.00014108402,0.00018519332],"domain_scores_gemma":[0.99959433,0.00002473769,0.000029708697,0.00025956318,0.000029609795,0.00006205078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001312779,0.0001242012,0.00020025544,0.00009463704,0.00002682993,0.000009800644,0.00016844556,0.00007118201,0.000014199845],"category_scores_gemma":[0.000007207273,0.00012492694,0.000093514405,0.0002517238,0.000024251933,0.00006347729,0.0000068396776,0.00010379947,0.000024834955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009623813,0.00007315912,0.0011121302,0.000045764926,0.000043442975,0.000007380624,0.0002544333,0.00021142706,0.033503324,0.960273,0.0023942909,0.0020720165],"study_design_scores_gemma":[0.0008511936,0.00020157862,0.039161406,0.00007717419,0.000024941499,0.000006302168,0.000119076045,0.00041758912,0.020941895,0.9363481,0.0015699903,0.00028075709],"about_ca_topic_score_codex":0.0000069491653,"about_ca_topic_score_gemma":4.7585732e-7,"teacher_disagreement_score":0.038049277,"about_ca_system_score_codex":0.0000147714445,"about_ca_system_score_gemma":0.000005510543,"threshold_uncertainty_score":0.50943726},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9810464,0.000014185222,0.000013307944,0.001647745,0.00013926883,0.00021307156,0.0000046775513,0.000052410724,0.01686894],"genre_scores_gemma":[0.9994303,0.000006313568,0.00017319812,0.00025197788,0.0000028700802,0.000014333717,0.0000012656917,0.0000068037434,0.00011295498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934816,0.00007636497,0.00018697855,0.000121282894,0.00014218819,0.00012499833],"domain_scores_gemma":[0.99867254,0.0005819764,0.00010365149,0.00056610175,0.000041823874,0.00003392755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037350695,0.00009012477,0.0001338552,0.00003917457,0.000117952215,0.00000899438,0.00026489003,0.00004923907,0.000054540305],"category_scores_gemma":[0.00017793078,0.00006169556,0.00009609831,0.00029168077,0.000074426986,0.000027371741,0.000014973728,0.00013390325,0.000044485867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012023329,0.00026914268,0.00008089843,0.00000487321,0.000008040352,3.040503e-7,0.0001605225,1.5594811e-7,0.0011583085,0.9950767,0.0026949216,0.00053410773],"study_design_scores_gemma":[0.00018092971,0.000074175405,0.0031549532,0.00001547118,0.000015644922,6.163967e-7,0.000017912984,0.000007146839,0.011245734,0.9843762,0.0008454942,0.00006570257],"about_ca_topic_score_codex":0.0000027097215,"about_ca_topic_score_gemma":5.746385e-7,"teacher_disagreement_score":0.018383889,"about_ca_system_score_codex":0.000008560013,"about_ca_system_score_gemma":0.000009449889,"threshold_uncertainty_score":0.25158718},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9417277,0.00019997657,0.0067558307,0.031246131,0.0006763265,0.00043084324,0.000009573868,0.00014161204,0.018812],"genre_scores_gemma":[0.99655235,0.000019580315,0.0006411196,0.002300065,0.000009666137,0.00005367221,0.0000041436847,0.000003602813,0.0004157862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985149,0.0003259012,0.00020964835,0.00032192114,0.00035412412,0.00027350098],"domain_scores_gemma":[0.9982751,0.00058280013,0.000059767866,0.0010036224,0.000035073874,0.000043654094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001037769,0.00013284416,0.00018304762,0.00011142012,0.00018648352,0.00017287032,0.0018234238,0.000053453594,0.000035686982],"category_scores_gemma":[0.00025502956,0.00006028529,0.00009227621,0.0011693371,0.00009439453,0.00015771168,0.00019281484,0.00018314693,0.000066248685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028428415,0.00010839689,0.00030677987,0.0000012943054,0.000007353194,0.0000012473623,0.00031649374,0.0005231737,0.0000061599335,0.9900858,0.0061479486,0.002492557],"study_design_scores_gemma":[0.00031198445,0.00009750373,0.0018071643,0.000004063096,0.000005687725,8.5426296e-7,0.000030960182,0.1070656,0.00006051666,0.883341,0.0071699363,0.00010468929],"about_ca_topic_score_codex":0.00011220624,"about_ca_topic_score_gemma":0.000039990813,"teacher_disagreement_score":0.106744714,"about_ca_system_score_codex":0.00002420746,"about_ca_system_score_gemma":0.000019597263,"threshold_uncertainty_score":0.33884054},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4383648,0.000018102804,0.08775996,0.00020508535,0.0004462131,0.00022764145,0.000022501616,0.000054520595,0.4729012],"genre_scores_gemma":[0.9984873,3.5087075e-7,0.0009511605,0.00002562708,0.000013982787,0.000017499136,0.0000051514326,0.000009484644,0.0004894383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995759,0.000013384597,0.00012208385,0.00010796101,0.00007492265,0.00010570839],"domain_scores_gemma":[0.9994333,0.00017870986,0.000069027614,0.00024481295,0.000034957324,0.00003921662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006103787,0.00007136714,0.00012956704,0.000009196691,0.000050569524,0.000007039287,0.00010572679,0.000011229399,0.00021489956],"category_scores_gemma":[0.000014542132,0.00006296591,0.000043292064,0.00008424575,0.00005034784,0.00003034516,0.000021349117,0.000059779934,0.00009375641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043714736,0.0001004072,0.00022545834,0.0000054696307,0.000009632265,2.8985035e-8,0.000032390093,0.000029171724,0.00007642666,0.9968081,0.0003536695,0.0023548722],"study_design_scores_gemma":[0.00030683144,0.000027948665,0.00003367121,0.0000147851915,0.0000068854615,4.8591822e-8,0.000030018691,0.00018499912,0.002470214,0.9885514,0.008304801,0.00006840433],"about_ca_topic_score_codex":0.000009875541,"about_ca_topic_score_gemma":2.1185154e-7,"teacher_disagreement_score":0.5601225,"about_ca_system_score_codex":0.0000060135176,"about_ca_system_score_gemma":0.000006215273,"threshold_uncertainty_score":0.25676754},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97215974,0.000053739375,0.00007329372,0.0005734265,0.0010531693,0.00035357274,0.0000025477405,0.00017334218,0.025557159],"genre_scores_gemma":[0.9969998,0.000003655238,0.0007197243,0.0005046596,0.000010661567,0.00006357811,0.0000028408472,0.000024410945,0.0016706545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990282,0.000119551194,0.00020288795,0.00024319782,0.00013117847,0.0002749692],"domain_scores_gemma":[0.99819905,0.0010722778,0.00007456565,0.0005058451,0.00005870938,0.00008957512],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00018682964,0.00016615634,0.00023578298,0.00004084539,0.00012244559,0.000017496997,0.00020417532,0.00016765649,0.0014644186],"category_scores_gemma":[0.0007866279,0.00013810965,0.00007478725,0.0000935899,0.00015414905,0.0001051164,0.000046317844,0.00031726807,0.0009265235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001557061,0.00015104559,0.00030996234,0.000017505989,0.00002132701,0.000004706648,0.00022887948,0.0000010393643,0.00009045733,0.98856264,0.010068295,0.0005285714],"study_design_scores_gemma":[0.00062710413,0.00012879427,0.0008971881,0.000018731336,0.000010554097,0.0000065875647,0.00006554995,0.000011786546,0.0007453747,0.9962712,0.0010625492,0.00015460473],"about_ca_topic_score_codex":0.000008809051,"about_ca_topic_score_gemma":0.00000210107,"teacher_disagreement_score":0.024840064,"about_ca_system_score_codex":0.00004557802,"about_ca_system_score_gemma":0.00002066256,"threshold_uncertainty_score":0.99985135},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946826,0.00094244845,0.000013969917,0.0014914059,0.0016755533,0.00015659381,3.583511e-7,0.000115499715,0.0009215758],"genre_scores_gemma":[0.9987328,0.000017910246,0.00023094103,0.0009192526,4.6110335e-7,0.0000038785865,1.4116192e-7,0.000004868528,0.00008974164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988212,0.00007801314,0.00022803989,0.0002524732,0.00040370043,0.00021655633],"domain_scores_gemma":[0.99889404,0.00004601434,0.000114593924,0.00078288093,0.00010383609,0.0000586301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002734138,0.00012343087,0.0001607484,0.00019298881,0.00014395338,0.000048275197,0.0009319362,0.00005385474,0.0000015091024],"category_scores_gemma":[0.000118429285,0.00007561471,0.00011107185,0.0012536872,0.000065877204,0.00020085876,0.00011004038,0.00014515307,0.000019684152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037149402,0.00015477795,0.00011473659,0.000004958524,0.000007864171,9.1547633e-7,0.00012019652,0.00004126827,0.00438157,0.9926825,0.0009911172,0.001496375],"study_design_scores_gemma":[0.0003545332,0.00022234012,0.0018950478,0.0000556775,0.000005055456,0.000001892035,0.0000038790927,0.00056203443,0.04369289,0.9530519,0.000052955234,0.00010177133],"about_ca_topic_score_codex":0.000013037823,"about_ca_topic_score_gemma":2.2770607e-7,"teacher_disagreement_score":0.03963058,"about_ca_system_score_codex":0.0000151063505,"about_ca_system_score_gemma":0.0000452702,"threshold_uncertainty_score":0.30834785},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9867336,0.0004171022,0.00018139198,0.0012417658,0.0025884898,0.00013535073,3.876876e-7,0.00017712134,0.008524759],"genre_scores_gemma":[0.99768084,0.000011687788,0.0020085913,0.00013122048,0.0000013423609,0.0000031694653,7.380106e-7,0.000005535925,0.00015685346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987479,0.00006784995,0.00031146058,0.0002320752,0.0003567372,0.00028396578],"domain_scores_gemma":[0.998813,0.00019966539,0.00014760376,0.0006239647,0.00013102623,0.00008475393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004460107,0.00012288558,0.00016535814,0.000028152639,0.00025286071,0.00013004782,0.0006635015,0.000045835746,0.000004078451],"category_scores_gemma":[0.00020695972,0.00008931738,0.00007902602,0.00035795823,0.000056075285,0.00016057753,0.00012850494,0.00013125861,0.000042842326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022362233,0.00008209408,0.000545987,0.0000057139832,0.000010119448,0.000005017486,0.00028583614,0.000013557067,0.0005254675,0.98804766,0.001827063,0.008649278],"study_design_scores_gemma":[0.0004566485,0.000091384274,0.005572592,0.00006670502,0.0000069512007,0.000021411415,0.000019738709,0.008776662,0.0013006142,0.98336047,0.00019746798,0.00012933729],"about_ca_topic_score_codex":0.00002293818,"about_ca_topic_score_gemma":0.0000013523061,"teacher_disagreement_score":0.010947229,"about_ca_system_score_codex":0.000023703667,"about_ca_system_score_gemma":0.00004622209,"threshold_uncertainty_score":0.3642257},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.992769,0.00015152528,0.00032164733,0.000720767,0.0018313358,0.00013561673,9.82162e-7,0.00019457487,0.0038745736],"genre_scores_gemma":[0.99722517,0.0000129688915,0.0020680013,0.00057161006,0.000001248922,0.0000041661237,7.7014613e-7,0.000006971072,0.000109071094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986865,0.000048835667,0.00027877028,0.0003439095,0.00034674874,0.0002952618],"domain_scores_gemma":[0.99890697,0.00009087203,0.00012537865,0.00064139167,0.00012327186,0.00011214001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030918064,0.00014715068,0.00021188582,0.00018476359,0.000105452054,0.000073012794,0.0005439192,0.00007497832,0.000005445802],"category_scores_gemma":[0.000056030705,0.00013668637,0.00010086584,0.00074772374,0.00004635225,0.000264933,0.00007767849,0.00015873059,0.00011098321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012833547,0.00017027397,0.00045303165,0.0000047377102,0.000007998387,0.000007813326,0.00026384482,0.000121159996,0.0055874744,0.98895675,0.0015626088,0.0028515034],"study_design_scores_gemma":[0.00082384824,0.0006959337,0.0048780274,0.00006395959,0.000006944671,0.0000027931615,0.0000022370598,0.002672768,0.023409355,0.96639454,0.00086528505,0.00018430589],"about_ca_topic_score_codex":0.000020782361,"about_ca_topic_score_gemma":4.1904255e-7,"teacher_disagreement_score":0.022562178,"about_ca_system_score_codex":0.000018932134,"about_ca_system_score_gemma":0.000044691522,"threshold_uncertainty_score":0.5573908},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97785974,0.00040450817,0.011933681,0.00015342991,0.002631138,0.00010639907,0.0000013203037,0.000110331894,0.0067994683],"genre_scores_gemma":[0.99808645,0.0000038940893,0.0016501443,0.00014214472,0.000013172253,0.0000066985563,9.442886e-7,0.0000062872114,0.00009028965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990112,0.00007979363,0.00017411704,0.00018844889,0.0002546041,0.00029179384],"domain_scores_gemma":[0.9990454,0.00011760116,0.00009005853,0.0005835841,0.00005349596,0.00010988018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002924203,0.00011357787,0.00019476013,0.000045953337,0.00005590037,0.000014715521,0.00047620895,0.000050847375,0.000012277723],"category_scores_gemma":[0.0000627281,0.000095653406,0.00007620465,0.00025601833,0.00003937898,0.00038318415,0.00013889815,0.00011404312,0.00007405674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046147748,0.00015250419,0.0038692758,0.000007184474,0.000009526947,0.0000016978083,0.00021384691,0.000009719428,0.0004721399,0.9926634,0.0004395314,0.00215658],"study_design_scores_gemma":[0.00050535187,0.00022844065,0.020873867,0.000014148034,0.000006591491,0.0000046312393,0.00002253307,0.00018061184,0.0099226525,0.96667004,0.0013747379,0.00019641458],"about_ca_topic_score_codex":0.000009625953,"about_ca_topic_score_gemma":2.7751744e-7,"teacher_disagreement_score":0.025993358,"about_ca_system_score_codex":0.00003314602,"about_ca_system_score_gemma":0.000016374825,"threshold_uncertainty_score":0.39006326},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9963521,0.000060279417,0.0000629643,0.000072125455,0.0013428446,0.000077876655,0.000008174795,0.000045324574,0.001978325],"genre_scores_gemma":[0.9971692,0.0000044855265,0.0027047796,0.000022121529,0.0000050738163,0.000010439833,0.0000027699646,0.0000075151124,0.000073607975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933004,0.000041268064,0.00016571314,0.00014562767,0.00019995742,0.000117379044],"domain_scores_gemma":[0.9994155,0.00006495652,0.00008876348,0.00017346881,0.00015191118,0.00010536263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024312358,0.00006610043,0.00011093453,0.000067605986,0.000045937035,0.000026517178,0.000104978484,0.000037982798,0.00008124435],"category_scores_gemma":[0.000104071056,0.0000648436,0.00002214455,0.00018071024,0.00013703645,0.00020301146,0.00005421988,0.000045488763,0.000031232714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074753334,0.00032121505,0.04066804,0.000035046796,0.000022638469,0.000007323417,0.0024643366,0.00030512107,0.31271586,0.6341848,0.009035184,0.00016569704],"study_design_scores_gemma":[0.006849319,0.0011619035,0.08386788,0.00006609766,0.00011849044,0.00006196401,0.0059920033,0.0006221337,0.2050583,0.6772508,0.018100372,0.0008507048],"about_ca_topic_score_codex":0.00004720203,"about_ca_topic_score_gemma":0.0000012975826,"teacher_disagreement_score":0.10765756,"about_ca_system_score_codex":0.000016283198,"about_ca_system_score_gemma":0.000043577114,"threshold_uncertainty_score":0.26442456},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9894651,0.000051612347,0.00044115452,0.0005812747,0.00017643259,0.000414584,0.000016921218,0.000020680813,0.008832198],"genre_scores_gemma":[0.9988266,0.000003343945,0.0007685546,0.0000042049805,0.000012964858,0.000082505045,0.0000070258557,0.000010985715,0.00028381555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993532,0.000018362922,0.00025597017,0.000110923844,0.00010978126,0.00015177263],"domain_scores_gemma":[0.9989302,0.00019584596,0.00016128452,0.0005114861,0.00016630678,0.000034865774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008152182,0.000087152526,0.00016151703,0.000010078836,0.00009346905,0.000013909671,0.0003024402,0.00001758854,0.00011285782],"category_scores_gemma":[0.00004252873,0.000058599686,0.000050788254,0.0001660248,0.00013344256,0.00008669165,0.00010574838,0.0000727905,0.00002163128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002837611,0.000111341025,0.00047600866,0.000015850357,0.000027095875,1.5948682e-8,0.00007435665,0.0000023615455,0.0020145273,0.9944262,0.0009667314,0.0018826976],"study_design_scores_gemma":[0.00027427776,0.000030353778,0.0011351125,0.000011500588,0.00001280158,7.61711e-8,0.0002683869,0.00007425728,0.02152661,0.9759073,0.0006957727,0.000063511674],"about_ca_topic_score_codex":0.000045134737,"about_ca_topic_score_gemma":1.9668146e-7,"teacher_disagreement_score":0.019512083,"about_ca_system_score_codex":0.000005107824,"about_ca_system_score_gemma":0.000016184895,"threshold_uncertainty_score":0.23896258},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96719635,0.0005007038,0.000037252696,0.000009135991,0.00030276593,0.000037557656,0.0000070976944,0.000047854603,0.031861294],"genre_scores_gemma":[0.9985982,0.000008476979,0.00043431937,0.00003829862,0.000012426784,0.000020494155,0.000013325283,0.000032144755,0.000842282],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989117,0.000012854044,0.00022450912,0.00021229994,0.0002904283,0.00034823056],"domain_scores_gemma":[0.9991123,0.00004734169,0.00015049927,0.00049286144,0.000050536564,0.00014644777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008575125,0.00019040836,0.00021813768,0.00003379597,0.00006111281,0.000007659317,0.00024624387,0.00011805127,0.00063603383],"category_scores_gemma":[0.000040267932,0.00017666536,0.00007700479,0.00014295893,0.00015524508,0.00019077068,0.000059647464,0.00022437754,0.000015898862],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009778955,0.00068678206,0.15371181,0.0002715122,0.00015675761,0.000022628592,0.00032504462,0.0000074586214,0.80830747,0.034701977,0.0003822735,0.0013285066],"study_design_scores_gemma":[0.0013698644,0.00002854477,0.00059811614,0.00010300416,0.000049293616,0.00001203237,0.000110760586,0.000004858803,0.97463405,0.01295065,0.009813333,0.0003254791],"about_ca_topic_score_codex":0.0000045789657,"about_ca_topic_score_gemma":2.6516153e-7,"teacher_disagreement_score":0.16632661,"about_ca_system_score_codex":0.000057456502,"about_ca_system_score_gemma":0.000027003834,"threshold_uncertainty_score":0.7204204},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9871674,0.0000079478605,0.00011240002,0.0006865085,0.00082198426,0.00034784328,0.0000034000727,0.00007555643,0.010776961],"genre_scores_gemma":[0.99721295,0.0000023331518,0.0016885349,0.000023658553,0.000010429509,0.00004701306,0.0000020298157,0.000018907054,0.0009941511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915314,0.000044782526,0.0002683118,0.00012874235,0.0002678429,0.00013720895],"domain_scores_gemma":[0.9980958,0.0010358496,0.00015748505,0.00053392746,0.00014739331,0.000029528339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037675656,0.00009993682,0.00016712034,0.0000352182,0.00008628681,0.00002110351,0.00019846573,0.000040917563,0.0002995534],"category_scores_gemma":[0.0032416496,0.00006832834,0.000049782215,0.0001391296,0.00012256086,0.0001148539,0.000042094653,0.00020140255,0.00008077225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055147393,0.00015806558,0.00003763356,0.000059985246,0.000012393014,4.7057466e-7,0.00018169856,8.95041e-7,0.0038189283,0.9901936,0.0054796496,0.0000511405],"study_design_scores_gemma":[0.00018281321,0.000032997286,0.00011542358,0.000033081204,0.000014351935,0.0000014550801,0.000067535395,0.000052175576,0.038806897,0.9604018,0.00021801598,0.00007350807],"about_ca_topic_score_codex":0.0000034188474,"about_ca_topic_score_gemma":0.000009901882,"teacher_disagreement_score":0.034987967,"about_ca_system_score_codex":0.000012127979,"about_ca_system_score_gemma":0.000019925608,"threshold_uncertainty_score":0.38807914},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9691036,0.00024019145,0.02714672,0.00077379507,0.0015903977,0.00020965083,9.082587e-7,0.00021573735,0.000719002],"genre_scores_gemma":[0.98792565,0.000020438569,0.011342035,0.0001231576,0.000011342323,0.000024467145,0.0000022738254,0.0000065705544,0.00054406316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993172,0.00003244343,0.00012513134,0.00022827006,0.00010583612,0.00019111428],"domain_scores_gemma":[0.9994659,0.000050938095,0.000044110737,0.00028442565,0.000054616456,0.00010001937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000041281404,0.000098327015,0.00011187706,0.000045117387,0.00013301113,0.0001481084,0.00031747253,0.000046349436,0.00004968376],"category_scores_gemma":[0.00002680575,0.00008682285,0.000025221063,0.00019165814,0.000031728654,0.0005706345,0.00016344027,0.00007206067,0.00013425344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.2655338e-7,0.000017753615,0.0011026536,0.0000018642403,0.000004349691,0.0000014714269,0.00010326644,0.000013002319,0.0011522544,0.99489075,0.00091473944,0.0017974465],"study_design_scores_gemma":[0.00055442285,0.000042922093,0.0073363315,0.0000025671736,0.0000026239775,0.0000056609183,0.000008524858,0.0045879306,0.00049685227,0.9842249,0.0025826269,0.00015461788],"about_ca_topic_score_codex":0.00002782076,"about_ca_topic_score_gemma":6.4961546e-7,"teacher_disagreement_score":0.018822053,"about_ca_system_score_codex":0.000018071418,"about_ca_system_score_gemma":0.000021056858,"threshold_uncertainty_score":0.35405332},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98067063,0.00041023007,0.005524129,0.0010509623,0.0044607916,0.0004778483,0.0000026409796,0.00016904609,0.007233717],"genre_scores_gemma":[0.99617904,0.000019343888,0.0034130802,0.00009854354,0.000006530581,0.000030195035,7.7820164e-7,0.000016830563,0.0002356831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813193,0.00014210424,0.00026877734,0.00037800576,0.00058090826,0.0004982987],"domain_scores_gemma":[0.9975827,0.0003537429,0.0001180512,0.0015571847,0.0002386585,0.00014971211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008140249,0.00016881872,0.00020252477,0.00013203797,0.00022574974,0.00007729349,0.0023017915,0.000088668414,0.00006312159],"category_scores_gemma":[0.00015945677,0.00012057703,0.00012531038,0.0008991937,0.00031884556,0.00048553268,0.0005787761,0.000545797,0.00009227149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013681298,0.00012401589,0.003321756,0.000010513085,0.00002378463,0.00000535582,0.00032085087,0.000009809166,0.013646173,0.9751419,0.00053509243,0.0068470654],"study_design_scores_gemma":[0.0005107895,0.000101036545,0.0047842623,0.000010178904,0.0000069051553,0.0000106304915,0.000027586677,0.003706217,0.03593279,0.95058924,0.004154725,0.00016564367],"about_ca_topic_score_codex":0.00004203386,"about_ca_topic_score_gemma":0.000019042676,"teacher_disagreement_score":0.02455267,"about_ca_system_score_codex":0.000020149646,"about_ca_system_score_gemma":0.00008256413,"threshold_uncertainty_score":0.49169886},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9850447,0.0000679515,0.00012531121,0.0004472328,0.0004360619,0.00020649812,0.0000030344936,0.00007796714,0.013591236],"genre_scores_gemma":[0.99906415,0.000026295116,0.0005634652,0.000025772515,0.000009089795,0.000026836728,0.0000024421524,0.000017968803,0.0002639638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990952,0.0001331263,0.00026599583,0.00014232124,0.00015163684,0.00021171237],"domain_scores_gemma":[0.9982422,0.00085203635,0.00014673454,0.0006458033,0.000054591226,0.00005864267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053944066,0.000112591,0.00017185898,0.00004609166,0.00023589049,0.00001928463,0.00039685096,0.000058333433,0.000023767425],"category_scores_gemma":[0.0001304044,0.0000808401,0.00011236064,0.0003198,0.00017992304,0.00003880315,0.00004125695,0.0001390043,0.000026771606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010294433,0.00010310867,0.00027637932,0.000010999317,0.000030977906,2.6324565e-7,0.000099276935,1.3408105e-7,0.0006387705,0.9963641,0.0017972214,0.0006684335],"study_design_scores_gemma":[0.00043914476,0.000051544168,0.00073019107,0.00001078564,0.000031050222,0.000002702518,0.00004374352,0.0000469932,0.006398789,0.9853681,0.0067827078,0.00009427766],"about_ca_topic_score_codex":0.0000064740757,"about_ca_topic_score_gemma":0.0000052477735,"teacher_disagreement_score":0.0140194595,"about_ca_system_score_codex":0.000010663759,"about_ca_system_score_gemma":0.000012938958,"threshold_uncertainty_score":0.3296564},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98964447,0.00064039626,0.000049498674,0.00002059871,0.00036522787,0.00009569578,0.0000021527915,0.00011694139,0.009065024],"genre_scores_gemma":[0.99983907,0.000030241825,0.00006507627,0.000010856576,0.000004777938,0.0000034411396,0.0000016651971,0.000013426339,0.000031473006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994743,0.000022263563,0.00014836034,0.00010132973,0.00010220705,0.00015153573],"domain_scores_gemma":[0.9997034,0.000029813193,0.000031128267,0.0001639118,0.000021360149,0.000050408573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013073006,0.000112075635,0.00018391116,0.000059588445,0.00003514913,0.000015909942,0.00007896556,0.00004963764,0.000007955759],"category_scores_gemma":[0.0000055302744,0.00009700885,0.000025148236,0.00014779858,0.000029637338,0.00009317398,0.000007111087,0.000079129066,0.000002517402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041902695,0.000049290207,0.0033600405,0.000103727165,0.000079608464,0.0000155788,0.00090004224,0.00021912702,0.0077620354,0.981666,0.00039729042,0.0054053166],"study_design_scores_gemma":[0.0020962243,0.0004876757,0.014153442,0.00021810518,0.00005022213,0.00004072571,0.0005180538,0.0008891155,0.025479065,0.9538325,0.0018052192,0.00042964894],"about_ca_topic_score_codex":0.0000037865489,"about_ca_topic_score_gemma":0.0000014025878,"teacher_disagreement_score":0.027833538,"about_ca_system_score_codex":0.000010474961,"about_ca_system_score_gemma":0.000004968676,"threshold_uncertainty_score":0.39559063},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9926432,0.0000535541,0.0020889074,0.00002127991,0.00050107896,0.00017137048,0.0000022659337,0.00007345892,0.004444897],"genre_scores_gemma":[0.9965611,0.000013548152,0.0033190409,0.000022559529,0.0000011178423,0.000013183229,6.602132e-7,0.000009051614,0.000059701124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860096,0.0001443291,0.00023323025,0.00038172095,0.0003400841,0.00029970074],"domain_scores_gemma":[0.99865943,0.00014314002,0.00008654058,0.00080796843,0.00015849683,0.00014439278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006045816,0.00012458183,0.00019825749,0.00008331591,0.00007897509,0.000023725192,0.00077390496,0.00006723239,0.00007454641],"category_scores_gemma":[0.00009732903,0.000117479176,0.000059166632,0.00045840236,0.00022965005,0.0004292374,0.00055672356,0.00018250497,0.000024748855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016939122,0.00010074056,0.09890998,0.000015067422,0.000014021095,0.0000049433365,0.00077246485,1.7840345e-7,0.00018164565,0.8972025,0.00005930962,0.002722233],"study_design_scores_gemma":[0.00044630395,0.0000779159,0.046879504,0.0000049576156,0.0000027944495,0.000010447873,0.000038619684,0.0001385118,0.006972306,0.9452314,0.000080284546,0.00011697905],"about_ca_topic_score_codex":0.00007408902,"about_ca_topic_score_gemma":0.000005114847,"teacher_disagreement_score":0.052030478,"about_ca_system_score_codex":0.00002056369,"about_ca_system_score_gemma":0.00004092277,"threshold_uncertainty_score":0.4790662},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98906463,0.000043616954,0.00072632416,0.0014539646,0.00057293585,0.00016155887,9.2552415e-7,0.000024641007,0.007951375],"genre_scores_gemma":[0.99934685,0.0000013507091,0.00028153253,0.00023321182,0.0000012597435,0.0000017974853,6.152207e-8,0.0000045139373,0.0001294001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885595,0.00015695365,0.0001705242,0.0001706931,0.00043762446,0.00020827133],"domain_scores_gemma":[0.9983475,0.00040208292,0.00012332479,0.0009980127,0.000095378746,0.000033655353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051776966,0.000084251784,0.00011994558,0.000040873056,0.0002024145,0.00005215254,0.0015262458,0.000033283355,0.000012329186],"category_scores_gemma":[0.00022481909,0.00004710381,0.00009024554,0.0006608845,0.0003090847,0.00014567703,0.00017945522,0.00019379596,0.0000073942247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009962673,0.0000680708,0.0003534278,0.0000018277319,0.0000059047297,9.1718687e-7,0.00070621015,0.000029602053,0.0019117561,0.9954103,0.00037891022,0.0011230658],"study_design_scores_gemma":[0.00021245731,0.00012781224,0.00726616,0.000031025025,0.0000012742528,0.0000015451159,0.000036179965,0.00020133708,0.032054033,0.9598779,0.00013658269,0.000053698102],"about_ca_topic_score_codex":0.0000055450973,"about_ca_topic_score_gemma":4.8891854e-7,"teacher_disagreement_score":0.035532452,"about_ca_system_score_codex":0.000023405084,"about_ca_system_score_gemma":0.000069264825,"threshold_uncertainty_score":0.283617},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99144095,0.00002526016,0.0007577809,0.00052927504,0.00078065536,0.00024542754,0.000006595687,0.000077110766,0.006136938],"genre_scores_gemma":[0.9965551,0.000002455402,0.0027951747,0.00009193095,0.0000035017654,0.000030487401,0.0000016910504,0.00002008243,0.0004995597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813896,0.00013855634,0.00020404092,0.00040469115,0.000666234,0.0004475143],"domain_scores_gemma":[0.9979439,0.00028958562,0.00013804519,0.0012645927,0.00022550565,0.0001383671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007703235,0.00018660187,0.00021415592,0.00009517199,0.00018951991,0.00009078073,0.0018658732,0.000097041535,0.00017014134],"category_scores_gemma":[0.00004201319,0.00012527782,0.00008118914,0.00074507843,0.00034506255,0.00045394353,0.00044536818,0.00073643314,0.00007543487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002705961,0.0002302833,0.023107905,0.000012116733,0.00003296423,0.00002335937,0.00036414913,7.906332e-7,0.0017463473,0.9728474,0.00034517786,0.0012624422],"study_design_scores_gemma":[0.0009581228,0.00022853375,0.020770574,0.000008703969,0.000005460127,0.00007717692,0.000077551274,0.00018909664,0.009703384,0.96582717,0.0019447634,0.00020945286],"about_ca_topic_score_codex":0.000018370138,"about_ca_topic_score_gemma":0.0002326417,"teacher_disagreement_score":0.007957037,"about_ca_system_score_codex":0.000015400725,"about_ca_system_score_gemma":0.000102209415,"threshold_uncertainty_score":0.5108681},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9312138,0.0000111351565,0.06603605,0.00039755108,0.00025034777,0.00030217512,0.000016341754,0.0001082869,0.0016643186],"genre_scores_gemma":[0.9970147,0.0000061286464,0.002629755,0.00006129116,0.000006107156,0.00012611419,0.000028906275,0.000007640281,0.000119355456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994388,0.000027477732,0.00018418803,0.00012245393,0.00011336729,0.00011368153],"domain_scores_gemma":[0.9994398,0.00020526923,0.000067877685,0.00012301825,0.00008545152,0.00007858567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006568287,0.00007215371,0.000094825045,0.000025740277,0.00015698303,0.00007883016,0.000045850276,0.00004432931,0.0004980461],"category_scores_gemma":[0.0001561494,0.00007104598,0.000020712549,0.00007048315,0.000049681104,0.00019752806,0.000022313157,0.0000641208,0.0002666597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013836888,0.00006405155,0.00023151429,0.000012759147,0.0000047061153,5.647964e-7,0.00002429733,1.2469197e-7,0.0005127949,0.98939127,0.0075020245,0.0022545094],"study_design_scores_gemma":[0.00026954326,0.000020285503,0.01903612,0.000010008978,0.000017154991,0.000008294947,0.00003588014,0.004097619,0.0012139851,0.974904,0.00030113416,0.000085982945],"about_ca_topic_score_codex":0.00002226354,"about_ca_topic_score_gemma":8.3746977e-7,"teacher_disagreement_score":0.06580091,"about_ca_system_score_codex":0.0000364728,"about_ca_system_score_gemma":0.000009103972,"threshold_uncertainty_score":0.5453255},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99685836,0.0002023645,0.00040469985,0.000041832838,0.00068724295,0.00023900658,0.0000060174007,0.00009397245,0.0014665122],"genre_scores_gemma":[0.99969745,0.000011508693,0.00022662614,0.000022782593,0.0000034317666,0.0000070804035,0.0000042081097,0.000018021288,0.00000887009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991373,0.000077544595,0.0002937263,0.00012746087,0.0001971468,0.00016683273],"domain_scores_gemma":[0.9993237,0.00005162194,0.00009836666,0.00038608487,0.00009646067,0.000043717282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016465738,0.00015823886,0.00026426898,0.00010150343,0.000070816175,0.000008952199,0.00024500064,0.000068668494,0.0000076049937],"category_scores_gemma":[0.000008308647,0.000116535026,0.00010264387,0.00060596614,0.000105988634,0.00008075407,0.000015054198,0.0001412433,0.0000024392607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010520559,0.00030034874,0.0101240445,0.00027242428,0.00027611322,0.000006491152,0.002872243,0.011125399,0.074419096,0.8986503,0.0006852568,0.0011631157],"study_design_scores_gemma":[0.0025161905,0.0005884294,0.06983964,0.00038399044,0.000103489634,0.000023039878,0.00035527788,0.0019789012,0.047979157,0.8754831,0.00027861228,0.00047017308],"about_ca_topic_score_codex":0.00006599126,"about_ca_topic_score_gemma":0.000016464031,"teacher_disagreement_score":0.0597156,"about_ca_system_score_codex":0.000016688804,"about_ca_system_score_gemma":0.000011560541,"threshold_uncertainty_score":0.47521603},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9100449,0.0020408928,0.0012720557,0.000020751073,0.03959352,0.0022980587,0.000013602518,0.0008862706,0.043829933],"genre_scores_gemma":[0.99881935,0.000013045084,0.00001931664,0.0000032127175,0.000025881893,0.00037834616,0.0000035129967,0.000031597778,0.0007057123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992554,0.00006307192,0.00025353956,0.00011765228,0.00007776506,0.00023252665],"domain_scores_gemma":[0.99952435,0.000093767805,0.000048196314,0.0002390645,0.00004546435,0.000049133527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054962223,0.000120196826,0.00015791366,0.000046240308,0.00017515589,0.000052147163,0.00018629349,0.0000768421,0.0000055745136],"category_scores_gemma":[0.000022075412,0.00009110913,0.00009641737,0.0001407099,0.000024307836,0.000102924205,0.000011675802,0.0000921116,0.0000303397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007667753,0.000032555956,0.00010253408,0.00011372226,0.000092211456,9.82005e-7,0.0011360123,0.000057844532,0.0006710467,0.9892091,0.0075139576,0.0009933538],"study_design_scores_gemma":[0.004075304,0.00067724264,0.00033062365,0.0001927807,0.000086967564,0.000033004853,0.0037737219,0.012366958,0.013098319,0.8426178,0.12209717,0.0006501004],"about_ca_topic_score_codex":0.00003429636,"about_ca_topic_score_gemma":0.000009063336,"teacher_disagreement_score":0.1465913,"about_ca_system_score_codex":0.000053008804,"about_ca_system_score_gemma":0.000007913063,"threshold_uncertainty_score":0.37153223},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9531327,0.000023245597,0.0010707094,0.0018068051,0.0005246861,0.0002452408,0.000031431166,0.000049146212,0.043116063],"genre_scores_gemma":[0.99821967,0.0000024828046,0.00047962795,0.00013704163,0.000028746012,0.00010626635,0.000012729045,0.000012999765,0.001000436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994135,0.00001908775,0.00013150481,0.00015159819,0.00011368877,0.00017065718],"domain_scores_gemma":[0.99920136,0.00031654284,0.000071427625,0.00031903584,0.00003220563,0.000059428297],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010526263,0.00011018992,0.00011182642,0.000009288298,0.00023131196,0.00005065634,0.00025042528,0.0000266185,0.0010536794],"category_scores_gemma":[0.0000159699,0.00006973937,0.000056622208,0.00013574169,0.00009716554,0.000053761665,0.000036336416,0.00020912632,0.00017711578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018810523,0.00007611387,0.00006264671,0.0000015142052,0.000012289907,1.1675164e-7,0.000028881199,0.0000018399602,0.003185638,0.9870333,0.009107014,0.0004887809],"study_design_scores_gemma":[0.00016223041,0.000011568167,0.0000077419045,0.0000036177319,0.000007922762,2.2904125e-7,0.00005955384,0.000069736096,0.00903255,0.9668739,0.023676079,0.000094862466],"about_ca_topic_score_codex":0.000028721712,"about_ca_topic_score_gemma":4.3301714e-7,"teacher_disagreement_score":0.045087,"about_ca_system_score_codex":0.0000053248123,"about_ca_system_score_gemma":0.000014360931,"threshold_uncertainty_score":0.9998595},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.941535,0.000012890448,0.000013739876,0.000105572064,0.0001606878,0.00018788298,0.0000026377477,0.000040665844,0.057940915],"genre_scores_gemma":[0.99948394,0.000005790353,0.00026555493,0.000053853542,0.000001560898,0.00003405985,5.031004e-7,0.000011268975,0.00014348912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945134,0.00006112565,0.00016530514,0.000102308506,0.00010761474,0.00011228019],"domain_scores_gemma":[0.9988388,0.0005348414,0.0000979004,0.00046940826,0.000029630683,0.00002945792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028615847,0.000079228266,0.00011512549,0.000050274524,0.00008259081,0.000004181495,0.00026606576,0.000037259146,0.0002366708],"category_scores_gemma":[0.00013521174,0.000052909138,0.0000870145,0.00028838834,0.00008814329,0.000023326418,0.000020787547,0.00010759313,0.000051281426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010727384,0.0002787652,0.00017762532,0.000006366606,0.00002136136,5.240046e-7,0.000493486,1.38839304e-8,0.00028799803,0.9964223,0.002231177,0.00006964828],"study_design_scores_gemma":[0.00018691662,0.000066818146,0.001323991,0.000010038868,0.000020595728,9.560146e-7,0.000079704885,0.0000016323913,0.017040558,0.98108953,0.00012034816,0.000058881607],"about_ca_topic_score_codex":0.0000064634996,"about_ca_topic_score_gemma":8.4809e-7,"teacher_disagreement_score":0.057948913,"about_ca_system_score_codex":0.0000053533067,"about_ca_system_score_gemma":0.00000765031,"threshold_uncertainty_score":0.25913793},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99102855,0.00008914178,0.000013310777,0.000021186657,0.0012499607,0.00014263214,0.0000029507596,0.000110209236,0.0073420824],"genre_scores_gemma":[0.9998532,0.000007965944,0.000017887258,0.00002651126,0.000007807356,0.000016449476,6.7469523e-7,0.00002401887,0.000045508816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940467,0.000044542638,0.00015717096,0.00011199193,0.00011803282,0.00016357865],"domain_scores_gemma":[0.99924594,0.00030187273,0.000033637436,0.00034102754,0.000023655906,0.0000538684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003250934,0.000116434865,0.00014420308,0.00003484028,0.000071491486,0.000021499469,0.00019605365,0.000074736556,0.00010341469],"category_scores_gemma":[0.00006589611,0.00008697298,0.000039152477,0.00009595222,0.000086383305,0.0000514007,0.000022702985,0.00021479663,0.00005566705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005082284,0.00002356847,0.0006735906,0.00003095767,0.000020680809,0.0000022454833,0.0003276498,0.000024508814,0.017100107,0.9796393,0.0018152102,0.00033708665],"study_design_scores_gemma":[0.00036086512,0.00007225655,0.003451194,0.000030896652,0.000012551449,0.000006940276,0.00015416725,0.00067428267,0.025616884,0.9675744,0.0018715686,0.00017398884],"about_ca_topic_score_codex":0.000011131196,"about_ca_topic_score_gemma":0.0000057172438,"teacher_disagreement_score":0.012064908,"about_ca_system_score_codex":0.0000057348925,"about_ca_system_score_gemma":0.000006608711,"threshold_uncertainty_score":0.35466552},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9956528,0.0015917693,0.00004389078,0.00004940028,0.000598898,0.00010105927,0.0000015831448,0.00006449476,0.001896124],"genre_scores_gemma":[0.9998379,0.00003067992,0.00007026511,0.000012716618,0.0000054634734,0.000019013318,0.0000016013126,0.000014190667,0.000008191541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957997,0.000039645744,0.00010653151,0.00005744984,0.000073522344,0.00014286186],"domain_scores_gemma":[0.9996394,0.000075574026,0.000022241644,0.00018480328,0.000020906135,0.0000570912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017860561,0.000079810925,0.00010945098,0.000044117063,0.000079792044,0.000011706447,0.00008899785,0.000034180695,0.000007020422],"category_scores_gemma":[0.0000044479452,0.00005845441,0.00002687869,0.00016260365,0.0000831468,0.00011298816,0.000015844114,0.000080728234,0.0000066253992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008614064,0.000044212255,0.01440778,0.000067221314,0.00008899072,6.1716196e-7,0.0030578393,0.000017144604,0.0016290213,0.9790671,0.00029840597,0.0013130405],"study_design_scores_gemma":[0.0010813063,0.00016287388,0.10268876,0.00017331362,0.00010763959,0.000059608203,0.0016545731,0.00011908293,0.031394836,0.85946006,0.002718533,0.0003794272],"about_ca_topic_score_codex":0.000013286384,"about_ca_topic_score_gemma":0.0000042700963,"teacher_disagreement_score":0.11960707,"about_ca_system_score_codex":0.0000069531247,"about_ca_system_score_gemma":0.0000030777894,"threshold_uncertainty_score":0.23837017},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96271497,0.000026141739,0.014107474,0.0021064414,0.01687392,0.00038489196,0.0000055838314,0.00077464746,0.0030059398],"genre_scores_gemma":[0.9818676,5.6527523e-7,0.01724628,0.0004990989,0.000033006338,0.000027656124,0.000004173532,0.000017762639,0.00030382752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796647,0.000103733044,0.00029360145,0.0006719494,0.00047621207,0.0004880539],"domain_scores_gemma":[0.99791634,0.00027480157,0.00008766731,0.001152233,0.00027448466,0.00029445562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051203824,0.00023921645,0.00027232617,0.00018853656,0.00026281443,0.00029082078,0.0014098437,0.00016703445,0.000073676936],"category_scores_gemma":[0.0006956925,0.00023311755,0.000111913134,0.0010794126,0.00007416766,0.00029219154,0.0006290622,0.0005220561,0.00031672433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009038421,0.0005795045,0.0128643075,0.000011197045,0.000081472994,0.000039182465,0.00089121907,0.00018983577,0.0063095777,0.9159876,0.012573983,0.050463043],"study_design_scores_gemma":[0.000916997,0.00032488193,0.13882136,0.000008801054,0.000018928578,0.000042746397,0.000027670958,0.016099822,0.0015239494,0.83161783,0.009972277,0.00062474055],"about_ca_topic_score_codex":0.000086314496,"about_ca_topic_score_gemma":0.00006184227,"teacher_disagreement_score":0.12595706,"about_ca_system_score_codex":0.00010461714,"about_ca_system_score_gemma":0.00011080087,"threshold_uncertainty_score":0.9506258},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950329,0.000031432122,0.00006964962,0.000019472887,0.0032654214,0.00024902218,0.0000035889245,0.00013899089,0.0011895434],"genre_scores_gemma":[0.9994976,0.0000011183658,0.00034963657,0.000015183178,0.000031414915,0.000045631416,0.000004914262,0.00003007613,0.000024430474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992459,0.000025462701,0.00018124894,0.00014950338,0.000098901255,0.00029899043],"domain_scores_gemma":[0.99956757,0.00012325154,0.000013025727,0.00020243993,0.000029594148,0.000064121596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003628393,0.000118830074,0.00016303714,0.00010671598,0.000047108086,0.000035994985,0.00017955746,0.00010967923,0.000017560773],"category_scores_gemma":[0.000007617441,0.00012692114,0.0000575968,0.00016049788,0.000024933997,0.00007526008,0.000027085502,0.00026651518,0.000027961129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004548149,0.00013241413,0.024893846,0.000277966,0.000066495806,0.00002964358,0.0020336497,0.0012030643,0.018517125,0.9433303,0.0029970298,0.0064729657],"study_design_scores_gemma":[0.013735743,0.0007361672,0.053434003,0.00036805528,0.00004713639,0.00011083656,0.0004204646,0.3585565,0.06933227,0.47878343,0.02242881,0.0020465814],"about_ca_topic_score_codex":0.000008990465,"about_ca_topic_score_gemma":0.000017301216,"teacher_disagreement_score":0.4645469,"about_ca_system_score_codex":0.000016946673,"about_ca_system_score_gemma":0.000010401023,"threshold_uncertainty_score":0.51756936},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942954,0.00017031048,0.000027696668,0.0018217734,0.00052487786,0.00056044525,0.000022617052,0.000069256836,0.0025075835],"genre_scores_gemma":[0.99784875,0.000026934764,0.0013042968,0.0006422838,0.000026290412,0.000014405257,0.000031098414,0.00002543749,0.00008050328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979771,0.00047239137,0.0004589224,0.0003304364,0.00042846947,0.00033272285],"domain_scores_gemma":[0.99844676,0.00051607634,0.00013806323,0.0005910341,0.00019799697,0.00011008943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066804216,0.0002768257,0.00047657252,0.00017887086,0.00012920632,0.00008999846,0.0006068247,0.0001997791,0.000133797],"category_scores_gemma":[0.00009486952,0.0002056967,0.00007396958,0.00084286695,0.0000954855,0.00013982352,0.000063952895,0.00035740391,0.000081312995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016709304,0.0006946986,0.0032017727,0.000022443975,0.00005913683,0.0000565229,0.0042777187,0.000005117522,0.0074156546,0.9804381,0.0034358387,0.00022591374],"study_design_scores_gemma":[0.0020865991,0.0007296744,0.005414826,0.00026543887,0.00008875569,0.000010910106,0.0019897583,0.00046308213,0.017525816,0.9691544,0.0018121388,0.00045859415],"about_ca_topic_score_codex":0.00014812636,"about_ca_topic_score_gemma":0.000052485488,"teacher_disagreement_score":0.011283682,"about_ca_system_score_codex":0.00006351202,"about_ca_system_score_gemma":0.000081528386,"threshold_uncertainty_score":0.8388068},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9205348,0.0000137687975,0.006051656,0.00006973817,0.00040148225,0.00019099998,0.000024605997,0.000024461177,0.07268848],"genre_scores_gemma":[0.9986524,3.6138715e-7,0.00089894666,0.000021256325,0.000030881292,0.000031969856,0.000009419646,0.000011227242,0.00034351836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999489,0.000008570173,0.00013938617,0.00008320217,0.00010192965,0.00017790658],"domain_scores_gemma":[0.9994479,0.00017296818,0.0000702426,0.00020859762,0.000025413514,0.00007491743],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006908685,0.00008376467,0.00013327284,0.000010766972,0.00005815164,0.0000060694492,0.000108016065,0.000013288857,0.0011828514],"category_scores_gemma":[0.0000072453,0.00006376551,0.00005477572,0.00008880879,0.00005016065,0.000076721946,0.00003987757,0.00007332504,0.0001325814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011056704,0.00022666492,0.0047360305,0.000004759033,0.000018495384,5.376108e-8,0.00005290894,0.000002514477,0.0001289186,0.99337316,0.00043221915,0.0010132049],"study_design_scores_gemma":[0.0004674994,0.000029182018,0.00028962924,0.000010686874,0.000011878103,2.2419543e-7,0.00007371478,0.000018026261,0.0032263,0.99457747,0.0012160769,0.00007933207],"about_ca_topic_score_codex":0.000014188544,"about_ca_topic_score_gemma":4.4107082e-7,"teacher_disagreement_score":0.07811762,"about_ca_system_score_codex":0.000009482158,"about_ca_system_score_gemma":0.000011167071,"threshold_uncertainty_score":0.9997302},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6550208,0.000053455242,0.32331726,0.009410276,0.004192896,0.00019107158,7.052146e-7,0.00021137706,0.0076021804],"genre_scores_gemma":[0.9973375,0.00000194317,0.0009868083,0.0013540833,0.000017292943,0.000010671121,0.00000337844,0.0000038287762,0.00028444463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925685,0.000094338124,0.00011006971,0.00018982597,0.00022791517,0.000120984325],"domain_scores_gemma":[0.9990596,0.00039334077,0.00004502115,0.00036958346,0.00008750709,0.000044937235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003518302,0.00007632489,0.00006472941,0.00006382569,0.00018645414,0.00006445918,0.00038973102,0.000025313828,0.00001676627],"category_scores_gemma":[0.0001832266,0.00005334315,0.000039210026,0.00050622696,0.000020009571,0.00010871512,0.000076376586,0.00009141006,0.00013410414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021483959,0.00004282872,0.00003393189,8.293448e-7,0.0000047808335,4.584816e-7,0.000059205235,0.00054517586,0.000092364346,0.98929274,0.0055117086,0.0044138287],"study_design_scores_gemma":[0.00027425025,0.00016942181,0.0008570384,0.000005658444,0.0000020764273,0.0000020075527,0.0000024975466,0.056842033,0.0022003467,0.9215893,0.017968055,0.00008731699],"about_ca_topic_score_codex":0.00001636698,"about_ca_topic_score_gemma":0.0000047221633,"teacher_disagreement_score":0.34231678,"about_ca_system_score_codex":0.000016315049,"about_ca_system_score_gemma":0.000032981046,"threshold_uncertainty_score":0.21752705},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8151628,0.00011293403,0.18174309,0.00005116662,0.0015356472,0.000082354985,0.0000044081744,0.00008284948,0.0012247748],"genre_scores_gemma":[0.99806845,0.0000035843016,0.0018365156,0.000046077887,0.000011963078,0.000010472852,0.000005683309,0.000006177789,0.000011091146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992828,0.000055590404,0.00014176141,0.00017614738,0.00017268106,0.00017104261],"domain_scores_gemma":[0.9990502,0.00025471067,0.00009909675,0.00045622067,0.00007309038,0.00006665437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020350299,0.00010309053,0.00012456303,0.000086217624,0.00011662363,0.000040113475,0.0002459223,0.000068496964,0.0001345097],"category_scores_gemma":[0.000024773617,0.00008982738,0.000062307365,0.00034754977,0.000087881104,0.00044969562,0.000067267705,0.00011557736,0.0000162939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029642688,0.000096386655,0.05831793,0.0000032483927,0.000052093597,2.4827406e-7,0.0007215576,0.0000043532614,0.00045077136,0.93874264,0.00011671353,0.0014644156],"study_design_scores_gemma":[0.0005351167,0.0002516753,0.15433481,0.000030090141,0.00004721864,0.000003344961,0.00006613583,0.0008631732,0.0015666367,0.8416554,0.0004844931,0.00016194358],"about_ca_topic_score_codex":0.00004235179,"about_ca_topic_score_gemma":0.000010696091,"teacher_disagreement_score":0.18290566,"about_ca_system_score_codex":0.000012331744,"about_ca_system_score_gemma":0.000024110166,"threshold_uncertainty_score":0.3663054},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84744924,0.0026378264,0.00874629,0.006179146,0.037057757,0.00066880416,0.000008310347,0.0021807547,0.09507187],"genre_scores_gemma":[0.9938588,0.000011913317,0.004287681,0.00061257934,0.000005849921,0.0000042905485,0.0000026099228,0.000011820729,0.0012044169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855685,0.00012158534,0.00023218512,0.0003121909,0.00032139735,0.0004558011],"domain_scores_gemma":[0.998471,0.00021763695,0.00008913326,0.0008529836,0.000056186014,0.0003130549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009253398,0.00015701352,0.00014365389,0.0001370257,0.00014765843,0.000084569256,0.0006370623,0.000078872654,0.000012089156],"category_scores_gemma":[0.000120021905,0.0001327573,0.000079450045,0.0005263821,0.000030802446,0.00035093777,0.0001542185,0.00017412246,0.0004702078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001840147,0.00010057204,0.0003183225,0.0000017738141,0.0000111482,0.0000021194971,0.00040445052,0.0000058095134,0.00014744226,0.9652606,0.029671378,0.00405796],"study_design_scores_gemma":[0.0009778576,0.00013288342,0.0012865913,0.000021775479,0.000005347961,0.000004467087,0.000009156528,0.00006222397,0.0029285152,0.9888217,0.005567801,0.00018170418],"about_ca_topic_score_codex":0.00003553945,"about_ca_topic_score_gemma":5.570015e-7,"teacher_disagreement_score":0.14640959,"about_ca_system_score_codex":0.000017528886,"about_ca_system_score_gemma":0.000042194057,"threshold_uncertainty_score":0.6043727},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9913787,0.00037403748,0.00006388088,0.0039450703,0.0025243748,0.00027757575,0.0000035024032,0.00022320311,0.0012096597],"genre_scores_gemma":[0.99685305,0.000026795844,0.0018860188,0.00059839233,0.0000029422351,0.000024408138,0.0000032164917,0.000014974099,0.00059020077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845016,0.00007713824,0.00033808674,0.00040430488,0.0003835042,0.00034679982],"domain_scores_gemma":[0.99853265,0.00013441054,0.00010571627,0.00084627775,0.00020103731,0.0001798923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025146085,0.00018072843,0.00024435963,0.00017084957,0.00012804237,0.00009129436,0.0007600986,0.00008666821,0.000061121515],"category_scores_gemma":[0.00008600172,0.0001311434,0.00010141944,0.00046872185,0.000087702516,0.00051250414,0.00026353134,0.00020023197,0.0005779064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017397912,0.00023410251,0.00040237006,0.000010139056,0.000013660991,0.0000021764463,0.00024878848,0.00001687906,0.004335243,0.9779361,0.015693957,0.0011048699],"study_design_scores_gemma":[0.0006498314,0.00021227193,0.0010402695,0.00007043208,0.0000066688467,0.0000023272319,0.000026211037,0.0021815114,0.004352042,0.99065435,0.00060965255,0.00019445583],"about_ca_topic_score_codex":0.000109690416,"about_ca_topic_score_gemma":6.9294555e-7,"teacher_disagreement_score":0.015084304,"about_ca_system_score_codex":0.00001906333,"about_ca_system_score_gemma":0.000048282847,"threshold_uncertainty_score":0.742801},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939282,0.000096007825,0.000018054092,0.00018978142,0.000055585846,0.00033496745,0.0000020731402,0.000030768482,0.0053445953],"genre_scores_gemma":[0.99929917,0.00004064628,0.00043081594,0.000015941834,0.0000013659569,0.00011039796,0.0000015789573,0.000009109747,0.000090963615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946934,0.000049271282,0.00014245047,0.00010345179,0.00012376749,0.00011170497],"domain_scores_gemma":[0.9986885,0.00081303547,0.00013877531,0.00022025526,0.00010314785,0.000036247606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017956826,0.0000770502,0.000106251304,0.00006917774,0.00017251182,0.000029339115,0.00013468521,0.00003285709,0.000013768197],"category_scores_gemma":[0.000077477576,0.00004770351,0.000027345433,0.00040763666,0.0001878976,0.00009156252,0.000028333674,0.000084111285,0.000012065354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044488866,0.00007604063,0.0022400124,0.000017411632,0.000030146393,1.3330694e-7,0.00017691542,5.5987197e-8,0.00018736557,0.9965909,0.00012226001,0.0005543272],"study_design_scores_gemma":[0.00024466903,0.00007629051,0.018914709,0.000025405261,0.000026179945,0.000002205258,0.00040270254,0.000011055841,0.0016762518,0.9784241,0.00013360874,0.000062821855],"about_ca_topic_score_codex":0.000021542079,"about_ca_topic_score_gemma":0.000004244305,"teacher_disagreement_score":0.018166782,"about_ca_system_score_codex":0.000005943738,"about_ca_system_score_gemma":0.000010552151,"threshold_uncertainty_score":0.19452927},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9264652,0.0000018918657,0.003208231,0.00082308037,0.0019443673,0.0008463704,0.000007942926,0.00021914746,0.06648374],"genre_scores_gemma":[0.87806684,6.7093845e-7,0.118079506,0.00019672015,0.00004003659,0.00024509832,0.000014633472,0.00003913914,0.0033173733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906665,0.000024835437,0.00032118344,0.00018413404,0.00019508135,0.00020813527],"domain_scores_gemma":[0.998734,0.00054970034,0.00011685309,0.00032984972,0.00017899332,0.00009063584],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043673196,0.00014247058,0.00021870132,0.00003061328,0.000109201836,0.000060568203,0.00018040088,0.00011019805,0.0011672114],"category_scores_gemma":[0.0012275912,0.00011621471,0.00010730193,0.000107608714,0.000045643512,0.00014009212,0.000028827997,0.0002050675,0.0003413848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011894779,0.00021325867,0.000052328167,0.00006474395,0.000012873749,3.3080858e-7,0.00020186778,2.3527921e-8,0.0017363714,0.9802694,0.01700133,0.000435587],"study_design_scores_gemma":[0.0010537651,0.000037770962,0.000023618444,0.000013895748,0.000021466427,0.000005996792,0.000057136625,0.002755047,0.008202463,0.9793013,0.0083804475,0.00014713332],"about_ca_topic_score_codex":0.0000039898923,"about_ca_topic_score_gemma":0.000011754102,"teacher_disagreement_score":0.11487127,"about_ca_system_score_codex":0.000021029273,"about_ca_system_score_gemma":0.000029518536,"threshold_uncertainty_score":0.99974585},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99748904,0.00016456975,0.0005237346,0.0002652868,0.001025979,0.00010057294,6.689681e-7,0.0000939774,0.00033615218],"genre_scores_gemma":[0.99876314,0.00001393109,0.0010821355,0.00007079038,3.303273e-7,0.000006804792,0.0000017965416,0.0000057376656,0.000055341236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916834,0.000036088826,0.00020267964,0.00023095791,0.00019819966,0.00016372991],"domain_scores_gemma":[0.9992303,0.00010572003,0.000096460884,0.00029530335,0.00017601877,0.000096197204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011187619,0.00010497714,0.00014709085,0.0001121779,0.00008886446,0.00006194765,0.0002608615,0.00006602914,0.000031092794],"category_scores_gemma":[0.000029126997,0.00008966632,0.00004076545,0.00037540396,0.00006828649,0.0004312004,0.0001163331,0.00010145309,0.000020934069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013690199,0.00007111936,0.017492482,0.000007860607,0.000017419261,7.578909e-7,0.00017477386,0.000004280162,0.002309018,0.9780151,0.0011648462,0.0007409645],"study_design_scores_gemma":[0.00034900292,0.000089021974,0.031862363,0.000014446459,0.000004102065,0.0000041470084,0.000020156838,0.0038607672,0.0018316745,0.96175987,0.00008842844,0.000116042545],"about_ca_topic_score_codex":0.0002080356,"about_ca_topic_score_gemma":7.128795e-7,"teacher_disagreement_score":0.016255261,"about_ca_system_score_codex":0.000006267343,"about_ca_system_score_gemma":0.00002354445,"threshold_uncertainty_score":0.36564863},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80892396,0.00000635123,0.0019704953,0.000027129747,0.0014922665,0.00022800395,0.0000032247822,0.00010238652,0.18724617],"genre_scores_gemma":[0.9838974,0.0000014558619,0.015563749,0.0000150291935,0.000007535908,0.000012796218,0.0000024147744,0.00001373245,0.0004859256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918234,0.00003792529,0.00034301478,0.00010574984,0.00021362712,0.000117310796],"domain_scores_gemma":[0.9992909,0.00012940555,0.0001477998,0.00025452784,0.00012562789,0.000051738993],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024264978,0.00009536587,0.00020000755,0.000047335976,0.00003283905,0.000009717523,0.00014653991,0.00007620554,0.0012091852],"category_scores_gemma":[0.00047022046,0.00007651241,0.00007208098,0.0001208549,0.000051271272,0.000112534646,0.00002731291,0.000083088926,0.0000643258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014950895,0.00026101514,0.000126012,0.000054367785,0.00001474321,3.9196837e-7,0.0013943424,2.036642e-9,0.00030293368,0.99477845,0.0028858064,0.00016698528],"study_design_scores_gemma":[0.0003659684,0.00009324078,0.00015393762,0.000022353453,0.000015585316,0.0000011320157,0.0000765595,0.00008202273,0.022573167,0.9760988,0.00043537983,0.00008189799],"about_ca_topic_score_codex":0.000017556691,"about_ca_topic_score_gemma":0.0000022942318,"teacher_disagreement_score":0.18676025,"about_ca_system_score_codex":0.00001985834,"about_ca_system_score_gemma":0.00002341435,"threshold_uncertainty_score":0.9997038},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6599725,0.0005080861,0.2357295,0.013895545,0.076343186,0.0028064451,0.00006610179,0.0013680418,0.009310615],"genre_scores_gemma":[0.994941,0.0000032429991,0.0028953308,0.0016091156,0.000039676706,0.00010545911,0.0000044704107,0.000015316045,0.00038642035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985166,0.00005794492,0.0003215118,0.0004385591,0.00022371233,0.00044163907],"domain_scores_gemma":[0.9986592,0.00019635902,0.000051565272,0.0005503541,0.00019887357,0.0003436292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029490938,0.00016311307,0.00021491315,0.00019704468,0.00026539338,0.00013042091,0.00068762875,0.0000894938,0.000040086234],"category_scores_gemma":[0.00009557586,0.00015966079,0.0001761569,0.0004607178,0.00005076826,0.0003796895,0.0001262098,0.00011431522,0.00007772178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006587398,0.0001403918,0.00010292248,0.000006671707,0.00001636022,0.0000046270497,0.0011828534,0.000006144604,0.00008252464,0.9369432,0.06139758,0.00011016075],"study_design_scores_gemma":[0.00047448633,0.0005109495,0.0005976256,0.000026144451,0.000010392672,0.000014850312,0.00010383505,0.0023696274,0.0007278665,0.9872313,0.0076901345,0.00024277718],"about_ca_topic_score_codex":0.000117696545,"about_ca_topic_score_gemma":0.00001635299,"teacher_disagreement_score":0.3349685,"about_ca_system_score_codex":0.00003830283,"about_ca_system_score_gemma":0.00006901928,"threshold_uncertainty_score":0.6510778},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98815817,0.000051683077,0.00707509,0.00031025123,0.00051891804,0.00017924471,5.312701e-7,0.00016059894,0.003545509],"genre_scores_gemma":[0.9983317,0.0000048895918,0.0014640958,0.000049810056,0.0000025770228,0.000017931134,0.0000012353311,0.0000151288195,0.00011260738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847555,0.00018328044,0.00015164123,0.00040825695,0.0003524449,0.000428851],"domain_scores_gemma":[0.9986925,0.00031985567,0.00005411123,0.00072843465,0.00007498241,0.00013012002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044425981,0.000163551,0.00020238402,0.00027405078,0.00009243557,0.00007787323,0.0011014768,0.000054612898,0.000007724161],"category_scores_gemma":[0.00009526828,0.00012710848,0.00004189497,0.0010124611,0.0001256502,0.00049613084,0.00022131299,0.00024964934,0.000030336925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008267662,0.000060625738,0.06321524,0.000005857332,0.0000068410777,0.0000069303424,0.00024962626,0.000024360123,0.00008781892,0.93319124,0.000114209404,0.003028987],"study_design_scores_gemma":[0.0006942732,0.00024573694,0.059376553,0.000022311413,0.0000013292085,0.0000019546305,0.000030759507,0.00068422663,0.002609009,0.93499947,0.0011414657,0.00019289013],"about_ca_topic_score_codex":0.00001970431,"about_ca_topic_score_gemma":0.00001976506,"teacher_disagreement_score":0.010173551,"about_ca_system_score_codex":0.00004104377,"about_ca_system_score_gemma":0.000036877074,"threshold_uncertainty_score":0.5183334},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9839078,0.00005887329,0.000023332446,0.000011495325,0.004056922,0.00010342376,0.000004209086,0.00015547013,0.011678433],"genre_scores_gemma":[0.99965245,0.000002356397,0.0000746775,0.0000059121553,0.000017767416,0.000017972541,0.000003039777,0.000022951088,0.00020285901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993712,0.000026840054,0.00020177994,0.000098234916,0.00011604081,0.00018593301],"domain_scores_gemma":[0.9995259,0.000060238723,0.00003194571,0.0002738708,0.000050048344,0.000058002457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019209064,0.00010555565,0.00016499216,0.00006568439,0.000043456443,0.000015395128,0.00015089157,0.00009876344,0.00021265815],"category_scores_gemma":[0.00004049995,0.000103967985,0.000047381112,0.00026290657,0.000041405434,0.0000792152,0.000017907367,0.00020042172,0.000073604046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008983739,0.000049405175,0.007405858,0.00007483698,0.000036937912,0.0000029974149,0.00038076384,0.00040513222,0.061433535,0.92798156,0.0018941961,0.00032580568],"study_design_scores_gemma":[0.0022001474,0.00018706366,0.009309233,0.00008424057,0.000050506234,0.000010323878,0.00032441466,0.008688973,0.3320196,0.5999326,0.04645798,0.000734873],"about_ca_topic_score_codex":0.000021241258,"about_ca_topic_score_gemma":0.000013019322,"teacher_disagreement_score":0.3280489,"about_ca_system_score_codex":0.000005653478,"about_ca_system_score_gemma":0.0000113021,"threshold_uncertainty_score":0.42396915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9460133,0.00010054588,0.00022038286,0.0012600827,0.00027950245,0.00038885494,0.000002544799,0.00012395698,0.05161088],"genre_scores_gemma":[0.99542576,0.000049106813,0.0035141276,0.00022420235,0.000009614306,0.000090430854,0.0000031778545,0.00002545327,0.00065813115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915886,0.00004667501,0.0002727695,0.00016524628,0.00016271647,0.00019374368],"domain_scores_gemma":[0.9989897,0.00035746378,0.000084394,0.00046858468,0.000039314,0.000060528855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004270602,0.00011361885,0.00022840509,0.000053555486,0.00004862969,0.000018562941,0.0002276381,0.0000540629,0.00009860834],"category_scores_gemma":[0.00034769156,0.00010533939,0.00004667047,0.00020946813,0.000027816948,0.000044855202,0.000053184485,0.00011972414,0.00013513461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.038013e-7,0.00018280854,0.00045641116,0.00014148647,0.0000047735557,4.5768243e-7,0.00011821391,2.5013387e-7,0.00013672413,0.9646818,0.034062076,0.00021437608],"study_design_scores_gemma":[0.00035401594,0.000017877112,0.00055171736,0.00013970159,0.000011364272,0.0000027921362,0.00001752977,0.0007318427,0.00030461757,0.9891075,0.008631225,0.00012981796],"about_ca_topic_score_codex":0.000016664497,"about_ca_topic_score_gemma":0.0000137214865,"teacher_disagreement_score":0.05095275,"about_ca_system_score_codex":0.000020943495,"about_ca_system_score_gemma":0.000015422103,"threshold_uncertainty_score":0.42956156},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99641544,0.000010171159,0.000017536633,0.00096927944,0.00038301598,0.00038138955,0.000021946678,0.00004890718,0.0017523039],"genre_scores_gemma":[0.99900717,0.000014988883,0.000060372902,0.000060893184,0.000008608494,0.00009113661,0.000021232421,0.0000242295,0.0007113442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991868,0.0000814211,0.00019760757,0.00014929584,0.00019816613,0.00018668322],"domain_scores_gemma":[0.9984721,0.00044077274,0.00021982862,0.0006940856,0.00012593437,0.00004728228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005246574,0.00012750394,0.00013235323,0.000029121904,0.00066774624,0.00003565623,0.00038780188,0.00007339065,0.0000360493],"category_scores_gemma":[0.00008058434,0.000069625785,0.000053656164,0.00036127114,0.00026986486,0.00006894236,0.000062436484,0.00022810843,0.000021831005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021883858,0.00008994666,0.002627928,0.000009484801,0.000029026138,3.9003888e-7,0.00034748495,1.1396897e-7,0.049395207,0.94680506,0.00052290026,0.00015056109],"study_design_scores_gemma":[0.00035689786,0.000046341185,0.011826412,0.000010964173,0.00004748289,0.0000066726093,0.00008953942,0.000018487335,0.022750432,0.95289963,0.011830596,0.000116540854],"about_ca_topic_score_codex":0.000007654746,"about_ca_topic_score_gemma":0.00014344932,"teacher_disagreement_score":0.026644776,"about_ca_system_score_codex":0.0000087915905,"about_ca_system_score_gemma":0.000026766475,"threshold_uncertainty_score":0.5135832},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9508347,0.000680931,0.000011096896,0.0019848847,0.010717498,0.00015237594,0.000015664054,0.00013442434,0.035468455],"genre_scores_gemma":[0.9895576,0.000013614238,0.00008673388,0.0011113017,0.00020740896,0.0000036619142,0.0000050504614,0.00001899104,0.008995595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997059,0.00024348435,0.00051875244,0.00042293628,0.0012366957,0.00051911455],"domain_scores_gemma":[0.9959178,0.0023246566,0.00016572996,0.0010482334,0.00009645823,0.00044713763],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0031340132,0.00018581728,0.0002866555,0.0001799602,0.00019650561,0.00013058627,0.0008789517,0.0001406521,0.00016942296],"category_scores_gemma":[0.005255494,0.00013984813,0.00013650894,0.00046432327,0.00009712557,0.00067692035,0.00015829738,0.00024400417,0.0075884135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001252689,0.00014308526,0.0014410645,8.606148e-7,0.000008259305,0.0000045285633,0.0005971474,0.000006991349,0.000092703536,0.86969227,0.116756886,0.011130955],"study_design_scores_gemma":[0.0010515313,0.000102077705,0.011068839,0.000009853419,0.0000054830143,0.000004151175,0.00010988804,0.000015904887,0.0010309644,0.9100698,0.07634962,0.00018187703],"about_ca_topic_score_codex":0.000021092836,"about_ca_topic_score_gemma":0.0000011126981,"teacher_disagreement_score":0.040407263,"about_ca_system_score_codex":0.00005343708,"about_ca_system_score_gemma":0.00008090289,"threshold_uncertainty_score":0.99318427},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8452869,0.00021615287,0.1466518,0.0015944839,0.003594339,0.0011352623,0.000021210606,0.00028312003,0.0012167478],"genre_scores_gemma":[0.9887604,0.0000032673308,0.010140746,0.0005406865,0.000022137603,0.00026237234,0.000008561314,0.000018753683,0.00024306517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815935,0.000090423906,0.0002009673,0.0003635847,0.00040755785,0.00077814417],"domain_scores_gemma":[0.9984044,0.00029052026,0.000057961734,0.0006540768,0.00019450812,0.00039857643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008219086,0.0001582942,0.00017469496,0.00021898678,0.00026727302,0.00010235352,0.00083140255,0.0000630581,0.000020553722],"category_scores_gemma":[0.00021352626,0.00015869967,0.000101899626,0.00076740375,0.00005578211,0.0007489582,0.0002818885,0.00013293233,0.00009280303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000244396,0.00020822466,0.0005557012,0.000010213045,0.000012351982,0.0000013566374,0.0008478918,0.000029809753,0.00204913,0.9897003,0.0057702833,0.00079028966],"study_design_scores_gemma":[0.0012091232,0.0005386014,0.0018575368,0.00001636748,0.0000075535786,0.000011625126,0.00016236604,0.0009724828,0.012885901,0.95360583,0.028349966,0.0003826546],"about_ca_topic_score_codex":0.000006300187,"about_ca_topic_score_gemma":0.0000022571955,"teacher_disagreement_score":0.14347352,"about_ca_system_score_codex":0.000106438034,"about_ca_system_score_gemma":0.00004756873,"threshold_uncertainty_score":0.64715844},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.994799,0.00031996524,0.00018817325,0.0004638297,0.0020053454,0.000089180554,0.0000013305591,0.00004812261,0.0020850298],"genre_scores_gemma":[0.99820507,0.000021111944,0.0016105906,0.00009562755,7.564031e-7,0.0000030043386,3.8939652e-7,0.000004241781,0.000059214664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920654,0.000056024146,0.0002172889,0.00011705421,0.00022807509,0.00017502542],"domain_scores_gemma":[0.9989282,0.00023723509,0.00013604984,0.00053052057,0.00009102585,0.00007700604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029710087,0.000085412204,0.0001389185,0.00010668193,0.00008433338,0.000012489118,0.00041224188,0.00003983609,0.000012084879],"category_scores_gemma":[0.00008282222,0.000058672456,0.000077789824,0.000535962,0.00015111704,0.00014607176,0.00009190047,0.00009582645,0.000014411115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019523484,0.000078815836,0.00392201,0.0000044147555,0.000016473767,1.0067085e-7,0.00056377833,0.00000748331,0.0008076412,0.98987716,0.003884919,0.0008352414],"study_design_scores_gemma":[0.00025353572,0.00007411708,0.00247719,0.00002347347,0.0000075686085,0.0000031901843,0.0000885155,0.00007995194,0.013374438,0.9833056,0.00024762997,0.00006484186],"about_ca_topic_score_codex":0.000085984655,"about_ca_topic_score_gemma":9.26487e-7,"teacher_disagreement_score":0.0125667965,"about_ca_system_score_codex":0.0000049619944,"about_ca_system_score_gemma":0.000042947908,"threshold_uncertainty_score":0.23925933},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9824225,0.000025158872,0.0028208965,0.0008356525,0.0006071183,0.00033150514,0.0000011876566,0.00007905239,0.012876944],"genre_scores_gemma":[0.99847525,0.0000058884034,0.0007248059,0.00023195596,0.0000024795513,0.000057183905,3.720238e-7,0.000010484346,0.00049159303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866366,0.00015829514,0.0001761706,0.0002632308,0.0004211839,0.00031746793],"domain_scores_gemma":[0.99798733,0.00066165335,0.00007668229,0.0010253311,0.00016794092,0.00008104396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038245748,0.00011877004,0.00013794994,0.00006475105,0.0001561818,0.000106171734,0.0014267229,0.0000452509,0.00027642463],"category_scores_gemma":[0.00014928008,0.00008060159,0.000088445646,0.00065125665,0.00019299908,0.0003586879,0.00030647704,0.0002294599,0.0007520309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000424369,0.00007356131,0.00084674184,0.000004221888,0.000012147797,0.0000027879335,0.0002067748,0.000011485354,0.00059384527,0.99486387,0.0025897024,0.0007906415],"study_design_scores_gemma":[0.00027488038,0.00006362385,0.0023604543,0.0000126012,8.0839584e-7,0.000003935781,0.0000135730825,0.0007247695,0.0047631417,0.9914838,0.00020540539,0.000092999915],"about_ca_topic_score_codex":0.00003188215,"about_ca_topic_score_gemma":5.2921996e-7,"teacher_disagreement_score":0.01605275,"about_ca_system_score_codex":0.000018832678,"about_ca_system_score_gemma":0.000029174524,"threshold_uncertainty_score":0.96660864},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6617837,0.0058879717,9.5109084e-7,0.007267052,0.00638186,0.0004446328,0.00006698109,0.00053318276,0.31763366],"genre_scores_gemma":[0.994596,0.000078400764,0.0000099545305,0.0009309925,0.00027479487,0.000019955083,0.000015306081,0.000015688047,0.0040589324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899656,0.00002771387,0.00021746337,0.0002206155,0.00018493354,0.00035274038],"domain_scores_gemma":[0.9994204,0.000033001776,0.00007172806,0.00027806452,0.00007984208,0.00011698429],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00008785872,0.00016629772,0.00021225619,0.000048046746,0.00050574756,0.00013893755,0.00014908827,0.000043332624,0.0011724506],"category_scores_gemma":[0.00002015951,0.00015202397,0.00010880292,0.00004657519,0.00011592736,0.00025873794,0.00003244052,0.00012597941,0.0009791217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010169753,0.00012407279,0.00025634046,0.0000065721447,0.000025011936,0.000012233235,0.008278923,9.188798e-7,0.0000030278968,0.9011223,0.089379795,0.00078063336],"study_design_scores_gemma":[0.00051604275,0.000187973,0.0018967288,0.000029970503,0.000028903438,0.0000010947077,0.005048421,0.0000045893285,0.000011914517,0.55949974,0.43256176,0.00021284686],"about_ca_topic_score_codex":0.000060656283,"about_ca_topic_score_gemma":0.00005584161,"teacher_disagreement_score":0.34318197,"about_ca_system_score_codex":0.000025059338,"about_ca_system_score_gemma":0.000022840648,"threshold_uncertainty_score":0.9997987},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99534106,0.00019680473,0.000050480794,0.000010122269,0.0011585235,0.00023805974,0.00007698946,0.00024140527,0.0026865588],"genre_scores_gemma":[0.9997706,0.0000106657635,0.00008879774,0.000006324626,0.0000020633017,0.000037987735,0.000039253737,0.00002291102,0.00002140549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990881,0.00006880778,0.00036526078,0.00011274415,0.00013969805,0.0002253534],"domain_scores_gemma":[0.9993316,0.00007350148,0.00007698999,0.00030488893,0.00013704563,0.000075997035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119537544,0.00013240948,0.0002876241,0.00014428436,0.000049074104,0.000008218825,0.00014853112,0.00006634694,0.00016347691],"category_scores_gemma":[0.000013004634,0.00013455881,0.000103815066,0.00049671275,0.000054905366,0.000119019314,0.000026261938,0.00009464361,0.00005777609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009052474,0.00021354039,0.01047452,0.00019662386,0.00019651478,0.0000018210307,0.00071958493,0.00013641469,0.09231806,0.89178145,0.003891445,0.000060989212],"study_design_scores_gemma":[0.0042594373,0.00034944358,0.12470306,0.00048705062,0.0001381249,0.00001531656,0.0006127069,0.020982867,0.08495822,0.7567572,0.005829156,0.0009074059],"about_ca_topic_score_codex":0.000038418468,"about_ca_topic_score_gemma":0.000004627127,"teacher_disagreement_score":0.13502422,"about_ca_system_score_codex":0.000011967844,"about_ca_system_score_gemma":0.000005533673,"threshold_uncertainty_score":0.5487149},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97773653,0.00056519936,0.00086216815,0.00022066601,0.0004869113,0.00018950451,0.000015476182,0.000060507064,0.019863049],"genre_scores_gemma":[0.99796593,0.000009148315,0.00090503733,0.00004325266,0.000063357424,0.000030904408,0.000006848251,0.000013129411,0.00096241554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948484,0.000014509629,0.0001375093,0.00012949442,0.00008303612,0.00015061369],"domain_scores_gemma":[0.99955535,0.00006731876,0.000054556105,0.00016578237,0.000037586047,0.00011939594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010104267,0.00008992107,0.0001388982,0.000015781063,0.000102443984,0.00005804357,0.00009185353,0.000019069992,0.000048243593],"category_scores_gemma":[0.000014655688,0.00008545975,0.000029221077,0.00005913096,0.00007361699,0.00021599006,0.00008972871,0.00006573963,0.000059421916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018174861,0.000030554616,0.0010179009,0.000004724005,0.000014300623,2.376108e-7,0.00026659566,0.0000017041248,0.00012878308,0.9968712,0.0013153773,0.0003468551],"study_design_scores_gemma":[0.00033320725,0.000012824111,0.00007077128,0.000007482899,0.000011087437,5.48449e-7,0.0009410986,0.000029955449,0.0007764212,0.99576855,0.0019443778,0.000103683065],"about_ca_topic_score_codex":0.0000338757,"about_ca_topic_score_gemma":2.3339102e-7,"teacher_disagreement_score":0.020229388,"about_ca_system_score_codex":0.000013988265,"about_ca_system_score_gemma":0.00002167806,"threshold_uncertainty_score":0.34849477},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99517155,0.00015514191,0.0010561465,0.00048809807,0.0008625028,0.00059131254,0.000006475998,0.00002452751,0.0016442349],"genre_scores_gemma":[0.9950571,0.0000017791298,0.00037455035,0.00007196634,0.00005170763,0.00012555729,0.0000030479423,0.000022358012,0.004291944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888015,0.00019214801,0.00023552972,0.000110617584,0.000298694,0.00028284203],"domain_scores_gemma":[0.9984147,0.00076390913,0.00012803673,0.0005107398,0.00013182282,0.000050824434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014301037,0.00009073387,0.00013795408,0.000017907374,0.00035843087,0.00001477711,0.00021983805,0.00005997214,0.0001451075],"category_scores_gemma":[0.0007287878,0.00005182559,0.00013004338,0.00016671109,0.00015586868,0.00008303103,0.0001548111,0.00012208469,0.00003238233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003481102,0.0001149036,0.0033401672,0.000042684667,0.00006199823,6.5802276e-8,0.0003545828,0.000004634544,0.0017297053,0.97290426,0.021130297,0.0002818793],"study_design_scores_gemma":[0.0004539365,0.00004634762,0.00039000702,0.000024361456,0.00009215732,0.000004351042,0.00025350758,0.00051754597,0.011991789,0.9819089,0.004242088,0.000074996104],"about_ca_topic_score_codex":0.000005639341,"about_ca_topic_score_gemma":0.000008934818,"teacher_disagreement_score":0.016888209,"about_ca_system_score_codex":0.00008755498,"about_ca_system_score_gemma":0.000038852435,"threshold_uncertainty_score":0.27567968},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930558,0.0009864687,0.000059561997,0.000110661094,0.00086017116,0.00016674337,0.000005039581,0.000086147156,0.004669362],"genre_scores_gemma":[0.9929301,0.000037974132,0.0046741534,0.000020748612,0.000021255206,0.000012446149,9.500558e-7,0.00003176484,0.0022705842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989483,0.000037582635,0.00032903164,0.00015070035,0.00035109094,0.0001833003],"domain_scores_gemma":[0.9987924,0.00046235032,0.00014993941,0.00029561625,0.00017456381,0.00012514641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004096262,0.00012697976,0.00032420986,0.00007162538,0.000033006534,0.000032489344,0.00015574177,0.00006392842,0.000025727131],"category_scores_gemma":[0.0021119553,0.00011903303,0.000045701567,0.00008861653,0.00014996246,0.0003798244,0.00016328014,0.00008366371,0.000040388786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000739553,0.00009666463,0.0003486374,0.00011858357,0.000024339412,0.0000033343122,0.00043695825,2.9978497e-7,0.0005870225,0.9893683,0.00898216,0.000026298674],"study_design_scores_gemma":[0.0006772315,0.000058588877,0.00012234016,0.00005585024,0.000034627585,0.000005600615,0.00031814183,0.000024670127,0.007425152,0.99085724,0.0002960264,0.00012453311],"about_ca_topic_score_codex":0.000016960701,"about_ca_topic_score_gemma":0.0000031597358,"teacher_disagreement_score":0.008686134,"about_ca_system_score_codex":0.000045976518,"about_ca_system_score_gemma":0.00004101627,"threshold_uncertainty_score":0.48540258},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98112655,0.000023350023,0.00227892,0.00014647286,0.0007733332,0.0002800362,7.787735e-7,0.00018655104,0.015184013],"genre_scores_gemma":[0.99699074,0.000005401347,0.002801636,0.00007510209,0.0000013677674,0.000035611673,0.0000016327889,0.000011414428,0.00007707586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856496,0.0001949568,0.00020188306,0.00038932826,0.0002995821,0.00034930228],"domain_scores_gemma":[0.99884963,0.00025756334,0.00006033304,0.00065010635,0.00009071471,0.00009163195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054951996,0.00012920593,0.00014396531,0.0004452735,0.00007393806,0.00003428542,0.0008935984,0.00007104781,0.000029745746],"category_scores_gemma":[0.000287742,0.00012839727,0.000047544774,0.0012114651,0.00007507843,0.0004359651,0.00013874174,0.00024471668,0.000080402926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046222493,0.00015844412,0.0008312469,0.000003251898,0.0000049847877,0.000048513597,0.0006751105,0.0000031828808,0.0004536056,0.9945667,0.00008400167,0.0031247414],"study_design_scores_gemma":[0.0010531899,0.0002331193,0.026431771,0.000018569752,8.392148e-7,0.0000029788014,0.000019598489,0.0007875204,0.004608787,0.96668017,0.000022746091,0.00014072732],"about_ca_topic_score_codex":0.000025235657,"about_ca_topic_score_gemma":0.000010570921,"teacher_disagreement_score":0.027886542,"about_ca_system_score_codex":0.00005924779,"about_ca_system_score_gemma":0.00003815463,"threshold_uncertainty_score":0.52358884},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9538107,0.00000946126,0.042532235,0.000012729814,0.0005027222,0.00014562563,0.0000046443524,0.000051530486,0.0029303567],"genre_scores_gemma":[0.9986041,7.185253e-7,0.0010189146,0.0000059436798,0.00000841917,0.00001147356,0.0000052224077,0.000015963307,0.00032922768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918836,0.00005301506,0.00024899107,0.00012918671,0.00024035487,0.00014008721],"domain_scores_gemma":[0.99919623,0.0002628808,0.0001454655,0.00024439898,0.00010457979,0.000046466124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013201703,0.00009880069,0.0002317128,0.000053093147,0.00006245944,0.00001965055,0.00012924185,0.00004397857,0.00003282376],"category_scores_gemma":[0.00016966985,0.000075342956,0.000045563287,0.00012741034,0.00007972202,0.000069962545,0.000034801047,0.00005579468,0.000011871827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018998147,0.00013528208,0.0011270747,0.000058337402,0.000016711167,3.9218054e-7,0.000099069206,0.000040171464,0.00023523193,0.9977942,0.0001471398,0.0003273833],"study_design_scores_gemma":[0.0010281173,0.00021914911,0.0006324028,0.00006106147,0.0000277909,0.0000015916467,0.000075945485,0.00241989,0.0008633802,0.9943216,0.00022236355,0.00012673071],"about_ca_topic_score_codex":0.000031955522,"about_ca_topic_score_gemma":0.000010819717,"teacher_disagreement_score":0.04479342,"about_ca_system_score_codex":0.00002157515,"about_ca_system_score_gemma":0.00001364236,"threshold_uncertainty_score":0.30723965},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.996069,0.00032281262,0.00039076104,0.0003413702,0.0012687658,0.00035951156,8.205331e-7,0.00019704751,0.0010498848],"genre_scores_gemma":[0.9948337,0.000014977176,0.004855423,0.00016528263,5.4631664e-7,0.000048903305,0.0000023745627,0.000017592287,0.000061188344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783283,0.00015363778,0.000575212,0.00051869,0.00042914867,0.00049048656],"domain_scores_gemma":[0.9983626,0.00021401022,0.00021896786,0.0008006934,0.00023895783,0.0001647459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005559742,0.00023743408,0.0003786076,0.0005346928,0.000106455234,0.00010905471,0.00093851204,0.0001335278,0.000035609977],"category_scores_gemma":[0.000092638555,0.00022517309,0.00014438418,0.0016283637,0.000109978835,0.0006192352,0.00025075604,0.0002052009,0.000078886005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042049114,0.00020219541,0.004239073,0.000021757895,0.000018050961,0.000008084388,0.00052603777,0.00008232249,0.019499518,0.9730071,0.0011349471,0.0012567348],"study_design_scores_gemma":[0.0011217213,0.00017993915,0.0028898972,0.00007053589,0.0000058897867,0.0000034194925,0.00005024622,0.008554222,0.007513068,0.97931623,0.000029301646,0.00026553817],"about_ca_topic_score_codex":0.00045565938,"about_ca_topic_score_gemma":0.000007303236,"teacher_disagreement_score":0.011986449,"about_ca_system_score_codex":0.000022962411,"about_ca_system_score_gemma":0.000052535637,"threshold_uncertainty_score":0.9182292},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99443763,0.00067200646,0.000050425715,0.000003399934,0.0017746123,0.0001006276,0.00003688337,0.00007828497,0.002846133],"genre_scores_gemma":[0.9998902,0.000013157733,0.00003718163,0.00000535566,0.00000492207,0.000007979166,0.000017019032,0.000017819535,0.000006367928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992567,0.000054653858,0.00026948264,0.00006334844,0.00012372303,0.00023209461],"domain_scores_gemma":[0.99956805,0.000044238495,0.00006540772,0.00021699224,0.00003759429,0.00006769858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002851037,0.00010155798,0.00022101407,0.00009602788,0.000028466357,0.0000036510178,0.00010848748,0.000059775077,0.000041091],"category_scores_gemma":[0.000005529079,0.000105454805,0.000087057815,0.00022195508,0.00003215273,0.00013942059,0.000018883922,0.000071599854,0.00002560483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001017674,0.00013259418,0.021232096,0.00019336455,0.000075132404,5.263041e-7,0.0007888644,0.000063257925,0.043339286,0.93338835,0.00070531055,0.000071011935],"study_design_scores_gemma":[0.0034155939,0.0002808694,0.122067906,0.0003807216,0.00014392985,0.000023698396,0.00055127474,0.0029197983,0.22899136,0.6315745,0.008842717,0.0008076282],"about_ca_topic_score_codex":0.000005001541,"about_ca_topic_score_gemma":8.646884e-7,"teacher_disagreement_score":0.30181387,"about_ca_system_score_codex":0.000010496231,"about_ca_system_score_gemma":0.0000025986387,"threshold_uncertainty_score":0.43003222},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9860589,0.000030460724,0.000010149657,0.00030108268,0.00040786227,0.00016560167,0.0000043823534,0.000035508325,0.012986057],"genre_scores_gemma":[0.99962395,0.000002519412,0.00010783057,0.00007646441,0.000007576094,0.000026778127,9.749349e-7,0.000013828809,0.00014007208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993917,0.000085520354,0.00015790999,0.00007366853,0.00012332424,0.00016789518],"domain_scores_gemma":[0.9985501,0.0008757818,0.00010038037,0.00041082318,0.000020868074,0.000042018495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005433366,0.00008530169,0.00011589489,0.0000349014,0.00013373449,0.0000086384225,0.00022953506,0.00004093562,0.00008443963],"category_scores_gemma":[0.000091879025,0.00005597338,0.0000873964,0.000148348,0.00006841786,0.000055386212,0.00003919543,0.00012626356,0.000043645003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006505129,0.00020289782,0.00033990282,0.0000073765023,0.000021837424,6.16292e-8,0.0008319363,1.7805316e-7,0.0008922502,0.9936822,0.0039568753,0.000057984562],"study_design_scores_gemma":[0.00015462276,0.00001605346,0.0007225545,0.000013559655,0.00002071824,0.00000119681,0.00018579289,0.0000015611153,0.0056274915,0.99279094,0.0004023589,0.0000631605],"about_ca_topic_score_codex":0.0000063104494,"about_ca_topic_score_gemma":3.702551e-7,"teacher_disagreement_score":0.013565061,"about_ca_system_score_codex":0.0000073671977,"about_ca_system_score_gemma":0.00000682559,"threshold_uncertainty_score":0.22825283},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.874488,0.0008761959,0.11471461,0.0012040224,0.0022098909,0.00037195114,0.000004929259,0.00041908413,0.0057113334],"genre_scores_gemma":[0.96944237,0.000011038147,0.030250942,0.0001452088,0.000009282066,0.0000061733263,0.000003449848,0.000006592739,0.00012492882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889773,0.000038584334,0.0002921107,0.00028709453,0.00025199397,0.00023250515],"domain_scores_gemma":[0.999063,0.000061081824,0.00017550697,0.00053357164,0.000099585144,0.0000672689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030676989,0.00013355575,0.00023748845,0.00009474704,0.0001068985,0.000026825344,0.00041424666,0.00004643099,0.0000030944698],"category_scores_gemma":[0.00007211443,0.00012622106,0.00005833186,0.00044299627,0.00004274287,0.0006930367,0.00015213527,0.00009716074,0.000011897227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004924405,0.000060544116,0.00022259667,0.000018809655,0.0000056794192,0.000016092303,0.00091573095,0.0000106949055,0.0058132666,0.98339534,0.0005457004,0.008990637],"study_design_scores_gemma":[0.0020780854,0.0011556055,0.0067428784,0.0004469241,0.000014569797,0.000048055506,0.00043705368,0.026785532,0.01966633,0.89992344,0.04185069,0.0008508219],"about_ca_topic_score_codex":0.000050334405,"about_ca_topic_score_gemma":0.000003744098,"teacher_disagreement_score":0.0949544,"about_ca_system_score_codex":0.00003601552,"about_ca_system_score_gemma":0.00004762894,"threshold_uncertainty_score":0.51471454},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98228383,0.00002400885,0.0080307,0.00080649904,0.0015114737,0.0001482742,0.000001526816,0.00021018375,0.006983525],"genre_scores_gemma":[0.99662465,0.0000023147272,0.0025959895,0.00070441107,0.000005623944,0.000010416252,8.9294e-7,0.000008977227,0.00004669868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987468,0.00018576503,0.000117192314,0.0003106828,0.00027403393,0.0003655368],"domain_scores_gemma":[0.99863535,0.00046890206,0.0000925366,0.00064022787,0.00006421936,0.000098750555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047333326,0.00014854819,0.00013602794,0.00006438269,0.00030005784,0.00015859914,0.0007407134,0.00003795053,0.000007756236],"category_scores_gemma":[0.000056853503,0.000091514354,0.000047706173,0.0004802139,0.00021605521,0.0002265631,0.000096395794,0.00023500176,0.00003900152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005542099,0.000019659838,0.00081144326,0.0000023935818,0.000012746737,0.0000052778605,0.00039157082,0.000019920848,0.00008036328,0.9889899,0.0001411242,0.009520065],"study_design_scores_gemma":[0.00049087335,0.00026965054,0.00056109537,0.000021060025,0.0000049243044,0.000020757521,0.00011520219,0.0016352441,0.0009238197,0.9949912,0.0008052275,0.0001609734],"about_ca_topic_score_codex":0.000013402047,"about_ca_topic_score_gemma":0.0000022048448,"teacher_disagreement_score":0.014340866,"about_ca_system_score_codex":0.000017430679,"about_ca_system_score_gemma":0.000038287275,"threshold_uncertainty_score":0.37318468},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98989034,0.0022350543,0.0003506593,0.00008962704,0.002955981,0.001164007,0.000049079237,0.00044008857,0.0028251652],"genre_scores_gemma":[0.999662,0.000018374672,0.000029790584,0.0000069819125,0.000008598126,0.00007985575,0.0000099269855,0.000022447482,0.00016205735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990861,0.000058081117,0.00026006985,0.00013835599,0.00016273883,0.0002946888],"domain_scores_gemma":[0.99930125,0.00012477803,0.00007461105,0.000348213,0.000095168245,0.00005595388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036682267,0.00015222361,0.00025235707,0.000035858706,0.00014532916,0.000037468682,0.00022908334,0.00007059143,0.000001679443],"category_scores_gemma":[0.00003929726,0.00010289136,0.000068060726,0.00025937447,0.000025010688,0.00007737977,0.000009037422,0.00009919035,0.0000031727454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009576838,0.00007482033,0.00035826367,0.00018881202,0.00010748439,0.000004431145,0.00044168887,0.00031873162,0.0007583517,0.99433553,0.0029708997,0.0003452378],"study_design_scores_gemma":[0.013826083,0.0027777832,0.015384861,0.0016082454,0.00029825888,0.00010576041,0.0043273605,0.075575806,0.009907892,0.795245,0.07889593,0.0020470286],"about_ca_topic_score_codex":0.0000073346805,"about_ca_topic_score_gemma":0.000008903865,"teacher_disagreement_score":0.19909051,"about_ca_system_score_codex":0.000027591348,"about_ca_system_score_gemma":0.000014639516,"threshold_uncertainty_score":0.4195788},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94316083,0.0003392275,0.0000013030344,0.000017935368,0.0003672745,0.000020889087,0.000013074522,0.0000285405,0.056050938],"genre_scores_gemma":[0.9989217,0.00003657046,0.00005314502,0.000035778925,0.000015715217,0.0000099402405,0.000017604267,0.0000104485935,0.0008990925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99938047,0.000008836526,0.00016228491,0.00013154287,0.0001405098,0.00017638275],"domain_scores_gemma":[0.9994939,0.0000699694,0.00008993012,0.00023344845,0.000025560448,0.00008719217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009575476,0.00009655046,0.000116235264,0.00001749552,0.00006442694,0.000004307966,0.00007638756,0.00007649311,0.00030863742],"category_scores_gemma":[0.00007835044,0.00009974246,0.000031766438,0.00005651544,0.000084492036,0.00009707447,0.000026401256,0.00012066826,0.000013717722],"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.00020691012,0.0010518598,0.011909874,0.0004979706,0.00007621647,0.000008336996,0.001025369,0.0000044676895,0.47402328,0.49952498,0.0089035425,0.0027671892],"study_design_scores_gemma":[0.0012872757,0.000041711926,0.00033350204,0.00012997614,0.000025757023,0.000005596094,0.000108142136,0.0000030292617,0.84684324,0.12579468,0.025214307,0.00021276854],"about_ca_topic_score_codex":0.000002415812,"about_ca_topic_score_gemma":1.5928069e-7,"teacher_disagreement_score":0.3737303,"about_ca_system_score_codex":0.00003493319,"about_ca_system_score_gemma":0.000008698849,"threshold_uncertainty_score":0.40673792},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99367106,0.00051243074,0.0005017695,0.00039360474,0.0027301356,0.00016757425,0.000008221484,0.00022063358,0.0017945602],"genre_scores_gemma":[0.99560213,0.000004420743,0.0040869447,0.000091593014,9.657762e-7,0.000008594499,0.000008834481,0.000012124068,0.00018438009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980025,0.00013172286,0.0003963969,0.00041887077,0.00055223634,0.0004982397],"domain_scores_gemma":[0.9982288,0.00010168414,0.00016407487,0.0008797763,0.00032492226,0.00030076742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007764962,0.00019256219,0.0003283783,0.00015340153,0.00012344866,0.00008879882,0.0007527385,0.00009184657,0.000009087558],"category_scores_gemma":[0.00011235279,0.00018493825,0.00011079785,0.00075196667,0.00012237695,0.00039411962,0.00048772377,0.00017005714,0.00005604605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009698837,0.00021186209,0.0022170213,0.000014418332,0.000027339032,0.0000075440057,0.00036113017,0.00009086274,0.0012894914,0.9898304,0.005022414,0.0009178635],"study_design_scores_gemma":[0.0014377092,0.00027545073,0.0012821108,0.00003486965,0.000012768067,0.000010969725,0.000043417465,0.014757984,0.0028419674,0.9785297,0.0005385672,0.00023451581],"about_ca_topic_score_codex":0.000279345,"about_ca_topic_score_gemma":0.00000685676,"teacher_disagreement_score":0.014667122,"about_ca_system_score_codex":0.000034491295,"about_ca_system_score_gemma":0.00013436926,"threshold_uncertainty_score":0.7541563},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99206394,0.0000075886273,0.0006125153,0.0004826945,0.00043280175,0.0002557141,0.000009114793,0.000018480343,0.0061171437],"genre_scores_gemma":[0.99953544,6.88831e-7,0.00026584294,0.00012018918,0.000006033265,0.000028221644,0.00000355154,0.000004054967,0.00003596466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992096,0.00008503372,0.00032905146,0.00011798201,0.0001188036,0.00013956198],"domain_scores_gemma":[0.99801284,0.0013966644,0.00011114812,0.00031392247,0.00009326218,0.00007214923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051478425,0.00008614889,0.00035177718,0.000017146387,0.00004448542,0.0000014132413,0.0001247505,0.00011910233,0.0001573506],"category_scores_gemma":[0.0011287967,0.00004843172,0.00008769396,0.000093731316,0.00038299788,0.000009228413,0.00003575188,0.0002345567,0.000034399767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004582555,0.0004373201,0.008912615,0.00008452587,0.000028575476,0.0000029870607,0.000022203572,0.0000012667538,0.0005130274,0.989856,0.000009798987,0.00008584956],"study_design_scores_gemma":[0.0008395907,0.00036351383,0.009160034,0.00011957161,0.00015495677,0.000015621374,0.000022112346,0.014327046,0.0012384721,0.97370464,0.0000017927481,0.00005266557],"about_ca_topic_score_codex":0.000014381414,"about_ca_topic_score_gemma":0.0000023217578,"teacher_disagreement_score":0.016151384,"about_ca_system_score_codex":0.00001334595,"about_ca_system_score_gemma":0.000039226517,"threshold_uncertainty_score":0.19749881},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9868417,0.000026242587,0.00042609236,0.00031892865,0.00025603478,0.00023337302,0.000005845793,0.00008700723,0.011804782],"genre_scores_gemma":[0.99176234,0.0000035614737,0.0072687594,0.00014609701,0.000010605537,0.000031057094,0.0000028549998,0.000020214518,0.00075453124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999151,0.00003793029,0.00022439279,0.00017613926,0.0001960382,0.00021448826],"domain_scores_gemma":[0.9987167,0.00069595815,0.00006650664,0.00027853873,0.00005650955,0.0001857467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002640643,0.0001214555,0.00018900074,0.000020845335,0.0000655858,0.000043585598,0.000108463755,0.000063216205,0.00005026834],"category_scores_gemma":[0.00048772327,0.00010367182,0.000036803547,0.00007326008,0.000054080905,0.00005528263,0.000055850727,0.0001245006,0.000083712075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074692875,0.00015177106,0.0001110746,0.000033370772,0.000011603955,0.000001601871,0.0007373081,0.0000013904679,0.00001608012,0.9913231,0.0074658473,0.0001393509],"study_design_scores_gemma":[0.0006650813,0.00006265891,0.000024901774,0.000034595225,0.000017446899,0.0000029587156,0.000294594,0.001198901,0.00027754117,0.9959733,0.0013165079,0.00013149969],"about_ca_topic_score_codex":0.000020655363,"about_ca_topic_score_gemma":0.0000018354588,"teacher_disagreement_score":0.01105025,"about_ca_system_score_codex":0.000035847377,"about_ca_system_score_gemma":0.000016637407,"threshold_uncertainty_score":0.4227614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9815045,0.000059320835,0.007849968,0.0001367125,0.0047295312,0.00060383114,0.00003315735,0.0007253298,0.004357642],"genre_scores_gemma":[0.9889511,0.000014298421,0.010401653,0.00002401493,0.00003569471,0.00030223446,0.000035355628,0.00005693954,0.00017870589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992439,0.0000029446944,0.00019826343,0.00016235822,0.000116184405,0.00027631695],"domain_scores_gemma":[0.9992938,0.000085844506,0.000025097346,0.00039867038,0.000104364066,0.00009221615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011263049,0.00013877936,0.00014617405,0.00012414219,0.00009950181,0.00003135107,0.00024040494,0.00012619606,0.000037963546],"category_scores_gemma":[0.00008459201,0.00015200066,0.000065360226,0.00041768193,0.000023046714,0.00012839635,0.000027620892,0.00020799528,0.00011408144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102482645,0.00009072178,0.0006716096,0.000080838414,0.000053203472,8.5211303e-7,0.00012751893,0.0035151297,0.039147202,0.9387604,0.009442061,0.008100218],"study_design_scores_gemma":[0.0018896176,0.000117689626,0.003121968,0.000012226979,0.000058143847,0.0000088536135,0.000022689455,0.10712804,0.042315956,0.7052087,0.13935766,0.00075843366],"about_ca_topic_score_codex":0.00001451106,"about_ca_topic_score_gemma":0.000021157059,"teacher_disagreement_score":0.23355167,"about_ca_system_score_codex":0.00003054359,"about_ca_system_score_gemma":0.000018785395,"threshold_uncertainty_score":0.6198407},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95226586,0.0017596667,0.022111261,0.016191216,0.0010973001,0.0035714924,0.000020832904,0.00012277339,0.0028596157],"genre_scores_gemma":[0.9984078,0.000024821433,0.00072339276,0.00028698274,0.000010024784,0.00018951994,6.5120315e-7,0.0000064066717,0.00035040063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993766,0.00004047365,0.00014198059,0.00018236566,0.00011677259,0.0001418274],"domain_scores_gemma":[0.99829215,0.0011068677,0.000074429576,0.00039686923,0.00008705054,0.000042606167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003597018,0.00009271892,0.000106491236,0.000025798861,0.00028136393,0.00013679173,0.0004959369,0.00003080324,0.000029193767],"category_scores_gemma":[0.000045673693,0.000052173957,0.00003494191,0.00014055998,0.000092611546,0.00014279163,0.00016139813,0.000074877345,0.000021650618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038954977,0.000042569274,0.000028776896,0.000012097743,0.000011786772,9.1727436e-8,0.00014585708,0.0000010015118,0.00014637034,0.99465454,0.0014829257,0.0034701054],"study_design_scores_gemma":[0.00035479036,0.0001300572,0.0012572753,0.0000087166845,0.000008252066,0.0000042929064,0.00004073873,0.021068772,0.00035087042,0.9678995,0.008788887,0.00008783409],"about_ca_topic_score_codex":0.000010073688,"about_ca_topic_score_gemma":4.5864977e-7,"teacher_disagreement_score":0.04614196,"about_ca_system_score_codex":0.000006606226,"about_ca_system_score_gemma":0.000013717997,"threshold_uncertainty_score":0.21640523},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7290359,0.00012186512,0.25559494,0.005047121,0.0025405255,0.0021394365,0.000030394533,0.00075688766,0.004732926],"genre_scores_gemma":[0.9940835,0.0000029224823,0.005095326,0.0005910821,0.000006983938,0.000057706497,0.000010582913,0.000012786865,0.00013906353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998402,0.00006628342,0.00020311843,0.0004865988,0.0003344336,0.0005075754],"domain_scores_gemma":[0.99852765,0.0002512699,0.00006125464,0.000703455,0.0002015691,0.00025483174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003111809,0.00017808523,0.00020260422,0.0002555361,0.00021313378,0.00013656483,0.0009748367,0.00007205912,0.000007780692],"category_scores_gemma":[0.00019027966,0.00017296475,0.00011688764,0.00060877524,0.00003602061,0.00054374244,0.00010849681,0.00014441973,0.000038395367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019310839,0.00010735627,0.00085870817,0.0000036020397,0.000009399415,0.000004043254,0.00028205567,0.000012941175,0.0013423264,0.9922223,0.0016857262,0.0034522398],"study_design_scores_gemma":[0.0007128998,0.00076527486,0.0040209405,0.000009824261,0.0000034308766,0.0000031792479,0.00003234017,0.0007796603,0.0061081396,0.9859763,0.0013732575,0.00021477713],"about_ca_topic_score_codex":0.000002725038,"about_ca_topic_score_gemma":0.0000012060808,"teacher_disagreement_score":0.26504764,"about_ca_system_score_codex":0.000061850275,"about_ca_system_score_gemma":0.00004519045,"threshold_uncertainty_score":0.7053298},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98998356,0.0000035752482,0.000018188206,0.00044908954,0.00017625833,0.00022872914,0.0000044445205,0.00004033495,0.009095821],"genre_scores_gemma":[0.9994764,0.0000016710123,0.00017688655,0.00007744545,0.0000029384655,0.000052978357,0.0000014480192,0.000018035893,0.00019224275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936205,0.00005239187,0.00014749664,0.00013625364,0.00016792066,0.00013386825],"domain_scores_gemma":[0.99843395,0.0006681623,0.00011990808,0.00066905963,0.00006611234,0.000042811986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028596824,0.000106683045,0.00013289685,0.000053293807,0.00012437135,0.00001164164,0.00032345168,0.000065456356,0.00008958275],"category_scores_gemma":[0.00009763266,0.00006413273,0.000055999953,0.00031676513,0.00020336645,0.000039572828,0.00003289894,0.0002814776,0.000017368839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013865271,0.00019254684,0.0011783995,0.0000064089804,0.000029221132,5.558183e-7,0.00017122341,6.296415e-7,0.001420577,0.9957832,0.0010593494,0.00014401856],"study_design_scores_gemma":[0.0003569586,0.00007384316,0.0016547961,0.000016852278,0.000020651045,0.0000022135737,0.00006878408,0.000020070993,0.0051086545,0.9918233,0.0007678516,0.00008599011],"about_ca_topic_score_codex":0.000009132754,"about_ca_topic_score_gemma":0.000020617801,"teacher_disagreement_score":0.009492794,"about_ca_system_score_codex":0.0000038169046,"about_ca_system_score_gemma":0.000018764827,"threshold_uncertainty_score":0.26152566},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9837495,0.00005113273,0.00612833,0.0011619676,0.0021276004,0.00024522236,0.000004369645,0.00027591933,0.0062559755],"genre_scores_gemma":[0.99560255,0.000013569996,0.0038621612,0.0002708628,0.000018674327,0.00001866104,0.0000065282716,0.000018521792,0.0001884474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983199,0.00012584835,0.0001957167,0.0005096937,0.0004468721,0.00040194578],"domain_scores_gemma":[0.9985123,0.00033668705,0.00007971916,0.0007576177,0.000105321145,0.00020835277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000438544,0.00019057201,0.00018548577,0.00024972935,0.0002881275,0.00018114915,0.00069433963,0.0001100711,0.000058825317],"category_scores_gemma":[0.00012270141,0.00018966367,0.00005675304,0.0004782675,0.00019238268,0.0005603624,0.0002655875,0.000558572,0.00018041382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017174023,0.00010451585,0.00032209407,0.0000071911586,0.000008256656,0.000012868955,0.000117790034,0.0000022192114,0.014745025,0.9789718,0.00009571784,0.005595372],"study_design_scores_gemma":[0.0007410643,0.00022659468,0.00413037,0.00002241811,0.0000031991729,0.00002950419,0.000010994337,0.0012112416,0.008051407,0.9845394,0.0008128492,0.00022096152],"about_ca_topic_score_codex":0.000016541719,"about_ca_topic_score_gemma":0.000009789824,"teacher_disagreement_score":0.0118530905,"about_ca_system_score_codex":0.00003316953,"about_ca_system_score_gemma":0.000039237708,"threshold_uncertainty_score":0.773426},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9685684,0.000060005266,0.0001801758,0.0009722405,0.0035810005,0.00029627618,0.000007517046,0.00022810156,0.026106276],"genre_scores_gemma":[0.9930135,0.0000018091863,0.0026355071,0.00009971788,0.000048481117,0.000015520798,0.000007681842,0.000025315132,0.0041524475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990004,0.000049174938,0.00021601991,0.00014975856,0.00031261338,0.00027205556],"domain_scores_gemma":[0.9985622,0.00071224495,0.00006976858,0.00040891662,0.00007291336,0.00017392468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033277075,0.00012716098,0.00014746019,0.000052628624,0.00009338502,0.000021336942,0.00012351297,0.0000744382,0.000339835],"category_scores_gemma":[0.0021449002,0.0001204566,0.000059872964,0.00019794298,0.000030813942,0.00024146885,0.00004267677,0.00015234985,0.0005959592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005059315,0.0002742446,0.00058169896,0.000014062387,0.000017232007,4.8451193e-7,0.00035996365,0.0000037778761,0.000058590507,0.9678846,0.030508114,0.00024666588],"study_design_scores_gemma":[0.0006469224,0.00011043822,0.001105558,0.000016658518,0.000016311982,0.0000047008098,0.000042427804,0.00002069511,0.0005151653,0.9907929,0.006597404,0.00013082725],"about_ca_topic_score_codex":0.000021939151,"about_ca_topic_score_gemma":0.000004612606,"teacher_disagreement_score":0.024445111,"about_ca_system_score_codex":0.00012315725,"about_ca_system_score_gemma":0.00007894325,"threshold_uncertainty_score":0.76600486},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99082,0.00021011771,0.0014701437,0.00008327013,0.00020592431,0.000050740433,0.0000075322487,0.00004991511,0.007102359],"genre_scores_gemma":[0.999275,0.000023419894,0.00031657846,0.000063010746,0.0000026502978,0.000028988323,0.0000022733973,0.0000110592555,0.00027697082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993776,0.00005193088,0.00016365905,0.00014834583,0.00015038275,0.00010805506],"domain_scores_gemma":[0.99912035,0.0002998482,0.000100956306,0.0003180175,0.000070748916,0.000090070476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018061095,0.0000910435,0.00015041274,0.000051370935,0.00004748503,0.000008933641,0.00014360077,0.000045937777,0.0000056356903],"category_scores_gemma":[0.00013759929,0.00008404989,0.000032174503,0.000211852,0.0001089718,0.000055912304,0.00004128769,0.000039623486,0.0000012809179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021029287,0.00012481326,0.00019130654,0.000009079517,0.000010795937,0.0000014009221,0.00013973482,6.4973875e-7,0.0001670175,0.996142,0.0029251846,0.0002669629],"study_design_scores_gemma":[0.0003515489,0.00008960959,0.00006618706,0.000028961502,0.0000117714035,0.0000025179102,0.000046160087,0.000027637641,0.0036180264,0.99355745,0.0021122368,0.00008786125],"about_ca_topic_score_codex":0.000043504268,"about_ca_topic_score_gemma":0.000021872973,"teacher_disagreement_score":0.008455051,"about_ca_system_score_codex":0.000010283424,"about_ca_system_score_gemma":0.000019901352,"threshold_uncertainty_score":0.3427455},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97974586,0.00047239815,0.001820109,0.0011429103,0.0060650795,0.0002498896,8.655083e-7,0.00032498405,0.010177874],"genre_scores_gemma":[0.99842304,0.000013394175,0.0008882585,0.0004139373,0.000046423225,0.000030415735,0.0000019275974,0.0000150006545,0.00016761218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820536,0.00019436117,0.0004461801,0.00045167524,0.00025999578,0.00044243602],"domain_scores_gemma":[0.9989347,0.00018632661,0.00013281807,0.0005256721,0.00010977144,0.000110732166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005532154,0.00018860846,0.00027618138,0.00022389526,0.00013911769,0.00021059907,0.00073506386,0.000090958245,0.00003325956],"category_scores_gemma":[0.00006758579,0.00018495083,0.00009351811,0.00074940524,0.00002925039,0.0007406664,0.00017140433,0.00025705973,0.00014641965],"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.00000973276,0.00012845291,0.0062042996,0.000009580524,0.000023582179,0.000030512854,0.001979685,0.00047597705,0.00036687625,0.9783758,0.0038237027,0.00857181],"study_design_scores_gemma":[0.007814256,0.0005833475,0.02060106,0.000492176,0.000022823731,0.000111682224,0.00059406244,0.46410418,0.004316858,0.45501688,0.044780683,0.001561984],"about_ca_topic_score_codex":0.00018649692,"about_ca_topic_score_gemma":0.00020351415,"teacher_disagreement_score":0.5233589,"about_ca_system_score_codex":0.0001041741,"about_ca_system_score_gemma":0.000046110585,"threshold_uncertainty_score":0.7542076},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9633948,0.00007249139,0.007557807,0.001577164,0.00019549676,0.00030725877,0.0000132487685,0.00005417653,0.026827548],"genre_scores_gemma":[0.99858487,0.0000013963104,0.0010319895,0.000091203496,0.000039187005,0.00004542468,0.000004243945,0.000013682817,0.00018799808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999412,0.000017839327,0.00009886387,0.00015465532,0.0001440978,0.0001725483],"domain_scores_gemma":[0.9993448,0.00024378243,0.00007195955,0.00019613348,0.000046394027,0.0000969059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013905576,0.00011226313,0.00012900085,0.000012379512,0.0001601701,0.000050688494,0.00010758484,0.000017152253,0.000018894978],"category_scores_gemma":[0.000011237108,0.000068721,0.000024119734,0.00013730348,0.00006434855,0.00007431708,0.000044762946,0.00013049622,0.000034741246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014332994,0.00004253073,0.0012292726,0.0000044921358,0.000013911772,6.599365e-7,0.0003349676,0.00003123188,0.000026221498,0.9961499,0.00083671004,0.0013157456],"study_design_scores_gemma":[0.0006381042,0.000068051384,0.00027662734,0.000027908707,0.000022258226,0.0000021430362,0.0009015731,0.00023202947,0.0004260949,0.9895289,0.0077406485,0.00013564312],"about_ca_topic_score_codex":0.000027392056,"about_ca_topic_score_gemma":0.0000011980768,"teacher_disagreement_score":0.035190064,"about_ca_system_score_codex":0.000019084324,"about_ca_system_score_gemma":0.00003164824,"threshold_uncertainty_score":0.2802361},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99486893,0.000034837863,0.00023944341,0.000042234857,0.00023823627,0.00014140493,0.000008322874,0.00003636286,0.004390221],"genre_scores_gemma":[0.9988815,0.000006812633,0.0009718786,0.000011855077,0.0000065357426,0.000020675654,0.0000026722687,0.00001326301,0.000084780295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917597,0.000085918924,0.00031813962,0.00012175638,0.00016128617,0.00013690941],"domain_scores_gemma":[0.9988303,0.00038431332,0.00020849785,0.00042590522,0.00010492501,0.00004602005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050242216,0.00009169726,0.00025174723,0.00008527458,0.00005950924,0.000006301455,0.0002078813,0.000059879643,0.000033073713],"category_scores_gemma":[0.00022170773,0.00008574429,0.000118125856,0.00028762993,0.00015010548,0.00004683134,0.0000384192,0.00006684365,0.000010647557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013443615,0.00023849861,0.0019343538,0.000053562642,0.000032143656,1.07109244e-7,0.0002783788,6.7410735e-7,0.0051392596,0.9914362,0.0006735993,0.00019978035],"study_design_scores_gemma":[0.00046928355,0.00009735115,0.0010514684,0.000027413333,0.000043842632,7.1673287e-7,0.000026879972,0.000036196656,0.035327226,0.9619938,0.0008467326,0.00007910425],"about_ca_topic_score_codex":0.0000126477435,"about_ca_topic_score_gemma":0.000003853712,"teacher_disagreement_score":0.030187964,"about_ca_system_score_codex":0.000005343881,"about_ca_system_score_gemma":0.000016016993,"threshold_uncertainty_score":0.34965503},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98364824,0.00057431526,0.0011120739,0.002622607,0.0030756828,0.00017955244,0.0000011176331,0.00013817532,0.00864826],"genre_scores_gemma":[0.99836177,0.000012400364,0.0009142341,0.00054801273,8.71133e-7,0.0000048821203,4.814633e-7,0.000007445535,0.00014993247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895465,0.00009795863,0.00017883921,0.00017127319,0.00030623845,0.00029103708],"domain_scores_gemma":[0.99856496,0.0004398576,0.000102298036,0.0007073858,0.000088095956,0.00009742109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062101986,0.000115035786,0.00012828295,0.00008564044,0.00009330007,0.000034815497,0.000626326,0.000048814036,0.000018428218],"category_scores_gemma":[0.00011709652,0.000076337834,0.000075380754,0.0005342646,0.000085612104,0.00016676748,0.00015085062,0.00014988928,0.00016679765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029866171,0.00012183657,0.0012067122,0.000004547052,0.000010406075,8.87037e-7,0.0002558657,0.00003069518,0.0003274639,0.993314,0.004456989,0.00026757698],"study_design_scores_gemma":[0.00026973692,0.00010553783,0.0010185752,0.000027655115,0.0000049424843,0.0000020301723,0.000011793795,0.0011534948,0.004112296,0.99264014,0.0005511593,0.000102659935],"about_ca_topic_score_codex":0.000020003925,"about_ca_topic_score_gemma":3.64248e-7,"teacher_disagreement_score":0.014713524,"about_ca_system_score_codex":0.000008488261,"about_ca_system_score_gemma":0.000024691095,"threshold_uncertainty_score":0.31129664},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99461246,0.00050370843,0.0016190851,0.0003437048,0.0006589896,0.00021404597,0.0000012443303,0.0001087659,0.0019379924],"genre_scores_gemma":[0.9963542,0.000017759825,0.003502275,0.00004892484,0.0000018328059,0.000019639181,6.826421e-7,0.000008116107,0.000046569545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845743,0.00021598957,0.00018165205,0.0004367011,0.00033955296,0.00036864853],"domain_scores_gemma":[0.9987177,0.00017552957,0.000038898637,0.00070222863,0.00012118652,0.0002444574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001226441,0.00012345305,0.00017159956,0.00016211541,0.00005625025,0.00007200121,0.000702212,0.000058024456,0.0000024727321],"category_scores_gemma":[0.0003034267,0.00011635834,0.000029976749,0.0007492434,0.00016412468,0.00055213866,0.00048102115,0.00023248559,0.000018706522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013564258,0.00008530595,0.052127276,0.000008022313,0.0000028596846,0.000030441255,0.00037542498,0.000001892408,0.000053104854,0.9382358,0.0001692025,0.008897098],"study_design_scores_gemma":[0.00081028603,0.0001182936,0.046430513,0.0000099326335,7.5252984e-7,0.000008176664,0.00004477368,0.0010596144,0.00021846597,0.9508872,0.0002825814,0.00012942596],"about_ca_topic_score_codex":0.000051734663,"about_ca_topic_score_gemma":0.000020305166,"teacher_disagreement_score":0.012651377,"about_ca_system_score_codex":0.00006600006,"about_ca_system_score_gemma":0.0000858236,"threshold_uncertainty_score":0.4744955},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3608356,0.000176374,0.53329176,0.024483975,0.0014788827,0.0062120277,0.00011557537,0.00022389153,0.07318193],"genre_scores_gemma":[0.9974258,0.0000023530135,0.0009067326,0.00015470036,0.000024526285,0.0010437601,0.000015839727,0.000012727699,0.0004135948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949867,0.000008671873,0.00016680066,0.0000969079,0.00006445437,0.00016450686],"domain_scores_gemma":[0.99933916,0.0002905861,0.000053990498,0.00021268899,0.000060818642,0.000042758358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008394278,0.0000856937,0.00010144295,0.000009088971,0.0002175338,0.000053739826,0.00014695656,0.000016479296,0.00029131744],"category_scores_gemma":[0.000007505163,0.000057735615,0.00008340338,0.000075840915,0.000043981967,0.00015937982,0.000015533864,0.00006153175,0.00011692078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020339273,0.000039358118,0.000025649451,0.000004161978,0.000018693214,3.6730332e-9,0.00015942607,0.0000071477616,0.00024719714,0.9833125,0.00384781,0.012336038],"study_design_scores_gemma":[0.00035538283,0.00001578666,0.00010217107,0.000004325927,0.000015760317,9.487254e-8,0.0004264141,0.0012183997,0.00126847,0.95642877,0.04008691,0.00007751502],"about_ca_topic_score_codex":0.000032860073,"about_ca_topic_score_gemma":1.707199e-7,"teacher_disagreement_score":0.6365902,"about_ca_system_score_codex":0.000009191587,"about_ca_system_score_gemma":0.000011783862,"threshold_uncertainty_score":0.31897214},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97639966,0.00007738383,0.01421235,0.00036000527,0.0023492204,0.00011100909,0.0000011043327,0.00012161493,0.0063676764],"genre_scores_gemma":[0.9513919,0.000013191255,0.048435494,0.00012567615,0.0000054679467,0.000005153977,0.000002334182,0.000005915352,0.000014889501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906963,0.000095433425,0.00020703995,0.00024122145,0.00020921108,0.00017747523],"domain_scores_gemma":[0.9991847,0.00004203922,0.000114126655,0.0005218791,0.00007519241,0.000062020066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024694487,0.000101657395,0.00019155309,0.0000613081,0.000064764085,0.000042559303,0.0004647824,0.00006484459,0.000008951539],"category_scores_gemma":[0.000037447247,0.00009075359,0.00006409346,0.00024818827,0.00006028811,0.0001897986,0.00012538394,0.00007317597,0.000021726797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000296438,0.00003603749,0.0006091073,0.00000798841,0.000009234419,0.0000013622598,0.00012661796,0.00005162205,0.0007929052,0.9854791,0.000345481,0.012537566],"study_design_scores_gemma":[0.0007613099,0.00013076018,0.0018941145,0.0000090999965,0.000005509381,0.000010768887,0.000007973593,0.04928412,0.0025635285,0.9431641,0.0020373047,0.00013137702],"about_ca_topic_score_codex":0.000034545763,"about_ca_topic_score_gemma":7.0710314e-7,"teacher_disagreement_score":0.049232494,"about_ca_system_score_codex":0.000017520302,"about_ca_system_score_gemma":0.000022720638,"threshold_uncertainty_score":0.37008238},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99666786,0.00046009064,0.00091665884,0.000048151738,0.0005544445,0.00012401621,0.000004159721,0.00013321155,0.0010914134],"genre_scores_gemma":[0.9807598,0.000023038265,0.01908817,0.0000760061,4.852348e-7,0.0000057288394,0.0000019194517,0.0000129980435,0.000031862495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876267,0.000046106918,0.00023653934,0.00036332497,0.0002623883,0.00032899342],"domain_scores_gemma":[0.99905795,0.000046594956,0.00013014741,0.0004912056,0.0001351002,0.00013901413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031851386,0.00016698278,0.00022610225,0.00014874912,0.00012414934,0.000035244535,0.00036261318,0.00007174514,0.0000075742555],"category_scores_gemma":[0.000016495593,0.00013602697,0.00004049825,0.00043873678,0.00009484053,0.0002553804,0.00013254622,0.00014167937,0.00000969883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019050858,0.00018284624,0.014870365,0.000029263636,0.000034855468,0.000025279236,0.00090909586,0.0000013829092,0.0006824126,0.982347,0.00013853595,0.0007599206],"study_design_scores_gemma":[0.0017427497,0.00045457267,0.0069587613,0.000101942045,0.00001732156,0.000043161068,0.00006135821,0.0008983685,0.004080817,0.98536223,0.000024310313,0.000254408],"about_ca_topic_score_codex":0.000106724794,"about_ca_topic_score_gemma":0.000010052699,"teacher_disagreement_score":0.018171512,"about_ca_system_score_codex":0.0000059134636,"about_ca_system_score_gemma":0.0000429561,"threshold_uncertainty_score":0.55470186},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98232424,0.00006711071,0.009394558,0.0007399019,0.0004582626,0.0002836254,0.000001052485,0.00010425791,0.0066269953],"genre_scores_gemma":[0.9990258,0.0000027153483,0.0006979767,0.0001236155,0.0000022755548,0.000021669899,4.5428325e-7,0.000014622602,0.000110865134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824804,0.00024657487,0.00015537176,0.0003037642,0.00073989417,0.00030635647],"domain_scores_gemma":[0.9980562,0.0004912451,0.00010151556,0.0010049142,0.00020989202,0.00013628759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009783767,0.00014954997,0.00018502043,0.00014088073,0.00011051216,0.000061092825,0.0014484455,0.000045455992,0.0000059787953],"category_scores_gemma":[0.00019006374,0.000090700116,0.00005653841,0.00088909833,0.00020632676,0.00028377632,0.00026227857,0.000310248,0.00003718477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006299047,0.00013211435,0.003887495,0.000005137179,0.000020600399,0.000010400668,0.00065795344,0.000039188275,0.00008181858,0.9932394,0.000538352,0.0013245433],"study_design_scores_gemma":[0.0006875501,0.0008305326,0.0015221151,0.00002814341,0.0000025494592,0.000007869063,0.00010770583,0.0013368106,0.0018734542,0.99338615,0.000094381765,0.00012271838],"about_ca_topic_score_codex":0.000032683598,"about_ca_topic_score_gemma":0.000007890287,"teacher_disagreement_score":0.01670157,"about_ca_system_score_codex":0.00003890874,"about_ca_system_score_gemma":0.00010999865,"threshold_uncertainty_score":0.36986434},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.993585,0.0007878816,0.00017422876,0.00021227609,0.003025323,0.00008951728,0.0000015844724,0.00014590648,0.0019782817],"genre_scores_gemma":[0.99537385,0.000012728082,0.0042773373,0.00024673567,0.0000021029343,0.000004214053,0.000002272113,0.000011453396,0.00006931186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987421,0.00006555234,0.00025493797,0.00024454948,0.00032217946,0.00037065285],"domain_scores_gemma":[0.9989851,0.00012109034,0.000083198276,0.00057157635,0.00009513432,0.00014387444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042096397,0.0001446237,0.00019424355,0.00016802785,0.00009798195,0.00003716269,0.00040721727,0.000065710956,0.000017097796],"category_scores_gemma":[0.000049265105,0.00012911641,0.00009249891,0.00050690986,0.000059417467,0.0004697945,0.00015642002,0.0001552581,0.00010859914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004153058,0.00025752478,0.005398598,0.000010551456,0.000015458387,0.0000023045975,0.0002551575,0.000025618116,0.005334745,0.9863898,0.0017812103,0.0005248514],"study_design_scores_gemma":[0.00078679307,0.00017212734,0.0036528406,0.000060183727,0.000010093832,0.000014411818,0.00001221573,0.0009807509,0.018739969,0.9752314,0.000098004544,0.00024121348],"about_ca_topic_score_codex":0.00002172858,"about_ca_topic_score_gemma":8.9537004e-8,"teacher_disagreement_score":0.013405223,"about_ca_system_score_codex":0.000010435506,"about_ca_system_score_gemma":0.000025825751,"threshold_uncertainty_score":0.52652144},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9948173,0.00011875113,0.0004152285,0.0003517829,0.001896663,0.00008852562,8.001954e-7,0.0001395261,0.0021713877],"genre_scores_gemma":[0.9983683,0.00000397886,0.0013935443,0.00016311106,6.468754e-7,0.0000050676535,0.0000026731402,0.0000060469747,0.00005661495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989873,0.000067243454,0.0002015768,0.00023367612,0.00034789927,0.00016231518],"domain_scores_gemma":[0.9990535,0.000060635008,0.00009898818,0.0004908254,0.00016431864,0.00013173556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037849645,0.00009482496,0.0001394111,0.00008582003,0.000044803044,0.000024747715,0.00027122308,0.000052314623,0.0000029663875],"category_scores_gemma":[0.00008406802,0.000081632854,0.00004471259,0.0003162651,0.0000354566,0.00016439278,0.00009618233,0.00007862024,0.000082009974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008515843,0.0001530516,0.00038809184,0.0000028848563,0.000004681959,0.0000045235993,0.0002047269,0.00012850374,0.0010713598,0.98876315,0.008594578,0.00067590456],"study_design_scores_gemma":[0.00084848463,0.00044327823,0.0005358517,0.000039463397,0.0000037811476,0.0000021773965,0.000010179188,0.0046521877,0.0080563305,0.98510355,0.00020460185,0.00010009066],"about_ca_topic_score_codex":0.000026173331,"about_ca_topic_score_gemma":0.0000013468226,"teacher_disagreement_score":0.008389977,"about_ca_system_score_codex":0.000021405529,"about_ca_system_score_gemma":0.00004781458,"threshold_uncertainty_score":0.33288914},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91358715,0.0010899354,0.009954277,0.0049534854,0.014641503,0.0011736891,0.000035063662,0.00033460464,0.054230314],"genre_scores_gemma":[0.9983592,0.000017168097,0.0011367358,0.000057237667,0.0000047470417,0.00001313948,0.0000049954833,0.000007202214,0.0003995481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869853,0.00006739343,0.00023008174,0.00023334211,0.00045619783,0.0003144248],"domain_scores_gemma":[0.9986386,0.000078755,0.00009263181,0.0010444176,0.000060700688,0.00008490004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010553821,0.0001021001,0.00012663814,0.00006484692,0.00006353181,0.00012343739,0.0021773612,0.00003739435,0.0000027852907],"category_scores_gemma":[0.000113020804,0.000078866615,0.00003895704,0.00038129912,0.000037675276,0.0005622487,0.0009968713,0.000115834664,0.00003721164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042936185,0.00009412575,0.011162364,0.000004540869,0.000010338882,0.000021604841,0.00029283643,0.0000038294993,0.0000018160626,0.96474594,0.019368721,0.0042896206],"study_design_scores_gemma":[0.00214697,0.00007842379,0.016904922,0.000016270886,0.0000041918224,0.0000024995431,0.00016733159,0.007880217,0.00012766372,0.955012,0.017507534,0.00015195581],"about_ca_topic_score_codex":0.000095049734,"about_ca_topic_score_gemma":0.00031384427,"teacher_disagreement_score":0.084772095,"about_ca_system_score_codex":0.000046479803,"about_ca_system_score_gemma":0.000053579883,"threshold_uncertainty_score":0.40461153},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99424946,0.000048426646,0.0001267212,0.00011039634,0.001223859,0.00020726438,0.000012649447,0.00020655373,0.0038146644],"genre_scores_gemma":[0.9949681,9.769611e-7,0.004542735,0.00009966097,0.000028672142,0.000016722197,0.000019462548,0.000051137602,0.0002725117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986523,0.00010173826,0.0002504016,0.0002723329,0.0004092329,0.00031399896],"domain_scores_gemma":[0.9986359,0.0003209427,0.00014550054,0.00045666232,0.00025578073,0.00018520722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027507407,0.00021429137,0.0003267883,0.000063630716,0.00009008028,0.00005305072,0.00031000262,0.00013731702,0.000039504906],"category_scores_gemma":[0.0017799457,0.00017387648,0.000045616256,0.00027036847,0.00009597831,0.00015887151,0.000097957374,0.0002744957,0.000028271334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025591062,0.000087194356,0.0018229443,0.000005271238,0.00007947494,0.00003425302,0.00050088577,0.000006492805,0.000025371237,0.99155766,0.005783856,0.000071018185],"study_design_scores_gemma":[0.0019862086,0.00013041707,0.0009107388,0.000021672377,0.000045584045,0.000009383475,0.0001445325,0.000021400774,0.00091737974,0.994947,0.00062024954,0.00024540114],"about_ca_topic_score_codex":0.000011772988,"about_ca_topic_score_gemma":0.000044796176,"teacher_disagreement_score":0.0051636063,"about_ca_system_score_codex":0.0002124479,"about_ca_system_score_gemma":0.00015093839,"threshold_uncertainty_score":0.70904773},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84713364,0.0000144832875,0.000018450804,0.0012771635,0.0005595192,0.0003392389,0.0000019153379,0.000012452509,0.15064311],"genre_scores_gemma":[0.9976777,0.000001911768,0.00005730153,0.0002789568,0.000008649493,0.00004534443,0.0000016359329,0.000008991021,0.0019195143],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990273,0.000056546327,0.00012392124,0.0001211409,0.00034189146,0.00032920504],"domain_scores_gemma":[0.9994168,0.000050817274,0.000032891516,0.00035737501,0.0000093929975,0.00013269379],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000380397,0.00007614725,0.000095883486,0.000015231571,0.00005906824,0.000015139101,0.00039047402,0.000034484034,0.0026510812],"category_scores_gemma":[0.00006824916,0.00005186468,0.000034644192,0.00025205978,0.00009640152,0.00015695977,0.0004944281,0.00010526425,0.0003638025],"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.00006696036,0.0004882842,0.83348215,0.00002793445,0.000033868087,0.0000036951924,0.0033394624,0.00001529801,0.0011581056,0.04591188,0.05696152,0.058510844],"study_design_scores_gemma":[0.0004105321,0.00018925809,0.100303195,0.000004043548,0.000011548356,0.0000048371317,0.00023262808,0.000076234755,0.007672017,0.011491818,0.879402,0.00020192383],"about_ca_topic_score_codex":0.0003089323,"about_ca_topic_score_gemma":0.000030180407,"teacher_disagreement_score":0.82244045,"about_ca_system_score_codex":0.000050374692,"about_ca_system_score_gemma":0.000004870673,"threshold_uncertainty_score":0.9982606},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9921043,0.00008705406,0.000067627705,0.00017638686,0.0011781229,0.0002052442,0.000011304915,0.000112111986,0.0060578333],"genre_scores_gemma":[0.99758977,0.0000052148234,0.0015375087,0.00026474975,0.00004934268,0.000018001838,0.000008055657,0.00002896085,0.0004983802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988696,0.00015756206,0.00022880247,0.00017059469,0.00023166397,0.00034178875],"domain_scores_gemma":[0.9989257,0.000490477,0.00010140081,0.00025500913,0.00007139917,0.00015601292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006214259,0.00017857812,0.00020511186,0.00008136583,0.00021225189,0.00003190171,0.0001700484,0.0001113778,0.00017756579],"category_scores_gemma":[0.0004669381,0.00015735024,0.0000740711,0.00016697518,0.000082776925,0.0003611427,0.000054486205,0.00021065837,0.00023835155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000296723,0.00020433299,0.0022337588,0.000012868825,0.000027558413,0.0000023876125,0.0013229625,0.0000010208922,0.000965114,0.99336433,0.0017442896,0.000091703754],"study_design_scores_gemma":[0.00057873724,0.00013808373,0.0007085822,0.000063543535,0.000026940903,0.0000075072708,0.0005074007,0.0001303083,0.029393656,0.9678488,0.00028836247,0.00030807478],"about_ca_topic_score_codex":0.0000059749964,"about_ca_topic_score_gemma":6.5653836e-7,"teacher_disagreement_score":0.028428543,"about_ca_system_score_codex":0.00007465947,"about_ca_system_score_gemma":0.000039111044,"threshold_uncertainty_score":0.6416556},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8137047,0.0008488111,0.00085539714,0.0018907794,0.006673313,0.0007015035,0.0000057018083,0.00069321203,0.17462654],"genre_scores_gemma":[0.9591373,0.000038342874,0.0063623586,0.000098789846,0.00004561688,0.000079084246,0.0000022855381,0.00007725311,0.03415896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998713,0.00008135499,0.00030111277,0.00017206169,0.00040170643,0.00033075805],"domain_scores_gemma":[0.9982456,0.0007194665,0.000116902505,0.00056204206,0.00019341947,0.000162594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061765243,0.00015719503,0.00020803044,0.000022654618,0.00021023919,0.000114845396,0.000371774,0.0000640176,0.000024539868],"category_scores_gemma":[0.0017273477,0.00010929367,0.000066664696,0.00015854987,0.00014903936,0.00018303307,0.00015245611,0.00016669619,0.0004164872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006788108,0.000052728148,0.000045603436,0.000014728172,0.000020968175,0.000007013655,0.0003289036,0.0000012888916,0.000031205225,0.94356465,0.055839512,0.00008661242],"study_design_scores_gemma":[0.00048535524,0.00003369364,0.0000082818815,0.000016672975,0.000020716103,0.000009345341,0.00049006485,0.00008701104,0.0015128986,0.98726463,0.00992637,0.00014497932],"about_ca_topic_score_codex":0.000010433881,"about_ca_topic_score_gemma":0.00001815407,"teacher_disagreement_score":0.14543258,"about_ca_system_score_codex":0.00009257701,"about_ca_system_score_gemma":0.000059910046,"threshold_uncertainty_score":0.5353239},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9955327,0.00011831566,0.000011081852,0.00000900937,0.00085527817,0.00009951769,0.00000679781,0.00010732747,0.0032599617],"genre_scores_gemma":[0.9998289,0.000006422913,0.00007751744,0.0000058138503,0.0000049715673,0.00000856342,0.0000015279992,0.00002147413,0.000044838125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950886,0.000019186216,0.00012017008,0.00009859765,0.00009051911,0.00016266618],"domain_scores_gemma":[0.9996217,0.000056460933,0.000025776872,0.00020595366,0.000027710585,0.000062428255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016312787,0.000106982756,0.00016051049,0.000042417072,0.00003964344,0.000013236962,0.0000906178,0.000072902614,0.00002142204],"category_scores_gemma":[0.000010507324,0.00009163952,0.000022248902,0.00011153988,0.000043691784,0.000066333494,0.000014894863,0.00015197026,0.00000770854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024802352,0.000081430444,0.023715574,0.00016744941,0.00008951434,0.000011946982,0.0008387863,0.000034644738,0.0379314,0.9360259,0.0008473873,0.00023115044],"study_design_scores_gemma":[0.009234809,0.00096857076,0.07147679,0.00033050956,0.00020202281,0.00023095506,0.001137492,0.0043324605,0.18798326,0.70530635,0.017065726,0.0017310485],"about_ca_topic_score_codex":0.000004864447,"about_ca_topic_score_gemma":0.000012074827,"teacher_disagreement_score":0.23071955,"about_ca_system_score_codex":0.0000032343594,"about_ca_system_score_gemma":0.0000064810542,"threshold_uncertainty_score":0.37369514},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45790505,0.00008948014,0.5315294,0.00025517552,0.008893258,0.00026287558,0.0000032110709,0.00022964123,0.00083185564],"genre_scores_gemma":[0.96962804,0.0000021445965,0.02962763,0.00022419656,0.00011313175,0.0000396702,0.00001678855,0.000012250086,0.0003361234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906164,0.000109059765,0.00018284198,0.0002959483,0.00013221182,0.00021831032],"domain_scores_gemma":[0.9992254,0.0001212918,0.000058145706,0.0003627913,0.00015023304,0.00008218307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044430594,0.00011506838,0.00013096572,0.00005199248,0.00034839794,0.00019389862,0.00037545827,0.000058163285,0.000018960809],"category_scores_gemma":[0.00006800885,0.00011370769,0.00006152115,0.00019569785,0.000018497416,0.00034701676,0.00009734466,0.000077544544,0.00007330477],"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.000010518322,0.000050899027,0.000045441,0.000009056898,0.0000122592255,7.875143e-7,0.0001041576,0.00011665265,0.007214509,0.97883743,0.0019601462,0.011638121],"study_design_scores_gemma":[0.0023186968,0.0007642698,0.00018551084,0.00003102075,0.000030779694,0.000022301367,0.000035901685,0.4760974,0.032312687,0.4473486,0.040251695,0.000601144],"about_ca_topic_score_codex":0.000006002885,"about_ca_topic_score_gemma":7.6247323e-7,"teacher_disagreement_score":0.53148884,"about_ca_system_score_codex":0.00002893395,"about_ca_system_score_gemma":0.00003769882,"threshold_uncertainty_score":0.46368653},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99751323,0.00008125817,0.000006397856,0.00015918724,0.00031865746,0.00024743343,0.0000110279525,0.000028299793,0.0016345175],"genre_scores_gemma":[0.9991053,0.0000036960666,0.0007383481,0.000009977398,0.0000042512993,0.000021787717,0.0000031704542,0.000014063719,0.000099451536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991894,0.00008187619,0.00025293042,0.00016116803,0.00018557262,0.00012906059],"domain_scores_gemma":[0.998774,0.00024070298,0.00014487044,0.0005027652,0.0002739021,0.00006375093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058076467,0.00009722561,0.00025530232,0.000067613764,0.000029484108,0.0000037145503,0.00017339227,0.00005842362,0.000016347456],"category_scores_gemma":[0.00063280493,0.00008948833,0.00006147182,0.00030537543,0.00014721727,0.00011930271,0.00004961596,0.00008419104,0.000012577934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017300825,0.00049422286,0.0022293457,0.000061426,0.000033379292,3.8222308e-7,0.0006281681,4.2226551e-7,0.00550634,0.9888844,0.0020851123,0.000059528942],"study_design_scores_gemma":[0.00053799147,0.00007542225,0.0009000832,0.000016697377,0.000031258274,0.0000015474055,0.00015478082,0.0000040960563,0.08898764,0.9088759,0.00033093384,0.000083663785],"about_ca_topic_score_codex":0.000012963115,"about_ca_topic_score_gemma":0.0000013086343,"teacher_disagreement_score":0.083481304,"about_ca_system_score_codex":0.000011593943,"about_ca_system_score_gemma":0.000055715744,"threshold_uncertainty_score":0.3649228},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99229956,0.000025894804,0.0011792944,0.00036914521,0.0004253691,0.00023809056,0.0000017150633,0.000015916617,0.005445027],"genre_scores_gemma":[0.99922985,0.0000085880765,0.0005868564,0.00002286987,0.0000021949706,0.000018472132,0.0000011898497,0.000008038823,0.00012193446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860305,0.00024640284,0.00025791922,0.00022869272,0.00047978805,0.00018416053],"domain_scores_gemma":[0.99836445,0.00067325676,0.00015223384,0.00046681872,0.0002794995,0.00006376885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012582554,0.00010449075,0.00018212844,0.000121378915,0.0000381736,0.00002556471,0.00051059085,0.0000566577,0.000009253243],"category_scores_gemma":[0.000439221,0.00008203161,0.000039449016,0.00060591154,0.00018348485,0.00037233313,0.00018391789,0.00015409975,0.00002042745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048667935,0.0001242209,0.015259153,0.0000109616485,0.000007739463,0.0000019744232,0.0011128794,0.000008546554,0.00031516777,0.9809955,0.0002480432,0.0018671879],"study_design_scores_gemma":[0.0010714993,0.000069602786,0.008043702,0.000033227254,0.0000025347206,0.0000048584307,0.00011618285,0.0013054806,0.010973745,0.97824454,0.00004828734,0.00008630815],"about_ca_topic_score_codex":0.000020524476,"about_ca_topic_score_gemma":0.000009570522,"teacher_disagreement_score":0.010658577,"about_ca_system_score_codex":0.000043408134,"about_ca_system_score_gemma":0.000047668585,"threshold_uncertainty_score":0.33451518},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907199,0.000021128344,0.000034005792,0.00093932304,0.0040969863,0.00015207744,6.83164e-7,0.00011852125,0.003917369],"genre_scores_gemma":[0.9984538,0.000001421425,0.001274996,0.00017912041,0.0000016334145,0.000013789541,4.1055145e-7,0.000009706471,0.00006509973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988622,0.000053065265,0.00022324518,0.0002848864,0.00033303825,0.00024358205],"domain_scores_gemma":[0.99869764,0.00027955233,0.00011530875,0.0006938573,0.00014150776,0.00007215762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000639671,0.00012631867,0.0001474893,0.000075456155,0.00022410744,0.00010309892,0.0007241969,0.00006669844,0.000007987655],"category_scores_gemma":[0.00043819463,0.000084093954,0.00007650974,0.00042691192,0.00009785579,0.00014171704,0.00022080765,0.0003876447,0.000028524695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000420643,0.00007306672,0.0005726424,0.000006145533,0.000008203747,0.0000040360437,0.00042613145,0.000011919386,0.016718768,0.9801471,0.00049576996,0.0015319999],"study_design_scores_gemma":[0.00041814827,0.00016063647,0.0017309311,0.000057039262,0.000006262536,0.000009437443,0.000013895035,0.0050402856,0.025147164,0.96697253,0.00028383086,0.00015982978],"about_ca_topic_score_codex":0.00007053215,"about_ca_topic_score_gemma":0.000004935472,"teacher_disagreement_score":0.013174571,"about_ca_system_score_codex":0.000008371266,"about_ca_system_score_gemma":0.000052475723,"threshold_uncertainty_score":0.3429252},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.868159,0.00017627404,0.10735955,0.00010977437,0.008105426,0.00029365183,0.000004113631,0.0004955058,0.015296724],"genre_scores_gemma":[0.9937162,0.000007069688,0.0059149186,0.00017909582,0.000009550463,0.000033197695,0.0000011066825,0.000011933932,0.00012693858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912345,0.0000324408,0.00015166838,0.000288943,0.00012668643,0.0002768265],"domain_scores_gemma":[0.9991937,0.000087739514,0.000059448816,0.0005185026,0.000057563997,0.00008302485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032177672,0.0001245765,0.00013525279,0.000076564924,0.00016130824,0.00009174807,0.00082504883,0.0000537275,0.000026818328],"category_scores_gemma":[0.000020754866,0.00012526855,0.00011955771,0.00022306065,0.000049548424,0.00036925057,0.00018499854,0.00007964437,0.00003766871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034114677,0.00010237986,0.0015741778,0.000007914457,0.000021980251,0.00000979864,0.0005999084,5.691991e-7,0.00021333876,0.9941142,0.00083042623,0.002491153],"study_design_scores_gemma":[0.00053327694,0.00030759178,0.00116048,0.000017225215,0.000007342306,0.0000060000984,0.000011630794,0.0012289834,0.0031340509,0.9861076,0.007286948,0.00019885767],"about_ca_topic_score_codex":0.000018537938,"about_ca_topic_score_gemma":0.0000013151389,"teacher_disagreement_score":0.12555721,"about_ca_system_score_codex":0.000019886013,"about_ca_system_score_gemma":0.0000271764,"threshold_uncertainty_score":0.5108303},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9929776,0.0017317507,0.000067496396,0.0001527341,0.0034566931,0.00010582016,7.699869e-7,0.00013475258,0.001372368],"genre_scores_gemma":[0.9955892,0.000035152185,0.0042287684,0.00006499797,0.0000010705962,0.0000036924837,0.0000015542621,0.00001006875,0.00006551495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988699,0.00007016048,0.00028908552,0.0002272012,0.00022825947,0.00031541317],"domain_scores_gemma":[0.9991046,0.0000946244,0.000119122196,0.00041863348,0.00010390841,0.00015907601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005809294,0.00012745293,0.00019825206,0.00012523738,0.00010330917,0.000032511376,0.000287915,0.000094075265,0.000010647081],"category_scores_gemma":[0.000062952226,0.00011787203,0.00005614618,0.0004842233,0.000082765524,0.00035856452,0.00020159339,0.00014469564,0.000022158572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004422025,0.00011292735,0.010778333,0.000008640754,0.000025707386,0.0000018513824,0.00057076255,0.000002878877,0.0062599317,0.98067063,0.00044187828,0.0011220649],"study_design_scores_gemma":[0.0011453602,0.00011157216,0.00490768,0.000049052564,0.000021359649,0.000022661556,0.000017212684,0.0009345308,0.009897864,0.9823668,0.00028349485,0.00024241932],"about_ca_topic_score_codex":0.000027901373,"about_ca_topic_score_gemma":3.6792645e-7,"teacher_disagreement_score":0.005870653,"about_ca_system_score_codex":0.000008565923,"about_ca_system_score_gemma":0.000025994796,"threshold_uncertainty_score":0.48066816},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98624367,0.00022817896,0.0043802755,0.0005816038,0.001021732,0.00078624894,0.000009384396,0.00031004264,0.0064388653],"genre_scores_gemma":[0.99510425,0.0000184392,0.004036249,0.00013249619,0.000004307046,0.00010758182,0.0000033784913,0.000025614077,0.00056767865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755925,0.00018938651,0.00039866057,0.0005268613,0.0005736151,0.0007522458],"domain_scores_gemma":[0.9977938,0.00026108642,0.00018653455,0.0011720238,0.0003363207,0.00025022426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062631717,0.00023566575,0.00039341903,0.00031919,0.00019022387,0.00011039576,0.0016959984,0.00008688196,0.0001072296],"category_scores_gemma":[0.00013032179,0.00022236191,0.00014935686,0.0012338879,0.00024808958,0.0009583664,0.0006516697,0.00029586974,0.00023996146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104656,0.00015395618,0.014313982,0.000018197743,0.0000322789,0.0000051169086,0.00028913326,0.0000061967717,0.0062748794,0.9768821,0.0009844105,0.0010292834],"study_design_scores_gemma":[0.0013842733,0.00022871031,0.020013997,0.00003166749,0.0000053844096,0.0000053586514,0.000034648474,0.0027201022,0.0055813855,0.9635137,0.006206973,0.00027381483],"about_ca_topic_score_codex":0.00004800607,"about_ca_topic_score_gemma":0.000007620178,"teacher_disagreement_score":0.013368415,"about_ca_system_score_codex":0.000043185264,"about_ca_system_score_gemma":0.00006240091,"threshold_uncertainty_score":0.9067655},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99585533,0.00012522779,0.0000707202,0.0002330323,0.0004505144,0.00024628517,0.000011954473,0.00013935576,0.0028675965],"genre_scores_gemma":[0.9966751,0.000013632995,0.003074568,0.00008141271,0.000021102993,0.0000031904945,0.000032203487,0.000027113974,0.00007172027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870205,0.00008721633,0.00041455153,0.00023437184,0.00028684584,0.00027494456],"domain_scores_gemma":[0.9987855,0.00029737997,0.00015346099,0.00040598674,0.00023067635,0.00012699819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003758252,0.00022546308,0.00047981908,0.00009673297,0.00012802186,0.00003712649,0.00027838067,0.00016883874,0.00011802083],"category_scores_gemma":[0.000109464534,0.00020305178,0.00007823601,0.00035845712,0.00010494017,0.00014313929,0.00004348877,0.0002094528,0.00006633862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004103796,0.00030833093,0.008715951,0.000043212636,0.00007388235,0.000014914386,0.0005461592,0.0000012515999,0.0072911675,0.9801643,0.0022542516,0.00054557045],"study_design_scores_gemma":[0.0010313604,0.00041213605,0.003558291,0.00010585595,0.00011247236,0.00000644967,0.00007724835,0.00010796571,0.08434099,0.9097875,0.00018073054,0.0002790149],"about_ca_topic_score_codex":0.000012185982,"about_ca_topic_score_gemma":6.5161146e-7,"teacher_disagreement_score":0.07704982,"about_ca_system_score_codex":0.00005338686,"about_ca_system_score_gemma":0.000059811246,"threshold_uncertainty_score":0.8280211},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99511176,0.000027964594,0.0025715318,0.0000026789453,0.00044565782,0.00014141123,0.0000116385545,0.000019809622,0.0016675157],"genre_scores_gemma":[0.99792624,0.000008184847,0.0019381022,0.0000022759532,0.0000018721298,0.000005122956,0.0000037979946,0.000009156827,0.000105248546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992942,0.00003718745,0.00033884757,0.000094519164,0.00013943676,0.000095810115],"domain_scores_gemma":[0.9993273,0.00014560399,0.00020628961,0.00016726709,0.00011108716,0.000042460462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012459287,0.00007536549,0.00020558064,0.00008773409,0.000046016874,0.0000062548456,0.000088571185,0.00004789045,0.000043257693],"category_scores_gemma":[0.00023155085,0.0000711832,0.000044774777,0.00012763691,0.00012710142,0.000113098,0.000059831636,0.000044813005,0.0000022937058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009361423,0.00014236727,0.003583095,0.00010103914,0.000022669115,3.0629957e-7,0.0014164463,0.0000031313286,0.0010978428,0.9934937,0.00007479465,0.00005526097],"study_design_scores_gemma":[0.00062190247,0.00007222491,0.0021921427,0.00007190831,0.000037269492,7.7317685e-7,0.00083163765,0.0013154695,0.0020159297,0.9927436,0.000007053602,0.000090069356],"about_ca_topic_score_codex":0.00012930513,"about_ca_topic_score_gemma":0.000023880604,"teacher_disagreement_score":0.0028144468,"about_ca_system_score_codex":0.000017705263,"about_ca_system_score_gemma":0.000017424261,"threshold_uncertainty_score":0.29027668},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.993077,0.0011404149,0.00019856966,0.000011740062,0.0041037234,0.00025276543,0.000009492626,0.00009968408,0.001106621],"genre_scores_gemma":[0.999595,0.000027813696,0.00012248608,0.000017486835,0.000047791495,0.000068968744,0.000006382882,0.000035877623,0.0000782212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992965,0.000055873592,0.00018511145,0.000081917824,0.000105523184,0.00027506062],"domain_scores_gemma":[0.9993818,0.00010711573,0.000033371074,0.00036492912,0.000033680884,0.000079130514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041771994,0.00012107365,0.00017458842,0.000030258068,0.00009390218,0.000021161371,0.00020875719,0.00007428136,0.0000659307],"category_scores_gemma":[0.000009995062,0.00009201148,0.000118784636,0.00013491392,0.000050367777,0.00017600646,0.000009337913,0.00007614984,0.000021944732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017319366,0.000055295743,0.014883542,0.00004852312,0.00011735253,1.9234845e-7,0.0008079527,0.00011514474,0.0038200144,0.97733593,0.002612416,0.0001863315],"study_design_scores_gemma":[0.0034314573,0.00012095155,0.022457985,0.00004946218,0.00021269373,0.00003781451,0.00069048617,0.004011361,0.030718692,0.88008887,0.057442613,0.0007376425],"about_ca_topic_score_codex":0.000018467548,"about_ca_topic_score_gemma":0.0000010349343,"teacher_disagreement_score":0.09724707,"about_ca_system_score_codex":0.000014001735,"about_ca_system_score_gemma":0.0000051835136,"threshold_uncertainty_score":0.37521195},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938006,0.00016512722,0.0014980222,0.00007685484,0.0018405702,0.0002361389,0.00008038988,0.00004502501,0.0022572754],"genre_scores_gemma":[0.9991513,0.000003546657,0.00023296547,0.000034575212,0.00013307232,0.000021257982,0.00011439508,0.000033331107,0.0002755466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989715,0.000048182406,0.00031111445,0.00020612842,0.00020592927,0.00025712355],"domain_scores_gemma":[0.9990769,0.000047497677,0.00017892617,0.00035827086,0.00017725259,0.00016112161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015996982,0.00017221735,0.0002844386,0.000054593256,0.00008152922,0.000027315486,0.00022491576,0.000050868537,0.000039402992],"category_scores_gemma":[0.000012533511,0.00017269183,0.0001226771,0.00018225505,0.00003313712,0.00025953067,0.00008485586,0.00009379987,0.00006797972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010354546,0.00024490355,0.0067325,0.0000075625276,0.000059893035,7.178336e-7,0.00022692834,0.00006359801,0.0044327,0.9828941,0.0044697896,0.0008569247],"study_design_scores_gemma":[0.0012910048,0.000088956804,0.00027484546,0.0000170688,0.000031384363,3.6649948e-7,0.00011001195,0.005770241,0.047210667,0.94317406,0.001801661,0.00022975575],"about_ca_topic_score_codex":0.0002753731,"about_ca_topic_score_gemma":0.0000035264272,"teacher_disagreement_score":0.042777967,"about_ca_system_score_codex":0.000025740985,"about_ca_system_score_gemma":0.00010511036,"threshold_uncertainty_score":0.70421684},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917122,0.000338552,0.00045156284,0.0005089466,0.0024855467,0.00029774627,0.0000029845337,0.0003587196,0.0038437175],"genre_scores_gemma":[0.995968,0.000039146,0.0024750654,0.0006358735,0.000016611548,0.000038271563,0.0000034926632,0.000029326568,0.00079420704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801445,0.00006612022,0.0002839676,0.0006604905,0.00038457854,0.00059040566],"domain_scores_gemma":[0.9985519,0.00019934762,0.00013531251,0.00076401304,0.00010312847,0.00024627606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036900848,0.0002863276,0.00029428178,0.0001162236,0.0002654912,0.00053310243,0.0008950048,0.00012291034,0.00012818442],"category_scores_gemma":[0.00006119639,0.0002650726,0.00006653802,0.00040107715,0.00009135628,0.00097401306,0.0004819816,0.00023399404,0.00067049515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007870087,0.0001720395,0.0021569314,0.000029370392,0.000040315448,0.000037732254,0.0015072232,0.000025750125,0.0017958548,0.949766,0.022210117,0.022250839],"study_design_scores_gemma":[0.0016168387,0.00039545613,0.009301138,0.00009617758,0.000017647317,0.00006935499,0.00018504959,0.03580778,0.0073588113,0.9201407,0.024158547,0.0008524881],"about_ca_topic_score_codex":0.00023192144,"about_ca_topic_score_gemma":0.0000010707978,"teacher_disagreement_score":0.03578203,"about_ca_system_score_codex":0.000075993,"about_ca_system_score_gemma":0.000037519723,"threshold_uncertainty_score":0.99998015},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901834,0.00034058813,0.0058447514,0.0004832539,0.00071391615,0.00060471985,0.0000075692,0.00021324112,0.0016085221],"genre_scores_gemma":[0.9772886,0.000028110142,0.022436354,0.00007498617,0.000006809304,0.00005511856,0.000004903016,0.000032438267,0.00007267827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971009,0.00024528333,0.00057786383,0.00058884994,0.0007384032,0.00074869324],"domain_scores_gemma":[0.997161,0.00056271855,0.0002544141,0.0013132711,0.00041061343,0.0002980177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004563107,0.0002870083,0.0004569763,0.0004095847,0.00027381192,0.00018722356,0.0020365065,0.00011367715,0.000056678236],"category_scores_gemma":[0.000115379706,0.00028830313,0.00016874561,0.0010923779,0.0003197715,0.0013952509,0.0008744822,0.00034518453,0.0001783352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024350671,0.00020052318,0.0033035702,0.000055320008,0.00006643147,0.000009638504,0.0010364081,0.000026690315,0.041894786,0.9426763,0.00022987048,0.010476121],"study_design_scores_gemma":[0.0008518792,0.00030347044,0.011002547,0.000098255565,0.000007296223,0.0000073237566,0.000059080543,0.0041874787,0.019985443,0.96257275,0.000577206,0.00034727683],"about_ca_topic_score_codex":0.00028955349,"about_ca_topic_score_gemma":0.000025450094,"teacher_disagreement_score":0.021909343,"about_ca_system_score_codex":0.00011012377,"about_ca_system_score_gemma":0.00009598223,"threshold_uncertainty_score":0.9999569},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917128,0.0002548506,0.0051448075,0.0001572386,0.00079015765,0.0003019717,0.0000069482476,0.00009352793,0.001537712],"genre_scores_gemma":[0.9972617,0.00002509359,0.002533945,0.000045513665,0.000007307724,0.000036761197,0.000009273372,0.000014750548,0.00006567641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980554,0.00025973542,0.0004063989,0.00029461287,0.00042314036,0.0005607376],"domain_scores_gemma":[0.9985509,0.00030233813,0.00015052033,0.00063590636,0.00020214698,0.00015816982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008619223,0.00017175924,0.00028126562,0.00039487696,0.00007021814,0.000049784136,0.00073524535,0.00007778128,0.000026923011],"category_scores_gemma":[0.00012839536,0.00016805291,0.00008940969,0.0023904385,0.0001363414,0.0011445014,0.0002455879,0.00023416504,0.00006759336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031520005,0.00033649517,0.08464302,0.000019802867,0.00001622117,0.0000050664426,0.0008480102,0.000017961678,0.0047042505,0.9072443,0.000094416304,0.0020388854],"study_design_scores_gemma":[0.0022933113,0.00015490403,0.08812599,0.0000875305,0.0000068688123,0.00001315535,0.000039900213,0.0054048854,0.016384276,0.88554376,0.0015648534,0.0003805546],"about_ca_topic_score_codex":0.000030742744,"about_ca_topic_score_gemma":0.000008674747,"teacher_disagreement_score":0.021700578,"about_ca_system_score_codex":0.00004312654,"about_ca_system_score_gemma":0.00002814984,"threshold_uncertainty_score":0.6852999},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9701783,0.00077444024,0.000094103685,0.001593371,0.005458508,0.001003765,0.000013030281,0.0003387038,0.020545742],"genre_scores_gemma":[0.98713857,0.00021987225,0.0065329443,0.00041896652,0.00010404937,0.00014248771,0.000015007517,0.00017405178,0.005254039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968872,0.00016604768,0.0007867889,0.0006575644,0.00060219684,0.0009001829],"domain_scores_gemma":[0.99677014,0.0007871573,0.00027132148,0.0014841929,0.00034459197,0.0003425852],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00026389596,0.00057902525,0.0006997914,0.00015167997,0.00026703597,0.00035562125,0.00085061253,0.00044006336,0.00353441],"category_scores_gemma":[0.0007977978,0.00059604016,0.00023098574,0.00041789789,0.00023817059,0.0006658625,0.00044025652,0.0007632824,0.008335373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004787319,0.00040828116,0.0033204104,0.00024540914,0.0001240409,0.000022900127,0.00042005486,3.3754768e-7,0.00059577374,0.96913564,0.023710841,0.002011528],"study_design_scores_gemma":[0.0011551444,0.00015446599,0.003215959,0.0001983869,0.00008169309,0.000014576932,0.00014415702,0.00005923083,0.0034957,0.9814317,0.009392839,0.0006561234],"about_ca_topic_score_codex":0.00006738473,"about_ca_topic_score_gemma":0.0000021609799,"teacher_disagreement_score":0.016960246,"about_ca_system_score_codex":0.0002225916,"about_ca_system_score_gemma":0.00011133124,"threshold_uncertainty_score":0.9996491},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.962929,0.00035204343,0.0037208877,0.0054589952,0.006726368,0.00027139427,0.000002393298,0.00037112608,0.020167775],"genre_scores_gemma":[0.99704355,0.000008552736,0.00090760365,0.0018091595,0.00001583583,0.000017466502,8.619267e-7,0.0000083142095,0.00018864889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998991,0.00012323563,0.000110964706,0.00018825849,0.00023419454,0.0003523469],"domain_scores_gemma":[0.998556,0.0004952729,0.00006261663,0.0007421291,0.000053471336,0.000090496615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005441409,0.00011631778,0.000094607756,0.000032506454,0.00018174676,0.00008552338,0.0010342067,0.000044661992,0.000046823854],"category_scores_gemma":[0.00018741486,0.000076689976,0.000040143615,0.00038286418,0.000058425587,0.00041417245,0.00019299713,0.00016475063,0.0005757854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014631146,0.000055055887,0.0001514905,0.0000013022307,0.000006318393,0.0000025202203,0.00053136563,0.0000012278556,0.00015025161,0.99005145,0.0069370526,0.0021104866],"study_design_scores_gemma":[0.0001423622,0.000058295827,0.00074968673,0.000017552162,0.0000026446846,0.000009912608,0.000047711033,0.0006589216,0.0028092712,0.9910448,0.0043236366,0.0001351893],"about_ca_topic_score_codex":0.000009908432,"about_ca_topic_score_gemma":2.441461e-7,"teacher_disagreement_score":0.03411454,"about_ca_system_score_codex":0.000043326072,"about_ca_system_score_gemma":0.000030863244,"threshold_uncertainty_score":0.7400748},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9964473,0.00036832772,0.00020398312,0.000020667892,0.0002627809,0.00028701776,0.000004522811,0.00012359138,0.002281763],"genre_scores_gemma":[0.9991432,0.000014561592,0.0006718661,0.000023842978,0.0000055187147,0.000019840716,0.0000019617305,0.00002083143,0.000098402554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993807,0.000016988006,0.00016165913,0.00013410734,0.000091602145,0.00021496303],"domain_scores_gemma":[0.999546,0.00014487086,0.00003591679,0.00017584609,0.000032874275,0.0000644955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021220051,0.00012731421,0.00021101706,0.00004113776,0.000044797223,0.000021933882,0.00010248507,0.00006251476,0.0000041185435],"category_scores_gemma":[0.000019508358,0.00011469135,0.000035764384,0.00012970694,0.000026764366,0.00010230984,0.000008309865,0.000064501924,0.0000014159965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014817173,0.000116077994,0.0013320905,0.00026711848,0.00013954697,0.0000060902134,0.00091246096,0.00057183206,0.055341534,0.93809044,0.0026866533,0.00038797842],"study_design_scores_gemma":[0.0046932185,0.0022849545,0.0061240485,0.00031223646,0.0001293376,0.000031865107,0.0002960999,0.0036168105,0.04783977,0.9277212,0.006247004,0.00070345926],"about_ca_topic_score_codex":0.000005352566,"about_ca_topic_score_gemma":0.0000016068526,"teacher_disagreement_score":0.010369246,"about_ca_system_score_codex":0.0000124332,"about_ca_system_score_gemma":0.0000045041224,"threshold_uncertainty_score":0.46769774},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9888307,0.000022044494,0.0040902165,0.0006080356,0.004847041,0.00017231841,0.000007747974,0.0000719713,0.0013499213],"genre_scores_gemma":[0.9929072,0.000004004747,0.006912545,0.00007430606,0.00000820794,0.000005805876,0.0000028370844,0.0000043591044,0.000080734986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913293,0.00005261826,0.00016288258,0.00022946189,0.00029030253,0.00013177887],"domain_scores_gemma":[0.99859613,0.00007218774,0.00012704154,0.0010624725,0.00009645591,0.000045683137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016171036,0.00007513442,0.00009669657,0.000025820942,0.000111627,0.000054370863,0.0011533647,0.00005013542,0.000011245365],"category_scores_gemma":[0.00009435567,0.000051199448,0.000050298095,0.00036909757,0.00006281562,0.00040900247,0.0005044743,0.00018907893,0.000013988723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022198237,0.00006058553,0.0048521925,0.0000048583806,0.0000046070413,0.0000034221162,0.0002595585,0.0000040106984,0.041478463,0.94223326,0.0020273072,0.009069505],"study_design_scores_gemma":[0.0006372242,0.000075439144,0.05984467,0.000043559794,0.000007485531,0.000028082577,0.000024819125,0.030816413,0.06271724,0.8423649,0.003226645,0.00021351154],"about_ca_topic_score_codex":0.000111190006,"about_ca_topic_score_gemma":0.0000043246137,"teacher_disagreement_score":0.09986835,"about_ca_system_score_codex":0.000009328099,"about_ca_system_score_gemma":0.000059374695,"threshold_uncertainty_score":0.21432577},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99218285,0.00018516352,0.0022754995,0.002430862,0.0007989967,0.0004182049,0.0000016383252,0.000047423935,0.0016593446],"genre_scores_gemma":[0.99907285,0.00003135694,0.00045072043,0.00034648238,0.0000063580505,0.000016228018,2.7348352e-7,0.000013796437,0.000061932195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975114,0.00092374056,0.00023776844,0.00035406524,0.000629275,0.0003437505],"domain_scores_gemma":[0.9952564,0.0029343285,0.00018459417,0.0014542891,0.00010529244,0.00006508706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025891322,0.0001722652,0.00020427526,0.000054599637,0.0005072784,0.00011810609,0.0023567844,0.000043201442,0.0000043789405],"category_scores_gemma":[0.000519958,0.000080493475,0.0001335081,0.0007635629,0.0007705547,0.00017958427,0.0007214853,0.00040240263,0.000006188306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027485965,0.000033158416,0.0018504069,0.0000071862933,0.000023535173,6.864139e-7,0.00042840154,0.00007433712,0.00020526678,0.9964943,0.00011519936,0.0007400201],"study_design_scores_gemma":[0.0008807868,0.00008293416,0.0051492047,0.00003851952,0.0000057211646,0.000003944672,0.000055125805,0.0063798036,0.0013168198,0.98581743,0.00016823973,0.00010145236],"about_ca_topic_score_codex":0.00006344041,"about_ca_topic_score_gemma":0.000008643064,"teacher_disagreement_score":0.010676868,"about_ca_system_score_codex":0.000015843902,"about_ca_system_score_gemma":0.000017588214,"threshold_uncertainty_score":0.4379531},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900295,0.000058062287,0.0005985237,0.000032139385,0.002219303,0.0005064108,0.000015377072,0.00006795202,0.0064727245],"genre_scores_gemma":[0.9980068,0.000010120183,0.0015617575,0.000007897758,0.00003611663,0.000025913841,0.0000031505438,0.000046380166,0.00030184077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781394,0.00012731062,0.0008637413,0.00030821707,0.0005543218,0.00033244616],"domain_scores_gemma":[0.9975614,0.000992657,0.00053654495,0.00052103295,0.00026630357,0.00012208371],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069510535,0.00026080068,0.00079327804,0.0001713031,0.00009204671,0.00003616633,0.00033495305,0.00015952025,0.00005570413],"category_scores_gemma":[0.0012956068,0.00025392673,0.00013130937,0.00021477113,0.00051798753,0.00020059252,0.0002816999,0.00018781034,0.000008773987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007082251,0.00045125795,0.0005921132,0.0006282885,0.00005226702,0.0000019783436,0.00066719484,0.0000029041921,0.0012898972,0.995168,0.0009726853,0.0001026077],"study_design_scores_gemma":[0.0028888022,0.00034449802,0.00034839567,0.00014810389,0.00009357931,0.0000075326925,0.00015595519,0.0002910301,0.018564424,0.97680646,0.000119331504,0.00023191175],"about_ca_topic_score_codex":0.000016931885,"about_ca_topic_score_gemma":0.0000040186324,"teacher_disagreement_score":0.018361548,"about_ca_system_score_codex":0.00006562056,"about_ca_system_score_gemma":0.00007037626,"threshold_uncertainty_score":0.9999913},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18189187,0.0019052089,0.49097535,0.01530236,0.0060409214,0.000999962,0.0000047151534,0.012326784,0.29055282],"genre_scores_gemma":[0.94374996,0.000015326546,0.055059664,0.0009316355,0.0000056492213,0.0000067027495,0.0000015966448,0.000008779068,0.00022069708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985838,0.000034215715,0.00022938335,0.0004285197,0.00036758592,0.00035652204],"domain_scores_gemma":[0.99889517,0.000025979863,0.00010057693,0.0007010456,0.00015648296,0.000120747965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024836813,0.00017658036,0.00017095885,0.00016118052,0.00012165892,0.0006727571,0.0016746747,0.000076574666,0.0000043810082],"category_scores_gemma":[0.000064381136,0.00017249491,0.0000812524,0.00075858994,0.00007443799,0.0017550021,0.00018698792,0.00016316042,0.000065084656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014760252,0.00010047003,0.0001090855,0.0000042234064,0.000005324636,0.00005245793,0.00006314636,7.987057e-7,0.0020193544,0.9158599,0.0025511442,0.07923263],"study_design_scores_gemma":[0.00018056248,0.00016190408,0.0010459091,0.000030954518,0.000003572052,0.000028605124,0.0000026617347,0.0006624942,0.012118396,0.9841599,0.0013735272,0.00023151493],"about_ca_topic_score_codex":0.0000070209976,"about_ca_topic_score_gemma":4.9894476e-7,"teacher_disagreement_score":0.7618581,"about_ca_system_score_codex":0.00003790868,"about_ca_system_score_gemma":0.000097959666,"threshold_uncertainty_score":0.70341384},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99606866,0.000161335,0.000021374653,0.000015029876,0.0014783384,0.00007901747,0.000008841624,0.000107143474,0.0020602827],"genre_scores_gemma":[0.9997047,0.000013714137,0.0002363693,0.0000063356024,0.0000038888134,0.000010579503,0.0000054432535,0.000014975648,0.0000039546762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995544,0.00002131444,0.00015724535,0.00008790994,0.00006723581,0.00011188522],"domain_scores_gemma":[0.9996304,0.00006497785,0.00002381089,0.00019142879,0.000026223626,0.000063150575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010840551,0.000091286405,0.00014402281,0.00007352589,0.0000672085,0.000014476495,0.000101715836,0.000060440154,0.000016617882],"category_scores_gemma":[0.0000074381583,0.00009386159,0.000042173448,0.00011919882,0.000081402504,0.00006854552,0.000020197842,0.00013702583,0.000008985704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023108207,0.00002081884,0.00418808,0.00005159111,0.00002619643,0.0000016457518,0.0003448182,0.000012782517,0.13738973,0.8574007,0.00013894388,0.0004223815],"study_design_scores_gemma":[0.0003835428,0.000036184236,0.016254487,0.00002855753,0.000015624335,0.000013161462,0.00009462754,0.000679861,0.011041644,0.97038776,0.00090892176,0.00015561799],"about_ca_topic_score_codex":0.0000192027,"about_ca_topic_score_gemma":0.000021444444,"teacher_disagreement_score":0.1263481,"about_ca_system_score_codex":0.0000034963666,"about_ca_system_score_gemma":0.0000032181683,"threshold_uncertainty_score":0.38275647},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68908775,0.0022819713,0.19301589,0.0013822347,0.033117265,0.0011650122,0.000011765531,0.0028535402,0.0770846],"genre_scores_gemma":[0.9464302,0.00002117558,0.053241443,0.00011282345,0.000014307657,0.000011215001,0.000003732355,0.0000106952775,0.00015441254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989434,0.000037100515,0.00015828999,0.00038904863,0.00021905483,0.00025312087],"domain_scores_gemma":[0.99886376,0.00002103122,0.000066660745,0.00085586554,0.00010396704,0.000088702596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021524949,0.000118083364,0.00011770715,0.000086497246,0.0001451609,0.0000756271,0.0010175944,0.000045284334,0.000022721157],"category_scores_gemma":[0.00003679007,0.0001029229,0.000036610913,0.00045844106,0.000031996493,0.00072429056,0.00044397992,0.00012703493,0.00012686386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029403034,0.00010996192,0.0006044568,0.000006592005,0.0000076537335,0.00001877737,0.0005678297,4.3876085e-7,0.00025719457,0.9855598,0.0037907544,0.009073575],"study_design_scores_gemma":[0.000501599,0.00013045005,0.0071854056,0.000028036782,0.0000059203435,0.000018187438,0.000023274366,0.002500065,0.011215468,0.96938413,0.008692587,0.00031488453],"about_ca_topic_score_codex":0.00005680428,"about_ca_topic_score_gemma":4.8089436e-7,"teacher_disagreement_score":0.2573425,"about_ca_system_score_codex":0.000013307254,"about_ca_system_score_gemma":0.000041539424,"threshold_uncertainty_score":0.41970742},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96077853,0.00005713633,0.031099182,0.00010049641,0.002047394,0.0006959239,0.00000831913,0.00012697159,0.005086025],"genre_scores_gemma":[0.9571351,0.000009836385,0.042327967,0.000056640805,0.0000046670416,0.000095368676,0.0000039535444,0.000020078733,0.00034637985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850744,0.00012033439,0.00028595485,0.0003825448,0.00032742944,0.00037630947],"domain_scores_gemma":[0.99846125,0.00019539092,0.00015260081,0.0007289265,0.0003536805,0.000108158376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062316586,0.00015492196,0.00023498721,0.00015616034,0.00011780802,0.00004230186,0.00093185744,0.00007626718,0.00005614803],"category_scores_gemma":[0.00013484368,0.00015145709,0.00015476742,0.00053405814,0.00016284856,0.0005499091,0.00020080467,0.00010458523,0.00002911361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100561396,0.00017106651,0.00079311617,0.000019881754,0.00003333247,0.000005925436,0.0007864315,7.728275e-7,0.00207729,0.99405617,0.00041035764,0.0015451018],"study_design_scores_gemma":[0.0016791025,0.00018389735,0.0011398927,0.000013261253,0.000007828522,0.000007725805,0.000022760882,0.00080241915,0.011436854,0.9839261,0.00060464867,0.00017550345],"about_ca_topic_score_codex":0.00002163652,"about_ca_topic_score_gemma":0.000002635599,"teacher_disagreement_score":0.011228785,"about_ca_system_score_codex":0.00003650396,"about_ca_system_score_gemma":0.000060098293,"threshold_uncertainty_score":0.6176241},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930737,0.0004306696,0.0049902108,0.000068989306,0.0007919679,0.00010321312,0.0000012496896,0.00005221923,0.00048776885],"genre_scores_gemma":[0.99441737,0.000043089498,0.0054680514,0.000028306133,0.0000056705458,0.000011399308,3.8306578e-7,0.0000059742083,0.00001977154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988531,0.00008957979,0.00016209894,0.00019820857,0.0003771955,0.0003198436],"domain_scores_gemma":[0.99893963,0.0003535265,0.00008856242,0.0003440308,0.0001227422,0.00015149468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006388899,0.000093614835,0.00014073495,0.00013367059,0.00011440988,0.00002405681,0.00044332942,0.00004449103,0.0000086289565],"category_scores_gemma":[0.00014864646,0.00009399665,0.00003262725,0.0005455075,0.00013426492,0.0010901608,0.00033357905,0.00018987304,0.000008628578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009367869,0.0000703338,0.073383935,0.000009961503,0.000009773177,0.000001665892,0.00020168276,0.0000029329099,0.0015832625,0.9240012,0.000035687135,0.0006902048],"study_design_scores_gemma":[0.00026975526,0.00007706423,0.132473,0.000011821969,0.0000027099877,0.000008583595,0.000024954055,0.00052107696,0.0069746342,0.85921013,0.00031413083,0.00011211606],"about_ca_topic_score_codex":0.000022440416,"about_ca_topic_score_gemma":9.199161e-7,"teacher_disagreement_score":0.06479105,"about_ca_system_score_codex":0.000036734586,"about_ca_system_score_gemma":0.000036849717,"threshold_uncertainty_score":0.38330722},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93224114,0.00018250868,0.034828063,0.00009744661,0.0023176444,0.00019628841,0.000003855787,0.00036682305,0.029766198],"genre_scores_gemma":[0.99579984,0.0000013359988,0.00371899,0.000044822114,0.000008690582,0.000019654444,0.0000022215168,0.000010816345,0.0003936171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882865,0.000039506314,0.00018940757,0.00035059644,0.0002700758,0.00032176738],"domain_scores_gemma":[0.99909794,0.000022804863,0.000101404745,0.000567518,0.00009469986,0.00011564066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016081033,0.00015628045,0.00019891282,0.000046678146,0.0001469559,0.0001669891,0.000687979,0.00005622178,0.000015111548],"category_scores_gemma":[0.00000964451,0.00012803795,0.000042915242,0.0003659982,0.000054087304,0.0005981004,0.0001213788,0.000118274926,0.0000633875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013280801,0.000117113734,0.005228028,0.00000910805,0.000027336047,0.00008019448,0.0014250469,0.000005244121,0.00007002657,0.9896863,0.00078191294,0.002556415],"study_design_scores_gemma":[0.007393424,0.0018299759,0.31734273,0.0005248262,0.000051062016,0.0004899297,0.0007042962,0.01993096,0.0081728585,0.6265927,0.014545696,0.0024215318],"about_ca_topic_score_codex":0.00015341041,"about_ca_topic_score_gemma":0.000012217674,"teacher_disagreement_score":0.36309355,"about_ca_system_score_codex":0.000030566032,"about_ca_system_score_gemma":0.00005748946,"threshold_uncertainty_score":0.52212363},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940147,0.00032320854,0.00006407612,0.00006459025,0.0006424313,0.00027629844,0.0000140517195,0.00014745981,0.0044532316],"genre_scores_gemma":[0.998013,0.00014766396,0.0010141204,0.00013005403,0.00007101427,0.000019361714,0.000008670484,0.000050801857,0.00054530415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841815,0.000025164723,0.0003377628,0.0003154329,0.00029279655,0.0006107195],"domain_scores_gemma":[0.99886954,0.0003067408,0.00014948571,0.00035668974,0.000043365242,0.00027419536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002886374,0.00031360498,0.0004071462,0.000098592456,0.00019223102,0.00006775983,0.0001265289,0.00026305678,0.000076704535],"category_scores_gemma":[0.000116621944,0.00026208235,0.00008048027,0.00015151929,0.00008559476,0.0008179719,0.00025525823,0.00028289505,0.000013461444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007907877,0.0004359237,0.036018297,0.0001816795,0.0001619304,0.000011714169,0.0019289044,9.4959455e-7,0.0007432969,0.95671207,0.002772693,0.000953471],"study_design_scores_gemma":[0.0027934753,0.00025270644,0.06155497,0.000047747024,0.0001086348,0.00005806147,0.00017771378,0.00021181627,0.0021827258,0.9304181,0.001619028,0.0005750403],"about_ca_topic_score_codex":0.000027081098,"about_ca_topic_score_gemma":0.000019734336,"teacher_disagreement_score":0.02629398,"about_ca_system_score_codex":0.000066025255,"about_ca_system_score_gemma":0.000024296036,"threshold_uncertainty_score":0.99998313},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98057973,0.0002093993,0.0047707297,0.0013392768,0.00050689926,0.0004218734,0.0000016334918,0.00018231553,0.0119881155],"genre_scores_gemma":[0.9972042,0.00001884198,0.0024642635,0.00007307759,0.0000020609561,0.000013541139,3.922295e-7,0.000008708082,0.00021494707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984674,0.00018074118,0.00017815644,0.00031273472,0.00046268097,0.00039830484],"domain_scores_gemma":[0.99812967,0.0004419873,0.000101412916,0.0010226481,0.00020324391,0.00010103289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005170061,0.00014035565,0.00017812772,0.000059572365,0.0002693253,0.00009268727,0.0012774513,0.0000442493,0.000004545533],"category_scores_gemma":[0.000098647666,0.00009283003,0.0000626368,0.0008452369,0.0002359526,0.00040833105,0.00013558535,0.00022047265,0.000017785795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050590737,0.00009215266,0.003674276,0.0000027744918,0.000019569048,0.00001008341,0.00022537571,0.0000068818504,0.00040563042,0.98920524,0.00019909754,0.00610833],"study_design_scores_gemma":[0.00072962756,0.0002894043,0.014262963,0.000016581469,0.0000033149397,0.000016072177,0.000020740148,0.00034505306,0.004661427,0.9784502,0.0010738542,0.00013075508],"about_ca_topic_score_codex":0.000012397984,"about_ca_topic_score_gemma":0.000008113546,"teacher_disagreement_score":0.01662441,"about_ca_system_score_codex":0.000024778265,"about_ca_system_score_gemma":0.00007021715,"threshold_uncertainty_score":0.37854987},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9694347,0.00017783298,0.0027203856,0.000040238036,0.0012975669,0.00021269068,0.0000028810205,0.00016044169,0.02595331],"genre_scores_gemma":[0.99004185,0.000012784283,0.0097362725,0.00002485504,0.0000027255505,0.0000173146,7.267722e-7,0.000014361458,0.00014909139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983828,0.00013199169,0.0002815181,0.00038310105,0.00040415477,0.00041642343],"domain_scores_gemma":[0.9985778,0.00011061588,0.00011675132,0.0008639443,0.00016551127,0.00016541757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044256743,0.00015902291,0.00023142205,0.00023748486,0.00008683969,0.000023217228,0.0015100386,0.00007481197,0.000052806387],"category_scores_gemma":[0.00006884145,0.00015415602,0.00011585357,0.0009696986,0.0002208971,0.00050336187,0.00039159457,0.00019838025,0.000074711425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027864204,0.00014809602,0.008069747,0.000009167734,0.000023505265,0.000011876701,0.0006226483,5.440719e-7,0.0012146807,0.9880256,0.00044663565,0.0013996012],"study_design_scores_gemma":[0.00052508846,0.00031780623,0.010121534,0.000010983575,0.0000039411116,0.0000071693794,0.00004529626,0.00018812533,0.03383034,0.95420307,0.0005688058,0.00017785974],"about_ca_topic_score_codex":0.000020529444,"about_ca_topic_score_gemma":0.0000017996064,"teacher_disagreement_score":0.033822585,"about_ca_system_score_codex":0.00002195158,"about_ca_system_score_gemma":0.000071980925,"threshold_uncertainty_score":0.62863},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9936095,0.0002511029,0.00061436597,0.00029823047,0.0021831102,0.00009204081,8.317191e-7,0.0001590656,0.0027917556],"genre_scores_gemma":[0.9971364,0.000005714075,0.0026383935,0.00014305038,4.1556345e-7,0.0000040550995,0.0000015877656,0.00000774556,0.00006262443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989026,0.00006175153,0.00023370468,0.0002646482,0.00033451582,0.000202778],"domain_scores_gemma":[0.9989076,0.0001046452,0.00010616369,0.0005635101,0.00016584255,0.00015219892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004119288,0.0001127097,0.00016952134,0.00014160344,0.000051937688,0.00003764731,0.00052491506,0.000052235453,0.0000025089792],"category_scores_gemma":[0.00009734206,0.00009769669,0.000054579268,0.0005602254,0.00005515479,0.00016067261,0.000113390524,0.000107904285,0.00004715567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061211895,0.000110877976,0.00036358708,0.000004256168,0.000010640183,0.000004036819,0.00026282968,0.00016095885,0.00047767948,0.99612916,0.0019722888,0.0004975664],"study_design_scores_gemma":[0.00085113564,0.00027436684,0.00008184843,0.00003490678,0.0000040982854,0.0000019627043,0.0000150318665,0.0046784934,0.006194817,0.9876503,0.00009488038,0.000118202974],"about_ca_topic_score_codex":0.000032002452,"about_ca_topic_score_gemma":6.783413e-7,"teacher_disagreement_score":0.008478901,"about_ca_system_score_codex":0.000012889448,"about_ca_system_score_gemma":0.000051312873,"threshold_uncertainty_score":0.39839554},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76144606,0.000021659498,0.015845422,0.024037864,0.00070378574,0.0021744084,0.000028202452,0.00050411234,0.19523849],"genre_scores_gemma":[0.99629235,0.0000037091286,0.0017730746,0.00073107175,0.000024300924,0.00035940294,0.0000049490554,0.00002621548,0.00078490085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988266,0.00014216156,0.00033774448,0.00019157937,0.00026553703,0.000236343],"domain_scores_gemma":[0.9975054,0.0016258879,0.00013854635,0.0005882357,0.00006451095,0.00007737633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000728695,0.00014594672,0.00021530422,0.000020496045,0.00020446806,0.00006350108,0.00022148575,0.000066658045,0.00021388661],"category_scores_gemma":[0.00060090085,0.00009324289,0.000089821435,0.00012056941,0.00007847563,0.00004122219,0.000056480814,0.0001761746,0.0003393377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037429445,0.00019794278,0.000007241899,0.00007353123,0.000010832245,2.2049058e-7,0.0004572661,0.0000015236319,0.000098030505,0.9887009,0.010253875,0.0001948755],"study_design_scores_gemma":[0.00026052434,0.00007991893,0.000045121236,0.00009977041,0.000023403598,0.0000012892674,0.00007306496,0.0026726106,0.0011288499,0.98439664,0.011089515,0.00012931491],"about_ca_topic_score_codex":0.000014602848,"about_ca_topic_score_gemma":0.0000025316435,"teacher_disagreement_score":0.23484631,"about_ca_system_score_codex":0.00003401032,"about_ca_system_score_gemma":0.000016180731,"threshold_uncertainty_score":0.4361613},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9814957,0.0017870292,0.000042032236,0.0000142548015,0.004003761,0.00012252045,0.000003354284,0.00011706455,0.012414316],"genre_scores_gemma":[0.9996345,0.000105519954,0.000014098755,0.0000068771255,0.000014433752,0.0000270152,0.0000012987739,0.00001803411,0.00017820741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914044,0.000050877534,0.00023768462,0.0000838568,0.00016875003,0.00031836503],"domain_scores_gemma":[0.99927896,0.00015900086,0.000045729983,0.0003983775,0.00003210657,0.00008580936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032214803,0.00013184395,0.00016812888,0.000031979544,0.000103340724,0.000020130561,0.0002913858,0.000056463658,0.000008051261],"category_scores_gemma":[0.000029660985,0.000093619376,0.00007007911,0.00018965236,0.000105841485,0.000101691076,0.000041336538,0.00012896581,0.00003735171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007942259,0.000034602195,0.0074886377,0.000053616423,0.00003351842,5.338082e-7,0.0008511939,0.000019331406,0.0041010207,0.9854871,0.0003427971,0.0015797154],"study_design_scores_gemma":[0.0017161486,0.00018773954,0.17412546,0.00027348835,0.000079498066,0.000027676388,0.002632437,0.001724397,0.048557084,0.7470197,0.022623321,0.0010330586],"about_ca_topic_score_codex":0.0000143897,"about_ca_topic_score_gemma":0.000002836149,"teacher_disagreement_score":0.23846741,"about_ca_system_score_codex":0.000024045883,"about_ca_system_score_gemma":0.0000063026073,"threshold_uncertainty_score":0.38176873},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7871093,0.000031828677,0.20789313,0.00018852338,0.0008114673,0.00008950208,0.0000011613533,0.000022611735,0.0038524368],"genre_scores_gemma":[0.99076533,0.0000045773513,0.009183465,0.000018275676,0.000013692457,0.0000015750492,0.0000011189933,0.0000018857226,0.00001008774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953556,0.00005112285,0.00014672404,0.000115520386,0.00009347883,0.00005761171],"domain_scores_gemma":[0.99960756,0.0000827095,0.00009580143,0.000119246346,0.00007324247,0.000021461243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010229329,0.000046977373,0.00010531049,0.000044407032,0.000039664585,0.000007815029,0.000079399295,0.000036036094,0.000005024993],"category_scores_gemma":[0.00003798723,0.000046433248,0.000020171856,0.0001433725,0.00008104808,0.00023772288,0.000019181962,0.000047812995,0.0000018553105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004177464,0.000016141103,0.00083163654,0.00000470993,0.000003957192,1.6298077e-7,0.00047908604,0.000026900236,0.0016892378,0.9817046,0.000025132607,0.015214276],"study_design_scores_gemma":[0.0005345879,0.00014537599,0.0076245097,0.000011772904,0.000005826235,0.0000048370043,0.00003827475,0.0058358503,0.009447417,0.9759078,0.00038123722,0.00006248089],"about_ca_topic_score_codex":0.0000028463937,"about_ca_topic_score_gemma":0.000001418648,"teacher_disagreement_score":0.20365599,"about_ca_system_score_codex":0.0000084969415,"about_ca_system_score_gemma":0.000016693166,"threshold_uncertainty_score":0.1893493},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99784714,0.00013434618,0.00042327994,0.000052965475,0.00044864262,0.00008097642,0.0000040108152,0.000023997323,0.0009846507],"genre_scores_gemma":[0.9991545,0.000026653042,0.00032111295,0.00015818875,0.00003804919,0.000003953301,0.00003765329,0.000012949409,0.00024692246],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990911,0.0000941002,0.00021374132,0.00029617225,0.00009733103,0.00020756862],"domain_scores_gemma":[0.99939686,0.00007575525,0.00009720351,0.00027113274,0.00008147389,0.00007758582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023896655,0.00014434989,0.00019800155,0.000024172396,0.00006861309,0.00001758716,0.00016715386,0.00016453632,0.000006784328],"category_scores_gemma":[0.0004012454,0.00012201853,0.000051959425,0.000087695655,0.00014148265,0.0000024244077,0.00019892037,0.00007711515,0.0000045431398],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020139354,0.00037444363,0.03313748,0.00014220632,0.0001722608,0.000015265508,0.00010711037,0.000111260044,0.74295014,0.18280083,0.004040182,0.035947435],"study_design_scores_gemma":[0.00945538,0.013761384,0.074269645,0.00029996777,0.00023404151,0.000118556396,0.00023473117,0.026694845,0.44911367,0.21684462,0.2061029,0.0028702738],"about_ca_topic_score_codex":0.000005292377,"about_ca_topic_score_gemma":0.0000012617131,"teacher_disagreement_score":0.29383647,"about_ca_system_score_codex":0.0000039051693,"about_ca_system_score_gemma":0.000022782884,"threshold_uncertainty_score":0.4975771},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99156433,0.00036879277,0.0007920159,0.00056082115,0.00252402,0.00013805881,0.00000105797,0.0002529075,0.0037979926],"genre_scores_gemma":[0.9910603,0.000008222108,0.008646165,0.00016840805,6.5046027e-7,0.00000611729,0.0000022614122,0.000009071087,0.000098807635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987627,0.000078904304,0.00032639853,0.00025120645,0.00036067443,0.00022008255],"domain_scores_gemma":[0.9987081,0.00007427505,0.00014658907,0.0006395517,0.00023853977,0.00019291202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057223,0.00012295826,0.00021876233,0.00012402573,0.000044455574,0.000037593498,0.0006013973,0.0000683874,0.0000042614397],"category_scores_gemma":[0.00011343533,0.00011158339,0.000075045085,0.00063940906,0.00007712374,0.00022652166,0.00017252685,0.00010749055,0.000065724256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031658485,0.0001157591,0.0011456358,0.000014495873,0.000015273215,0.00000603699,0.000438092,0.000043800905,0.00029062366,0.99250835,0.0049478034,0.00047098368],"study_design_scores_gemma":[0.00085818744,0.00020864287,0.00019959203,0.000036486355,0.0000074376035,0.000008621213,0.000024798046,0.003959207,0.0032327932,0.99110353,0.00022813257,0.00013255229],"about_ca_topic_score_codex":0.00009516513,"about_ca_topic_score_gemma":0.0000024060244,"teacher_disagreement_score":0.00785415,"about_ca_system_score_codex":0.000018091796,"about_ca_system_score_gemma":0.00009927903,"threshold_uncertainty_score":0.45502385},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.996652,0.00038095392,0.0008740922,0.00007227724,0.00017185407,0.00018285256,0.000009760957,0.000014615671,0.001641607],"genre_scores_gemma":[0.99793416,0.0000139556305,0.0018632695,0.000010212221,0.000042756394,0.00003055069,0.000004882499,0.000012961318,0.000087235254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993575,0.000027756834,0.00019136208,0.00010119711,0.00009514455,0.00022702952],"domain_scores_gemma":[0.9994483,0.00011379024,0.00010201523,0.00023722263,0.000026010366,0.000072637726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014960936,0.000106108215,0.00017463573,0.000011743532,0.00014329355,0.000018304108,0.00012219466,0.000020173418,0.0000682026],"category_scores_gemma":[0.000007612771,0.000072771654,0.00006145057,0.00008779039,0.00010452854,0.00010300022,0.000069621885,0.00008008432,0.000009671023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028509608,0.00007529179,0.009070199,0.000011807813,0.000023108658,1.310304e-7,0.00039574385,0.0000019558133,0.0017236916,0.98811835,0.00006755445,0.00050930184],"study_design_scores_gemma":[0.00027091196,0.000014351627,0.002126558,0.000013948282,0.00003739316,0.0000024453548,0.00050145615,0.0001931709,0.007939328,0.9880945,0.0006903036,0.00011562683],"about_ca_topic_score_codex":0.000053306234,"about_ca_topic_score_gemma":3.7633956e-7,"teacher_disagreement_score":0.006943641,"about_ca_system_score_codex":0.000010072313,"about_ca_system_score_gemma":0.000010789293,"threshold_uncertainty_score":0.29675418},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9963994,0.00048883416,0.002035127,0.00009462907,0.00041186827,0.000102821934,0.000008455261,0.000024503945,0.00043434696],"genre_scores_gemma":[0.9960724,0.000038829327,0.0037865522,0.00006650962,0.0000048924485,0.000004682063,0.0000038561584,0.0000056378317,0.000016636046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990753,0.00008045395,0.0002804506,0.00015317593,0.00019612488,0.0002145098],"domain_scores_gemma":[0.99889296,0.00033228128,0.00024282196,0.0003463908,0.00010330711,0.00008221328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031880455,0.00009920186,0.00023142097,0.000060735172,0.000025073214,0.0000073232127,0.00026658043,0.000058135414,0.000008236351],"category_scores_gemma":[0.0001061937,0.0000927965,0.000041681214,0.0002590292,0.00008735978,0.0004741082,0.00015119009,0.00007772615,0.000006618711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001506005,0.00017203597,0.014411431,0.00010108057,0.000027008586,0.0000018885918,0.0022016033,0.000017457282,0.0019573297,0.9801889,0.00010565684,0.00080051314],"study_design_scores_gemma":[0.0017284902,0.00048568085,0.06332481,0.000117047624,0.000070883994,0.00001554827,0.00015235691,0.003704862,0.03590589,0.89296085,0.0012144909,0.00031910732],"about_ca_topic_score_codex":0.00001702045,"about_ca_topic_score_gemma":0.0000016862804,"teacher_disagreement_score":0.087228104,"about_ca_system_score_codex":0.000009190155,"about_ca_system_score_gemma":0.00001936947,"threshold_uncertainty_score":0.37841314},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952485,0.0009816769,0.0008694827,0.0011210161,0.0007507218,0.00025396814,0.0000049326372,0.0002640764,0.0005056404],"genre_scores_gemma":[0.9881855,0.00008902001,0.011222962,0.00045764743,6.6762885e-7,0.000007149109,0.00001150714,0.000010809193,0.000014700444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807817,0.00013443206,0.0005222402,0.00052395766,0.00037734729,0.00036385507],"domain_scores_gemma":[0.99853444,0.00013025051,0.00023354989,0.00068884116,0.00020640249,0.00020654242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040320813,0.00025238548,0.00042150522,0.0003626438,0.00027746192,0.00010330695,0.0005782684,0.000094317875,0.0000057492875],"category_scores_gemma":[0.000024229084,0.00024429706,0.00012266339,0.0009456354,0.00017653847,0.0003545891,0.00015798547,0.00017041627,0.00001712227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016940074,0.00018234758,0.0010497061,0.000014697793,0.000027140866,0.0000067244296,0.0003960243,0.000026452277,0.051088173,0.9440003,0.0006258235,0.0025656684],"study_design_scores_gemma":[0.00167503,0.000539736,0.010325358,0.00006958521,0.000021331309,0.000014490341,0.000010356885,0.008298239,0.0027970765,0.975731,0.00024276318,0.00027498844],"about_ca_topic_score_codex":0.00009476304,"about_ca_topic_score_gemma":0.0000107116675,"teacher_disagreement_score":0.0482911,"about_ca_system_score_codex":0.000016617629,"about_ca_system_score_gemma":0.000028276905,"threshold_uncertainty_score":0.99621445},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.953809,0.00073266897,0.012897282,0.0012890884,0.008551433,0.0009863678,0.0000602901,0.0002910979,0.02138272],"genre_scores_gemma":[0.9980098,0.00009796168,0.0010311712,0.0003105164,0.000014789295,0.000024175431,0.0000049922783,0.00004933625,0.00045727828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99456984,0.0010171443,0.00077069737,0.0011009774,0.0014111275,0.0011301999],"domain_scores_gemma":[0.9941817,0.0018929568,0.00045900024,0.0025291448,0.0005019846,0.00043525055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018456199,0.0004818244,0.0007368235,0.0005428024,0.00033534583,0.00015157484,0.002998399,0.00020689752,0.000098262746],"category_scores_gemma":[0.00072038535,0.0004953869,0.00031953957,0.0020292255,0.0009582222,0.0005406028,0.00089425576,0.00074831396,0.0006190468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107937434,0.00035535925,0.001081325,0.0001304093,0.000057669888,0.000014759544,0.0003172054,0.00019554028,0.0032890365,0.9879027,0.0011745641,0.0053734775],"study_design_scores_gemma":[0.0014906045,0.0017443083,0.0022575883,0.00030585792,0.000019548954,0.0000068701174,0.00001819127,0.019686867,0.0051601157,0.9651467,0.0036848113,0.00047849893],"about_ca_topic_score_codex":0.000024016874,"about_ca_topic_score_gemma":0.0000037926318,"teacher_disagreement_score":0.044200726,"about_ca_system_score_codex":0.00009518508,"about_ca_system_score_gemma":0.00013107357,"threshold_uncertainty_score":0.9997498},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97214967,0.00079638476,0.00010857331,0.000034095316,0.003358064,0.00013971019,0.0000026952755,0.00013412563,0.023276694],"genre_scores_gemma":[0.9998559,0.000018649487,0.00000440216,0.0000026924024,0.0000072218577,0.000010174636,0.000003211425,0.00001217065,0.00008561949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956566,0.00004324441,0.000135775,0.000051526196,0.0001036284,0.00010013552],"domain_scores_gemma":[0.99962395,0.000051031588,0.000028288723,0.0001953438,0.000055757475,0.000045646535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026772555,0.00005901449,0.00008386548,0.00002012131,0.000038514816,0.000013443879,0.00013251706,0.000038761966,0.0000029437276],"category_scores_gemma":[0.000039704417,0.0000470183,0.000026990658,0.00014103636,0.00002896659,0.000033571887,0.0000129305245,0.00004748015,0.00001641014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073988012,0.000008241419,0.0013188166,0.00001499643,0.000022407661,9.522069e-7,0.0004918894,0.0004775834,0.0003698713,0.9919028,0.0052074203,0.00017761767],"study_design_scores_gemma":[0.0008086971,0.00010188964,0.0034622867,0.000047261212,0.00001731888,0.000005637213,0.0005978725,0.0022805417,0.004209727,0.96555877,0.022731876,0.0001780951],"about_ca_topic_score_codex":0.000017888111,"about_ca_topic_score_gemma":0.000008963036,"teacher_disagreement_score":0.027706202,"about_ca_system_score_codex":0.000021300933,"about_ca_system_score_gemma":0.000010755549,"threshold_uncertainty_score":0.19173506},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99050653,0.00039711225,0.00024103868,0.0002436115,0.0031943168,0.00009280789,4.703636e-7,0.00017918734,0.0051449127],"genre_scores_gemma":[0.99220335,0.0000063195175,0.007576292,0.00008015052,7.606837e-7,0.000006773173,7.365561e-7,0.000007321721,0.0001183138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989102,0.000046381836,0.00024350337,0.00025782053,0.00031643806,0.00022564217],"domain_scores_gemma":[0.99886876,0.00005190575,0.00010208363,0.00057635026,0.0002286704,0.00017224914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005157222,0.00010627546,0.00017585381,0.0001323726,0.00005090569,0.000041457602,0.0006208678,0.000056381854,0.000003099961],"category_scores_gemma":[0.00007910662,0.00009961174,0.000062089486,0.000603747,0.00005826965,0.00024442002,0.00023264595,0.000100637204,0.00005286094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004211632,0.00006881664,0.0030519182,0.000007158981,0.000009942842,0.000003562012,0.00032589395,0.000016951792,0.0003550966,0.9926514,0.0025843966,0.0009206334],"study_design_scores_gemma":[0.0007208442,0.00016502345,0.00087302236,0.000021519978,0.0000046470277,0.0000046932178,0.000019783572,0.0013622646,0.00462956,0.99134016,0.00073780277,0.00012066129],"about_ca_topic_score_codex":0.000052727355,"about_ca_topic_score_gemma":8.1040326e-7,"teacher_disagreement_score":0.0073352535,"about_ca_system_score_codex":0.000017975093,"about_ca_system_score_gemma":0.00007889753,"threshold_uncertainty_score":0.40620488},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9949349,0.000018361097,0.0004126155,0.0013942352,0.0013511948,0.00012306318,0.0000018935376,0.000024061042,0.0017396568],"genre_scores_gemma":[0.9992342,0.0000035382855,0.0005470963,0.0001436917,0.000010129315,0.000004122336,6.0703286e-7,0.0000048585102,0.000051777337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923617,0.00005211517,0.00021333115,0.00017548776,0.00018631086,0.00013656824],"domain_scores_gemma":[0.9989884,0.00040367202,0.00014098511,0.00033296013,0.00008012788,0.000053863783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030865645,0.00009359487,0.00016509349,0.00005198316,0.00006218288,0.000032237087,0.00042398405,0.00005055347,0.000017005133],"category_scores_gemma":[0.00014651877,0.00006597033,0.00004074208,0.00024614338,0.00010536893,0.00011180635,0.00013705128,0.0001473184,0.000006028903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020556048,0.000062408515,0.00086363545,0.000008302652,0.000016370073,9.642536e-7,0.0005845427,0.0000059232784,0.005956414,0.9849657,0.0027259593,0.004789213],"study_design_scores_gemma":[0.0022651004,0.00034302007,0.022914605,0.000046821773,0.000015793716,0.0000131936995,0.00003801464,0.0073948354,0.024206895,0.9415014,0.0009947389,0.00026563014],"about_ca_topic_score_codex":0.00013294714,"about_ca_topic_score_gemma":0.000017229671,"teacher_disagreement_score":0.04346436,"about_ca_system_score_codex":0.0000052551827,"about_ca_system_score_gemma":0.00006658067,"threshold_uncertainty_score":0.2690192},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917053,0.0004307835,0.0024193584,0.00022222952,0.00091508153,0.00007112219,0.000001273985,0.000090717826,0.004144107],"genre_scores_gemma":[0.9988942,0.000035933397,0.0008479524,0.00015962093,0.000006124343,0.0000041937374,7.2870625e-7,0.000005361881,0.000045896944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919945,0.00007907502,0.00016182884,0.00021617016,0.00017617065,0.00016727684],"domain_scores_gemma":[0.9990762,0.00024842226,0.00007431457,0.0004291289,0.000053444885,0.00011847434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032178595,0.00010346801,0.0001656622,0.000094727846,0.000053064425,0.000058632726,0.0004390232,0.0000617247,0.0000060966313],"category_scores_gemma":[0.00010297239,0.00009803732,0.00005076343,0.00032038515,0.000080264115,0.00029088708,0.00022924325,0.00010789548,0.0000078455105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011239872,0.000058744325,0.00616771,0.000007728278,0.000016696597,0.0000042128413,0.00082634814,0.000006392699,0.00010547912,0.9867832,0.0010433391,0.004968932],"study_design_scores_gemma":[0.0007832645,0.00020617196,0.005310406,0.00001985523,0.000008214726,0.0000041163075,0.000036777437,0.0012621423,0.0015547501,0.98731047,0.003358675,0.00014516644],"about_ca_topic_score_codex":0.000029944753,"about_ca_topic_score_gemma":0.0000036431618,"teacher_disagreement_score":0.0071888613,"about_ca_system_score_codex":0.000007664517,"about_ca_system_score_gemma":0.000028660521,"threshold_uncertainty_score":0.3997846},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06629094,0.000028040604,0.9307533,0.0006000059,0.0009325127,0.00015072337,0.00000102354,0.00037349307,0.000870006],"genre_scores_gemma":[0.9571878,0.0000034084096,0.042590547,0.00014996494,0.000007431313,0.000022258055,5.7507776e-7,0.000010903196,0.00002712346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991696,0.00004940897,0.0001539065,0.00013388711,0.0002482595,0.00024497716],"domain_scores_gemma":[0.9988117,0.00026757273,0.0000657424,0.0007396293,0.000050930023,0.00006440159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049537525,0.00011313115,0.00012834981,0.000054401113,0.00004409263,0.000021506412,0.0008207241,0.000052182386,0.000017427936],"category_scores_gemma":[0.00003412692,0.00007962845,0.00005480917,0.00020755989,0.000034329223,0.00022558136,0.00017059952,0.00012664244,0.000044120978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.756207e-7,0.00006220391,0.0011043333,0.00000443962,0.000007303924,8.069397e-7,0.00027360188,0.000009742313,0.00039355416,0.9918434,0.0033069956,0.0029926628],"study_design_scores_gemma":[0.00049409963,0.0006878955,0.013578972,0.00007330668,0.00001868037,0.000026375437,0.000004422464,0.0044710445,0.32905284,0.57980037,0.07112145,0.00067053107],"about_ca_topic_score_codex":0.000008934297,"about_ca_topic_score_gemma":1.09712076e-7,"teacher_disagreement_score":0.89089686,"about_ca_system_score_codex":0.000028452132,"about_ca_system_score_gemma":0.000022751728,"threshold_uncertainty_score":0.3247154},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9597952,0.000017140423,0.0004606661,0.0002890778,0.00083468907,0.0002518876,0.0000034237698,0.00011575024,0.03823221],"genre_scores_gemma":[0.9921755,0.0000018427475,0.0013272478,0.00007390578,0.000013367541,0.00007270107,0.000004299046,0.000030573065,0.0063005304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990455,0.000034903045,0.00017131392,0.00022183153,0.00026537926,0.0002610539],"domain_scores_gemma":[0.9990015,0.0003015066,0.000084495885,0.00041405423,0.00008439301,0.000114047165],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008624049,0.00016064168,0.00018723565,0.00003759502,0.00013806892,0.00004274737,0.00014342694,0.000064060056,0.0011793731],"category_scores_gemma":[0.000119896686,0.00012240403,0.00004585413,0.00014228093,0.0000637091,0.00013313824,0.000025834448,0.00016917166,0.000538611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036491303,0.00023954625,0.0014964989,0.00002229532,0.00003569363,0.000012690675,0.00012498623,8.488822e-7,0.00006893469,0.93144995,0.065929845,0.00058224116],"study_design_scores_gemma":[0.00118089,0.00043600658,0.0074112723,0.00008059944,0.0000475433,0.000019372907,0.00016150778,0.00011567178,0.00028982287,0.98688114,0.0030934927,0.00028268722],"about_ca_topic_score_codex":0.00005846835,"about_ca_topic_score_gemma":0.000026807029,"teacher_disagreement_score":0.06283636,"about_ca_system_score_codex":0.00004688533,"about_ca_system_score_gemma":0.000031489817,"threshold_uncertainty_score":0.9997337},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97081363,0.00048612087,0.000012371924,0.00004666233,0.003644921,0.00007059706,0.0000019707386,0.00020215414,0.024721546],"genre_scores_gemma":[0.9998854,0.0000025495565,0.000022298702,0.000018953448,0.0000065018517,0.000015882684,0.0000020388222,0.000018065388,0.00002832086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993776,0.00004894749,0.00014753142,0.000096704425,0.000119846285,0.00020935628],"domain_scores_gemma":[0.99960124,0.00006483507,0.0000057254983,0.00017669173,0.000030177349,0.00012133246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002638109,0.0000903233,0.00012859747,0.00006735608,0.00001483377,0.000022828242,0.000117275486,0.00007285718,0.000017523978],"category_scores_gemma":[0.00009519045,0.000095495576,0.000026549124,0.00018121864,0.000028419148,0.00012050597,0.000016226024,0.00013325662,0.00017909675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006586881,0.0000364429,0.0041681062,0.00003470318,0.000007195438,0.00004490143,0.00059015374,0.00027829641,0.000120988574,0.9889204,0.0054617273,0.0003304943],"study_design_scores_gemma":[0.00081717235,0.000050530016,0.0024100814,0.000046330955,0.000004477913,0.000012788041,0.00030775322,0.0028661261,0.0007342499,0.9875526,0.0049826084,0.00021530807],"about_ca_topic_score_codex":0.0000130851195,"about_ca_topic_score_gemma":0.000005889139,"teacher_disagreement_score":0.029071733,"about_ca_system_score_codex":0.000047623875,"about_ca_system_score_gemma":0.000011317962,"threshold_uncertainty_score":0.38941965},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937265,0.00030852854,0.001653865,0.00033161129,0.0014413322,0.00021238411,0.0000015659565,0.00018752101,0.002136704],"genre_scores_gemma":[0.99195194,0.000024708064,0.0075227995,0.00023106755,0.0000050844783,0.000038469614,0.0000024817734,0.000011637115,0.00021178806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883336,0.00008155478,0.00028522074,0.00028351852,0.00024283928,0.00027353448],"domain_scores_gemma":[0.9987948,0.000103009465,0.00012716607,0.00076890463,0.00010198574,0.000104152896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022626425,0.00014559198,0.00024608307,0.000103881015,0.000063512176,0.00008004297,0.0009937651,0.000067894536,0.0001305739],"category_scores_gemma":[0.000026692263,0.00013081911,0.00010663714,0.00036131663,0.000075112854,0.00045431286,0.00024958706,0.00009651701,0.00017746635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002136781,0.00006881128,0.0007194965,0.0000075665394,0.00001770325,0.0000030417598,0.0001561525,0.0000015580498,0.007065224,0.98350716,0.0038277844,0.0046233605],"study_design_scores_gemma":[0.0009035549,0.000081276135,0.0052798023,0.000012510591,0.0000048354655,0.0000066514194,0.000011326079,0.005320779,0.014467953,0.9731126,0.0006345608,0.000164146],"about_ca_topic_score_codex":0.00020077574,"about_ca_topic_score_gemma":3.895209e-7,"teacher_disagreement_score":0.010394559,"about_ca_system_score_codex":0.000017818635,"about_ca_system_score_gemma":0.000029130306,"threshold_uncertainty_score":0.5334649},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9896425,0.0000054970337,0.000061027058,0.00046924033,0.00015941152,0.00024640383,0.0000026883474,0.00003972257,0.009373506],"genre_scores_gemma":[0.9974804,0.0000012911333,0.0010486022,0.00012827013,0.0000037849745,0.000050637304,0.0000011961927,0.0000198287,0.001265995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993308,0.00003754501,0.00016091693,0.00011587458,0.00020430445,0.00015055755],"domain_scores_gemma":[0.9966996,0.0026717423,0.00010315114,0.00035402205,0.00013119254,0.000040317344],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007391314,0.00010523585,0.0001515228,0.000019165507,0.00008154319,0.000015636124,0.00015595666,0.000041357525,0.0011606679],"category_scores_gemma":[0.00079351355,0.00006190228,0.000040563267,0.0002712592,0.00007372822,0.00009035461,0.000026490756,0.00012807966,0.00029127105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068157856,0.000123167,0.0023322192,0.00001522134,0.000029564844,0.000001185557,0.00018669144,0.000002701961,0.00017057832,0.99349725,0.0035700991,0.000064509666],"study_design_scores_gemma":[0.0004010334,0.000055891785,0.0042833737,0.000030924573,0.000016225618,0.0000029713522,0.0002321933,0.000014413539,0.00219875,0.9926287,0.000046393598,0.00008911518],"about_ca_topic_score_codex":0.000009015351,"about_ca_topic_score_gemma":0.0000019876447,"teacher_disagreement_score":0.008107511,"about_ca_system_score_codex":0.000016010043,"about_ca_system_score_gemma":0.000020900825,"threshold_uncertainty_score":0.9997524},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9842039,0.00017389886,0.0014654499,0.003134662,0.00060509035,0.00060394977,7.726743e-7,0.00012897997,0.009683301],"genre_scores_gemma":[0.9982183,0.000009069649,0.0010835525,0.00039045373,0.000004368754,0.00009527865,0.000001231539,0.000008687412,0.00018905978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848276,0.00031524297,0.00015991296,0.00026665712,0.00038494307,0.00039047375],"domain_scores_gemma":[0.9984142,0.00045075492,0.000039443108,0.00092053483,0.00010500295,0.00007004995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000618524,0.00011126726,0.00011045617,0.00011944022,0.000121533914,0.00018812837,0.0018908621,0.00004903558,0.000055038487],"category_scores_gemma":[0.0001205301,0.000079725,0.000040435523,0.0010242997,0.00007610261,0.00065571384,0.0002812427,0.00031733737,0.0006248409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013190073,0.00006755113,0.004757878,0.0000047274666,0.0000027557885,0.000017768578,0.0007688362,0.000005281696,0.00006560637,0.988636,0.00077364105,0.0048986007],"study_design_scores_gemma":[0.00036528803,0.00007119811,0.025139414,0.000009159401,7.7381424e-7,0.0000057968246,0.00020187451,0.0016444202,0.00014709403,0.97037566,0.0019309638,0.00010834991],"about_ca_topic_score_codex":0.00005850851,"about_ca_topic_score_gemma":0.0000073640863,"teacher_disagreement_score":0.020381536,"about_ca_system_score_codex":0.000025000025,"about_ca_system_score_gemma":0.00003613721,"threshold_uncertainty_score":0.80312735},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903219,0.00044354203,0.0010304438,0.004057275,0.00074112375,0.0010095775,0.0000018828475,0.00010058728,0.0022936985],"genre_scores_gemma":[0.9952831,0.00009421035,0.004199931,0.00022920266,0.0000030552667,0.00010859629,6.622585e-7,0.0000105878335,0.00007063734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849325,0.0003318843,0.00025859653,0.0002264391,0.00036462015,0.00032519916],"domain_scores_gemma":[0.9973951,0.0014535718,0.00010728081,0.0008582625,0.00011308858,0.0000727026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080601766,0.00012587807,0.00017695005,0.000037629805,0.00034797672,0.00014762163,0.0012431078,0.000025602274,0.000041904488],"category_scores_gemma":[0.00006810393,0.00006739102,0.0000703222,0.0004247782,0.00050551543,0.0005030228,0.00043938376,0.00016342029,0.00006759188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006194279,0.000035523553,0.0033752136,0.000010764715,0.000052970998,9.687255e-7,0.00057908375,2.6124812e-7,0.00008899524,0.99186176,0.0012419983,0.0027462412],"study_design_scores_gemma":[0.001079671,0.00003927961,0.006447579,0.000009727282,0.000006814558,0.000011550224,0.00010694106,0.0015568481,0.0005397486,0.98951775,0.00059639616,0.0000876989],"about_ca_topic_score_codex":0.00009000959,"about_ca_topic_score_gemma":0.000003020908,"teacher_disagreement_score":0.004961248,"about_ca_system_score_codex":0.000016932778,"about_ca_system_score_gemma":0.000022068127,"threshold_uncertainty_score":0.2748126},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928013,0.00019844524,0.0053041624,0.00018574667,0.0004224535,0.00020264914,0.0000013846109,0.00005685903,0.0008269971],"genre_scores_gemma":[0.99945235,0.000014257963,0.00045773902,0.00001655054,0.0000042952574,0.000014589038,7.21831e-7,0.0000072494545,0.000032257703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988124,0.00013315918,0.00028479454,0.00017443593,0.0003816767,0.00021356509],"domain_scores_gemma":[0.99913424,0.00007603737,0.000107065964,0.00047155534,0.0001535528,0.000057549925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046252707,0.00009813658,0.00020549951,0.00018114725,0.000051163606,0.000019266663,0.0005459721,0.000046947862,0.0000019887195],"category_scores_gemma":[0.0000678408,0.0000840075,0.00008490617,0.0004595502,0.0001621786,0.0008276405,0.00009062077,0.0001106782,0.000006717633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001993942,0.00007956438,0.00018928747,0.00007663975,0.000012062843,2.4454837e-7,0.0008975231,0.000028521717,0.022966422,0.9713437,0.000014114607,0.004372003],"study_design_scores_gemma":[0.00064923515,0.00028674168,0.00080695236,0.00005361167,0.000003515752,0.0000023245861,0.000040534564,0.007389936,0.21543875,0.7751239,0.000097165626,0.00010735237],"about_ca_topic_score_codex":0.000010297964,"about_ca_topic_score_gemma":7.5858065e-7,"teacher_disagreement_score":0.1962198,"about_ca_system_score_codex":0.000015389573,"about_ca_system_score_gemma":0.000040690404,"threshold_uncertainty_score":0.34257263},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844706,0.0003436098,0.004533748,0.00016519435,0.0042878673,0.0011822595,0.00006782103,0.0005356145,0.004413282],"genre_scores_gemma":[0.99819714,0.00004239333,0.0014047801,0.000036064324,0.0000067236674,0.00003477654,0.00006397151,0.00004465271,0.00016949243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929243,0.00002381836,0.00023119654,0.00012006969,0.00011090357,0.00022156989],"domain_scores_gemma":[0.99935174,0.000100494064,0.000045768735,0.00022612876,0.00018984092,0.00008602376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012587677,0.00013351295,0.0001704607,0.000068684065,0.000052540592,0.000027340264,0.00010403012,0.00008668605,0.00025823497],"category_scores_gemma":[0.0000367356,0.00013388699,0.00005065719,0.00021048353,0.000033819746,0.00013025982,0.00002303695,0.00008981802,0.000058050795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057126275,0.00045102974,0.0021981795,0.00082260644,0.00034780108,0.000008411932,0.0031332897,0.067866735,0.022031365,0.8576351,0.035826735,0.009621624],"study_design_scores_gemma":[0.0035874725,0.0005708792,0.0010319916,0.00010721965,0.00006737525,0.000010609587,0.00028436526,0.3408909,0.014842716,0.62621486,0.01156905,0.0008225392],"about_ca_topic_score_codex":0.000025911231,"about_ca_topic_score_gemma":0.000003221675,"teacher_disagreement_score":0.27302417,"about_ca_system_score_codex":0.000027620408,"about_ca_system_score_gemma":0.000021536705,"threshold_uncertainty_score":0.54597527},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950936,0.00016619108,0.00020829299,0.00029290054,0.0014205422,0.00011454281,0.0000029093474,0.00004944574,0.0026515888],"genre_scores_gemma":[0.99860305,0.000007775817,0.0010846886,0.000233874,0.0000012274816,0.000007879675,8.785078e-7,0.000008054909,0.00005256303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877447,0.000105907515,0.00032045608,0.00016790755,0.0003474526,0.00028383348],"domain_scores_gemma":[0.99855787,0.00032480006,0.00022098099,0.0006643607,0.00014391249,0.000088108245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006989183,0.00011976723,0.00021136542,0.00006917675,0.000088766974,0.000018454943,0.0006101201,0.000049957023,0.000032904445],"category_scores_gemma":[0.000069615664,0.00008360653,0.0001118699,0.0005590472,0.00011791987,0.00016971937,0.00014864356,0.00012352149,0.00007656808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005791446,0.0001653811,0.004153457,0.000009983267,0.000022250459,3.958014e-7,0.0005864785,0.000007830233,0.0018376232,0.9896177,0.0034018669,0.00019124083],"study_design_scores_gemma":[0.00049975055,0.00007282178,0.0023718118,0.00004449648,0.0000115194625,0.000005254383,0.000023587992,0.0005349587,0.011562144,0.98412895,0.00062416174,0.0001205391],"about_ca_topic_score_codex":0.000044367767,"about_ca_topic_score_gemma":2.6809207e-7,"teacher_disagreement_score":0.009724521,"about_ca_system_score_codex":0.000007984766,"about_ca_system_score_gemma":0.000018181512,"threshold_uncertainty_score":0.34093753},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68463075,0.00059131446,0.30326632,0.00063817116,0.0038757543,0.0002671306,0.0000075101334,0.00016305408,0.0065599796],"genre_scores_gemma":[0.99458146,0.00000977344,0.0051635117,0.00009568257,0.000006698239,0.000007235331,0.000008143618,0.0000048864126,0.00012258612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990103,0.00008685851,0.00020800301,0.00022130703,0.00032669323,0.00014679317],"domain_scores_gemma":[0.99911445,0.00013923923,0.000082167724,0.00025812158,0.0002972584,0.00010878752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034166203,0.00009719728,0.00013812144,0.00014667315,0.000049116625,0.00003123446,0.00035087348,0.000044109158,0.0000056072163],"category_scores_gemma":[0.000077730365,0.000099616846,0.00006408478,0.0007311886,0.000034177145,0.00036415507,0.00005542853,0.00007421422,0.000029298943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008206608,0.00010552185,0.00032940364,0.00000847158,0.000015943702,0.0000050909825,0.0010280812,0.0018299405,0.0003651637,0.9901116,0.0009318901,0.005260688],"study_design_scores_gemma":[0.0008543759,0.0002424722,0.0026923192,0.00001550397,0.000008954499,0.000005270688,0.000032325384,0.032543316,0.006861364,0.95589197,0.0006991949,0.00015294086],"about_ca_topic_score_codex":0.0000138110245,"about_ca_topic_score_gemma":0.0000013167747,"teacher_disagreement_score":0.3099507,"about_ca_system_score_codex":0.000023331679,"about_ca_system_score_gemma":0.00014108184,"threshold_uncertainty_score":0.40622568},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96919006,0.0034520486,0.0002086471,0.00016282572,0.001909294,0.0004206817,0.0000021255726,0.0003217297,0.024332576],"genre_scores_gemma":[0.9957441,0.000122042075,0.0038866135,0.000041026844,0.000011767484,0.000018707695,9.752387e-7,0.000013880001,0.00016086275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848306,0.00009586002,0.00025603414,0.00062137336,0.00022663017,0.00031703245],"domain_scores_gemma":[0.9987224,0.000075196935,0.00016370896,0.0008194056,0.000116507515,0.000102800775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003715692,0.00019442511,0.0003098635,0.0001435288,0.000102971484,0.000033470402,0.00062847807,0.000038687554,0.000009866609],"category_scores_gemma":[0.000121905585,0.0001665147,0.000063711,0.00071001664,0.00017536778,0.0005556663,0.00025569348,0.00012766533,0.000009999118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021917273,0.00041115552,0.047125172,0.00009588557,0.000070088994,0.000024769002,0.0017215823,0.000002729473,0.0021637315,0.9301348,0.00037229672,0.017855914],"study_design_scores_gemma":[0.0009914415,0.0005276617,0.13486527,0.00008011445,0.000047968475,0.00002814396,0.000029619985,0.00020629402,0.121355414,0.7383931,0.0027763546,0.0006986162],"about_ca_topic_score_codex":0.000047889578,"about_ca_topic_score_gemma":0.000005457826,"teacher_disagreement_score":0.19174166,"about_ca_system_score_codex":0.000010819019,"about_ca_system_score_gemma":0.000039949424,"threshold_uncertainty_score":0.6790272},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9579995,0.00005446654,0.006313696,0.00040340336,0.0012897162,0.0002956483,0.0000019212735,0.00012736108,0.03351428],"genre_scores_gemma":[0.9974016,0.0000047034996,0.002362234,0.00013567213,0.0000018654318,0.000027860267,1.6581073e-7,0.000010862478,0.000055050117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982837,0.00024748853,0.00022332232,0.00030116332,0.00059586286,0.00034850682],"domain_scores_gemma":[0.9974589,0.0011283695,0.000063015425,0.0010643187,0.00018089026,0.000104543586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074248057,0.00013190712,0.00016772332,0.000080888705,0.00014170125,0.000033742013,0.0017820791,0.000070236034,0.00020070886],"category_scores_gemma":[0.00066196837,0.000094015035,0.00008133091,0.0006609836,0.0004068597,0.0003323959,0.00035828695,0.00033939962,0.00026983672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100546085,0.00016406241,0.0013239289,0.000013527936,0.000011299896,0.000014979601,0.00053965824,2.3085946e-7,0.00015829882,0.99708873,0.00027546295,0.00039978288],"study_design_scores_gemma":[0.00018466458,0.00012883895,0.0034518843,0.00003623045,0.0000029899247,0.000013549572,0.000031448006,0.00030644066,0.007908837,0.9878135,0.0000145387085,0.00010712398],"about_ca_topic_score_codex":0.000013743798,"about_ca_topic_score_gemma":7.648469e-7,"teacher_disagreement_score":0.03940208,"about_ca_system_score_codex":0.000021329206,"about_ca_system_score_gemma":0.00005690408,"threshold_uncertainty_score":0.38338217},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7863829,0.00089192524,0.1675777,0.0017551808,0.004842881,0.00076421665,0.0000028429433,0.001177103,0.036605217],"genre_scores_gemma":[0.9936325,0.0000112718135,0.0043252152,0.00014844094,0.000021768434,0.000027261294,0.0000012189746,0.000025207926,0.0018070913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784136,0.0002569687,0.0002430314,0.0005483192,0.0005177256,0.00059259275],"domain_scores_gemma":[0.9980769,0.00034903624,0.000097767086,0.0011221067,0.00013226544,0.0002219197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086991047,0.00020398347,0.00026130598,0.00019991872,0.0002497226,0.00023528698,0.0015461202,0.00008286776,0.000013956792],"category_scores_gemma":[0.00022771921,0.00019701934,0.0000941324,0.0005239638,0.0001380353,0.0006756167,0.0005364569,0.0003237107,0.0002800096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007987392,0.000059386948,0.0028654044,0.000008555857,0.000014600356,0.000016838687,0.00052820763,0.000053609463,0.00071841676,0.9691744,0.0006863088,0.0258663],"study_design_scores_gemma":[0.00090484647,0.00023899664,0.0042712437,0.000042802734,0.000003669258,0.000013875432,0.00006753884,0.017929439,0.003926391,0.9589132,0.013369551,0.00031845385],"about_ca_topic_score_codex":0.000023643492,"about_ca_topic_score_gemma":0.0000059367003,"teacher_disagreement_score":0.2072496,"about_ca_system_score_codex":0.00006061365,"about_ca_system_score_gemma":0.000049097514,"threshold_uncertainty_score":0.80342156},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98151934,0.000025973126,0.0005849355,0.0002314474,0.00046132712,0.00022293506,0.0000011275089,0.000051042,0.016901845],"genre_scores_gemma":[0.9986436,0.000012834652,0.001182088,0.00007559747,0.0000010536633,0.000031460073,3.4147706e-7,0.000010909795,0.000042139567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986257,0.00020351108,0.00022655411,0.00028711953,0.0003399318,0.000317209],"domain_scores_gemma":[0.9985535,0.00033519077,0.00008072385,0.00090037927,0.000066969835,0.00006319289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000615475,0.00012522655,0.00016702052,0.00012627398,0.00006803714,0.00002141836,0.0013133863,0.000047751735,0.00007827061],"category_scores_gemma":[0.00013857026,0.00008905054,0.000074606076,0.0008051794,0.00018447071,0.00021676798,0.00030994465,0.0002548958,0.00008700193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002431908,0.00018533661,0.009174055,0.0000046001865,0.000008868282,0.000010723343,0.00071981613,0.0000015805285,0.00013992237,0.9881415,0.00010521672,0.0014841079],"study_design_scores_gemma":[0.00036033962,0.00007649421,0.022957204,0.000023946892,0.0000010582033,0.000002718056,0.000049388556,0.00015937394,0.006066909,0.97017235,0.000030430294,0.0000998116],"about_ca_topic_score_codex":0.000061040504,"about_ca_topic_score_gemma":0.000008348553,"teacher_disagreement_score":0.017969128,"about_ca_system_score_codex":0.000025732204,"about_ca_system_score_gemma":0.000028383285,"threshold_uncertainty_score":0.36313757},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9800258,0.0001974556,0.000011364461,0.0000020195487,0.0011051075,0.000099088786,0.000008332777,0.00008962457,0.018461185],"genre_scores_gemma":[0.9998608,0.000013508108,0.000055551904,0.0000049010723,0.0000030368003,0.000010190573,0.0000064774563,0.000017583701,0.00002790345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993935,0.000037166345,0.00022441393,0.000092384704,0.0000844674,0.00016805973],"domain_scores_gemma":[0.99966854,0.00003787942,0.000029219818,0.00020357595,0.000023268925,0.00003751088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001451869,0.0001042366,0.00019518146,0.0000877446,0.000015717935,0.0000040527257,0.00016122543,0.000064670014,0.000061806626],"category_scores_gemma":[0.000011078018,0.00010649525,0.000031109983,0.00022330132,0.00003355045,0.00005993047,0.000016238295,0.00010270964,0.000037202117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029168075,0.000098602,0.023377012,0.00019312723,0.000045767825,0.000021160062,0.0027898434,0.00023074918,0.008108811,0.96436226,0.00042825777,0.00031525083],"study_design_scores_gemma":[0.002693728,0.00025006686,0.06241536,0.00027371573,0.00002734598,0.00002408345,0.0009273021,0.0039002178,0.03302366,0.89095366,0.0047957753,0.0007150594],"about_ca_topic_score_codex":0.000098896664,"about_ca_topic_score_gemma":0.000017823264,"teacher_disagreement_score":0.07340857,"about_ca_system_score_codex":0.000012780999,"about_ca_system_score_gemma":0.000005108044,"threshold_uncertainty_score":0.43427503},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9820339,0.000102585815,0.009488407,0.00026650509,0.0014305213,0.00011376853,8.008857e-7,0.00012926492,0.006434216],"genre_scores_gemma":[0.99700266,0.000010845062,0.002826563,0.00010694183,0.00000753043,0.000010487194,9.5148897e-7,0.0000112399675,0.000022788554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855393,0.00017787491,0.0003317245,0.0003601044,0.00024282659,0.0003335252],"domain_scores_gemma":[0.9987256,0.00028802946,0.00014155399,0.00069420406,0.000052710195,0.00009788241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089091377,0.00016238203,0.00028732533,0.00027263077,0.00008834788,0.000050158633,0.0010351719,0.00008226775,0.0000129049795],"category_scores_gemma":[0.000116977455,0.00016799185,0.00011350093,0.00088236196,0.00008951958,0.00025639127,0.00015240567,0.00018455417,0.00001990333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000907286,0.0001155853,0.0146779055,0.000013855812,0.0000114232125,0.000002907553,0.0005339041,0.000028810367,0.004106419,0.97581786,0.000098359684,0.0045839227],"study_design_scores_gemma":[0.0009557273,0.00016235905,0.0124927405,0.00009195206,0.000008317487,0.000004494934,0.000039572773,0.0024761937,0.015202305,0.9665101,0.0017765716,0.00027965236],"about_ca_topic_score_codex":0.000027489528,"about_ca_topic_score_gemma":0.000013297249,"teacher_disagreement_score":0.014968721,"about_ca_system_score_codex":0.000029277067,"about_ca_system_score_gemma":0.000029886642,"threshold_uncertainty_score":0.68505085},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9944475,0.000043371605,0.000004461888,0.0002943534,0.0010341062,0.00028252302,0.000012067741,0.000020444853,0.0038611642],"genre_scores_gemma":[0.9994661,0.000007911179,0.00010875813,0.000020940905,0.0000072636226,0.000036243277,6.6404965e-7,0.00001594924,0.00033616295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991586,0.000070993185,0.00028987468,0.00012263352,0.000200369,0.00015750948],"domain_scores_gemma":[0.9981328,0.0005556095,0.00023245515,0.0009377133,0.00010461759,0.000036802314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052021956,0.000102223974,0.00015248319,0.000030377618,0.0002818835,0.000017459237,0.0006248548,0.00007370605,0.000044855748],"category_scores_gemma":[0.00026634234,0.00005947459,0.0001731252,0.00036441293,0.00044861084,0.000038462123,0.00009729051,0.00024625522,0.000010652067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009208393,0.00020648443,0.0010649276,0.000016377011,0.000029568999,1.2712911e-7,0.00020831337,1.4029943e-7,0.019109946,0.97811973,0.0010574828,0.00017768994],"study_design_scores_gemma":[0.0002368174,0.000023707216,0.0049736756,0.000016295575,0.000035964516,0.0000030054496,0.00007849884,0.0000059257827,0.017056067,0.9750076,0.002497336,0.000065111926],"about_ca_topic_score_codex":0.000015480937,"about_ca_topic_score_gemma":0.000035873552,"teacher_disagreement_score":0.0050186,"about_ca_system_score_codex":0.000004384817,"about_ca_system_score_gemma":0.00003607423,"threshold_uncertainty_score":0.24253035},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9807018,0.0000062868776,0.0000990588,0.0007673031,0.00022422247,0.00022133447,0.0000032706357,0.000055282937,0.017921418],"genre_scores_gemma":[0.999467,0.0000026436032,0.00011313791,0.0001837786,0.000004831721,0.000048778173,0.0000011877364,0.000016391243,0.00016223996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921167,0.00013091128,0.00020217622,0.00013858228,0.00017150158,0.00014517536],"domain_scores_gemma":[0.9978424,0.0013020941,0.00012859117,0.0006378819,0.000047532456,0.00004154114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005532738,0.00010461205,0.00015702024,0.00006519437,0.00012515098,0.000011237951,0.00032227868,0.00006245115,0.00005513207],"category_scores_gemma":[0.00036464565,0.00007213514,0.000097476426,0.00031387588,0.000119674434,0.000026799062,0.0000406412,0.00016120859,0.00006819306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008713196,0.00015693321,0.0005108883,0.000013088608,0.000015134868,1.279634e-7,0.00019669716,5.01438e-7,0.00068047544,0.9956172,0.0023409645,0.00045925853],"study_design_scores_gemma":[0.0002856777,0.000060936167,0.0014349887,0.00002449048,0.000017076709,7.195516e-7,0.000021645488,0.00008009604,0.0046922388,0.9904962,0.002804996,0.00008092718],"about_ca_topic_score_codex":0.0000073864076,"about_ca_topic_score_gemma":0.0000020575962,"teacher_disagreement_score":0.018765189,"about_ca_system_score_codex":0.000007605666,"about_ca_system_score_gemma":0.000010239579,"threshold_uncertainty_score":0.29415858},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9968649,0.000100953526,0.000028511373,0.00008304522,0.00053488696,0.00018406103,0.000004052571,0.00003660092,0.0021630032],"genre_scores_gemma":[0.999682,0.000068273206,0.000083552586,0.000008409052,0.0000038248168,0.000018271614,0.0000016402471,0.000008899202,0.0001251231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993661,0.00004256582,0.00019324939,0.00013389495,0.0001369553,0.0001272268],"domain_scores_gemma":[0.9985541,0.0008284119,0.00015926085,0.0003484498,0.000061039376,0.0000487146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034920283,0.00009224106,0.00012655038,0.000083086976,0.0002671865,0.00003335024,0.00020480796,0.00007143965,0.0000053910276],"category_scores_gemma":[0.0002506218,0.00006239063,0.000043989075,0.00044337858,0.00021182383,0.000049153427,0.00004696887,0.00020149272,0.0000026117693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079755455,0.00008286403,0.002493822,0.00001823522,0.00001775107,1.044684e-7,0.00019333034,5.2991076e-8,0.0022111963,0.9923987,0.000066962144,0.0025090028],"study_design_scores_gemma":[0.00024804345,0.000029695917,0.0422623,0.000008623103,0.000028760067,0.0000017662064,0.000084327,0.00006793917,0.001693853,0.95540965,0.00009603427,0.00006903498],"about_ca_topic_score_codex":0.000013511607,"about_ca_topic_score_gemma":0.000015536843,"teacher_disagreement_score":0.03976848,"about_ca_system_score_codex":0.0000031654113,"about_ca_system_score_gemma":0.000010094166,"threshold_uncertainty_score":0.25442162},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9948073,0.000029493704,0.0015463558,0.00008743,0.00035736614,0.00024671157,0.0000027317753,0.00008048073,0.002842115],"genre_scores_gemma":[0.9960502,0.0000022109039,0.0037555636,0.00013089969,0.0000017538982,0.000005651083,5.6238434e-7,0.000017686509,0.000035472716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984948,0.00019728602,0.00015805445,0.00034110184,0.00047686647,0.0003318682],"domain_scores_gemma":[0.9982708,0.00031514355,0.00011458018,0.0010899286,0.00012342024,0.00008612205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003229308,0.00017396317,0.0001862272,0.00008828476,0.00021016743,0.00006269297,0.0015336904,0.000043040443,0.00006589227],"category_scores_gemma":[0.00006136512,0.00010275117,0.00006245713,0.00073713355,0.00028394532,0.00029953607,0.00021859341,0.0003663959,0.000018877627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057874808,0.00005839137,0.001651206,0.0000065335,0.000029572211,0.000011641754,0.0012704127,0.000015264648,0.0017176891,0.99440676,0.00009069461,0.00068397186],"study_design_scores_gemma":[0.0004904883,0.00045916103,0.0025817382,0.000025948084,0.000004225929,0.000010371992,0.00003225909,0.00029312103,0.030578097,0.96537143,0.000021489142,0.00013168142],"about_ca_topic_score_codex":0.00005618908,"about_ca_topic_score_gemma":0.000007844194,"teacher_disagreement_score":0.029035328,"about_ca_system_score_codex":0.000019736148,"about_ca_system_score_gemma":0.00006323385,"threshold_uncertainty_score":0.4190071},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9913971,0.000035245645,0.000039615956,0.00045819068,0.0030660394,0.00019357873,0.0000014155995,0.00013688684,0.0046719196],"genre_scores_gemma":[0.9988736,0.0000025068848,0.0007963627,0.00024325796,0.0000012795175,0.000019294053,0.0000023022722,0.0000110896535,0.00005031521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879795,0.00006295618,0.00025704797,0.00030496347,0.00034142853,0.00023565734],"domain_scores_gemma":[0.998671,0.0002877233,0.00016855053,0.00062222773,0.00017945361,0.00007103706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061989325,0.00013598421,0.00015867305,0.000093634735,0.0003172267,0.000120087934,0.0006886898,0.00007867543,0.000011078273],"category_scores_gemma":[0.00037355468,0.000094768206,0.000068271635,0.00044327008,0.00013684736,0.0002111745,0.0001624019,0.00038666293,0.000026939148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042264605,0.000059630307,0.0015794592,0.0000125103215,0.000010960043,0.000003413848,0.00040129406,0.000009554168,0.010371824,0.9852019,0.0011349437,0.0012102994],"study_design_scores_gemma":[0.00048483122,0.000140368,0.003717223,0.000067425266,0.000008218385,0.0000070084657,0.000020445472,0.0011992967,0.01121882,0.9826755,0.00032453603,0.00013632],"about_ca_topic_score_codex":0.00008479244,"about_ca_topic_score_gemma":0.000009119655,"teacher_disagreement_score":0.0074764844,"about_ca_system_score_codex":0.000011554314,"about_ca_system_score_gemma":0.000051951636,"threshold_uncertainty_score":0.3864535},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925422,0.00010972822,0.0000920074,0.00020845963,0.00019546293,0.0003896318,0.0000064825167,0.00014172695,0.0063142637],"genre_scores_gemma":[0.99894834,0.000010798174,0.00059315213,0.00007234761,0.0000063302414,0.000040209867,0.000006678612,0.000032357933,0.00028979126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988254,0.00007536023,0.00024592582,0.0003030597,0.0002759321,0.00027437363],"domain_scores_gemma":[0.9987883,0.0002300848,0.00016474848,0.0004613514,0.00010703118,0.0002484604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003850867,0.00020553883,0.00026670942,0.00016991269,0.0001489499,0.000059470127,0.00024506226,0.00012770036,0.000009424526],"category_scores_gemma":[0.00011556443,0.0001698701,0.000043975535,0.0005700613,0.00017583428,0.00015966801,0.00007105191,0.00022050829,0.000023086784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075517855,0.0002231629,0.0041946853,0.000024192783,0.00005059678,0.000006439299,0.0009556661,0.0000011120774,0.000058990223,0.99235094,0.0016029224,0.00045577955],"study_design_scores_gemma":[0.002512986,0.00013896565,0.0016037293,0.000023973009,0.00005682097,0.000019577266,0.00054167886,0.00007725492,0.000302291,0.9939178,0.0005712031,0.00023370891],"about_ca_topic_score_codex":0.00001827196,"about_ca_topic_score_gemma":0.000007694493,"teacher_disagreement_score":0.0064060977,"about_ca_system_score_codex":0.000022668808,"about_ca_system_score_gemma":0.000053962678,"threshold_uncertainty_score":0.6927101},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9835139,0.0000673922,0.0000013695246,0.0002828244,0.0004965624,0.0005396627,0.0000031284123,0.00028442644,0.014810718],"genre_scores_gemma":[0.99788284,0.000013033227,0.0009691331,0.000053816704,0.0000053877625,0.00015333042,0.0000053375375,0.000052711013,0.00086443155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981669,0.00025476777,0.0003541192,0.00031544897,0.0003677354,0.00054102717],"domain_scores_gemma":[0.99816257,0.0008456676,0.00007012751,0.0006501897,0.00012950714,0.00014196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005873016,0.00019665025,0.00030813858,0.0002760728,0.00008187302,0.00008504041,0.0004492768,0.0001344661,0.00057463255],"category_scores_gemma":[0.0007597673,0.00018673165,0.00007896676,0.0006897188,0.00011661217,0.00023219238,0.0001610079,0.00035726992,0.0006826135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001413439,0.00029308922,0.018311128,0.000048951435,0.000022958886,0.000017017232,0.0005313162,2.177411e-7,0.0013768028,0.97020715,0.0080155665,0.0011616402],"study_design_scores_gemma":[0.00081034994,0.00005734141,0.057595007,0.000045588436,0.000004977445,0.0000029680182,0.00011668871,0.00017734274,0.00089729833,0.93983215,0.00025995806,0.00020030723],"about_ca_topic_score_codex":0.00029298212,"about_ca_topic_score_gemma":0.000069129506,"teacher_disagreement_score":0.03928388,"about_ca_system_score_codex":0.000095415395,"about_ca_system_score_gemma":0.000038286948,"threshold_uncertainty_score":0.8773843},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98372513,0.00066492194,0.012697712,0.00017546704,0.0004437998,0.000774421,0.0000068128784,0.00044205846,0.0010696491],"genre_scores_gemma":[0.99572265,0.000028253542,0.0038618587,0.0000756886,0.000005235943,0.00019121708,0.0000098166465,0.00003912882,0.00006613812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690926,0.00047652563,0.0004053707,0.0005274646,0.0006512875,0.0010300761],"domain_scores_gemma":[0.99792963,0.00060674944,0.00015161684,0.0008611246,0.00012230029,0.0003285656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006980726,0.00034273037,0.0004732619,0.000318029,0.00014950577,0.00011830158,0.001041241,0.00012512434,0.000016786447],"category_scores_gemma":[0.00011562761,0.00029967524,0.00008064074,0.0020559442,0.0002227942,0.0015429584,0.00016959792,0.00040195507,0.00006834346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015174068,0.0029557615,0.06885204,0.00018764392,0.00020596356,0.00014469348,0.010529937,0.000030298745,0.012005375,0.899223,0.001044834,0.0046686893],"study_design_scores_gemma":[0.005985748,0.0014890683,0.13928902,0.0004431096,0.000040882587,0.00007791144,0.00062325294,0.02094485,0.019117368,0.8102439,0.00024360808,0.0015012788],"about_ca_topic_score_codex":0.000053841653,"about_ca_topic_score_gemma":0.000018738161,"teacher_disagreement_score":0.08897912,"about_ca_system_score_codex":0.0001854255,"about_ca_system_score_gemma":0.00009969452,"threshold_uncertainty_score":0.9999455},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98873603,0.0015509503,0.0032446138,0.00048188443,0.0030508316,0.00014217511,8.3756584e-7,0.00029373754,0.0024989122],"genre_scores_gemma":[0.9870809,0.000008809547,0.012721564,0.00013993369,7.0541154e-7,0.000005296453,0.0000011114626,0.000008575893,0.000033137014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987679,0.00006454283,0.00027111828,0.00027636363,0.00038942738,0.00023065804],"domain_scores_gemma":[0.9987171,0.00004557026,0.000113104936,0.000643713,0.0003016032,0.00017890203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006223735,0.00011305167,0.00019009467,0.00015277076,0.00005372669,0.00004257731,0.00062786334,0.000063361986,0.0000019961042],"category_scores_gemma":[0.00010701544,0.00010735639,0.0000730598,0.00071863097,0.000056942143,0.00022748741,0.00018387781,0.00010641872,0.000040039416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021682988,0.000087370594,0.0012255297,0.0000099458575,0.000016518552,0.000008245041,0.00039650936,0.00008887347,0.0029605886,0.9932092,0.0014698063,0.0005252753],"study_design_scores_gemma":[0.0008466372,0.00011064681,0.00008594607,0.000026176043,0.000006991618,0.000008517663,0.000027748601,0.0023381843,0.0058603943,0.99021703,0.00033816282,0.00013356839],"about_ca_topic_score_codex":0.000054521275,"about_ca_topic_score_gemma":4.2337123e-7,"teacher_disagreement_score":0.009476949,"about_ca_system_score_codex":0.000015971124,"about_ca_system_score_gemma":0.00009737941,"threshold_uncertainty_score":0.43778667},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9502831,0.0000059059003,0.000019548395,0.00009167417,0.00014246296,0.00014656915,0.0000028975142,0.000032517466,0.049275305],"genre_scores_gemma":[0.9995696,0.0000013660174,0.00008706754,0.000052726013,0.0000016488722,0.000029500523,5.3114053e-7,0.000010098905,0.00024743786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953485,0.000050056467,0.00013754562,0.00008654479,0.00009846232,0.000092526454],"domain_scores_gemma":[0.999033,0.00038844446,0.00008206351,0.0004347059,0.00003557751,0.00002620905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002434014,0.000068602574,0.00009590256,0.000028161725,0.00006934529,0.000003750276,0.00023873156,0.000039170638,0.00026947042],"category_scores_gemma":[0.00011986715,0.00004588824,0.00005481651,0.00015461862,0.000082031846,0.000022984159,0.00002784494,0.00009375047,0.00004338192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009451469,0.0002180742,0.00085022673,0.000004505239,0.000016949189,3.359921e-7,0.000568098,4.310476e-8,0.00013443238,0.99523526,0.0028699134,0.00009269808],"study_design_scores_gemma":[0.00017689656,0.000046693323,0.0037866342,0.000011934205,0.000012315033,5.3260686e-7,0.00010636287,0.000007933323,0.0064506037,0.98915684,0.00019191994,0.000051319745],"about_ca_topic_score_codex":0.0000082287315,"about_ca_topic_score_gemma":0.000003803869,"teacher_disagreement_score":0.049286503,"about_ca_system_score_codex":0.0000057254733,"about_ca_system_score_gemma":0.000009399355,"threshold_uncertainty_score":0.29505122},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9684448,0.010122052,0.00084669824,0.009597817,0.0075903283,0.0004565657,0.000015844607,0.0002537374,0.002672111],"genre_scores_gemma":[0.99364823,0.00018608864,0.004368312,0.0007856403,0.0000024557496,0.0000071117015,0.000008460507,0.000019626063,0.0009740703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694926,0.00038139013,0.00083074707,0.0005842903,0.0005608258,0.00069347426],"domain_scores_gemma":[0.9975108,0.00020769707,0.000401776,0.0011575102,0.00042936363,0.00029285005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008302017,0.00036366808,0.00061629113,0.00026547682,0.00021670398,0.00014770524,0.0010003084,0.00021287863,0.000052187148],"category_scores_gemma":[0.00009282273,0.00038560946,0.00023967554,0.001581166,0.00034403475,0.00050300424,0.0001681528,0.00030140256,0.00012211928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000966148,0.0005278925,0.0005809501,0.00012786161,0.000045963712,0.000039636907,0.0007604229,0.00016488181,0.0057453387,0.9816943,0.0030671814,0.007235918],"study_design_scores_gemma":[0.0011238895,0.0006787658,0.004330528,0.00056339416,0.00005087792,0.000034442597,0.000019873736,0.014001697,0.0048455787,0.97171265,0.0022368713,0.00040143044],"about_ca_topic_score_codex":0.00032782825,"about_ca_topic_score_gemma":0.000007164268,"teacher_disagreement_score":0.02520339,"about_ca_system_score_codex":0.000049613645,"about_ca_system_score_gemma":0.00018394837,"threshold_uncertainty_score":0.9998596},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9827459,0.0004353793,0.013314434,0.00011237599,0.0011723372,0.00027384356,0.000061381805,0.000094735624,0.0017896504],"genre_scores_gemma":[0.9918958,0.000015568075,0.007998178,0.000030520514,0.000002743993,0.000014202911,0.00000759728,0.000011231335,0.00002416453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843293,0.00016309659,0.00033084347,0.00020073871,0.00037744752,0.00049492466],"domain_scores_gemma":[0.99836296,0.0003160204,0.00016624256,0.00076348375,0.00022012163,0.00017119391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061764714,0.00012530937,0.00025972532,0.00022437592,0.00010391306,0.000012541237,0.0008399032,0.000051307885,0.000032581665],"category_scores_gemma":[0.00010402596,0.0001255557,0.0001163513,0.0007888556,0.00016566238,0.0006041727,0.00039159608,0.00015384628,0.000044625638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008480616,0.00036947965,0.018649409,0.000025951382,0.000025055995,0.0000012408069,0.0005677249,0.000008247197,0.0065130983,0.9733188,0.0002537337,0.00025875014],"study_design_scores_gemma":[0.0010890835,0.00014115417,0.032154735,0.000039020262,0.000008171976,0.000006647036,0.000050426996,0.0015989098,0.018157432,0.9448891,0.0016755173,0.00018975708],"about_ca_topic_score_codex":0.000009285351,"about_ca_topic_score_gemma":0.0000022158251,"teacher_disagreement_score":0.028429683,"about_ca_system_score_codex":0.000019104342,"about_ca_system_score_gemma":0.000029753954,"threshold_uncertainty_score":0.5120013},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9849954,0.000009542189,0.0046662837,0.00026626047,0.00020799288,0.00019331231,0.00004506212,0.000043844895,0.009572281],"genre_scores_gemma":[0.9984957,0.000002216056,0.0012443516,0.000026514588,0.000017807197,0.000028448167,0.000029248724,0.00001303666,0.00014266332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994935,0.000014219925,0.00012265706,0.00017562277,0.000048880487,0.00014514629],"domain_scores_gemma":[0.99942356,0.00017269723,0.000056103658,0.0001994996,0.000044396907,0.000103749684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000054997774,0.00012405627,0.00015196887,0.000014896001,0.00022011358,0.000053444655,0.00007449474,0.00003091113,0.00021013437],"category_scores_gemma":[0.00001674206,0.00010374626,0.00002555765,0.000106562795,0.00014227389,0.000118703865,0.00006617715,0.00015770101,0.000007636102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017248691,0.000057519595,0.0066798176,0.000004910707,0.0000138512405,5.7957024e-8,0.00020316574,2.3519503e-7,0.004371785,0.9859021,0.0001805534,0.002584326],"study_design_scores_gemma":[0.0003082387,0.000010851141,0.0058621108,0.000003619004,0.0000075331955,8.378927e-7,0.00028450825,0.00023046452,0.001604694,0.9834579,0.008103256,0.00012597752],"about_ca_topic_score_codex":0.00003853273,"about_ca_topic_score_gemma":0.000004218981,"teacher_disagreement_score":0.013500293,"about_ca_system_score_codex":0.0000039382357,"about_ca_system_score_gemma":0.000010787656,"threshold_uncertainty_score":0.42306495},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9530568,0.00027107346,0.041337848,0.0001926922,0.000956154,0.00020463236,0.0000025261681,0.00010834834,0.00386993],"genre_scores_gemma":[0.99074715,0.0000027516564,0.009074676,0.00011385275,0.0000038066025,0.000022984426,4.890736e-7,0.000014563971,0.000019724304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984717,0.00010406921,0.00015648607,0.00025578248,0.00050889445,0.0005030618],"domain_scores_gemma":[0.9981831,0.00069819595,0.000042372863,0.000757838,0.00012170693,0.00019679706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004081247,0.00013916314,0.00018953036,0.00017050224,0.00007396736,0.000028758985,0.00072878046,0.000051104158,0.000010229576],"category_scores_gemma":[0.00015366708,0.00010817965,0.00006180566,0.0006496432,0.00028743263,0.0005275752,0.0001866033,0.00021657303,0.000051135885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032351898,0.00029719857,0.004664307,0.0000126799905,0.000013963193,0.0000055103915,0.0001524262,0.0000021576416,0.0005898088,0.99215233,0.00011434389,0.0019629346],"study_design_scores_gemma":[0.00047559344,0.000527907,0.0101326695,0.000026966043,0.0000046567857,0.000005363156,0.0000137336665,0.00017366413,0.003898213,0.9845244,0.000069299706,0.00014750856],"about_ca_topic_score_codex":0.000005729514,"about_ca_topic_score_gemma":7.8307744e-7,"teacher_disagreement_score":0.037690356,"about_ca_system_score_codex":0.000022069451,"about_ca_system_score_gemma":0.000031439944,"threshold_uncertainty_score":0.4411438},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99216896,0.000090339876,0.00016074297,0.00019842751,0.0018136054,0.00010805891,0.0000014930707,0.00015754561,0.005300806],"genre_scores_gemma":[0.9957637,0.000008493761,0.0038936522,0.0002275902,6.883061e-7,0.000006980516,0.0000021655608,0.000010367393,0.00008635893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986388,0.00008193185,0.00028338947,0.0002800641,0.00047518252,0.00024061245],"domain_scores_gemma":[0.99867487,0.00011231021,0.0001203718,0.0007325162,0.00019042741,0.00016949142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045065628,0.00014186844,0.00022495071,0.00011701751,0.00005333833,0.000039443756,0.000589532,0.00006460258,0.000010820849],"category_scores_gemma":[0.00010214995,0.0001250882,0.00006945123,0.000608943,0.000077511584,0.00018199548,0.0001451043,0.000115556366,0.00021785747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051605375,0.00015932534,0.0010219284,0.0000136992285,0.000015623176,0.000006433846,0.0004796807,0.00003473271,0.00016969857,0.9888434,0.009015768,0.0002345525],"study_design_scores_gemma":[0.0009712286,0.00019423536,0.00041693475,0.000045513745,0.0000057732896,0.000005856756,0.000034048022,0.0014783297,0.001691233,0.99480397,0.00020603288,0.00014687763],"about_ca_topic_score_codex":0.00010147494,"about_ca_topic_score_gemma":0.0000015440249,"teacher_disagreement_score":0.008809735,"about_ca_system_score_codex":0.00002451454,"about_ca_system_score_gemma":0.0000822143,"threshold_uncertainty_score":0.51009494},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938546,0.00007773394,0.00002629888,0.000008193006,0.0022117426,0.000098257566,0.000009376113,0.0001055911,0.0036082088],"genre_scores_gemma":[0.99977344,0.0000064737264,0.00014504464,0.000003176199,0.000011633607,0.0000087941935,0.000007998676,0.000016884704,0.000026568214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993594,0.00002989965,0.00027342627,0.0000840158,0.00014174578,0.00011146012],"domain_scores_gemma":[0.9995334,0.0000734952,0.000070693335,0.0002141219,0.00007010567,0.000038149767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018156713,0.00009600475,0.0001814352,0.00009078126,0.000025379219,0.0000070719293,0.000115273426,0.0001006847,0.00006600921],"category_scores_gemma":[0.000022248552,0.00009954144,0.00006055647,0.00019185459,0.000036250065,0.00008753249,0.0000121327175,0.00015547925,0.0000114385275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005773063,0.00006219581,0.011844255,0.00011234262,0.000043500488,0.0000011569065,0.00039198707,0.000118598626,0.13054386,0.85629714,0.00036160287,0.00021757623],"study_design_scores_gemma":[0.0021260064,0.00026731432,0.059433106,0.00011970586,0.00008416277,0.000015246474,0.00020814026,0.00721797,0.45979005,0.46347782,0.0066821966,0.0005782521],"about_ca_topic_score_codex":0.000007442257,"about_ca_topic_score_gemma":0.000008273361,"teacher_disagreement_score":0.39281932,"about_ca_system_score_codex":0.0000064874125,"about_ca_system_score_gemma":0.000015575597,"threshold_uncertainty_score":0.4059182},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97304535,0.00025797178,0.019654829,0.0004978182,0.00076915964,0.00034139206,0.0000056756876,0.0002848724,0.0051429598],"genre_scores_gemma":[0.99645317,0.000049324855,0.0033165547,0.00012537655,0.000003110524,0.000010203056,0.000010480042,0.000008192995,0.000023598317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838495,0.00015374365,0.00030694949,0.00035235603,0.00046189074,0.0003401096],"domain_scores_gemma":[0.9987153,0.00018785919,0.00015714133,0.00066376175,0.00016371753,0.0001122548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037905146,0.00015235395,0.00023057553,0.0003557352,0.00015738253,0.00006132235,0.0007829284,0.0000697628,0.000017607648],"category_scores_gemma":[0.000070503294,0.00015907573,0.00011406044,0.0011188927,0.00013046758,0.0007575068,0.00009704184,0.00020314651,0.000028247761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010175474,0.00010806654,0.0012807589,0.000009958198,0.000011017426,0.000007786862,0.00016555487,0.000013678572,0.010861983,0.979191,0.00010644751,0.008233571],"study_design_scores_gemma":[0.0006252868,0.00027044397,0.025992116,0.000043079523,0.000004118977,0.0000083341165,0.000020589812,0.00047894215,0.0134428125,0.9588425,0.00011517558,0.00015657875],"about_ca_topic_score_codex":0.00000719454,"about_ca_topic_score_gemma":0.0000014952894,"teacher_disagreement_score":0.024711356,"about_ca_system_score_codex":0.000035095225,"about_ca_system_score_gemma":0.000032732463,"threshold_uncertainty_score":0.648692},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9489908,0.001508279,0.00005777022,0.0015106194,0.006566084,0.00037654897,0.000029335615,0.00011586455,0.04084468],"genre_scores_gemma":[0.98701,0.00004508828,0.00019344487,0.0002800493,0.000064167274,0.000046990972,0.000010029947,0.0000531172,0.012297125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984064,0.0001873029,0.0003125326,0.00022109677,0.0002474074,0.0006252442],"domain_scores_gemma":[0.99800324,0.00075850426,0.00014829055,0.00072960247,0.000068890906,0.00029145574],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00063328573,0.00025802685,0.0002642409,0.00008300282,0.00024854002,0.0000434303,0.00029760707,0.00025444053,0.0010682642],"category_scores_gemma":[0.00022060904,0.00027657396,0.00014770906,0.00038065726,0.00017796518,0.00022028777,0.000078597666,0.0004128277,0.0031332467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000151281265,0.0016515818,0.0035176706,0.00007737342,0.00006503336,0.000001962069,0.0010169077,0.0000012457649,0.00006742358,0.9601006,0.03215568,0.0013294008],"study_design_scores_gemma":[0.0006127353,0.000080442456,0.002402894,0.00010114663,0.000081186576,0.000009209003,0.00017190893,0.000033341923,0.0011283715,0.94962806,0.04547101,0.0002796838],"about_ca_topic_score_codex":0.000019979614,"about_ca_topic_score_gemma":0.0000020843406,"teacher_disagreement_score":0.03801917,"about_ca_system_score_codex":0.00008880022,"about_ca_system_score_gemma":0.000033924567,"threshold_uncertainty_score":0.99996865},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.987299,0.00055516895,0.00012957523,0.0007989623,0.0009331226,0.0002475817,0.000012903687,0.00006397226,0.009959677],"genre_scores_gemma":[0.9983175,0.000023943861,0.00032358937,0.00022732117,0.000010936241,0.000036117148,0.0000068913487,0.00001219054,0.0010415377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745435,0.00037802535,0.00058167585,0.00044953046,0.0008399758,0.00029642775],"domain_scores_gemma":[0.9970051,0.0015361749,0.00018962909,0.0007816628,0.00026765204,0.00021975163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003577757,0.00015009394,0.00035056393,0.00049041695,0.00008164607,0.00012302103,0.0009535758,0.000087678374,0.000057267185],"category_scores_gemma":[0.0040623127,0.000121576726,0.00009736313,0.0034721328,0.00013572477,0.0002883418,0.00013922884,0.00024506397,0.0007229933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014187627,0.0006271032,0.02138396,0.00000202821,0.000010240518,0.000011121391,0.00068378705,0.00024695465,0.00010088352,0.9380973,0.012524619,0.026170105],"study_design_scores_gemma":[0.0030624932,0.00005151427,0.019759431,0.000008958003,0.000004965907,0.000003705828,0.00045165562,0.00051021046,0.0003103795,0.9629916,0.012697343,0.00014773456],"about_ca_topic_score_codex":0.00006515677,"about_ca_topic_score_gemma":0.000037496153,"teacher_disagreement_score":0.02602237,"about_ca_system_score_codex":0.00004616113,"about_ca_system_score_gemma":0.00010540632,"threshold_uncertainty_score":0.9292857},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9686766,0.00041779588,0.007507298,0.0003335279,0.0025025518,0.00058699324,0.000008501812,0.0001454623,0.019821253],"genre_scores_gemma":[0.99393696,0.000010644154,0.0058931224,0.000013352857,0.0000032007515,0.0000053426625,0.0000015549949,0.0000065086374,0.00012930612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991119,0.000038597525,0.00019420934,0.00021936378,0.0002450536,0.00019086411],"domain_scores_gemma":[0.9988908,0.000035715308,0.0001792109,0.00075293833,0.0001041589,0.000037161357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003454597,0.00009509461,0.00014098639,0.000042201424,0.00016104619,0.0000924535,0.0008974147,0.000015090491,0.0000027359117],"category_scores_gemma":[0.00001722013,0.000062622086,0.000035463036,0.00042885385,0.0002898494,0.00042514634,0.00019073508,0.000063428495,0.0000031407208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012774385,0.00011457225,0.008878084,0.000024808023,0.00005263582,0.000008385573,0.0015463686,6.109086e-7,0.00015256942,0.9788498,0.00078757684,0.009571771],"study_design_scores_gemma":[0.0035046865,0.0012737745,0.10556472,0.0002629256,0.000103368926,0.000018335262,0.0008979844,0.0017272404,0.060319915,0.82008475,0.005405226,0.00083705946],"about_ca_topic_score_codex":0.00016894375,"about_ca_topic_score_gemma":0.000009721174,"teacher_disagreement_score":0.15876508,"about_ca_system_score_codex":0.0000067727206,"about_ca_system_score_gemma":0.000047135665,"threshold_uncertainty_score":0.25536543},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99067783,0.0000078226785,0.00030570134,0.00023386897,0.0035982314,0.00038610233,7.187963e-7,0.00022454218,0.0045652003],"genre_scores_gemma":[0.99881333,0.0000010096309,0.00088768505,0.00009673736,0.000009673446,0.000046722565,4.4851632e-7,0.000014417082,0.00012995022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983539,0.00013917594,0.00015636993,0.0004653045,0.0004985066,0.00038672567],"domain_scores_gemma":[0.9982384,0.000237939,0.000046339028,0.0012172934,0.000084053354,0.00017596132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005977689,0.0001496204,0.00015530318,0.00022593126,0.00019860065,0.00012469638,0.0015450084,0.00005896941,0.000017323138],"category_scores_gemma":[0.00015256762,0.00013744716,0.00006677879,0.00076952676,0.00009323435,0.000323904,0.00030358706,0.0005918582,0.00024444243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014117846,0.00048370237,0.0058275834,9.0491346e-7,0.00001331942,0.000061498,0.00049387803,0.0000012655216,0.0011986836,0.9883758,0.00034378763,0.0031854482],"study_design_scores_gemma":[0.0011237073,0.00065872836,0.019295398,0.0000025040495,0.0000021617989,0.000007916154,0.00005023814,0.000114875096,0.0016396627,0.97613406,0.0007979252,0.0001728355],"about_ca_topic_score_codex":0.0000070254746,"about_ca_topic_score_gemma":0.0000076288297,"teacher_disagreement_score":0.013467814,"about_ca_system_score_codex":0.000017012711,"about_ca_system_score_gemma":0.000049082897,"threshold_uncertainty_score":0.5604933},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99208033,0.00040435034,0.00008414892,0.0015284519,0.0023709375,0.00019122247,4.5987963e-7,0.00035654858,0.0029835291],"genre_scores_gemma":[0.99553436,0.000011438378,0.00070281833,0.0033608933,0.0000047903027,0.00003547582,8.631823e-7,0.00001390841,0.0003354714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838305,0.00009286562,0.0002550781,0.0004641065,0.00038189592,0.00042301504],"domain_scores_gemma":[0.99884033,0.00013509713,0.00010100127,0.0006568839,0.000089551024,0.00017715225],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029997266,0.00019035877,0.00020873043,0.00016205509,0.00022675833,0.0003232583,0.00083890907,0.00015796293,0.00010059628],"category_scores_gemma":[0.00006742804,0.00015430737,0.00007534123,0.00038404283,0.00011259456,0.0005670992,0.00027977594,0.00029094535,0.00085212867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016529567,0.00013234353,0.007875372,0.0000041437297,0.000012288044,0.000005598605,0.00023506035,0.000010908974,0.0003968681,0.9865555,0.0039139832,0.00085627526],"study_design_scores_gemma":[0.00054007594,0.0002000889,0.0074905427,0.000027949747,0.0000024118378,0.0000028666989,0.000016799022,0.0026065905,0.00071359845,0.98718256,0.0009948993,0.00022159998],"about_ca_topic_score_codex":0.00028196626,"about_ca_topic_score_gemma":0.0000021460585,"teacher_disagreement_score":0.0034539897,"about_ca_system_score_codex":0.000039110888,"about_ca_system_score_gemma":0.00004370471,"threshold_uncertainty_score":0.99992585},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7158645,0.00087853323,0.18641831,0.00046019195,0.0013505964,0.0015049847,0.00060191203,0.00005656364,0.0928644],"genre_scores_gemma":[0.9925329,0.0000047719286,0.007066291,0.000012723186,0.000004345163,0.000047953687,0.0000066435127,0.0000065400036,0.00031779733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944586,0.00004286563,0.00021944741,0.00008121703,0.00010319423,0.00010741111],"domain_scores_gemma":[0.9992104,0.0002630786,0.00018241632,0.00024800247,0.000071218295,0.000024848492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017199275,0.00007177447,0.00012376944,0.0000063505877,0.00013716439,0.0000056461154,0.000280696,0.00001742786,0.0000663938],"category_scores_gemma":[0.000012064457,0.00003954873,0.00008902364,0.00012859,0.0002484592,0.00004533979,0.000064743195,0.00006796726,0.0000038579333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037150799,0.00006697909,0.00020886927,0.0000050603753,0.000029215651,1.0056735e-8,0.00010058823,0.0000012254744,0.0028946523,0.9952995,0.0006423442,0.0007478311],"study_design_scores_gemma":[0.0001507038,0.00001908313,0.0002190323,0.000008499463,0.00001629941,1.1809983e-7,0.0003652271,0.000053074935,0.02709703,0.9681882,0.0038366735,0.000046027308],"about_ca_topic_score_codex":0.000033845423,"about_ca_topic_score_gemma":1.3015865e-7,"teacher_disagreement_score":0.27666843,"about_ca_system_score_codex":0.000004866907,"about_ca_system_score_gemma":0.000024764384,"threshold_uncertainty_score":0.16127503},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.996924,0.00003808921,0.0000019151269,0.00089508924,0.00012332141,0.0003758928,0.000009684721,0.000016737442,0.0016152716],"genre_scores_gemma":[0.99971414,0.000017014658,0.00008499601,0.000038493377,0.0000032948763,0.000024179893,0.0000019108713,0.00000801868,0.00010797206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917704,0.00008873142,0.00033931754,0.000116520256,0.00014937024,0.00012899992],"domain_scores_gemma":[0.9982714,0.0009866576,0.00018580483,0.00046042138,0.000058576763,0.000037136775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034001246,0.00008320832,0.00017327857,0.000084053085,0.000035663666,0.000006846982,0.0002694205,0.00005102353,0.000035131125],"category_scores_gemma":[0.0003862318,0.000058483838,0.00006853535,0.00036103264,0.00007607122,0.00006151272,0.000036378984,0.000114418595,0.000018643412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019565527,0.00028515368,0.0008448247,0.000017920906,0.000011433618,1.7351752e-7,0.0003681665,0.00000251395,0.00052557024,0.9900268,0.007791048,0.00010682962],"study_design_scores_gemma":[0.00058726774,0.000056724137,0.005547093,0.00004153037,0.000008111199,1.5813897e-7,0.000117417745,0.000020247804,0.018702505,0.97477037,0.000093462775,0.000055090848],"about_ca_topic_score_codex":0.00021576493,"about_ca_topic_score_gemma":0.000007917496,"teacher_disagreement_score":0.018176936,"about_ca_system_score_codex":0.00000968342,"about_ca_system_score_gemma":0.000021186244,"threshold_uncertainty_score":0.23849018},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9838441,0.0008412863,0.0077022575,0.00025894953,0.0016964915,0.00034296705,0.0000016452008,0.00022863872,0.0050836857],"genre_scores_gemma":[0.9944236,0.000024433888,0.005273304,0.00005448137,0.000007460406,0.000056197667,0.0000023300063,0.00002303041,0.00013513226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976106,0.00027409318,0.00033517205,0.00040211412,0.00044876372,0.00092920184],"domain_scores_gemma":[0.9983746,0.00044190188,0.000109800894,0.0007543804,0.000093212904,0.00022613577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012317656,0.00021287988,0.0002693711,0.00035542273,0.00016615319,0.000089589594,0.0012189433,0.00008725054,0.0000149474035],"category_scores_gemma":[0.0002736768,0.000213305,0.00008215371,0.0016300674,0.0001447465,0.001422512,0.00043876897,0.00037843065,0.00007952264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018258288,0.00017937917,0.040083017,0.000012712769,0.00000783806,0.000017714183,0.0006751033,0.000006913968,0.0009956248,0.94758976,0.000111964386,0.010301713],"study_design_scores_gemma":[0.0012335752,0.00006141426,0.029315738,0.0000473174,0.0000025144652,0.0000104419405,0.00011394529,0.0024563398,0.005248483,0.9605186,0.00066851464,0.00032309935],"about_ca_topic_score_codex":0.000022554535,"about_ca_topic_score_gemma":0.000009940704,"teacher_disagreement_score":0.012928856,"about_ca_system_score_codex":0.00013043563,"about_ca_system_score_gemma":0.000036390844,"threshold_uncertainty_score":0.8698326},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78449607,0.00016772839,0.0029954456,0.0003576649,0.00044967662,0.00034027873,0.000009081543,0.0000664682,0.2111176],"genre_scores_gemma":[0.9971773,0.000010284312,0.0016920505,0.000027308348,0.000013697799,0.00006193601,0.000002510696,0.00001070977,0.0010041877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955285,0.000015080608,0.000114695256,0.00011253416,0.00005394659,0.00015090151],"domain_scores_gemma":[0.9995501,0.000094785515,0.000046028996,0.00022213279,0.00002673125,0.000060206203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007511272,0.000079360274,0.000087869266,0.0000051649204,0.00027056484,0.000026850901,0.00011675939,0.000014767495,0.00017948801],"category_scores_gemma":[0.000005703183,0.000053938023,0.000034263994,0.000063713844,0.00009147246,0.00005202168,0.000060502432,0.00006718389,0.000044214863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004038543,0.000035178742,0.00081478094,0.0000012453896,0.000016082697,1.2608255e-7,0.00016596352,7.994737e-8,0.00003194293,0.9952299,0.00046243693,0.0032382442],"study_design_scores_gemma":[0.00024379992,0.000010303186,0.00034134087,0.0000025971397,0.000009775497,4.160357e-7,0.00023405884,0.000024746392,0.00080164697,0.98351717,0.014739808,0.0000743398],"about_ca_topic_score_codex":0.00003714774,"about_ca_topic_score_gemma":5.6522106e-7,"teacher_disagreement_score":0.21268125,"about_ca_system_score_codex":0.0000043838063,"about_ca_system_score_gemma":0.000007845978,"threshold_uncertainty_score":0.21995288},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99284106,0.0014045476,0.00008107001,0.0000146945495,0.0018933581,0.00013688313,0.0000043479313,0.00021827321,0.0034057507],"genre_scores_gemma":[0.9998066,0.000030904626,0.000015440746,0.0000200044,0.000024009643,0.000019240699,0.0000026725754,0.000030210529,0.00005090709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993174,0.000033090317,0.00013767881,0.000103426886,0.00009252808,0.00031588043],"domain_scores_gemma":[0.9996011,0.00007001005,0.000014988914,0.00015052377,0.000016520726,0.00014682485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020089927,0.00014710875,0.0001662063,0.000051917574,0.00006970593,0.000021187183,0.00007778071,0.00008792666,0.000017485572],"category_scores_gemma":[0.0000070169026,0.00014884207,0.00004385056,0.0001308791,0.000040348543,0.00020114091,0.000010897649,0.00012645665,0.000052459312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017279019,0.00008655524,0.009722817,0.00011076438,0.00013305803,0.000009323262,0.005251284,0.000059243655,0.027560415,0.95514035,0.0013025003,0.00060638966],"study_design_scores_gemma":[0.0065471563,0.0005163039,0.12077335,0.0003334167,0.00036341872,0.00038840502,0.0047864406,0.0034408362,0.14772627,0.6995858,0.012537111,0.0030014908],"about_ca_topic_score_codex":0.0000070101705,"about_ca_topic_score_gemma":0.0000018026241,"teacher_disagreement_score":0.25555456,"about_ca_system_score_codex":0.000020551919,"about_ca_system_score_gemma":0.0000033390747,"threshold_uncertainty_score":0.6069603},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8914165,0.00031963503,0.000027187449,0.0000021865885,0.006351018,0.000142918,0.0000042752636,0.00044875455,0.10128755],"genre_scores_gemma":[0.99957347,0.0000071853456,0.000006492988,0.000013957686,0.000008714867,0.00003571622,0.000002645409,0.000036069883,0.0003157309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929875,0.000044916098,0.00017767042,0.00013049527,0.00012115659,0.00022701298],"domain_scores_gemma":[0.99950534,0.000039936567,0.000023155837,0.0003192834,0.00002274867,0.000089517795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016869961,0.00014205986,0.00016733195,0.00007118015,0.00005588514,0.00002055996,0.00017391663,0.00008385247,0.00008985007],"category_scores_gemma":[0.00001004011,0.0001362332,0.000049449965,0.00014760093,0.000019590287,0.00007573548,0.000011813221,0.00012985151,0.00042335922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009366371,0.000030436782,0.00043783177,0.000044913875,0.000037840666,0.000012968857,0.0005423651,0.00017835473,0.0001429315,0.9945396,0.003951879,0.00007152174],"study_design_scores_gemma":[0.0018518692,0.0003904539,0.003484235,0.00024643374,0.000047545014,0.000038561597,0.00087572995,0.0054228,0.007272455,0.96961606,0.009757199,0.0009966374],"about_ca_topic_score_codex":0.00011749639,"about_ca_topic_score_gemma":0.000004648966,"teacher_disagreement_score":0.10815702,"about_ca_system_score_codex":0.00003753931,"about_ca_system_score_gemma":0.00000697667,"threshold_uncertainty_score":0.5555429},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97249514,0.00022545266,0.001240902,0.0065071927,0.004557286,0.0003328612,8.5133127e-7,0.00023575834,0.014404566],"genre_scores_gemma":[0.99673885,0.000019782483,0.00012699004,0.002548042,0.000036910827,0.000012666359,7.085388e-7,0.000009355505,0.0005067106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861664,0.00016054382,0.0002439763,0.0003894681,0.0002759266,0.00031347087],"domain_scores_gemma":[0.9987576,0.0002969728,0.00007392219,0.0006909527,0.0000803222,0.000100231446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004857619,0.0001848847,0.00021367254,0.00007270658,0.00030538073,0.0002838848,0.00065302127,0.000096339216,0.00002012107],"category_scores_gemma":[0.00006695941,0.00012630137,0.000078754536,0.0003342293,0.000036770623,0.00024236483,0.00009046515,0.00021507377,0.000097248834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005903142,0.000056981742,0.000076295095,0.0000019875422,0.000012295232,0.000010100911,0.00035507474,0.000011604842,0.0004074208,0.9804588,0.01517552,0.0034280114],"study_design_scores_gemma":[0.0010511733,0.0007635554,0.0046464666,0.000089864734,0.000012104556,0.00010481949,0.00011928954,0.027051946,0.0011123248,0.9538408,0.010767362,0.00044029002],"about_ca_topic_score_codex":0.000026471322,"about_ca_topic_score_gemma":0.00000350305,"teacher_disagreement_score":0.027040342,"about_ca_system_score_codex":0.000042219133,"about_ca_system_score_gemma":0.000024157247,"threshold_uncertainty_score":0.51504207},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3761984,0.00039462626,0.48172122,0.0022408455,0.013233457,0.0006884013,0.000002028547,0.0015419801,0.12397902],"genre_scores_gemma":[0.98121864,0.000007488745,0.018432375,0.00015050909,0.00000900293,0.000009802988,0.0000010371859,0.000005556275,0.00016556957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993552,0.000027524482,0.0001164806,0.00012940065,0.00014280381,0.00022862291],"domain_scores_gemma":[0.9995505,0.000030520972,0.000045420195,0.00023852436,0.000036075995,0.000098932935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016620234,0.000075373704,0.00007178373,0.000055315875,0.00008639383,0.00007557729,0.00021076093,0.00003651946,0.000053588108],"category_scores_gemma":[0.000019770705,0.000076965865,0.00003097519,0.00023988943,0.000015040324,0.00084383006,0.00009841202,0.000076345656,0.0001618709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.8232555e-7,0.00003452992,0.013794235,0.0000037225175,0.000005226286,6.6347417e-7,0.0003611352,0.000039014958,0.00014816922,0.97185725,0.0006745601,0.013080793],"study_design_scores_gemma":[0.0031849616,0.00018695828,0.18557587,0.000088072215,0.000028329348,0.00015731294,0.00013307559,0.04836494,0.008083854,0.6794737,0.073266365,0.0014565337],"about_ca_topic_score_codex":0.000009374573,"about_ca_topic_score_gemma":9.2753817e-7,"teacher_disagreement_score":0.6050202,"about_ca_system_score_codex":0.000042220916,"about_ca_system_score_gemma":0.000027181002,"threshold_uncertainty_score":0.31385767},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87289786,0.0008025768,0.004575597,0.00052958285,0.003187964,0.00034826598,0.000009488209,0.0010405976,0.11660807],"genre_scores_gemma":[0.9976976,0.00009060522,0.001827692,0.00014611022,0.000015373806,9.061071e-7,0.000008939994,0.00001910088,0.00019368094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941593,0.000012788829,0.0001909886,0.000100348516,0.00011638574,0.00016355631],"domain_scores_gemma":[0.9996772,0.000025936446,0.000031469048,0.0001772658,0.00002322827,0.000064905835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005107742,0.00011390386,0.00014980651,0.000060912476,0.000017625709,0.000023449205,0.00013243266,0.000049190974,0.00013072044],"category_scores_gemma":[0.00000782145,0.00012216448,0.000046894984,0.00015707375,0.000008640756,0.000108629254,0.0000069663447,0.000116766285,0.000024867197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021241676,0.00020264352,0.012992294,0.00012364767,0.00010332508,0.000024506973,0.0008387753,0.057488784,0.0075288056,0.88075733,0.028733902,0.011184729],"study_design_scores_gemma":[0.004974132,0.0006409793,0.050793253,0.00032527835,0.00006895439,0.000015519567,0.000066002875,0.020217841,0.0739357,0.8402972,0.007487861,0.0011772449],"about_ca_topic_score_codex":0.000015138574,"about_ca_topic_score_gemma":0.0000027828235,"teacher_disagreement_score":0.12479973,"about_ca_system_score_codex":0.000019525345,"about_ca_system_score_gemma":0.000025403588,"threshold_uncertainty_score":0.49817228},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9975636,0.0000390002,0.00012576305,0.00013272518,0.0003000691,0.00032714175,0.000017865452,0.0000835563,0.0014103034],"genre_scores_gemma":[0.9996662,0.000007644907,0.00014715573,0.000027038765,0.0000068581044,0.00005768269,0.000013983536,0.000028381779,0.000045013316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872506,0.00013177673,0.0003386846,0.0002567804,0.00022812004,0.00031957676],"domain_scores_gemma":[0.9990914,0.0002714299,0.00003998522,0.00036411753,0.00007049651,0.0001626055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007187148,0.00018641561,0.00031845237,0.00014751534,0.00007025257,0.00003707966,0.000303467,0.00008491781,0.000013690557],"category_scores_gemma":[0.00009043427,0.00016762652,0.00010756369,0.0004417222,0.000092842696,0.0001520572,0.000034091336,0.0002805715,0.00005346806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028855631,0.00021718226,0.0648484,0.00003205562,0.000046332163,0.000008965067,0.0024384847,0.0000018933059,0.00041717294,0.9311507,0.0003843416,0.00042564297],"study_design_scores_gemma":[0.0013171742,0.00010059866,0.014508279,0.000041637548,0.00004845131,0.0000030315437,0.00027657585,0.00005471917,0.0033267364,0.97988236,0.0002301521,0.00021028206],"about_ca_topic_score_codex":0.00008524159,"about_ca_topic_score_gemma":0.000035469217,"teacher_disagreement_score":0.050340123,"about_ca_system_score_codex":0.00004335505,"about_ca_system_score_gemma":0.00005691088,"threshold_uncertainty_score":0.6835611},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98612887,0.0001895392,0.000058067897,0.0000017577191,0.0005902688,0.00012128873,0.000003841501,0.00018157782,0.012724781],"genre_scores_gemma":[0.99978167,0.000009983644,0.00012990697,0.000004853925,0.000002659185,0.000018950212,0.0000018475146,0.000024681744,0.00002542415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993617,0.000036890393,0.00019808799,0.00010264126,0.00011450373,0.0001861719],"domain_scores_gemma":[0.99954677,0.00002773154,0.000046681784,0.00027300732,0.00004161493,0.000064196385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014084192,0.00012978613,0.00020942923,0.00007863356,0.000032990265,0.000006409982,0.00016226762,0.000060110353,0.00004998148],"category_scores_gemma":[0.0000066854736,0.00011072873,0.000050625073,0.00027257422,0.000066092565,0.000102542646,0.000014268844,0.00008475627,0.000026252783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039048362,0.00013495637,0.02414163,0.00033431884,0.0002752573,0.000015944443,0.003495574,0.00010409759,0.0057077813,0.9644253,0.00087272946,0.00045336309],"study_design_scores_gemma":[0.001396649,0.00046940442,0.042940162,0.0003031343,0.000099903395,0.000029198536,0.00049798965,0.0007883937,0.2002797,0.7519844,0.0006108185,0.00060020626],"about_ca_topic_score_codex":0.000026716347,"about_ca_topic_score_gemma":0.000007737463,"teacher_disagreement_score":0.21244086,"about_ca_system_score_codex":0.000010215801,"about_ca_system_score_gemma":0.000007536816,"threshold_uncertainty_score":0.45153865},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9720909,0.0004442034,0.016420295,0.0002316456,0.005013832,0.00015682151,7.4574206e-7,0.00008885892,0.0055527086],"genre_scores_gemma":[0.99931604,0.0000062857093,0.0005221255,0.00005820955,0.000013359063,0.000008311413,4.570125e-7,0.000006430415,0.00006879845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895436,0.00011458139,0.00022194654,0.00025831442,0.00026856133,0.00018226591],"domain_scores_gemma":[0.9991483,0.00011220705,0.000112486516,0.0003522819,0.00014302314,0.00013170847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005993636,0.00010558632,0.00020380254,0.00006661859,0.000053771597,0.00008662973,0.00036370556,0.00006905561,0.0000035363585],"category_scores_gemma":[0.000059175698,0.00009533558,0.000038891943,0.00018268653,0.000039243456,0.00040032505,0.00020857231,0.00009586416,0.0000135739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013335463,0.00008094267,0.0064620255,0.000015298809,0.000025673835,0.000010733062,0.0007823189,0.000014261575,0.00020027411,0.9868856,0.0013494948,0.004160049],"study_design_scores_gemma":[0.0030057004,0.0010403066,0.013983029,0.00009380352,0.000018719946,0.00011752769,0.00051917386,0.035724495,0.0016658927,0.9371181,0.0062742983,0.0004389633],"about_ca_topic_score_codex":0.00019740246,"about_ca_topic_score_gemma":0.000043122996,"teacher_disagreement_score":0.0497675,"about_ca_system_score_codex":0.00003866947,"about_ca_system_score_gemma":0.000033396787,"threshold_uncertainty_score":0.3887672},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3082239,0.00051706686,0.39893708,0.004247366,0.0070473203,0.00065647013,0.0000051371535,0.0070189796,0.2733467],"genre_scores_gemma":[0.9582465,0.0000022396816,0.041145418,0.0003794343,0.000005623959,0.000012178261,0.0000016952416,0.000012697501,0.00019416626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998669,0.000044865974,0.00017869208,0.00036593943,0.0004718245,0.00026963738],"domain_scores_gemma":[0.998843,0.00005327908,0.00008466763,0.0006259264,0.0001996292,0.00019345674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003688941,0.00014895243,0.00014935213,0.00015249247,0.0000620432,0.00050215574,0.0013735984,0.0000659022,0.0000016457757],"category_scores_gemma":[0.00017984869,0.00014018109,0.0000511975,0.00058111566,0.00008273761,0.0011164767,0.00028849966,0.00015273251,0.00015985922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022325378,0.000068533474,0.0002131282,0.0000039939064,0.0000066060175,0.000036631474,0.00007001552,0.0000019750235,0.000088494984,0.96800804,0.007211599,0.024288734],"study_design_scores_gemma":[0.0002650486,0.00020889344,0.00012927224,0.00002904566,0.0000026652322,0.000009854013,0.0000034564337,0.00029538223,0.0051544956,0.99166965,0.0020500375,0.00018219624],"about_ca_topic_score_codex":0.000011620462,"about_ca_topic_score_gemma":4.575783e-7,"teacher_disagreement_score":0.6500226,"about_ca_system_score_codex":0.000058011494,"about_ca_system_score_gemma":0.00016164576,"threshold_uncertainty_score":0.5716419},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9915089,0.000318818,0.0053682,0.00045518568,0.00053101406,0.00015510723,9.00915e-7,0.00010578439,0.0015560625],"genre_scores_gemma":[0.99629575,0.000038561695,0.0034675596,0.00010006831,0.000006695374,0.0000038938297,0.0000010784414,0.0000072865,0.00007909264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875087,0.000087700675,0.00021453944,0.00031804462,0.00032923886,0.000299585],"domain_scores_gemma":[0.99911094,0.00014661264,0.00008411049,0.00044658905,0.00011155162,0.00010019475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043857613,0.000119930606,0.00018892447,0.00006786229,0.000106708074,0.000055109198,0.00051252614,0.0000632226,0.000006827095],"category_scores_gemma":[0.00010130542,0.00011979224,0.000044552227,0.00033489504,0.00008518134,0.00075707893,0.00017374747,0.0001543505,0.000019247855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010191136,0.00006003983,0.0019746493,0.000009856668,0.0000063824114,0.000007545662,0.0001558924,0.0000039165766,0.0032206506,0.97619677,0.00009108252,0.018263007],"study_design_scores_gemma":[0.0005097923,0.000106939355,0.01029984,0.000022656921,0.0000027115636,0.000012292965,0.000013966636,0.0014248324,0.0074460725,0.9797767,0.0002560939,0.00012809827],"about_ca_topic_score_codex":0.000008751308,"about_ca_topic_score_gemma":3.9305294e-7,"teacher_disagreement_score":0.018134909,"about_ca_system_score_codex":0.000037236536,"about_ca_system_score_gemma":0.00003797684,"threshold_uncertainty_score":0.48849857},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65441954,0.00013057658,0.29751104,0.015205281,0.0014449345,0.0007441896,0.000006059631,0.001495586,0.029042784],"genre_scores_gemma":[0.9947602,0.000007112594,0.0046374598,0.0005472609,0.0000036119336,0.0000053863473,0.0000016729559,0.0000050409685,0.000032249576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991071,0.000044589862,0.00019165104,0.00021580544,0.00028558684,0.00015522327],"domain_scores_gemma":[0.9991683,0.00004865498,0.00014025769,0.00048125722,0.00012768983,0.000033844008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024770427,0.00010665885,0.00012023008,0.00009403238,0.000076685355,0.00021712534,0.0010049263,0.000045544723,0.0000019033891],"category_scores_gemma":[0.00006881084,0.00007776561,0.00004624849,0.00057876325,0.000067524306,0.0005865872,0.00007744944,0.00009131847,0.000012075828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022994868,0.000060328428,0.00008356776,0.0000042443703,0.0000034982636,0.000003892622,0.00011742651,0.0000014521253,0.01668193,0.9574252,0.00024005459,0.025376126],"study_design_scores_gemma":[0.000089439316,0.00020882499,0.001646319,0.00005266643,0.0000028138068,0.0000022929055,0.000001620111,0.0007669903,0.16608603,0.8309358,0.00011001273,0.00009722508],"about_ca_topic_score_codex":0.0000028437737,"about_ca_topic_score_gemma":1.0141752e-7,"teacher_disagreement_score":0.34034064,"about_ca_system_score_codex":0.000016703558,"about_ca_system_score_gemma":0.000053260683,"threshold_uncertainty_score":0.31711894},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95697135,0.0006815371,0.0025489673,0.010667828,0.0061622974,0.0037651334,0.00002734853,0.00046476454,0.018710792],"genre_scores_gemma":[0.995061,0.00004525113,0.0005597307,0.0003166667,0.000041963973,0.0004911914,0.000008156334,0.000030125606,0.0034459094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991228,0.00004483515,0.0002673588,0.00013121846,0.00015975647,0.0002740582],"domain_scores_gemma":[0.99825317,0.001084637,0.00007709887,0.00041463584,0.00010065829,0.00006978252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037533048,0.00014282588,0.00017334138,0.000042977867,0.00035093923,0.00006298492,0.00032531645,0.000084031235,0.0005706766],"category_scores_gemma":[0.0001964656,0.00010045868,0.00013174821,0.0001735306,0.00008880938,0.0005065989,0.000028487002,0.0001367103,0.0004445982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000124052995,0.00007191245,0.000018252005,0.000043479464,0.000053659493,2.195449e-7,0.00056138437,0.00000103635,0.00007560261,0.9663334,0.032414876,0.0004137676],"study_design_scores_gemma":[0.0007806407,0.000061889106,0.00017146031,0.000010372388,0.000049916413,0.0000051138854,0.00054579315,0.00015984924,0.0018942088,0.9825337,0.013647431,0.0001396313],"about_ca_topic_score_codex":0.000010090536,"about_ca_topic_score_gemma":0.0000012336648,"teacher_disagreement_score":0.038089674,"about_ca_system_score_codex":0.000025693509,"about_ca_system_score_gemma":0.000027500986,"threshold_uncertainty_score":0.6248508},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98522687,0.00010518136,0.004373051,0.0033291522,0.0011494108,0.00026707645,0.0000047971243,0.000062649,0.0054817945],"genre_scores_gemma":[0.9993583,0.000006583394,0.00018049614,0.000062251864,0.0000055817136,0.0000017897563,6.100093e-7,0.000002439564,0.00038197511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938965,0.000025298013,0.00016508538,0.00013628544,0.00016006005,0.00012364128],"domain_scores_gemma":[0.99922687,0.0000610151,0.00010712694,0.000489357,0.00007626392,0.000039364444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008865127,0.000061703424,0.00010576482,0.00002312017,0.000078357356,0.00001313105,0.0006675779,0.00003775727,0.0000057240222],"category_scores_gemma":[0.000009364582,0.00004669312,0.000074057614,0.00051290856,0.00004868965,0.00012615795,0.00009526931,0.000092024646,0.000006084971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011875617,0.00007386301,0.00044602167,0.0000023073649,0.000004746426,3.3716984e-7,0.00006594528,0.00003820008,0.0011921249,0.9895139,0.0027980332,0.005863361],"study_design_scores_gemma":[0.0009780425,0.00024585915,0.05319072,0.00004119523,0.000024770028,0.00001215286,0.000040067123,0.005868443,0.007741571,0.9245429,0.007112502,0.0002017558],"about_ca_topic_score_codex":0.000018089877,"about_ca_topic_score_gemma":0.0000035023975,"teacher_disagreement_score":0.06497095,"about_ca_system_score_codex":0.00002338524,"about_ca_system_score_gemma":0.00007400846,"threshold_uncertainty_score":0.19040902},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9871922,0.00053562375,0.000044084823,0.000038125327,0.0015898563,0.00011274945,0.00000904692,0.00002009085,0.010458229],"genre_scores_gemma":[0.9994834,0.000009999063,0.00019389395,0.00005629697,0.000006592511,0.0000053310396,0.0000014970416,0.000009986017,0.00023300778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977452,0.0003070156,0.0006549364,0.00016053545,0.0008907359,0.00024155705],"domain_scores_gemma":[0.99694985,0.001645929,0.000350823,0.00066635676,0.00026922373,0.000117833566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003214089,0.00011056562,0.00042137064,0.00018457197,0.000046867615,0.00001524919,0.00069080177,0.00008677256,0.00018331714],"category_scores_gemma":[0.0014469174,0.000084660336,0.000120045865,0.00075186236,0.00023321155,0.00030482566,0.00013321766,0.00008595999,0.00013626917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032756743,0.00028905657,0.028418656,0.000030637,0.000022005766,0.0000015429725,0.001483495,0.000003888036,0.009863526,0.9557999,0.0023085675,0.0017459677],"study_design_scores_gemma":[0.00049329066,0.00009522409,0.07010452,0.00003568777,0.000012914592,0.0000031295738,0.00074092514,0.000025272535,0.020113936,0.90731335,0.0009499123,0.00011182669],"about_ca_topic_score_codex":0.000026877753,"about_ca_topic_score_gemma":6.6040616e-7,"teacher_disagreement_score":0.048486535,"about_ca_system_score_codex":0.00002019301,"about_ca_system_score_gemma":0.000069493966,"threshold_uncertainty_score":0.34523484},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9809178,0.000013893948,0.000014067093,0.00070715515,0.00018109247,0.0003805437,0.00000407347,0.000047906364,0.017733475],"genre_scores_gemma":[0.99940395,0.000003223771,0.00012137898,0.00009210191,0.0000044320464,0.000090606176,0.0000015005247,0.000014422025,0.00026836293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930876,0.0000754012,0.00018547574,0.00012380554,0.00014302428,0.00016354569],"domain_scores_gemma":[0.99853843,0.0007965024,0.000099608864,0.00047087306,0.000047884776,0.00004670496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021270842,0.00010489892,0.00014603755,0.000043890625,0.00011600363,0.000021503494,0.00029932254,0.00004819838,0.00031703548],"category_scores_gemma":[0.00010287257,0.00007110082,0.00009373979,0.00023298948,0.000116109375,0.000049984355,0.000024133378,0.00013712466,0.00012676493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043248065,0.00018090759,0.00021317942,0.000009750175,0.000024362762,3.6681726e-7,0.00024551185,3.5239006e-7,0.0010875838,0.989289,0.008835556,0.00010914095],"study_design_scores_gemma":[0.00021835565,0.000054662556,0.0012801538,0.000016856184,0.000014830107,0.0000010843899,0.00013360365,0.000016197511,0.009904773,0.98805517,0.00022184348,0.000082453014],"about_ca_topic_score_codex":0.000015893114,"about_ca_topic_score_gemma":0.0000020945872,"teacher_disagreement_score":0.01848618,"about_ca_system_score_codex":0.000009500632,"about_ca_system_score_gemma":0.0000105892,"threshold_uncertainty_score":0.3471316},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9958789,0.000026176904,0.00001760693,0.00003851202,0.00031201093,0.00019489009,0.000018869137,0.00010674876,0.003406337],"genre_scores_gemma":[0.99948066,0.0000033160734,0.00036785385,0.00005381433,0.000007718148,0.000029782519,0.000014468386,0.000017703163,0.000024670948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990294,0.00020309695,0.00025862598,0.000132157,0.00016157946,0.00021514892],"domain_scores_gemma":[0.9987127,0.00038445764,0.00014336548,0.0005654884,0.00007456483,0.000119417695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006671722,0.000118705575,0.00020505185,0.000072620554,0.00009889714,0.000008279119,0.00020255236,0.000080011705,0.000076945245],"category_scores_gemma":[0.00017826307,0.00010958505,0.000071606955,0.00026980255,0.00007969795,0.00012655099,0.000020144098,0.00011043149,0.00002981947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019539688,0.00092280627,0.01072426,0.000025872456,0.000025188618,1.7294248e-7,0.0007460248,2.0590645e-7,0.0026527266,0.9843618,0.00038199578,0.00013936151],"study_design_scores_gemma":[0.00033275055,0.0001097585,0.011186579,0.000015400032,0.000027280097,7.515526e-7,0.00017795117,0.000006170948,0.027359398,0.9604489,0.00021387667,0.00012115711],"about_ca_topic_score_codex":0.000010779397,"about_ca_topic_score_gemma":0.00000221553,"teacher_disagreement_score":0.024706671,"about_ca_system_score_codex":0.000012312534,"about_ca_system_score_gemma":0.00001119519,"threshold_uncertainty_score":0.44687486},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9545316,0.00009940931,0.0000019278514,0.0034866475,0.001703809,0.000090651345,8.088505e-7,0.00006770665,0.040017437],"genre_scores_gemma":[0.99298304,0.00004828489,0.00007627591,0.0009390814,0.00002324124,0.0000035970145,0.0000013806945,0.000003797686,0.0059213173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993467,0.00002992053,0.00008205276,0.00015138363,0.00020381685,0.00018616073],"domain_scores_gemma":[0.999641,0.000061573715,0.000036605645,0.00010013906,0.0000236767,0.00013702258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003043778,0.000054566033,0.00006243103,0.000026847116,0.00043934863,0.00018061452,0.00017047458,0.00006710775,0.00034186296],"category_scores_gemma":[0.00011390401,0.00005208785,0.000018578097,0.00014363306,0.00027908763,0.0011093679,0.000032520024,0.0001206283,0.000051706913],"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.0000013651814,0.000019869292,0.014013609,0.0000012927029,0.0000014083734,0.0000017768012,0.003275419,2.0104645e-8,0.00081659114,0.95570207,0.025207607,0.0009589459],"study_design_scores_gemma":[0.00015583853,0.000039820567,0.0071891234,0.0000034992424,0.000002881518,0.0000010664291,0.00031932833,0.000012088671,0.00066761207,0.4282415,0.5632582,0.00010910881],"about_ca_topic_score_codex":0.0001346607,"about_ca_topic_score_gemma":0.000057457186,"teacher_disagreement_score":0.53805053,"about_ca_system_score_codex":0.0000056991967,"about_ca_system_score_gemma":0.00010203793,"threshold_uncertainty_score":0.37431595},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906188,0.00013012663,0.006566775,0.00009166955,0.0002481022,0.00014435843,0.0000015001204,0.000083092906,0.002115552],"genre_scores_gemma":[0.99282014,0.000027576521,0.007097986,0.000026619417,0.0000013873049,0.000009263223,0.0000014970698,0.0000075671883,0.000007953743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885833,0.00013630495,0.00019584135,0.00029875184,0.00027581933,0.00023493666],"domain_scores_gemma":[0.9991379,0.00010007245,0.000058963178,0.00044891323,0.00013656789,0.000117611395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036173,0.00010768305,0.00017186547,0.00019120298,0.00009962788,0.000021583632,0.00056631345,0.000056032284,0.00001518323],"category_scores_gemma":[0.000056832032,0.0001036183,0.000055329143,0.00061995746,0.0005797761,0.00044208072,0.0002531288,0.00015480259,0.0000055723785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016484639,0.00009577463,0.014504409,0.0000144199585,0.0000122997,0.0000059014137,0.000951447,1.5190518e-7,0.00072382967,0.98259264,0.000018654375,0.001063985],"study_design_scores_gemma":[0.00040178554,0.00017964665,0.083927445,0.000008346626,0.0000029871414,0.000009387662,0.000052793304,0.00065879675,0.0032678333,0.9113784,0.000011873653,0.00010072141],"about_ca_topic_score_codex":0.000035127032,"about_ca_topic_score_gemma":0.0000049844293,"teacher_disagreement_score":0.07121426,"about_ca_system_score_codex":0.00000991757,"about_ca_system_score_gemma":0.00002084785,"threshold_uncertainty_score":0.42254317},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8502428,0.0005372774,0.052815344,0.0014405092,0.042504966,0.0005755895,0.0000034863656,0.001314145,0.05056588],"genre_scores_gemma":[0.99771667,0.0000039032175,0.0013026689,0.00025328674,0.0000372144,0.000025580246,0.000004267828,0.000015909136,0.0006405268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982932,0.00019745775,0.0003371979,0.00042518068,0.00036503715,0.0003819093],"domain_scores_gemma":[0.99838614,0.00010715345,0.0001292596,0.0007044225,0.00040043064,0.00027260947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006357638,0.00018826067,0.00026200523,0.00012738448,0.00012450016,0.00023559261,0.00087694015,0.0001203709,0.0000143859825],"category_scores_gemma":[0.000078397585,0.00017632966,0.00010123168,0.00061150175,0.00004007819,0.00043691383,0.00020305652,0.00018634707,0.00026387512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000092782475,0.00006365585,0.00063877914,0.0000041563826,0.000029258139,0.000028758901,0.0005186569,0.00015892494,0.00008290913,0.95495945,0.04296671,0.0005394443],"study_design_scores_gemma":[0.0056785783,0.0011786276,0.002988104,0.00012076426,0.000027317283,0.00025611115,0.0005300738,0.09127354,0.0030330156,0.83045554,0.063100494,0.0013578497],"about_ca_topic_score_codex":0.00014035606,"about_ca_topic_score_gemma":0.000030223167,"teacher_disagreement_score":0.14747384,"about_ca_system_score_codex":0.00008314314,"about_ca_system_score_gemma":0.00011396545,"threshold_uncertainty_score":0.7190515},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9795764,0.00006539166,0.0002665808,0.0019849783,0.00041644793,0.00052302255,0.000004061314,0.00015566533,0.017007431],"genre_scores_gemma":[0.99814457,0.0000023726514,0.00053614785,0.00012981653,0.0000102748245,0.0001237657,0.0000016772505,0.000028129862,0.0010232405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877876,0.00011683391,0.0002295558,0.00024795337,0.00031591163,0.0003109886],"domain_scores_gemma":[0.99821067,0.0005237751,0.000093123155,0.0007795341,0.0001628188,0.00023010191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062963896,0.00016985367,0.00018048217,0.00007221934,0.00033360368,0.00007992078,0.00045971217,0.00007778507,0.00001530849],"category_scores_gemma":[0.00029785532,0.00011226009,0.00006475706,0.00057101814,0.000113546404,0.000074898766,0.00008123795,0.0002277364,0.000081079816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000122018864,0.00010629685,0.00056096,0.000003942575,0.000040356736,0.0000055915043,0.0007716249,0.000002431162,0.00019213039,0.97982013,0.018174537,0.00020000056],"study_design_scores_gemma":[0.00067167595,0.00018209357,0.0004295852,0.000018338918,0.000031310497,0.0000103687225,0.0009256092,0.000009101791,0.001861225,0.9862866,0.009401492,0.00017264452],"about_ca_topic_score_codex":0.000022698583,"about_ca_topic_score_gemma":0.000070999005,"teacher_disagreement_score":0.018568154,"about_ca_system_score_codex":0.000029269431,"about_ca_system_score_gemma":0.000080431506,"threshold_uncertainty_score":0.45778337},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928756,0.000026690994,0.0011374666,0.0006178363,0.0014195505,0.00023645771,0.0000031790069,0.00014626958,0.0035369624],"genre_scores_gemma":[0.99425757,0.0000053113085,0.0054698857,0.00014240183,0.000004792989,0.000019653198,8.0062324e-7,0.000015135046,0.000084436404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984597,0.000111057285,0.00022871517,0.00037892777,0.000435605,0.0003860153],"domain_scores_gemma":[0.99763525,0.0010370244,0.000120131874,0.0009161145,0.00014663384,0.00014482673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000575063,0.00015494628,0.00023861037,0.00017064132,0.000090587666,0.000049621016,0.0013031515,0.000088570756,0.000019536212],"category_scores_gemma":[0.00049223704,0.00014505655,0.00010748203,0.00052906433,0.00016987525,0.0002944434,0.00028206347,0.00046803374,0.000035949295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007033499,0.00011312255,0.0010298421,0.0000054815655,0.000018853363,0.00001939509,0.0005916403,0.0000070531023,0.024699297,0.9687848,0.000113803835,0.0045463443],"study_design_scores_gemma":[0.0009755662,0.0005730823,0.005075136,0.000020822357,0.0000036151598,0.0000056306876,0.00002075931,0.0009041502,0.016702266,0.9742183,0.0013351459,0.00016550065],"about_ca_topic_score_codex":0.000018851735,"about_ca_topic_score_gemma":0.000022261582,"teacher_disagreement_score":0.007997029,"about_ca_system_score_codex":0.000018743674,"about_ca_system_score_gemma":0.00006241996,"threshold_uncertainty_score":0.5915234},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96941185,0.00014798662,0.0000062813483,0.000016444486,0.0020097482,0.00009446356,0.0000018161413,0.0000915121,0.02821992],"genre_scores_gemma":[0.9998391,0.0000071639747,0.000015677502,0.000024845716,0.000012110247,0.000016842125,0.0000010141498,0.000020707832,0.000062525774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994255,0.000056036435,0.00015675616,0.000050404095,0.00012365646,0.00018768119],"domain_scores_gemma":[0.99943775,0.00018462671,0.000027468339,0.00028575168,0.00001527706,0.00004912682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002726616,0.00009880699,0.00013093086,0.000026933603,0.00004800519,0.000005245239,0.00014815218,0.000050779818,0.00011320781],"category_scores_gemma":[0.000028297103,0.0000691798,0.000070521346,0.00017750247,0.000033478318,0.00006208504,0.000012129691,0.00010696443,0.00029049735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027205929,0.000043227414,0.005768056,0.000037267913,0.000040460727,3.402348e-7,0.00041000964,0.000047645015,0.000548013,0.99147576,0.0015658662,0.000060632527],"study_design_scores_gemma":[0.0005463312,0.000045547236,0.00838583,0.00013059287,0.000040994717,0.000017027156,0.0003596552,0.0010543292,0.016223384,0.9697008,0.0031735764,0.0003219332],"about_ca_topic_score_codex":0.0000036905824,"about_ca_topic_score_gemma":1.663678e-7,"teacher_disagreement_score":0.030427285,"about_ca_system_score_codex":0.000009448637,"about_ca_system_score_gemma":0.0000022681218,"threshold_uncertainty_score":0.37338528},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98819584,0.00033059056,0.0032706463,0.00029497,0.0022078315,0.00022739683,0.0000020924226,0.0003593785,0.0051112697],"genre_scores_gemma":[0.9930832,0.000035763434,0.0060572024,0.0007072487,0.000013413421,0.000015562688,0.0000015121957,0.000014088233,0.0000720469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985269,0.00014010261,0.0002849762,0.00029088784,0.00029488615,0.00046228894],"domain_scores_gemma":[0.99839693,0.00053912273,0.00016614592,0.00062953634,0.00008760959,0.00018062872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036097816,0.00019465161,0.00025828433,0.000079682126,0.00006904486,0.000028998056,0.00070968445,0.000110881185,0.000014237263],"category_scores_gemma":[0.00013857325,0.00017187561,0.000109611916,0.00022498186,0.00005286209,0.0005827624,0.0002166389,0.00020993955,0.00004844113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000095229825,0.0003776525,0.0021104533,0.000011450814,0.00002393143,0.0000070271963,0.00094587245,0.000005590049,0.00028401357,0.9948482,0.00062579167,0.00075050764],"study_design_scores_gemma":[0.00051384495,0.00039601285,0.0037886363,0.000020590373,0.000008812708,0.000006877108,0.000020467334,0.00025675527,0.008523238,0.9850495,0.001185859,0.00022942656],"about_ca_topic_score_codex":0.000015811844,"about_ca_topic_score_gemma":0.0000016129827,"teacher_disagreement_score":0.009798707,"about_ca_system_score_codex":0.000044105233,"about_ca_system_score_gemma":0.000036065103,"threshold_uncertainty_score":0.7008884},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97294223,0.000040403484,0.002593127,0.000048946942,0.0008297031,0.0001914772,0.0000015943308,0.00012766449,0.023224864],"genre_scores_gemma":[0.9959129,0.0000046173495,0.0039677154,0.000043202643,7.8021054e-7,0.000012460864,3.4337307e-7,0.000007797692,0.000050155664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987197,0.00013999164,0.00020148793,0.00033390298,0.0003354404,0.0002694941],"domain_scores_gemma":[0.99835336,0.00022997543,0.00007533525,0.0011043615,0.00012946187,0.0001074856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005173535,0.000109989545,0.0001650308,0.0001435289,0.00006200177,0.000012044586,0.0011890458,0.0000501388,0.000050587074],"category_scores_gemma":[0.0001887084,0.00010074126,0.00008649413,0.0006394673,0.0001777355,0.00027471132,0.00024360322,0.00017914135,0.00006524329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025662659,0.00023617489,0.0038456954,0.000007961869,0.00000974669,0.0000049784803,0.00033032533,9.214508e-7,0.0002877165,0.99299204,0.00011976491,0.002139],"study_design_scores_gemma":[0.00032463679,0.00030336622,0.0131789865,0.000009234876,0.0000013456844,0.0000013845208,0.000009091038,0.000089754845,0.021415452,0.9645275,0.000043027303,0.00009620495],"about_ca_topic_score_codex":0.000018055121,"about_ca_topic_score_gemma":9.634687e-7,"teacher_disagreement_score":0.028464537,"about_ca_system_score_codex":0.000024238254,"about_ca_system_score_gemma":0.000035481982,"threshold_uncertainty_score":0.41081092},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99090624,0.00039030338,0.0015624497,0.0008145866,0.001744004,0.00015615836,6.237441e-7,0.0005041357,0.0039214836],"genre_scores_gemma":[0.9728157,0.0000036242282,0.026614895,0.00026957656,0.0000012592438,0.000013338173,0.0000024149858,0.00001608331,0.0002631302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998426,0.00007399463,0.00019645186,0.00044203416,0.0004983813,0.0003631312],"domain_scores_gemma":[0.9984476,0.00003624009,0.000088002154,0.0008326327,0.00028441648,0.00031110388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004858541,0.00018074093,0.00019390618,0.00013507012,0.0001186439,0.00014563746,0.00071542995,0.00005539636,0.0000034360016],"category_scores_gemma":[0.00003167452,0.00014423122,0.00005065649,0.00079004146,0.0000954719,0.00038870613,0.00019988877,0.00016400382,0.00011774368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000113124415,0.00008312381,0.0011970154,0.000002998097,0.000019017096,0.000042460833,0.0002890625,0.0003542596,0.00016494804,0.9915419,0.0058892923,0.00040460902],"study_design_scores_gemma":[0.0021834867,0.00039773458,0.00015785715,0.00002700977,0.0000108960585,0.000049245315,0.00003240838,0.0043074805,0.0023444765,0.98846334,0.0017513129,0.0002747678],"about_ca_topic_score_codex":0.00006957218,"about_ca_topic_score_gemma":0.0000030543265,"teacher_disagreement_score":0.025052445,"about_ca_system_score_codex":0.000025728255,"about_ca_system_score_gemma":0.0001364143,"threshold_uncertainty_score":0.58815783},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990715,0.00039285092,0.00071362755,0.0034200032,0.00035259372,0.00077115756,0.00000528025,0.000063755375,0.0035656977],"genre_scores_gemma":[0.99863046,0.00002921786,0.00054475403,0.0002568177,0.0000023139817,0.00009882687,0.0000012783157,0.000018486122,0.00041782114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796355,0.00037016088,0.00022598937,0.00039138578,0.00059754954,0.00045138557],"domain_scores_gemma":[0.9976919,0.0007052664,0.00016218542,0.0011003789,0.00021441195,0.0001258558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010747737,0.00020416308,0.0002667323,0.00009342025,0.0003025895,0.00018369316,0.0015482516,0.00007092019,0.00006469113],"category_scores_gemma":[0.000053107142,0.00010740015,0.000073051306,0.0006734747,0.0007899434,0.00055524893,0.0005450676,0.0004385846,0.00003792444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003750113,0.00011672111,0.008167351,0.000017762366,0.0000604947,0.000007061787,0.0009878911,0.0000022633396,0.00010380327,0.9883468,0.0008242338,0.0013280949],"study_design_scores_gemma":[0.0023741187,0.00021504724,0.015779661,0.00001568036,0.000008802616,0.000031610114,0.0003821614,0.00047399587,0.0008754252,0.97892904,0.0007429504,0.00017150135],"about_ca_topic_score_codex":0.00014481027,"about_ca_topic_score_gemma":0.00019880483,"teacher_disagreement_score":0.009417776,"about_ca_system_score_codex":0.00002075339,"about_ca_system_score_gemma":0.000060082824,"threshold_uncertainty_score":0.4379651},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9808744,0.00048411664,0.007272211,0.00078540156,0.0022035155,0.00029140033,0.0000014937701,0.00033238804,0.00775503],"genre_scores_gemma":[0.99397427,0.0000143431325,0.005705685,0.000120089855,0.0000038715953,0.00002040409,0.0000015389136,0.000015481533,0.00014434145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982305,0.00015931834,0.0002175059,0.00041054867,0.00048617125,0.00049591286],"domain_scores_gemma":[0.99882436,0.00016016122,0.00005929943,0.0006385093,0.00007963111,0.00023806293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010582497,0.00014653157,0.00018902935,0.00036941003,0.00007818283,0.0001080999,0.0012963391,0.00006332241,0.000004388821],"category_scores_gemma":[0.00015721937,0.00014719034,0.000047320347,0.0011160065,0.000070543865,0.0008003266,0.00029612813,0.00031739936,0.000121000536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012125762,0.000058036672,0.0062080384,0.0000046783684,0.000004828962,0.00009583229,0.0006892872,0.000018472982,0.00018863479,0.98963696,0.0007639062,0.002319196],"study_design_scores_gemma":[0.00082233595,0.000086202075,0.0024856993,0.000021826576,8.402764e-7,0.000017379578,0.000080557096,0.001166351,0.0005019325,0.99361485,0.0010273182,0.00017468748],"about_ca_topic_score_codex":0.000049796756,"about_ca_topic_score_gemma":0.000007904206,"teacher_disagreement_score":0.013099801,"about_ca_system_score_codex":0.00011077792,"about_ca_system_score_gemma":0.00007814187,"threshold_uncertainty_score":0.60022473},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97243845,0.00020369024,0.008053042,0.0009110851,0.0024015524,0.00041426282,0.000011862296,0.0003182698,0.015247792],"genre_scores_gemma":[0.99340206,0.00001014356,0.0063293944,0.00009652138,0.0000061417427,0.000010635122,0.0000020457583,0.000011989695,0.00013107744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823505,0.00017413999,0.00024335,0.0003592583,0.00065995206,0.0003282267],"domain_scores_gemma":[0.99819404,0.00023917951,0.00010892841,0.0009465375,0.00028093127,0.00023036741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007984454,0.00013757752,0.0002167144,0.00022950783,0.0000612737,0.000023949651,0.0012000264,0.000070407856,0.0000020741863],"category_scores_gemma":[0.0003892432,0.00012567206,0.00006876128,0.0010250597,0.00011889966,0.00026390376,0.00018258604,0.00025868166,0.00007113871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007106797,0.00015566908,0.0008082642,0.0000059303998,0.000013202018,0.000022039863,0.00027771536,0.00004849283,0.00024132757,0.9961837,0.0013829379,0.00078964425],"study_design_scores_gemma":[0.0010050093,0.00056910276,0.00076120434,0.00001876257,0.0000021468477,0.0000032913927,0.000023024637,0.0014646971,0.0074333344,0.9871842,0.0013971712,0.00013802569],"about_ca_topic_score_codex":0.000033356453,"about_ca_topic_score_gemma":0.0000016191243,"teacher_disagreement_score":0.020963607,"about_ca_system_score_codex":0.00005145127,"about_ca_system_score_gemma":0.00010672143,"threshold_uncertainty_score":0.5124758},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9779088,0.0000782559,0.0017378415,0.000079076584,0.0005413135,0.00014356017,0.0000016369627,0.00008700967,0.01942249],"genre_scores_gemma":[0.99534917,0.0000071509394,0.0036638908,0.000057876467,0.000007993149,0.0000025074487,0.0000024301655,0.00001165903,0.0008973445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992086,0.0000609425,0.00028085933,0.00010625015,0.00022266587,0.00012067197],"domain_scores_gemma":[0.9993075,0.000095225594,0.00016917748,0.00030290743,0.00008179079,0.000043410444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040468932,0.00009576846,0.00021085479,0.00006645052,0.00006522855,0.000011115066,0.00019041514,0.00006364369,0.00011517766],"category_scores_gemma":[0.0002737636,0.00009609218,0.00007051717,0.00016382655,0.000038406895,0.00019011101,0.000017159262,0.00006352716,0.000031640237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006599247,0.00023757982,0.00003249178,0.000051143084,0.000011864724,0.0000027638196,0.00074314344,0.0000014761414,0.0013767417,0.9941953,0.0030899043,0.0002510162],"study_design_scores_gemma":[0.00036060868,0.00008326863,0.00011608579,0.00003812243,0.000027547643,0.0000038965045,0.00003314661,0.00006990651,0.0036446846,0.9946942,0.00083051436,0.00009803016],"about_ca_topic_score_codex":0.0000015121672,"about_ca_topic_score_gemma":0.000001295646,"teacher_disagreement_score":0.018525146,"about_ca_system_score_codex":0.00003182106,"about_ca_system_score_gemma":0.00001997506,"threshold_uncertainty_score":0.39185256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97485125,0.00057792984,0.011485064,0.0015005298,0.00138259,0.0003899099,0.000006207907,0.00045055506,0.009355983],"genre_scores_gemma":[0.9958257,0.00003220949,0.0039234734,0.00011366126,0.0000037207733,0.000008259166,0.0000019570423,0.000008416864,0.00008261011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979924,0.00018328785,0.00033198408,0.0004534688,0.0005767764,0.00046209228],"domain_scores_gemma":[0.9975963,0.000315718,0.00014479,0.0015235737,0.00026584818,0.0001537429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048547765,0.00018288383,0.00030658263,0.0002937772,0.00012756344,0.00006712744,0.002829671,0.00008938621,0.000023135774],"category_scores_gemma":[0.00036691886,0.00017497646,0.00011563401,0.0015135044,0.00016587117,0.0005677599,0.00027748814,0.00024213576,0.000025979893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013487005,0.00022211266,0.0010412523,0.000007449499,0.00001529209,0.0000123971295,0.00022490232,0.000003093869,0.0029159852,0.98585546,0.00045972204,0.009228863],"study_design_scores_gemma":[0.00079335534,0.00058031816,0.009463477,0.000023903112,0.000003589716,0.0000066416173,0.00002698104,0.0004991161,0.008598869,0.97968423,0.00012792906,0.00019160818],"about_ca_topic_score_codex":0.000015692747,"about_ca_topic_score_gemma":0.0000034316245,"teacher_disagreement_score":0.020974461,"about_ca_system_score_codex":0.00002827874,"about_ca_system_score_gemma":0.00008807584,"threshold_uncertainty_score":0.7135333},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92556083,0.000119152755,0.008270798,0.010826971,0.007947295,0.001265245,0.000011380568,0.0005815112,0.045416802],"genre_scores_gemma":[0.9964404,0.0000017858879,0.0029287757,0.0005274684,0.00001266223,0.000016630951,0.0000021853175,0.000014525632,0.000055555727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709255,0.0005005892,0.00040476728,0.0006101019,0.0009962412,0.000395781],"domain_scores_gemma":[0.9965799,0.0007868128,0.00021775087,0.0018672503,0.00033951292,0.00020877215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016109509,0.00026737186,0.00036479326,0.00013152974,0.00015407846,0.00010150897,0.002224356,0.00011272603,0.000021434533],"category_scores_gemma":[0.00046482062,0.00019399023,0.00015318171,0.0008022958,0.00039017317,0.00018365576,0.0006163628,0.00037241916,0.000099250254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031332118,0.00041837312,0.0004464806,0.0000061321316,0.000020088397,0.00000967505,0.00044469984,0.00007537318,0.000065129054,0.992069,0.003990425,0.0024233048],"study_design_scores_gemma":[0.00083262235,0.0008739386,0.0052902177,0.000023187169,0.000005474271,0.000005923979,0.00004810552,0.010573499,0.0025832872,0.97910506,0.0004338452,0.00022482802],"about_ca_topic_score_codex":0.00009389665,"about_ca_topic_score_gemma":0.000011027154,"teacher_disagreement_score":0.07087957,"about_ca_system_score_codex":0.00013401454,"about_ca_system_score_gemma":0.0001455986,"threshold_uncertainty_score":0.7910692},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87402207,0.0001341984,0.11042572,0.0013113181,0.0038389256,0.0004563918,0.0000019305235,0.00036200875,0.009447424],"genre_scores_gemma":[0.9941045,0.000005462975,0.005317004,0.00027406897,0.00006387716,0.000045637546,0.0000026935543,0.000023118651,0.00016360698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817365,0.00019329847,0.0003603431,0.000502653,0.00033167246,0.00043838978],"domain_scores_gemma":[0.9983935,0.00017907516,0.00012685361,0.0010822358,0.00013141458,0.000086969725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043504575,0.00022453496,0.00032836088,0.000086280714,0.000164365,0.00022580817,0.0011156966,0.00012593906,0.0000040524947],"category_scores_gemma":[0.00012711993,0.00018067368,0.00006965003,0.00047295427,0.00006294937,0.0006955563,0.0003004136,0.00027224986,0.00003001011],"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.00003527193,0.00018766937,0.015647491,0.000037073045,0.00003081953,0.00003191547,0.0022866093,0.0021401583,0.00009591433,0.9699033,0.0057831956,0.0038205835],"study_design_scores_gemma":[0.005318657,0.0007564809,0.018179838,0.00056300353,0.000017415381,0.00012260533,0.00028150773,0.5122504,0.00084174715,0.43130627,0.029440979,0.0009210403],"about_ca_topic_score_codex":0.0004950154,"about_ca_topic_score_gemma":0.00048941973,"teacher_disagreement_score":0.538597,"about_ca_system_score_codex":0.00008154752,"about_ca_system_score_gemma":0.000051845025,"threshold_uncertainty_score":0.7367659},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9908613,0.0003999813,0.00010979001,0.0008172386,0.005907827,0.00010279123,8.3657056e-7,0.00021719525,0.0015830172],"genre_scores_gemma":[0.98669755,0.00002568112,0.012421201,0.00023251641,0.0000032817652,0.000003923074,0.000001232587,0.000011467375,0.00060315675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880165,0.000028710832,0.00026611701,0.00032254934,0.0002961902,0.00028475598],"domain_scores_gemma":[0.99867636,0.00008614619,0.00011526149,0.00081522454,0.00012844261,0.00017858086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002686463,0.00013750546,0.00020294366,0.00015919835,0.000089899346,0.00007343525,0.0007839258,0.000106325664,0.000025804191],"category_scores_gemma":[0.00006855301,0.00012292141,0.00009960869,0.0004987171,0.000077017125,0.00046434498,0.00019693101,0.0002459928,0.00007299084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001826297,0.00008548727,0.0034258014,0.0000072327675,0.000012098347,0.000002095857,0.000120056604,0.0000045342863,0.017670598,0.9704505,0.007355356,0.0008643986],"study_design_scores_gemma":[0.0005288714,0.00007606999,0.0015399792,0.000013986456,0.0000059489266,0.0000046116033,0.0000053820913,0.0005902563,0.024361428,0.9705309,0.002195492,0.00014703503],"about_ca_topic_score_codex":0.00013683895,"about_ca_topic_score_gemma":0.000004390595,"teacher_disagreement_score":0.012311411,"about_ca_system_score_codex":0.0000049150794,"about_ca_system_score_gemma":0.00013503844,"threshold_uncertainty_score":0.50125897},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9958011,0.00020798732,0.0010543597,0.00022275528,0.0007007088,0.00024542678,0.0000026340263,0.000044198736,0.001720841],"genre_scores_gemma":[0.9985672,0.000013721756,0.0012769218,0.000011318035,0.0000021395158,0.000019783763,8.932673e-7,0.000010448573,0.0000975589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821305,0.0003091145,0.00039626955,0.0002471557,0.00050478836,0.00032959384],"domain_scores_gemma":[0.99802566,0.00068201515,0.0001828807,0.000708648,0.00028783272,0.00011298887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013945953,0.000121872436,0.00028533247,0.00016976302,0.000060477487,0.00003229987,0.0010974461,0.000060903094,0.0000043917694],"category_scores_gemma":[0.00046227826,0.000094480856,0.000102936545,0.0016638061,0.00024781417,0.00031794937,0.000322713,0.00021176833,0.00001119366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079526915,0.0001275131,0.0047718463,0.000009039041,0.000019292422,0.00000761183,0.00095096935,0.000025197663,0.00066654786,0.9921828,0.00023900434,0.0009206747],"study_design_scores_gemma":[0.0017746387,0.00013228177,0.0035587142,0.000024573874,0.0000023376413,0.000011481261,0.00019817182,0.00044790778,0.0040956982,0.9895802,0.00007151306,0.000102478625],"about_ca_topic_score_codex":0.00011121181,"about_ca_topic_score_gemma":0.000011034896,"teacher_disagreement_score":0.0034291502,"about_ca_system_score_codex":0.000031067375,"about_ca_system_score_gemma":0.00011584018,"threshold_uncertainty_score":0.38528174},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9401288,0.00024286755,0.02353675,0.0029277548,0.001727123,0.00066027854,0.0000011068888,0.00040872008,0.030366596],"genre_scores_gemma":[0.99697846,0.000008009674,0.002538182,0.0001611237,0.0000045965403,0.000012691316,0.0000017073645,0.0000069195803,0.00028829835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985835,0.00014387819,0.00020241906,0.00035966287,0.0003336006,0.0003769642],"domain_scores_gemma":[0.9990656,0.00015886418,0.000054485772,0.0005463051,0.00007591751,0.00009887488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005353608,0.00012446969,0.00015712893,0.00024967446,0.00007873976,0.00007758868,0.00089347665,0.00006755117,0.00001193961],"category_scores_gemma":[0.00012471479,0.00013003775,0.000048897633,0.0011067401,0.00004772857,0.0007166258,0.00010100204,0.00019675487,0.00008473963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000146435295,0.00012375596,0.000501071,0.0000016677235,0.0000022995616,0.00002840426,0.0003456555,0.000023467186,0.0017299713,0.96881324,0.000352379,0.028063469],"study_design_scores_gemma":[0.0011102895,0.00015148353,0.011748679,0.000012648524,8.8896604e-7,0.0000036484423,0.000020121317,0.0025013455,0.0032700503,0.9806819,0.0003423455,0.000156603],"about_ca_topic_score_codex":0.0000103257635,"about_ca_topic_score_gemma":0.000010490534,"teacher_disagreement_score":0.056849666,"about_ca_system_score_codex":0.00012470556,"about_ca_system_score_gemma":0.0000502364,"threshold_uncertainty_score":0.53027856},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917873,0.0000125787765,0.0008689219,0.001836673,0.00434574,0.00037196733,0.000008042085,0.00009369574,0.00067508704],"genre_scores_gemma":[0.9977548,0.0000013330082,0.0018498581,0.00029394965,0.0000013344281,0.00004732099,0.0000030982255,0.0000067463393,0.00004153478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904263,0.000053542495,0.00022442463,0.0002758278,0.00021728118,0.00018631972],"domain_scores_gemma":[0.9981956,0.00060085265,0.00012895589,0.00079381344,0.00022104158,0.00005974624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072599505,0.0001073413,0.00014032707,0.000064051965,0.00015884792,0.000044270357,0.00056222413,0.00007845944,0.000016091582],"category_scores_gemma":[0.00028542874,0.00007333944,0.00011224363,0.00029701152,0.000125303,0.00012226473,0.00007304657,0.00019265545,0.00001399217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009905328,0.00009693176,0.00021564278,0.000009247524,0.000007019657,2.0558011e-7,0.00016424633,0.0000044698354,0.010803965,0.9855695,0.0022785515,0.00084031734],"study_design_scores_gemma":[0.00053644914,0.00017419705,0.0010486518,0.000011282715,0.000005872141,0.0000011074969,0.000005000331,0.0043071466,0.032480553,0.9607336,0.00060682517,0.00008929801],"about_ca_topic_score_codex":0.000021739836,"about_ca_topic_score_gemma":0.000005220412,"teacher_disagreement_score":0.02483588,"about_ca_system_score_codex":0.0000068605887,"about_ca_system_score_gemma":0.000047983216,"threshold_uncertainty_score":0.29906955},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97304535,0.00036748263,0.021288106,0.00088500435,0.0006078811,0.00044553765,0.0000015272019,0.00013863936,0.00322049],"genre_scores_gemma":[0.99883586,0.000033174478,0.0009217576,0.000111458045,0.0000034661632,0.000026949774,6.024425e-7,0.000011535528,0.000055184395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838585,0.0003710251,0.00023238055,0.00032800288,0.00035890585,0.00032384857],"domain_scores_gemma":[0.9978511,0.0008631994,0.00011687121,0.0009098845,0.00015653801,0.00010241839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011910382,0.00014082144,0.00026066724,0.00020528247,0.00017455452,0.00007185053,0.001165366,0.00006402286,0.0000041488443],"category_scores_gemma":[0.0003143165,0.00009958997,0.00008883016,0.00096550107,0.0005974143,0.00027477366,0.0004038201,0.0002200571,0.0000055022506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047357295,0.000028497658,0.0054069413,0.000010964134,0.000025315454,0.0000013970194,0.0004402121,0.0000034401812,0.00022864931,0.98934937,0.00007233951,0.004385531],"study_design_scores_gemma":[0.0023561034,0.000109329856,0.014204271,0.000014982551,0.000005053589,0.0000071976756,0.000029212073,0.0047520893,0.001040999,0.97704464,0.00031762884,0.00011850467],"about_ca_topic_score_codex":0.000056359953,"about_ca_topic_score_gemma":0.000016747847,"teacher_disagreement_score":0.02579054,"about_ca_system_score_codex":0.0000094758125,"about_ca_system_score_gemma":0.000029869867,"threshold_uncertainty_score":0.4061161},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99042445,0.00014418535,0.0049343486,0.0012795444,0.0008332968,0.00021544527,0.0000015199529,0.000087323795,0.002079864],"genre_scores_gemma":[0.9988846,0.000008751077,0.0008870436,0.00014940627,0.0000018978122,0.0000035346443,3.547925e-7,0.0000038702838,0.00006050841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861044,0.00032891004,0.00019354704,0.00022793152,0.00039816176,0.00024101445],"domain_scores_gemma":[0.9985554,0.0001099153,0.00009801843,0.0010490157,0.00012495737,0.00006269605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007429068,0.00009264303,0.00013373373,0.000077895966,0.000113838636,0.000026630047,0.0014839236,0.000045095094,0.000003579813],"category_scores_gemma":[0.00012564927,0.00006748709,0.000092064794,0.001111846,0.00010060763,0.00024669286,0.00025002466,0.0001840941,0.0000075124763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042738193,0.00007762822,0.002228283,0.0000035448984,0.0000045699962,0.0000018513416,0.00016479394,0.000007897498,0.0014070775,0.9854553,0.00013744195,0.010507363],"study_design_scores_gemma":[0.000289878,0.000101676786,0.04353394,0.000011155998,0.0000015586978,0.0000027969877,0.0000072114944,0.000266222,0.008834877,0.946547,0.00032852602,0.00007516784],"about_ca_topic_score_codex":0.000010976998,"about_ca_topic_score_gemma":0.0000012361595,"teacher_disagreement_score":0.041305657,"about_ca_system_score_codex":0.000026388127,"about_ca_system_score_gemma":0.000049102586,"threshold_uncertainty_score":0.2757524},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7357473,0.00012802951,0.24792482,0.0031420244,0.009249356,0.0010337979,0.000017811655,0.00078506605,0.0019718157],"genre_scores_gemma":[0.9701545,0.0000030414387,0.029405763,0.00029608476,0.000026926775,0.00003287497,0.0000109945,0.000006757715,0.00006306274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998499,0.00006814821,0.0003017922,0.00052845717,0.00024938016,0.0003532697],"domain_scores_gemma":[0.99870956,0.00018997859,0.00011670831,0.0006311599,0.00023411593,0.000118449396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042765515,0.00016700166,0.00021008508,0.0001146729,0.00021018297,0.00016762548,0.0006556519,0.00008549492,0.000016448355],"category_scores_gemma":[0.0001130663,0.00017098659,0.000117117364,0.00043350045,0.000055398832,0.00039267435,0.00009915578,0.00012400944,0.000040593957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066023103,0.0001945147,0.00021743902,0.000007441622,0.00000879036,0.0000038033872,0.00029773396,0.00012310939,0.00017682405,0.94750756,0.0028776168,0.048578568],"study_design_scores_gemma":[0.00091908936,0.00054328237,0.005188115,0.000012657457,0.000007082321,0.00006371252,0.000030523464,0.071686186,0.0010830758,0.91798973,0.0022259795,0.0002505767],"about_ca_topic_score_codex":0.0000062417394,"about_ca_topic_score_gemma":0.000001177378,"teacher_disagreement_score":0.2344072,"about_ca_system_score_codex":0.0001448034,"about_ca_system_score_gemma":0.000085221414,"threshold_uncertainty_score":0.69726306},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97528565,0.000029607076,0.00087108254,0.0010313119,0.0031999932,0.00050926395,0.000016948265,0.00006904041,0.018987114],"genre_scores_gemma":[0.9983448,0.0000021226517,0.0005592204,0.00042631812,0.000027093185,0.000046887963,0.000002412672,0.000026705724,0.00056443294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912006,0.000097827775,0.0002449407,0.00016846262,0.00017785694,0.00019085886],"domain_scores_gemma":[0.9946796,0.0044280333,0.00014313785,0.0005903199,0.00011794474,0.000040979183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067756925,0.00013983625,0.00022793798,0.000045384746,0.0003930066,0.000017079925,0.00030179942,0.00007142235,0.00007099689],"category_scores_gemma":[0.0009239912,0.00009077091,0.00014121138,0.00012625015,0.00014683549,0.000036069832,0.00006919339,0.00014972463,0.00001070719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028720797,0.000078719575,0.00016849062,0.00005143822,0.0000638772,1.3512168e-7,0.0003619091,0.000008088391,0.000016702681,0.9842634,0.014839342,0.00011914569],"study_design_scores_gemma":[0.0009002588,0.00017619622,0.0002202404,0.000034590346,0.00008079711,0.0000014057027,0.00004426148,0.00062052463,0.0007410107,0.98110914,0.015960388,0.000111213485],"about_ca_topic_score_codex":0.000006150504,"about_ca_topic_score_gemma":0.000004902717,"teacher_disagreement_score":0.023059167,"about_ca_system_score_codex":0.000018020508,"about_ca_system_score_gemma":0.000015566106,"threshold_uncertainty_score":0.37015304},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7997492,0.0001357698,0.000008737686,0.000053695116,0.0017478568,0.00008441713,0.000004919128,0.00003769129,0.19817771],"genre_scores_gemma":[0.9982725,0.000008740627,0.00030762955,0.00014168386,0.0000065423646,0.0000048287075,9.573389e-7,0.000011658182,0.0012454737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977032,0.00024520516,0.00061874645,0.00033033604,0.00085608236,0.00024646317],"domain_scores_gemma":[0.9974758,0.0010139999,0.0002526277,0.0008418077,0.00028402344,0.00013176515],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002614039,0.00012665684,0.00033611365,0.00019012493,0.000085039064,0.000031550375,0.0010338296,0.00010377411,0.001024893],"category_scores_gemma":[0.0021037303,0.00009743235,0.00014521377,0.0006279636,0.00020955013,0.00024920036,0.00017386909,0.0001259235,0.0010394247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003926187,0.0001112285,0.012145292,0.0000030242047,0.000013076561,0.0000087280905,0.0013928756,3.4471032e-7,0.00030533277,0.9764213,0.0064442735,0.0031152773],"study_design_scores_gemma":[0.0003602502,0.00010852517,0.02867763,0.000008447628,0.0000069521493,0.0000029973392,0.00037010724,0.0000030272522,0.005789167,0.96338344,0.0011783639,0.00011112266],"about_ca_topic_score_codex":0.000044459073,"about_ca_topic_score_gemma":0.00000392185,"teacher_disagreement_score":0.19852328,"about_ca_system_score_codex":0.000014190491,"about_ca_system_score_gemma":0.00005951113,"threshold_uncertainty_score":0.9998883},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98838776,0.00024045078,0.00021522288,0.008499502,0.000717827,0.00034223514,0.000013125081,0.000059619564,0.001524243],"genre_scores_gemma":[0.99687004,0.000026208578,0.001067283,0.00057086133,0.00009911835,0.0000066393854,0.000020176687,0.000026475836,0.0013131679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816406,0.00017883675,0.0003962087,0.000348861,0.0005779981,0.0003340375],"domain_scores_gemma":[0.9975251,0.00066706433,0.00019929807,0.0011724106,0.00027685336,0.00015926352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005122287,0.00025330018,0.00043397787,0.000107660555,0.00028226987,0.00007701706,0.0008543106,0.00013198899,0.0003970147],"category_scores_gemma":[0.0005597509,0.00014790171,0.00015941483,0.0017388103,0.00008533267,0.00012526572,0.00012710817,0.0002582855,0.00012996918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008204164,0.00049083063,0.0010759677,0.000006269559,0.00032745168,0.00000974674,0.0027300753,0.000011052545,0.0004726715,0.9459711,0.047631253,0.0011915609],"study_design_scores_gemma":[0.0011515575,0.00049472746,0.0066226404,0.000041293337,0.0005857371,0.0000040992186,0.00109889,0.0007154709,0.007428672,0.9695417,0.011880466,0.00043470922],"about_ca_topic_score_codex":0.0006059737,"about_ca_topic_score_gemma":0.00021427934,"teacher_disagreement_score":0.035750788,"about_ca_system_score_codex":0.00004879048,"about_ca_system_score_gemma":0.00008388445,"threshold_uncertainty_score":0.6031257},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9259066,0.000078681645,0.04122423,0.0004701096,0.02591441,0.000577221,0.000005304878,0.00022543642,0.0055980165],"genre_scores_gemma":[0.9982968,0.0000023711812,0.0013749573,0.00006049349,0.000023165254,0.00004015863,0.0000018378511,0.000008925806,0.00019128571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991317,0.000033447337,0.00026608934,0.00022977931,0.00012882924,0.00021017052],"domain_scores_gemma":[0.99868876,0.0003352159,0.00015373965,0.0004548292,0.00030318557,0.00006427583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038251455,0.000101433696,0.00021229702,0.00009055161,0.000097980104,0.00006618502,0.00051198195,0.000100996,0.000015620086],"category_scores_gemma":[0.00012187433,0.00009267944,0.000114485374,0.00025619447,0.000036200465,0.00026195624,0.000051557075,0.00014897283,0.000009303058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007902205,0.000058681588,0.00044741406,0.0000124974085,0.000022268423,7.9017286e-7,0.00012766934,0.000003391868,0.011839231,0.98064125,0.0044903187,0.0023485762],"study_design_scores_gemma":[0.001609131,0.0003084405,0.0015258155,0.000028698767,0.0000108113,0.000022902937,0.000044246743,0.011137352,0.07751178,0.88866085,0.018882932,0.00025705868],"about_ca_topic_score_codex":0.000043562934,"about_ca_topic_score_gemma":0.000028649196,"teacher_disagreement_score":0.091980435,"about_ca_system_score_codex":0.00000772294,"about_ca_system_score_gemma":0.000039255116,"threshold_uncertainty_score":0.37793577},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99793094,0.00041910072,0.00007137219,0.00008454574,0.00031154996,0.0003144572,0.000012716863,0.00021205671,0.00064327865],"genre_scores_gemma":[0.9995632,0.000043168617,0.00019311241,0.0000700281,0.00001345628,0.000025626738,0.00000890842,0.000035845245,0.000046610894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919456,0.00002816867,0.00015944891,0.00024008704,0.00010335234,0.0002743881],"domain_scores_gemma":[0.99951774,0.00005585232,0.00003850952,0.00021255208,0.00003650668,0.00013882651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022715334,0.00020743103,0.00024902012,0.00008010291,0.000114138005,0.00007392094,0.00011153144,0.000093884606,0.000002724746],"category_scores_gemma":[0.000012105113,0.00018898406,0.00003360807,0.000135902,0.000050253366,0.0003029466,0.000014822772,0.00010890901,0.0000016366492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020393469,0.000119802615,0.012790705,0.00032933036,0.00020849795,0.000020128244,0.005165216,0.00013303402,0.0037086373,0.96223336,0.0015969122,0.013490443],"study_design_scores_gemma":[0.0022704895,0.00082149555,0.032849398,0.00015591385,0.00006167817,0.00007000356,0.00054102315,0.0010207661,0.0021473987,0.95623076,0.0032616388,0.00056945713],"about_ca_topic_score_codex":0.000009727936,"about_ca_topic_score_gemma":0.0000053261024,"teacher_disagreement_score":0.02005869,"about_ca_system_score_codex":0.0000161471,"about_ca_system_score_gemma":0.000007211386,"threshold_uncertainty_score":0.7706547},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98596466,0.0001718512,0.000011461794,0.00046457484,0.0007765111,0.0002225121,0.0000019639938,0.00010698737,0.01227948],"genre_scores_gemma":[0.99907565,0.00003556707,0.0000478859,0.00012217459,0.000011001447,0.00008584813,0.0000015526009,0.000021218799,0.0005991085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913824,0.00009853285,0.00016820822,0.000113535374,0.0001612009,0.00032027683],"domain_scores_gemma":[0.99838674,0.0008054457,0.00008304594,0.00059791567,0.000029213426,0.00009762513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005550175,0.00011690907,0.000105093786,0.0000401887,0.0004321639,0.00003078784,0.00031740384,0.00006359928,0.000027514649],"category_scores_gemma":[0.00011417009,0.00008139486,0.00008530293,0.00027125276,0.00009651739,0.00007606471,0.000048774786,0.00021000653,0.00020200515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059378413,0.00018467222,0.0017771374,0.000003146311,0.000023924951,1.8846465e-7,0.00013437694,6.3380924e-8,0.00006537778,0.99120426,0.0053722523,0.001228655],"study_design_scores_gemma":[0.000261075,0.00002357252,0.004012501,0.000008060835,0.000017603075,0.0000019342826,0.00007814869,0.000008703224,0.0011448474,0.97782326,0.016518852,0.000101418176],"about_ca_topic_score_codex":0.000002834753,"about_ca_topic_score_gemma":0.0000015286656,"teacher_disagreement_score":0.013380984,"about_ca_system_score_codex":0.000021966835,"about_ca_system_score_gemma":0.000011104093,"threshold_uncertainty_score":0.33238992},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9569194,0.000026689497,0.024624934,0.00021089034,0.0057124565,0.0010283432,0.0000091761185,0.00032168432,0.011146446],"genre_scores_gemma":[0.9456286,0.000001394038,0.053370334,0.00010755701,0.0005044512,0.000116656214,0.0000061716746,0.00006354393,0.0002013047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778074,0.00026912236,0.0006599153,0.00034699164,0.00056762097,0.00037563345],"domain_scores_gemma":[0.99746495,0.0006569346,0.00034221972,0.0011790636,0.00019318615,0.00016365532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010556419,0.00026727552,0.00047771906,0.000103082966,0.0003102858,0.000070742935,0.00075604836,0.00011290092,0.00003317795],"category_scores_gemma":[0.0013380939,0.00020454904,0.0001101146,0.00046926207,0.00010226596,0.00029465937,0.00013227116,0.00025022155,0.000063749685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039424585,0.00038649832,0.0000315497,0.00008574707,0.000029194094,4.02451e-7,0.0013105194,0.00041559618,0.0008227517,0.99264544,0.002739537,0.001528835],"study_design_scores_gemma":[0.00048402243,0.00021721188,0.000038564798,0.00004144498,0.000057871097,0.0000070291794,0.00040874828,0.023693135,0.0011235073,0.9727518,0.00093272695,0.00024392431],"about_ca_topic_score_codex":0.000008781163,"about_ca_topic_score_gemma":0.000003896071,"teacher_disagreement_score":0.0287454,"about_ca_system_score_codex":0.00009791736,"about_ca_system_score_gemma":0.00007018903,"threshold_uncertainty_score":0.8341268},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7831797,0.00007841472,0.1254867,0.022444095,0.008926058,0.0007433538,6.1430586e-7,0.00073449814,0.05840653],"genre_scores_gemma":[0.99631476,0.000004803945,0.0021644945,0.0012085851,0.0000041673743,0.00001731128,5.699315e-7,0.0000036226286,0.00028168707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995013,0.000039001763,0.00008517678,0.00013184111,0.00012877308,0.00011391116],"domain_scores_gemma":[0.9995037,0.000075935,0.000033166405,0.00030220716,0.00004611923,0.00003889493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007890927,0.000058758476,0.00004566464,0.000032779615,0.00013555236,0.00016387407,0.0002946863,0.000023323099,0.00014378132],"category_scores_gemma":[0.000026893342,0.000042389103,0.00002584415,0.00016698113,0.000020190513,0.00025359812,0.000054650915,0.0000731107,0.0004982534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.9051413e-7,0.000008980599,0.0002527744,4.2745137e-7,0.0000027344115,4.472918e-7,0.000083670806,0.00015630132,0.00007685805,0.9773083,0.0067588557,0.01535051],"study_design_scores_gemma":[0.00031456543,0.000044018878,0.015926825,0.0000066990897,0.0000016791192,0.000005971583,0.00001705831,0.06440245,0.0006032587,0.91642433,0.0021199347,0.00013317015],"about_ca_topic_score_codex":0.000032850687,"about_ca_topic_score_gemma":0.0000014628887,"teacher_disagreement_score":0.21313503,"about_ca_system_score_codex":0.000021065023,"about_ca_system_score_gemma":0.00001694823,"threshold_uncertainty_score":0.6404205},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96391374,0.000056337823,0.028889446,0.0013227322,0.00053832214,0.00035554543,5.518278e-7,0.00034724435,0.0045760563],"genre_scores_gemma":[0.9665182,0.0000022485333,0.032559395,0.00027922794,0.000004511793,0.000045046192,0.000001000969,0.000020948784,0.0005694086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984313,0.00008768406,0.00016263955,0.00040670077,0.000417895,0.0004937629],"domain_scores_gemma":[0.9986286,0.00017060686,0.00007170413,0.00077400357,0.00018087012,0.00017419993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025176653,0.00016120546,0.00016786293,0.00011060196,0.00027216875,0.00046275253,0.0011122139,0.00004955681,0.00005416213],"category_scores_gemma":[0.000051556162,0.00013100059,0.000042021307,0.0006088458,0.0001539547,0.0013962215,0.00035395697,0.00026256772,0.0005692489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000077404775,0.00004996511,0.0033661842,0.000008953532,0.000014438831,0.000018989374,0.00043026463,0.0000067695964,0.0019847613,0.98689896,0.0009529197,0.006260052],"study_design_scores_gemma":[0.0007033593,0.00013998146,0.006681438,0.000029996923,0.0000017423932,0.000026261598,0.000042866224,0.0015929617,0.004230599,0.9856264,0.00069466693,0.00022975587],"about_ca_topic_score_codex":0.00005682339,"about_ca_topic_score_gemma":0.0000017411246,"teacher_disagreement_score":0.006030296,"about_ca_system_score_codex":0.000052431493,"about_ca_system_score_gemma":0.00006596105,"threshold_uncertainty_score":0.73167336},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8705001,0.0018254356,0.08346469,0.00056950544,0.009634695,0.003495184,0.00003483802,0.0025079388,0.02796765],"genre_scores_gemma":[0.8883523,0.000009379009,0.11097033,0.00041612552,0.0000013127182,0.00008661601,0.000012999953,0.000018564155,0.00013240852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844563,0.000061216444,0.0003256006,0.00050485274,0.00024621462,0.00041649345],"domain_scores_gemma":[0.99867827,0.00006803142,0.00013463524,0.00070200546,0.00027990883,0.00013716277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023000655,0.00019250652,0.00022509483,0.00012493659,0.00017316542,0.00007497253,0.0008097503,0.000076754,0.000009150678],"category_scores_gemma":[0.000030287812,0.00018027106,0.00010598182,0.0003713875,0.000057115918,0.0002456183,0.00020941967,0.000108344335,0.000058489135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001446211,0.00029835734,0.00039849867,0.00003079806,0.000035924477,0.0000029107866,0.0008633729,0.0000033787492,0.00036407067,0.98960483,0.0074876132,0.0008957933],"study_design_scores_gemma":[0.0018920583,0.0002960287,0.0005885018,0.000017345026,0.000013967566,0.000006077735,0.000095248506,0.013450395,0.0012437463,0.9799155,0.0022101984,0.00027093466],"about_ca_topic_score_codex":0.000046565223,"about_ca_topic_score_gemma":6.792783e-7,"teacher_disagreement_score":0.027835242,"about_ca_system_score_codex":0.000020306186,"about_ca_system_score_gemma":0.000050058843,"threshold_uncertainty_score":0.73512405},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9935993,0.00004661152,0.000008748994,0.00016866582,0.000078777775,0.00020915903,0.000011875572,0.000021698537,0.0058551696],"genre_scores_gemma":[0.9994041,0.000002646501,0.00016735659,0.00007119175,0.0000040385744,0.00004043353,0.0000013944884,0.00001684128,0.00029199955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999343,0.00007244996,0.00014714818,0.000117386226,0.00013135569,0.0001886646],"domain_scores_gemma":[0.9988818,0.0005542062,0.000110356224,0.00035188269,0.000034732173,0.000067025656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003078707,0.00011638864,0.00014911912,0.0000505653,0.00011145007,0.000010891056,0.000155832,0.00005516062,0.00015130057],"category_scores_gemma":[0.000036523616,0.000073893694,0.000038603186,0.00019543906,0.00019827823,0.00008529596,0.00004290398,0.00013787819,0.0000063352554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031126867,0.00020795548,0.0076140915,0.000018540197,0.00004101432,3.4048432e-7,0.0004649125,7.981188e-8,0.00032862704,0.9903453,0.0008356261,0.000112363115],"study_design_scores_gemma":[0.00046837147,0.000113354195,0.012539386,0.000019951183,0.00002719196,0.0000060000216,0.00020992676,0.000008124717,0.0029362007,0.98259926,0.00097282045,0.00009939813],"about_ca_topic_score_codex":0.0000032725975,"about_ca_topic_score_gemma":0.0000059750137,"teacher_disagreement_score":0.007746048,"about_ca_system_score_codex":0.0000062013723,"about_ca_system_score_gemma":0.000009922302,"threshold_uncertainty_score":0.30132973},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99435955,0.00089097046,0.00040149453,0.00079480984,0.0020308695,0.00023462996,0.000004167083,0.0001407164,0.001142798],"genre_scores_gemma":[0.9880901,0.0000059068366,0.011794627,0.000063423584,9.77051e-7,0.0000055871783,0.0000029479631,0.000011526294,0.000024907675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983258,0.00006420319,0.0004574016,0.00036996327,0.00051409873,0.00026849643],"domain_scores_gemma":[0.997751,0.000059961487,0.00027676128,0.00093185256,0.00082306314,0.0001573415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007008005,0.00015743107,0.000345583,0.00018929096,0.000049917136,0.00002457278,0.0008388315,0.000066880726,0.0000016573625],"category_scores_gemma":[0.0001650851,0.00014535207,0.00007207192,0.0010286404,0.00015672208,0.0002258923,0.00023540718,0.00011998105,0.000015943904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069964467,0.00014915619,0.00428676,0.000038330756,0.000025202218,0.000003147708,0.00051032053,0.000025629564,0.007741499,0.98459125,0.0020408689,0.0005808233],"study_design_scores_gemma":[0.0010386304,0.00031971067,0.0010610486,0.00005300781,0.000013891171,0.000006167497,0.000020607038,0.0018281558,0.017718155,0.97749215,0.00028521635,0.00016325359],"about_ca_topic_score_codex":0.00019835423,"about_ca_topic_score_gemma":0.000006145106,"teacher_disagreement_score":0.011393133,"about_ca_system_score_codex":0.000014011643,"about_ca_system_score_gemma":0.00015597044,"threshold_uncertainty_score":0.59272856},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9913796,0.0012423776,0.0008082175,0.0011733342,0.0027964655,0.00023459145,0.0000011332573,0.000099417084,0.0022648305],"genre_scores_gemma":[0.9987232,0.0000072123344,0.0010352974,0.00009305094,0.0000052964483,0.000017987182,7.9379156e-8,0.00000981424,0.00010807829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985353,0.00020652777,0.00017856916,0.00017753783,0.0004383896,0.00046372623],"domain_scores_gemma":[0.99868107,0.00012912128,0.00004355568,0.0008893331,0.00013154828,0.00012538729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005143967,0.00010777381,0.00013768702,0.00007276263,0.00017538601,0.000036217167,0.0013859659,0.000049051818,0.000007031541],"category_scores_gemma":[0.00033559185,0.00007010185,0.0000946543,0.0006474956,0.00042855492,0.00060854974,0.0005804078,0.00021178402,0.00002983885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043033074,0.000112546026,0.007995604,0.000017186836,0.000007945619,5.417065e-7,0.0005013564,7.230607e-7,0.0061110775,0.9843946,0.00014158146,0.0007125404],"study_design_scores_gemma":[0.00021237628,0.000045933306,0.011518268,0.000038209855,0.0000040096006,0.000009577939,0.000036867692,0.00014986358,0.072814554,0.91410416,0.000940453,0.0001257288],"about_ca_topic_score_codex":0.0000074352515,"about_ca_topic_score_gemma":7.201786e-7,"teacher_disagreement_score":0.07029044,"about_ca_system_score_codex":0.000024501593,"about_ca_system_score_gemma":0.00004873855,"threshold_uncertainty_score":0.28586707},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95425665,0.000092991766,0.043742266,0.00009502124,0.00053082977,0.0003127993,0.000027882355,0.000037679976,0.00090385735],"genre_scores_gemma":[0.997699,0.000005236456,0.001778081,0.0000026461978,0.000007779942,0.000050790677,0.000019050767,0.000012256842,0.00042515737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987653,0.0000958154,0.00051775115,0.0001268148,0.00035239678,0.0001419402],"domain_scores_gemma":[0.99783355,0.00083266076,0.0003604275,0.00036888997,0.00055570673,0.00004878558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019924022,0.00009810251,0.00029198182,0.00015767112,0.00007547057,0.000018632456,0.00017358773,0.00006871959,0.0004034103],"category_scores_gemma":[0.0006411869,0.00009139915,0.000111918,0.000338115,0.000076639204,0.000112961076,0.00005480505,0.00009077258,0.000049947837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014585111,0.0003515145,0.0015405685,0.000059001446,0.00010407082,7.382377e-8,0.0000754863,0.000037350575,0.004307772,0.992921,0.0004086039,0.00019308654],"study_design_scores_gemma":[0.00032974393,0.000041141495,0.0069305887,0.000053254145,0.00012367738,6.7073876e-7,0.00018953196,0.027597403,0.00084934436,0.9637664,0.000011670122,0.00010656051],"about_ca_topic_score_codex":0.0006045391,"about_ca_topic_score_gemma":0.0000153349,"teacher_disagreement_score":0.043442328,"about_ca_system_score_codex":0.00004056433,"about_ca_system_score_gemma":0.00007050419,"threshold_uncertainty_score":0.44170597},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97630054,0.0013638478,0.0069323736,0.0011654033,0.0029235468,0.00042425792,0.0000028055094,0.00030044295,0.010586803],"genre_scores_gemma":[0.9983907,0.000027238008,0.0013592001,0.00003853965,0.0000023396324,0.0000145301765,6.580984e-7,0.0000088844145,0.00015793354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984149,0.00023597623,0.00022907207,0.00025535957,0.0005097837,0.00035491693],"domain_scores_gemma":[0.99775165,0.0005077968,0.00010520466,0.0010681638,0.00040142206,0.00016573245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001160642,0.00011070007,0.00016041407,0.00008604904,0.00017387024,0.000068865505,0.0017789567,0.000049515726,0.0000018576102],"category_scores_gemma":[0.0005552318,0.00007983798,0.000072516494,0.0009778208,0.00025451632,0.00030589168,0.00046635934,0.00019951919,0.00003110002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017417638,0.00004361045,0.00090505055,0.0000024815395,0.000017071154,0.000004301779,0.00020248088,0.000011151733,0.00031991958,0.99443364,0.0011901694,0.002852707],"study_design_scores_gemma":[0.00059054134,0.0001358867,0.0012654753,0.0000062542513,0.0000019913457,0.000004475422,0.000051170988,0.0014982561,0.0075289593,0.98619413,0.0026262617,0.00009660806],"about_ca_topic_score_codex":0.00002426804,"about_ca_topic_score_gemma":0.0000065943427,"teacher_disagreement_score":0.022090157,"about_ca_system_score_codex":0.000041401894,"about_ca_system_score_gemma":0.00014606815,"threshold_uncertainty_score":0.33057737},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9968452,0.00025417976,0.00007848094,0.00034005597,0.001201971,0.00014637492,6.19282e-7,0.00009880941,0.0010343101],"genre_scores_gemma":[0.99597293,0.000028041344,0.0036685867,0.00025449524,5.4623246e-7,0.000009720335,8.106167e-7,0.000008017898,0.000056821562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899256,0.000047927213,0.00022456195,0.00029228206,0.00022892818,0.000213738],"domain_scores_gemma":[0.9990831,0.0001565508,0.00009470783,0.00041725292,0.00013800993,0.00011040004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002206698,0.0001227987,0.00017760837,0.0001338877,0.000090928326,0.00007425459,0.0003316945,0.00006203067,0.000014086798],"category_scores_gemma":[0.000055453213,0.0001085117,0.0000465055,0.00034363917,0.0000753457,0.00022055797,0.00014702335,0.00012267476,0.00006252428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025817847,0.000072851275,0.001491351,0.000009674541,0.00001014826,0.0000015703214,0.00011773932,0.000011592208,0.0041285176,0.9899154,0.0021194718,0.0021191293],"study_design_scores_gemma":[0.000622158,0.00022340984,0.0015207189,0.000034388097,0.0000044766343,0.0000028212746,0.000009229304,0.0021238716,0.0036189712,0.99165136,0.000060242564,0.00012835975],"about_ca_topic_score_codex":0.00013731226,"about_ca_topic_score_gemma":9.788112e-7,"teacher_disagreement_score":0.0035901058,"about_ca_system_score_codex":0.0000061088203,"about_ca_system_score_gemma":0.000019885609,"threshold_uncertainty_score":0.44249788},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.997199,0.00005962796,0.000014005233,0.0001750361,0.00029489945,0.00018233816,0.0000058768633,0.000033438686,0.0020357757],"genre_scores_gemma":[0.99962544,0.000026463027,0.00026674775,0.000016222977,0.0000033619851,0.000012588883,0.0000031131485,0.000008568178,0.000037479796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994585,0.000043735497,0.00018270183,0.00010303839,0.00010581122,0.0001062072],"domain_scores_gemma":[0.99900097,0.0004766124,0.0001373717,0.0002908458,0.00005369036,0.000040496318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035494752,0.00007638085,0.0001118862,0.0000378521,0.00026108374,0.000028443004,0.00016231048,0.00006265922,0.0000072881603],"category_scores_gemma":[0.000049069324,0.000055709064,0.00004041839,0.00014827515,0.00021431908,0.00005308603,0.00003612953,0.00016894091,0.000003250986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008831621,0.00007713927,0.00041855767,0.00001566277,0.00001729266,1.8147037e-7,0.000350506,8.263577e-8,0.015960032,0.9824625,0.00022787353,0.00046128512],"study_design_scores_gemma":[0.00029745285,0.000022685655,0.00497604,0.000011139402,0.000022702938,0.0000031296868,0.00007421554,0.000040628925,0.011218178,0.98309916,0.00017183402,0.00006285487],"about_ca_topic_score_codex":0.0000074678815,"about_ca_topic_score_gemma":0.000009897156,"teacher_disagreement_score":0.004741854,"about_ca_system_score_codex":0.0000022773233,"about_ca_system_score_gemma":0.000008479025,"threshold_uncertainty_score":0.22717497},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9944104,0.000020160385,0.000032275195,0.003079351,0.00065130263,0.00018814733,0.0000019180015,0.000030077152,0.0015864011],"genre_scores_gemma":[0.9989828,0.0000046706627,0.00078574853,0.00020306218,3.451813e-7,0.0000076397655,3.6244955e-7,0.0000037741563,0.000011601751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899125,0.00022367924,0.00024856214,0.00019162422,0.00021680098,0.00012810914],"domain_scores_gemma":[0.9978828,0.0009768563,0.00016880197,0.00075868954,0.00017142446,0.00004143347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015103808,0.000093070244,0.00019082041,0.000025673176,0.00017344132,0.000034540368,0.000600214,0.000053694177,0.000017937145],"category_scores_gemma":[0.00029298486,0.00005034644,0.000069610614,0.00031685116,0.0014275375,0.00006597267,0.00020621125,0.0002800919,0.0000024281471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015141221,0.00007578447,0.0058206143,0.000009719703,0.000010818145,2.6325688e-7,0.0003671129,0.0000011754017,0.0010467889,0.9922482,0.00033217706,0.000072204144],"study_design_scores_gemma":[0.0006115959,0.0000376711,0.006251063,0.000016229917,0.0000053039566,0.0000036403155,0.000015898264,0.0014196904,0.0051651867,0.9863876,0.000029424526,0.000056693934],"about_ca_topic_score_codex":0.00034268343,"about_ca_topic_score_gemma":0.000025995805,"teacher_disagreement_score":0.0058605988,"about_ca_system_score_codex":0.0000036041622,"about_ca_system_score_gemma":0.000031259868,"threshold_uncertainty_score":0.52598214},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9784166,0.00030362437,0.00095793937,0.000068033885,0.002721234,0.00014500681,7.207224e-7,0.00046042298,0.016926369],"genre_scores_gemma":[0.9994602,0.000014055301,0.0002974,0.000032363365,0.000009545519,0.00004268046,0.000003156304,0.000016378144,0.00012421049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996024,0.000010286593,0.000107523396,0.0000751498,0.000079303325,0.00012534179],"domain_scores_gemma":[0.99975103,0.000010975722,0.0000108772465,0.00013788344,0.000042283795,0.000046965462],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000029765612,0.00007954334,0.00007183095,0.000043759646,0.00003660223,0.00004510824,0.00007293581,0.00005821103,0.00045769638],"category_scores_gemma":[0.000005359122,0.00007854944,0.00003257468,0.00010840289,0.000017848472,0.00016528352,0.000006110566,0.000087026056,0.0009916835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.969873e-7,0.000017558046,0.0019840084,0.000023281418,0.000043217144,0.0000020029267,0.000105806,0.00025754035,0.046807714,0.8997189,0.029931799,0.021107184],"study_design_scores_gemma":[0.00054894225,0.00004758883,0.008293252,0.000024818195,0.00002067359,0.00003299257,0.00016530957,0.01812954,0.049305376,0.9096762,0.013318295,0.0004370311],"about_ca_topic_score_codex":0.000023722156,"about_ca_topic_score_gemma":7.286113e-7,"teacher_disagreement_score":0.021043561,"about_ca_system_score_codex":0.00003475706,"about_ca_system_score_gemma":0.000006618305,"threshold_uncertainty_score":0.99978614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86032313,0.00027389385,0.1362774,0.00008041045,0.0024608108,0.000081732076,0.00000314244,0.00009234851,0.00040714256],"genre_scores_gemma":[0.9877263,0.000012402759,0.012149774,0.000052196967,0.000021024664,0.0000038485023,0.0000040930813,0.0000057139296,0.000024685723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917865,0.00007851889,0.00018779289,0.00018073668,0.00017804996,0.00019627255],"domain_scores_gemma":[0.998925,0.00038071803,0.00012096444,0.00042578718,0.000046792404,0.00010077764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019009865,0.0000999138,0.00013877221,0.00013736647,0.000072555114,0.00004187736,0.00032011085,0.000078637255,0.00009917299],"category_scores_gemma":[0.00008429865,0.000102146805,0.000076969605,0.00049078907,0.00004495897,0.0004390916,0.000103029066,0.00010355484,0.000021730064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008209033,0.00006949035,0.030036049,0.000005924519,0.000038238104,2.3758415e-7,0.0010090979,0.0000026681105,0.00083293114,0.95731884,0.0002479253,0.010430398],"study_design_scores_gemma":[0.00054091064,0.00004797355,0.049640663,0.000023515362,0.000027696455,0.0000025813629,0.000040734143,0.0014030469,0.007894088,0.93988055,0.00035157814,0.00014669068],"about_ca_topic_score_codex":0.00009300574,"about_ca_topic_score_gemma":0.0000024280746,"teacher_disagreement_score":0.12740315,"about_ca_system_score_codex":0.000018031611,"about_ca_system_score_gemma":0.000031110107,"threshold_uncertainty_score":0.4165426},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98999214,0.000028770988,0.000016030832,0.000049823466,0.00067057175,0.00012022579,0.0000049280484,0.000049628605,0.0090678865],"genre_scores_gemma":[0.9994458,0.0000022532818,0.00037181465,0.000044518394,0.0000054981188,0.000016991045,0.0000022136924,0.000015913149,0.00009502981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938405,0.000046444544,0.00017558577,0.00008707652,0.00012154302,0.00018530464],"domain_scores_gemma":[0.99910176,0.0004075602,0.00009035841,0.0003086589,0.000022319251,0.00006934174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028648495,0.000090175534,0.00014588851,0.00006130633,0.00007980366,0.000005978063,0.0001506084,0.000053854095,0.00006648293],"category_scores_gemma":[0.00007271602,0.00008390692,0.00008028845,0.00015028061,0.000043614084,0.00007734776,0.000030096178,0.00010554845,0.000056066026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013519121,0.0003239109,0.000646296,0.000016555801,0.000019853409,1.4629967e-7,0.0004559534,2.0823865e-7,0.0014784179,0.99275416,0.0041253516,0.00016563598],"study_design_scores_gemma":[0.00032244858,0.000033241533,0.0012802043,0.000019865587,0.000021059259,0.00000140953,0.00006678567,0.0000018109238,0.00663902,0.99121946,0.00030914604,0.00008552114],"about_ca_topic_score_codex":0.0000070245223,"about_ca_topic_score_gemma":4.1222037e-7,"teacher_disagreement_score":0.009453634,"about_ca_system_score_codex":0.000011826038,"about_ca_system_score_gemma":0.0000079436895,"threshold_uncertainty_score":0.3421625},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55218714,0.00016544973,0.3541568,0.00063632405,0.0010794152,0.00076864706,0.00008916345,0.00017523771,0.09074185],"genre_scores_gemma":[0.9557468,0.0000025724673,0.03950302,0.00003409421,0.00005422442,0.00015229748,0.00008051431,0.00002445894,0.004401983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926007,0.000053272655,0.00017537872,0.00013415415,0.000114775874,0.0002623326],"domain_scores_gemma":[0.99940443,0.00012666573,0.00007623748,0.00022521609,0.000050455503,0.00011697388],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014193481,0.000118943375,0.00015093219,0.000009501895,0.00012717937,0.000027357539,0.00011376573,0.000028980949,0.0015804676],"category_scores_gemma":[0.000011318978,0.00010867164,0.00005670542,0.00016670326,0.000027419665,0.00019719833,0.000049664344,0.00009010101,0.0003073907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003424568,0.0001771884,0.0028006576,0.0000048249203,0.00002242499,2.5184091e-8,0.00012675078,0.0000067446804,0.0009463841,0.9873585,0.007203773,0.0013492798],"study_design_scores_gemma":[0.0004619399,0.0000058219844,0.00007581355,0.000003356094,0.000023321983,4.6306658e-7,0.00020178378,0.00016944397,0.006211386,0.9496138,0.043087684,0.00014517742],"about_ca_topic_score_codex":0.000045707257,"about_ca_topic_score_gemma":6.790933e-8,"teacher_disagreement_score":0.4035597,"about_ca_system_score_codex":0.000015199545,"about_ca_system_score_gemma":0.000009446788,"threshold_uncertainty_score":0.99933225},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930581,0.00011143941,0.00073284033,0.00020852906,0.004261517,0.00013446347,3.9809285e-7,0.00008104952,0.0014116726],"genre_scores_gemma":[0.9994503,0.000005375862,0.00034016994,0.000052171203,0.000017086288,0.000013275012,1.9244582e-7,0.000007084254,0.00011429798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991839,0.000060709506,0.00019827453,0.00024641407,0.00014351915,0.00016717744],"domain_scores_gemma":[0.99925435,0.00008017692,0.000080362144,0.00040806597,0.00011394403,0.00006313105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035343107,0.00010365224,0.0002004048,0.000057803834,0.00009101344,0.00007258716,0.00032450224,0.00008164445,0.00000781784],"category_scores_gemma":[0.00007313397,0.00008483252,0.000045549565,0.00017045208,0.00006875824,0.0003263303,0.00014446363,0.00017346487,0.000008459499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042266747,0.00005781726,0.0031339424,0.000021635931,0.000016496366,0.000002142548,0.00059237995,0.000001676927,0.032260615,0.95974255,0.00042125507,0.0037452732],"study_design_scores_gemma":[0.00250084,0.00071276614,0.026744477,0.00017006621,0.000025048377,0.00023257616,0.00024748134,0.05421035,0.13590881,0.7717126,0.0066267606,0.0009082334],"about_ca_topic_score_codex":0.0001121822,"about_ca_topic_score_gemma":0.00005372883,"teacher_disagreement_score":0.18802994,"about_ca_system_score_codex":0.000008886301,"about_ca_system_score_gemma":0.000031923963,"threshold_uncertainty_score":0.34593698},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98029274,0.000027685357,0.018539337,0.00015643613,0.0005352318,0.000095109615,0.0000051104103,0.00005468723,0.00029365253],"genre_scores_gemma":[0.9971525,0.000008270517,0.002760378,0.000038500704,0.000003047135,0.0000020013958,0.0000035821822,0.000006341513,0.000025397037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923253,0.000095114505,0.00012604649,0.0002050305,0.00018076118,0.00016053504],"domain_scores_gemma":[0.99929744,0.000081697086,0.00006343844,0.0003957986,0.000090369285,0.00007124189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012719427,0.00007700099,0.00011954246,0.00011485705,0.000083930936,0.000039940358,0.00043299678,0.000041451625,0.000009725718],"category_scores_gemma":[0.0000638649,0.00007335559,0.00002562582,0.0003815939,0.00011366068,0.00030029152,0.00020452095,0.00009972081,0.0000023777293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024401186,0.000013103173,0.0019310197,0.000008798809,0.0000068254,6.3294414e-7,0.00011483602,0.000002706014,0.04460961,0.9511266,0.000015264504,0.0021681671],"study_design_scores_gemma":[0.00028929845,0.00006556002,0.009444111,0.0000068170293,0.0000022292775,0.0000052726145,0.0000031031116,0.0012899287,0.018617745,0.9699247,0.0002738385,0.00007742941],"about_ca_topic_score_codex":0.0000031750697,"about_ca_topic_score_gemma":9.895274e-7,"teacher_disagreement_score":0.025991866,"about_ca_system_score_codex":0.0000063816033,"about_ca_system_score_gemma":0.000018581568,"threshold_uncertainty_score":0.29913542},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98107296,0.000012175177,0.0000054218344,0.0016472037,0.00017598871,0.0003176028,0.0000033602066,0.000047816357,0.016717475],"genre_scores_gemma":[0.9994119,0.0000046008076,0.00010300774,0.00015772569,0.0000025343022,0.00005802615,0.0000018630814,0.000014418862,0.00024595807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936,0.00008101551,0.00018216124,0.00010890901,0.00012874056,0.00013916225],"domain_scores_gemma":[0.99837214,0.0009206711,0.00009000019,0.00053419225,0.00004318481,0.000039832856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002511382,0.000093478215,0.00012259347,0.00005007234,0.00011538864,0.000012510253,0.00028831657,0.000039278635,0.00044756336],"category_scores_gemma":[0.00013141417,0.000062889194,0.000077861776,0.00026785533,0.000104318526,0.00004597502,0.00003734463,0.00013734003,0.00018195008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025730274,0.00014593216,0.00022095791,0.000008561599,0.000022063969,2.8000207e-7,0.00013571365,2.4469216e-7,0.0002915709,0.98540044,0.013715878,0.000055796365],"study_design_scores_gemma":[0.00015494003,0.000055478184,0.001309747,0.000016710119,0.000014158071,9.521291e-7,0.0001399158,0.000012129726,0.004311476,0.9937074,0.00020593648,0.000071146445],"about_ca_topic_score_codex":0.000029198744,"about_ca_topic_score_gemma":0.0000021311037,"teacher_disagreement_score":0.01833891,"about_ca_system_score_codex":0.0000071039453,"about_ca_system_score_gemma":0.00000911428,"threshold_uncertainty_score":0.4900505},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.977644,0.00022623407,0.000031854743,0.00017774446,0.00083267124,0.00024915286,0.000013418985,0.00022619935,0.020598698],"genre_scores_gemma":[0.99889463,0.000013439376,0.00060233014,0.00014692856,0.00001473045,0.0000987029,0.00001585556,0.000028810115,0.0001845453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999043,0.00007796476,0.00022650343,0.00014985466,0.00014945876,0.00035324585],"domain_scores_gemma":[0.99887836,0.00033908986,0.000098903816,0.0004591416,0.00005883456,0.0001656865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036141922,0.00014573308,0.00016588203,0.00009149794,0.00029165493,0.000029296612,0.00020947069,0.00008566832,0.00021096521],"category_scores_gemma":[0.00014357663,0.00014532612,0.00009896393,0.0003466022,0.00008561056,0.00026103825,0.000053237796,0.00016896836,0.00020465616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019188035,0.00029675226,0.01021591,0.000016273194,0.000029752902,5.4996565e-7,0.00039589911,6.708323e-8,0.0008596998,0.98329693,0.0048195915,0.00006666775],"study_design_scores_gemma":[0.00033553442,0.000017058741,0.007571464,0.000018872528,0.000041708117,0.0000067095366,0.00018380133,0.000008427168,0.0012887856,0.98855835,0.0017941453,0.00017514372],"about_ca_topic_score_codex":0.0000043098275,"about_ca_topic_score_gemma":0.0000015752345,"teacher_disagreement_score":0.021250632,"about_ca_system_score_codex":0.000026054091,"about_ca_system_score_gemma":0.000017032793,"threshold_uncertainty_score":0.5926227},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99509203,0.00018501881,0.00021326644,0.00023748186,0.0005413109,0.00017453945,0.000005623832,0.000029082536,0.0035216229],"genre_scores_gemma":[0.99823946,0.000016006026,0.00062971783,0.0005703552,0.0000643774,0.000008410694,0.000079225545,0.0000079403435,0.00038449833],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930966,0.000025355814,0.00012675837,0.0002519326,0.000057971884,0.00022831577],"domain_scores_gemma":[0.9996317,0.000015754624,0.000041620286,0.00018851498,0.00006071952,0.00006169561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012136479,0.00011130158,0.000113059206,0.00000824845,0.0000839835,0.00001995975,0.00015499433,0.00013354063,0.0000124915405],"category_scores_gemma":[0.00008132235,0.000092712085,0.00010316016,0.00005203139,0.000021988895,0.0000017375546,0.000036223973,0.00005279386,0.00001690957],"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.0003470332,0.00066331733,0.027875345,0.000037545928,0.00009350957,0.000015072785,0.00007415121,0.00001684039,0.53999287,0.30290547,0.065688156,0.06229069],"study_design_scores_gemma":[0.004335893,0.0037566521,0.039824832,0.0000411419,0.000044409724,0.00004190009,0.000067882094,0.00021831195,0.21649428,0.4151842,0.3189203,0.0010702027],"about_ca_topic_score_codex":0.0000012839604,"about_ca_topic_score_gemma":3.5802458e-7,"teacher_disagreement_score":0.32349858,"about_ca_system_score_codex":0.000007945375,"about_ca_system_score_gemma":0.000017001492,"threshold_uncertainty_score":0.37806892},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045497366,0.00006842126,0.99232656,0.00021194434,0.0009711091,0.00043137622,0.0000013736974,0.001289564,0.00014992179],"genre_scores_gemma":[0.46796584,0.000006597542,0.5315825,0.00009631947,0.0000065668264,0.00025972788,0.0000024777758,0.000022384427,0.000057609795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987691,0.00005322807,0.0002200724,0.00040417348,0.00021872048,0.0003346919],"domain_scores_gemma":[0.99873996,0.00015066766,0.00007795657,0.00079546846,0.00013019101,0.00010577223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060115475,0.00018375585,0.00023052878,0.00013534578,0.000098614284,0.00010439326,0.0010536738,0.00008925711,0.0000027510487],"category_scores_gemma":[0.000029134422,0.00018194628,0.000119932665,0.00033845715,0.000027542905,0.00032224055,0.00016215518,0.000108564745,0.000015143473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012023838,0.000039534825,0.000149279,0.000024335039,0.000017442575,4.833392e-7,0.00008218123,0.0001598183,0.00061185926,0.98295164,0.0038681796,0.0120940525],"study_design_scores_gemma":[0.00042550245,0.00023079445,0.00020645974,0.000029461251,0.000012937986,0.0000037492555,2.7723175e-7,0.054100525,0.011683616,0.8553096,0.07769627,0.00030081617],"about_ca_topic_score_codex":0.000015140014,"about_ca_topic_score_gemma":7.010798e-7,"teacher_disagreement_score":0.46341613,"about_ca_system_score_codex":0.00003980708,"about_ca_system_score_gemma":0.000022430993,"threshold_uncertainty_score":0.7419554},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7886112,0.006591315,0.17904595,0.0020351687,0.020345455,0.0012424696,0.000043567128,0.0013819552,0.00070294895],"genre_scores_gemma":[0.89687914,0.000020375044,0.10215359,0.0004490138,0.00000273936,0.00006269267,0.0000057108737,0.000018905932,0.00040781684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984753,0.000040112653,0.00027344222,0.00036080152,0.00024580807,0.0006044967],"domain_scores_gemma":[0.99870294,0.00013826849,0.000115330266,0.00061931985,0.00019059613,0.00023354095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061240623,0.00018935069,0.00020268431,0.00010088805,0.0002543833,0.00009462652,0.00066841487,0.00009044745,0.0000034676577],"category_scores_gemma":[0.0001080622,0.00017627983,0.00011537256,0.00045691637,0.000057076668,0.00054580043,0.00015973634,0.00012607529,0.000066047054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000435674,0.00022626798,0.002740796,0.00001820949,0.000016214592,7.058783e-7,0.00036236027,0.0000031614804,0.0014675296,0.9900799,0.0033590794,0.0017214464],"study_design_scores_gemma":[0.0018827061,0.00009172832,0.002884724,0.00004084569,0.000014700453,0.0000059027807,0.00001862049,0.0054685795,0.0044056317,0.97664285,0.008144668,0.00039907006],"about_ca_topic_score_codex":0.000016422224,"about_ca_topic_score_gemma":0.0000023157088,"teacher_disagreement_score":0.10826797,"about_ca_system_score_codex":0.000025970154,"about_ca_system_score_gemma":0.00003223057,"threshold_uncertainty_score":0.71884835},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98635733,0.000024059285,0.000013545248,0.00026299182,0.00013769523,0.00014931087,0.000004193752,0.00006372864,0.012987169],"genre_scores_gemma":[0.99915826,0.000009896815,0.0005341297,0.00015525283,0.0000029725534,0.000011406257,0.0000026886855,0.000009445728,0.00011593485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993105,0.000046389054,0.00020463551,0.00014561796,0.00015180986,0.0001410767],"domain_scores_gemma":[0.9991246,0.00024227865,0.00013457348,0.0004107571,0.00003774362,0.000050066745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020201558,0.0001028795,0.00016845496,0.0001054997,0.00007501279,0.000008537998,0.00022613966,0.00006821457,0.00002354399],"category_scores_gemma":[0.0000706225,0.00009160401,0.000081666374,0.0003544113,0.000058079622,0.00005402301,0.000015518362,0.000115179195,0.000023190967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009419805,0.0003495893,0.00013847057,0.0000072091143,0.000010992112,9.00836e-7,0.00024118686,5.6303855e-7,0.001422894,0.99546206,0.0006333001,0.0017234351],"study_design_scores_gemma":[0.00038786372,0.00015125907,0.0020356318,0.000030630355,0.000022258642,0.0000010139038,0.000024552179,0.000010533641,0.010862329,0.985755,0.000623993,0.000094893636],"about_ca_topic_score_codex":0.0000030196443,"about_ca_topic_score_gemma":0.0000012328865,"teacher_disagreement_score":0.012871235,"about_ca_system_score_codex":0.0000093908075,"about_ca_system_score_gemma":0.0000123396485,"threshold_uncertainty_score":0.3735503},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9990146,0.00036064698,0.000034610846,0.000026903683,0.00012848985,0.00009153059,0.0000103306365,0.000007932296,0.0003249276],"genre_scores_gemma":[0.9996328,0.00019031846,0.00016062209,0.0000024246701,0.0000021760416,0.000002794127,0.0000032641979,0.0000027858273,0.0000028418447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997009,0.0000064896212,0.00011787106,0.000066633984,0.000047192218,0.000060935217],"domain_scores_gemma":[0.99983466,0.000027700782,0.000032341584,0.000044030337,0.000043035452,0.000018248236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000034429962,0.000050944876,0.00013762878,0.000019826868,0.000021381315,0.0000059660047,0.000022650172,0.000020397625,0.000008655658],"category_scores_gemma":[0.000006876069,0.00004050951,0.0000054649213,0.000078028046,0.00011292314,0.000063476466,0.000029550341,0.000021481488,1.7860026e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118046655,0.000037940466,0.0032477435,0.0003360562,0.000025486634,1.3087063e-7,0.00030677742,0.000017991999,0.48141992,0.5133777,0.000053296317,0.001165123],"study_design_scores_gemma":[0.001073673,0.0002971348,0.10810296,0.0001318381,0.00003118363,0.000002083766,0.00024802517,0.0014845831,0.31311023,0.5752423,0.00008025363,0.00019574723],"about_ca_topic_score_codex":0.000007355543,"about_ca_topic_score_gemma":1.2491991e-7,"teacher_disagreement_score":0.16830967,"about_ca_system_score_codex":0.000002341057,"about_ca_system_score_gemma":8.520143e-7,"threshold_uncertainty_score":0.16519298},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9783796,0.00023139772,0.014774962,0.00026775044,0.0010857728,0.0002265866,4.0545035e-7,0.00021077831,0.0048227166],"genre_scores_gemma":[0.99785984,0.000014132379,0.0018700127,0.00015021692,0.0000037284606,0.000028844774,0.0000012218167,0.000014792907,0.000057210837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808747,0.00030799443,0.00025387117,0.00045045643,0.00036905627,0.0005311263],"domain_scores_gemma":[0.998473,0.0005010749,0.00007325535,0.0007262532,0.000091748225,0.00013467677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010116159,0.00015546569,0.00022480635,0.00026732223,0.0001251663,0.00012609648,0.0012008834,0.000069378795,0.000009354799],"category_scores_gemma":[0.00034784607,0.00015703846,0.000057404126,0.0009365253,0.00009254569,0.0006637957,0.0003493785,0.00028611455,0.00005835364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016880753,0.000060681577,0.03490272,0.000008788376,0.0000068510826,0.00002501956,0.0003346361,0.00003135949,0.00020857934,0.9523131,0.000024165693,0.01206717],"study_design_scores_gemma":[0.0011651871,0.00020526956,0.02590019,0.000034698685,0.0000016100336,0.0000043786563,0.000035337944,0.00960937,0.0009067605,0.96148336,0.0004491443,0.00020470194],"about_ca_topic_score_codex":0.000035293997,"about_ca_topic_score_gemma":0.00003474267,"teacher_disagreement_score":0.01948021,"about_ca_system_score_codex":0.00004770178,"about_ca_system_score_gemma":0.00004300472,"threshold_uncertainty_score":0.64038426},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95418644,0.00022416015,0.031825665,0.0012255968,0.001559181,0.0001273245,9.802551e-7,0.00011078247,0.0107398555],"genre_scores_gemma":[0.99060714,0.0000057141538,0.009072169,0.00020244805,0.000007591728,0.0000012316307,0.0000030200117,0.000001925052,0.00009878696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993433,0.000016558122,0.00017270767,0.00015287905,0.00020703042,0.00010753756],"domain_scores_gemma":[0.999432,0.000054970067,0.00007431578,0.0002340532,0.00016293583,0.000041673433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001785037,0.000064644446,0.000095753385,0.00007921515,0.000043866825,0.00003362581,0.00029827317,0.000032503187,0.000019568895],"category_scores_gemma":[0.000047484875,0.00006415461,0.000034210363,0.00050220796,0.000010140135,0.00025836893,0.000031178522,0.000052178133,0.00002990854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000219758,0.00009712122,0.00007215087,0.0000030481335,0.0000048051584,0.0000023882637,0.00007854713,0.0005017253,0.004015578,0.96512437,0.0013145959,0.02878349],"study_design_scores_gemma":[0.00042733588,0.000134028,0.066258475,0.000011203129,0.0000026889636,0.0000044240664,0.000003522691,0.004701221,0.018169953,0.90835726,0.0018049004,0.00012499311],"about_ca_topic_score_codex":0.000003480212,"about_ca_topic_score_gemma":2.4021708e-7,"teacher_disagreement_score":0.066186324,"about_ca_system_score_codex":0.000011943256,"about_ca_system_score_gemma":0.000056911864,"threshold_uncertainty_score":0.2616149},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91463536,0.00001717776,0.00021022932,0.00011133905,0.0011779289,0.0005979853,0.0000044780904,0.0008456587,0.08239982],"genre_scores_gemma":[0.8501856,0.0000070849856,0.1482976,0.00013539937,0.0000030738072,0.00006788191,0.0000016634332,0.00006701323,0.0012347243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844414,0.00010202784,0.00041706784,0.00032952882,0.00030006305,0.00040715907],"domain_scores_gemma":[0.9984707,0.00048807613,0.000118974196,0.0005780042,0.00011630995,0.00022792921],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047099323,0.00025170983,0.00037162413,0.00008397133,0.00011588245,0.000022019261,0.00039951428,0.00013914565,0.00060206786],"category_scores_gemma":[0.00097015925,0.00021898265,0.00009286728,0.0003775172,0.000102654434,0.00023572888,0.00016897898,0.0002167346,0.0014716095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018416324,0.00021715205,0.00012477284,0.00008784721,0.00006173249,0.000031845415,0.0069968873,3.5563386e-7,0.00011498569,0.99062294,0.0016112422,0.00011185294],"study_design_scores_gemma":[0.0004137852,0.00013974236,0.00004795665,0.00005546735,0.000049303486,0.000014682625,0.00051521166,0.00005158884,0.0051797703,0.9924963,0.00074739574,0.00028876262],"about_ca_topic_score_codex":0.000004090848,"about_ca_topic_score_gemma":0.00000220692,"teacher_disagreement_score":0.14808735,"about_ca_system_score_codex":0.00009300078,"about_ca_system_score_gemma":0.000036527723,"threshold_uncertainty_score":0.99930584},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99820095,0.00010546445,0.0001497623,0.00020390943,0.0003247,0.00042002343,0.0000053540693,0.0000616103,0.00052821095],"genre_scores_gemma":[0.9968444,0.0000021678609,0.0030099384,0.00008846347,0.000001072317,0.000020413385,6.482352e-7,0.0000087460585,0.000024160914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986629,0.00017816658,0.00017691919,0.00033638254,0.00035059918,0.00029502768],"domain_scores_gemma":[0.9988094,0.000238721,0.0000951554,0.0004767857,0.00017974012,0.00020017284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004795857,0.00016362379,0.00024191868,0.00019400858,0.00012709621,0.00005315378,0.0002698468,0.000036177127,0.0000011653676],"category_scores_gemma":[0.00006577013,0.00012670741,0.00002672282,0.00076232024,0.00007186023,0.00026952146,0.00019092744,0.00013186295,0.000004045637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000835244,0.001265498,0.03814462,0.0000064283668,0.00007955733,0.000008171853,0.0097247455,0.000009272217,0.0002564426,0.94931334,0.00026357395,0.00084481534],"study_design_scores_gemma":[0.0035153073,0.0069668177,0.43068674,0.00019554856,0.000056442197,0.000013226537,0.0019826675,0.00007457412,0.030636525,0.52532417,0.000034789697,0.00051322446],"about_ca_topic_score_codex":0.00019232326,"about_ca_topic_score_gemma":0.000017624738,"teacher_disagreement_score":0.4239892,"about_ca_system_score_codex":0.000018969393,"about_ca_system_score_gemma":0.000034313827,"threshold_uncertainty_score":0.5166978},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99763376,0.0012192893,0.000070830894,0.00010016049,0.0006299396,0.0001594318,0.0000045577194,0.000028645854,0.00015336089],"genre_scores_gemma":[0.999417,0.000023781095,0.00052006374,0.000018605031,0.0000045732295,0.0000050757626,6.7697465e-7,0.0000061233463,0.000004083391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903256,0.00016275224,0.00020551553,0.00021986557,0.00018340051,0.00019588626],"domain_scores_gemma":[0.9990233,0.00018363925,0.00016544558,0.00050184363,0.00005420828,0.00007155754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057136995,0.00012022187,0.00021995918,0.00010141792,0.00009489665,0.000029270945,0.0004192098,0.000047749956,0.0000031156699],"category_scores_gemma":[0.00007572759,0.000090867,0.000075071686,0.0005103591,0.00017235753,0.00029387957,0.00024807203,0.000110077235,2.0251042e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014042199,0.00007086679,0.08799516,0.000014000489,0.000041472045,2.3843631e-7,0.0017854031,1.381581e-7,0.014134268,0.89334565,0.000035357923,0.00256343],"study_design_scores_gemma":[0.000700184,0.00009304452,0.16187708,0.000049051778,0.00003511132,0.0000030854042,0.00015434183,0.00006512975,0.06960619,0.76719284,0.00008093059,0.0001430333],"about_ca_topic_score_codex":0.00010693159,"about_ca_topic_score_gemma":0.000003014952,"teacher_disagreement_score":0.12615281,"about_ca_system_score_codex":0.000004303281,"about_ca_system_score_gemma":0.000016698386,"threshold_uncertainty_score":0.37054485},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98920476,0.0002780279,0.0034371307,0.0007393604,0.0031658516,0.00013160228,0.0000010175792,0.00013627103,0.0029059884],"genre_scores_gemma":[0.9972621,0.000004318408,0.0023339996,0.00024971244,0.000024897987,0.000010013596,0.0000029070072,0.0000076733695,0.000104360064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998929,0.00007228401,0.00019449534,0.00022139074,0.00015918702,0.0004236065],"domain_scores_gemma":[0.9993349,0.00009817255,0.00006646614,0.00032520265,0.000029008028,0.00014629994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003088579,0.0001267169,0.00015968496,0.00011431782,0.000065787855,0.00008599784,0.0005299945,0.000049553695,0.000011131172],"category_scores_gemma":[0.00003054675,0.00012687706,0.00004541051,0.00041699936,0.000026761274,0.00045325683,0.00023976607,0.0001393107,0.00021892943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026725925,0.00013265142,0.02061575,0.000007210969,0.000006005265,0.0000065717263,0.0010663371,0.000017411228,0.00040773954,0.9678675,0.001052249,0.008817883],"study_design_scores_gemma":[0.0020561956,0.00011280126,0.34402627,0.00004879593,0.0000072369958,0.000029175822,0.00005931568,0.015651133,0.0018366087,0.61834586,0.017165884,0.00066075864],"about_ca_topic_score_codex":0.00023602233,"about_ca_topic_score_gemma":0.000026703181,"teacher_disagreement_score":0.3495217,"about_ca_system_score_codex":0.00007730389,"about_ca_system_score_gemma":0.00003859255,"threshold_uncertainty_score":0.51738966},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93959963,0.000028401832,0.013606451,0.0005592251,0.0026697125,0.00067174935,0.000086109765,0.00012933472,0.042649373],"genre_scores_gemma":[0.9940925,8.0497676e-7,0.0031319645,0.00003284981,0.00010671581,0.00018458389,0.000018561594,0.00001620369,0.0024157646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953604,0.000003472064,0.0001192061,0.00012206359,0.000059141355,0.00016005132],"domain_scores_gemma":[0.99951255,0.00012102377,0.000047362624,0.00021832321,0.00004627339,0.000054457007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006130289,0.00008091419,0.000110133115,0.000011401412,0.00015069675,0.000037992853,0.00013762235,0.000023705708,0.0002346928],"category_scores_gemma":[0.000012342234,0.00007627619,0.00007214897,0.000049979135,0.00006237999,0.00014378685,0.00003478028,0.00010336293,0.0000790214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017139042,0.00006216856,0.00020555373,0.0000063362127,0.000012403642,4.431591e-8,0.000042363183,5.9031737e-7,0.000977356,0.9961504,0.0018694378,0.0006716305],"study_design_scores_gemma":[0.00029563808,0.000010550817,0.00003399462,0.0000027518956,0.000010408766,1.9275568e-7,0.00012111992,0.00003418321,0.00390798,0.9790086,0.016478894,0.00009565687],"about_ca_topic_score_codex":0.0000061198193,"about_ca_topic_score_gemma":3.6802618e-7,"teacher_disagreement_score":0.05449291,"about_ca_system_score_codex":0.0000038596477,"about_ca_system_score_gemma":0.0000127827625,"threshold_uncertainty_score":0.3110453},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9924886,0.000045110504,0.005124164,0.000029775294,0.00045271323,0.000075459546,0.0000022550146,0.00015474392,0.001627175],"genre_scores_gemma":[0.9962109,0.0000038057553,0.0037399104,0.000005328261,0.0000106155085,0.0000035921123,0.0000024706658,0.000019754512,0.0000036698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944127,0.0000076254705,0.000115672,0.000074078205,0.00018512832,0.00017622209],"domain_scores_gemma":[0.9995722,0.000045954213,0.0000127050735,0.00016207871,0.00004567907,0.00016134267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011863069,0.000080678496,0.00010700863,0.00007232357,0.000014735368,0.000014763206,0.00008502152,0.000031292886,0.000006998633],"category_scores_gemma":[0.000053212752,0.00007868032,0.00003308654,0.000190063,0.000016816273,0.00008627424,0.000010880411,0.00009099605,0.000020684758],"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.00007671605,0.00010272996,0.0018177879,0.00011806426,0.000066340996,0.000008739485,0.00029001452,0.65609413,0.033078626,0.2688377,0.003930718,0.035578467],"study_design_scores_gemma":[0.0010408922,0.0001814014,0.0003134912,0.000043303175,0.0000063669513,0.0000011996494,0.000033828528,0.57914764,0.077507444,0.3413339,0.00025372166,0.00013681606],"about_ca_topic_score_codex":0.00001614673,"about_ca_topic_score_gemma":5.640005e-7,"teacher_disagreement_score":0.076946475,"about_ca_system_score_codex":0.000055216162,"about_ca_system_score_gemma":0.000057838475,"threshold_uncertainty_score":0.32084903},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9781217,0.0000125355655,0.0022681917,0.0023438102,0.0021099385,0.00029727718,0.000006977144,0.00013834967,0.014701195],"genre_scores_gemma":[0.99721366,0.0000025988556,0.0023094527,0.00024101614,0.000008594719,0.000015953843,0.0000014615664,0.000014489296,0.00019275372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984955,0.00016068199,0.00021018772,0.0003139366,0.00048625006,0.00033341866],"domain_scores_gemma":[0.99736345,0.00089169526,0.000101186706,0.0013745346,0.00014909226,0.00012002531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006069842,0.00014308967,0.00018116481,0.00007169297,0.00016915095,0.00004952768,0.0018305947,0.00007362316,0.000118264856],"category_scores_gemma":[0.0003282235,0.00010255851,0.000090306305,0.0006378435,0.00025201897,0.00021028232,0.00037911604,0.00058719266,0.0002677946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014609509,0.00008554323,0.0009808178,0.0000029347439,0.000010094911,0.000007275386,0.00013761199,0.000005121768,0.011105782,0.984543,0.0006180927,0.002489108],"study_design_scores_gemma":[0.00046017967,0.0000718784,0.007949308,0.000012002593,0.000002257664,0.00000884132,0.0000069847733,0.002657021,0.010029186,0.9753887,0.0032787113,0.0001349244],"about_ca_topic_score_codex":0.000019988478,"about_ca_topic_score_gemma":0.000010763812,"teacher_disagreement_score":0.019091954,"about_ca_system_score_codex":0.000017263153,"about_ca_system_score_gemma":0.00006706686,"threshold_uncertainty_score":0.41822144},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9885105,0.00014782233,0.00020829374,0.0010700147,0.0008459052,0.00015173947,0.00001752722,0.000015436075,0.009032768],"genre_scores_gemma":[0.99783796,0.00013342127,0.000039777467,0.00050398684,0.000024097355,0.000012069543,0.000012671654,0.000018933373,0.0014170588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990086,0.00002049554,0.00047731522,0.00022457622,0.00007754516,0.00019148232],"domain_scores_gemma":[0.9989033,0.000076156015,0.0003974362,0.0005232744,0.0000477124,0.000052150055],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00073554466,0.0001288171,0.0003257056,0.000108476546,0.00012194158,0.000043580727,0.00026377794,0.00007382145,0.0010625692],"category_scores_gemma":[0.00008778276,0.000098684905,0.00010118265,0.00022369926,0.00006808992,0.0000767417,0.000040976818,0.00012446483,0.00010271592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038442817,0.00007871985,0.009058509,0.000011796177,0.000034429377,0.0000012927371,0.00007801834,0.00021627653,0.00002307411,0.98716474,0.00317079,0.00012393639],"study_design_scores_gemma":[0.0011520542,0.00024132247,0.015595871,0.000048557158,0.000009201347,0.00000279682,0.00003125768,0.027138377,0.00042346542,0.88821745,0.066930786,0.00020883349],"about_ca_topic_score_codex":0.00011552381,"about_ca_topic_score_gemma":0.000008951647,"teacher_disagreement_score":0.098947234,"about_ca_system_score_codex":0.000048213453,"about_ca_system_score_gemma":0.0000120980685,"threshold_uncertainty_score":0.9998506},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78800726,0.000059278915,0.206062,0.000031689462,0.0016642225,0.00020294385,0.0000019803574,0.00008624034,0.0038843593],"genre_scores_gemma":[0.9908781,0.0000010601516,0.0076214485,0.000013307995,0.0000049843798,0.00003088157,0.0000013794539,0.000005057869,0.0014437569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899197,0.0001537399,0.00025529257,0.00019572732,0.00026565936,0.00013763872],"domain_scores_gemma":[0.9991775,0.00013987327,0.00016822542,0.00024475137,0.00022688942,0.000042736563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036581085,0.00008906125,0.00013562344,0.00006763106,0.00007385417,0.000023877641,0.0004076891,0.000037744674,0.000031487412],"category_scores_gemma":[0.000084815816,0.00008272322,0.000050540053,0.00017470712,0.000035572353,0.0002198029,0.000086930755,0.000092600916,0.00004232858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002505239,0.00009568,0.002693921,0.000005483047,0.0000095377045,0.0000026563966,0.019567188,0.000001844359,0.0010263566,0.9758923,0.00001702651,0.0006855059],"study_design_scores_gemma":[0.000745367,0.0005955437,0.10273805,0.00012731875,0.000020187128,0.000008602502,0.0024204468,0.0024943382,0.038761254,0.8510027,0.0005992916,0.0004868829],"about_ca_topic_score_codex":0.00011283486,"about_ca_topic_score_gemma":0.0000010021423,"teacher_disagreement_score":0.20287085,"about_ca_system_score_codex":0.000028697063,"about_ca_system_score_gemma":0.00005564971,"threshold_uncertainty_score":0.33733553},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939067,0.000020042757,0.00028280492,0.00072925666,0.0025542544,0.00015235295,0.000001079617,0.000034050507,0.0023194903],"genre_scores_gemma":[0.9987836,4.5320735e-7,0.0008062836,0.000046752742,0.000010048044,0.0000045980737,2.649238e-7,0.0000048615307,0.0003431763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999187,0.000046945956,0.0002449302,0.00016803519,0.00021371839,0.00013935415],"domain_scores_gemma":[0.9990795,0.000056471705,0.0001801679,0.0005457839,0.0000933,0.000044746095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020634604,0.00008553443,0.00015326246,0.000041311865,0.000058853122,0.000021478207,0.0009817333,0.000051392053,0.000008890564],"category_scores_gemma":[0.00008048784,0.000048389436,0.00008519289,0.00030628766,0.00009024329,0.00017221035,0.00032709452,0.00014677513,0.000007689163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058156284,0.000121102494,0.002039848,0.000014793066,0.000011865557,5.885496e-7,0.00024051018,0.0000068992667,0.15696724,0.8239262,0.0007793571,0.01588576],"study_design_scores_gemma":[0.0009695324,0.00013961707,0.09523421,0.0000513471,0.000010248431,0.000008463539,0.000007414528,0.005801232,0.31781474,0.5772092,0.0025437209,0.00021030748],"about_ca_topic_score_codex":0.00011580904,"about_ca_topic_score_gemma":0.000018185625,"teacher_disagreement_score":0.24671705,"about_ca_system_score_codex":0.0000095231335,"about_ca_system_score_gemma":0.0001402991,"threshold_uncertainty_score":0.1973264},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99178106,0.000019726014,0.0000845647,0.00028556862,0.00023446635,0.00045180312,0.00003120159,0.00016036407,0.0069512245],"genre_scores_gemma":[0.9973585,0.000001507381,0.0020079177,0.00017525845,0.0000042426686,0.00008508018,0.000031900654,0.000032290678,0.00030332577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987568,0.00011596561,0.00024727924,0.00025651144,0.0003487927,0.00027462485],"domain_scores_gemma":[0.99866796,0.0002304277,0.00013095439,0.0006470295,0.00013488099,0.0001887318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045600743,0.00018157484,0.00024471103,0.000087057146,0.00016455793,0.000033402765,0.00027103967,0.000044959455,0.00005958845],"category_scores_gemma":[0.000054440017,0.00015087219,0.00006052439,0.00035253778,0.00011457508,0.00007948905,0.000044326578,0.00014905051,0.00013204903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000848986,0.00032305898,0.00027210618,0.000012051265,0.000054255674,0.000005015605,0.0003069185,0.0000026601854,0.00011796458,0.9805448,0.018238936,0.000037304242],"study_design_scores_gemma":[0.0021694226,0.00036800303,0.00017684266,0.000032108743,0.000043138967,0.0000038042633,0.00021771461,0.00004186511,0.00060542714,0.98328066,0.01286534,0.00019570308],"about_ca_topic_score_codex":0.000011827392,"about_ca_topic_score_gemma":0.000009019967,"teacher_disagreement_score":0.006647899,"about_ca_system_score_codex":0.000037375637,"about_ca_system_score_gemma":0.00003293027,"threshold_uncertainty_score":0.61523896},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98968554,0.0003011528,0.000387143,0.00032869037,0.000101756945,0.00020890705,0.000014631473,0.000027663731,0.008944517],"genre_scores_gemma":[0.997834,0.00003610079,0.0009638992,0.00003572463,0.000022879423,0.00009809761,0.000008505424,0.000011094034,0.0009896926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948794,0.00000853114,0.00013283892,0.00014784058,0.000075227,0.00014765553],"domain_scores_gemma":[0.9995701,0.00012890309,0.00005456693,0.00012474039,0.000038072285,0.00008365891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003845912,0.000102206795,0.00013781557,0.000017191469,0.00014267655,0.000102131075,0.00006975754,0.000021892283,0.00038226228],"category_scores_gemma":[0.0000060820457,0.0000902773,0.000027620346,0.000069671434,0.0001053536,0.00021814149,0.00007436883,0.00007217903,0.000049125825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011355704,0.00003198579,0.0029452776,0.000014559893,0.000016286966,1.7268827e-7,0.00016619609,3.5882746e-7,0.000049354545,0.9927676,0.0012506417,0.0027564827],"study_design_scores_gemma":[0.00028793592,0.000011276681,0.0040208455,0.00001197416,0.0000144360665,0.0000013177025,0.00074431417,0.000058396025,0.00018960082,0.99298936,0.0015606177,0.00010993207],"about_ca_topic_score_codex":0.000067926885,"about_ca_topic_score_gemma":2.2616186e-7,"teacher_disagreement_score":0.008148468,"about_ca_system_score_codex":0.0000051961,"about_ca_system_score_gemma":0.000007888403,"threshold_uncertainty_score":0.4185504},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.966371,0.00041689855,0.00056102197,0.0013118201,0.010267086,0.00016341823,0.000002013112,0.00046866375,0.020438097],"genre_scores_gemma":[0.9967371,0.000010958251,0.0024029205,0.00067363755,0.0000024946985,0.000010063195,0.0000016652458,0.0000104643905,0.0001506698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869907,0.000058238813,0.00021276271,0.00029091243,0.0002971088,0.0004419291],"domain_scores_gemma":[0.9986899,0.00017762522,0.000078102246,0.00068020436,0.00014803864,0.00022612173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034260485,0.00015804928,0.0001515953,0.00018048492,0.00021997145,0.00009454822,0.00047322613,0.000090022004,0.000047238333],"category_scores_gemma":[0.000119815166,0.00014532157,0.00007020454,0.00086786225,0.00006311333,0.00039104148,0.00013133505,0.00023541776,0.00050383044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022152822,0.00013779344,0.0031702244,0.0000036104318,0.000013214713,0.0000014667056,0.00013311462,0.000008880311,0.0003389618,0.98558986,0.009986779,0.0006138688],"study_design_scores_gemma":[0.00035742144,0.00010399956,0.0018274076,0.000024886174,0.000008155281,0.000029541301,0.00001650465,0.00028598023,0.0012508219,0.9949693,0.0009278458,0.00019815471],"about_ca_topic_score_codex":0.000026718879,"about_ca_topic_score_gemma":0.0000021847181,"teacher_disagreement_score":0.030366145,"about_ca_system_score_codex":0.000019936535,"about_ca_system_score_gemma":0.000043060772,"threshold_uncertainty_score":0.6475889},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.995743,0.0009072826,0.0018960007,0.00018265334,0.0006264975,0.000177809,0.000001861161,0.00006580571,0.0003991008],"genre_scores_gemma":[0.9950013,0.00004651471,0.0048332713,0.000038012495,0.0000018289654,0.000023526169,0.0000017779128,0.000013795365,0.000039979433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985306,0.000087200126,0.0003417011,0.00028774206,0.00038424443,0.00036846014],"domain_scores_gemma":[0.99872863,0.00011482473,0.0002210733,0.0006083991,0.00013606063,0.0001909994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034058708,0.00020286917,0.00037940487,0.00011562906,0.00008394594,0.000028249622,0.00042455655,0.000082090366,0.000005404174],"category_scores_gemma":[0.000027700315,0.0001516874,0.00005943454,0.0003319579,0.00015713679,0.00033468218,0.00022442505,0.00014229465,0.0000031612587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003319257,0.0004739697,0.04233246,0.00006217765,0.000048514707,0.0000014923968,0.0008062536,0.000043991964,0.00047419628,0.9536719,0.00014414005,0.0019077108],"study_design_scores_gemma":[0.0037449494,0.000750166,0.07703118,0.00016172991,0.00005542056,0.00002317485,0.000103070284,0.0038695605,0.00694888,0.9066462,0.0001725035,0.0004932007],"about_ca_topic_score_codex":0.000079762736,"about_ca_topic_score_gemma":0.0000042021516,"teacher_disagreement_score":0.047025736,"about_ca_system_score_codex":0.000012205257,"about_ca_system_score_gemma":0.00002820371,"threshold_uncertainty_score":0.61856323},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9634664,0.005394923,0.0047499137,0.016414305,0.0057095415,0.00044083528,0.0000027949682,0.0012853608,0.0025359455],"genre_scores_gemma":[0.9913413,0.00010725703,0.0069321557,0.0012435295,0.000054579577,0.000003524789,0.000002291655,0.000008974128,0.00030639215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891514,0.000050713697,0.00017101869,0.0004300853,0.00016381472,0.00026922888],"domain_scores_gemma":[0.99912834,0.00008360848,0.00006407469,0.0005445233,0.000035389967,0.00014408428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018977752,0.0001546876,0.0001726884,0.000081925384,0.00016489453,0.00017289835,0.0004193393,0.00006229745,0.000005416259],"category_scores_gemma":[0.000043332562,0.0001478534,0.00003466965,0.0003455359,0.00006321664,0.0007256307,0.00011391078,0.0001380152,0.000027308732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001916332,0.000046038178,0.0000804527,0.000003163594,0.000009435775,0.0000047889,0.00012802193,0.0000024438846,0.0024462754,0.9737219,0.0047195856,0.01883598],"study_design_scores_gemma":[0.0004663079,0.000103679406,0.0046269097,0.0000152556795,0.000007355885,0.00006206492,0.000025751602,0.00073702534,0.003490049,0.9881068,0.0021582062,0.00020061688],"about_ca_topic_score_codex":0.000025269155,"about_ca_topic_score_gemma":6.3270545e-7,"teacher_disagreement_score":0.027874915,"about_ca_system_score_codex":0.000033275224,"about_ca_system_score_gemma":0.00006744764,"threshold_uncertainty_score":0.60292864},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23205796,0.00010472445,0.7593327,0.0013618481,0.0010843223,0.00038262503,0.0000013550539,0.00021797087,0.005456484],"genre_scores_gemma":[0.76222986,0.0000037754985,0.2369485,0.0004709226,0.000010938565,0.000020027039,0.0000011840973,0.000013204243,0.00030161612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875784,0.000097373035,0.00016421416,0.00038725254,0.00024932486,0.00034399558],"domain_scores_gemma":[0.99889517,0.00008029915,0.000082081504,0.00066231104,0.00012574172,0.00015442567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016013093,0.00018349537,0.0002355602,0.00006239919,0.00012624876,0.00023060855,0.00071749056,0.00008970822,0.00007031911],"category_scores_gemma":[0.000021089481,0.00013360432,0.0000509578,0.00032211817,0.000049887465,0.0005652004,0.00014705425,0.00020179049,0.0000679886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007362535,0.00002992857,0.00026241218,0.000009684143,0.000025444097,0.000010697505,0.0005004369,0.000007222561,0.0013282007,0.9720837,0.003690221,0.022044707],"study_design_scores_gemma":[0.0017579015,0.00008559195,0.0017104378,0.000019302352,0.0000071523173,0.000028218115,0.0000075755065,0.0058704875,0.0019985295,0.98685217,0.0014195438,0.00024310466],"about_ca_topic_score_codex":0.00006491943,"about_ca_topic_score_gemma":0.0000026276673,"teacher_disagreement_score":0.5301719,"about_ca_system_score_codex":0.000024106268,"about_ca_system_score_gemma":0.000047313602,"threshold_uncertainty_score":0.5448226},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.860688,0.0002692887,0.0011261636,0.00012817128,0.0012436091,0.0004916212,0.000018503319,0.00051736884,0.13551727],"genre_scores_gemma":[0.9751207,0.000035419784,0.0073834285,0.000023280065,0.000009585338,0.000092138456,0.000004096678,0.000043892185,0.017287442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900496,0.000049634018,0.00030086696,0.00021909284,0.00017285135,0.00025259296],"domain_scores_gemma":[0.9990355,0.00024556371,0.00010103187,0.00040842665,0.00008842958,0.00012107504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016056538,0.00016382057,0.0002615716,0.00006659273,0.00017714863,0.000035213492,0.00013656642,0.00007771672,0.00071680656],"category_scores_gemma":[0.0003809407,0.00015239729,0.000070425915,0.00013106843,0.00014485721,0.00025674314,0.00011173858,0.00013536598,0.00020730132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009918208,0.00019242591,0.00028365626,0.000051690833,0.00004219247,0.0000064920355,0.0006375781,1.2220141e-7,0.00011912056,0.9939171,0.004707063,0.00003264422],"study_design_scores_gemma":[0.00060219027,0.00005081088,0.00046560675,0.000030741707,0.0000837853,0.000015455107,0.00030977823,0.000031490716,0.0010421721,0.99673426,0.00045570603,0.00017800479],"about_ca_topic_score_codex":0.000020565496,"about_ca_topic_score_gemma":0.000011611751,"teacher_disagreement_score":0.118229836,"about_ca_system_score_codex":0.000028978377,"about_ca_system_score_gemma":0.000016293146,"threshold_uncertainty_score":0.7848529},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9836696,0.00022152429,0.000035292465,0.0001558423,0.0051183132,0.00023746058,0.00001630039,0.0000426139,0.010503101],"genre_scores_gemma":[0.99687934,0.000021989428,0.00019840685,0.00010925717,0.00009624695,0.00010270674,0.000062832754,0.000034717155,0.002494518],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990457,0.000036653037,0.00019197077,0.00031393138,0.00014508095,0.00026665605],"domain_scores_gemma":[0.99907076,0.000021542537,0.00008244466,0.000573376,0.00013600955,0.00011587116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016833167,0.00014909034,0.00012856684,0.00003696685,0.00012109241,0.00006222234,0.0002828607,0.00019272389,0.000080172715],"category_scores_gemma":[0.00015544058,0.00015371165,0.000075528646,0.00008093,0.00004684719,0.000008202064,0.00012357508,0.00024943944,0.0002102705],"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.000023876939,0.00018019133,0.004546567,0.000016136828,0.000062932486,0.0000062865643,0.000019555324,0.00001523487,0.8837779,0.09328352,0.01786907,0.00019872111],"study_design_scores_gemma":[0.0019102038,0.00042647214,0.005061034,0.000039507497,0.000035886813,0.00015633041,0.000090946785,0.00017078948,0.3843936,0.030674841,0.5762913,0.00074903923],"about_ca_topic_score_codex":0.0001314078,"about_ca_topic_score_gemma":0.000058672995,"teacher_disagreement_score":0.55842227,"about_ca_system_score_codex":0.000013722586,"about_ca_system_score_gemma":0.000076599186,"threshold_uncertainty_score":0.62681794},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9910598,0.0006347567,0.00079108984,0.0007448342,0.0026093174,0.00012321043,2.646662e-7,0.00014858757,0.0038881297],"genre_scores_gemma":[0.9957659,0.000008556377,0.0040335325,0.00007518417,6.3062504e-7,0.000006325776,3.8971052e-7,0.000006239745,0.00010324449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897194,0.00008352232,0.00023031363,0.00016902096,0.00034647822,0.00019870444],"domain_scores_gemma":[0.99880207,0.000120279125,0.00011048691,0.0006583779,0.00020016688,0.00010865243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067342544,0.00008912719,0.00012908195,0.000035159126,0.00012393664,0.000076187614,0.0006628474,0.000038919356,0.0000017365301],"category_scores_gemma":[0.00012491453,0.00006099049,0.00005919057,0.00048710394,0.00010252532,0.00013811063,0.00016351945,0.00007909345,0.00007154724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017153212,0.000047786547,0.0009983581,0.0000047664075,0.000013269937,0.0000029365538,0.00036475895,0.00000647888,0.00016085844,0.99410266,0.0034531266,0.0008432943],"study_design_scores_gemma":[0.0004539233,0.000052263455,0.0001929608,0.000020561934,0.000005138104,0.00001232896,0.000027205886,0.0025019976,0.001220987,0.9946236,0.00080844306,0.00008058774],"about_ca_topic_score_codex":0.0000414394,"about_ca_topic_score_gemma":9.83309e-7,"teacher_disagreement_score":0.0047060866,"about_ca_system_score_codex":0.000012851942,"about_ca_system_score_gemma":0.00007604673,"threshold_uncertainty_score":0.248712},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9664103,0.00018791787,0.02207339,0.0020373177,0.0029286768,0.0006852895,0.0000066349003,0.00006040163,0.0056100967],"genre_scores_gemma":[0.999369,0.000008688538,0.0005196814,0.000042141022,0.0000024644428,0.000011524756,2.1892275e-7,0.0000044854064,0.000041791758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998422,0.00044258757,0.00026371042,0.00016903086,0.00047551654,0.00022715399],"domain_scores_gemma":[0.99760455,0.0007185009,0.00018212666,0.0012675611,0.00018404295,0.000043239095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014511592,0.000078954174,0.0001488515,0.000034161516,0.00021757034,0.00002329746,0.0020346746,0.000021967959,0.0000033529116],"category_scores_gemma":[0.00022036869,0.000044938835,0.000108710585,0.0005820929,0.00038306278,0.00008529146,0.0006493492,0.00012789754,0.0000030309554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007966793,0.00004406104,0.004282047,0.000007826871,0.00001333707,8.960029e-8,0.00013131285,0.000008625649,0.000664037,0.990914,0.00028725207,0.0036394317],"study_design_scores_gemma":[0.00034160315,0.00009545967,0.018066378,0.00001092962,0.0000026070238,6.161647e-7,0.000021425161,0.00073131244,0.009181682,0.9688106,0.0026869061,0.000050460738],"about_ca_topic_score_codex":0.000034624285,"about_ca_topic_score_gemma":0.000011687856,"teacher_disagreement_score":0.032958727,"about_ca_system_score_codex":0.000015533687,"about_ca_system_score_gemma":0.000042034084,"threshold_uncertainty_score":0.37809655},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96258795,0.00011335549,0.009790762,0.00015250653,0.0017446661,0.0003212027,0.0000012569317,0.00012326216,0.025165012],"genre_scores_gemma":[0.99663424,0.000010744299,0.0030307893,0.00001215226,0.0000017815161,0.00002086775,4.1745128e-7,0.000007984748,0.0002809915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988473,0.00014990808,0.00019541735,0.00020907281,0.00033782888,0.00026045673],"domain_scores_gemma":[0.99869406,0.0002938044,0.000100101126,0.00065245375,0.00019552455,0.00006407642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061815465,0.000091923706,0.00010979697,0.00005803983,0.00018342948,0.000034729987,0.0009866687,0.000042986398,0.000024376986],"category_scores_gemma":[0.00011401981,0.00006839902,0.00007189807,0.00058100134,0.00019266707,0.0003797724,0.0002541107,0.00012038203,0.000058441714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020701991,0.00006215225,0.0012074688,0.0000030873202,0.000013143224,0.0000032837322,0.0005194444,3.577233e-7,0.00060386467,0.991317,0.00012478324,0.0061247405],"study_design_scores_gemma":[0.00037002438,0.00007521722,0.0050677336,0.0000052141745,0.0000021735152,0.0000075198236,0.000038684175,0.00030874947,0.014093292,0.9798694,0.00007941742,0.00008253684],"about_ca_topic_score_codex":0.000014576494,"about_ca_topic_score_gemma":0.0000013405044,"teacher_disagreement_score":0.034046296,"about_ca_system_score_codex":0.000019649562,"about_ca_system_score_gemma":0.00003480122,"threshold_uncertainty_score":0.27892312},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98387474,0.00030951295,0.00017502788,0.00026874946,0.00012430076,0.00039714054,0.000010416016,0.000010597274,0.01482951],"genre_scores_gemma":[0.9988617,0.00006344459,0.00063202286,0.000010826273,0.000013240833,0.000051103452,0.0000015451794,0.000013563582,0.00035256724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991662,0.00007371056,0.0003166142,0.00014180884,0.0001319386,0.00016974822],"domain_scores_gemma":[0.9985965,0.0006070272,0.00029393384,0.0003946756,0.0000625078,0.000045364955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029347074,0.00012799195,0.00021275983,0.0000127789535,0.00035967064,0.000029369432,0.00027481612,0.00003153276,0.000054408945],"category_scores_gemma":[0.00003898784,0.00006217986,0.00010074712,0.00020732255,0.000717164,0.00012031753,0.00016232143,0.00015224383,0.0000018614583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020770247,0.0000421577,0.03215919,0.000008220976,0.00005750193,4.2955165e-8,0.0019538873,0.0000029293733,0.00005418674,0.96538943,0.00006917023,0.00024253802],"study_design_scores_gemma":[0.0007190034,0.00001120606,0.014286223,0.000022882368,0.00006308039,6.749618e-7,0.0018510728,0.00016577361,0.0010250383,0.9815311,0.00024221675,0.00008173349],"about_ca_topic_score_codex":0.00052508386,"about_ca_topic_score_gemma":0.000023308188,"teacher_disagreement_score":0.017872967,"about_ca_system_score_codex":0.000008387618,"about_ca_system_score_gemma":0.000020780206,"threshold_uncertainty_score":0.2766332},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.988045,0.0005023353,0.000052398496,0.0002527632,0.00096070557,0.00009302253,0.0000024076198,0.00011204596,0.009979362],"genre_scores_gemma":[0.9971458,0.00003367986,0.00021961956,0.00028887924,0.000039883555,0.000012201673,0.0000038013197,0.000027540726,0.002228603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988135,0.000059444494,0.00020930104,0.00016558908,0.0003410963,0.00041106628],"domain_scores_gemma":[0.99819297,0.0010759906,0.00011175825,0.0004085213,0.00004329477,0.00016745062],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038404868,0.0001712735,0.00029085568,0.00022114381,0.000117571784,0.000028836615,0.00019696682,0.000101837824,0.00032311538],"category_scores_gemma":[0.00095734623,0.00014414631,0.00013258509,0.0006271582,0.000044730048,0.00021537572,0.000064198335,0.00016855018,0.0009718762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058292812,0.00025702865,0.0039537516,0.000012189485,0.000079982485,0.0000018933337,0.00028791395,0.0000019206386,0.0000050609815,0.9838345,0.011080249,0.00047966794],"study_design_scores_gemma":[0.00038793372,0.00006088257,0.0014613373,0.000012154495,0.00008863732,0.0000016496871,0.000112543086,0.000054832282,0.00021796604,0.9939694,0.0034423142,0.00019037335],"about_ca_topic_score_codex":0.000013307901,"about_ca_topic_score_gemma":5.178657e-7,"teacher_disagreement_score":0.010134864,"about_ca_system_score_codex":0.00004881811,"about_ca_system_score_gemma":0.000016833115,"threshold_uncertainty_score":0.999806},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57806826,0.0021094081,0.3979111,0.000111139685,0.008119091,0.0039985473,0.000017393917,0.0026148143,0.0070502195],"genre_scores_gemma":[0.9860933,0.0000022334032,0.013466888,0.000013702885,0.000013144594,0.00032121988,0.000018169982,0.000043063486,0.000028299972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911714,0.000037682843,0.00023943408,0.00012320693,0.00011941701,0.00036310568],"domain_scores_gemma":[0.9995416,0.000066222405,0.00004421478,0.00021061502,0.00005268945,0.00008464993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016663356,0.00015102499,0.00018633925,0.00013503134,0.000043473978,0.000020967116,0.00009964906,0.00009224634,0.000007767664],"category_scores_gemma":[0.00007418321,0.00016857676,0.000037859423,0.00036914318,0.000019794968,0.00038710778,0.000012508448,0.00015439224,0.000052804717],"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.000048524274,0.0014076605,0.15737116,0.0004130722,0.00016479925,0.0000099072795,0.0055400394,0.6234789,0.0029769596,0.18790899,0.00033033107,0.020349678],"study_design_scores_gemma":[0.005432207,0.00005486243,0.023916999,0.00009305775,0.000028290917,0.0000036985937,0.0003075685,0.96038413,0.0026601453,0.0043642325,0.002062106,0.0006926904],"about_ca_topic_score_codex":0.000019795776,"about_ca_topic_score_gemma":0.000015053356,"teacher_disagreement_score":0.408025,"about_ca_system_score_codex":0.00022431853,"about_ca_system_score_gemma":0.000016029006,"threshold_uncertainty_score":0.6874361},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89517474,0.0017794833,0.097344525,0.000034180583,0.0020316527,0.00020231341,0.0000028963834,0.0002540175,0.0031762111],"genre_scores_gemma":[0.93531585,0.000111758825,0.06454325,0.000004183358,0.0000049203627,0.0000014375829,0.0000022343745,0.000007892194,0.000008457496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99957466,0.000036562957,0.00017522943,0.000064549684,0.000071715396,0.000077293254],"domain_scores_gemma":[0.9997454,0.000026622096,0.00005042014,0.00011670458,0.00003939723,0.000021411934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020071238,0.00006587599,0.00014495297,0.0000630407,0.000013157307,0.0000040900954,0.00006528229,0.000056064313,0.000015312457],"category_scores_gemma":[0.00002308286,0.00006878003,0.000029958383,0.00010901097,0.000019120846,0.00009277131,0.0000047854587,0.000050685616,6.716203e-7],"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.00001628834,0.00008174358,0.00031557566,0.00035958661,0.00007383393,0.0000015420894,0.0004936172,0.05633288,0.05185378,0.7293369,0.00021255932,0.16092166],"study_design_scores_gemma":[0.00024432928,0.00006273776,0.0012106065,0.00002733766,0.000014705068,0.000001533329,0.00001334461,0.007225731,0.63321215,0.35783058,0.000075679825,0.00008126644],"about_ca_topic_score_codex":0.0000027729052,"about_ca_topic_score_gemma":4.4369344e-8,"teacher_disagreement_score":0.5813584,"about_ca_system_score_codex":0.000014935427,"about_ca_system_score_gemma":0.0000072483563,"threshold_uncertainty_score":0.2804768},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9778374,0.00005037972,0.00093642797,0.013184931,0.0035082323,0.000863663,0.0000014921239,0.00026117664,0.003356335],"genre_scores_gemma":[0.99350065,0.0000029904675,0.0028952772,0.0027246915,0.000001732854,0.00022575646,0.0000011705415,0.000012283987,0.00063545734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988985,0.000066475055,0.00018063662,0.00030842144,0.00022510753,0.00032082724],"domain_scores_gemma":[0.9983242,0.000674223,0.000079033096,0.0006549861,0.00016526182,0.000102266335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000405053,0.00013563801,0.0001326324,0.00004846322,0.00029116287,0.00021270994,0.00078505656,0.00006536981,0.000034151108],"category_scores_gemma":[0.00018448386,0.000090525886,0.00009051636,0.0002809043,0.00005650509,0.00018756554,0.00012259072,0.00013082247,0.0004850142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002690626,0.000051005678,0.00006781065,0.0000031476666,0.000012373011,7.566791e-7,0.00010190295,0.000015606263,0.00024684513,0.9053598,0.093402065,0.0007360161],"study_design_scores_gemma":[0.000561374,0.00016998146,0.00025156242,0.0000152259745,0.000004103827,0.0000028045154,0.000019240508,0.00862178,0.0009210563,0.986869,0.0024305305,0.00013338821],"about_ca_topic_score_codex":0.000075790704,"about_ca_topic_score_gemma":0.0000017298225,"teacher_disagreement_score":0.09097153,"about_ca_system_score_codex":0.000022314247,"about_ca_system_score_gemma":0.000043607943,"threshold_uncertainty_score":0.6234038},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9961011,0.00016831931,0.00000932543,0.00028971763,0.0003710888,0.00038058922,0.0000025117017,0.00015367531,0.0025237084],"genre_scores_gemma":[0.9986119,0.000018953264,0.00041347448,0.00004744519,0.0000064258866,0.00007123008,0.000008320281,0.000045359928,0.0007768814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984953,0.00009578161,0.00030236962,0.00031432873,0.0003607659,0.00043146074],"domain_scores_gemma":[0.9988395,0.0003368761,0.00020875623,0.0003949568,0.00012139097,0.000098516444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030273985,0.0002365012,0.0003784441,0.00011543763,0.000114302136,0.00014284858,0.00028169676,0.000118430646,0.000088037494],"category_scores_gemma":[0.0002465971,0.0001943985,0.00006379589,0.00043803672,0.0001426417,0.0003942296,0.000044025306,0.00021151867,0.00005024047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010650847,0.00032142532,0.07099379,0.000043260705,0.000075630465,0.000014405428,0.0007087243,7.450765e-7,0.00012165597,0.9255086,0.0020957217,0.0001053674],"study_design_scores_gemma":[0.001303188,0.00008073317,0.055369783,0.0001668609,0.000028454228,0.000001366805,0.00028476876,0.00006950734,0.00080749847,0.9414306,0.00017956631,0.00027762863],"about_ca_topic_score_codex":0.00018635574,"about_ca_topic_score_gemma":0.00061844825,"teacher_disagreement_score":0.01592202,"about_ca_system_score_codex":0.00009081563,"about_ca_system_score_gemma":0.00003785454,"threshold_uncertainty_score":0.7927341},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99396086,0.002069992,0.0014225021,0.00038301584,0.0009338892,0.00009756582,9.26014e-7,0.00008174895,0.0010494957],"genre_scores_gemma":[0.9958976,0.000025875579,0.003830734,0.00007664134,0.000004256254,0.0000050258823,0.0000030534268,0.00000808042,0.00014874645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989059,0.000086048545,0.00020865754,0.00028160462,0.00026527132,0.00025249485],"domain_scores_gemma":[0.99921846,0.000058347174,0.00012593492,0.00036129492,0.00012082788,0.0001151482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002844856,0.00012879419,0.00021980687,0.000090934416,0.0000309976,0.00005662584,0.00058192486,0.00006927232,0.000003696155],"category_scores_gemma":[0.0000887313,0.00011765548,0.000026650558,0.00068196724,0.000056050158,0.00046378307,0.00014810526,0.0001111248,0.000019101042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010860446,0.00023535125,0.016099945,0.00001645442,0.000015348982,0.000043159842,0.0013868483,0.00027457505,0.0045051407,0.9709927,0.0041674804,0.0022521499],"study_design_scores_gemma":[0.0024064835,0.00033455793,0.0022644242,0.000050493367,0.000008176815,0.0000091564,0.00018446983,0.014396965,0.05013266,0.922893,0.0068490966,0.00047054572],"about_ca_topic_score_codex":0.00007206735,"about_ca_topic_score_gemma":0.000013424109,"teacher_disagreement_score":0.04809971,"about_ca_system_score_codex":0.000041024177,"about_ca_system_score_gemma":0.00007821648,"threshold_uncertainty_score":0.4797851},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9908072,0.00008600938,0.000010195582,0.00007100399,0.00076237274,0.00008013439,5.01721e-7,0.00011296367,0.008069647],"genre_scores_gemma":[0.99924105,0.0000018449142,0.00011571288,0.000042418334,0.0000064626333,0.0000069320395,0.0000016614155,0.000010510066,0.00057338935],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99941516,0.00003854293,0.0000844725,0.00014552481,0.00019345708,0.00012285262],"domain_scores_gemma":[0.99970233,0.000026237012,0.000041047268,0.00011656586,0.000007975814,0.000105812214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030976263,0.000063420186,0.00007317521,0.000010345277,0.000051250434,0.000034359135,0.000071664304,0.000035598303,0.00001569282],"category_scores_gemma":[0.00008828957,0.0000583349,0.000007817729,0.00009045504,0.000042221876,0.00011112085,0.000053116524,0.000051243762,0.00032971537],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009755912,0.00003445754,0.9150563,0.000003466842,0.0000043516397,0.000005420607,0.00086044014,0.0004709845,0.0005547503,0.0076404046,0.07459465,0.0007650232],"study_design_scores_gemma":[0.0036674573,0.00050749927,0.81528497,0.00005383501,0.000040980773,0.00005987711,0.00053946255,0.03708709,0.00046265995,0.08806148,0.053563945,0.0006707547],"about_ca_topic_score_codex":0.00032531132,"about_ca_topic_score_gemma":0.0000026529033,"teacher_disagreement_score":0.09977134,"about_ca_system_score_codex":0.000055841352,"about_ca_system_score_gemma":0.00000791167,"threshold_uncertainty_score":0.42379338},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9713287,0.000048594815,0.000029448973,0.000012235729,0.0021212522,0.00014049937,0.000003903503,0.000079538746,0.026235862],"genre_scores_gemma":[0.9980767,0.000015548165,0.0016543184,0.000038079208,0.000006824737,0.000006617676,0.0000018716493,0.00002211115,0.00017796959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991585,0.000071222275,0.00028050214,0.00015714337,0.00016324267,0.00016935951],"domain_scores_gemma":[0.9991239,0.00018083792,0.00016636682,0.00036865522,0.00010299604,0.00005726114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031827026,0.00012823677,0.00023111828,0.00009067579,0.0001026859,0.000004733268,0.00019930968,0.000106968175,0.00025310606],"category_scores_gemma":[0.00021779489,0.00011035998,0.0001217937,0.00020398013,0.00013306167,0.000072886236,0.000065580774,0.00013146963,0.000004668076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004184548,0.00010891715,0.0028648241,0.000041779727,0.00006397054,0.00000305584,0.0021478739,1.0370624e-7,0.00015534865,0.9930364,0.0011957709,0.0003400956],"study_design_scores_gemma":[0.0006114973,0.00013024759,0.001435241,0.000021225906,0.00003946584,0.0000068575264,0.00018046385,0.000008838782,0.009077483,0.9881626,0.00020000416,0.00012611096],"about_ca_topic_score_codex":0.000041499326,"about_ca_topic_score_gemma":0.0000042878078,"teacher_disagreement_score":0.026747994,"about_ca_system_score_codex":0.000013216468,"about_ca_system_score_gemma":0.0000129584305,"threshold_uncertainty_score":0.45003495},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63874793,0.00012972472,0.3204715,0.0021792492,0.012748525,0.0011183124,0.0000034828909,0.00026921564,0.024332084],"genre_scores_gemma":[0.9968895,0.0000048428983,0.0025832132,0.00009488634,0.000016716614,0.000052261177,8.821979e-7,0.000011650389,0.000346064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896014,0.00009419615,0.00024600202,0.00023647405,0.00020743276,0.00025574898],"domain_scores_gemma":[0.9983735,0.0004470768,0.00014786293,0.0006620871,0.00030625446,0.000063200554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005660109,0.00011118575,0.00018878884,0.00003038496,0.00036068002,0.0001214372,0.00058931456,0.000057101286,0.0000033273097],"category_scores_gemma":[0.000055991124,0.00007209941,0.000090901085,0.0002540512,0.00008159922,0.00014612699,0.000083769184,0.000091714144,0.000015245757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016051965,0.000042313415,0.00063271425,0.000008071495,0.000028915932,3.9632314e-7,0.00012479226,0.0000053274307,0.000036153742,0.9934694,0.0029932407,0.0026426062],"study_design_scores_gemma":[0.00082863827,0.00023813381,0.0012236328,0.00005065573,0.000010687447,0.00001991967,0.00004497633,0.011416552,0.00031601734,0.9715958,0.01411627,0.00013868374],"about_ca_topic_score_codex":0.000042352913,"about_ca_topic_score_gemma":0.00005479292,"teacher_disagreement_score":0.35814157,"about_ca_system_score_codex":0.000018188914,"about_ca_system_score_gemma":0.00003624166,"threshold_uncertainty_score":0.29401284},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937526,0.00012432292,0.000090628404,0.00041658705,0.0014321038,0.00013302338,4.525844e-7,0.00013437627,0.0039159157],"genre_scores_gemma":[0.99801683,0.000009045087,0.0015609409,0.0002650753,2.9807327e-7,0.000014706116,7.22868e-7,0.0000064192254,0.00012597376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990811,0.000042862568,0.00020415895,0.00023230139,0.00023655145,0.00020302991],"domain_scores_gemma":[0.9990065,0.000104378574,0.000086354354,0.00057319185,0.00013906436,0.00009050917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015596263,0.00009951382,0.00014020482,0.00013443714,0.000057391197,0.00004595231,0.0004678545,0.000045735396,0.000039925497],"category_scores_gemma":[0.00004822574,0.00008441933,0.00006241316,0.00046198667,0.000049582293,0.00020245148,0.00010200824,0.0000916051,0.00039565333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001364634,0.00009083366,0.00072918535,0.000004894535,0.000008903086,0.0000012454478,0.00007187703,0.000014165492,0.0030264147,0.9890363,0.005774774,0.0012400107],"study_design_scores_gemma":[0.00036587083,0.00018660587,0.0017492506,0.000020650663,0.000002353831,0.000001348002,0.000002694446,0.0012029344,0.011600061,0.9846118,0.00016069028,0.00009575437],"about_ca_topic_score_codex":0.0000846518,"about_ca_topic_score_gemma":5.029967e-7,"teacher_disagreement_score":0.008573647,"about_ca_system_score_codex":0.000006461603,"about_ca_system_score_gemma":0.00002121403,"threshold_uncertainty_score":0.5085455},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97935474,0.00031881602,0.00036343324,0.00003248235,0.0033894952,0.00019295064,0.000008545642,0.0002542108,0.01608531],"genre_scores_gemma":[0.9995359,0.000032215856,0.00009979599,0.000036725007,0.000013360163,0.000020714868,0.0000044464346,0.000039433493,0.00021739985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901336,0.00008452574,0.00030905954,0.00016618679,0.00017188185,0.00025497656],"domain_scores_gemma":[0.9992538,0.00012214431,0.000046224017,0.00033162287,0.00016030809,0.0000859183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003407041,0.00018463156,0.0003122071,0.00010765957,0.00005295569,0.000014538294,0.00020563013,0.00011546333,0.00008769504],"category_scores_gemma":[0.0000745443,0.00016176881,0.00009645055,0.00044737363,0.00006673815,0.000101476566,0.000015760746,0.00015142362,0.00006350143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003900154,0.00005132667,0.0006422596,0.00019409554,0.0001330456,0.0000055522446,0.0007224134,0.00028084847,0.006901561,0.9866638,0.0028027603,0.0015633283],"study_design_scores_gemma":[0.0029660726,0.00044952144,0.0038721436,0.00041859166,0.00011026876,0.000024241424,0.00048314492,0.004090078,0.05024642,0.91883034,0.01766473,0.0008444304],"about_ca_topic_score_codex":0.000014162213,"about_ca_topic_score_gemma":0.000007408699,"teacher_disagreement_score":0.06783345,"about_ca_system_score_codex":0.000015357693,"about_ca_system_score_gemma":0.0000139224385,"threshold_uncertainty_score":0.65967405},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98255897,0.00006127915,0.0023619265,0.00008786075,0.00093969144,0.0002056668,0.0000052471796,0.00009660056,0.013682741],"genre_scores_gemma":[0.9911648,0.0000031318168,0.008183909,0.000024552774,0.000017899165,0.000021164344,0.0000024178316,0.000020711755,0.0005613872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914,0.000040579038,0.00028201792,0.00008907103,0.00023144757,0.00021687122],"domain_scores_gemma":[0.998937,0.0005191435,0.00014151768,0.0002655372,0.00007206216,0.00006473177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026408848,0.00010123877,0.00019213461,0.000049661176,0.00009585194,0.000022475138,0.00008190775,0.00005554092,0.000078435245],"category_scores_gemma":[0.0007611787,0.00009572929,0.00005824299,0.00011267868,0.00007628084,0.00030848532,0.000034144792,0.00009670862,0.000097208824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062613944,0.00025962587,0.0002245245,0.00007879844,0.000009307853,4.720503e-7,0.00086093694,0.0000022892805,0.0015900607,0.9958915,0.00095043523,0.0001257527],"study_design_scores_gemma":[0.00027189535,0.000042012896,0.00023651251,0.000083392595,0.00002239175,0.0000020978139,0.000068493544,0.000046459016,0.03581389,0.9630631,0.00025482333,0.00009489397],"about_ca_topic_score_codex":0.0000027168223,"about_ca_topic_score_gemma":0.0000010404838,"teacher_disagreement_score":0.034223832,"about_ca_system_score_codex":0.0000517221,"about_ca_system_score_gemma":0.000015952897,"threshold_uncertainty_score":0.3903727},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73513716,0.000034410852,0.0000012236586,0.0014916983,0.0006480698,0.00011613237,2.6318085e-7,0.000049776332,0.26252127],"genre_scores_gemma":[0.9969955,0.00003015991,0.00006473979,0.00004983713,0.000009091027,0.000014770808,4.6202922e-7,0.000004475047,0.0028309494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992406,0.00010565604,0.00011820329,0.00013353438,0.00019430504,0.00020773329],"domain_scores_gemma":[0.9996987,0.0000851429,0.00003681422,0.00008824317,0.000040962605,0.000050153107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039033772,0.00005770011,0.000107864136,0.000056111207,0.00016291557,0.00001606479,0.00016401122,0.00005698409,0.000086734646],"category_scores_gemma":[0.0002869951,0.000057414876,0.000032940632,0.00029476668,0.00017015693,0.00013946436,0.000052767908,0.000080334874,0.000067701054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065518298,0.00012650278,0.021203104,0.0000017809042,0.000004044888,0.0000063577227,0.016328422,1.2911338e-8,0.000018835059,0.95644116,0.0013654368,0.0044977553],"study_design_scores_gemma":[0.00049028103,0.00005100635,0.20926958,0.000014109089,0.0000055592423,1.274939e-7,0.0027845467,0.000009347137,0.00016462353,0.7611188,0.02597451,0.00011745706],"about_ca_topic_score_codex":0.0015477844,"about_ca_topic_score_gemma":0.014578091,"teacher_disagreement_score":0.26185837,"about_ca_system_score_codex":0.000102818296,"about_ca_system_score_gemma":0.000039278613,"threshold_uncertainty_score":0.8134917},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9708897,0.0010389384,0.01826957,0.00043412304,0.006053606,0.00018868828,4.902863e-7,0.00030595562,0.0028189498],"genre_scores_gemma":[0.9948949,0.000025586958,0.0047873445,0.00019216757,0.000001963998,0.000004127842,0.0000016578997,0.000010346411,0.00008188556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986239,0.00011620676,0.00031895985,0.00033853843,0.00032257676,0.00027982533],"domain_scores_gemma":[0.9985508,0.00024274523,0.00016332179,0.0007457615,0.00017747193,0.000119953285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066216994,0.00013902012,0.00024884255,0.00021243728,0.00009389161,0.00003897356,0.00059663743,0.00008688395,0.000004207764],"category_scores_gemma":[0.00013093393,0.00012284206,0.00008789422,0.0011709842,0.00005698883,0.00017047531,0.00024868437,0.00012038921,0.000038181046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029886392,0.00008981758,0.0012864883,0.000008163428,0.000011881059,0.0000012640496,0.00005765395,0.0006269073,0.0008264394,0.9903692,0.002477894,0.0042413305],"study_design_scores_gemma":[0.00080833497,0.0002572921,0.0012236057,0.00003804434,0.000012272152,0.000003371846,0.000005484452,0.17648488,0.003989725,0.81596386,0.0010055416,0.00020757089],"about_ca_topic_score_codex":0.0000253174,"about_ca_topic_score_gemma":4.0705024e-7,"teacher_disagreement_score":0.17585798,"about_ca_system_score_codex":0.000012588191,"about_ca_system_score_gemma":0.000020927171,"threshold_uncertainty_score":0.5009354},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97616917,0.00036685105,0.015006013,0.0016710949,0.0023560245,0.00023505643,0.0000051257075,0.00016046103,0.0040302207],"genre_scores_gemma":[0.9921441,0.0000069234966,0.0075838077,0.00016526654,0.0000117706795,0.0000036398048,0.0000061026453,0.0000028803463,0.0000754809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998839,0.00008285505,0.00029897003,0.0002790227,0.00033169042,0.00016843314],"domain_scores_gemma":[0.99881375,0.00012573089,0.00011155535,0.0006913385,0.00017485717,0.00008275448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294516,0.00010773284,0.00018902644,0.00011585701,0.000075513904,0.000045236837,0.0007712795,0.000055985503,0.0000146021075],"category_scores_gemma":[0.00021821448,0.00010855414,0.00010639906,0.0006825852,0.000028314309,0.00037924384,0.00010362922,0.0000856357,0.000014045047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011182488,0.00020352386,0.00042619024,0.0000048173747,0.0000077075965,0.0000019356203,0.00012044626,0.000095209776,0.0013686613,0.9750856,0.0028333224,0.019841405],"study_design_scores_gemma":[0.0009573029,0.00027074275,0.028032776,0.0000060828984,0.000004605556,0.000004126879,0.0000042245138,0.0020589274,0.0073846127,0.9601762,0.0009783176,0.00012206077],"about_ca_topic_score_codex":0.000010561498,"about_ca_topic_score_gemma":0.0000016930808,"teacher_disagreement_score":0.027606586,"about_ca_system_score_codex":0.000034175046,"about_ca_system_score_gemma":0.000081816186,"threshold_uncertainty_score":0.4426709},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9587234,0.00002409253,0.014834539,0.00070344936,0.008325444,0.0002724632,6.448868e-7,0.0003234196,0.016792493],"genre_scores_gemma":[0.99911934,0.0000023818259,0.00019582981,0.0004949222,0.000025197978,0.00003541449,0.0000012167745,0.000014571792,0.0001111416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981072,0.00037330648,0.00032251433,0.0005397724,0.00025807729,0.00039913517],"domain_scores_gemma":[0.99840176,0.0005279358,0.00011316819,0.0007590545,0.00009255395,0.000105514206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008918867,0.00020140372,0.0003063042,0.00025844912,0.00012677033,0.00014024362,0.00068015564,0.00013562487,0.000012273732],"category_scores_gemma":[0.00023932537,0.00019094808,0.00010432803,0.0007939552,0.000030138603,0.00031039276,0.000121255885,0.00030973004,0.00015881722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012282329,0.00012451697,0.001838101,0.0000066635707,0.000007080949,0.000008527765,0.0003554097,0.00012640827,0.0001666858,0.99126434,0.001286579,0.00480341],"study_design_scores_gemma":[0.0020222908,0.0005453735,0.019015078,0.000119678305,0.0000034435807,0.000018985182,0.00001808665,0.1370861,0.001707414,0.832907,0.0060770083,0.0004795115],"about_ca_topic_score_codex":0.00015642447,"about_ca_topic_score_gemma":0.00013489668,"teacher_disagreement_score":0.1583573,"about_ca_system_score_codex":0.00009872166,"about_ca_system_score_gemma":0.00003081585,"threshold_uncertainty_score":0.7786637},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6564985,0.00004360134,0.0028755704,0.001572166,0.04846998,0.00036229176,0.0000042653783,0.0005914214,0.28958222],"genre_scores_gemma":[0.9918874,0.000005507267,0.00616723,0.00034907938,0.00047093985,0.000008421409,0.0000017197711,0.0000139096655,0.0010958143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883455,0.00006191883,0.00017532565,0.0003512956,0.00029106555,0.0002858709],"domain_scores_gemma":[0.99882346,0.00015580827,0.00007844229,0.0007595202,0.000052608968,0.00013015268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004729593,0.00014580938,0.0001475708,0.00009645652,0.00016193774,0.00016744713,0.0010977465,0.00007627026,0.00023579811],"category_scores_gemma":[0.0000678781,0.00013357113,0.00007278607,0.0003587345,0.000045941448,0.00029143578,0.00020293302,0.00041759294,0.00075132196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006342314,0.00008067572,0.00007751924,0.0000028995094,0.000004997935,0.000030017009,0.00008780939,0.0000016492348,0.00034106613,0.9781646,0.0054533505,0.015749045],"study_design_scores_gemma":[0.00073892315,0.00008926825,0.00048777158,0.000008163284,0.0000035535193,0.000018426766,0.0000041820767,0.0014410603,0.0034808468,0.95393676,0.039573967,0.00021708458],"about_ca_topic_score_codex":0.00000827168,"about_ca_topic_score_gemma":0.0000036467118,"teacher_disagreement_score":0.3353889,"about_ca_system_score_codex":0.00001759085,"about_ca_system_score_gemma":0.000044927056,"threshold_uncertainty_score":0.9656974},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99330705,0.00003971938,0.0040059118,0.00013892245,0.0011797968,0.00017522917,0.0000012001244,0.00006413089,0.0010880098],"genre_scores_gemma":[0.9970052,0.000010179432,0.0028583384,0.000054474283,0.0000036120655,0.00002049613,0.0000034243267,0.000007975764,0.000036248635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886554,0.00014417354,0.00018256207,0.00017646913,0.0003533077,0.00027793305],"domain_scores_gemma":[0.9989545,0.00023478665,0.00012618274,0.0004975275,0.000096961376,0.00009004054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006224116,0.0000960097,0.00013084106,0.00021761817,0.000063535335,0.000025112871,0.00046744526,0.000051046125,0.0000075652315],"category_scores_gemma":[0.00012468829,0.00009205712,0.000057714384,0.00050650944,0.000060303588,0.00082024885,0.00009643424,0.00012133607,0.000055950866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016312106,0.00014995379,0.0038465848,0.00000721572,0.000008432903,5.214347e-7,0.00044014593,0.000003051858,0.0036763928,0.9801677,0.00005548971,0.011628228],"study_design_scores_gemma":[0.00046645475,0.00019356576,0.046903726,0.000016305035,0.0000028965896,0.000002233551,0.000018502971,0.00044067702,0.0634947,0.88815457,0.00018070708,0.00012566091],"about_ca_topic_score_codex":0.00000354106,"about_ca_topic_score_gemma":1.17338516e-7,"teacher_disagreement_score":0.0920131,"about_ca_system_score_codex":0.000040293748,"about_ca_system_score_gemma":0.000014416745,"threshold_uncertainty_score":0.37539804},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6251565,0.00015944982,0.0023589872,0.0016625948,0.0054606637,0.0018047874,0.00002078396,0.001253672,0.36212257],"genre_scores_gemma":[0.9832037,0.0000047958038,0.014388705,0.00018208259,0.000026193678,0.000037764785,0.000003742244,0.00006779712,0.0020852196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984173,0.00007867912,0.00032052494,0.00030950573,0.0005249491,0.00034899678],"domain_scores_gemma":[0.9978729,0.0009699186,0.00014262566,0.00063636317,0.00017471558,0.0002034796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043084382,0.00025856902,0.00037704603,0.00005278038,0.00008108364,0.00003970527,0.00029408312,0.00010314107,0.00003529567],"category_scores_gemma":[0.0020745962,0.0002050484,0.000067546665,0.00027501982,0.00010846507,0.00012978964,0.00006868369,0.0002791196,0.0005943523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016013139,0.0003302935,0.000011820511,0.00006813268,0.000016518068,0.0000159149,0.0007424078,0.000009670246,0.000045301542,0.99164635,0.0065086093,0.00044487216],"study_design_scores_gemma":[0.001022463,0.00049889815,0.0000060357906,0.00015917743,0.000018112747,0.0000036231306,0.00009873165,0.000043726763,0.0023667726,0.9885319,0.007000196,0.00025035365],"about_ca_topic_score_codex":0.0000013774629,"about_ca_topic_score_gemma":0.0000016593648,"teacher_disagreement_score":0.36003733,"about_ca_system_score_codex":0.00017872192,"about_ca_system_score_gemma":0.00005654854,"threshold_uncertainty_score":0.8361631},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99274415,0.00009132782,0.00006118345,0.0037803873,0.0006958203,0.00011586644,5.379072e-7,0.000102124955,0.0024086235],"genre_scores_gemma":[0.9987187,0.000005891983,0.00039338344,0.0008484377,3.1522774e-7,0.0000037191487,3.4154584e-7,0.000002632504,0.000026582065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990287,0.000087268236,0.00020619718,0.00023473596,0.000263921,0.00017916587],"domain_scores_gemma":[0.9987206,0.00019489387,0.00008349605,0.0008524226,0.000090035304,0.000058570902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054654997,0.00009462162,0.00012559156,0.00006045334,0.00010548235,0.000037025875,0.00063660217,0.0000392773,0.000009292685],"category_scores_gemma":[0.00012393709,0.00006158714,0.000080807535,0.0005596025,0.000070910064,0.00010300815,0.000056724053,0.0001232861,0.00003355694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032809887,0.00014385825,0.00047207504,0.0000017246437,0.0000045541947,7.4391073e-7,0.00010183708,0.000015896745,0.00087869517,0.99476606,0.002503646,0.0011076352],"study_design_scores_gemma":[0.00021963927,0.00021113484,0.0065400274,0.000015532542,0.0000024580297,8.3091027e-7,0.0000031112486,0.000671416,0.0075611924,0.98459226,0.00011060845,0.00007181806],"about_ca_topic_score_codex":0.000011652234,"about_ca_topic_score_gemma":3.7403385e-7,"teacher_disagreement_score":0.010173822,"about_ca_system_score_codex":0.00000838394,"about_ca_system_score_gemma":0.000022929868,"threshold_uncertainty_score":0.25114506},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89875174,0.00039778213,0.095185995,0.00026199344,0.0002121852,0.00024601675,0.0000037659047,0.00011527868,0.0048252675],"genre_scores_gemma":[0.9792808,0.000020023488,0.020606808,0.000014477764,0.0000018566768,0.000019388544,0.0000021963372,0.000005171902,0.00004924957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993502,0.000023826738,0.00014331625,0.0001986075,0.00016361542,0.00012041656],"domain_scores_gemma":[0.99946207,0.000021505304,0.00007561772,0.0002948263,0.00008939156,0.000056586723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008598046,0.00008509406,0.00011629567,0.000042637585,0.00010400344,0.000015023135,0.00026106584,0.000033923003,0.000010565804],"category_scores_gemma":[0.0000043947634,0.00007119027,0.000017759474,0.00020407159,0.00009476263,0.00020839341,0.000070330425,0.00007048615,0.000004701659],"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.00000788979,0.00027560064,0.020779338,0.0000066728685,0.000018272613,0.0000018194801,0.00042189792,0.00000948971,0.00014096689,0.9749941,0.0003106318,0.0030332801],"study_design_scores_gemma":[0.0014411886,0.0006088966,0.6634919,0.00003838038,0.000031268628,0.000054472384,0.00016202114,0.01305656,0.0023953903,0.31486508,0.0034507224,0.00040412453],"about_ca_topic_score_codex":0.00010840299,"about_ca_topic_score_gemma":0.000027211976,"teacher_disagreement_score":0.6601291,"about_ca_system_score_codex":0.000009774147,"about_ca_system_score_gemma":0.000039079936,"threshold_uncertainty_score":0.2903055},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9849717,0.000048109312,0.0047196555,0.00040079188,0.00008824436,0.00021952839,0.000007877501,0.000012996631,0.0095311105],"genre_scores_gemma":[0.99794257,0.0000028250388,0.0008708571,0.00001806895,0.0000127249805,0.000022162074,0.00001157637,0.00001001923,0.0011091944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995304,0.000026057249,0.00013787956,0.00010901235,0.00007847096,0.00011818653],"domain_scores_gemma":[0.999527,0.00013017301,0.0000793433,0.0001959228,0.000022517475,0.00004506891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009399986,0.00008519145,0.00017778095,0.000017453844,0.000056338904,0.00002100197,0.00010692369,0.000016191705,0.00008803686],"category_scores_gemma":[0.000005168513,0.00005612808,0.000029345394,0.00013151996,0.000070601985,0.00006609306,0.0000347675,0.00006404681,0.000004424025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012680891,0.000030432971,0.001857772,0.0000058199007,0.000016719707,1.0500426e-7,0.0004055274,0.0000020829573,0.000054688495,0.9961186,0.0007503601,0.0007451996],"study_design_scores_gemma":[0.0011809466,0.000031068295,0.0005104949,0.000015270602,0.000015369777,4.2120092e-7,0.0005316695,0.0000760734,0.0010614591,0.9933749,0.0031198915,0.000082469625],"about_ca_topic_score_codex":0.0002482146,"about_ca_topic_score_gemma":0.0000106991565,"teacher_disagreement_score":0.012970886,"about_ca_system_score_codex":0.000006458796,"about_ca_system_score_gemma":0.000017945966,"threshold_uncertainty_score":0.22888367},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8968676,0.00013125106,0.0966525,0.00043997366,0.0029006153,0.00097146624,0.000016356322,0.00027755913,0.0017426964],"genre_scores_gemma":[0.99020815,0.0000022627012,0.0092623625,0.00014623102,0.000012366708,0.00014597729,0.000009282986,0.000019240884,0.00019411666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843466,0.00008028135,0.00017499473,0.00032044822,0.000318281,0.00067131926],"domain_scores_gemma":[0.99839073,0.00037640455,0.000057069086,0.0006512704,0.0001632117,0.00036132094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005310429,0.00016000675,0.00017435398,0.00022410057,0.0002103968,0.00008075532,0.00082694634,0.00006905638,0.000012378374],"category_scores_gemma":[0.00022496036,0.00015182878,0.000103114864,0.0004714368,0.000052931064,0.0008553986,0.00024088753,0.00013073128,0.00008825178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012666967,0.00009737449,0.010029447,0.000008186787,0.000013998474,8.9132095e-7,0.0005587951,0.0000028308239,0.00082814845,0.9848795,0.0016307666,0.0019373976],"study_design_scores_gemma":[0.0005408534,0.00021946468,0.011072764,0.000010210365,0.0000045480856,0.0000032463913,0.00007649167,0.0002078796,0.010720112,0.9723211,0.0046003,0.00022302796],"about_ca_topic_score_codex":0.0000069332755,"about_ca_topic_score_gemma":0.0000023811351,"teacher_disagreement_score":0.09334058,"about_ca_system_score_codex":0.0000705382,"about_ca_system_score_gemma":0.0000317594,"threshold_uncertainty_score":0.6191398},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9909459,0.00024026833,0.004082958,0.00014211626,0.0003541838,0.0001871354,0.0000011237823,0.000082048704,0.0039643026],"genre_scores_gemma":[0.98387164,0.000008616537,0.015941521,0.000029859977,0.0000056071635,0.000026533884,5.878246e-7,0.00001669044,0.000098914104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829644,0.00015567442,0.00023175094,0.00027682382,0.00045208604,0.00058719574],"domain_scores_gemma":[0.99846965,0.00023785535,0.000103408165,0.0009582122,0.00009054402,0.00014033233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061175396,0.00015842852,0.00025785982,0.00021692547,0.00007600894,0.00004772883,0.0011962904,0.00006205947,0.00001171885],"category_scores_gemma":[0.00011164581,0.00013751292,0.000056220262,0.0012668675,0.00022021736,0.0009826786,0.00040649532,0.0002507084,0.00001872261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003439597,0.00016845381,0.18548548,0.000011494178,0.0000160165,0.000009189137,0.00105537,0.0000075021917,0.0002826012,0.8122104,0.00007771116,0.00064142485],"study_design_scores_gemma":[0.0014069098,0.00011495546,0.052242238,0.000060783615,0.0000034480252,0.000021623177,0.00012156856,0.00016367943,0.0032753525,0.94224566,0.0001544757,0.00018928519],"about_ca_topic_score_codex":0.000051488627,"about_ca_topic_score_gemma":0.000031049894,"teacher_disagreement_score":0.13324325,"about_ca_system_score_codex":0.000044869095,"about_ca_system_score_gemma":0.000058862715,"threshold_uncertainty_score":0.56076145},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9924453,0.00003604765,0.00008279274,0.00026114198,0.00031349887,0.00015458882,0.0000031712339,0.000052974105,0.006650479],"genre_scores_gemma":[0.99923384,0.0000058334176,0.00042781373,0.000016657013,0.0000042608867,0.000026456646,0.0000018467816,0.000012599609,0.00027066408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992044,0.00012361651,0.00022368915,0.00012790607,0.00015096209,0.00016942635],"domain_scores_gemma":[0.9984817,0.0006951432,0.000120838085,0.00059057854,0.000063003405,0.00004873408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000642211,0.00009396893,0.00014745498,0.000028914827,0.00023969909,0.000018133916,0.00029799822,0.00005858727,0.0000139413005],"category_scores_gemma":[0.0001948915,0.000069467394,0.00010447781,0.00021671873,0.00019617175,0.00004091688,0.000067150606,0.0001256939,0.00001516271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005956731,0.00010897118,0.0004100407,0.000010099395,0.000020889922,1.2780266e-7,0.000066900546,1.7818917e-7,0.00042165126,0.99666625,0.0007513656,0.0015375479],"study_design_scores_gemma":[0.00030021157,0.000040242117,0.0031457331,0.000008144196,0.000023732226,0.0000031468933,0.00004291128,0.00008482561,0.0023687668,0.99213916,0.0017643084,0.00007880307],"about_ca_topic_score_codex":0.000006857985,"about_ca_topic_score_gemma":0.0000036767663,"teacher_disagreement_score":0.006788562,"about_ca_system_score_codex":0.0000075526973,"about_ca_system_score_gemma":0.000011406896,"threshold_uncertainty_score":0.2832798},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9664344,0.0000329501,0.026532378,0.0013622205,0.00055317685,0.00024290675,9.0446537e-7,0.0001473113,0.004693751],"genre_scores_gemma":[0.9942642,0.0000040974264,0.0053092847,0.00029804904,0.0000031116074,0.000039047034,0.0000026872194,0.0000056243525,0.00007389191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929404,0.000027758415,0.00017205233,0.00020523739,0.00015103603,0.0001498552],"domain_scores_gemma":[0.9990294,0.00016395007,0.00010051394,0.00053217774,0.00011984782,0.000054135307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006417813,0.00008245522,0.00010269626,0.000060793387,0.00007267546,0.00004477516,0.0004894306,0.000039324063,0.000046247478],"category_scores_gemma":[0.00007436343,0.00007507373,0.000034309618,0.00034432302,0.000031035386,0.0005699179,0.00008920521,0.000077187055,0.00020812209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.156901e-7,0.00006655482,0.00018405545,0.0000034122545,0.000004284227,2.4857732e-7,0.00007809649,0.000027789129,0.0019036086,0.99298567,0.0008711445,0.0038746533],"study_design_scores_gemma":[0.00020005983,0.00008979569,0.015089886,0.0000068028917,0.0000018736972,0.000001261065,0.000009798457,0.001642295,0.0056596454,0.97702783,0.00018573247,0.00008502027],"about_ca_topic_score_codex":0.000015765167,"about_ca_topic_score_gemma":3.0418823e-7,"teacher_disagreement_score":0.027829805,"about_ca_system_score_codex":0.000021269008,"about_ca_system_score_gemma":0.000021215426,"threshold_uncertainty_score":0.30614176},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99618244,0.00069799315,0.000011165427,0.0000145450795,0.0004073429,0.0001425315,0.0000060917755,0.00001870033,0.0025191854],"genre_scores_gemma":[0.9990468,0.00013387106,0.0006046466,0.00007263423,0.000014096276,0.0000072668063,0.000018041372,0.000015038611,0.00008763037],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894226,0.00006835263,0.0002624754,0.00036194565,0.00008846087,0.00027649963],"domain_scores_gemma":[0.9994088,0.00002163102,0.00012648356,0.00028303076,0.00006173285,0.00009831167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016944762,0.00017575976,0.00022354048,0.000036824862,0.00006196529,0.000009422727,0.00022241176,0.00019978947,0.000019642317],"category_scores_gemma":[0.000053331652,0.00015263222,0.00011083906,0.00012704878,0.00015928329,0.0000045294523,0.00018082588,0.00010420264,0.000006108087],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047909186,0.00040167943,0.056219175,0.000050028037,0.0001780845,0.000016325908,0.00033330047,9.734487e-7,0.9190604,0.018494533,0.00064398197,0.004122435],"study_design_scores_gemma":[0.0039634965,0.0033570873,0.16982011,0.00004814178,0.00008049274,0.000022641387,0.0003012026,0.00007610548,0.71414864,0.10548561,0.0019183923,0.00077808293],"about_ca_topic_score_codex":0.00007177388,"about_ca_topic_score_gemma":0.0000063204725,"teacher_disagreement_score":0.20491175,"about_ca_system_score_codex":0.00000694889,"about_ca_system_score_gemma":0.000037662314,"threshold_uncertainty_score":0.6224161},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97467804,0.000086350025,0.012064417,0.0009484804,0.0019144136,0.0005398331,8.145599e-7,0.0004594915,0.009308133],"genre_scores_gemma":[0.9965262,0.0000054121892,0.0027945535,0.00028043787,0.0000068451604,0.00007716605,0.0000011906942,0.000016836344,0.00029135507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982741,0.00014542922,0.00019396597,0.00043884153,0.0004535776,0.00049412425],"domain_scores_gemma":[0.9985401,0.00020004841,0.000069192065,0.00085730833,0.00015987335,0.0001734893],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030821963,0.00015732148,0.00015165503,0.00018957349,0.00014517226,0.00020994476,0.0012154673,0.000060312246,0.00006914846],"category_scores_gemma":[0.00011462728,0.00014812591,0.00007725513,0.00074668886,0.00010430333,0.000654524,0.00034048365,0.00029322575,0.0010734317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033046024,0.000064797,0.00033379218,0.0000053830317,0.000010969455,0.00001024378,0.00016608073,0.000026738995,0.0016669108,0.9873606,0.00074582937,0.009605366],"study_design_scores_gemma":[0.00043244095,0.00017020597,0.001134233,0.000019216046,0.0000012688822,0.0000065230456,0.000017525632,0.0043813013,0.0050632744,0.9882183,0.00037998136,0.0001757488],"about_ca_topic_score_codex":0.0000399556,"about_ca_topic_score_gemma":9.092101e-7,"teacher_disagreement_score":0.021848137,"about_ca_system_score_codex":0.00005540682,"about_ca_system_score_gemma":0.000047908663,"threshold_uncertainty_score":0.99970436},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9833133,0.000053248885,0.00035723022,0.000021409376,0.00034906773,0.00026844494,0.0000057909133,0.000080069745,0.015551422],"genre_scores_gemma":[0.99679303,0.000010349027,0.002645222,0.000029270941,0.000005596854,0.00005928155,0.0000032911182,0.000025741492,0.00042819488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905694,0.00007907044,0.00030604532,0.00019036134,0.00016055904,0.00020705651],"domain_scores_gemma":[0.99907357,0.00011175657,0.00015552077,0.00048087141,0.00010422816,0.00007405646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031132274,0.00014387195,0.00024174874,0.00010417426,0.00009602575,0.0000075355388,0.00026879745,0.000101669255,0.00032562533],"category_scores_gemma":[0.00006359121,0.00013169055,0.0001165166,0.00037843443,0.00013577071,0.000077255136,0.000052987114,0.00013758667,0.000026651718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039083017,0.00033327378,0.0074630463,0.00002606035,0.00004781961,0.0000016794755,0.0006536215,1.8188405e-7,0.00087624724,0.989345,0.00094316824,0.00027082168],"study_design_scores_gemma":[0.00088402466,0.000051524392,0.004952658,0.000015829724,0.00004340359,0.000004164458,0.0000667515,0.000026951822,0.006541946,0.9870161,0.00025613906,0.00014051927],"about_ca_topic_score_codex":0.000027440694,"about_ca_topic_score_gemma":0.0000041173844,"teacher_disagreement_score":0.015123227,"about_ca_system_score_codex":0.000008169205,"about_ca_system_score_gemma":0.000024274268,"threshold_uncertainty_score":0.5370185},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9951587,0.000977365,0.000072497765,0.0002896139,0.0020507497,0.000083206985,0.000001430743,0.00008614705,0.0012803024],"genre_scores_gemma":[0.9979898,0.000018019751,0.0016033145,0.00020625969,0.0000022268575,0.000004545711,0.0000014620629,0.000009684713,0.00016468736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989168,0.00004768478,0.0002204466,0.00024552693,0.0002517777,0.00031773958],"domain_scores_gemma":[0.99914855,0.00010932536,0.00006877002,0.00041909295,0.000096807584,0.00015748231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040269864,0.00013654922,0.00018126231,0.0001092559,0.00008773405,0.000046715144,0.00026819276,0.00006554777,0.0000147074525],"category_scores_gemma":[0.0000600604,0.000120197474,0.00005132268,0.00027430357,0.000086088316,0.00036698487,0.00020065029,0.00013174786,0.000057231136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040806976,0.00018772852,0.004916672,0.000013712777,0.000012195381,0.000001467116,0.00041562718,0.0000030910169,0.0032232432,0.98840237,0.0019393171,0.0008805126],"study_design_scores_gemma":[0.0013188424,0.0002826643,0.008033241,0.000060201004,0.000016699576,0.000027995287,0.000017084427,0.0010710612,0.0158656,0.972495,0.0005139675,0.00029763737],"about_ca_topic_score_codex":0.000030242758,"about_ca_topic_score_gemma":1.917451e-7,"teacher_disagreement_score":0.015907347,"about_ca_system_score_codex":0.000013147621,"about_ca_system_score_gemma":0.000019706282,"threshold_uncertainty_score":0.49015108},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5964042,0.0026980008,0.35795018,0.008000172,0.020160006,0.0017209249,0.000010014386,0.0011300405,0.011926468],"genre_scores_gemma":[0.99504554,0.0000062938884,0.003340848,0.0012476147,0.000060600833,0.000050100076,0.000004097791,0.000015954198,0.00022897491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987753,0.000044193985,0.00018068858,0.0002543607,0.00019843342,0.0005470056],"domain_scores_gemma":[0.99879473,0.00026408653,0.00008014038,0.00066311064,0.00005864003,0.00013931053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003311289,0.00015809858,0.00014729516,0.00003473933,0.00021825396,0.000100110236,0.00096854987,0.000060644146,0.000008688252],"category_scores_gemma":[0.000080981765,0.000111236695,0.00009253549,0.00022024913,0.00006333475,0.0006154778,0.00022142251,0.00012575871,0.00008453464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029528928,0.00016177354,0.00047814744,0.0000034645038,0.000013429418,0.0000012926705,0.0005347922,0.0000099462295,0.0005967276,0.98992246,0.002180625,0.006094405],"study_design_scores_gemma":[0.00065667793,0.0002581489,0.0033288228,0.000010264345,0.000018628392,0.000018019904,0.00008122037,0.002245063,0.004680877,0.89582115,0.092528075,0.00035302408],"about_ca_topic_score_codex":0.000006105364,"about_ca_topic_score_gemma":0.0000019234794,"teacher_disagreement_score":0.39864135,"about_ca_system_score_codex":0.00004811651,"about_ca_system_score_gemma":0.000020694473,"threshold_uncertainty_score":0.4536101},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928366,0.00011441699,0.000067072644,0.00002917895,0.00022156075,0.00021053352,0.000023538889,0.000030184374,0.006466904],"genre_scores_gemma":[0.9994854,0.000007910366,0.0004212344,0.000011379862,0.0000037965656,0.00002154157,0.0000048978372,0.000016735752,0.000027111242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991694,0.00009455112,0.00026483522,0.00011358668,0.00017289356,0.00018473704],"domain_scores_gemma":[0.99877775,0.0005777512,0.00018135861,0.00033022577,0.000069123205,0.00006376859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004255259,0.00011361642,0.00024469328,0.00008010705,0.00005119583,0.0000028541067,0.00015072299,0.00007164071,0.00004676403],"category_scores_gemma":[0.00008575122,0.000106207954,0.000115185234,0.0002533378,0.00010157348,0.000094835974,0.000015476608,0.00011003887,0.000005535452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002648154,0.00047300642,0.0012061937,0.00006589949,0.000062660154,2.5700862e-7,0.0018853439,6.865287e-7,0.0047524087,0.9912601,0.00017531142,0.00009165046],"study_design_scores_gemma":[0.00035714376,0.000093864015,0.0013317325,0.000059280635,0.00007565247,0.0000010053096,0.00051415386,0.0000058791397,0.052285336,0.9451545,0.000028455677,0.00009300209],"about_ca_topic_score_codex":0.000009028747,"about_ca_topic_score_gemma":0.0000015139087,"teacher_disagreement_score":0.047532927,"about_ca_system_score_codex":0.000011155072,"about_ca_system_score_gemma":0.00000967806,"threshold_uncertainty_score":0.43310347},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99689776,0.00027518946,0.000004322919,0.00015050574,0.00019999458,0.00013584521,6.8847e-7,0.000014389007,0.0023213017],"genre_scores_gemma":[0.9991726,0.00004972589,0.00029317042,0.00030774035,0.000009386971,0.000013368061,0.000013206286,0.0000078586145,0.0001329274],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993027,0.00004056115,0.00013823027,0.00025531152,0.000054671964,0.00020856585],"domain_scores_gemma":[0.9997153,0.000020145679,0.000035773133,0.0001328961,0.000028200904,0.00006767546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011163899,0.00010890475,0.000110066365,0.000026378311,0.000043806394,0.000029290795,0.000114713956,0.00011683316,0.000016171225],"category_scores_gemma":[0.000058710535,0.00009117758,0.00003579265,0.00007736671,0.000051203242,0.0000046326854,0.00012688049,0.00009178546,0.000018573968],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033015534,0.00018396798,0.4954502,0.000024630966,0.000035711702,0.000008690285,0.0001583177,0.0000048645334,0.46735692,0.018535621,0.0042519877,0.013956071],"study_design_scores_gemma":[0.0034786689,0.0007299639,0.74554706,0.000060578528,0.0000125799415,0.000032758107,0.0003729609,0.00037682883,0.04882435,0.18348102,0.01612069,0.00096251525],"about_ca_topic_score_codex":0.00027120556,"about_ca_topic_score_gemma":0.00002318875,"teacher_disagreement_score":0.41853255,"about_ca_system_score_codex":0.000005237193,"about_ca_system_score_gemma":0.000008661156,"threshold_uncertainty_score":0.3718114},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98852164,0.00020728138,0.0034875243,0.00025028738,0.0012042606,0.0000994436,0.0000015772049,0.00047923814,0.0057487627],"genre_scores_gemma":[0.9963145,0.000034951543,0.003272898,0.00030332495,0.00001592426,0.00000849316,0.0000012578263,0.000009606894,0.00003903178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885356,0.00016270565,0.00015317129,0.00035724705,0.00020160875,0.00027171732],"domain_scores_gemma":[0.99896175,0.00030955,0.000062590676,0.00050327275,0.000039179653,0.00012367828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053428067,0.0001550574,0.00018652948,0.000093960785,0.00020764583,0.0001985874,0.00045880178,0.000069237074,0.000009680305],"category_scores_gemma":[0.000044016528,0.00014745112,0.000060359656,0.00030782775,0.000083589824,0.0003082185,0.000272023,0.00013292945,0.000029613937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047694143,0.00006940294,0.0044286437,0.000011295275,0.00002255793,0.0000032694072,0.00040152215,6.918055e-7,0.00029341673,0.99019617,0.0007101614,0.0038581174],"study_design_scores_gemma":[0.0006670044,0.00017677275,0.010544471,0.000016863129,0.000013837803,0.000013724624,0.0000125196175,0.0038252675,0.0011719239,0.9663149,0.01699514,0.0002475754],"about_ca_topic_score_codex":0.000009932538,"about_ca_topic_score_gemma":0.0000033504712,"teacher_disagreement_score":0.023881253,"about_ca_system_score_codex":0.000012659855,"about_ca_system_score_gemma":0.00001622755,"threshold_uncertainty_score":0.60128826},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9818813,0.0001035277,0.000023697945,0.0009230976,0.00034438504,0.00034188852,0.0000028218587,0.00009284036,0.016286392],"genre_scores_gemma":[0.99745077,0.000012747704,0.0010570638,0.0001497152,0.000017108101,0.00003258897,0.000024478999,0.00003515629,0.0012203894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834585,0.000094206735,0.00042308625,0.0003126755,0.0003805194,0.00044368094],"domain_scores_gemma":[0.99880064,0.00022595716,0.0001451746,0.000539726,0.00014104854,0.00014746311],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004064227,0.00023295678,0.00046168469,0.0003273358,0.00008046222,0.000108263375,0.00035251776,0.00015197357,0.0015960232],"category_scores_gemma":[0.0002893424,0.00020372785,0.00016511012,0.0013424408,0.000043272765,0.00023460436,0.00009147057,0.0002587398,0.0004902632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039449124,0.00031564184,0.040942345,0.000040035084,0.000064068336,0.00001914161,0.0003673639,0.00000228612,0.00024965312,0.88416266,0.07292587,0.0009069817],"study_design_scores_gemma":[0.0009209429,0.00005783694,0.1322143,0.000025059797,0.000044739652,0.000004753148,0.00048649122,0.0004998,0.00006901418,0.8582017,0.0071634776,0.00031189856],"about_ca_topic_score_codex":0.0007424224,"about_ca_topic_score_gemma":0.00029289804,"teacher_disagreement_score":0.091271944,"about_ca_system_score_codex":0.00007337681,"about_ca_system_score_gemma":0.000021402053,"threshold_uncertainty_score":0.99931663},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925215,0.00003513318,0.0007963912,0.00004061438,0.00014243748,0.00015825851,0.000006769169,0.000015879577,0.006282985],"genre_scores_gemma":[0.99917537,0.000004528329,0.00042882253,0.000012872625,0.000007285695,0.00003748777,0.0000047215553,0.000008215721,0.00032071568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955434,0.000009731745,0.0001476038,0.00010249257,0.00006801942,0.00011780783],"domain_scores_gemma":[0.9996157,0.000083932406,0.000070557224,0.00013018305,0.000050055514,0.000049549235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003762491,0.00007332844,0.00012605023,0.000019022053,0.000079349375,0.000030447996,0.000083478095,0.000015580836,0.000304477],"category_scores_gemma":[0.00000911379,0.000068563546,0.000033127457,0.00008306019,0.000109194174,0.00014097824,0.00007071996,0.00005213686,0.000041084393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.724448e-7,0.00005133144,0.002654098,0.000012886991,0.000014806738,3.708445e-8,0.00014549987,0.0000026208731,0.00085374346,0.99510205,0.00059951557,0.00056252215],"study_design_scores_gemma":[0.0002800694,0.000013405426,0.0003956752,0.000014333135,0.000010793512,1.4394386e-7,0.00087805645,0.00015424794,0.0039269887,0.9939249,0.00032435026,0.000076993245],"about_ca_topic_score_codex":0.00012501192,"about_ca_topic_score_gemma":2.574714e-7,"teacher_disagreement_score":0.006653819,"about_ca_system_score_codex":0.000007302941,"about_ca_system_score_gemma":0.000011213294,"threshold_uncertainty_score":0.33338097},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87603766,0.00007351233,0.095325194,0.00025123623,0.0068294667,0.00014809992,5.233798e-7,0.00017656431,0.021157755],"genre_scores_gemma":[0.9989842,0.0000022744944,0.0007146501,0.0000838706,0.000020330799,0.0000083818595,3.945385e-7,0.000007332124,0.00017856841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989562,0.00015638201,0.0002467992,0.00025565553,0.0001921237,0.00019285243],"domain_scores_gemma":[0.9989164,0.00022386361,0.00011123087,0.0005618806,0.00012231841,0.00006429119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006149853,0.00010311038,0.00022431962,0.00006559287,0.000073067524,0.000048487807,0.000528158,0.00007137517,0.0000141151195],"category_scores_gemma":[0.000090432695,0.00009544602,0.00008902763,0.00025244866,0.00002806835,0.0002706253,0.00010827544,0.00009936167,0.000037873993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022239103,0.00006008805,0.0009959999,0.000009657918,0.0000111822965,0.0000010275143,0.00017097518,0.000032069973,0.0011087109,0.9906231,0.0014229901,0.005561948],"study_design_scores_gemma":[0.0012938182,0.00044962586,0.0076132366,0.00007515691,0.0000102982885,0.0000384324,0.000040593342,0.13686426,0.012829078,0.82706743,0.01330899,0.00040907855],"about_ca_topic_score_codex":0.000066061,"about_ca_topic_score_gemma":0.000008003738,"teacher_disagreement_score":0.1635557,"about_ca_system_score_codex":0.000024857636,"about_ca_system_score_gemma":0.000020418314,"threshold_uncertainty_score":0.38921756},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9816064,0.00087709574,0.002077392,0.0014081945,0.0017859216,0.00046971967,7.6815724e-7,0.00022976863,0.011544741],"genre_scores_gemma":[0.99467206,0.000052461968,0.0044677365,0.00021450431,0.0000031521754,0.000052425217,0.0000010939968,0.0000135493,0.0005229897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982193,0.0001438783,0.00023954819,0.00044870313,0.00039647144,0.00055210403],"domain_scores_gemma":[0.9987318,0.00018527312,0.00005871634,0.00075849367,0.000117007316,0.00014873478],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003987573,0.00015794656,0.00019000306,0.0002582594,0.000106100466,0.00020536318,0.0013688261,0.00006900842,0.00009981841],"category_scores_gemma":[0.00008659304,0.00015183934,0.00006258611,0.001208129,0.00017424743,0.0013511283,0.00035909034,0.00031523526,0.00083064195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033306756,0.000080396145,0.009823875,0.0000066150797,0.0000060231782,0.000020353022,0.00020800877,0.000006637431,0.0004264147,0.9811879,0.0014062295,0.006824232],"study_design_scores_gemma":[0.0004602689,0.00008536938,0.027341608,0.000018561499,5.3748323e-7,0.000004782326,0.00003427437,0.00089241384,0.0007155214,0.96752495,0.0027399992,0.00018174351],"about_ca_topic_score_codex":0.00007178678,"about_ca_topic_score_gemma":0.000009139624,"teacher_disagreement_score":0.017517734,"about_ca_system_score_codex":0.000059608188,"about_ca_system_score_gemma":0.00007794141,"threshold_uncertainty_score":0.9999473},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99239933,0.00012153295,0.0012835761,0.0009079247,0.0017095152,0.00030965894,9.190601e-7,0.00075406197,0.0025134664],"genre_scores_gemma":[0.9938619,0.000009969773,0.0050770785,0.00094201387,0.0000021353417,0.000014795521,0.000004655379,0.000011993039,0.00007542409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983261,0.00010589472,0.00024982548,0.0005675767,0.00037853853,0.00037202128],"domain_scores_gemma":[0.9984997,0.000041564785,0.00006086336,0.0010690112,0.00012174366,0.00020713467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039297153,0.00021721363,0.00019774401,0.00023964091,0.00018764664,0.00014327992,0.00070155744,0.00013244076,0.00001060987],"category_scores_gemma":[0.000024173367,0.00019340706,0.00009268614,0.0006398336,0.00004528967,0.00048321713,0.0000665485,0.0002537116,0.000106170024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071045156,0.00037101758,0.00014007595,0.000002295734,0.000003478749,0.000019861141,0.00014379465,0.000031059473,0.030384617,0.9620199,0.0019007962,0.0049759755],"study_design_scores_gemma":[0.00049570325,0.001076455,0.0021425097,0.000039643717,0.000003914734,0.000025048359,0.000007854883,0.0014387332,0.03177006,0.9625714,0.0001530935,0.00027562457],"about_ca_topic_score_codex":0.000017197926,"about_ca_topic_score_gemma":3.7183625e-7,"teacher_disagreement_score":0.004700351,"about_ca_system_score_codex":0.000026169353,"about_ca_system_score_gemma":0.000045200853,"threshold_uncertainty_score":0.7886911},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99131495,0.0002813567,0.00003070587,0.00036441587,0.004828265,0.0002200193,0.000008068488,0.0001995322,0.0027527157],"genre_scores_gemma":[0.9938509,0.000016168366,0.0058371034,0.000105085004,0.0000034936252,0.000030303507,0.000005475472,0.000016645927,0.00013486721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830484,0.000056788682,0.0003745933,0.0004892449,0.00040683648,0.00036768575],"domain_scores_gemma":[0.99837905,0.00007426441,0.00016853228,0.00089309015,0.00032041976,0.00016466924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042445224,0.00019711984,0.00026678655,0.00024144555,0.00014806984,0.000057326484,0.00093280734,0.00013696044,0.000029737219],"category_scores_gemma":[0.00010291796,0.00017012174,0.00014649442,0.00077622326,0.00024190277,0.00043919086,0.00026228675,0.00034694467,0.00003482714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001410397,0.00022051074,0.0006025359,0.000018691799,0.00003886406,0.0000148179215,0.00048780025,0.0000020495097,0.034285,0.95192194,0.010495958,0.0018977512],"study_design_scores_gemma":[0.00072648906,0.0002639438,0.0011328228,0.000049579474,0.000013108544,0.000026664255,0.000053204247,0.00048991555,0.08018428,0.91630137,0.000511974,0.00024665176],"about_ca_topic_score_codex":0.00014164134,"about_ca_topic_score_gemma":0.000010855988,"teacher_disagreement_score":0.04589928,"about_ca_system_score_codex":0.000007578195,"about_ca_system_score_gemma":0.00012731321,"threshold_uncertainty_score":0.6937363},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98409414,0.000037961014,0.003706219,0.00267985,0.0011747248,0.0001416961,2.352839e-7,0.00018813484,0.007977021],"genre_scores_gemma":[0.9973335,0.0000021723995,0.00089215883,0.0014835119,0.0000022271945,0.000013077927,7.196947e-7,0.000010473784,0.00026212345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884325,0.00012403466,0.0001344811,0.0003011745,0.00034029759,0.00025673653],"domain_scores_gemma":[0.9988282,0.00019768569,0.0000674868,0.000761388,0.00006042894,0.000084836596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047973366,0.00013817257,0.00013309503,0.00006870237,0.00021742184,0.00012495327,0.0006792382,0.000048462145,0.000010090225],"category_scores_gemma":[0.00004313697,0.00007816185,0.00004433863,0.00035480937,0.0000697114,0.000102978716,0.0000998936,0.00017428244,0.00010534073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012259042,0.000048925114,0.00069503573,0.0000016978271,0.000010936909,0.0000029454673,0.000106991756,0.00008784927,0.00007879719,0.9930934,0.003779901,0.0020813164],"study_design_scores_gemma":[0.0012244454,0.00028827554,0.0011640731,0.000019274363,0.0000043380323,0.00000607144,0.0000040154523,0.013453349,0.00061853905,0.98214096,0.00094004965,0.00013662124],"about_ca_topic_score_codex":0.000028031387,"about_ca_topic_score_gemma":0.0000044708845,"teacher_disagreement_score":0.013365499,"about_ca_system_score_codex":0.000012579632,"about_ca_system_score_gemma":0.000028795152,"threshold_uncertainty_score":0.31873477},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98983276,0.0013394753,0.00017540024,0.000056174304,0.0033038238,0.00061073434,0.000009068813,0.00015661129,0.0045159683],"genre_scores_gemma":[0.9995304,0.000017398168,0.000024733192,0.000028859788,0.000024743724,0.00007606079,0.0000036531671,0.000026823267,0.00026734418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907583,0.000044636847,0.00033502263,0.0001256631,0.00015016789,0.0002686663],"domain_scores_gemma":[0.999224,0.0002002736,0.00005967695,0.00041355085,0.000052776602,0.000049717146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032687394,0.00016363319,0.00027088524,0.000039283786,0.00010258985,0.000044154865,0.0002580085,0.00009319538,0.000038275015],"category_scores_gemma":[0.000024802348,0.00012317719,0.00013662431,0.00016522834,0.000045947196,0.00010137499,0.000010390326,0.000100254365,0.000074003874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015032636,0.00005341296,0.0014367081,0.00025759544,0.0001300283,0.0000013769368,0.00050937984,0.000710397,0.0029986517,0.9871524,0.0064899023,0.0002451445],"study_design_scores_gemma":[0.003240756,0.0003115437,0.015933765,0.00054795743,0.000271326,0.000111484136,0.0012417714,0.03285629,0.008964751,0.91134286,0.02425981,0.00091770623],"about_ca_topic_score_codex":0.0000098891705,"about_ca_topic_score_gemma":6.2485896e-7,"teacher_disagreement_score":0.07580953,"about_ca_system_score_codex":0.00003577364,"about_ca_system_score_gemma":0.000011834985,"threshold_uncertainty_score":0.50230205},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9721487,0.0003407287,0.00017320586,0.000005182557,0.0006597602,0.0002077416,0.000002795478,0.00011827457,0.026343573],"genre_scores_gemma":[0.9997886,0.0000119453525,0.000084994164,0.000004313496,0.0000019984466,0.000022342716,3.6243136e-7,0.000021461723,0.00006400899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934965,0.00005628836,0.00016561575,0.00010390248,0.0001270633,0.00019749586],"domain_scores_gemma":[0.99947,0.00008166621,0.000040424195,0.00029485582,0.00006242197,0.000050617793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022751468,0.00012137803,0.00014597368,0.000027428743,0.00008167041,0.000010167624,0.00021909195,0.00004790632,0.000010105204],"category_scores_gemma":[0.000008704799,0.00008204581,0.000045717,0.0001807716,0.00012158872,0.00006775833,0.000010255144,0.0001068508,0.000014368066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008941667,0.000056888082,0.0012463194,0.000033877757,0.00015776872,0.000017238248,0.0064336155,0.000021524225,0.007264817,0.9844039,0.000105708925,0.0001689073],"study_design_scores_gemma":[0.0024286674,0.0015224869,0.022425942,0.00042720442,0.00014261174,0.00010638683,0.0049917623,0.00051827694,0.42015973,0.5450384,0.0012874963,0.0009510177],"about_ca_topic_score_codex":0.000013723991,"about_ca_topic_score_gemma":0.0000048589177,"teacher_disagreement_score":0.4393655,"about_ca_system_score_codex":0.000013367842,"about_ca_system_score_gemma":0.000015513082,"threshold_uncertainty_score":0.33457312},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990192,0.0010272119,0.00001015543,0.000023962572,0.0024754861,0.00013765592,0.0000027374197,0.00007640173,0.0060543804],"genre_scores_gemma":[0.99973917,0.000005106502,0.000024237639,0.000010714934,0.000010326815,0.0000068430472,7.686383e-7,0.000017700568,0.00018512225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993702,0.000060957762,0.00018201197,0.0000950432,0.0001492367,0.00014254861],"domain_scores_gemma":[0.9995418,0.00003473091,0.00003663484,0.0002703619,0.000038633923,0.00007783766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029641818,0.00010663251,0.0001708112,0.000022754835,0.00003749753,0.000014244181,0.00018083127,0.00006931402,0.000014339031],"category_scores_gemma":[0.00003732327,0.00007718978,0.000056722194,0.0001776724,0.000068132824,0.000078238256,0.000038730926,0.00009827164,0.00000889309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000249035,0.000041713138,0.013534895,0.00009767688,0.00008535626,0.000006119852,0.0011270738,0.00015571203,0.0026821129,0.97717696,0.0044859913,0.0005815109],"study_design_scores_gemma":[0.0028067003,0.00010262909,0.0059489175,0.000091645015,0.000057366662,0.000020508518,0.00047558086,0.0016741379,0.029875012,0.94232696,0.01629326,0.00032726108],"about_ca_topic_score_codex":0.000016736478,"about_ca_topic_score_gemma":0.000004243414,"teacher_disagreement_score":0.034849953,"about_ca_system_score_codex":0.000018077053,"about_ca_system_score_gemma":0.000013935709,"threshold_uncertainty_score":0.3147708},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9970233,0.000029433237,1.7447852e-7,0.0013723379,0.00032040032,0.000077349716,0.0000035871826,0.000008490429,0.0011649627],"genre_scores_gemma":[0.9996343,0.000022065782,0.00001886741,0.0000130855115,0.000007991578,0.0000032205182,0.000004152742,3.259226e-7,0.0002959422],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9994624,0.000034524222,0.00014720809,0.00007560187,0.00018231272,0.00009792164],"domain_scores_gemma":[0.99942833,0.00023538552,0.00008664645,0.000053350683,0.0001663542,0.000029935782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003599872,0.000039257746,0.000071956114,0.0000059455697,0.00011379048,0.000012110443,0.0002003838,0.000053646225,0.00010885767],"category_scores_gemma":[0.00018074627,0.000011444504,0.00003940154,0.00027246954,0.00008076826,0.000035942794,0.000030961266,0.00010200768,0.0000053061613],"study_design_candidate":"observational","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.0000090973945,0.00005629844,0.0034726874,0.0000020093485,0.0000075125613,1.0207085e-7,0.00006427971,1.9100624e-7,0.72309667,0.24478614,0.0003586559,0.02814634],"study_design_scores_gemma":[0.00024848102,0.00013888159,0.8933373,0.000007921247,0.0000053993645,4.3259678e-7,0.00009765927,0.00012602325,0.03633711,0.0567797,0.01285279,0.000068290734],"about_ca_topic_score_codex":0.00045059988,"about_ca_topic_score_gemma":0.0005543139,"teacher_disagreement_score":0.8898646,"about_ca_system_score_codex":0.0000032529456,"about_ca_system_score_gemma":0.000009326789,"threshold_uncertainty_score":0.11919151},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98554873,0.00020398787,0.0032807975,0.00031195185,0.0011206164,0.0002150735,0.0000027067645,0.00017281764,0.009143341],"genre_scores_gemma":[0.996463,0.000006439193,0.0032315608,0.000035805217,0.0000024744077,0.00001562799,0.0000013504334,0.000011129925,0.00023260135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985195,0.000099091245,0.00021609008,0.00030429786,0.0005130988,0.0003479428],"domain_scores_gemma":[0.9986495,0.00015228611,0.000093460585,0.0006856818,0.00018287609,0.00023623758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005249522,0.00012408786,0.00020753586,0.00018628853,0.000058087437,0.000037942405,0.001071373,0.000059290574,0.0000042310594],"category_scores_gemma":[0.00015774097,0.00012161339,0.00006785364,0.00082439143,0.00014165758,0.0004934885,0.00029576715,0.00017778121,0.00005891023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002205758,0.000077952325,0.0024286627,0.000006647094,0.000015209947,0.000017414706,0.00028969787,0.00001735275,0.0008852486,0.99488306,0.0007343496,0.00062233565],"study_design_scores_gemma":[0.0008201825,0.00029490786,0.001623742,0.000010605286,0.0000024608912,0.000015287584,0.00005010084,0.00028806453,0.006025945,0.9897659,0.0009668488,0.00013596486],"about_ca_topic_score_codex":0.000023082892,"about_ca_topic_score_gemma":9.711697e-7,"teacher_disagreement_score":0.010914303,"about_ca_system_score_codex":0.00004664403,"about_ca_system_score_gemma":0.000096650685,"threshold_uncertainty_score":0.495925},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9570144,0.00028030656,0.036399804,0.0023634539,0.0010652374,0.00023057153,0.00003917379,0.00016700616,0.0024400386],"genre_scores_gemma":[0.9906841,0.000017762399,0.008880099,0.00031075277,0.0000044238327,0.0000047690532,0.000009298958,0.000002401276,0.00008641211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998995,0.0000335567,0.00026369226,0.00028555188,0.00019236373,0.00022985382],"domain_scores_gemma":[0.9991791,0.00015217735,0.0001166105,0.00036725396,0.00010660135,0.00007822629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002550966,0.00010808329,0.00026000178,0.00019646627,0.000052199335,0.00004861694,0.0008561219,0.00006288545,0.00001684201],"category_scores_gemma":[0.00015370197,0.00008936925,0.00019962997,0.00083313626,0.000057320864,0.00029485853,0.00012266479,0.00006809349,0.000008080561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024242407,0.00017136431,0.0010083972,0.0000038125656,0.000027007423,0.0000037534649,0.000048317608,0.0000019037789,0.00017721874,0.9785548,0.0033682862,0.016610894],"study_design_scores_gemma":[0.0006442748,0.0012804138,0.015706327,0.000007635592,0.000023082106,0.0000026500218,0.000016950278,0.0011188401,0.003211296,0.974002,0.0038314713,0.00015507145],"about_ca_topic_score_codex":0.000021247093,"about_ca_topic_score_gemma":9.720131e-7,"teacher_disagreement_score":0.033669673,"about_ca_system_score_codex":0.000015846057,"about_ca_system_score_gemma":0.000020826517,"threshold_uncertainty_score":0.36443722},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9898594,0.00032932268,0.0057803965,0.0008583889,0.0023079147,0.0005991901,8.767885e-7,0.0001966462,0.000067845685],"genre_scores_gemma":[0.9689684,0.0000044799535,0.030729856,0.00015136373,0.000001529897,0.00006796491,2.995387e-7,0.000016871558,0.000059246428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987212,0.00010034519,0.0003312198,0.00029332712,0.00028614252,0.00026776106],"domain_scores_gemma":[0.9984252,0.00026348486,0.00017996845,0.00082946435,0.0002384245,0.00006347509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012978564,0.00014813637,0.00024088362,0.00010188332,0.00029220473,0.00009936654,0.001009099,0.000066783854,0.0000020503953],"category_scores_gemma":[0.00016405505,0.000093974726,0.000121688,0.0004924689,0.00012399757,0.00019145037,0.00020352003,0.00020762379,0.0000068145973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044200888,0.00008003128,0.00020288132,0.00005377132,0.000034246867,5.385775e-7,0.0013686041,0.000013463134,0.08846026,0.90836775,0.00030166094,0.0011123684],"study_design_scores_gemma":[0.0007133731,0.00015068514,0.0003123725,0.00005478073,0.00002493551,0.000011624896,0.00008418123,0.02289376,0.04100387,0.9345047,0.00009466267,0.00015107707],"about_ca_topic_score_codex":0.00006740309,"about_ca_topic_score_gemma":0.0000081159205,"teacher_disagreement_score":0.047456387,"about_ca_system_score_codex":0.000005764192,"about_ca_system_score_gemma":0.00007172783,"threshold_uncertainty_score":0.3832178},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97473323,0.0011423212,0.0034130304,0.00020652123,0.0024102712,0.0005845188,0.000020272124,0.0006434559,0.016846396],"genre_scores_gemma":[0.9817822,0.00006203491,0.0032653245,0.00008250557,0.00002368384,0.00006022748,0.000024556812,0.00008132696,0.014618144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774694,0.00009749677,0.00056407345,0.0003380877,0.0006900342,0.00056338543],"domain_scores_gemma":[0.99830943,0.00042140338,0.00025003342,0.00048906467,0.0002573226,0.0002727286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005170695,0.00031645957,0.00046144493,0.00009818094,0.00018485943,0.0001527451,0.00037304487,0.00016197757,0.00009950919],"category_scores_gemma":[0.0011387588,0.00032658255,0.0001320408,0.00021859012,0.00018698472,0.0010664815,0.00022364687,0.00028872935,0.00022812127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016954762,0.00014614673,0.0002607247,0.00013887564,0.000059144993,0.000012524954,0.0012406327,0.0000037764282,0.00040084257,0.86615497,0.13154921,0.000016214464],"study_design_scores_gemma":[0.0015200358,0.00007254685,0.000024101853,0.00008065652,0.00006515037,0.000025464804,0.0016564985,0.00061617646,0.0026833003,0.9921802,0.0006919934,0.0003838233],"about_ca_topic_score_codex":0.000052629617,"about_ca_topic_score_gemma":0.00001879579,"teacher_disagreement_score":0.13085721,"about_ca_system_score_codex":0.00045742074,"about_ca_system_score_gemma":0.00010619793,"threshold_uncertainty_score":0.99991864},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9941009,0.00012684485,0.0011130557,0.0002320351,0.0021369895,0.00011502551,5.629187e-7,0.00017060181,0.0020039468],"genre_scores_gemma":[0.9944101,0.000012671643,0.00514121,0.00035401343,7.27255e-7,0.0000057207576,0.0000020976338,0.000011332974,0.00006213776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998491,0.0001633433,0.0003009115,0.00037484895,0.0004175828,0.00025231665],"domain_scores_gemma":[0.9985269,0.00024099032,0.00015933924,0.0008036376,0.00015142196,0.00011771407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055977626,0.00015644936,0.00025989427,0.0004003762,0.0000982271,0.000038713184,0.00054301735,0.00007150623,0.0000063375005],"category_scores_gemma":[0.0001562462,0.00013330282,0.00011456672,0.0010619526,0.00005117174,0.00013132657,0.00015735782,0.000114557704,0.0000611592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000738527,0.00011268058,0.00032261814,0.000007740897,0.000013951337,0.0000017774144,0.00006694727,0.0001881197,0.0037361416,0.99262536,0.0015371194,0.0013801819],"study_design_scores_gemma":[0.0011524372,0.00037743806,0.0006801642,0.000028735776,0.000009026757,0.0000027276253,0.0000026836574,0.012289496,0.011356036,0.97373646,0.0002028504,0.00016195045],"about_ca_topic_score_codex":0.00003973073,"about_ca_topic_score_gemma":4.962715e-7,"teacher_disagreement_score":0.018888883,"about_ca_system_score_codex":0.00001343578,"about_ca_system_score_gemma":0.000019916177,"threshold_uncertainty_score":0.5435931},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9951863,0.00004165752,0.000005615739,0.00056733907,0.00011187884,0.0004257841,0.000005373442,0.000041001542,0.0036150087],"genre_scores_gemma":[0.99949944,0.0000072618186,0.00006871355,0.0003022055,0.0000030696292,0.000045146335,0.0000022803272,0.0000123341,0.00005956424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990868,0.000073043106,0.00027024266,0.00018386522,0.00018787086,0.00019820392],"domain_scores_gemma":[0.9987583,0.00045970242,0.00012536484,0.00058360706,0.00003347224,0.00003954298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035265833,0.00013361423,0.00020952662,0.00010130973,0.00010372307,0.000012712497,0.0003676088,0.00009217444,0.000042635955],"category_scores_gemma":[0.00011805464,0.000097385804,0.000078624056,0.00044714802,0.00007152958,0.000051331303,0.000026382808,0.00023738151,0.000010672534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022339664,0.00023470496,0.0002517242,0.0000087346825,0.000009501504,7.9570907e-7,0.00017485773,0.000005132447,0.003230768,0.9942057,0.0016365113,0.00021922396],"study_design_scores_gemma":[0.0004778543,0.00007216307,0.00358374,0.000023395678,0.000008943034,0.0000010084381,0.00005451365,0.000016937458,0.014383069,0.9811175,0.00015999435,0.000100870915],"about_ca_topic_score_codex":0.000008441253,"about_ca_topic_score_gemma":0.0000030883366,"teacher_disagreement_score":0.0130881965,"about_ca_system_score_codex":0.000016852064,"about_ca_system_score_gemma":0.000016715116,"threshold_uncertainty_score":0.39712778},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96989274,0.00016040009,0.012991417,0.0007093909,0.001827646,0.0025688836,0.00001874827,0.00046578265,0.011365],"genre_scores_gemma":[0.9639063,0.000008484906,0.02674517,0.00007217921,0.00002774329,0.0006195811,0.000008675703,0.000062478095,0.008549396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988478,0.000024210756,0.00036715242,0.00020601266,0.00019449103,0.0003603257],"domain_scores_gemma":[0.99839,0.0008062931,0.00014825471,0.00035613208,0.00019806997,0.000101237565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020038159,0.00017203392,0.00030662818,0.00005900143,0.00013311821,0.00007072579,0.00020638657,0.00010407874,0.00021833868],"category_scores_gemma":[0.0009727693,0.00016060598,0.00012278193,0.000090100584,0.00007724852,0.0004115719,0.00007454573,0.000094956915,0.00029830023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060706534,0.000112530615,0.000041944168,0.0001431694,0.000026378064,4.3564106e-7,0.00018291883,3.4638163e-7,0.0008258648,0.9711521,0.027314253,0.00019395171],"study_design_scores_gemma":[0.00088720303,0.00007857917,0.00007909735,0.000042843752,0.000035104815,0.0000036612928,0.00015341897,0.0004735961,0.0032287773,0.99351823,0.0013052308,0.00019427224],"about_ca_topic_score_codex":0.000029033581,"about_ca_topic_score_gemma":0.0000043553755,"teacher_disagreement_score":0.026009021,"about_ca_system_score_codex":0.000101612124,"about_ca_system_score_gemma":0.00002757014,"threshold_uncertainty_score":0.65493214},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96971864,0.00004726104,0.0006496385,0.000031654617,0.00065224984,0.00008188019,7.240125e-7,0.00012624847,0.028691703],"genre_scores_gemma":[0.9995345,0.000033014498,0.00027201357,0.00006742917,0.0000021243975,0.000008309225,6.100798e-7,0.000011396935,0.00007061024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997596,0.0000113263795,0.00004828926,0.00005998353,0.000043991393,0.00007679048],"domain_scores_gemma":[0.9998194,0.00003178644,0.000008376667,0.00010767551,0.000007781462,0.000024976576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000071570124,0.00005928999,0.000043590833,0.00001962621,0.000035969904,0.000013826171,0.000058785263,0.0000280128,0.00011148473],"category_scores_gemma":[0.000013617828,0.000041317337,0.000010381233,0.000035610406,0.000016009017,0.000046249308,0.000009796781,0.00006421953,0.000027041115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012001743,0.000065270186,0.0026182563,0.000102492224,0.00007426804,0.000008959295,0.0037647143,0.0019129463,0.000094246,0.96480036,0.010957883,0.015588624],"study_design_scores_gemma":[0.00091645913,0.000157394,0.03604405,0.00006199229,0.00003407213,0.000003777925,0.000113097776,0.032381013,0.03700752,0.89078236,0.0020036586,0.0004945977],"about_ca_topic_score_codex":0.0000076610595,"about_ca_topic_score_gemma":0.0000021679054,"teacher_disagreement_score":0.07401797,"about_ca_system_score_codex":0.000007107252,"about_ca_system_score_gemma":0.0000016173774,"threshold_uncertainty_score":0.1684872},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907596,0.00042851776,0.004501678,0.0003204132,0.001219297,0.0007494159,0.00007889837,0.000090842645,0.0018513418],"genre_scores_gemma":[0.9915071,0.0000031008287,0.007767204,0.000026440817,0.00001616985,0.000042609616,0.000007737618,0.000028135139,0.00060148817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913853,0.000024300203,0.00024877937,0.00015956412,0.00022725477,0.00020157488],"domain_scores_gemma":[0.9989929,0.00020840853,0.0001511245,0.00027934604,0.0002730408,0.000095158095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027637757,0.00013316567,0.00033812088,0.000056359553,0.000043000437,0.000012245296,0.00014394478,0.000092142094,0.000015854364],"category_scores_gemma":[0.0009195989,0.000113235306,0.00007299359,0.0001845523,0.00007347581,0.0001413346,0.000047657664,0.000088749184,0.0000021571832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019179158,0.000083612125,0.00042319443,0.00015532064,0.000037035832,0.0000023882126,0.0006062953,0.0000030087872,0.00009318552,0.9868759,0.0107569,0.0007713497],"study_design_scores_gemma":[0.0018727469,0.0006446638,0.000015357502,0.00003493753,0.000028301336,0.0000062764184,0.0003171408,0.0000075885705,0.032603703,0.9564426,0.007895274,0.00013142139],"about_ca_topic_score_codex":7.2020043e-7,"about_ca_topic_score_gemma":0.00000388844,"teacher_disagreement_score":0.032510515,"about_ca_system_score_codex":0.000037870836,"about_ca_system_score_gemma":0.000098459765,"threshold_uncertainty_score":0.4617602},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914114,0.00003061247,0.000025495938,0.00019502477,0.00018672834,0.0002655774,0.00000620829,0.000046047753,0.007832922],"genre_scores_gemma":[0.9992246,0.00000432129,0.0004686075,0.00007414103,0.0000056969516,0.000045240064,0.0000022413242,0.000020117339,0.00015500831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992298,0.000107285035,0.00016295597,0.00010773745,0.00015624489,0.0002360106],"domain_scores_gemma":[0.99836737,0.000884148,0.00011915432,0.0005323381,0.000026627857,0.000070375085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003132298,0.00012254721,0.00016418613,0.000051823634,0.0001181407,0.0000104008805,0.0002443564,0.000046147554,0.00007115769],"category_scores_gemma":[0.0000845052,0.00007664344,0.000076143944,0.0003162691,0.00013929402,0.00006341341,0.000022243188,0.00015393959,0.000027359993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018117105,0.00030803564,0.0026961914,0.000009088461,0.00004627124,3.6987245e-7,0.0003881038,1.8793205e-7,0.0004186087,0.9946747,0.0013526449,0.00008768248],"study_design_scores_gemma":[0.00037154436,0.00010725735,0.0032298071,0.000023765931,0.00004223642,0.0000034384977,0.00012981049,0.0000037859206,0.009841032,0.9858537,0.00029139826,0.00010227536],"about_ca_topic_score_codex":0.000005056704,"about_ca_topic_score_gemma":0.0000036650536,"teacher_disagreement_score":0.009422423,"about_ca_system_score_codex":0.000013041439,"about_ca_system_score_gemma":0.000010738888,"threshold_uncertainty_score":0.31254286},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98876256,0.000047345082,0.00021007705,0.0006356902,0.00049690437,0.0016817998,0.00005755684,0.00011077831,0.0079972865],"genre_scores_gemma":[0.9947971,0.0000023585517,0.0021098626,0.00026872245,0.000018310104,0.00033563958,0.000024274936,0.00007503054,0.0023686804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979694,0.00032840593,0.00029731018,0.00032569296,0.00051871984,0.0005604621],"domain_scores_gemma":[0.99647,0.0021531158,0.00012816138,0.00089367875,0.00022939478,0.00012568249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020042837,0.00022620222,0.00029457128,0.00007703614,0.00036544364,0.000096009695,0.0006275324,0.000069123096,0.0006258236],"category_scores_gemma":[0.0004683333,0.00014868075,0.000099505894,0.00022198849,0.0001706081,0.00009574158,0.00014827852,0.00025422385,0.000087046625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016293285,0.00019939503,0.00060494704,0.00013202899,0.00011147985,0.000002013868,0.00071565626,5.0869517e-7,0.00025068762,0.9814424,0.016265363,0.00011257131],"study_design_scores_gemma":[0.0022401935,0.00084940565,0.00044718393,0.000029354947,0.00004026962,0.000005096299,0.00020165776,0.0002747806,0.0023413466,0.9338213,0.059545014,0.00020439936],"about_ca_topic_score_codex":0.000020657833,"about_ca_topic_score_gemma":0.00009195004,"teacher_disagreement_score":0.04762112,"about_ca_system_score_codex":0.000051601535,"about_ca_system_score_gemma":0.00006406041,"threshold_uncertainty_score":0.685233},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9605716,0.000018241963,0.0000133651365,0.0015079177,0.00054700277,0.00024188776,0.000004139162,0.00012605304,0.036969777],"genre_scores_gemma":[0.9987567,0.0000020080315,0.00013375755,0.00038653408,0.000006128421,0.000081666796,0.000003390061,0.000019560486,0.00061024795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991607,0.00012274296,0.00016440717,0.00016042379,0.00019935322,0.00019236653],"domain_scores_gemma":[0.9985646,0.0006321131,0.000071928844,0.00055887783,0.000064493484,0.000107994376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005714814,0.00012964194,0.00013233967,0.00005346364,0.00016113548,0.000036083093,0.0003602635,0.00006287001,0.00005667492],"category_scores_gemma":[0.0004673363,0.0000847716,0.00008630655,0.00030932258,0.000104864164,0.0000503829,0.00004512242,0.00023222898,0.00029083775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012180757,0.00013909978,0.0001750503,0.0000026834587,0.00001722246,0.000001259285,0.0003982279,2.238422e-7,0.000034931494,0.95574105,0.043344766,0.00013331663],"study_design_scores_gemma":[0.0003464864,0.00006882318,0.00011323587,0.000014612854,0.000016487043,0.0000028724721,0.00033641275,0.000012282416,0.00077206024,0.9932349,0.0049745217,0.000107335254],"about_ca_topic_score_codex":0.000007955513,"about_ca_topic_score_gemma":0.000006048118,"teacher_disagreement_score":0.038370244,"about_ca_system_score_codex":0.000025492689,"about_ca_system_score_gemma":0.000024402378,"threshold_uncertainty_score":0.3738228},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844218,0.00002978079,0.000058520312,0.0018522755,0.00014465007,0.0004982245,0.0000022909232,0.00009736066,0.012895097],"genre_scores_gemma":[0.9969776,0.000002190353,0.0003349767,0.00017903434,0.000013922093,0.00030385313,0.0000040367268,0.000022085074,0.00216225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921954,0.000042348765,0.00013802621,0.00017309227,0.00019680402,0.00023016783],"domain_scores_gemma":[0.9990472,0.00025283985,0.00009818588,0.00045375983,0.00007467,0.00007334839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023084077,0.0001322435,0.00013109183,0.00003548415,0.00028313987,0.00006702561,0.00033419224,0.000055191238,0.000354596],"category_scores_gemma":[0.0000137459565,0.000080335245,0.000048769973,0.00025053104,0.00013990329,0.0001277697,0.00005462617,0.00018895612,0.00024803946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010934623,0.00013871306,0.0006164079,0.000009502442,0.0000310874,9.277321e-7,0.0005650407,5.2456005e-7,0.00019451186,0.98925203,0.009021761,0.00015856352],"study_design_scores_gemma":[0.0008063903,0.00004594374,0.001971471,0.00001204652,0.000026799064,0.000008302688,0.00033534088,0.000028833167,0.000792802,0.9921946,0.0036468257,0.00013064538],"about_ca_topic_score_codex":0.000036830843,"about_ca_topic_score_gemma":0.000014703193,"teacher_disagreement_score":0.012555852,"about_ca_system_score_codex":0.000015724205,"about_ca_system_score_gemma":0.000029953282,"threshold_uncertainty_score":0.38825777},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99097556,0.000060457874,0.00028272436,0.000022719063,0.0003035458,0.00021254152,0.000005389893,0.000078917874,0.008058145],"genre_scores_gemma":[0.99842185,0.000007477482,0.0012350221,0.000015510172,0.0000034259365,0.000053836215,0.000004753286,0.00001733721,0.00024079271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924266,0.00006240343,0.0002546635,0.000161163,0.00012846332,0.00015064642],"domain_scores_gemma":[0.99914753,0.000091431735,0.0001469193,0.00046158503,0.000092981376,0.000059577855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026159198,0.00011050191,0.00017940819,0.000097314514,0.00007865268,0.000005378686,0.0001661299,0.00007532103,0.0002710357],"category_scores_gemma":[0.00003459779,0.0001026151,0.00010651015,0.00041459085,0.000088927525,0.000083094164,0.00003383998,0.00008629122,0.000049542607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003231021,0.00032079368,0.00088607176,0.000025594285,0.000060967748,8.0680974e-7,0.00045832686,2.3832174e-8,0.0034216926,0.9935284,0.0009355805,0.00032941834],"study_design_scores_gemma":[0.00038383077,0.0000844342,0.0019558342,0.000024323685,0.00008503921,0.000001798865,0.00006191841,0.000013198687,0.021974325,0.97446054,0.00084974384,0.00010503974],"about_ca_topic_score_codex":0.000010097678,"about_ca_topic_score_gemma":0.0000022597374,"teacher_disagreement_score":0.0190679,"about_ca_system_score_codex":0.0000071496224,"about_ca_system_score_gemma":0.000013267143,"threshold_uncertainty_score":0.41845223},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959906,0.0023930212,0.000019604793,0.000058666134,0.00035152334,0.00015426097,0.000010272061,0.000066212575,0.0009558618],"genre_scores_gemma":[0.9997622,0.000098381555,0.000024845836,0.00002500824,0.0000069002867,0.000013523989,0.0000027857036,0.000027765887,0.000038606904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933755,0.000044120297,0.00014662235,0.000109788496,0.00013072362,0.00023119689],"domain_scores_gemma":[0.9995489,0.00009178097,0.0000491199,0.0001996633,0.000023471976,0.000087044566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003273323,0.00013512002,0.00020329196,0.00003788696,0.00007101213,0.000024612753,0.00010242597,0.00006512992,0.000005916726],"category_scores_gemma":[0.000010869252,0.00010838821,0.000024393536,0.0001447693,0.00011923005,0.00019298647,0.00003548641,0.00012661361,0.00000293868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008361808,0.0001738997,0.10964731,0.0006917707,0.00058612536,0.000002799338,0.01252225,0.000015194597,0.017870259,0.8485373,0.0046014143,0.0052680643],"study_design_scores_gemma":[0.005187133,0.0006291127,0.23991878,0.0007824629,0.00036324008,0.00022912196,0.004281113,0.00017646418,0.092348576,0.63821006,0.016299743,0.0015741758],"about_ca_topic_score_codex":0.000029948116,"about_ca_topic_score_gemma":0.0000025776915,"teacher_disagreement_score":0.21032722,"about_ca_system_score_codex":0.000009732833,"about_ca_system_score_gemma":0.000004487014,"threshold_uncertainty_score":0.44199428},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900216,0.000065507964,0.000007702235,0.000007126691,0.004865971,0.00010182558,0.0000055088162,0.00019629217,0.0047284984],"genre_scores_gemma":[0.9997831,0.000008837194,0.000121548735,0.0000069442053,0.0000114027125,0.000010163255,0.000005239459,0.000020862017,0.00003192218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943,0.000020555068,0.00019047693,0.00009671919,0.00010817573,0.00015410078],"domain_scores_gemma":[0.9995734,0.000048964317,0.000032843738,0.000251195,0.00003149335,0.00006208835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013978369,0.00010654349,0.0001517142,0.00007789658,0.000033127133,0.000009654181,0.00013877779,0.00009521201,0.00005739873],"category_scores_gemma":[0.000016873777,0.00011061798,0.00007653296,0.00013262332,0.000058692618,0.00013062712,0.000011034881,0.00019174394,0.00005008029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039443503,0.000041628948,0.0027893062,0.000057537753,0.00002846732,0.0000018542295,0.00021906574,0.00007088731,0.12732238,0.8689833,0.00021531279,0.00026629772],"study_design_scores_gemma":[0.0024651662,0.00007882737,0.023211928,0.000097231125,0.000042005355,0.00001692497,0.00030449987,0.005098594,0.21139792,0.75020665,0.0064515206,0.00062874774],"about_ca_topic_score_codex":0.000023407776,"about_ca_topic_score_gemma":0.000014445918,"teacher_disagreement_score":0.11877668,"about_ca_system_score_codex":0.0000066214907,"about_ca_system_score_gemma":0.00000593365,"threshold_uncertainty_score":0.45108703},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9807122,0.00049412705,0.000017697788,0.00049904815,0.00074789097,0.00022265168,0.0000019130525,0.000092371614,0.017212136],"genre_scores_gemma":[0.9980886,0.00002023392,0.0013923831,0.00022668898,0.000023996427,0.000010767241,0.0000041703966,0.000034403787,0.00019873006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988508,0.000050191877,0.00032412057,0.00013241709,0.00033213076,0.00031034078],"domain_scores_gemma":[0.9988584,0.00020173744,0.00009826809,0.0005042559,0.0001114429,0.00022589469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037956284,0.00014116212,0.00039945633,0.000092721195,0.000030221758,0.0000061616606,0.00015137167,0.00010220443,0.00028384433],"category_scores_gemma":[0.00035183178,0.00012766357,0.0000977117,0.00023930999,0.000099057,0.00010298244,0.00007703727,0.00013968129,0.0001559651],"study_design_candidate":"observational","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.00013691888,0.0019721843,0.19099125,0.000265776,0.0002789349,0.000020004773,0.0007003675,7.3099784e-8,0.32438707,0.46379364,0.014697856,0.0027559083],"study_design_scores_gemma":[0.0029520534,0.00053638633,0.8031862,0.00028105857,0.00023695527,0.00016075412,0.00020367511,0.000032235926,0.14446956,0.038955055,0.008650503,0.00033560948],"about_ca_topic_score_codex":0.000026950136,"about_ca_topic_score_gemma":3.4121157e-7,"teacher_disagreement_score":0.6121949,"about_ca_system_score_codex":0.00008803263,"about_ca_system_score_gemma":0.00011587865,"threshold_uncertainty_score":0.5205969},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8881428,0.0015007969,0.00035821728,0.00017883044,0.009541209,0.00010715553,0.000002417044,0.000100384685,0.100068174],"genre_scores_gemma":[0.9961478,0.000022614357,0.002559817,0.0002646962,0.000060698552,0.000008376789,0.0000010114433,0.000012912688,0.0009220455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697775,0.00050280854,0.0005191329,0.00033370836,0.0011036718,0.00056294614],"domain_scores_gemma":[0.98143727,0.017041204,0.0003255106,0.0007839431,0.00016295095,0.00024915452],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.010597724,0.00014911435,0.00030672294,0.00037456525,0.00020641992,0.0001809444,0.0010504666,0.00011168085,0.000731858],"category_scores_gemma":[0.052632425,0.00010279835,0.00011032672,0.0022305145,0.00011484288,0.00045044936,0.00024415384,0.00022598305,0.00090714655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061144865,0.00007417644,0.41805196,0.0000014251143,0.000009963194,0.0000017294674,0.00039245206,9.456732e-7,0.00007054035,0.50838566,0.011659979,0.061345074],"study_design_scores_gemma":[0.00027099228,0.00003393328,0.2974767,0.000005711031,0.0000049448627,0.000007204517,0.00028601423,0.000026448592,0.00022493236,0.66680294,0.034736224,0.00012396168],"about_ca_topic_score_codex":0.000025610512,"about_ca_topic_score_gemma":5.018325e-7,"teacher_disagreement_score":0.15841728,"about_ca_system_score_codex":0.00003204343,"about_ca_system_score_gemma":0.000028526312,"threshold_uncertainty_score":0.9998708},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96975785,0.00040002863,0.00014390568,0.000011097277,0.00074173254,0.00023830161,0.000007080639,0.00017035489,0.028529653],"genre_scores_gemma":[0.99979687,0.000016369026,0.00005637392,0.000024852256,0.0000059444724,0.000007660533,0.000005522009,0.000024013718,0.00006238021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990895,0.000037608366,0.00023924555,0.00017053145,0.00020624972,0.00025688802],"domain_scores_gemma":[0.999355,0.00010952883,0.00006198532,0.000303661,0.00008155695,0.000088266555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015352336,0.00019773617,0.00030750895,0.00025840258,0.000038462564,0.000018012188,0.00018831903,0.000079403406,0.000019489013],"category_scores_gemma":[0.000022550468,0.0001735378,0.00008294789,0.0009984423,0.000049405447,0.000139388,0.000009366876,0.00012303721,0.000019749808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013751144,0.0003886166,0.0072577125,0.0001847707,0.00026627412,0.00005869346,0.00092308986,0.0006039211,0.01590476,0.9693895,0.0021015585,0.0027836212],"study_design_scores_gemma":[0.00905742,0.0054729115,0.1541423,0.0011027326,0.00036982275,0.00007613297,0.0015243262,0.0030208507,0.3439828,0.47674388,0.0020457471,0.002461082],"about_ca_topic_score_codex":0.000008403565,"about_ca_topic_score_gemma":0.0000010934797,"teacher_disagreement_score":0.4926456,"about_ca_system_score_codex":0.000024302963,"about_ca_system_score_gemma":0.0000154746,"threshold_uncertainty_score":0.70766664},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98057693,0.000014407022,0.0010596688,0.008518552,0.0012269773,0.0001856734,0.000001348027,0.000016435733,0.00839999],"genre_scores_gemma":[0.9985916,0.000009633709,0.000084395484,0.0002447681,0.000007515923,0.0000139015565,0.0000020359569,0.0000050499134,0.0010410983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931175,0.00007650819,0.00023712873,0.00010251312,0.00010555092,0.00016655074],"domain_scores_gemma":[0.99827385,0.0011366751,0.00008594351,0.00037773943,0.00006943294,0.000056351022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061646535,0.00007365509,0.00018793464,0.000010120238,0.00017658554,0.0000038953935,0.0001886524,0.00014190028,0.00008578161],"category_scores_gemma":[0.0017971337,0.00003293569,0.00008618045,0.000084199666,0.00061954145,0.000013549569,0.00007209365,0.00040645758,0.000021162183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002893965,0.00008018874,0.012250821,0.000015657632,0.000019116473,3.9702195e-7,0.000028971011,4.2738503e-7,0.0005180712,0.9860279,0.000060356353,0.0009691855],"study_design_scores_gemma":[0.00029197073,0.000064888714,0.04453432,0.000015191409,0.00003567342,0.000008004321,0.000011918731,0.027052851,0.00084870873,0.92704666,0.000054351945,0.00003547729],"about_ca_topic_score_codex":0.0000075899334,"about_ca_topic_score_gemma":0.000021506004,"teacher_disagreement_score":0.05898122,"about_ca_system_score_codex":0.000010153432,"about_ca_system_score_gemma":0.000035086763,"threshold_uncertainty_score":0.22827263},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98178566,0.00014617387,0.00019571891,0.000015567193,0.00030383485,0.00016429936,0.000005738142,0.00004403955,0.017339],"genre_scores_gemma":[0.96998346,0.000045489243,0.02882785,0.0000074949935,0.0000035538696,0.000011081856,8.211124e-7,0.000028704691,0.0010915315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989987,0.000051140985,0.00042092858,0.00014543514,0.00022329569,0.00016049886],"domain_scores_gemma":[0.99885684,0.00036585296,0.0002483693,0.0003360647,0.00013466296,0.000058193964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021815511,0.00013123431,0.0004211285,0.000055480126,0.000027310198,0.000005460274,0.00015930443,0.000077148,0.00015926144],"category_scores_gemma":[0.00047915376,0.000119000986,0.00007288557,0.00009990583,0.00024061989,0.00012909429,0.000114903356,0.000078196965,0.000007254286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014534406,0.00021120934,0.0012093915,0.00031610607,0.000061214865,0.0000023624912,0.0022964135,7.8724064e-8,0.0010056731,0.9941788,0.0006689973,0.000035254514],"study_design_scores_gemma":[0.0006841555,0.00006545916,0.00042095646,0.000084746935,0.00006660987,0.000003907598,0.00029489695,0.000030274994,0.027283376,0.9709088,0.00004485227,0.00011196729],"about_ca_topic_score_codex":0.000049081867,"about_ca_topic_score_gemma":0.000003818863,"teacher_disagreement_score":0.028632132,"about_ca_system_score_codex":0.000014706325,"about_ca_system_score_gemma":0.000016209398,"threshold_uncertainty_score":0.48527193},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89841324,0.00009927711,0.000020883586,0.00015025571,0.0008178692,0.0002693371,0.0000015596837,0.0000883654,0.100139186],"genre_scores_gemma":[0.99860245,0.00005842017,0.00057148596,0.00022126689,0.0000150318,0.000019466932,0.0000011788293,0.00002839515,0.00048231002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989859,0.00007277924,0.0002538263,0.0002442522,0.00020970852,0.00023352265],"domain_scores_gemma":[0.9989154,0.0003693659,0.0001334551,0.00046726462,0.00003935989,0.00007517173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006916561,0.00016671696,0.00026608224,0.00004136109,0.00015975274,0.00003574862,0.00022001434,0.00007791933,0.00008130738],"category_scores_gemma":[0.0002495063,0.0001130542,0.00006687234,0.00008075107,0.00030247483,0.00008699355,0.000093471535,0.00021708455,0.000036145542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007986309,0.00010930115,0.002173812,0.000025892341,0.00003700662,0.000016343423,0.0012461388,6.155238e-9,0.0000221439,0.9925385,0.003355788,0.00039516328],"study_design_scores_gemma":[0.0017803658,0.000076828255,0.0033367623,0.000060346076,0.0000367027,0.000018347151,0.00017788252,0.000013890572,0.0005184236,0.9925891,0.0012374243,0.00015392725],"about_ca_topic_score_codex":0.00004575024,"about_ca_topic_score_gemma":0.000007398529,"teacher_disagreement_score":0.10018917,"about_ca_system_score_codex":0.000021462918,"about_ca_system_score_gemma":0.00001563903,"threshold_uncertainty_score":0.46102163},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946217,0.000019520883,0.00005577826,0.000487018,0.00009960646,0.00052362826,0.0000028983861,0.000040455347,0.0041493857],"genre_scores_gemma":[0.99919426,0.0000059045165,0.00022683122,0.00014284879,0.0000025911922,0.0001564848,0.0000019961647,0.000021451167,0.0002476351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991644,0.00009397774,0.0002002067,0.00015410481,0.00020566638,0.00018166433],"domain_scores_gemma":[0.99867165,0.00048579316,0.00012802816,0.0005517083,0.000108595064,0.000054196345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023353372,0.00012972897,0.00017307185,0.000053916403,0.00014978569,0.000024443583,0.00029518275,0.00005033136,0.00031006872],"category_scores_gemma":[0.00007685581,0.00007748691,0.000057354326,0.0003530831,0.00015749376,0.000075981894,0.000036906407,0.00015685848,0.00005568697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027076469,0.00021190576,0.0010095616,0.000014323201,0.00005046726,4.762534e-7,0.00023621324,0.000006159525,0.0006304138,0.9954835,0.002249257,0.000080646874],"study_design_scores_gemma":[0.0009074272,0.00009572026,0.0026343868,0.000028506582,0.000031593223,0.0000018667686,0.000109723514,0.00018404766,0.0031056982,0.99265444,0.00013946589,0.00010711506],"about_ca_topic_score_codex":0.000063811225,"about_ca_topic_score_gemma":0.000006365578,"teacher_disagreement_score":0.0045725484,"about_ca_system_score_codex":0.0000100541965,"about_ca_system_score_gemma":0.000025203099,"threshold_uncertainty_score":0.3395035},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903504,0.00008026787,0.0010240979,0.00038061818,0.005873073,0.00024431176,0.0000020613077,0.00011761935,0.0019275071],"genre_scores_gemma":[0.9994616,0.000004842963,0.00037924416,0.00004062099,0.000025789694,0.00001784847,7.29356e-7,0.000010801262,0.000058535777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861735,0.00014412703,0.00026455254,0.0004914762,0.00021190644,0.00027057366],"domain_scores_gemma":[0.9985888,0.00022554031,0.00012575077,0.00074133597,0.00020299632,0.00011556542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008113561,0.00016957872,0.00031821907,0.000115420036,0.00015983518,0.00009520613,0.00042721254,0.000098114164,0.000010944657],"category_scores_gemma":[0.00016812871,0.0001577387,0.00008279151,0.00038808584,0.00011945619,0.00048736224,0.00016262503,0.00032024187,0.0000059894924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005391735,0.000103358594,0.03160354,0.000022153168,0.000022264812,0.0000040182204,0.00048959587,0.0000018785793,0.011998388,0.95196587,0.000491145,0.003292419],"study_design_scores_gemma":[0.0017310213,0.00053573266,0.19743878,0.00006061042,0.000023154691,0.00022616088,0.000112035625,0.011049327,0.048020992,0.7372322,0.0028254648,0.000744517],"about_ca_topic_score_codex":0.0003235243,"about_ca_topic_score_gemma":0.00020348692,"teacher_disagreement_score":0.21473365,"about_ca_system_score_codex":0.0000146094735,"about_ca_system_score_gemma":0.000052095842,"threshold_uncertainty_score":0.6432398},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99388903,0.00060968084,0.00018530818,0.00023961312,0.0032463237,0.00012028388,0.0000022853924,0.00015618131,0.0015512606],"genre_scores_gemma":[0.9951459,0.000009394311,0.0044763032,0.00022257189,0.0000027876797,0.000005869826,0.000003080404,0.000015781956,0.00011829127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834794,0.000090985755,0.00033950826,0.00030362848,0.0004319054,0.00048601316],"domain_scores_gemma":[0.9986406,0.00019360677,0.000113524846,0.0007053646,0.00016104175,0.0001858374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064116926,0.00018313875,0.00025691636,0.00016256362,0.00011315398,0.00005220066,0.00051217683,0.00008118478,0.000030798532],"category_scores_gemma":[0.00011542082,0.00016566092,0.00010133006,0.0004922334,0.00006883661,0.00049294735,0.0002214669,0.00018992739,0.00017903178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063982898,0.00029866124,0.005752873,0.000014126796,0.000021190837,0.000002445008,0.00043097985,0.000035777175,0.008404467,0.98213327,0.002326931,0.0005728878],"study_design_scores_gemma":[0.0016044818,0.00030906594,0.005629728,0.00009453934,0.000024007502,0.0000170275,0.000028516686,0.0025747037,0.043361716,0.94568163,0.00023175526,0.0004428508],"about_ca_topic_score_codex":0.000044156863,"about_ca_topic_score_gemma":3.5037473e-7,"teacher_disagreement_score":0.036451653,"about_ca_system_score_codex":0.000024638242,"about_ca_system_score_gemma":0.000042708136,"threshold_uncertainty_score":0.6755457},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98584896,0.000009123159,0.00009895494,0.001263346,0.00008359637,0.0001840418,7.742058e-7,0.000020019708,0.012491157],"genre_scores_gemma":[0.99953276,0.0000041379194,0.000058494603,0.00016421398,0.0000033031247,0.00004268709,2.8815916e-7,0.000009580352,0.00018453327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994361,0.00015952306,0.00013144736,0.00008515582,0.00010225046,0.0000855165],"domain_scores_gemma":[0.9972065,0.0023103193,0.00008836133,0.0003544508,0.000021628024,0.000018736726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074235175,0.00006989551,0.00011989867,0.000011132539,0.00015092536,0.000017430377,0.00018350579,0.000030756197,0.00003077944],"category_scores_gemma":[0.00018874038,0.00003605738,0.000047592406,0.00009341761,0.00015993665,0.000021015438,0.000043942266,0.00013132721,0.000017162432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016700445,0.000045458866,0.000201541,0.000008759006,0.000017370849,5.159867e-8,0.0006983738,3.0000987e-7,0.00004223902,0.9981658,0.0005673325,0.00023606041],"study_design_scores_gemma":[0.0007066363,0.000008820027,0.00075792306,0.000018933584,0.000020212878,0.0000020696114,0.00013859019,0.00014931528,0.00029161037,0.9976228,0.00023951968,0.000043578333],"about_ca_topic_score_codex":0.000009185118,"about_ca_topic_score_gemma":0.0000019178235,"teacher_disagreement_score":0.013683775,"about_ca_system_score_codex":0.0000040189207,"about_ca_system_score_gemma":0.0000051494226,"threshold_uncertainty_score":0.14703771},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9905737,0.0001878677,0.0012224903,0.000017330069,0.0056684017,0.00040277696,0.00001623968,0.0002341445,0.0016770182],"genre_scores_gemma":[0.9995568,0.0000015918511,0.00010486526,0.000022983308,0.00002807519,0.00005573353,0.00002286709,0.00003200452,0.0001750793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923825,0.000019502211,0.0001648951,0.000111067966,0.00011089696,0.0003554064],"domain_scores_gemma":[0.9994215,0.00007048682,0.000021393218,0.00020216408,0.000027938939,0.0002565443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018198405,0.00014284655,0.00015643574,0.00010129048,0.00006944615,0.000026151763,0.00011441704,0.00007384043,0.000039842456],"category_scores_gemma":[0.000022617613,0.00014147529,0.00009154658,0.0001546676,0.000009151832,0.00013188233,0.00001308824,0.00006797107,0.000073310555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009920273,0.000051702445,0.008367964,0.000041763808,0.000041060746,3.327792e-7,0.0018978147,0.00021317047,0.0024525782,0.9674679,0.019269966,0.0001858226],"study_design_scores_gemma":[0.0029830907,0.0005831697,0.037140384,0.00015146653,0.00013079974,0.000012690096,0.0030487194,0.000978083,0.0801831,0.7604856,0.11282459,0.0014783181],"about_ca_topic_score_codex":0.000013638349,"about_ca_topic_score_gemma":0.0000024179885,"teacher_disagreement_score":0.20698233,"about_ca_system_score_codex":0.00004431204,"about_ca_system_score_gemma":0.000007536887,"threshold_uncertainty_score":0.5769195},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.933055,0.000049302154,0.047077402,0.00021693199,0.0049016625,0.0001416596,7.162664e-7,0.00018611949,0.014371203],"genre_scores_gemma":[0.99938947,0.0000037024574,0.00039644225,0.00006330703,0.000016809297,0.000009066694,7.546249e-7,0.000006895478,0.00011357855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883276,0.00019763301,0.0002708035,0.0002722082,0.00021695168,0.0002096419],"domain_scores_gemma":[0.9987375,0.00026992982,0.00015386973,0.00061969407,0.00014744703,0.00007153413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000397875,0.00010928069,0.00022683761,0.00011628436,0.00008316261,0.000055090703,0.0005718507,0.00007416506,0.000006908159],"category_scores_gemma":[0.00013037563,0.0001004561,0.00009419453,0.0005547564,0.000035459354,0.00023672744,0.00011737885,0.000121577534,0.000020154574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039851157,0.000060331287,0.0036275128,0.000009016221,0.000013838789,0.0000011897683,0.00014823856,0.000027593587,0.0004268715,0.9910015,0.0019529265,0.0027270366],"study_design_scores_gemma":[0.0012815278,0.00052669214,0.043524947,0.000078550496,0.000008998924,0.000019752304,0.000027152984,0.06411414,0.0053955386,0.8737472,0.010906896,0.00036858695],"about_ca_topic_score_codex":0.00012421336,"about_ca_topic_score_gemma":0.000011466158,"teacher_disagreement_score":0.11725424,"about_ca_system_score_codex":0.000021443198,"about_ca_system_score_gemma":0.000022939981,"threshold_uncertainty_score":0.4096481},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9976197,0.00020461131,0.0000043707955,0.00005150177,0.0011433082,0.000117641364,0.000002941243,0.000029029265,0.00082691695],"genre_scores_gemma":[0.9984275,0.000070465365,0.00034994836,0.00048609747,0.00008492239,0.0000054587313,0.000035690937,0.000017461829,0.0005224713],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990591,0.000036386176,0.00018738324,0.00030586554,0.00012821956,0.00028307165],"domain_scores_gemma":[0.9994308,0.0000051662887,0.00006613002,0.00034247342,0.000059277605,0.0000961953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009675129,0.00016683454,0.00016329257,0.000029535026,0.00010266342,0.0000333325,0.00020613176,0.00015012498,0.00002354533],"category_scores_gemma":[0.000042976128,0.00015792281,0.000089870264,0.00008078649,0.000029575478,0.00000648485,0.000049783936,0.00009291744,0.000013549113],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032791693,0.000049123486,0.008754907,0.000005932158,0.000009663466,0.00001248823,0.0000487409,0.0000026861867,0.98397076,0.0033249308,0.00089423603,0.0028937608],"study_design_scores_gemma":[0.0013413179,0.00025864688,0.0141246505,0.000017877484,0.00003623704,0.000031875436,0.000029015195,0.000018410725,0.97208464,0.006547839,0.0051712873,0.00033818744],"about_ca_topic_score_codex":0.000017950517,"about_ca_topic_score_gemma":0.00000922841,"teacher_disagreement_score":0.011886084,"about_ca_system_score_codex":0.000012495518,"about_ca_system_score_gemma":0.00004297468,"threshold_uncertainty_score":0.6439905},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9882819,0.00015341015,0.00033877854,0.0016705997,0.00036018356,0.0002569287,5.605742e-7,0.000023726614,0.008913927],"genre_scores_gemma":[0.99925786,0.000019497173,0.00041167618,0.00017871847,0.0000012678071,0.00002712886,1.03354196e-7,0.0000053430495,0.00009842485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998665,0.00037013396,0.00016134679,0.00021274868,0.00038174118,0.00020902495],"domain_scores_gemma":[0.99788696,0.0011892669,0.000065499386,0.00069759856,0.00009684678,0.00006383285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017431373,0.00008925972,0.0001449977,0.00005180931,0.00006334463,0.000045508175,0.0010756588,0.000030935047,0.000004103798],"category_scores_gemma":[0.00047337392,0.000048004542,0.000035348312,0.00065457745,0.00049687555,0.00018194932,0.00033923006,0.00021906628,0.00002224704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042964766,0.000033585606,0.0030327549,0.0000023996283,0.000004898991,0.0000041834305,0.00094705087,0.0000050839385,0.000008286696,0.99521863,0.00015494067,0.00054519955],"study_design_scores_gemma":[0.0011684414,0.00004020862,0.0018748074,0.000017231769,0.0000010262794,0.0000064635205,0.00011193384,0.0009771275,0.00033207017,0.9953385,0.00007354513,0.000058628684],"about_ca_topic_score_codex":0.000042315787,"about_ca_topic_score_gemma":0.0000032747334,"teacher_disagreement_score":0.010975955,"about_ca_system_score_codex":0.000018930945,"about_ca_system_score_gemma":0.000042142918,"threshold_uncertainty_score":0.19988596},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.953939,0.000036588415,0.03957942,0.0005489994,0.0010297289,0.00015521912,9.1823716e-7,0.00033742556,0.0043727034],"genre_scores_gemma":[0.988236,0.0000016907187,0.011336223,0.00017504126,0.000011132964,0.000014904116,0.0000027708477,0.000013081117,0.00020915568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985588,0.00026224944,0.00017031019,0.00035917963,0.00033053564,0.00031889253],"domain_scores_gemma":[0.9983893,0.0006049335,0.000061100756,0.00071814074,0.00012127359,0.000105255174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005224395,0.00012472247,0.00013720068,0.00012648816,0.00031071904,0.00013235472,0.0007415023,0.00004988382,0.00001756107],"category_scores_gemma":[0.00038424256,0.000119390075,0.000047164613,0.0005862568,0.000052012365,0.00032135614,0.00014960977,0.00017708361,0.00015978327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000319041,0.000041219173,0.00051856856,0.000002669978,0.0000067471765,0.000001840802,0.00014907979,0.0025944544,0.003183555,0.9889512,0.00019636117,0.0043511316],"study_design_scores_gemma":[0.00043167968,0.0001393985,0.0021779966,0.000011621602,0.0000014407013,0.0000019424156,0.000010067823,0.17062998,0.0044232337,0.8211713,0.00083535654,0.00016601023],"about_ca_topic_score_codex":0.000009987036,"about_ca_topic_score_gemma":0.0000048100824,"teacher_disagreement_score":0.16803552,"about_ca_system_score_codex":0.00003322176,"about_ca_system_score_gemma":0.000028268789,"threshold_uncertainty_score":0.4868586},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9162414,0.00020237776,0.000011720963,0.000013484991,0.010127951,0.000292909,0.0000032339817,0.00022764372,0.07287929],"genre_scores_gemma":[0.99981606,0.000008729027,0.000013104771,0.0000070600563,0.00001985987,0.000058967405,0.0000060490274,0.000034844612,0.000035320038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990189,0.00005510798,0.00030635556,0.00014122338,0.00021219923,0.0002662136],"domain_scores_gemma":[0.99937004,0.000058428155,0.000053944903,0.0003439363,0.00007860342,0.00009504515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016200941,0.00017070006,0.0002737118,0.0000903344,0.000043301552,0.00002670078,0.0002498726,0.00009807704,0.0002307428],"category_scores_gemma":[0.000020919022,0.00017410489,0.00009038632,0.00025208597,0.000050067385,0.00018056761,0.000029847777,0.00012850214,0.0003176465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040380028,0.00006325358,0.0010123658,0.000077523444,0.00008153822,0.0000021963556,0.00013019,0.000034865294,0.009399348,0.9853153,0.0034570536,0.0004223114],"study_design_scores_gemma":[0.0011652401,0.00008137893,0.0046350723,0.000039312992,0.000017359213,0.000002188996,0.000096685406,0.00024775253,0.029561535,0.9622557,0.0016784557,0.00021930276],"about_ca_topic_score_codex":0.000035604477,"about_ca_topic_score_gemma":0.0000012725181,"teacher_disagreement_score":0.08357468,"about_ca_system_score_codex":0.000031852767,"about_ca_system_score_gemma":0.000009649673,"threshold_uncertainty_score":0.7099792},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9866884,0.0006413029,0.0036667534,0.0024616693,0.0023408397,0.0007533397,0.000002301856,0.00019507219,0.0032503465],"genre_scores_gemma":[0.9966147,0.00013374214,0.0026901278,0.00014247611,0.0000026012265,0.00006789974,8.90311e-7,0.000015138757,0.00033240736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828076,0.00019524312,0.00026339962,0.00032147756,0.00045923676,0.00047985432],"domain_scores_gemma":[0.9976154,0.0007067477,0.00011757359,0.0011993987,0.00021607395,0.00014482948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005691166,0.00014374628,0.00017031503,0.00011984002,0.00019134035,0.00013829484,0.0018279314,0.00005232198,0.00001739996],"category_scores_gemma":[0.00017729582,0.00010217402,0.00011089782,0.000760061,0.00031354322,0.00054177025,0.00048903667,0.00021137086,0.00015962459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043690893,0.00004678301,0.0020787232,0.00000548781,0.000032170345,0.000002503304,0.000179446,0.000004431328,0.0013744271,0.98520344,0.0031497267,0.007918489],"study_design_scores_gemma":[0.00031868857,0.00011178485,0.00469128,0.000009072211,0.0000027360102,0.0000028550112,0.000023679075,0.0008237698,0.0042899125,0.98680896,0.0027899698,0.00012727187],"about_ca_topic_score_codex":0.00015813689,"about_ca_topic_score_gemma":0.0000053642893,"teacher_disagreement_score":0.009926342,"about_ca_system_score_codex":0.000026380563,"about_ca_system_score_gemma":0.000040293988,"threshold_uncertainty_score":0.41665354},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98845077,0.00084513205,0.0001601879,0.00016843001,0.0032439935,0.00009814484,0.0000011080364,0.00012282649,0.006909403],"genre_scores_gemma":[0.99827677,0.000014463857,0.0013313091,0.00025562546,9.87246e-7,0.000004439508,0.0000012483272,0.00000956384,0.00010556459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868774,0.00006668985,0.00024935094,0.00025144647,0.00034395177,0.0004008047],"domain_scores_gemma":[0.99887234,0.00011298187,0.0000844601,0.0006716879,0.00010555418,0.0001529605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047397742,0.00014160357,0.00017447813,0.00018717736,0.00008760868,0.000032156306,0.0005749426,0.000066459,0.00002004615],"category_scores_gemma":[0.000055167086,0.00012164316,0.0000926556,0.000660722,0.00007553251,0.00032950225,0.0001503406,0.0001330341,0.00020635335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025468078,0.00029207987,0.006507732,0.000010188713,0.000005131298,0.0000011047049,0.00032025992,0.000006090337,0.0013500089,0.9887069,0.0023103845,0.0004876027],"study_design_scores_gemma":[0.00046604546,0.00016134538,0.005402204,0.00002537973,0.0000066520047,0.0000052436953,0.000009691042,0.00021443708,0.005826567,0.9874007,0.00031522082,0.00016651613],"about_ca_topic_score_codex":0.000022270664,"about_ca_topic_score_gemma":2.5560342e-7,"teacher_disagreement_score":0.009826024,"about_ca_system_score_codex":0.000013875075,"about_ca_system_score_gemma":0.000027654829,"threshold_uncertainty_score":0.49604642},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9748277,0.0005153622,0.00045453163,0.00030546793,0.0017484404,0.00017978628,0.0000027465585,0.00016155903,0.021804415],"genre_scores_gemma":[0.9964221,0.00002437274,0.0018029873,0.00015976171,0.000010818073,0.000007720209,0.000003201274,0.000021587937,0.001547453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991667,0.00009935911,0.00016689909,0.00019082139,0.00013216499,0.00024402124],"domain_scores_gemma":[0.99912816,0.0003012618,0.0000673763,0.00026936384,0.00006237894,0.0001714525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035285298,0.00013007373,0.00020995103,0.000042946824,0.000083754545,0.000013294254,0.00013141538,0.00012556897,0.0000439841],"category_scores_gemma":[0.0005348914,0.000121750396,0.00003095166,0.00012071111,0.00013103624,0.00012500824,0.00009300746,0.00018487469,0.00009909949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032991557,0.000075436896,0.0024913715,0.0000129895325,0.000021141415,0.00002421726,0.0005133223,4.6941193e-7,0.0000120322,0.98352975,0.012876627,0.00040963865],"study_design_scores_gemma":[0.0012571522,0.000063045154,0.00017270847,0.000009126515,0.00002325125,0.000031505417,0.00020344472,0.000023456256,0.00021806746,0.9932766,0.004580216,0.00014145851],"about_ca_topic_score_codex":0.000005970711,"about_ca_topic_score_gemma":0.0000015656526,"teacher_disagreement_score":0.021594405,"about_ca_system_score_codex":0.000039516966,"about_ca_system_score_gemma":0.00003491143,"threshold_uncertainty_score":0.49648368},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81577754,0.0012674361,0.03662459,0.0040333704,0.0047684372,0.001062282,0.000006512628,0.0017217669,0.13473804],"genre_scores_gemma":[0.99429864,0.00003470984,0.004286651,0.00042877466,0.0000043708114,0.000008641693,0.0000020312268,0.0000105024465,0.0009256805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982024,0.00010806348,0.00019723471,0.00045439467,0.0004712694,0.0005666288],"domain_scores_gemma":[0.9984939,0.00011696877,0.00006291362,0.0010244151,0.000118956035,0.00018280772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041218108,0.00016557462,0.00018920856,0.00018826094,0.0001982023,0.00015714101,0.0014467062,0.00006774555,0.000042721807],"category_scores_gemma":[0.0000637575,0.00016414975,0.00008787613,0.0010967614,0.000061645456,0.0008255609,0.00019307068,0.0002494182,0.00030345903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001159847,0.000105046594,0.00033306246,0.0000025999095,0.00000828205,0.00002594601,0.000082266364,0.0000161532,0.0012697246,0.9904182,0.0028748834,0.004852238],"study_design_scores_gemma":[0.0006091445,0.00020692991,0.0023537183,0.000008931309,0.0000018863923,0.000007729898,0.000009033641,0.00079619203,0.0064625097,0.9840047,0.005341914,0.00019736197],"about_ca_topic_score_codex":0.000007002447,"about_ca_topic_score_gemma":6.9452847e-7,"teacher_disagreement_score":0.17852108,"about_ca_system_score_codex":0.000054018266,"about_ca_system_score_gemma":0.00006113129,"threshold_uncertainty_score":0.6693833},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9725523,0.000107879045,0.0017177719,0.00001574935,0.001152434,0.0001603244,0.0000010593856,0.0004293378,0.02386316],"genre_scores_gemma":[0.9988328,0.0000038483718,0.0008315422,0.000032694436,0.000008143835,0.000034590954,0.0000031130978,0.00004165452,0.00021160427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992185,0.00006794152,0.00014936084,0.00016305885,0.00011166873,0.000289451],"domain_scores_gemma":[0.99938166,0.000097200864,0.000025642485,0.00036954257,0.000028163242,0.00009779509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002918115,0.00016024958,0.00019000348,0.000059415728,0.000070236616,0.00004944098,0.000196906,0.00007840096,0.000015627744],"category_scores_gemma":[0.000013938017,0.00013957199,0.000042528183,0.00019231871,0.00003743167,0.0000833887,0.000013945317,0.00014148762,0.00011508502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053226668,0.000049345705,0.0031295563,0.00010630342,0.00010988455,0.000013970426,0.00039388743,0.0058788443,0.002094405,0.9843703,0.002625751,0.0011745497],"study_design_scores_gemma":[0.00462679,0.0010304198,0.0025757952,0.0002857201,0.00011131352,0.00005953311,0.00023177918,0.011975198,0.04379364,0.8803325,0.053509388,0.0014678695],"about_ca_topic_score_codex":0.000019918281,"about_ca_topic_score_gemma":0.000009185256,"teacher_disagreement_score":0.10403772,"about_ca_system_score_codex":0.000023609835,"about_ca_system_score_gemma":0.0000069845887,"threshold_uncertainty_score":0.5691581},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8861669,0.00011850298,0.00000527943,0.015107317,0.0017253557,0.0006375121,0.0000026647785,0.000026635618,0.09620989],"genre_scores_gemma":[0.98769253,0.000008137521,0.00000901104,0.0030782116,0.000008522375,0.000102538885,7.2856e-7,0.000008782733,0.00909153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788815,0.00069972215,0.00029765946,0.00031582703,0.0005935643,0.00020507483],"domain_scores_gemma":[0.98957604,0.009135332,0.00012646044,0.0009193636,0.00016748252,0.00007534612],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0042322995,0.00012340165,0.0002217607,0.000050006143,0.0006639455,0.0010937172,0.0015200215,0.000058831556,0.0013579037],"category_scores_gemma":[0.003928979,0.000050626255,0.00007157725,0.00035532957,0.0004498129,0.00031292974,0.00046784224,0.000232617,0.0031075517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004419416,0.000026027335,0.0005966453,3.0511214e-7,0.0000110149995,8.868918e-7,0.00041687812,0.0000010940464,0.000004896789,0.8218027,0.1717433,0.005352054],"study_design_scores_gemma":[0.001006267,0.00005561148,0.007604911,0.0000055294786,0.000006562229,0.0000045229913,0.0010623512,0.00011542476,0.000023348512,0.9755855,0.014450372,0.00007959208],"about_ca_topic_score_codex":0.00013376983,"about_ca_topic_score_gemma":0.000008947499,"teacher_disagreement_score":0.15729293,"about_ca_system_score_codex":0.000012917137,"about_ca_system_score_gemma":0.00002991885,"threshold_uncertainty_score":0.99994326},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99118054,0.000013841119,0.00016945458,0.00055628817,0.0002135407,0.00036486884,0.0000113790275,0.000050827322,0.007439264],"genre_scores_gemma":[0.99922174,0.0000069683324,0.00038154246,0.00014070453,0.0000075991666,0.00005843932,0.0000049541745,0.000015533715,0.00016249178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990409,0.00020360222,0.0002477939,0.00018116375,0.00018645273,0.00014007531],"domain_scores_gemma":[0.99746156,0.0016195544,0.00012889395,0.00063467934,0.000111676825,0.000043638316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006799442,0.00012659079,0.00016684252,0.00007403446,0.0002812651,0.000030809817,0.0003732132,0.00006472892,0.0000644458],"category_scores_gemma":[0.00052339846,0.00008612978,0.000089473055,0.00039139795,0.0001729912,0.00006321378,0.00004492975,0.00016361043,0.000046803434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012523376,0.0003170736,0.0002461588,0.000008259848,0.00003443115,9.406023e-8,0.0006269152,0.000005687503,0.0005842943,0.9964918,0.0014889368,0.00018385793],"study_design_scores_gemma":[0.00031973305,0.00012380975,0.0015151185,0.00002151228,0.000026604139,5.007184e-7,0.0002145824,0.00013596608,0.006566678,0.9898631,0.0011115216,0.00010087441],"about_ca_topic_score_codex":0.000011135892,"about_ca_topic_score_gemma":0.0000059636895,"teacher_disagreement_score":0.008041231,"about_ca_system_score_codex":0.000012174705,"about_ca_system_score_gemma":0.000017443896,"threshold_uncertainty_score":0.35122707},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88656014,0.00029428737,0.050313413,0.0059862286,0.0008027947,0.0011445938,0.00017385879,0.00015535676,0.054569345],"genre_scores_gemma":[0.9970556,0.00000188652,0.00059900666,0.0002783253,0.000029530715,0.000057527865,0.000021880096,0.000009757068,0.0019464825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993231,0.000023508623,0.00016635102,0.00017572274,0.00012135309,0.00018995673],"domain_scores_gemma":[0.9992788,0.000248682,0.00008614077,0.0002730264,0.00005317927,0.000060159935],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000090138674,0.00013167883,0.00014374388,0.000013143538,0.00020630176,0.00003989085,0.00022309128,0.000024230618,0.0011934747],"category_scores_gemma":[0.000015573993,0.00008689384,0.000051665236,0.00022332037,0.000049376864,0.000057145844,0.000021401669,0.00014871341,0.0001319724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006426447,0.0001270119,0.0000024260653,0.000001542345,0.000011507991,6.446976e-8,0.000043791762,0.000048829446,0.00010396347,0.9868871,0.011592555,0.0011747908],"study_design_scores_gemma":[0.00034646608,0.00004570066,0.0000036673518,0.000009922818,0.000009480507,1.3147665e-7,0.000052046802,0.00043639124,0.00068270083,0.98735374,0.010942098,0.00011764011],"about_ca_topic_score_codex":0.0000033495285,"about_ca_topic_score_gemma":1.3572281e-7,"teacher_disagreement_score":0.110495485,"about_ca_system_score_codex":0.00000909772,"about_ca_system_score_gemma":0.000016223286,"threshold_uncertainty_score":0.99971956},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938173,0.00031732637,0.0022363572,0.0002646357,0.0004062052,0.00016387244,0.0000012437109,0.00009282246,0.002700211],"genre_scores_gemma":[0.9979023,0.000032205553,0.0019667551,0.000031899708,0.0000031916425,0.0000058224537,4.898454e-7,0.0000050651915,0.000052316307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998879,0.00007160559,0.00018224955,0.00029024636,0.00026892082,0.00030793928],"domain_scores_gemma":[0.9991842,0.000107552885,0.000065210974,0.00043548417,0.00008893655,0.00011862552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030296794,0.000110784866,0.00018200523,0.00012333461,0.000096041396,0.00004896401,0.0005841207,0.00004772399,0.0000044066633],"category_scores_gemma":[0.00006116358,0.000108117456,0.000045148976,0.0004609139,0.00013661994,0.00042044066,0.00017592596,0.00014692676,0.0000057298143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014472317,0.000069301626,0.002101817,0.0000055069686,0.000008040551,0.000006505903,0.0001636111,0.000007184686,0.001557872,0.9892227,0.00008160955,0.0067613604],"study_design_scores_gemma":[0.0005710606,0.0004174701,0.009393839,0.000014701278,0.0000032085104,0.000004373576,0.000025122252,0.001347034,0.017340316,0.970368,0.0003919846,0.00012288068],"about_ca_topic_score_codex":0.0000045877878,"about_ca_topic_score_gemma":4.7126326e-7,"teacher_disagreement_score":0.01885471,"about_ca_system_score_codex":0.000015698988,"about_ca_system_score_gemma":0.000033681867,"threshold_uncertainty_score":0.4408902},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990656,0.0009577607,0.00007204976,0.0021846534,0.0034351824,0.00020998009,4.1349344e-7,0.0005195586,0.0019644129],"genre_scores_gemma":[0.9958816,0.00004110655,0.0026782465,0.001118895,0.000001483613,0.000033895176,0.0000015719983,0.000010769443,0.00023242076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987599,0.00005161146,0.00021320497,0.00035412723,0.0002700752,0.00035108533],"domain_scores_gemma":[0.99889034,0.00005251142,0.00005158758,0.00070433057,0.00012907063,0.00017214417],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017289385,0.00014559881,0.00014983559,0.00013412992,0.00014653201,0.00020803991,0.0007710489,0.00006588485,0.000042908625],"category_scores_gemma":[0.000024252005,0.00012790556,0.00007969979,0.00045650345,0.00006055889,0.0009146879,0.0002188484,0.00014702715,0.0014616506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.780812e-7,0.00006039446,0.00077089376,0.0000038767816,0.000008211798,0.000004045908,0.000093172646,0.0000029453017,0.0017009352,0.98215264,0.013676809,0.0015257988],"study_design_scores_gemma":[0.0003947386,0.000062758765,0.0020648874,0.000009814239,0.0000027701728,0.0000075933203,0.0000063426737,0.0023234684,0.0013697252,0.9930531,0.0005264162,0.00017843483],"about_ca_topic_score_codex":0.000099346056,"about_ca_topic_score_gemma":3.0040405e-7,"teacher_disagreement_score":0.013150393,"about_ca_system_score_codex":0.000013080114,"about_ca_system_score_gemma":0.00003071159,"threshold_uncertainty_score":0.9993158},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9865573,0.00012864756,0.000101209414,0.0010132557,0.00082971266,0.00037289652,0.0000038997478,0.00005445114,0.010938617],"genre_scores_gemma":[0.99630064,0.000057500758,0.0029169843,0.00003535789,0.0000107712385,0.000026000233,4.849537e-7,0.00002770637,0.00062455697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989429,0.0000973227,0.00032229966,0.00016822664,0.00022387886,0.000245352],"domain_scores_gemma":[0.9947369,0.0044147484,0.0001729114,0.00051094947,0.00008757183,0.0000769195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010269735,0.00017176024,0.00032417016,0.000017335231,0.00024497058,0.000055850924,0.00028277485,0.00008846414,0.000017043089],"category_scores_gemma":[0.002656049,0.000090207526,0.00006486774,0.00011455446,0.0016420524,0.00011037959,0.00019021203,0.00039839634,0.00000534994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060421873,0.000035546633,0.00039267764,0.000050767045,0.00004058232,9.241138e-7,0.0012789747,3.3046668e-8,0.00015617089,0.99686444,0.00063209975,0.0004873598],"study_design_scores_gemma":[0.0011810377,0.000025872983,0.00009118583,0.000027976585,0.00004462765,0.000017234406,0.0012826021,0.000056958903,0.0010864612,0.99490774,0.0011677104,0.000110592824],"about_ca_topic_score_codex":0.000030680483,"about_ca_topic_score_gemma":0.000073424635,"teacher_disagreement_score":0.01031406,"about_ca_system_score_codex":0.000010489978,"about_ca_system_score_gemma":0.000020750222,"threshold_uncertainty_score":0.60502106},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9213066,0.00028620544,0.055678044,0.00016789071,0.00096551434,0.0006534892,0.000005681646,0.00034939573,0.02058715],"genre_scores_gemma":[0.9872902,0.000021401886,0.0124381725,0.00004623484,0.0000027249368,0.000030221237,0.000001272846,0.000031301846,0.0001384606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977405,0.00018706809,0.00031803636,0.0005437016,0.00060648005,0.000604236],"domain_scores_gemma":[0.99775517,0.0001404067,0.0001981361,0.0014007344,0.00027532285,0.00023024886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004619216,0.0002526362,0.00033351558,0.00038043756,0.00013255527,0.000038240178,0.0021471959,0.00011060478,0.00004247444],"category_scores_gemma":[0.00004547371,0.00021799297,0.00010421672,0.0014636179,0.00034255837,0.000640452,0.00054544606,0.00035299742,0.000048571295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008500102,0.00024494933,0.029216602,0.000020741592,0.00006967652,0.00008583052,0.00071173516,0.0000046150917,0.00030671404,0.9507662,0.00012165509,0.018366296],"study_design_scores_gemma":[0.0011341149,0.00053321465,0.022360021,0.00003771367,0.000008449483,0.000026978061,0.00007555008,0.00038093902,0.0068006827,0.9681659,0.00020698889,0.00026945412],"about_ca_topic_score_codex":0.00009360434,"about_ca_topic_score_gemma":0.00002449659,"teacher_disagreement_score":0.06598358,"about_ca_system_score_codex":0.000043849515,"about_ca_system_score_gemma":0.000119470154,"threshold_uncertainty_score":0.8889496},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98839635,0.00004826673,0.0011361459,0.00067752495,0.0029156194,0.00007065871,2.4963362e-7,0.000101662685,0.006653504],"genre_scores_gemma":[0.9971615,0.0000028730071,0.0024927189,0.000225988,8.2956643e-7,0.000002974132,1.7815618e-7,0.000005492433,0.000107464846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912846,0.00008773254,0.00018029596,0.00019051788,0.00024877468,0.00016423399],"domain_scores_gemma":[0.9989528,0.000092819115,0.000100099176,0.00070566125,0.00010097229,0.000047658512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041386098,0.000080649756,0.00011420524,0.00003576236,0.00012022049,0.000036633566,0.00077935006,0.000041988158,0.000006384355],"category_scores_gemma":[0.00007679327,0.00005551747,0.000087340646,0.00052128825,0.000063333515,0.000111439185,0.00022776685,0.00010458558,0.000038822935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.437477e-7,0.00003180066,0.0077356556,0.0000050224694,0.000005292893,1.705517e-7,0.00010953079,0.000019603747,0.00055856904,0.9900079,0.000840681,0.00068522873],"study_design_scores_gemma":[0.00029599905,0.000017242664,0.0022946321,0.000023450839,0.0000039236593,0.0000042183356,0.0000039655224,0.002255462,0.0041727163,0.9902487,0.0006037886,0.00007590481],"about_ca_topic_score_codex":0.00003029873,"about_ca_topic_score_gemma":8.197337e-7,"teacher_disagreement_score":0.008765113,"about_ca_system_score_codex":0.00000511472,"about_ca_system_score_gemma":0.000021499829,"threshold_uncertainty_score":0.22639367},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9860258,0.0002076755,0.0052398136,0.002336655,0.00083709514,0.0001503813,0.0000010845083,0.00039878776,0.0048027113],"genre_scores_gemma":[0.99715906,0.0000073158394,0.0012728814,0.001255273,0.000008285932,0.0000042615447,0.0000017801659,0.000005633641,0.00028547834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990198,0.000045754936,0.00011958722,0.00028952866,0.00023734626,0.00028799433],"domain_scores_gemma":[0.9990606,0.00034272176,0.00010151209,0.0003565744,0.000056957124,0.000081677026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010225335,0.00014312999,0.00016710475,0.00005011514,0.00011637951,0.00013918322,0.00050092174,0.00006954087,0.000022788863],"category_scores_gemma":[0.00015137995,0.000112239104,0.000039540493,0.0004228502,0.000021757374,0.00050022115,0.00005974453,0.00015404998,0.000028092218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011722012,0.00014513786,0.003242195,0.0000026221592,0.00002294033,0.000055750388,0.00033579374,0.00006654955,0.00011425657,0.99191993,0.000908902,0.0031741867],"study_design_scores_gemma":[0.0013367541,0.0013052693,0.07395672,0.000070158276,0.00001487309,0.0000044907288,0.00001809657,0.0048107766,0.0012120001,0.9152982,0.0015588396,0.0004137767],"about_ca_topic_score_codex":0.0000060567854,"about_ca_topic_score_gemma":0.0000064902547,"teacher_disagreement_score":0.0766217,"about_ca_system_score_codex":0.000029338,"about_ca_system_score_gemma":0.000034526718,"threshold_uncertainty_score":0.4576978},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97508764,0.0003273129,0.0026761892,0.00018995143,0.0012431073,0.0003596418,0.0000016616209,0.00026132984,0.019853191],"genre_scores_gemma":[0.98368645,0.000019411267,0.016086377,0.000053555643,0.0000029647556,0.000042488828,5.6702845e-7,0.000016539752,0.00009167505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981541,0.0002309957,0.0003038513,0.00044365608,0.00035210463,0.00051528163],"domain_scores_gemma":[0.99822736,0.00029022933,0.00009239516,0.0011819229,0.000081481354,0.00012658477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010201723,0.00016159365,0.00023923663,0.00042055224,0.00011022465,0.000057977333,0.0023365133,0.000075624666,0.000026864445],"category_scores_gemma":[0.00044280235,0.00016095607,0.000088180976,0.0012527747,0.000117823496,0.0007179563,0.0007336848,0.00029721606,0.000054739205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020885163,0.0001264542,0.0069245906,0.0000066265684,0.000007456129,0.00007099639,0.0014139311,0.0000010883891,0.00033815307,0.9786516,0.00012906227,0.012309201],"study_design_scores_gemma":[0.0016448728,0.00009937408,0.016561303,0.000030360665,0.0000014980988,0.0000069830376,0.00008958166,0.000490915,0.0039432608,0.9768942,0.000051885243,0.0001857498],"about_ca_topic_score_codex":0.000061373255,"about_ca_topic_score_gemma":0.000020794536,"teacher_disagreement_score":0.019761516,"about_ca_system_score_codex":0.000054261684,"about_ca_system_score_gemma":0.00004891503,"threshold_uncertainty_score":0.6563598},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98650765,0.000418931,0.00004120732,0.0000036842482,0.0042767585,0.00008680163,0.0000017981549,0.00016112477,0.008502039],"genre_scores_gemma":[0.9998787,0.000013851101,0.000013689986,0.0000085524625,0.000012808262,0.000017297132,0.000009125995,0.00001974024,0.00002624006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993862,0.000037892616,0.00015421292,0.00006874416,0.00010073367,0.00025223897],"domain_scores_gemma":[0.99973893,0.000029140481,0.000015456953,0.00013227474,0.000011645476,0.00007254121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020732702,0.00009783172,0.000108346845,0.00010244148,0.000025728365,0.000011393188,0.000080568694,0.00007276518,0.000036942216],"category_scores_gemma":[0.000010472995,0.00010258051,0.00003555334,0.00030914493,0.000012910943,0.00022721307,0.000009595713,0.00010956661,0.00007076834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021706294,0.000030623432,0.18621483,0.000017856031,0.000009157008,9.945453e-7,0.0003146977,0.00008353871,0.0009261975,0.81195587,0.00021329362,0.00023077437],"study_design_scores_gemma":[0.0010510627,0.000034013745,0.36886683,0.0000573391,0.000013248387,0.000010647366,0.00017108952,0.000543887,0.0037534027,0.6168077,0.008185511,0.00050526223],"about_ca_topic_score_codex":0.000003848189,"about_ca_topic_score_gemma":0.0000025669278,"teacher_disagreement_score":0.19514814,"about_ca_system_score_codex":0.000030453968,"about_ca_system_score_gemma":0.0000037969262,"threshold_uncertainty_score":0.41831118},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96556437,0.00044229397,0.019156119,0.00086008344,0.004015722,0.0007482334,0.0000067918077,0.00009454459,0.009111841],"genre_scores_gemma":[0.99872446,0.000050388702,0.0009840507,0.000023407838,0.00001361382,0.000025243266,5.012419e-7,0.000009928266,0.00016840949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836177,0.00015838604,0.00035234005,0.00027265344,0.00051152025,0.0003433488],"domain_scores_gemma":[0.9977599,0.00059748907,0.00018655384,0.00094899785,0.0004159156,0.00009113741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046797667,0.00013238183,0.00023633179,0.00008978101,0.00013090658,0.000040146308,0.0016848197,0.000057417026,0.00002136617],"category_scores_gemma":[0.00026231323,0.00009540724,0.00011603324,0.0009331466,0.00045022045,0.00037907093,0.00037084435,0.00026065085,0.000036298043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019275843,0.00008827708,0.0013541474,0.000011230878,0.000019749015,0.0000015010783,0.00020131777,0.000006092294,0.00080578506,0.9922429,0.0012029556,0.004046799],"study_design_scores_gemma":[0.00037435966,0.00013393904,0.0039948015,0.000020121486,0.000002527272,9.915957e-7,0.00004309545,0.0035670537,0.007217949,0.9825928,0.0019477704,0.00010454304],"about_ca_topic_score_codex":0.00003739011,"about_ca_topic_score_gemma":0.000008238135,"teacher_disagreement_score":0.033160087,"about_ca_system_score_codex":0.000036152673,"about_ca_system_score_gemma":0.00006735271,"threshold_uncertainty_score":0.38905942},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9964306,0.000049879684,0.00012615389,0.00054552517,0.0012576875,0.0003244688,0.0000014117803,0.0001407755,0.0011235393],"genre_scores_gemma":[0.99846345,0.0000034209372,0.0009775435,0.00045751178,0.0000022048791,0.000043830136,0.0000034091618,0.000016505954,0.00003209361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984436,0.00014401965,0.00034397625,0.00037402706,0.00033444067,0.00035995504],"domain_scores_gemma":[0.9980872,0.00028531568,0.00017879976,0.0011034255,0.00020378051,0.00014145616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045987483,0.00018793628,0.00022311497,0.00005993526,0.00027460553,0.00028439102,0.00096803997,0.00006671467,0.000068181056],"category_scores_gemma":[0.00018710186,0.00012924608,0.00009876525,0.0004438101,0.00010164796,0.0003574962,0.00017601927,0.00018993138,0.00012852794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002548561,0.00027237707,0.0032349045,0.000020497064,0.00002597569,0.0000015180889,0.0007985181,0.0000066214347,0.0049899104,0.98526925,0.00414592,0.0012319573],"study_design_scores_gemma":[0.00048180085,0.00017162343,0.005382712,0.00005992284,0.000009189138,0.000004259485,0.00006595955,0.025681503,0.002539883,0.9653186,0.00009563389,0.00018889403],"about_ca_topic_score_codex":0.0005053641,"about_ca_topic_score_gemma":0.000004443266,"teacher_disagreement_score":0.025674881,"about_ca_system_score_codex":0.00002656091,"about_ca_system_score_gemma":0.00004921065,"threshold_uncertainty_score":0.52705026},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92468303,0.00008370331,0.0000014239491,0.000028865827,0.005173272,0.00013450446,0.000001915875,0.00025882767,0.069634445],"genre_scores_gemma":[0.9994483,0.00001521166,0.000023717801,0.000028774866,0.000009548181,0.000027759299,0.0000051077595,0.00003718777,0.00040440707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910134,0.000021926393,0.0002387684,0.00016497454,0.00014118705,0.0003317921],"domain_scores_gemma":[0.9994262,0.00003785359,0.000025308653,0.00037864735,0.000029461999,0.000102545564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030706404,0.0001644885,0.00019110361,0.00016113381,0.000055528297,0.000037455244,0.00025248586,0.00016822989,0.00009540236],"category_scores_gemma":[0.00002348876,0.00017145312,0.000063107895,0.00044357305,0.000044724846,0.0001821022,0.000024375084,0.0004891046,0.0003604545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007910212,0.000036137306,0.008459454,0.000032782646,0.000014238371,0.000017394837,0.00017523806,0.00017056812,0.007440268,0.98169374,0.0017441104,0.00020814512],"study_design_scores_gemma":[0.00094405457,0.00005316364,0.0056105074,0.000045848978,0.0000075462112,0.00002623064,0.00017060353,0.0011164927,0.0056198393,0.95507723,0.030985145,0.00034334513],"about_ca_topic_score_codex":0.00007691176,"about_ca_topic_score_gemma":0.000102815095,"teacher_disagreement_score":0.07476524,"about_ca_system_score_codex":0.000022627799,"about_ca_system_score_gemma":0.00001824608,"threshold_uncertainty_score":0.6991656},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9922054,0.0006091464,0.00009947384,0.0010385043,0.00075827097,0.00019064888,5.859796e-7,0.0000950631,0.0050029512],"genre_scores_gemma":[0.9968719,0.00006453571,0.002894982,0.00014423579,0.0000036243027,0.000004631217,0.0000011955705,0.0000043346486,0.000010585201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882966,0.00007413255,0.00024522317,0.0003480651,0.00022901785,0.00027391454],"domain_scores_gemma":[0.99917203,0.000041024632,0.00008386001,0.0005815286,0.0000712216,0.00005034209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003619241,0.00013059865,0.00022813378,0.00025278723,0.000046594345,0.00004479171,0.0007124649,0.000059918693,0.0000022078273],"category_scores_gemma":[0.000051973446,0.00011399595,0.00006574783,0.0014417231,0.00005201017,0.00028607994,0.000070110014,0.00013933648,0.0000069307625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053607414,0.0002580713,0.009962322,0.000011245559,0.000005266844,0.00001480664,0.0003354199,0.000010876652,0.00082604116,0.97722757,0.00036863782,0.0109743625],"study_design_scores_gemma":[0.00048671287,0.00037908275,0.14512987,0.000026154126,0.0000028483537,0.0000055977366,0.000008518513,0.0005782116,0.0024880345,0.8505511,0.00018789036,0.0001559564],"about_ca_topic_score_codex":0.000033871584,"about_ca_topic_score_gemma":0.000003536694,"teacher_disagreement_score":0.13516755,"about_ca_system_score_codex":0.00001393886,"about_ca_system_score_gemma":0.000041875253,"threshold_uncertainty_score":0.464862},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9898626,0.00011861877,0.0015109298,0.0007881794,0.000869851,0.00038793258,4.4988755e-7,0.00014729144,0.006314148],"genre_scores_gemma":[0.99770224,0.000009065296,0.0017738742,0.00011599912,0.000002045359,0.000075184245,7.983305e-7,0.000010251865,0.00031055778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985126,0.00012372684,0.00019024218,0.00035857136,0.00038114868,0.0004337059],"domain_scores_gemma":[0.998915,0.00013499359,0.000041379233,0.0006935262,0.000080399775,0.00013467582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003447312,0.00011917317,0.00014465231,0.00021630968,0.00005902868,0.00012028852,0.0011854656,0.000064900596,0.00007737191],"category_scores_gemma":[0.00007000401,0.000114628805,0.000039950788,0.0007082434,0.000052999287,0.0008313012,0.00043561475,0.00027544113,0.0007145202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002217553,0.000092165224,0.010223148,0.0000030201172,0.000004510036,0.000026585602,0.00023323738,0.000018799707,0.00050878926,0.9751139,0.0006915641,0.013082019],"study_design_scores_gemma":[0.0006017101,0.00005523771,0.05866953,0.00000919478,3.9165386e-7,0.000005240414,0.000023225653,0.0030269872,0.0008981025,0.9362821,0.00029375337,0.00013452457],"about_ca_topic_score_codex":0.00009446211,"about_ca_topic_score_gemma":0.000022441933,"teacher_disagreement_score":0.04844638,"about_ca_system_score_codex":0.00008429383,"about_ca_system_score_gemma":0.0000487298,"threshold_uncertainty_score":0.918395},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98894584,0.00003341216,0.00021639281,0.00034259207,0.00026024622,0.00066133105,0.000009960535,0.00021765607,0.009312559],"genre_scores_gemma":[0.9969326,0.000007525237,0.0019670054,0.000093616596,0.0000110377205,0.00032039647,0.000013378926,0.000054766562,0.0005996358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986333,0.00011362832,0.0002599059,0.0003308736,0.00026241137,0.0003998791],"domain_scores_gemma":[0.9985431,0.0002771656,0.00015173809,0.0007051526,0.00014756093,0.00017532396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028707812,0.00025146408,0.0002826109,0.000099969715,0.00031112751,0.00008932985,0.0004002551,0.00009223134,0.0001534731],"category_scores_gemma":[0.000041448297,0.00020591484,0.000097679156,0.00043472767,0.0001451684,0.00021477722,0.000061534374,0.00023838693,0.00028704625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010000951,0.0002959467,0.007680143,0.000026768215,0.00005938851,0.0000042353377,0.00028426156,0.0000024934259,0.00044463895,0.98904014,0.001853714,0.00029827823],"study_design_scores_gemma":[0.0009778246,0.00009175627,0.0030827958,0.000040287156,0.000052843512,0.000011126312,0.00039571992,0.000054396376,0.0018630708,0.9926592,0.00047349473,0.0002974964],"about_ca_topic_score_codex":0.00009408446,"about_ca_topic_score_gemma":0.00005589414,"teacher_disagreement_score":0.008712923,"about_ca_system_score_codex":0.000022434273,"about_ca_system_score_gemma":0.000037409285,"threshold_uncertainty_score":0.83969635},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.988336,0.00049171137,0.00011530171,0.000032306114,0.0017748814,0.0001600886,0.0000026024723,0.00039517155,0.008691907],"genre_scores_gemma":[0.99957854,0.000004350432,0.00013781866,0.000013811352,0.00001965929,0.00003488056,0.000004775425,0.000040353705,0.00016581675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917763,0.000043047785,0.00017831005,0.00015194368,0.0001776263,0.0002714348],"domain_scores_gemma":[0.99945563,0.000016430075,0.000026686672,0.00028329296,0.00006924786,0.00014868246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019550802,0.00015042866,0.00016410007,0.00005524972,0.0001268513,0.00012293248,0.00013343626,0.000057215908,0.000018001003],"category_scores_gemma":[0.000013336158,0.00012746158,0.00003481355,0.0002296883,0.00007301845,0.00023829061,0.000019529087,0.00014462206,0.00016338279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032779123,0.0005637049,0.053332534,0.0005332124,0.00052507076,0.0003271897,0.019580433,0.01602733,0.05201926,0.781817,0.07160594,0.0033405349],"study_design_scores_gemma":[0.01602972,0.0012330983,0.016580932,0.0029018072,0.00021048036,0.00054224144,0.010629431,0.012015835,0.16348264,0.6003882,0.1710723,0.0049133096],"about_ca_topic_score_codex":0.000008659947,"about_ca_topic_score_gemma":0.0000049255445,"teacher_disagreement_score":0.18142879,"about_ca_system_score_codex":0.00007296161,"about_ca_system_score_gemma":0.000024537896,"threshold_uncertainty_score":0.5197732},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9637307,0.0026381656,0.00022765154,0.00015495486,0.012339068,0.0005231175,0.00003355444,0.00073542586,0.019617347],"genre_scores_gemma":[0.99946314,0.00003590587,0.000049567436,0.000104711704,0.000043126187,0.000027665808,0.000009117222,0.00002418532,0.00024259143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921775,0.000017618691,0.00020806675,0.00014790284,0.00010797943,0.00030069702],"domain_scores_gemma":[0.999529,0.00006203067,0.000025393674,0.0002589531,0.000036191002,0.00008844497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018784759,0.00015880239,0.00021707315,0.000058660124,0.00009034291,0.00004471923,0.0001618583,0.00009890454,0.00002323223],"category_scores_gemma":[0.000012589012,0.00015708985,0.00010108612,0.00012006272,0.00003610943,0.000146732,0.0000069295847,0.00010055727,0.000048352813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018969698,0.00004381071,0.00005806668,0.000024294655,0.000034277706,0.000007291466,0.00007749159,0.00003894682,0.0024860876,0.9859487,0.010827147,0.00043492758],"study_design_scores_gemma":[0.0009825577,0.0001561629,0.00016438568,0.0000351896,0.000018445051,0.0000071533964,0.000023686054,0.0009684658,0.0042724432,0.95455384,0.038563445,0.00025425016],"about_ca_topic_score_codex":0.0000010061608,"about_ca_topic_score_gemma":5.0616774e-7,"teacher_disagreement_score":0.035732415,"about_ca_system_score_codex":0.000044800887,"about_ca_system_score_gemma":0.0000132140985,"threshold_uncertainty_score":0.6405938},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9837986,0.00015198304,0.000024450312,0.00030828427,0.0003845966,0.00016027901,0.0000031978063,0.000051867726,0.015116732],"genre_scores_gemma":[0.9994487,0.000008940013,0.00011428416,0.000021806829,0.000003534087,0.000029573093,0.0000012189128,0.0000095376445,0.0003623719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994261,0.000054937966,0.00017336375,0.000082580926,0.00014953541,0.00011347987],"domain_scores_gemma":[0.99896824,0.00038012723,0.000093876406,0.00040894223,0.000087013985,0.00006180688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043831574,0.000066035485,0.00010106278,0.000026543139,0.00010156378,0.000014086878,0.00026407937,0.000039849492,0.000005803388],"category_scores_gemma":[0.00018656156,0.000045920424,0.000054907945,0.00022008092,0.00011950472,0.00004901761,0.000046673722,0.0000869122,0.000017678085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010230586,0.00008032384,0.0020449953,0.000005386844,0.000017838678,3.482044e-7,0.00022576671,2.1392393e-7,0.000059226182,0.9857615,0.011455989,0.00033818532],"study_design_scores_gemma":[0.00025519473,0.000026289386,0.0007690966,0.0000070414944,0.00001108782,0.0000013413465,0.00019851576,0.000015072837,0.0014088417,0.9901809,0.007072624,0.00005397143],"about_ca_topic_score_codex":0.0000058614496,"about_ca_topic_score_gemma":0.0000022565978,"teacher_disagreement_score":0.015650123,"about_ca_system_score_codex":0.0000072574967,"about_ca_system_score_gemma":0.000030312682,"threshold_uncertainty_score":0.18725805},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97884786,0.00067313283,0.007853006,0.00028346106,0.0018936644,0.0004057317,0.0000058536502,0.00043554173,0.0096017765],"genre_scores_gemma":[0.99175245,0.00000935391,0.007824666,0.0001673798,0.000007886133,0.00003512344,0.0000030176518,0.000024584062,0.00017554668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977775,0.0001690667,0.00020158532,0.000397929,0.00057775725,0.0008761545],"domain_scores_gemma":[0.9982172,0.00022999826,0.00008528028,0.00095161225,0.00013589134,0.00037997193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048898143,0.00023019263,0.00024778245,0.0001879066,0.0002406549,0.000104201674,0.0012358197,0.00006631426,0.000031576186],"category_scores_gemma":[0.00003905922,0.00019402053,0.0000757019,0.001066488,0.00020168736,0.0012128508,0.00035928315,0.00027897416,0.00032272466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027959592,0.00014181674,0.014472147,0.0000071529644,0.000030474845,0.000014079685,0.00034041776,0.0000024997555,0.0006872922,0.98187584,0.0012885056,0.001111818],"study_design_scores_gemma":[0.0015080945,0.000475122,0.01986148,0.000031329197,0.000011085739,0.000075623946,0.000057879708,0.00087956386,0.0033524416,0.9628829,0.01030145,0.0005630295],"about_ca_topic_score_codex":0.000008276852,"about_ca_topic_score_gemma":0.0000017763414,"teacher_disagreement_score":0.018992936,"about_ca_system_score_codex":0.00005273255,"about_ca_system_score_gemma":0.000060084767,"threshold_uncertainty_score":0.79119277},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9973398,0.000057365298,0.000009111883,0.00011566475,0.0010882257,0.000077520555,0.0000012766388,0.000010207725,0.0013008576],"genre_scores_gemma":[0.99972314,0.0000078318535,0.00012973291,0.00004760539,0.000025457932,0.0000035359362,0.000005715247,0.00000568376,0.000051296833],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999363,0.000055778088,0.00016561625,0.00017743495,0.000077136174,0.00016102359],"domain_scores_gemma":[0.9994201,0.000059747766,0.000075033146,0.00033432004,0.000070285154,0.000040533774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004494944,0.000080074395,0.000087202665,0.0000067336505,0.00013541369,0.000016271197,0.00026997266,0.00011804157,0.0000058407027],"category_scores_gemma":[0.00024608112,0.000049861785,0.00006592612,0.00005323058,0.00009364664,0.0000014618713,0.00017015723,0.000170124,0.0000034900288],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001906819,0.00004116173,0.004637307,0.0000034042162,0.00001079411,3.556991e-7,0.000014098311,3.878395e-7,0.95357287,0.037582144,0.00013779488,0.0039806175],"study_design_scores_gemma":[0.00048011748,0.00039601797,0.05484357,0.0000064828537,0.000008627654,0.000006731046,0.00007802917,0.000021875814,0.7400234,0.19362397,0.010305389,0.00020582869],"about_ca_topic_score_codex":0.000017563769,"about_ca_topic_score_gemma":0.000015847958,"teacher_disagreement_score":0.21354951,"about_ca_system_score_codex":0.0000025519898,"about_ca_system_score_gemma":0.000026337093,"threshold_uncertainty_score":0.20333046},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937422,0.0006524249,0.0002976128,0.00040629387,0.0030539758,0.000116043426,0.0000018406613,0.00018548843,0.0015441064],"genre_scores_gemma":[0.9915814,0.000006738997,0.008054311,0.00012791532,0.0000018628391,0.000004203838,0.0000030128747,0.00001303038,0.00020757043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838996,0.000090579524,0.0003531363,0.00035542832,0.00048142532,0.0003294434],"domain_scores_gemma":[0.99847245,0.00010613824,0.00010838452,0.00067841326,0.00040286707,0.00023173064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007019014,0.00015938368,0.00025233105,0.00014183325,0.000062603984,0.00007175283,0.00062202977,0.00007956502,0.000008250515],"category_scores_gemma":[0.00018906413,0.00014899993,0.00007707925,0.00058925874,0.00007752521,0.0003811578,0.00030765595,0.00015366366,0.00010707091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074553654,0.0001482503,0.002776705,0.0000129739365,0.00002205741,0.000010989277,0.0009549792,0.00014644235,0.0050843,0.984589,0.005621278,0.00062559993],"study_design_scores_gemma":[0.0016290646,0.0002463137,0.00045783824,0.000043481377,0.000012955905,0.000015616219,0.00009174586,0.005214371,0.011370679,0.9802785,0.00037193767,0.00026751898],"about_ca_topic_score_codex":0.00011125478,"about_ca_topic_score_gemma":0.0000019342122,"teacher_disagreement_score":0.0077566984,"about_ca_system_score_codex":0.00003201438,"about_ca_system_score_gemma":0.0001550667,"threshold_uncertainty_score":0.6076041},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96254253,0.0006470348,0.000106682404,0.0016381221,0.010296478,0.0003404409,0.0000075522184,0.0011599533,0.023261221],"genre_scores_gemma":[0.9958837,0.000030739935,0.0030842468,0.0007260985,0.0000030199938,0.000013212836,0.0000037816899,0.000018319697,0.00023685991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801815,0.00009824391,0.00037098027,0.0006335238,0.00042537777,0.00045370823],"domain_scores_gemma":[0.9981595,0.00007785818,0.00014875428,0.001273339,0.00011852066,0.00022198175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047903197,0.00023191444,0.00022362739,0.00023821091,0.00020505325,0.00009065841,0.0010561735,0.000119771496,0.000009528304],"category_scores_gemma":[0.00006651929,0.00020628335,0.00012269901,0.0005906893,0.000077406534,0.00043821344,0.00021693754,0.00022686138,0.00036474768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025880569,0.0002632745,0.00014201012,0.0000039830843,0.000021116173,0.000033732496,0.00046046608,0.0000034079194,0.0002900007,0.99329513,0.0042390344,0.0012219647],"study_design_scores_gemma":[0.0014508324,0.00045328928,0.0035638898,0.00003586491,0.000007774931,0.0000062787435,0.000007227802,0.0003988491,0.008542742,0.9847531,0.0005085176,0.00027166345],"about_ca_topic_score_codex":0.00009104495,"about_ca_topic_score_gemma":0.0000011227639,"teacher_disagreement_score":0.033341207,"about_ca_system_score_codex":0.000022273054,"about_ca_system_score_gemma":0.0000478125,"threshold_uncertainty_score":0.8411991},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99491024,0.000025755266,0.00010473414,0.000062963874,0.00021594367,0.00017032695,0.000060520626,0.000018608594,0.0044309176],"genre_scores_gemma":[0.9996099,0.0000012761055,0.00030154313,0.0000120648065,0.000002387601,0.000018611332,0.000015685451,0.000008342448,0.000030196397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993303,0.00007752558,0.00020638476,0.00011247456,0.00017984312,0.0000935004],"domain_scores_gemma":[0.9987812,0.00047551846,0.00018598571,0.00025680347,0.00023619202,0.00006431751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034447835,0.00007362098,0.00021122384,0.000048551356,0.000029584584,0.0000027348478,0.00013546502,0.000057355417,0.000039859064],"category_scores_gemma":[0.00045723756,0.00007406111,0.00006424274,0.00016987194,0.00013451905,0.000054729982,0.000029759836,0.00007253307,0.000011981134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020709535,0.00033906745,0.0016716917,0.000027953802,0.000044895023,8.814879e-7,0.0004250829,9.974823e-7,0.0011655556,0.9936946,0.0025706731,0.00003788787],"study_design_scores_gemma":[0.0008146749,0.00007572455,0.0027144228,0.000025480005,0.00003272526,0.0000049021196,0.00021534092,0.000013644264,0.013684079,0.9821813,0.00016585077,0.00007185062],"about_ca_topic_score_codex":0.000010764278,"about_ca_topic_score_gemma":0.0000019586735,"teacher_disagreement_score":0.012518524,"about_ca_system_score_codex":0.00001986006,"about_ca_system_score_gemma":0.000065933884,"threshold_uncertainty_score":0.3020124},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.875129,0.00060124433,0.062507,0.0098079145,0.0052702134,0.00063226477,0.000007278509,0.0025393476,0.043505754],"genre_scores_gemma":[0.99181205,0.000015968586,0.0066592903,0.0014043633,0.000016665526,0.0000080746595,0.0000023928849,0.00000864019,0.00007254873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851817,0.00012482441,0.00022332538,0.00043236863,0.00031879498,0.00038254334],"domain_scores_gemma":[0.99886,0.00010950782,0.00008381874,0.00070769154,0.00007544595,0.00016352603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004869936,0.00018919345,0.00019174846,0.00013493995,0.00021900526,0.00019513874,0.001090431,0.00009206641,0.000024451347],"category_scores_gemma":[0.000018241702,0.00018426728,0.00012942319,0.00070408673,0.00003563402,0.00043412624,0.00016916283,0.00022123032,0.000101726175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012236944,0.00022532283,0.00023662814,0.0000031165828,0.000026054193,0.000025359544,0.00030443165,0.00001270318,0.00021675637,0.995172,0.0011249528,0.0026404045],"study_design_scores_gemma":[0.0007583864,0.00022750816,0.00682067,0.000014152006,0.000011450191,0.00002758626,0.000009855817,0.0012934628,0.00044072722,0.983368,0.0067693326,0.00025889938],"about_ca_topic_score_codex":0.0000026735183,"about_ca_topic_score_gemma":0.000002135095,"teacher_disagreement_score":0.11668308,"about_ca_system_score_codex":0.000038541446,"about_ca_system_score_gemma":0.0000918848,"threshold_uncertainty_score":0.75142014},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9729799,0.000466541,0.0024821756,0.004204714,0.0073891883,0.00024035912,0.0000019149757,0.0010868288,0.011148399],"genre_scores_gemma":[0.98816663,0.000025450689,0.008896566,0.0025517493,0.0000021295975,0.0000122169595,0.0000018477806,0.000017804647,0.00032559954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983105,0.00010396897,0.00028213728,0.0005406544,0.000344802,0.00041792693],"domain_scores_gemma":[0.9985227,0.00012818909,0.00011145125,0.0008876923,0.00016612493,0.000183848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006636655,0.00018949038,0.00022165364,0.00017265798,0.0002476599,0.0001755285,0.00080996676,0.000099023826,0.000016170654],"category_scores_gemma":[0.00010568889,0.00017242231,0.00011472039,0.00063663156,0.000055984343,0.00029803297,0.00023133974,0.00020286538,0.00040464808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016817495,0.000057711262,0.0014252008,0.000008098244,0.000015329273,0.0000040229206,0.00028932322,0.0000032295281,0.0009832586,0.97138387,0.0177764,0.008051878],"study_design_scores_gemma":[0.0006455988,0.00011888587,0.00045994806,0.00002722355,0.000008064405,0.000015302297,0.0000065151457,0.0035218596,0.0032623673,0.9834999,0.008176377,0.00025798677],"about_ca_topic_score_codex":0.000041643438,"about_ca_topic_score_gemma":0.0000011162157,"teacher_disagreement_score":0.015186757,"about_ca_system_score_codex":0.000016572107,"about_ca_system_score_gemma":0.000029777948,"threshold_uncertainty_score":0.7031178},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98856705,0.0001691733,0.0000018593043,0.000008748583,0.0012758307,0.00016981704,0.0000019218094,0.00010220692,0.00970338],"genre_scores_gemma":[0.9998859,0.000007022185,0.000007765902,0.000010602168,0.0000019283477,0.000038770017,0.0000020543525,0.000021515525,0.000024399655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992911,0.000056781937,0.00024195714,0.000099843965,0.00012190668,0.0001883602],"domain_scores_gemma":[0.99954236,0.00009554429,0.000028251778,0.00026452093,0.000021642461,0.000047703496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018555176,0.0001161293,0.00023052866,0.00013829624,0.000021596998,0.00001276138,0.00015521588,0.000074734824,0.000046263096],"category_scores_gemma":[0.000012261606,0.000116769304,0.00006601811,0.00025024242,0.00002932698,0.00009114873,0.000015733212,0.00015051624,0.000054551612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004557637,0.000060912345,0.035200253,0.00008880224,0.00003068424,0.0000056484782,0.00051431597,0.0010403431,0.0023456588,0.9577973,0.0021470156,0.00076453306],"study_design_scores_gemma":[0.000600656,0.00007970517,0.044912737,0.00014281685,0.000005949193,0.0000019436998,0.00023944922,0.0013411063,0.0044760224,0.9478964,0.00010429447,0.00019887953],"about_ca_topic_score_codex":0.00016235794,"about_ca_topic_score_gemma":0.000013689716,"teacher_disagreement_score":0.011318879,"about_ca_system_score_codex":0.00002740054,"about_ca_system_score_gemma":0.0000040762475,"threshold_uncertainty_score":0.4761714},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71284854,0.0000630694,0.01620382,0.0005270756,0.0007454648,0.00031069914,0.00001696077,0.00013038886,0.26915395],"genre_scores_gemma":[0.99569815,6.121284e-7,0.0028316488,0.00005033514,0.000032142885,0.000033781005,0.000014468929,0.0000146054435,0.001324246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994597,0.00002042434,0.00012833737,0.00012912387,0.00010002125,0.00016238142],"domain_scores_gemma":[0.99944127,0.00005018058,0.000046585224,0.00026427984,0.00006303527,0.00013467802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107829,0.00009213973,0.00012752855,0.000011998759,0.00006805833,0.000024909403,0.00013986017,0.000018017214,0.00026136552],"category_scores_gemma":[0.000012886574,0.00007766329,0.000049563052,0.000113620066,0.000052002324,0.00006919378,0.00005309754,0.00006910547,0.00025225335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004067412,0.00007663179,0.00021797422,0.0000012301828,0.0000122804995,2.723313e-7,0.00012158043,0.000009994814,0.00006262971,0.996077,0.0022537073,0.0011626417],"study_design_scores_gemma":[0.00053492305,0.000015689297,0.000012065347,0.000003269717,0.000008713537,3.921657e-7,0.0002889535,0.00011449728,0.0011943982,0.97968686,0.018039145,0.00010111936],"about_ca_topic_score_codex":0.000011591261,"about_ca_topic_score_gemma":6.716818e-8,"teacher_disagreement_score":0.28284958,"about_ca_system_score_codex":0.000013299006,"about_ca_system_score_gemma":0.000025334877,"threshold_uncertainty_score":0.32422906},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927466,0.000012346151,0.00006115453,0.000513385,0.00017824679,0.0001955704,0.0000049464948,0.000057246914,0.0062305126],"genre_scores_gemma":[0.9996264,0.0000067794813,0.00010597881,0.00009838897,0.0000031318468,0.000043803168,0.0000028303339,0.00001798943,0.00009470373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912935,0.000106141226,0.00021793145,0.00016449008,0.00019272733,0.00018932889],"domain_scores_gemma":[0.99859166,0.0007551469,0.00010632069,0.000465365,0.00002810177,0.000053393305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040888935,0.00012166309,0.00016517642,0.00006878508,0.00014238626,0.000015525678,0.00030386169,0.000058554553,0.00007072443],"category_scores_gemma":[0.00017871721,0.00008795308,0.00010851599,0.00039175246,0.00014102811,0.00003130306,0.000036294052,0.00017394384,0.000021890914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008256602,0.00026281996,0.0006281326,0.000011194405,0.000030670497,1.1482365e-7,0.000081563245,2.9159392e-7,0.002611936,0.9911918,0.005080503,0.00009271317],"study_design_scores_gemma":[0.00032482954,0.000092520495,0.0004624436,0.000020078569,0.000018769751,6.8318417e-7,0.000023711935,0.000035053217,0.009176248,0.98894143,0.0008102903,0.00009395618],"about_ca_topic_score_codex":0.0000055421974,"about_ca_topic_score_gemma":8.6779414e-7,"teacher_disagreement_score":0.0068798033,"about_ca_system_score_codex":0.0000072604553,"about_ca_system_score_gemma":0.000004640007,"threshold_uncertainty_score":0.35866225},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99376863,0.00041095944,0.000094632946,0.000010133105,0.0007138408,0.00008894293,0.000010844153,0.000038395658,0.0048636175],"genre_scores_gemma":[0.9962984,0.00003170289,0.0031358828,0.000007639565,0.000016056016,0.0000067691276,0.0000042581655,0.000019340852,0.00047997994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989603,0.000042896005,0.00040742234,0.00009838869,0.00024568287,0.000245312],"domain_scores_gemma":[0.998867,0.00036208736,0.00030196874,0.0002933441,0.00012463375,0.0000509951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030627084,0.00012781628,0.0003579184,0.00012954739,0.000054020078,0.0000064200176,0.00017742244,0.000049253427,0.000055157667],"category_scores_gemma":[0.00052807824,0.000119700126,0.00009424781,0.00025601126,0.00015542441,0.00044754025,0.00010693809,0.000088863584,0.000007479336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056764993,0.00014116547,0.026616158,0.00021781561,0.00004371555,0.0000010031487,0.0013983886,5.2184595e-7,0.0017908249,0.96879023,0.00031186178,0.00068263337],"study_design_scores_gemma":[0.00036314348,0.000055220593,0.0026822742,0.000058048663,0.000043007407,0.000005361205,0.0013878735,0.0000026534951,0.059208307,0.93600756,0.00007132278,0.00011521625],"about_ca_topic_score_codex":0.000008886602,"about_ca_topic_score_gemma":0.000003295003,"teacher_disagreement_score":0.057417482,"about_ca_system_score_codex":0.000018060688,"about_ca_system_score_gemma":0.000015897709,"threshold_uncertainty_score":0.48812294},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86227846,0.0016656134,0.03348972,0.0010734425,0.012751076,0.00030082755,0.0000051951847,0.0008421964,0.08759349],"genre_scores_gemma":[0.99858934,0.00005148171,0.0010075852,0.000250948,0.0000068949976,0.00001185868,6.8404256e-7,0.000005093598,0.000076116376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992012,0.00008350899,0.00013248515,0.00022401508,0.00014042434,0.00021840745],"domain_scores_gemma":[0.99861026,0.00046046838,0.00005294762,0.00077386614,0.000036257035,0.000066181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024152169,0.00009971192,0.00008377033,0.000039945127,0.0003133695,0.00011719199,0.0012765101,0.000051962917,0.000032642627],"category_scores_gemma":[0.000047217894,0.00007190434,0.00009885232,0.00033225567,0.0000746507,0.00020289513,0.00021842189,0.0001464318,0.00008278228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007812083,0.000034072855,0.0020512922,4.7333364e-7,0.000019772042,0.0000058225023,0.0009068423,1.847601e-7,0.000010723294,0.98526025,0.0010406497,0.010662091],"study_design_scores_gemma":[0.00017820114,0.00006569002,0.0064559532,0.000006034521,0.0000046657497,5.734409e-7,0.0000276302,0.00023170939,0.00083126035,0.98407805,0.008012264,0.000107945045],"about_ca_topic_score_codex":0.000068379486,"about_ca_topic_score_gemma":0.000012304548,"teacher_disagreement_score":0.13631089,"about_ca_system_score_codex":0.0000046140435,"about_ca_system_score_gemma":0.000015552121,"threshold_uncertainty_score":0.2932174},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9863404,0.0003355599,0.000453014,0.00012798379,0.0021500632,0.00010502396,0.0000012248694,0.00022117235,0.010265534],"genre_scores_gemma":[0.9868608,0.000011043751,0.012842586,0.000113172406,7.851849e-7,0.000004755514,9.658756e-7,0.00001142071,0.00015442968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987378,0.000047265134,0.0003241012,0.00033918404,0.00026729086,0.0002843294],"domain_scores_gemma":[0.99881977,0.000045016262,0.00014519136,0.000678031,0.00019728784,0.00011468158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033294217,0.00014446396,0.00021824,0.00012951123,0.00008007004,0.000030034278,0.00068211945,0.00007141458,0.00004171516],"category_scores_gemma":[0.00004742725,0.00013474806,0.00009240397,0.0004888148,0.0000963149,0.00030144124,0.0002648909,0.00013424044,0.0001330416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004315909,0.0001801888,0.0017978026,0.0000115109415,0.000017984185,0.000009133144,0.00072215125,0.0000043751666,0.0022606584,0.992807,0.0008165752,0.0013683293],"study_design_scores_gemma":[0.00062320044,0.00015275089,0.0026100515,0.000030598185,0.000010398939,0.000015016389,0.000014122531,0.002565766,0.020055817,0.97367024,0.0000677829,0.00018426371],"about_ca_topic_score_codex":0.00012827003,"about_ca_topic_score_gemma":5.586451e-7,"teacher_disagreement_score":0.019136744,"about_ca_system_score_codex":0.000009995864,"about_ca_system_score_gemma":0.000047124107,"threshold_uncertainty_score":0.54948664},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.963121,0.00015544194,0.00021486267,0.000014958065,0.0065636775,0.00015856238,0.0000043547143,0.0004417594,0.029325403],"genre_scores_gemma":[0.99970645,0.000008851664,0.00006180364,0.000020548927,0.000020825015,0.000024145675,0.0000040826876,0.00003728035,0.00011602485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992296,0.000039328806,0.00016985639,0.00015276055,0.0001399679,0.0002684946],"domain_scores_gemma":[0.99943113,0.000104638835,0.000018857963,0.0002909749,0.00004288657,0.00011153558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027157925,0.0001578635,0.00017325119,0.0001569683,0.00007451273,0.000035577825,0.00019716063,0.00013588094,0.00008045743],"category_scores_gemma":[0.000031941752,0.00016144526,0.00007623445,0.0005102518,0.000041777308,0.00012622605,0.000011288034,0.00034760757,0.00027961464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057855505,0.00003203608,0.0006233218,0.000034421344,0.00005018839,0.000017304055,0.0003026131,0.000052074483,0.05127153,0.94507754,0.0012102614,0.0013229349],"study_design_scores_gemma":[0.0016819555,0.00013871842,0.008944574,0.00005052186,0.00006472044,0.00006206915,0.00023201585,0.0037821883,0.1298844,0.8414274,0.012801134,0.00093029975],"about_ca_topic_score_codex":0.000007952507,"about_ca_topic_score_gemma":0.000005210473,"teacher_disagreement_score":0.10365013,"about_ca_system_score_codex":0.000016995727,"about_ca_system_score_gemma":0.000010043442,"threshold_uncertainty_score":0.6583547},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99191755,0.000008447026,0.000479862,0.00063977443,0.00008764216,0.0002584172,0.0000022935685,0.000046854464,0.0065591545],"genre_scores_gemma":[0.9992837,0.0000026520788,0.0002873331,0.00012599307,0.0000035946796,0.000032666198,0.0000011805109,0.000019598863,0.00024332211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992919,0.00009627201,0.00016066628,0.00014597407,0.00016581795,0.00013939156],"domain_scores_gemma":[0.9979034,0.0012144013,0.00013816553,0.00064462476,0.00003915847,0.000060240338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002961839,0.00011563185,0.0001712078,0.000054059696,0.000093990035,0.000013641986,0.00031745664,0.000049467373,0.00004247856],"category_scores_gemma":[0.00016308315,0.000072090304,0.00006675104,0.0003182134,0.00011522425,0.000032167827,0.00003371629,0.00014432074,0.000019673469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001575304,0.00012850802,0.0010733601,0.000009205388,0.00003622635,1.7016482e-7,0.00022905419,0.0000012510366,0.00012143787,0.9951141,0.0028007962,0.00047015137],"study_design_scores_gemma":[0.0005071886,0.00018212719,0.0015177837,0.000045194305,0.000029390922,0.0000010853394,0.000050647748,0.000040152696,0.0018903725,0.9949927,0.00065025105,0.00009313975],"about_ca_topic_score_codex":0.000023070716,"about_ca_topic_score_gemma":0.00000915047,"teacher_disagreement_score":0.007366105,"about_ca_system_score_codex":0.000007381801,"about_ca_system_score_gemma":0.000019759753,"threshold_uncertainty_score":0.29397574},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8475816,0.000083881234,0.14187782,0.00009141987,0.0023747839,0.00013648372,0.0000016352549,0.00011070988,0.0077416534],"genre_scores_gemma":[0.9690305,0.000005876677,0.030763008,0.00009684528,0.000011443882,0.000011037932,0.0000030320111,0.000008377033,0.00006986113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989542,0.00004897621,0.00025519592,0.00027533752,0.00027655772,0.0001897839],"domain_scores_gemma":[0.9991299,0.000094278,0.00012090745,0.00039731397,0.00018319886,0.00007438308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000266632,0.000117139934,0.00015567333,0.00014068728,0.00007571139,0.00003880497,0.00049522,0.000060016813,0.000057889447],"category_scores_gemma":[0.000041161853,0.00011470273,0.00009263442,0.0007334762,0.00004026358,0.00039729202,0.00015681772,0.0000978712,0.00007298171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065672116,0.00013078956,0.010622997,0.0000101277265,0.000025459884,0.0000044886633,0.0005252577,0.000031992884,0.00040461274,0.98236054,0.00043739547,0.0054397695],"study_design_scores_gemma":[0.00050952396,0.000091390146,0.024728917,0.000017113178,0.0000102793665,0.000012016235,0.000010657118,0.0078933295,0.008040577,0.95797265,0.00052782433,0.00018570547],"about_ca_topic_score_codex":0.000041923726,"about_ca_topic_score_gemma":0.0000074278414,"teacher_disagreement_score":0.12144889,"about_ca_system_score_codex":0.000016835242,"about_ca_system_score_gemma":0.00005547913,"threshold_uncertainty_score":0.46774414},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9457219,0.00004488314,0.022030925,0.005243385,0.0012058076,0.00053968607,0.0000019981376,0.00036450787,0.024846887],"genre_scores_gemma":[0.99356556,0.0000030384924,0.0057033724,0.0003916569,0.0000057786756,0.00003856159,7.2539643e-7,0.000020304968,0.00027098684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826914,0.0002451666,0.0001329645,0.00037639283,0.0005603894,0.00041594604],"domain_scores_gemma":[0.99808246,0.00047890338,0.00007164513,0.0010115387,0.00016089469,0.000194546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008692467,0.00016872115,0.00014982506,0.000072585586,0.00021256367,0.00016650427,0.0015853278,0.000047670605,0.0000072916205],"category_scores_gemma":[0.000107145985,0.000106725136,0.00005126027,0.00075739325,0.00013109056,0.00028557147,0.0003425471,0.00039699016,0.00028966917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003912166,0.000059497917,0.000680908,0.000002844149,0.000014105829,0.000038021146,0.0011122723,0.00006879864,0.000045521832,0.9960848,0.0006446003,0.0012095274],"study_design_scores_gemma":[0.0006234363,0.00023087129,0.0004684623,0.000029247687,0.000002615086,0.000021245009,0.000095221,0.000615962,0.00062288373,0.99570566,0.001421176,0.00016319136],"about_ca_topic_score_codex":0.000037613136,"about_ca_topic_score_gemma":0.000011401436,"teacher_disagreement_score":0.047843657,"about_ca_system_score_codex":0.00006483278,"about_ca_system_score_gemma":0.000105500556,"threshold_uncertainty_score":0.43521246},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98751795,0.002948439,0.00091908086,0.0012317516,0.006393741,0.0002587067,0.0000046604036,0.00023575418,0.0004898935],"genre_scores_gemma":[0.9968408,0.00005544564,0.0027844796,0.00023120802,0.0000025869042,0.000012692039,0.0000013540938,0.000010003384,0.000061467814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984635,0.00013106683,0.000361866,0.00023096162,0.00033362588,0.00047897457],"domain_scores_gemma":[0.99841326,0.00022515567,0.00019518442,0.00084030314,0.00014896109,0.00017713645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092954666,0.00015432156,0.0002043451,0.00007874671,0.000329523,0.00007828877,0.0008244423,0.000057111603,0.0000038069638],"category_scores_gemma":[0.00007889358,0.000110228444,0.00011937008,0.0004240944,0.00017381454,0.00047129905,0.00030504205,0.00017412686,0.000059363818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033009394,0.00018602754,0.0057818224,0.0000071341883,0.000019877516,7.968896e-7,0.00028216065,0.000005001132,0.002399741,0.98967475,0.0012572102,0.0003821948],"study_design_scores_gemma":[0.0007401879,0.000078735655,0.010518556,0.000020337848,0.000011325929,0.0000046166547,0.000019715835,0.0038667708,0.0056272605,0.976502,0.0024101299,0.00020033434],"about_ca_topic_score_codex":0.000108404405,"about_ca_topic_score_gemma":0.0000038992907,"teacher_disagreement_score":0.013172705,"about_ca_system_score_codex":0.00001884474,"about_ca_system_score_gemma":0.000027589767,"threshold_uncertainty_score":0.44949853},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.994899,0.0000577434,0.00087608356,0.000099649405,0.002693692,0.00013407902,0.0000033286012,0.000060237657,0.0011762026],"genre_scores_gemma":[0.9968571,0.000002518601,0.0030885388,0.000011516133,0.0000053473664,0.000006352811,6.5449825e-7,0.0000066382217,0.000021329994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989819,0.000084132815,0.00023377541,0.00029445774,0.00021312363,0.00019259492],"domain_scores_gemma":[0.99866104,0.00012234297,0.00016504619,0.00082746433,0.00015315636,0.000070927825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006128175,0.000116254276,0.00022627828,0.00011812562,0.00005974669,0.00001671348,0.0007465149,0.000055180295,0.000010555178],"category_scores_gemma":[0.00011147546,0.00010875052,0.000107231754,0.00054840423,0.00015094878,0.0003040751,0.00011780975,0.00021347075,0.0000039611627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032023333,0.00020614204,0.004691861,0.000018473034,0.000013201318,0.000003656659,0.00039531043,8.7482385e-7,0.05191845,0.933276,0.000040042738,0.009432798],"study_design_scores_gemma":[0.00027267923,0.00010192867,0.018002814,0.000009656512,0.000005503583,0.000007165528,0.0000124268945,0.00027023465,0.17022227,0.8109166,0.00007045102,0.00010829641],"about_ca_topic_score_codex":0.00002843704,"about_ca_topic_score_gemma":0.000005983913,"teacher_disagreement_score":0.12235941,"about_ca_system_score_codex":0.000003454745,"about_ca_system_score_gemma":0.00005029383,"threshold_uncertainty_score":0.44347176},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98498565,0.000115904506,0.000095696225,0.000015255161,0.0062864698,0.0001678076,0.000022029652,0.00024421245,0.008066967],"genre_scores_gemma":[0.9997414,0.000015986689,0.000050563624,0.0000070766137,0.0000153157,0.000027468512,0.00001620909,0.00003343442,0.000092596674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907184,0.000037586753,0.00033239435,0.00014177343,0.00018325952,0.00023313612],"domain_scores_gemma":[0.9992867,0.000107974476,0.000057528123,0.0003579972,0.0000814846,0.000108311535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024297935,0.00016299821,0.0002561846,0.00014509806,0.00007481545,0.000022456567,0.00021337929,0.00012937195,0.00015333526],"category_scores_gemma":[0.000048581776,0.00016238133,0.00013082766,0.00043525238,0.000087642205,0.00014702576,0.000019668716,0.00026058534,0.000045281504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014863252,0.0000476193,0.01602091,0.000044907138,0.000065911416,0.0000021133687,0.00019883674,0.00014842534,0.06088119,0.9215398,0.00084340374,0.00019204132],"study_design_scores_gemma":[0.0043539647,0.00010999922,0.029530667,0.000070178074,0.000091136804,0.000022986802,0.00009236198,0.0017257446,0.06980135,0.8708893,0.022577126,0.00073520164],"about_ca_topic_score_codex":0.00000608677,"about_ca_topic_score_gemma":0.000014204923,"teacher_disagreement_score":0.050650496,"about_ca_system_score_codex":0.0000066965563,"about_ca_system_score_gemma":0.000018123917,"threshold_uncertainty_score":0.66217184},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9880867,0.000038691134,0.000039800405,0.00017436351,0.00028775464,0.00020646161,0.0000052816263,0.00003820705,0.011122715],"genre_scores_gemma":[0.9996481,0.000009261284,0.00007403939,0.00009959527,0.0000039452143,0.0000251059,0.000001427023,0.000011397655,0.00012712207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930507,0.0001125716,0.00016740322,0.00008159468,0.00014430883,0.00018905995],"domain_scores_gemma":[0.9982851,0.0010427753,0.00010890872,0.00047472742,0.000033198998,0.00005528187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048795567,0.00008856533,0.00012299091,0.000043141503,0.0001239611,0.0000065555696,0.00024154806,0.00004624651,0.00012554061],"category_scores_gemma":[0.0001977043,0.000060472885,0.00008612087,0.00030463559,0.00007387135,0.0000513972,0.000040802715,0.00013289301,0.000053130727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000405549,0.0003631822,0.0012376505,0.000007783678,0.000020852372,1.2943525e-7,0.00024115996,4.967262e-7,0.00013785681,0.99521106,0.002664426,0.00011131444],"study_design_scores_gemma":[0.00018966658,0.000019983121,0.0011509686,0.000010653831,0.000019118916,8.798504e-7,0.000039695107,0.000014163896,0.00646763,0.9913536,0.0006676095,0.00006608405],"about_ca_topic_score_codex":0.0000038165203,"about_ca_topic_score_gemma":3.4680858e-7,"teacher_disagreement_score":0.011561382,"about_ca_system_score_codex":0.000011904199,"about_ca_system_score_gemma":0.0000067320043,"threshold_uncertainty_score":0.24660127},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92336655,0.00034198796,0.000026156653,0.0000028374434,0.0017229359,0.00010036443,0.00000201316,0.00028924775,0.07414792],"genre_scores_gemma":[0.9997318,0.00003267262,0.00004010079,0.000024929412,0.0000075572993,0.000013320439,0.0000013544143,0.000037354974,0.000110903995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927527,0.000031663145,0.00016010505,0.00016732854,0.0001068473,0.00025879976],"domain_scores_gemma":[0.99954015,0.000059796123,0.00002422858,0.0002717166,0.00001578978,0.00008830954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019387431,0.00015557917,0.00016754148,0.000076108954,0.000090096335,0.000030466375,0.00012541295,0.00008167371,0.00007062011],"category_scores_gemma":[0.000020253045,0.00015955088,0.000037413643,0.00012585791,0.000032247364,0.00013274618,0.000031610438,0.00015726352,0.00009464571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023331773,0.000029313213,0.0021881466,0.00006336486,0.0000413421,0.000021015567,0.0010674329,0.000068190864,0.0010276511,0.99400854,0.0010612607,0.00040042555],"study_design_scores_gemma":[0.0013068056,0.0001893259,0.0050295806,0.00019409019,0.000022258311,0.000021222291,0.00025663918,0.0012229548,0.013553318,0.9746131,0.0031057524,0.00048496478],"about_ca_topic_score_codex":0.000022281949,"about_ca_topic_score_gemma":0.0000038738135,"teacher_disagreement_score":0.07636526,"about_ca_system_score_codex":0.000025430474,"about_ca_system_score_gemma":0.0000040433306,"threshold_uncertainty_score":0.65062964},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9960242,0.000041364096,0.00047334438,0.00046525203,0.0009556485,0.00024790483,6.592531e-7,0.000028759529,0.0017628605],"genre_scores_gemma":[0.99863166,0.000003857762,0.0012511907,0.000029259698,0.000005096053,0.00002772321,7.348505e-7,0.0000048645907,0.000045637727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988625,0.0001305802,0.0001798873,0.0002455381,0.00036536256,0.00021615018],"domain_scores_gemma":[0.9986405,0.00026570316,0.00007140789,0.0008533106,0.0001398993,0.000029194063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014058747,0.0000771664,0.00010076834,0.000150259,0.00007549632,0.00007177541,0.0014950787,0.000035929945,0.0000046930336],"category_scores_gemma":[0.0003191611,0.000056404988,0.000041731702,0.0010086825,0.00019128296,0.0004565067,0.00015245799,0.00033210177,0.000009468533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067227907,0.00010108586,0.012293915,0.0000066647435,0.0000022339061,0.00000394688,0.00072603044,0.0000041787134,0.006647976,0.975454,0.00005739294,0.004695881],"study_design_scores_gemma":[0.000394788,0.00004515861,0.07394317,0.000004465027,6.620889e-7,0.0000054767215,0.000017892378,0.00029726562,0.018870728,0.90597737,0.00037536558,0.00006767546],"about_ca_topic_score_codex":0.000014937642,"about_ca_topic_score_gemma":0.0000173111,"teacher_disagreement_score":0.06947662,"about_ca_system_score_codex":0.000008555941,"about_ca_system_score_gemma":0.000038065413,"threshold_uncertainty_score":0.2778253},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9841904,0.0005304974,0.002182749,0.00043355467,0.0026645772,0.0002842146,0.0000013141637,0.00010280213,0.009609915],"genre_scores_gemma":[0.9989786,0.000030999756,0.0009052944,0.000029446206,0.000001805828,0.000022316384,1.8723955e-7,0.000007823153,0.000023513556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985904,0.00021005645,0.00026927819,0.00025419425,0.0003043255,0.00037174055],"domain_scores_gemma":[0.9975952,0.0013997767,0.00005930135,0.00065033213,0.00020906604,0.00008632239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006430516,0.00010405136,0.00015549548,0.00012458455,0.00013679895,0.00004098581,0.0010716527,0.000058936046,0.000018327459],"category_scores_gemma":[0.0008111597,0.00007931913,0.000063141226,0.00072116766,0.00033598457,0.00049511454,0.00017982494,0.00025147086,0.00002294561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007792067,0.00016060814,0.0030427768,0.0000049648165,0.000012538347,0.000026525511,0.00024702417,4.281537e-7,0.0006090852,0.9919372,0.00004101916,0.0038398937],"study_design_scores_gemma":[0.0004824179,0.00018524608,0.03363223,0.000016484408,0.0000029210303,0.0000056303106,0.000056824174,0.00048544566,0.005963055,0.95894265,0.00013030294,0.00009679614],"about_ca_topic_score_codex":0.00005838255,"about_ca_topic_score_gemma":0.00004254895,"teacher_disagreement_score":0.03299457,"about_ca_system_score_codex":0.0000247108,"about_ca_system_score_gemma":0.00005218896,"threshold_uncertainty_score":0.32345402},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83925784,0.00023467581,0.006757214,0.006177682,0.0005958607,0.00069623505,0.00018209731,0.00010317154,0.14599524],"genre_scores_gemma":[0.9975684,0.0000028408724,0.0004173653,0.00028653257,0.000027417434,0.000036017722,0.000018196219,0.000006753266,0.0016364699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994359,0.000019252291,0.0001370673,0.00014338076,0.000107594584,0.0001567879],"domain_scores_gemma":[0.9993148,0.00031673,0.00006662611,0.00021159639,0.000040771283,0.00004951651],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009048868,0.000103110884,0.00010980231,0.0000101711175,0.0001754573,0.000029365927,0.00019189449,0.00002008451,0.001535767],"category_scores_gemma":[0.000015915515,0.0000673924,0.000046711768,0.00020220771,0.0000429006,0.000052831878,0.000016451044,0.00014609298,0.0001565836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003612636,0.00013800692,0.0000143972775,0.0000012243153,0.0000078370285,6.701947e-8,0.000028608216,0.000002292657,0.00006224241,0.976187,0.02091858,0.002636159],"study_design_scores_gemma":[0.00018569716,0.00005035933,0.000014934463,0.000006957082,0.0000051619036,9.8317756e-8,0.00006324053,0.000069594316,0.0014778005,0.9550664,0.042971916,0.00008783136],"about_ca_topic_score_codex":0.000001592159,"about_ca_topic_score_gemma":6.721135e-8,"teacher_disagreement_score":0.15831059,"about_ca_system_score_codex":0.000007047815,"about_ca_system_score_gemma":0.000015887885,"threshold_uncertainty_score":0.99937695},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9969844,0.000119736374,0.00002820483,0.00066773954,0.0008391702,0.00008899348,8.903214e-7,0.00001622811,0.0012546197],"genre_scores_gemma":[0.99946994,0.0000065060303,0.00029166372,0.0002088995,4.6530775e-7,0.0000031474106,2.5026526e-7,0.0000033629958,0.000015745061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932766,0.00010542998,0.00014850996,0.000094311545,0.00020137441,0.00012274142],"domain_scores_gemma":[0.9991985,0.00017864669,0.00011215416,0.00041567202,0.000060048136,0.000035003995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003818953,0.00006586862,0.000094892646,0.000024666779,0.00009344648,0.000013510836,0.00030628155,0.000031896456,0.0000057928123],"category_scores_gemma":[0.000022523685,0.00003612097,0.000048351394,0.000266503,0.00010887087,0.00009546543,0.00013406703,0.00008533021,0.0000067272576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022209938,0.00008860697,0.009989379,0.0000059031568,0.000008115097,6.005179e-8,0.0003070913,0.0000019463318,0.0027634518,0.985748,0.0009688247,0.00011642722],"study_design_scores_gemma":[0.00023644381,0.000033053326,0.0140904505,0.00003917693,0.000006820088,0.0000046325486,0.000009791962,0.00022684972,0.023052434,0.9622119,0.000038678645,0.00004975722],"about_ca_topic_score_codex":0.000023497892,"about_ca_topic_score_gemma":2.4377718e-7,"teacher_disagreement_score":0.023536062,"about_ca_system_score_codex":0.0000040853106,"about_ca_system_score_gemma":0.0000092377795,"threshold_uncertainty_score":0.14729704},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96666783,0.00009090849,0.028649956,0.00057802966,0.0015441058,0.00018544655,0.0000063592533,0.00029289039,0.0019844575],"genre_scores_gemma":[0.996548,0.000003132866,0.0031888506,0.00010591817,0.000013121877,0.0000063951825,0.0000062732756,0.00001016768,0.00011813425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892616,0.00010003145,0.00018034845,0.00026808254,0.00026629778,0.00025908055],"domain_scores_gemma":[0.998828,0.00037664513,0.00019614963,0.00041028234,0.00010613509,0.00008278432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002468,0.00013322696,0.00022992976,0.000047740326,0.00007698205,0.000039983886,0.0005132046,0.00006535689,0.000009309387],"category_scores_gemma":[0.0002527012,0.000106306274,0.00004355917,0.00037912707,0.000073144336,0.00028707474,0.00011662723,0.00012903905,0.000031252657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011416999,0.0001339318,0.0062829396,0.0000101258065,0.000032446413,0.0000070660735,0.00027517442,0.00047198418,0.00014866299,0.9915211,0.00020742326,0.00089771755],"study_design_scores_gemma":[0.003945396,0.0018367469,0.017078869,0.00016572328,0.000052594634,0.00000475236,0.000036471356,0.08449997,0.012479295,0.86675024,0.01236099,0.0007889651],"about_ca_topic_score_codex":0.00000868015,"about_ca_topic_score_gemma":0.0000057062784,"teacher_disagreement_score":0.12477088,"about_ca_system_score_codex":0.00001906137,"about_ca_system_score_gemma":0.00003663084,"threshold_uncertainty_score":0.4335044},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9876171,0.0001961994,0.0060536116,0.0007591715,0.0033717977,0.00010022357,0.0000018023488,0.0002857587,0.0016143763],"genre_scores_gemma":[0.9981104,0.00001667695,0.00081539253,0.0008847548,0.000017086051,0.000015170302,0.0000040723107,0.000012258872,0.0001241982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881697,0.000097088945,0.00016263638,0.0003832354,0.00021718441,0.00032287033],"domain_scores_gemma":[0.9986228,0.0005183463,0.000082128325,0.00060181454,0.000056478242,0.000118463184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031286973,0.00017277055,0.00015418438,0.00010592603,0.0002337761,0.00030187008,0.000809749,0.00012583869,0.00012100425],"category_scores_gemma":[0.00006890155,0.00016351156,0.00008323711,0.0006720825,0.000057721347,0.0004480068,0.00017639174,0.0003351871,0.000044130236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007992124,0.00010234083,0.0026263713,0.0000050684766,0.00002969186,0.000004985751,0.0001927507,0.000002940991,0.012126833,0.97892976,0.0046598916,0.0013113945],"study_design_scores_gemma":[0.0006683719,0.00023561422,0.0027272173,0.000011237068,0.000016095582,0.000006393554,0.000015550355,0.0035842871,0.0077616167,0.9765966,0.008036789,0.0003402183],"about_ca_topic_score_codex":0.000043842865,"about_ca_topic_score_gemma":0.000051906387,"teacher_disagreement_score":0.010493332,"about_ca_system_score_codex":0.000009720464,"about_ca_system_score_gemma":0.000027265674,"threshold_uncertainty_score":0.6667808},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792582,0.0016982832,0.00026235433,0.00048090384,0.010409337,0.0006929033,0.000010283634,0.00016356769,0.007024197],"genre_scores_gemma":[0.99756044,0.000028376173,0.0012213552,0.00014250625,0.00011514583,0.00005888106,0.0000032108082,0.00004123292,0.00082884444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988071,0.0000808969,0.00024665965,0.00015253513,0.00020241378,0.00051043305],"domain_scores_gemma":[0.9974326,0.0017573357,0.00012655811,0.00049442897,0.000081180086,0.000107918786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000886269,0.00018322318,0.00020510679,0.000035979676,0.0009136782,0.000060178005,0.00036209886,0.00013134303,0.000030823456],"category_scores_gemma":[0.00066327973,0.000113284674,0.00016304103,0.000119409386,0.00011493114,0.00011738941,0.00011014195,0.00021247762,0.000008641677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026838094,0.000038056907,0.00082821614,0.000030056191,0.000058534915,4.0637516e-7,0.00097516575,2.4892782e-7,0.000040535087,0.98362994,0.013413933,0.00095807255],"study_design_scores_gemma":[0.0006262111,0.000046482022,0.00030223542,0.000012242202,0.000047905316,0.000006747,0.00019598789,0.000021071217,0.0008552411,0.9465809,0.05114219,0.0001628288],"about_ca_topic_score_codex":0.0000024906585,"about_ca_topic_score_gemma":0.0000015222943,"teacher_disagreement_score":0.037728257,"about_ca_system_score_codex":0.00003057924,"about_ca_system_score_gemma":0.000018715382,"threshold_uncertainty_score":0.7027367},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9865612,0.00008647867,0.00050135277,0.0016622826,0.0038051635,0.000111355905,0.0000010472986,0.00044645177,0.0068247053],"genre_scores_gemma":[0.9937598,0.000004681207,0.0042110924,0.0014331093,0.0000025004965,0.0000060416837,0.0000057079023,0.000013078354,0.0005639664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860185,0.00011853103,0.00020234087,0.00041746383,0.00032400835,0.00033578352],"domain_scores_gemma":[0.9988358,0.00009198614,0.00007460757,0.00076444994,0.000083206054,0.00014994643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046153684,0.00015917254,0.0001695116,0.00009215194,0.00011674838,0.00012057483,0.00067972834,0.0000825321,0.000008021148],"category_scores_gemma":[0.000055623914,0.00014247945,0.00006369549,0.00030307105,0.000034378092,0.00015000433,0.00015751884,0.00016305316,0.0003775651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000205394,0.00007790265,0.0004082962,0.0000030813035,0.000010306763,0.0000029270036,0.00006719466,0.00033007015,0.0010447558,0.9826845,0.013869306,0.0014996107],"study_design_scores_gemma":[0.0007889716,0.00019683946,0.0013728014,0.000015753245,0.000004214353,0.0000026290627,0.0000011059387,0.0274867,0.002707864,0.95495,0.012258416,0.0002147533],"about_ca_topic_score_codex":0.00005217695,"about_ca_topic_score_gemma":0.0000023661948,"teacher_disagreement_score":0.027734544,"about_ca_system_score_codex":0.000021338883,"about_ca_system_score_gemma":0.000023402861,"threshold_uncertainty_score":0.58101434},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4703863,0.010667644,0.03464603,0.009856479,0.22786799,0.004861532,0.00031635084,0.0057825404,0.23561513],"genre_scores_gemma":[0.9971503,0.00003325558,0.0010393509,0.0002183571,0.00015739609,0.000023882152,0.00003514445,0.000015180634,0.0013271214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983122,0.00010470098,0.00027910268,0.00035614183,0.00041251373,0.0005353533],"domain_scores_gemma":[0.9985847,0.0000692973,0.00012474907,0.0010086612,0.000036775084,0.00017585377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005572312,0.00018452003,0.00019520552,0.000115621566,0.00013455527,0.0003086736,0.0010851526,0.000055251774,0.000003966423],"category_scores_gemma":[0.00004099132,0.00016605735,0.000056324774,0.0002889966,0.000019666792,0.0017983028,0.0004118053,0.00013200859,0.00045178653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074090385,0.00013743913,0.0002308803,0.00000765948,0.000023997629,0.0000059552012,0.00008115313,0.000016175436,0.000014063486,0.97902405,0.018398384,0.0020528166],"study_design_scores_gemma":[0.018429093,0.0012375169,0.018764643,0.0002587192,0.00011151839,0.000021839707,0.0002089408,0.1261863,0.0021215384,0.548633,0.28111005,0.0029169],"about_ca_topic_score_codex":0.000030887895,"about_ca_topic_score_gemma":1.8103938e-7,"teacher_disagreement_score":0.52676404,"about_ca_system_score_codex":0.000060108396,"about_ca_system_score_gemma":0.000017859875,"threshold_uncertainty_score":0.67716223},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9700473,0.000032680295,0.020451723,0.0006113269,0.0034028047,0.00014987667,8.2942427e-7,0.00010598117,0.0051974636],"genre_scores_gemma":[0.993282,0.000010182358,0.0060401214,0.00041235232,0.000013695562,0.000010751188,7.8306476e-7,0.000011807429,0.00021826276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998552,0.00012477135,0.00033190637,0.00030869697,0.00041389596,0.0002687095],"domain_scores_gemma":[0.99874294,0.00016418724,0.00015635935,0.00073624105,0.0001037539,0.000096494994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003442327,0.0001417523,0.00021771474,0.00010793581,0.000075658296,0.000057824527,0.0009839379,0.000067896406,0.000035506895],"category_scores_gemma":[0.00017359415,0.00013058777,0.00009128817,0.00023950683,0.00005802704,0.00022785175,0.00020518804,0.00012082908,0.0002516419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012271502,0.0001544122,0.0012124339,0.000004456822,0.000011565807,0.0000026456885,0.00055361394,0.000073291434,0.0039247856,0.95812887,0.0008653776,0.035056304],"study_design_scores_gemma":[0.0004794476,0.000403075,0.0023070106,0.0000594787,0.0000069495545,0.000002840588,0.00001605651,0.027263556,0.20173676,0.7598346,0.0076127904,0.0002774737],"about_ca_topic_score_codex":0.000054278426,"about_ca_topic_score_gemma":0.0000017741189,"teacher_disagreement_score":0.19829428,"about_ca_system_score_codex":0.00004977677,"about_ca_system_score_gemma":0.000028212871,"threshold_uncertainty_score":0.5325215},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9841061,0.000037940426,0.00006004188,0.000024257086,0.001578153,0.00013679314,0.0000031940465,0.000033464494,0.014020043],"genre_scores_gemma":[0.99881357,0.000005815275,0.00085259986,0.00007851253,0.00000783702,0.000004894908,8.724039e-7,0.00001577269,0.00022013277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991782,0.00013983744,0.00025792047,0.00011140203,0.00019025408,0.00012239892],"domain_scores_gemma":[0.99911535,0.00008318646,0.00016826783,0.000516013,0.00008912328,0.000028046503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030203196,0.00009505219,0.00014952736,0.000031193795,0.00012132913,0.000005250461,0.00033371514,0.00007500539,0.00013620897],"category_scores_gemma":[0.00021406317,0.000061159604,0.000089581874,0.00017261987,0.00009497889,0.000050515806,0.0001483115,0.00008733856,0.000002141883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008315441,0.000056112724,0.013104193,0.00003081147,0.00002619182,4.0704526e-7,0.0023191806,2.9086289e-7,0.00022734908,0.98320585,0.00092274963,0.000098567005],"study_design_scores_gemma":[0.0002566451,0.000025679228,0.0141707575,0.00001586497,0.000025768177,0.0000015951256,0.00004810144,0.000015918395,0.009742886,0.97540617,0.00021185413,0.00007873217],"about_ca_topic_score_codex":0.00002871104,"about_ca_topic_score_gemma":0.0000046301634,"teacher_disagreement_score":0.01470745,"about_ca_system_score_codex":0.000013078204,"about_ca_system_score_gemma":0.000016821594,"threshold_uncertainty_score":0.24940164},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99362737,0.000065949884,0.00004856257,0.0004729107,0.00011131016,0.00032021335,0.000005815233,0.00003727828,0.0053106085],"genre_scores_gemma":[0.9996051,0.000009896922,0.00007656712,0.000092862516,0.000004563468,0.00007731214,0.0000012676154,0.000019259947,0.00011313414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921054,0.00008894152,0.00017539208,0.00013529044,0.00017535141,0.00021446648],"domain_scores_gemma":[0.99842334,0.0008442735,0.00013725783,0.00047037276,0.000042489217,0.000082244194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032825436,0.00013902092,0.00018482796,0.0000779853,0.00015425062,0.00001393998,0.00019427584,0.00008182404,0.00005042519],"category_scores_gemma":[0.000097224365,0.00008877261,0.0000512815,0.00031627022,0.00018622958,0.00007743153,0.000047423655,0.00021041206,0.000009431245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000327124,0.00025441998,0.0230746,0.000018266986,0.00005925393,3.4776292e-7,0.0007405743,2.822306e-7,0.00015467465,0.9742472,0.0013044792,0.00011315358],"study_design_scores_gemma":[0.0004582106,0.00009557497,0.012290602,0.00003858319,0.000040256768,0.0000039519805,0.000254784,0.000011403684,0.0011584734,0.9849921,0.00054044544,0.00011563752],"about_ca_topic_score_codex":0.000022132383,"about_ca_topic_score_gemma":0.0000060696466,"teacher_disagreement_score":0.010784,"about_ca_system_score_codex":0.0000066022963,"about_ca_system_score_gemma":0.000013416158,"threshold_uncertainty_score":0.36200422},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99155426,0.0013474768,0.000029196066,0.000041256175,0.0016567154,0.00022095494,0.0000045561187,0.00019811321,0.0049474854],"genre_scores_gemma":[0.99968,0.00004470363,0.00004216941,0.000019364421,0.000009108624,0.00003444663,0.000002825163,0.000039910497,0.00012748034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990755,0.00004315814,0.0002765326,0.00015522788,0.00017375767,0.00027587364],"domain_scores_gemma":[0.99933946,0.000038917962,0.000051337018,0.00041515398,0.0000687613,0.00008636677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001531361,0.00017401417,0.00025675577,0.00010285886,0.00004619855,0.00003384431,0.00022773922,0.00011478463,0.00029391772],"category_scores_gemma":[0.0000074914788,0.00017388063,0.0001186752,0.00030085602,0.000047481542,0.00019545663,0.000027774617,0.00013228638,0.00016325769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014926266,0.00016018443,0.03146943,0.0009955573,0.00043043727,0.000014608478,0.0033405907,0.00019394574,0.0687233,0.84811485,0.040292673,0.0062495167],"study_design_scores_gemma":[0.00085806375,0.0000882324,0.006008496,0.00022504007,0.000032566953,0.0000107328415,0.000592604,0.0011049564,0.046008404,0.938245,0.0063808947,0.00044500362],"about_ca_topic_score_codex":0.00008537452,"about_ca_topic_score_gemma":0.0000034300992,"teacher_disagreement_score":0.09013017,"about_ca_system_score_codex":0.000019726453,"about_ca_system_score_gemma":0.0000068255995,"threshold_uncertainty_score":0.70906466},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99347246,0.00003457947,0.0000541782,0.00017711773,0.0004076933,0.00019741572,0.000004454175,0.00003850691,0.0056135864],"genre_scores_gemma":[0.9996596,0.0000010800534,0.000070913535,0.00001855262,0.0000050211115,0.000014151377,5.362845e-7,0.000009643533,0.00022051703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931806,0.00011425651,0.0001584338,0.000112036,0.00017663471,0.000120600984],"domain_scores_gemma":[0.99896365,0.00031898433,0.00012318614,0.00044429942,0.00009212091,0.000057746598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037326742,0.0000802006,0.00014093536,0.000032085452,0.00007058968,0.000008618556,0.00026729246,0.000052430878,0.00001950851],"category_scores_gemma":[0.00041357422,0.000057013116,0.00007413682,0.00034183628,0.000092520946,0.000052545794,0.00008114924,0.00010234795,0.00001056281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000968146,0.00022246427,0.016246052,0.00000764504,0.000014555215,3.2383787e-7,0.0003309067,0.000002402144,0.00015324289,0.980839,0.0020143804,0.00015934359],"study_design_scores_gemma":[0.00055041554,0.00002151082,0.009685539,0.000010537352,0.000021524558,0.0000025109905,0.00019793256,0.00007441188,0.0033471505,0.9855396,0.00048298534,0.000065844746],"about_ca_topic_score_codex":0.000014250212,"about_ca_topic_score_gemma":0.000012093611,"teacher_disagreement_score":0.0065605137,"about_ca_system_score_codex":0.000022834141,"about_ca_system_score_gemma":0.00004570835,"threshold_uncertainty_score":0.23249273},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7756717,0.00008859195,0.21640746,0.0009248213,0.0038671275,0.001898887,0.000032872482,0.00017413979,0.0009343948],"genre_scores_gemma":[0.968713,0.0000025222814,0.03098533,0.000056688972,0.000029392455,0.00010964039,0.000007933723,0.000033980705,0.00006150838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986456,0.00008841789,0.00048905745,0.00021291358,0.00034369633,0.00022032831],"domain_scores_gemma":[0.9947704,0.004073304,0.00023219171,0.00052909227,0.00034482192,0.000050187293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093965273,0.00017036322,0.00034162874,0.00004096188,0.00014865052,0.000020483194,0.00035716814,0.000071171125,0.000026097678],"category_scores_gemma":[0.0021369904,0.00012997675,0.00014297523,0.0001473122,0.00012593399,0.000098194134,0.00008528947,0.00011290027,0.000005655322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040557574,0.0002916327,0.000105522624,0.00023559964,0.000048451693,1.3772048e-7,0.0004416274,0.00010367015,0.00015165076,0.9967305,0.00093181245,0.00091882073],"study_design_scores_gemma":[0.0014895671,0.00023385751,0.000100285084,0.00004145748,0.00006621438,0.0000015411401,0.000098146,0.015060802,0.0007852187,0.9807572,0.00123363,0.00013211461],"about_ca_topic_score_codex":0.000004290562,"about_ca_topic_score_gemma":0.0000014442378,"teacher_disagreement_score":0.19304131,"about_ca_system_score_codex":0.000052709198,"about_ca_system_score_gemma":0.000030021532,"threshold_uncertainty_score":0.53002983},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7661054,0.0012659435,0.07788561,0.010260308,0.01021008,0.0018867959,0.000014239211,0.0030583157,0.12931328],"genre_scores_gemma":[0.9935054,0.000032003445,0.0051768003,0.0007673583,0.000006806017,0.000011038618,0.0000016667337,0.000012874232,0.0004860362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980032,0.00012459673,0.00019560731,0.00053931284,0.00055468356,0.0005826171],"domain_scores_gemma":[0.99829376,0.00017941228,0.00006566192,0.0011499407,0.00011031935,0.00020093593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046279418,0.00019308046,0.00019790734,0.00021907785,0.00023121596,0.00012865123,0.0013952726,0.00007668066,0.000018400242],"category_scores_gemma":[0.000106275795,0.00017939432,0.00010072802,0.00097154314,0.00006734151,0.00051729864,0.00015617974,0.00034299903,0.00029618578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017754399,0.0001640381,0.00008769119,0.0000023675427,0.0000044191333,0.00005221716,0.00011067103,0.000022145676,0.00082313083,0.97038656,0.0014501549,0.026878841],"study_design_scores_gemma":[0.00058101706,0.00056229293,0.0028603608,0.000021139173,0.0000016543868,0.000007408555,0.0000045923666,0.0013211921,0.004275487,0.9869961,0.003154497,0.00021424207],"about_ca_topic_score_codex":0.000004199037,"about_ca_topic_score_gemma":4.554759e-7,"teacher_disagreement_score":0.22739999,"about_ca_system_score_codex":0.00006334317,"about_ca_system_score_gemma":0.00005579354,"threshold_uncertainty_score":0.7315488},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9974455,0.0000020482967,0.000026957918,0.00008656412,0.00027683348,0.0002484537,0.000008687265,0.000024766878,0.0018801396],"genre_scores_gemma":[0.99970573,0.0000055944747,0.00012276496,0.000006416054,0.00000463554,0.000025848554,0.000009514756,0.000013917651,0.00010556869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935675,0.000041848478,0.00021467642,0.000105840976,0.00016394,0.00011695738],"domain_scores_gemma":[0.9989768,0.00019967301,0.00023864619,0.00041327052,0.0001368605,0.000034723224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002510062,0.00009000962,0.00015304633,0.000040867955,0.00011318225,0.000012513187,0.00024141249,0.00005233114,0.000017793838],"category_scores_gemma":[0.000043187738,0.00006146716,0.00005378833,0.00021745863,0.00020197297,0.000055174834,0.000026538046,0.00015721649,0.0000058934875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046919682,0.00017919303,0.0063464744,0.000020377565,0.000030058922,2.6133367e-7,0.00019197387,5.0673243e-8,0.13609633,0.85699636,0.000016302769,0.000075724434],"study_design_scores_gemma":[0.00039378103,0.00007639093,0.029621901,0.000019820174,0.000021115311,0.000003434773,0.00006823215,0.00002082379,0.047373448,0.92212284,0.00020802097,0.00007017685],"about_ca_topic_score_codex":0.00001832685,"about_ca_topic_score_gemma":0.000020109102,"teacher_disagreement_score":0.08872288,"about_ca_system_score_codex":0.000003298649,"about_ca_system_score_gemma":0.000024064133,"threshold_uncertainty_score":0.2506558},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9466263,0.00016586584,0.00850801,0.00009049021,0.00064749276,0.0004273884,0.0000051363445,0.00023617897,0.04329316],"genre_scores_gemma":[0.98266685,0.0000135655755,0.016991384,0.000035027995,0.000001417185,0.000027706441,0.0000010400014,0.000017600327,0.00024542017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848807,0.000084528154,0.00020915276,0.00039190485,0.0004057587,0.000420615],"domain_scores_gemma":[0.9985367,0.0001313352,0.00012358825,0.0008605435,0.0001934089,0.00015438837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032874517,0.00016839607,0.00023795567,0.00022082112,0.00010443316,0.000023580316,0.0014557317,0.00006433289,0.000024493265],"category_scores_gemma":[0.000036857495,0.00014370638,0.00006168769,0.00087433564,0.00025793802,0.00048026047,0.00023601556,0.00021435015,0.000038283575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008297082,0.00012901194,0.00691429,0.000017034197,0.000033830882,0.000051613948,0.00071896304,7.470197e-7,0.0002815181,0.9901655,0.00019130712,0.0014132129],"study_design_scores_gemma":[0.0008126336,0.0006903906,0.012115761,0.000029099645,0.000005932006,0.000016406218,0.00006438295,0.000047620826,0.010739818,0.97495824,0.00033196868,0.00018772416],"about_ca_topic_score_codex":0.000065590815,"about_ca_topic_score_gemma":0.000010158499,"teacher_disagreement_score":0.04304774,"about_ca_system_score_codex":0.000027879121,"about_ca_system_score_gemma":0.00007461232,"threshold_uncertainty_score":0.5860176},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98574156,0.000074559866,5.7589745e-7,0.00010546056,0.0010325288,0.0002506686,0.0000014020812,0.000023956123,0.012769319],"genre_scores_gemma":[0.9994498,0.00003524225,0.000175696,0.000039900588,0.0000029596024,0.000034753462,6.3484583e-7,0.000017930792,0.00024310611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988998,0.0001174178,0.00034211297,0.00014222591,0.00025685475,0.00024156473],"domain_scores_gemma":[0.998683,0.00059346773,0.0001337193,0.000472298,0.00006990257,0.000047610945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039594842,0.00012424297,0.000197781,0.000055064313,0.00013328982,0.00002639845,0.00037232926,0.00009790001,0.0001869419],"category_scores_gemma":[0.00020039573,0.000079584526,0.00008620308,0.00022850114,0.0001343047,0.0000848318,0.00014325176,0.0002110631,0.000034951536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006038308,0.000056491666,0.044273473,0.000017056345,0.000025925456,0.000001707443,0.00053070835,1.085387e-7,0.00005026677,0.95203775,0.0020986656,0.0009018084],"study_design_scores_gemma":[0.00045821586,0.000014677032,0.043844935,0.000018845272,0.0000076646875,0.0000052256905,0.00012593303,0.000013440485,0.00041296732,0.9547954,0.00020883307,0.000093834606],"about_ca_topic_score_codex":0.0000911937,"about_ca_topic_score_gemma":0.000013174822,"teacher_disagreement_score":0.013708248,"about_ca_system_score_codex":0.000020597798,"about_ca_system_score_gemma":0.0000147465935,"threshold_uncertainty_score":0.3245363},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9762438,0.00028374276,0.0035329964,0.000307107,0.0039759683,0.0002957307,0.000008024035,0.00010543397,0.015247225],"genre_scores_gemma":[0.99031365,0.0000101115775,0.008663594,0.00005191132,0.0000041214857,0.000010102112,4.7008396e-7,0.000005864181,0.0009401577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898106,0.00010708513,0.00026088997,0.0002731744,0.00020496208,0.00017284739],"domain_scores_gemma":[0.99875206,0.0001362646,0.00013649241,0.0007096858,0.00021288372,0.00005261625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028492144,0.00011632478,0.000151117,0.00005794758,0.00016939524,0.00006015111,0.00079478946,0.00005780987,0.00010481555],"category_scores_gemma":[0.00014835157,0.000094132665,0.00004382207,0.000606452,0.00025092645,0.0006509094,0.00075758534,0.00016412776,0.000013771205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002098661,0.00006549945,0.03126982,0.00001951136,0.000012488801,0.0000016028202,0.00319264,0.0000021254082,0.000022162103,0.963419,0.00048780578,0.0015052382],"study_design_scores_gemma":[0.00020593185,0.00007324318,0.14410104,0.000015769281,0.0000050781427,0.000016217253,0.00004585407,0.0008188696,0.00085654494,0.85280716,0.0009341335,0.00012016803],"about_ca_topic_score_codex":0.000037187885,"about_ca_topic_score_gemma":0.000039688606,"teacher_disagreement_score":0.11283122,"about_ca_system_score_codex":0.000022399054,"about_ca_system_score_gemma":0.0000916355,"threshold_uncertainty_score":0.38386187},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99384844,0.00004511109,0.000049632512,0.000282268,0.0007328702,0.00021427135,0.000005829829,0.00015260772,0.004668952],"genre_scores_gemma":[0.9986709,0.000010233177,0.0006570612,0.0001523002,0.000029493667,0.00003681908,0.000011311732,0.00003504241,0.00039688495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872726,0.00015471331,0.00031961597,0.00024951092,0.0002184345,0.0003304728],"domain_scores_gemma":[0.998685,0.000551255,0.00013147404,0.0004901286,0.00004791723,0.00009423286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005697766,0.00018088595,0.00033092758,0.00011036426,0.00012710618,0.000045217716,0.00027821152,0.000101835896,0.00005489347],"category_scores_gemma":[0.0004885636,0.00018634906,0.000075124466,0.00016591315,0.00010526172,0.0002594391,0.00010800434,0.0002908541,0.00016974738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042330953,0.00029540248,0.008839249,0.000044204735,0.000014984136,0.000005563903,0.0004459491,0.000001205285,0.0005862008,0.98659235,0.002980063,0.00019061568],"study_design_scores_gemma":[0.000971423,0.000046230947,0.021895325,0.00007163393,0.000013787265,0.0000046514715,0.000046455352,0.00017343432,0.004101359,0.97148925,0.00096751895,0.00021892249],"about_ca_topic_score_codex":0.00005266954,"about_ca_topic_score_gemma":0.000026685017,"teacher_disagreement_score":0.015103071,"about_ca_system_score_codex":0.00008238879,"about_ca_system_score_gemma":0.000030747025,"threshold_uncertainty_score":0.7599094},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99156,0.000041890893,0.000051562776,0.00019100847,0.0002771104,0.00016504867,0.0000017094344,0.000067194625,0.0076444806],"genre_scores_gemma":[0.9992463,0.000012101449,0.0004911584,0.00011345024,0.0000036882548,0.000052542426,0.0000029865853,0.000012950711,0.0000647993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992694,0.00008438448,0.00018315321,0.00017627781,0.0001070712,0.00017971022],"domain_scores_gemma":[0.99916255,0.0003589146,0.00006769661,0.00031899466,0.000042450425,0.000049371894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033535037,0.000097943586,0.00016363358,0.00006442799,0.00006900702,0.000015148755,0.00018121945,0.00005555069,0.000023654697],"category_scores_gemma":[0.0001834896,0.00009282339,0.000057789723,0.00026054773,0.00005718704,0.00005102872,0.00002659234,0.000114512564,0.0000660381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030811075,0.0000949258,0.003743967,0.000015005666,0.000008373354,0.0000015521507,0.00020481003,0.0000011988269,0.00026175956,0.99449295,0.00089957117,0.00027278552],"study_design_scores_gemma":[0.00038053055,0.000021743726,0.003743373,0.000025985259,0.000009847558,0.000002616972,0.0000758466,0.00005531724,0.00076744717,0.992922,0.0018795552,0.00011575066],"about_ca_topic_score_codex":0.000010714123,"about_ca_topic_score_gemma":0.00001516587,"teacher_disagreement_score":0.0076863286,"about_ca_system_score_codex":0.000012995778,"about_ca_system_score_gemma":0.000009277257,"threshold_uncertainty_score":0.3785228},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9970707,0.00026610168,0.000056536148,0.00023891062,0.0018602954,0.00018831856,0.000004582739,0.000023488728,0.0002910325],"genre_scores_gemma":[0.99686986,0.0000068976815,0.0030403857,0.000029044406,0.000001235578,0.000004655473,6.579236e-7,0.000008180781,0.000039073475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989364,0.000048634094,0.00024240378,0.00032344885,0.00023217239,0.0002169389],"domain_scores_gemma":[0.99890405,0.000066822686,0.00014074895,0.0006926903,0.00011496123,0.00008074897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003151338,0.00012823896,0.00021441255,0.00007651618,0.00011725666,0.000044364704,0.00037459808,0.000044415883,0.0000050590656],"category_scores_gemma":[0.000037949594,0.00009201409,0.000053160617,0.0003056887,0.00028954548,0.00020008675,0.00026515473,0.0001913766,6.591696e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004127112,0.00007170647,0.077795625,0.00002216271,0.00002058089,6.1831645e-7,0.00032120093,0.000002784227,0.020544237,0.9002741,0.0001886145,0.00075426465],"study_design_scores_gemma":[0.0019705277,0.00035789653,0.105898306,0.00009330953,0.000051865136,0.000026948886,0.00007422586,0.0025302188,0.037319507,0.85063475,0.00067218964,0.00037025366],"about_ca_topic_score_codex":0.00012413424,"about_ca_topic_score_gemma":0.000013301243,"teacher_disagreement_score":0.04963933,"about_ca_system_score_codex":0.0000037359123,"about_ca_system_score_gemma":0.00003411237,"threshold_uncertainty_score":0.37522256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99196184,0.002067631,0.0000041694216,0.000053906377,0.001299997,0.00021578463,0.0000015908753,0.000071240815,0.0043238294],"genre_scores_gemma":[0.9997381,0.00008679625,0.000016021002,0.0000075467206,0.000005035005,0.000035346955,6.8096267e-7,0.000015243874,0.000095225885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993241,0.000057119185,0.00020491696,0.00010460746,0.00011434351,0.00019491145],"domain_scores_gemma":[0.9993961,0.00014756326,0.000028534769,0.00031181294,0.0000472217,0.000068753994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002204959,0.00010762834,0.00014028957,0.000022790115,0.00007967777,0.00003626886,0.00015522748,0.000054719032,0.000037413218],"category_scores_gemma":[0.000033324843,0.00007644521,0.000042813685,0.00010141433,0.00008941653,0.00010983542,0.00003394253,0.00009967209,0.00004267426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024265897,0.00009912269,0.05548092,0.00033681127,0.00020214911,0.0000018749897,0.0015347418,0.00014207822,0.0064573027,0.9143019,0.0062218504,0.015197016],"study_design_scores_gemma":[0.0016563467,0.00021180704,0.17088233,0.00014226366,0.00006223191,0.000013914914,0.0015233867,0.009828726,0.016386865,0.77046776,0.028219711,0.00060465717],"about_ca_topic_score_codex":0.00004380109,"about_ca_topic_score_gemma":0.0000070940437,"teacher_disagreement_score":0.1438341,"about_ca_system_score_codex":0.00001644802,"about_ca_system_score_gemma":0.0000062699396,"threshold_uncertainty_score":0.31173453},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99360055,0.00011357453,0.000009256892,0.000022628246,0.002016652,0.00039083976,0.0000050583003,0.00036259924,0.003478843],"genre_scores_gemma":[0.99974936,0.000011914007,0.000035287852,0.00004079067,0.000009982396,0.00005138878,0.000031535896,0.000049623257,0.00002013064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986806,0.000120224984,0.0002964217,0.00026073246,0.00026953235,0.00037251707],"domain_scores_gemma":[0.9991614,0.00005511086,0.000044408935,0.0003784077,0.00011483417,0.0002458368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021715432,0.00024076806,0.0002937534,0.0004328183,0.000050448652,0.00004849349,0.00021930157,0.00013558599,0.000005480959],"category_scores_gemma":[0.00003291673,0.00023373157,0.00004136031,0.001637414,0.000035853544,0.00021080479,0.000018596253,0.0002746148,0.00006477789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057811616,0.0002637108,0.043276686,0.00009922227,0.00016301453,0.0001543475,0.0050947065,0.0031035903,0.03240186,0.9092875,0.004988296,0.00058892334],"study_design_scores_gemma":[0.009746278,0.0017675156,0.12558833,0.00051847746,0.00007154757,0.000057889112,0.0019230628,0.00092077104,0.04532906,0.80952543,0.002845549,0.001706081],"about_ca_topic_score_codex":0.00020413671,"about_ca_topic_score_gemma":0.00017423343,"teacher_disagreement_score":0.09976209,"about_ca_system_score_codex":0.000092472794,"about_ca_system_score_gemma":0.000033300526,"threshold_uncertainty_score":0.9531297},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9698524,0.000567626,0.016501483,0.0012824483,0.0020186848,0.0003949342,8.448225e-7,0.00030940634,0.009072209],"genre_scores_gemma":[0.99439424,0.00003235477,0.005180995,0.0002097086,0.000003939109,0.000025674006,9.392918e-7,0.000011903417,0.00014021795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828386,0.00025141734,0.00019951067,0.0004519833,0.00036454428,0.00044868593],"domain_scores_gemma":[0.9985923,0.0002860372,0.0000623872,0.0008248248,0.00011795684,0.00011649887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007063431,0.00014028518,0.00019902688,0.00021340665,0.00009330426,0.00007442784,0.0012282601,0.00006524467,0.0000062419113],"category_scores_gemma":[0.00022551932,0.00013807967,0.00006227902,0.0010046891,0.00012735926,0.0004821481,0.00028212083,0.00023226203,0.00010101321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060340153,0.00004002277,0.0042039608,0.000006042612,0.0000051947613,0.000015774063,0.00015454077,0.000039382026,0.00034195185,0.9895773,0.00029520117,0.0053145858],"study_design_scores_gemma":[0.00055859215,0.00009754976,0.0046645394,0.000022208334,9.64123e-7,0.00000409968,0.000020207712,0.0026046005,0.00263989,0.9864376,0.0027833066,0.00016643912],"about_ca_topic_score_codex":0.000013862798,"about_ca_topic_score_gemma":0.00001092362,"teacher_disagreement_score":0.024541905,"about_ca_system_score_codex":0.00003917441,"about_ca_system_score_gemma":0.000032310996,"threshold_uncertainty_score":0.56307256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97087187,0.000008216152,0.000010835138,0.000073785915,0.000088756875,0.00022898678,0.000008227605,0.000026759815,0.028682567],"genre_scores_gemma":[0.9991542,0.0000035893652,0.00058492564,0.000020657828,0.0000018424763,0.00003161425,0.0000010105106,0.000015660822,0.0001864806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992899,0.000062688174,0.00021759162,0.00012645205,0.00015739894,0.00014601242],"domain_scores_gemma":[0.99888015,0.00033481923,0.00018727541,0.0004915682,0.00006633659,0.000039844384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024582667,0.00011170512,0.00019183071,0.000039883926,0.00006582487,0.000003953971,0.00025375455,0.000044568926,0.00033548658],"category_scores_gemma":[0.000049832746,0.000072069866,0.000083604544,0.0003011671,0.00021260073,0.000035447385,0.00002217186,0.00011714989,0.000022222051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068091744,0.00039744604,0.004208555,0.000018169476,0.00007272251,0.0000013121609,0.0010935466,2.0742894e-7,0.00032562471,0.99271286,0.0010793202,0.00002213944],"study_design_scores_gemma":[0.00039106782,0.00013412462,0.0018479736,0.000042083266,0.00005280719,0.0000045546517,0.00012752766,0.0000035682976,0.03744078,0.9597843,0.0000880141,0.00008319027],"about_ca_topic_score_codex":0.000017647519,"about_ca_topic_score_gemma":0.0000053941803,"teacher_disagreement_score":0.037115157,"about_ca_system_score_codex":0.000006166392,"about_ca_system_score_gemma":0.000016693584,"threshold_uncertainty_score":0.36733428},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79768723,0.00002097383,0.0000061716473,0.000059521753,0.0022493456,0.00007024706,0.0000018633696,0.000053103788,0.19985154],"genre_scores_gemma":[0.9973088,0.000002182887,0.000109516244,0.00030277076,0.000008845018,0.0000051466623,0.0000017224908,0.00000997429,0.0022510374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983443,0.00014240501,0.00029992862,0.0003169056,0.00071189465,0.00018458729],"domain_scores_gemma":[0.99880004,0.0004336581,0.00010830368,0.0004836591,0.00007592931,0.000098397024],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012704376,0.000104402396,0.00014622562,0.00013386707,0.00016832225,0.00006350405,0.000469464,0.00008111522,0.0012663897],"category_scores_gemma":[0.00075896183,0.00008134797,0.00008112032,0.000316209,0.00008390171,0.00027202006,0.00008236253,0.00015331066,0.0039227037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062767234,0.00011323092,0.025596043,5.7538216e-7,0.000006187262,0.000009057933,0.0013393328,0.0000012661546,0.00009079062,0.96681565,0.0032847116,0.0026803953],"study_design_scores_gemma":[0.00034844124,0.00016623954,0.11072839,0.000006479743,0.0000032772368,0.000002631734,0.0003030872,0.000026352904,0.0008171683,0.8837965,0.0037022997,0.00009911822],"about_ca_topic_score_codex":0.000014876697,"about_ca_topic_score_gemma":0.000002226227,"teacher_disagreement_score":0.19962157,"about_ca_system_score_codex":0.0000438522,"about_ca_system_score_gemma":0.000021566933,"threshold_uncertainty_score":0.9996466},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9936292,0.00010949953,0.00064564036,0.0003726252,0.0021219924,0.00011072274,0.0000015136449,0.00020507495,0.0028036865],"genre_scores_gemma":[0.9963335,0.0000049628184,0.0033419393,0.00022163658,0.0000012044374,0.0000059057056,0.000003893286,0.000014956518,0.000071997085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984292,0.0001240291,0.00033622474,0.00043267265,0.00035627882,0.00032161546],"domain_scores_gemma":[0.9985196,0.00028394914,0.00011533711,0.00078635087,0.00017514924,0.00011960797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046030304,0.0001848224,0.0002748616,0.00020197438,0.00012856758,0.0000689455,0.0005805672,0.00007613815,0.000016310694],"category_scores_gemma":[0.00017485248,0.00016093107,0.000114513394,0.0005518637,0.00008792643,0.00022895563,0.00017160218,0.00017997132,0.00010011708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057991615,0.00015585807,0.001030798,0.000012081745,0.000017444445,0.000002194048,0.00015361528,0.00010654468,0.005790163,0.9909355,0.0006332214,0.0011567982],"study_design_scores_gemma":[0.0009953409,0.0002882197,0.00081363483,0.000059693557,0.000009840132,0.00000581113,0.000007380309,0.011060199,0.009458599,0.9770294,0.000056163277,0.00021573577],"about_ca_topic_score_codex":0.00004085565,"about_ca_topic_score_gemma":9.86963e-7,"teacher_disagreement_score":0.013906099,"about_ca_system_score_codex":0.000011080901,"about_ca_system_score_gemma":0.000029789835,"threshold_uncertainty_score":0.65625787},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959864,0.000027685259,0.000018441799,0.000032486427,0.0003027008,0.00020322473,0.0000074750565,0.000008580261,0.0034130309],"genre_scores_gemma":[0.9997336,0.0000022502102,0.0002065084,0.000010071596,0.0000010853599,0.000009557912,5.1777437e-7,0.000007082205,0.000029300718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999369,0.000092115544,0.00025569825,0.00007179003,0.0001432955,0.00006808114],"domain_scores_gemma":[0.99899334,0.00014385927,0.00038620725,0.00036319726,0.00010002754,0.000013355684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025166673,0.000062010295,0.00013474352,0.000033644013,0.00006061472,0.000001621825,0.00034968922,0.000043338514,0.000012321717],"category_scores_gemma":[0.00006349926,0.0000365554,0.00010867745,0.00035438294,0.00024705735,0.000036774614,0.000073606185,0.00006910276,8.754362e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005154899,0.00021920544,0.012472569,0.000053019485,0.000026243748,1.8627109e-8,0.0016950544,8.4948687e-7,0.0018405836,0.9834268,0.00018762276,0.00007285236],"study_design_scores_gemma":[0.00019004832,0.000020673719,0.036862727,0.000042982316,0.000040601575,3.5281613e-7,0.00015592632,0.000009118485,0.08006825,0.88255733,0.000018635208,0.000033362827],"about_ca_topic_score_codex":0.000025854779,"about_ca_topic_score_gemma":0.0000054617744,"teacher_disagreement_score":0.10086951,"about_ca_system_score_codex":0.0000035484095,"about_ca_system_score_gemma":0.000019841562,"threshold_uncertainty_score":0.14906861},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99572486,0.000016034292,0.00000748771,0.0004079385,0.00012419632,0.00040067462,0.0000027608567,0.000022582526,0.0032934844],"genre_scores_gemma":[0.9996387,0.000002161805,0.00008280431,0.000031457646,0.0000017353332,0.00007899212,0.0000011144994,0.000010971733,0.00015210957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935865,0.000066692424,0.0002149463,0.000111951565,0.00014717724,0.00010055756],"domain_scores_gemma":[0.99870217,0.00042331527,0.00015817289,0.0005626278,0.00013014041,0.00002357213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002560273,0.0000799627,0.00014353932,0.000050317853,0.000052055635,0.000005515899,0.00024088673,0.000034449615,0.00013647154],"category_scores_gemma":[0.00023841824,0.000051823677,0.00006519753,0.00031792265,0.00012322863,0.000042656753,0.000031644493,0.0000961669,0.000020833188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048449187,0.00024347022,0.00091817364,0.000020367817,0.000025682044,5.3208755e-8,0.00016246634,0.0000010532546,0.0033624966,0.9907145,0.004398654,0.00014826929],"study_design_scores_gemma":[0.00017948727,0.00004004683,0.0051576905,0.000023035294,0.00001295956,3.5151385e-7,0.000042404154,0.000017828099,0.031074377,0.96332276,0.00007577132,0.00005328406],"about_ca_topic_score_codex":0.000023982226,"about_ca_topic_score_gemma":0.0000011039816,"teacher_disagreement_score":0.02771188,"about_ca_system_score_codex":0.0000042976444,"about_ca_system_score_gemma":0.00001228925,"threshold_uncertainty_score":0.21133082},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22952439,0.0006193581,0.5693069,0.0019494627,0.00041526425,0.0027877637,0.00016230778,0.00030733988,0.19492719],"genre_scores_gemma":[0.99603736,0.000008468358,0.0017959264,0.000052976542,0.00002721159,0.0008477195,0.000026873777,0.000023777922,0.001179687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916023,0.000015093875,0.00021128793,0.00028332046,0.0000809376,0.00024914165],"domain_scores_gemma":[0.99912184,0.00016721892,0.000099959405,0.00040959235,0.000066729095,0.00013467947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050199822,0.00017912322,0.00019728538,0.000011566014,0.00023580193,0.00007814641,0.0001875563,0.00003083816,0.00033402236],"category_scores_gemma":[0.0000051204347,0.00015144232,0.00005608888,0.0001782546,0.00014572343,0.00020284245,0.000070814276,0.00012633181,0.00018169399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017035444,0.00008618228,0.0015053103,0.000012765526,0.000017874076,5.1499267e-8,0.00011792535,0.0000011682621,0.000073333795,0.9903716,0.00138884,0.0064232666],"study_design_scores_gemma":[0.00023789589,0.000007370948,0.00026711528,0.000012984703,0.0000069238217,4.9761564e-7,0.00059058965,0.00010048605,0.00032304676,0.95110315,0.04716948,0.00018044727],"about_ca_topic_score_codex":0.000068171794,"about_ca_topic_score_gemma":0.000001660903,"teacher_disagreement_score":0.766513,"about_ca_system_score_codex":0.000021907577,"about_ca_system_score_gemma":0.00001339483,"threshold_uncertainty_score":0.6175639},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.994579,0.00020252253,0.000023498682,0.00014242485,0.00023977089,0.00025460578,0.000004313677,0.00004444155,0.0045094215],"genre_scores_gemma":[0.999071,0.000010649231,0.0006918726,0.00003935279,0.000007476011,0.000051343955,0.0000018422568,0.000022340528,0.000104134546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991059,0.00009323821,0.00022113942,0.00011897132,0.00019662417,0.00026417346],"domain_scores_gemma":[0.9987688,0.00043170477,0.00015817618,0.00050856435,0.00005511626,0.00007762359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047959885,0.00012654027,0.00017559172,0.000050125986,0.00018901734,0.000013493579,0.0002814777,0.000043911234,0.00005291783],"category_scores_gemma":[0.00007457305,0.0000797199,0.0000755726,0.00034133348,0.00017064507,0.00012202487,0.000048921,0.00013386887,0.000032321015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001683194,0.00025665932,0.0077602514,0.000030347284,0.00004842778,3.3775754e-7,0.0012319506,4.101251e-7,0.0012521079,0.98875725,0.00051724893,0.00012817349],"study_design_scores_gemma":[0.00042675284,0.00004810573,0.0052735214,0.00003755644,0.000113785245,0.0000100642355,0.0005685231,0.000011984278,0.010152795,0.9821341,0.0010932046,0.00012959812],"about_ca_topic_score_codex":0.000013599568,"about_ca_topic_score_gemma":0.000002949318,"teacher_disagreement_score":0.008900687,"about_ca_system_score_codex":0.000010678651,"about_ca_system_score_gemma":0.000018980307,"threshold_uncertainty_score":0.32508832},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97992647,0.000065280896,0.015817488,0.00002307143,0.0016213623,0.00008817379,0.000008609261,0.00011668812,0.0023328336],"genre_scores_gemma":[0.9928387,0.000011795491,0.0070705814,0.000036351943,0.000005589648,0.000008301909,0.0000034890911,0.0000058632536,0.000019335726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915314,0.000087932945,0.00020698177,0.00024999864,0.00014679167,0.00015518151],"domain_scores_gemma":[0.9988294,0.00036506695,0.00012324922,0.0005340217,0.00008874277,0.00005948988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015600432,0.00010475364,0.00014854532,0.00016522242,0.000108974564,0.000031581072,0.0004971582,0.000059325874,0.00018668264],"category_scores_gemma":[0.000077758035,0.00010759725,0.00009085124,0.0005417645,0.00012044235,0.0002733602,0.00012378668,0.00010939266,0.00002641066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000097564025,0.00011825877,0.018696707,0.0000043327977,0.000049970127,0.0000012328314,0.0016929146,0.0000022375475,0.0009069126,0.97604436,0.0000609714,0.0024123355],"study_design_scores_gemma":[0.00057237624,0.00006868125,0.030680247,0.0000229104,0.00002817183,0.0000017502828,0.00006400071,0.0020319568,0.009678348,0.9566479,0.00006512014,0.00013857703],"about_ca_topic_score_codex":0.00018311081,"about_ca_topic_score_gemma":0.000009767763,"teacher_disagreement_score":0.01939651,"about_ca_system_score_codex":0.000013139934,"about_ca_system_score_gemma":0.000027478773,"threshold_uncertainty_score":0.43876886},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97497207,0.00028861174,0.0029171938,0.0019307232,0.0014868389,0.0006910719,0.0000018298198,0.00028089536,0.017430753],"genre_scores_gemma":[0.99645245,0.000042737505,0.0016877298,0.0000789866,0.00002818364,0.000037789916,0.0000021463022,0.00002076726,0.0016491872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990549,0.00015726098,0.0002387192,0.00016006081,0.0002282626,0.000160761],"domain_scores_gemma":[0.9979128,0.0015027679,0.0001227132,0.0003586492,0.000058233043,0.00004480885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054794457,0.00010645776,0.00022242118,0.000027818009,0.00015646701,0.000055087556,0.00013300062,0.000050880946,0.000016115337],"category_scores_gemma":[0.0016233962,0.00007625659,0.000049400034,0.000088112414,0.0002605632,0.00027170609,0.000095672694,0.00011946737,0.000043871703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015818117,0.000032462456,0.00016487774,0.000043978664,0.000014847077,4.4290522e-7,0.00044467015,8.7893943e-7,0.00003583178,0.9967807,0.002370934,0.00009456365],"study_design_scores_gemma":[0.0014836439,0.0000175204,0.00027387706,0.000025616213,0.00003727833,0.000005915264,0.00020387737,0.0010252668,0.00035596802,0.99621034,0.00026723885,0.000093465125],"about_ca_topic_score_codex":0.00002657316,"about_ca_topic_score_gemma":0.000006468041,"teacher_disagreement_score":0.021480389,"about_ca_system_score_codex":0.000029818857,"about_ca_system_score_gemma":0.0000062450513,"threshold_uncertainty_score":0.31096536},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919047,0.0000052587966,0.0000061482383,0.00010607867,0.0009581392,0.00015888884,0.0000047767553,0.000021749076,0.0068342937],"genre_scores_gemma":[0.99968356,0.0000011515016,0.00012685091,0.000019215828,0.0000048985003,0.000013471786,8.6847507e-7,0.000009212081,0.00014079857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947256,0.000034750105,0.00017613146,0.00009147925,0.00013534735,0.00008971474],"domain_scores_gemma":[0.99913055,0.00017683339,0.0001435894,0.00047709068,0.00004809534,0.00002386671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022418251,0.00006989518,0.00011868055,0.00004242875,0.00007659741,0.0000050281315,0.0001983432,0.000057526133,0.000051938172],"category_scores_gemma":[0.000091907124,0.000050334922,0.00011262882,0.00025841044,0.0001405385,0.000027214792,0.000021379297,0.00018407522,0.00000487253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001893289,0.00023263658,0.0013348565,0.000015564088,0.00002056433,6.603125e-8,0.00012017315,2.0206336e-7,0.024163144,0.9732221,0.0007678213,0.00010396194],"study_design_scores_gemma":[0.00029671082,0.00007615774,0.009784748,0.0000115948005,0.00003326222,0.0000012743909,0.000026088837,0.00000471906,0.045442406,0.943819,0.00045770252,0.000046338864],"about_ca_topic_score_codex":0.000006431055,"about_ca_topic_score_gemma":0.000007639889,"teacher_disagreement_score":0.029403081,"about_ca_system_score_codex":0.0000045802235,"about_ca_system_score_gemma":0.000017744544,"threshold_uncertainty_score":0.20525984},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9795995,0.000008164565,0.00027187917,0.0005478113,0.00018219979,0.00017569918,6.7321463e-7,0.000054523603,0.019159595],"genre_scores_gemma":[0.99940175,0.0000042354654,0.000089738714,0.00022474986,0.0000062046765,0.000038818973,6.857965e-7,0.000011736771,0.00022207906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999445,0.00012851499,0.00011447757,0.00011023533,0.00009818793,0.00010358074],"domain_scores_gemma":[0.9981452,0.0014637872,0.00005670539,0.0002854737,0.000014665973,0.00003412534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006405629,0.00007839111,0.00012739415,0.000015444151,0.00021813091,0.000032030603,0.00013135433,0.000038470058,0.000035628003],"category_scores_gemma":[0.00016377265,0.00005111647,0.0000386411,0.00008147865,0.00010763664,0.000029695004,0.000034559165,0.00013553633,0.00006473337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032049757,0.00003716113,0.0002113075,0.00000883521,0.000011302346,1.4693477e-7,0.00045105198,5.597913e-7,0.00000988156,0.9981398,0.00082646904,0.00027144994],"study_design_scores_gemma":[0.002008556,0.000009351755,0.00046628527,0.000015935639,0.000016190119,0.000003470007,0.00005830971,0.00010235463,0.000049742703,0.99658394,0.00062127295,0.0000646187],"about_ca_topic_score_codex":0.0000075300104,"about_ca_topic_score_gemma":0.0000011025969,"teacher_disagreement_score":0.019802295,"about_ca_system_score_codex":0.0000052937253,"about_ca_system_score_gemma":0.000003706989,"threshold_uncertainty_score":0.2084469},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.981227,0.00009916252,0.014635934,0.00063047826,0.0017265896,0.000166457,6.0292183e-7,0.00005603478,0.0014577326],"genre_scores_gemma":[0.98810875,0.0000051250495,0.011655133,0.00008772554,0.000008306595,0.000009317326,0.0000036882727,0.000005075369,0.00011684967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899924,0.00008794126,0.00023964017,0.00028009532,0.00023463028,0.00015842775],"domain_scores_gemma":[0.9992346,0.00009813102,0.00008665485,0.00036574606,0.00017170105,0.000043155807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004145797,0.00009213202,0.00015154434,0.00019499686,0.000039006925,0.000029993947,0.00038499397,0.000042056225,0.0000042299303],"category_scores_gemma":[0.00016570881,0.000091725226,0.0000335593,0.00095023017,0.000020048084,0.00024574477,0.00009098449,0.00008191239,0.000022520437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044274375,0.0001298856,0.0024903533,0.00001996781,0.000005304534,0.0000015833083,0.0001708681,0.0009278011,0.0029043013,0.9802035,0.0008328563,0.012309168],"study_design_scores_gemma":[0.0008239674,0.00017041819,0.030292692,0.000024927747,0.0000032897112,0.000005044725,0.0000034804189,0.0518544,0.012413956,0.9007638,0.0034629272,0.00018107679],"about_ca_topic_score_codex":0.000018583594,"about_ca_topic_score_gemma":0.00000652195,"teacher_disagreement_score":0.07943966,"about_ca_system_score_codex":0.000018140743,"about_ca_system_score_gemma":0.000052681113,"threshold_uncertainty_score":0.37404463},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94018966,0.000048793125,0.009682441,0.00031534026,0.0002459712,0.00018018155,0.000026442929,0.000054051223,0.04925713],"genre_scores_gemma":[0.99631554,0.000005467542,0.001661084,0.00019926477,0.000026679692,0.00004027616,0.000081073544,0.000023986715,0.0016466492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923426,0.000041365987,0.0001635183,0.00024704967,0.0001076392,0.00020615797],"domain_scores_gemma":[0.9993431,0.00015474997,0.000067831475,0.00026954734,0.00004498905,0.00011976436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008330391,0.00015151214,0.00019939968,0.000010991548,0.00014791431,0.00005448915,0.00010491546,0.000037269663,0.0004025953],"category_scores_gemma":[0.000014707459,0.00014063968,0.000049461407,0.00012177273,0.000055695054,0.00008601582,0.000046310168,0.00010721859,0.00007505766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000518782,0.000109813256,0.00018048214,0.000004365898,0.000021594362,1.6017569e-7,0.000045658464,0.000011995214,0.0010075923,0.98957735,0.008026717,0.0010090938],"study_design_scores_gemma":[0.0007782404,0.000027816634,0.000018414596,0.000009438848,0.00001474173,4.7040402e-7,0.00006149973,0.0005345991,0.004499284,0.973479,0.020400291,0.00017620192],"about_ca_topic_score_codex":0.00003448884,"about_ca_topic_score_gemma":4.9174304e-7,"teacher_disagreement_score":0.05612587,"about_ca_system_score_codex":0.000012377253,"about_ca_system_score_gemma":0.000010044578,"threshold_uncertainty_score":0.57351196},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8473888,0.00021215277,0.009409137,0.000491329,0.012258748,0.0004157593,0.000004843564,0.000980373,0.12883887],"genre_scores_gemma":[0.9937016,0.000005465896,0.0044449433,0.0002835928,0.0000138220375,0.000010584178,7.043325e-7,0.000013049625,0.0015262859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988952,0.00008925328,0.00018569455,0.00033216813,0.00020018523,0.00029744813],"domain_scores_gemma":[0.9989188,0.00009736919,0.00007317441,0.0007466686,0.00003924533,0.00012476204],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033896446,0.00015297855,0.00015827635,0.000094339724,0.00012089425,0.00006810746,0.0010236127,0.00007309335,0.00022134639],"category_scores_gemma":[0.000038404803,0.00013782502,0.0000750298,0.00027111903,0.000037495636,0.0003166231,0.000200221,0.00014930857,0.0011683472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001249958,0.000120595636,0.00007823795,0.000003591139,0.000010397097,0.000027624475,0.00037443923,7.477217e-7,0.000080368205,0.9947168,0.002619932,0.0019547264],"study_design_scores_gemma":[0.0004999181,0.00019441982,0.00068524893,0.000011303262,0.000004262037,0.000009033001,0.000008563286,0.0004481712,0.008520317,0.9873499,0.002062636,0.00020622739],"about_ca_topic_score_codex":0.0000211253,"about_ca_topic_score_gemma":3.8758196e-7,"teacher_disagreement_score":0.14631276,"about_ca_system_score_codex":0.000026706439,"about_ca_system_score_gemma":0.000034443892,"threshold_uncertainty_score":0.99960935},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97857094,0.0009376043,0.0008917207,0.000031005486,0.00085593574,0.0003082675,0.0000055705896,0.00015428873,0.018244654],"genre_scores_gemma":[0.9998235,0.00003299706,0.0000210661,0.000022661117,0.0000058785636,0.000012699333,0.0000028229113,0.000021053324,0.000057310655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904585,0.000054395005,0.00024195893,0.00015011811,0.00022524696,0.00028245838],"domain_scores_gemma":[0.9991741,0.00026028437,0.0000617727,0.0003406164,0.00008585076,0.000077386736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023979857,0.00018523748,0.0002402839,0.00012864634,0.00010362447,0.00002838428,0.00025300516,0.00007128475,0.000006351035],"category_scores_gemma":[0.000025485444,0.00012715954,0.00008329541,0.0008425135,0.00012146636,0.000099263394,0.0000120169025,0.00014661773,0.000013162376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015216527,0.0001689785,0.0017631388,0.00006568828,0.00019649748,0.00002733911,0.0004686523,0.00084884086,0.0025708266,0.9831918,0.0014933533,0.009052747],"study_design_scores_gemma":[0.008476632,0.005997533,0.07592055,0.00086646475,0.00036944787,0.00008902762,0.0040055467,0.012876111,0.2055764,0.6773112,0.006229417,0.002281671],"about_ca_topic_score_codex":0.000009734188,"about_ca_topic_score_gemma":0.0000033085832,"teacher_disagreement_score":0.30588058,"about_ca_system_score_codex":0.000028232202,"about_ca_system_score_gemma":0.000018490613,"threshold_uncertainty_score":0.5185416},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99140203,0.000009518293,0.0003827301,0.0063895076,0.00061353063,0.00015183445,0.0000049962086,0.000033054017,0.001012776],"genre_scores_gemma":[0.9985838,0.000008890812,0.000084386105,0.0007957061,0.0000075086177,0.0000147454375,0.0000059124436,0.0000030101667,0.00049601716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990771,0.00012232325,0.000177158,0.00019228915,0.00026310407,0.00016807082],"domain_scores_gemma":[0.99899226,0.00012786846,0.00012544075,0.00065639534,0.000057998222,0.000040049566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016292393,0.00009197462,0.00013623154,0.000063267245,0.00013060446,0.00009385342,0.001202098,0.000041407307,0.00040736885],"category_scores_gemma":[0.00011532906,0.000043471056,0.0001014329,0.0011565223,0.00006652085,0.0001996714,0.00021253306,0.000102210004,0.00013075712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012674675,0.000064286294,0.0010662058,8.050292e-7,0.000017030665,4.136477e-7,0.00004953182,0.000002325448,0.0037357912,0.99070716,0.001069324,0.0032858371],"study_design_scores_gemma":[0.0003839723,0.00011149464,0.33518302,0.000008236032,0.00001591733,0.0000014200516,0.000009506227,0.011552661,0.007863371,0.64295304,0.0017660494,0.0001513328],"about_ca_topic_score_codex":0.000081764636,"about_ca_topic_score_gemma":0.0000032900336,"teacher_disagreement_score":0.34775415,"about_ca_system_score_codex":0.000016028567,"about_ca_system_score_gemma":0.000014792826,"threshold_uncertainty_score":0.44604033},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99077606,0.0016945407,0.00018124333,0.00021843455,0.0017974861,0.00033656866,0.00000787076,0.000052464995,0.0049353377],"genre_scores_gemma":[0.995048,0.000063793406,0.0013156136,0.00007037377,0.00004199006,0.00004123934,9.0855644e-7,0.000027688087,0.0033904333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993551,0.00004610295,0.00017165703,0.000098831275,0.000107743515,0.00022060797],"domain_scores_gemma":[0.99776644,0.0018222517,0.00008734983,0.0002148427,0.000028886498,0.00008026084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000823422,0.00012148192,0.0001816419,0.000025193738,0.00030506487,0.000040724728,0.000108422806,0.000063398074,0.000049158723],"category_scores_gemma":[0.00039822893,0.000090294656,0.000044268094,0.00003324941,0.0001853282,0.00017956537,0.000058296006,0.000082157705,0.0000134246175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011299906,0.00005640256,0.0004512728,0.000113060305,0.00004751609,2.8145658e-7,0.004034126,2.1103771e-8,0.000031499447,0.979648,0.015306331,0.00030021992],"study_design_scores_gemma":[0.0004884787,0.000026338266,0.00022965398,0.000021200516,0.00009806784,0.000017872619,0.0007733377,0.000013804268,0.00021168092,0.975508,0.022484552,0.00012703372],"about_ca_topic_score_codex":0.000005774655,"about_ca_topic_score_gemma":0.0000031919494,"teacher_disagreement_score":0.0071782214,"about_ca_system_score_codex":0.000020797015,"about_ca_system_score_gemma":0.000009755411,"threshold_uncertainty_score":0.3682109},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9837419,0.00046484772,0.00011242832,0.00020466732,0.0051530045,0.00017075462,0.0000022235988,0.00015467458,0.00999553],"genre_scores_gemma":[0.9965823,0.00002546291,0.0031375538,0.0001173148,0.000009951219,0.000009266801,0.0000020222767,0.000012076545,0.00010401354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985475,0.00006120399,0.00030938836,0.0002632559,0.00037580397,0.00044283798],"domain_scores_gemma":[0.99891436,0.00006217204,0.00016174541,0.000539705,0.000102392834,0.00021963485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045501045,0.0001628879,0.00025428133,0.00014889933,0.000109486,0.000036780868,0.00059300486,0.00008377252,0.000018950668],"category_scores_gemma":[0.000033640015,0.00015157707,0.000094675685,0.00047180336,0.00009524894,0.00037429127,0.000163187,0.00014974969,0.00008097382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008731783,0.00021316929,0.034003817,0.000012302048,0.000019528594,0.0000019012987,0.00047363137,0.0000017544867,0.000831524,0.9594167,0.004444592,0.00057234237],"study_design_scores_gemma":[0.001132566,0.00015411233,0.019380394,0.000047060803,0.00001768312,0.0000109193015,0.00003340681,0.000109128676,0.010024726,0.96216094,0.0066420287,0.0002870065],"about_ca_topic_score_codex":0.000042933054,"about_ca_topic_score_gemma":0.0000018390667,"teacher_disagreement_score":0.01462342,"about_ca_system_score_codex":0.000027704706,"about_ca_system_score_gemma":0.000044152624,"threshold_uncertainty_score":0.61811334},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97865695,0.00031174664,0.013657351,0.00042252897,0.0018430932,0.00031368117,0.0000040969544,0.00021684656,0.00457369],"genre_scores_gemma":[0.9945125,0.0000061875153,0.00528626,0.000045524346,0.0000061027445,0.000018682007,0.0000021944534,0.000014035835,0.00010853025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975391,0.00041003997,0.00035564232,0.000489661,0.0007772603,0.0004283075],"domain_scores_gemma":[0.99742264,0.0003304091,0.00012987034,0.0013487403,0.00048918073,0.00027919238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017404632,0.00017187824,0.00029404435,0.00019531969,0.00009687131,0.000046370824,0.0015460808,0.000094977404,0.000008289967],"category_scores_gemma":[0.0004252096,0.00016364404,0.00009082147,0.0011484975,0.0002850549,0.0005981462,0.00058624614,0.0002834642,0.000042597898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035367935,0.00018076689,0.0058266306,0.000015124605,0.000016550786,0.00001384586,0.00036659822,0.000037616494,0.001105648,0.98798436,0.00070588675,0.0037116092],"study_design_scores_gemma":[0.0008332407,0.0002707487,0.0027589053,0.000009276143,0.0000033398562,0.000008715563,0.000034242024,0.00063792657,0.019572195,0.97528857,0.000410783,0.00017203885],"about_ca_topic_score_codex":0.000045643385,"about_ca_topic_score_gemma":0.0000043999153,"teacher_disagreement_score":0.018466547,"about_ca_system_score_codex":0.00006617112,"about_ca_system_score_gemma":0.00018991056,"threshold_uncertainty_score":0.667321},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9899874,0.00018417697,0.000008829906,0.000779023,0.00062771543,0.00018946122,0.0000012181462,0.000052106807,0.008170099],"genre_scores_gemma":[0.99873406,0.0000242766,0.00040543516,0.000048924143,0.0000072861303,0.000067735506,0.0000017372511,0.000010417896,0.00070015417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992463,0.00012214668,0.00019024793,0.00012326712,0.00014305994,0.00017499442],"domain_scores_gemma":[0.9991371,0.00035036218,0.00006481332,0.00033344707,0.000049826394,0.000064468586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007872832,0.000082524275,0.00011036992,0.000028741995,0.000113611095,0.000037841193,0.00029245004,0.00004418068,0.000009938143],"category_scores_gemma":[0.00022585716,0.0000573501,0.00003821729,0.00024261887,0.00009288579,0.000062423926,0.000042642434,0.00010866678,0.0000670594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000836242,0.000059836457,0.0007893176,0.0000026733019,0.0000056647546,0.0000018478836,0.0004116697,0.0000011064934,0.000082102066,0.9930036,0.00551293,0.000120879355],"study_design_scores_gemma":[0.0005282421,0.000020203453,0.00018278773,0.000006085006,0.000006170086,0.0000024279598,0.00035235594,0.00005156388,0.00045703308,0.9913745,0.006940406,0.000078244026],"about_ca_topic_score_codex":0.000029567142,"about_ca_topic_score_gemma":0.00004616395,"teacher_disagreement_score":0.008746663,"about_ca_system_score_codex":0.000029664112,"about_ca_system_score_gemma":0.000034416436,"threshold_uncertainty_score":0.23386692},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58945197,0.000117190575,0.28792474,0.00032714015,0.005474765,0.0002790597,0.0000013261623,0.00047987708,0.11594393],"genre_scores_gemma":[0.97515637,0.000003914882,0.024055839,0.00026237825,0.00000904956,0.00001164273,0.0000032867213,0.000005443821,0.0004920652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924576,0.000032002317,0.00014009702,0.00021884586,0.00019211083,0.00017115363],"domain_scores_gemma":[0.9994812,0.000031906508,0.0000447755,0.00027118705,0.00009268292,0.000078241945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016486063,0.000087478096,0.00008252957,0.00005083788,0.00009751956,0.00005067142,0.000427002,0.00004022399,0.00012292892],"category_scores_gemma":[0.000022280963,0.00008733796,0.00004673939,0.00036622363,0.000013376655,0.0004801368,0.00013854884,0.00006869795,0.0004723135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026643827,0.00007525507,0.0010352321,0.0000023264088,0.000008551618,0.0000078005105,0.00034549105,0.0000052126015,0.00009263528,0.99171907,0.0016587597,0.0050469814],"study_design_scores_gemma":[0.0004058899,0.00006602508,0.011182054,0.000004868632,0.0000037610148,0.000023964021,0.00000559802,0.0072650774,0.003993693,0.9711501,0.0057375315,0.00016144823],"about_ca_topic_score_codex":0.000016531661,"about_ca_topic_score_gemma":0.0000013067969,"teacher_disagreement_score":0.3857044,"about_ca_system_score_codex":0.000022217653,"about_ca_system_score_gemma":0.00004790343,"threshold_uncertainty_score":0.60707915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96926045,0.00008346443,0.0037826127,0.00013310977,0.000605019,0.0002208574,0.000003471466,0.00023708327,0.025673952],"genre_scores_gemma":[0.98647785,0.0000025774286,0.010950566,0.000029698613,0.000015675289,0.000041673407,0.0000024326207,0.000038933125,0.002440615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910384,0.000033425906,0.00020052411,0.00011278563,0.00023628319,0.0003131509],"domain_scores_gemma":[0.999033,0.00036934318,0.000113010494,0.00029036586,0.00007169923,0.00012259469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016682848,0.00013541887,0.00019887781,0.000049385762,0.00009289667,0.000031425872,0.00014540677,0.00004454068,0.00017195269],"category_scores_gemma":[0.00040917116,0.00010931589,0.00004891063,0.00012921788,0.00009866726,0.0004243167,0.00006599305,0.0001320589,0.0002019705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051523966,0.00021516335,0.0011540516,0.000056716548,0.000029317991,0.0000026544706,0.0011628927,5.5001686e-7,0.000060222636,0.9957739,0.0014742959,0.00006506837],"study_design_scores_gemma":[0.000362413,0.000041568048,0.00074289343,0.00005222916,0.000045833593,0.000022651933,0.0006371258,0.000016436534,0.0011059344,0.9964475,0.00036953398,0.00015587718],"about_ca_topic_score_codex":0.000003516075,"about_ca_topic_score_gemma":0.0000036750923,"teacher_disagreement_score":0.023233335,"about_ca_system_score_codex":0.000061259314,"about_ca_system_score_gemma":0.000016625576,"threshold_uncertainty_score":0.44577727},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7903169,0.000024050527,0.18743166,0.0023228987,0.0014279225,0.00055519445,0.0000026758782,0.0021794972,0.0157392],"genre_scores_gemma":[0.98273003,0.000005737631,0.016419522,0.0005222427,0.0000070518654,0.000058999627,0.000010141165,0.00001398334,0.00023229542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884784,0.000037998496,0.00020050736,0.00035445605,0.00030649162,0.0002526845],"domain_scores_gemma":[0.9990662,0.000032662236,0.000115145165,0.00051292777,0.00017933869,0.00009377746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013139048,0.00014896426,0.00013679413,0.00016254255,0.00009386059,0.0008575331,0.0009794335,0.000067315545,0.00001363141],"category_scores_gemma":[0.00005095782,0.0001407164,0.000048218906,0.0005375044,0.00005776758,0.002224624,0.00018504186,0.00012613543,0.00035671407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011370405,0.000114877635,0.0007530274,0.000014061727,0.000011627145,0.000010465957,0.000089050314,3.0197774e-7,0.037691027,0.7886602,0.00075307395,0.17190114],"study_design_scores_gemma":[0.00019704098,0.0001680088,0.009517433,0.00006147608,0.0000032830806,0.000006785196,0.00000210641,0.0008468201,0.04445004,0.94313,0.0013370613,0.0002799244],"about_ca_topic_score_codex":0.000014605387,"about_ca_topic_score_gemma":1.8116293e-7,"teacher_disagreement_score":0.19241312,"about_ca_system_score_codex":0.000033571334,"about_ca_system_score_gemma":0.000052060175,"threshold_uncertainty_score":0.8269211},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9508126,0.000036370813,0.0009482833,0.0013700535,0.018237423,0.0024966414,0.000030281717,0.00097606337,0.02509229],"genre_scores_gemma":[0.99661744,0.0000032292069,0.0017218284,0.00042352272,0.00018108787,0.0003144012,0.000007295226,0.00017092758,0.00056025427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958264,0.00035661695,0.00079269253,0.0006133213,0.001680667,0.0007302681],"domain_scores_gemma":[0.99372613,0.0034025565,0.00043704888,0.0016343385,0.00047512937,0.00032478623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015643776,0.00061829295,0.00070866494,0.00013139939,0.0003665849,0.00021353812,0.001005274,0.0002612755,0.000044565302],"category_scores_gemma":[0.006796081,0.00047539434,0.00023113815,0.00043930448,0.00023878057,0.00033778284,0.00021468019,0.00077303516,0.00041316196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001667694,0.0009786681,0.000033819855,0.0000962377,0.000040860545,0.000018796694,0.0005625138,0.003502311,0.000014669215,0.98083603,0.0137299765,0.000019314384],"study_design_scores_gemma":[0.003052248,0.00040264297,0.0000022293377,0.00022214914,0.000079179816,0.000004639837,0.00017645046,0.055462547,0.0005363624,0.9393726,0.0001712849,0.00051764277],"about_ca_topic_score_codex":0.000005835068,"about_ca_topic_score_gemma":8.8690126e-7,"teacher_disagreement_score":0.051960237,"about_ca_system_score_codex":0.000606252,"about_ca_system_score_gemma":0.00036341773,"threshold_uncertainty_score":0.99976975},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99722695,0.000028870949,0.0007429778,0.000036114438,0.0001766831,0.00006753514,0.0000029616988,0.000012722985,0.0017051703],"genre_scores_gemma":[0.99834704,0.0000033395768,0.0015056343,0.000041044168,0.000013734318,0.000004126016,0.000037785605,0.0000054738407,0.000041802334],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952185,0.000045151144,0.00011378018,0.00015840362,0.000056699617,0.000104091814],"domain_scores_gemma":[0.9996128,0.000029531237,0.00007300463,0.00017580861,0.00007477884,0.000034053024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010383174,0.000070388785,0.00009264354,0.000016031752,0.00005070948,0.000007898523,0.000094830044,0.000048761314,0.000004235155],"category_scores_gemma":[0.00007863764,0.00005321102,0.000032268807,0.00005903071,0.00011685798,0.0000017109644,0.000043133212,0.000041447667,0.0000029806033],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065392676,0.00011203349,0.15228498,0.00001437206,0.000049407077,3.507665e-7,0.00003421923,0.000029093144,0.726737,0.118454605,0.00013011886,0.0020883735],"study_design_scores_gemma":[0.0042111464,0.0019333471,0.06076136,0.000063845364,0.00007138802,0.000033885695,0.00023855947,0.0022043148,0.87150127,0.050994266,0.007460489,0.000526107],"about_ca_topic_score_codex":0.000010302547,"about_ca_topic_score_gemma":0.0000052482533,"teacher_disagreement_score":0.14476424,"about_ca_system_score_codex":0.0000033326482,"about_ca_system_score_gemma":0.000012998208,"threshold_uncertainty_score":0.21698824},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98520356,0.0015375284,0.0010487122,0.00034920083,0.0043830373,0.000118238866,9.797774e-7,0.0002101017,0.0071486607],"genre_scores_gemma":[0.99470913,0.000021611595,0.0050254706,0.00012603475,0.0000015054936,0.0000033358801,0.0000011530234,0.000009003694,0.00010277573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988171,0.00006109142,0.00026419386,0.00021245272,0.00027559945,0.00036956242],"domain_scores_gemma":[0.99892247,0.00007975931,0.00011412611,0.00061864656,0.000105932515,0.0001590411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004884694,0.00013076165,0.000192996,0.00015783665,0.00005891474,0.000032236083,0.0005922929,0.00006158634,0.00002241159],"category_scores_gemma":[0.00004457026,0.00011640595,0.000097343844,0.00063266227,0.00007737121,0.0003945747,0.00016857465,0.00014538698,0.000115501236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017763393,0.00017100267,0.00902407,0.000009405789,0.000013495861,0.0000015067031,0.00035337493,0.000002593881,0.0018064493,0.9861714,0.0018401574,0.00060471497],"study_design_scores_gemma":[0.00037876624,0.00008333541,0.0031311612,0.000021931364,0.0000074415916,0.000009665946,0.0000164265,0.00034595028,0.010376681,0.9849148,0.0005611527,0.00015269991],"about_ca_topic_score_codex":0.000041835494,"about_ca_topic_score_gemma":7.13399e-7,"teacher_disagreement_score":0.009505569,"about_ca_system_score_codex":0.000014310289,"about_ca_system_score_gemma":0.000029316443,"threshold_uncertainty_score":0.4746897},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9955095,0.00037911854,0.000042517273,0.00010768203,0.0020240864,0.000104792045,5.7943214e-7,0.00005981506,0.0017718824],"genre_scores_gemma":[0.99820834,0.000005767321,0.0017128155,0.00003431689,9.66078e-7,0.0000056104454,4.895575e-7,0.0000065509475,0.000025122075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990155,0.00004938501,0.00024412053,0.00018460963,0.00026338082,0.00024301023],"domain_scores_gemma":[0.9990044,0.00007898625,0.00014199568,0.00057852856,0.00010957785,0.00008648523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045110652,0.00009683111,0.00018441313,0.0001463625,0.00004498875,0.000009005273,0.00038258822,0.000033980792,0.0000033566273],"category_scores_gemma":[0.000069447466,0.00008641834,0.0000673442,0.0005071279,0.00005434781,0.00020857733,0.00009506611,0.00008582142,0.0000109578505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003534234,0.00021517614,0.0080833305,0.00002123979,0.000012837804,4.5938177e-7,0.00041946088,0.000012591008,0.0053138076,0.9846846,0.0004015098,0.0008314435],"study_design_scores_gemma":[0.0004013908,0.00019428905,0.0071117007,0.00004982262,0.000007689351,0.0000023217046,0.000010447106,0.00012529556,0.11965418,0.8722513,0.00007743474,0.000114186194],"about_ca_topic_score_codex":0.00003213521,"about_ca_topic_score_gemma":3.1832928e-7,"teacher_disagreement_score":0.11434037,"about_ca_system_score_codex":0.000009065044,"about_ca_system_score_gemma":0.000025076619,"threshold_uncertainty_score":0.35240376},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959998,0.002111674,0.000092713395,0.00038329713,0.0007067995,0.000105084626,0.0000015139008,0.00002489845,0.0005742079],"genre_scores_gemma":[0.99840456,0.000050306317,0.0012088403,0.00032535533,6.575196e-7,0.000005339615,0.0000014632226,0.0000020029345,0.000001467536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991994,0.000107902815,0.00016568764,0.00013817115,0.00019716259,0.0001916695],"domain_scores_gemma":[0.99947315,0.000088940964,0.00007904361,0.00024411464,0.00006584744,0.000048890364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039496276,0.00008090199,0.00011836535,0.00003822956,0.00006527515,0.000031556574,0.00028271126,0.000038465267,9.0476556e-7],"category_scores_gemma":[0.000014589236,0.000059396294,0.000029834562,0.00040869555,0.00008690962,0.00024932114,0.00008079609,0.000060837858,0.000003946502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029589137,0.00008773302,0.06542704,0.0000066944217,0.000005277556,0.00000142245,0.0005708042,0.0000056253443,0.0001925965,0.9326443,0.0004853142,0.0005702196],"study_design_scores_gemma":[0.00043053617,0.00006914925,0.13152695,0.000026820993,0.000005718614,0.000018275297,0.000066314686,0.00032649504,0.00038865488,0.86699134,0.00006900975,0.0000807482],"about_ca_topic_score_codex":0.000074694246,"about_ca_topic_score_gemma":0.0000055016562,"teacher_disagreement_score":0.066099904,"about_ca_system_score_codex":0.00001036891,"about_ca_system_score_gemma":0.000012470391,"threshold_uncertainty_score":0.24221106},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97033155,0.00002882528,0.0009707766,0.0002478257,0.000053341646,0.00013389168,0.0000029572745,0.0000067766023,0.02822408],"genre_scores_gemma":[0.99920183,0.000003684189,0.00019368595,0.00001754701,0.000008737888,0.000008008277,7.730257e-7,0.0000067992373,0.00055893336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996274,0.000016089829,0.00012932357,0.00007987547,0.000070842514,0.00007647698],"domain_scores_gemma":[0.99950105,0.00015870883,0.00007645685,0.00020367603,0.000030800562,0.00002933315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007083016,0.000067991394,0.00013270264,0.000008367341,0.000046924335,0.000006796888,0.00009543073,0.000012591278,0.000053523425],"category_scores_gemma":[0.000022384476,0.000042035186,0.000033905966,0.000058105332,0.00011856322,0.000026703681,0.000037971244,0.000052680152,0.000010541867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053074223,0.000055820565,0.00021816422,0.000015511025,0.000012157573,5.884038e-9,0.0003888599,0.000004747612,0.00089342456,0.9967801,0.000342195,0.0012837136],"study_design_scores_gemma":[0.00017765607,0.000039505358,0.000069076625,0.00003230987,0.000010250384,5.974467e-8,0.00065116107,0.00008055633,0.025088245,0.97244453,0.0013585632,0.000048059606],"about_ca_topic_score_codex":0.000048491762,"about_ca_topic_score_gemma":2.7652945e-7,"teacher_disagreement_score":0.028870307,"about_ca_system_score_codex":0.000002166914,"about_ca_system_score_gemma":0.000010727761,"threshold_uncertainty_score":0.17141452},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94247407,0.00016777599,0.030860264,0.00021585423,0.006802187,0.00025971173,0.000002596453,0.00013166701,0.019085888],"genre_scores_gemma":[0.9988321,0.000024597603,0.00088808313,0.00008236929,0.000019287214,0.0000050388744,0.0000017954164,0.0000055217147,0.00014118137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987851,0.00006407678,0.00046311333,0.00023936579,0.00023315384,0.000215197],"domain_scores_gemma":[0.9988213,0.00014735702,0.000248164,0.0005081888,0.0002116192,0.000063330495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022976572,0.00014057511,0.000306636,0.00016145832,0.00009048118,0.0000417497,0.00048034775,0.0000997045,0.000014494926],"category_scores_gemma":[0.000016308488,0.00012840393,0.0001162298,0.0005510916,0.00008506195,0.00022581709,0.00005933307,0.0001588944,0.00000768543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030392894,0.00009440999,0.00032859558,0.0000058059186,0.000023824512,0.0000023060816,0.00019911802,0.010824578,0.000091641916,0.98487484,0.0016159586,0.0019085448],"study_design_scores_gemma":[0.010447197,0.0051501077,0.009691245,0.00083701714,0.000070504524,0.0001577083,0.0005451926,0.47407398,0.016899245,0.47552285,0.0052073826,0.0013975872],"about_ca_topic_score_codex":0.000033001874,"about_ca_topic_score_gemma":0.0000024337378,"teacher_disagreement_score":0.50935197,"about_ca_system_score_codex":0.000024762905,"about_ca_system_score_gemma":0.000041567204,"threshold_uncertainty_score":0.523616},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9905215,0.000031773867,0.00019181764,0.00028006182,0.00019017862,0.00023642283,0.0000031041725,0.000060699487,0.008484424],"genre_scores_gemma":[0.9992887,0.000005965672,0.00042948924,0.000027511265,0.000005619061,0.000056743094,0.0000016994485,0.00002187499,0.00016239074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990742,0.000100329,0.0002542648,0.0001646763,0.00020195353,0.0002045695],"domain_scores_gemma":[0.99828345,0.000769712,0.00017432602,0.0006085365,0.000098536126,0.00006546607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000550617,0.00012800893,0.00018840883,0.00004476832,0.00022820383,0.000023077204,0.00033297305,0.000057637524,0.000012590392],"category_scores_gemma":[0.00014491241,0.00008271916,0.00007973824,0.00026335006,0.0002873427,0.00004684127,0.000054528376,0.00014709901,0.000014572869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003293619,0.00014117341,0.003001148,0.000021653039,0.00003647008,3.1703254e-7,0.00018381397,8.0931864e-7,0.0002686981,0.99415946,0.0013162553,0.0008372776],"study_design_scores_gemma":[0.0005479926,0.00011041264,0.0053625004,0.000026854656,0.00003159504,0.000003409096,0.00015070269,0.0000617732,0.0026825324,0.98863477,0.0022753507,0.000112104724],"about_ca_topic_score_codex":0.000008360908,"about_ca_topic_score_gemma":0.00001140621,"teacher_disagreement_score":0.0087671885,"about_ca_system_score_codex":0.000009377416,"about_ca_system_score_gemma":0.000024008094,"threshold_uncertainty_score":0.33731896},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9382603,0.000035717254,0.00027653234,0.00021909823,0.0015221774,0.00015922195,0.00000318395,0.00015969525,0.05936405],"genre_scores_gemma":[0.99270433,0.0000025641561,0.0016183666,0.00006672882,0.000022501818,0.000021263791,0.000009294993,0.000031010735,0.0055239336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990048,0.00003369399,0.00017512459,0.00018330618,0.0003522701,0.0002508392],"domain_scores_gemma":[0.9990924,0.00009180234,0.00010287166,0.00037301757,0.00012900234,0.00021091448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002764112,0.00014596053,0.00019014099,0.000064227526,0.00009979007,0.000033272518,0.00015383052,0.00008245624,0.00016672173],"category_scores_gemma":[0.000120534045,0.000111560796,0.0000352753,0.00024785052,0.00006589693,0.00019426133,0.00004771633,0.00016967978,0.00016438651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043729193,0.0002262755,0.006274457,0.000020622025,0.00006308587,0.000034316414,0.0007373993,0.000003583542,0.000018442628,0.9377152,0.05460501,0.00025791442],"study_design_scores_gemma":[0.002366519,0.0003519576,0.00082358386,0.000048242182,0.00010936359,0.00007260699,0.0008270336,0.000121222176,0.00034447183,0.9631191,0.03149402,0.00032188304],"about_ca_topic_score_codex":0.00009159241,"about_ca_topic_score_gemma":0.00004581044,"teacher_disagreement_score":0.05444401,"about_ca_system_score_codex":0.00007581122,"about_ca_system_score_gemma":0.00013174882,"threshold_uncertainty_score":0.4549317},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9576617,0.0002561696,0.00009469965,0.00024273572,0.0023904499,0.00014158519,0.0000031457066,0.00018166307,0.039027866],"genre_scores_gemma":[0.9973096,0.000015425108,0.0023356634,0.00017395892,5.7510107e-7,0.000004380246,0.0000013191978,0.000011009111,0.00014805392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849284,0.00007757724,0.0003625046,0.00042831668,0.00033778264,0.00030098195],"domain_scores_gemma":[0.99858075,0.000078424026,0.00012702528,0.0009344638,0.0001736186,0.00010568809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048383453,0.00015881915,0.00019018234,0.00020366088,0.00007523313,0.000025575775,0.0007983895,0.00007946918,0.000018739876],"category_scores_gemma":[0.00007328552,0.00013300394,0.0000990916,0.0006660221,0.00010907012,0.00018617192,0.00014588622,0.00014289797,0.0001779883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021149017,0.00032630417,0.0010116406,0.0000067631777,0.000007894086,0.000006761843,0.0016945788,0.000003816427,0.00059258466,0.99377525,0.001647574,0.0009057045],"study_design_scores_gemma":[0.0009646051,0.00045428437,0.0038121382,0.000035896424,0.0000064982887,0.000003851501,0.000030880194,0.00022728104,0.010050916,0.98406345,0.00016905881,0.00018117337],"about_ca_topic_score_codex":0.0000939907,"about_ca_topic_score_gemma":0.0000017194277,"teacher_disagreement_score":0.03964793,"about_ca_system_score_codex":0.000010447492,"about_ca_system_score_gemma":0.000043299606,"threshold_uncertainty_score":0.5423744},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99400926,0.00001927739,0.0005021528,0.00017932394,0.0010069526,0.000118788674,0.0000010330386,0.000057114255,0.00410613],"genre_scores_gemma":[0.993356,0.000007763097,0.0065319445,0.00002267007,0.0000020769562,0.000014646353,6.191691e-7,0.000009418858,0.00005489082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988122,0.000074766576,0.00022881204,0.00028185852,0.00030112008,0.00030123047],"domain_scores_gemma":[0.9988231,0.00018543756,0.00006741092,0.0007505133,0.00008351982,0.0000899864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004832701,0.00010445737,0.00017509646,0.00015748583,0.00004221987,0.000029826295,0.0010198748,0.00006623426,0.000037810307],"category_scores_gemma":[0.00013007446,0.00009967092,0.00006345152,0.0008035507,0.00016452525,0.00037046292,0.00032593397,0.0003690117,0.000052402764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005598061,0.0001104071,0.058695942,0.000007030042,0.0000040751156,0.000010230353,0.00017183759,0.0000016943989,0.0052497606,0.9327429,0.000055266748,0.0029452387],"study_design_scores_gemma":[0.00042276646,0.000025103443,0.03891393,0.000010308066,7.074503e-7,0.00000742964,0.000013004564,0.00032787074,0.01034202,0.9496543,0.00017720606,0.00010536258],"about_ca_topic_score_codex":0.000035210785,"about_ca_topic_score_gemma":0.000029085664,"teacher_disagreement_score":0.01978201,"about_ca_system_score_codex":0.0000129354285,"about_ca_system_score_gemma":0.00004241121,"threshold_uncertainty_score":0.40644622},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9631061,0.000014673361,0.00018049065,0.0018068876,0.00032005663,0.0003041004,0.0000061875753,0.000044557786,0.034216966],"genre_scores_gemma":[0.9977839,0.0000014653019,0.0014692151,0.0001243711,0.0000040875025,0.0000455342,8.89895e-7,0.000016013453,0.00055453356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993152,0.0000397732,0.00023318574,0.000097962875,0.00020449143,0.00010939287],"domain_scores_gemma":[0.9986065,0.00057079433,0.00013574182,0.000530263,0.000096136864,0.000060555998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046310443,0.00008754783,0.00015594714,0.000029010635,0.000042451582,0.000015096417,0.00028172822,0.000036484787,0.00009176903],"category_scores_gemma":[0.0006738987,0.000056741752,0.0000522276,0.00012653937,0.000056389872,0.00002191839,0.00007210288,0.00009244887,0.00012265818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038570756,0.00011181046,0.000016235432,0.000014582335,0.000012370374,2.9941918e-7,0.00046154993,6.9824715e-8,0.00014389245,0.8732626,0.12592028,0.000052488267],"study_design_scores_gemma":[0.00026173986,0.0000587414,0.000010250016,0.000042515756,0.000013096125,0.0000015533894,0.00021319477,0.00016730257,0.0033598877,0.993224,0.0025848735,0.000062798485],"about_ca_topic_score_codex":0.000004841881,"about_ca_topic_score_gemma":0.0000012475153,"teacher_disagreement_score":0.12333541,"about_ca_system_score_codex":0.000021604228,"about_ca_system_score_gemma":0.000031626154,"threshold_uncertainty_score":0.23138614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9743698,0.00023166987,0.000024790224,0.00004942398,0.00083935744,0.00013241154,0.0000013001984,0.0004819564,0.023869252],"genre_scores_gemma":[0.99950737,0.0000060461125,0.00006279195,0.000045733574,0.0000146575585,0.000009388923,0.0000018197392,0.000022189028,0.00033000467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993348,0.000027991153,0.00013390297,0.0001323715,0.00012929089,0.00024161479],"domain_scores_gemma":[0.99958104,0.000031174142,0.000020026186,0.00026262764,0.00002494088,0.00008017343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011527992,0.00015440739,0.00017034991,0.00005049457,0.00010419463,0.000026952644,0.00015511464,0.000049833438,0.000021836633],"category_scores_gemma":[0.0000055475557,0.0001341905,0.000041049072,0.0002136663,0.000022175695,0.00009818638,0.00000872362,0.00012541375,0.000054114356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024026212,0.00007759559,0.00069083937,0.000018620312,0.000060193233,0.00003078899,0.00047939311,0.0014974378,0.006517703,0.9866757,0.003349864,0.00057783374],"study_design_scores_gemma":[0.003661757,0.0011590696,0.0049952096,0.00017031013,0.00007233025,0.000090764974,0.00016648804,0.0016313479,0.030837711,0.94447386,0.011747197,0.0009939722],"about_ca_topic_score_codex":0.0000036502988,"about_ca_topic_score_gemma":0.000001926013,"teacher_disagreement_score":0.04220186,"about_ca_system_score_codex":0.00002299026,"about_ca_system_score_gemma":0.000008205386,"threshold_uncertainty_score":0.54721296},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9949679,0.00003532641,0.000075153956,0.00048595114,0.000116635354,0.00037505577,0.0000039223955,0.00004780786,0.0038922823],"genre_scores_gemma":[0.9990201,0.0000075764146,0.00037760125,0.000018959363,0.0000035173184,0.00013313105,0.0000016462545,0.000018461002,0.00041901396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992911,0.00006256245,0.00019300065,0.0001260017,0.00015377872,0.00017353035],"domain_scores_gemma":[0.99859697,0.00060881855,0.00013419005,0.00050908263,0.00010016012,0.00005081088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019370508,0.000107304535,0.00015128615,0.000029904795,0.000161205,0.00003468391,0.00030442807,0.00004601871,0.000055937857],"category_scores_gemma":[0.00007028654,0.0000659911,0.000053435622,0.00020520393,0.00018882792,0.00008132721,0.000044081702,0.000106280146,0.000039271963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000943304,0.000119623626,0.0064772526,0.000011911293,0.00004459501,3.4342176e-7,0.00022837702,4.3920622e-7,0.0003720899,0.9889706,0.0027689359,0.0009964221],"study_design_scores_gemma":[0.00037644905,0.00008038838,0.010488637,0.000018750274,0.000021032727,0.0000017430898,0.00028580782,0.000023512743,0.0021433108,0.9853834,0.0010877242,0.00008927718],"about_ca_topic_score_codex":0.000040055562,"about_ca_topic_score_gemma":0.00003408301,"teacher_disagreement_score":0.0040522283,"about_ca_system_score_codex":0.000010249626,"about_ca_system_score_gemma":0.000017317321,"threshold_uncertainty_score":0.2691039},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98441154,0.0006202122,0.0039166696,0.0005015966,0.0032468277,0.00029122145,0.0000020009356,0.0005153508,0.0064946073],"genre_scores_gemma":[0.9950834,0.000016271613,0.0041727955,0.00017598564,0.00001469276,0.000038745256,0.0000023951598,0.000019356525,0.00047638017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979838,0.00018736445,0.00021072444,0.0003372821,0.0004311739,0.0008496403],"domain_scores_gemma":[0.99824023,0.0002626185,0.00007905228,0.0009227579,0.00016282477,0.00033250186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071931974,0.00018055977,0.0002035481,0.00019793748,0.00036149262,0.00006911026,0.0012758464,0.00009167279,0.00005298911],"category_scores_gemma":[0.00020028715,0.00017507609,0.000091275746,0.0012446932,0.000111127236,0.0010541062,0.0006489261,0.0002824425,0.00025328618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009839193,0.00018306251,0.008266816,0.0000047501826,0.000018935687,0.000006813053,0.0004563538,0.0000014447817,0.0013264442,0.98595345,0.001753678,0.0020183965],"study_design_scores_gemma":[0.00072924065,0.0002042129,0.011718412,0.000010048071,0.000004614634,0.000019738678,0.00003401989,0.00031978957,0.00700304,0.96915984,0.010498486,0.00029857905],"about_ca_topic_score_codex":0.000008129983,"about_ca_topic_score_gemma":0.00000181389,"teacher_disagreement_score":0.016793648,"about_ca_system_score_codex":0.00006359637,"about_ca_system_score_gemma":0.00005811566,"threshold_uncertainty_score":0.7139396},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97247005,0.00025674648,0.00071943173,0.00010272005,0.00036744165,0.0001230932,0.000002561737,0.000096684176,0.025861265],"genre_scores_gemma":[0.9967155,0.000029600002,0.0020423385,0.00009341225,0.000006689928,0.0000084102985,0.0000016841685,0.000014590711,0.0010878177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990734,0.000048499045,0.00022605652,0.00022297316,0.00019639556,0.00023269985],"domain_scores_gemma":[0.9992952,0.00014795506,0.000095788295,0.00027543106,0.000060551552,0.00012509595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033579368,0.00013261185,0.0002475915,0.00012467134,0.00010303285,0.00002146815,0.00017222778,0.00009067428,0.00041943722],"category_scores_gemma":[0.00031463522,0.00011230544,0.00006405087,0.00049864774,0.00010600337,0.0001237967,0.00009931059,0.00012385093,0.000066677254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051306365,0.00007190773,0.005314297,0.000014930829,0.00007678187,0.000027976808,0.00083855144,2.3167827e-8,0.0000090828535,0.9911695,0.0018615634,0.0006102437],"study_design_scores_gemma":[0.00038945157,0.00005887955,0.003584273,0.000009462464,0.00009635894,0.000015038566,0.00023761147,0.00011482594,0.00024155494,0.99486846,0.00022328942,0.00016080565],"about_ca_topic_score_codex":0.00029461633,"about_ca_topic_score_gemma":0.000015873307,"teacher_disagreement_score":0.024773447,"about_ca_system_score_codex":0.000029261182,"about_ca_system_score_gemma":0.000035990524,"threshold_uncertainty_score":0.45925432},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93939155,0.00010405803,0.050530635,0.00011786503,0.0024344993,0.00006525593,6.0569596e-7,0.00027060055,0.0070849387],"genre_scores_gemma":[0.9977316,0.00001704523,0.0016910702,0.00034905385,0.000017209648,0.000009517117,4.8200064e-7,0.000008197126,0.00017579584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988167,0.00012544947,0.00015935152,0.00034335427,0.0002675277,0.0002875788],"domain_scores_gemma":[0.9988853,0.00019959512,0.00006465688,0.00070058,0.000044018045,0.00010584992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032147585,0.00015370449,0.00016004517,0.00011130772,0.00016290751,0.00017176406,0.0010990992,0.000056049164,0.000028142353],"category_scores_gemma":[0.00005146536,0.0001408581,0.00009565956,0.00035785572,0.000076305514,0.00024676014,0.00029860585,0.00015391002,0.000079992824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048939223,0.00005207686,0.0073701623,0.000004511755,0.000006838721,0.0000027385356,0.00022927452,0.0000012653235,0.0009837357,0.96278435,0.00026619335,0.028293945],"study_design_scores_gemma":[0.00040282993,0.00011830313,0.06920004,0.000025796056,0.0000042130623,0.0000042681036,0.000006811514,0.0021239168,0.0011709966,0.92314297,0.0036064333,0.00019339767],"about_ca_topic_score_codex":0.000017036762,"about_ca_topic_score_gemma":0.0000020260886,"teacher_disagreement_score":0.061829876,"about_ca_system_score_codex":0.000014678159,"about_ca_system_score_gemma":0.000017111777,"threshold_uncertainty_score":0.5744027},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97518575,0.000029419905,0.016309055,0.00011453017,0.0047056573,0.00009098007,0.00000279208,0.00012940353,0.003432423],"genre_scores_gemma":[0.99639773,0.0000029138973,0.003469715,0.00007489226,0.000005064057,0.0000058503306,9.0068903e-7,0.0000085874135,0.00003433184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901366,0.00004191739,0.00018748958,0.0002784561,0.00026689013,0.00021157047],"domain_scores_gemma":[0.99874574,0.0002759748,0.00009464758,0.0007280224,0.000082755716,0.0000728457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004540249,0.00012426602,0.0001664837,0.000140216,0.00013801685,0.00008371655,0.0010259849,0.00007417563,0.00003536564],"category_scores_gemma":[0.000092242044,0.0001196541,0.00010331674,0.0004267178,0.00009277055,0.00025695554,0.0002005659,0.0002663323,0.000046366305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008966204,0.00011042317,0.0016542271,0.000009066081,0.000016950493,0.000004370156,0.00017271374,0.000006658976,0.005211084,0.9868912,0.00044692235,0.005467427],"study_design_scores_gemma":[0.000401692,0.00011053975,0.010910006,0.00003229846,0.0000061543924,0.000003898373,0.000009027802,0.0010110538,0.009812671,0.97739315,0.00016755183,0.00014196364],"about_ca_topic_score_codex":0.00001815178,"about_ca_topic_score_gemma":0.000026913161,"teacher_disagreement_score":0.021212006,"about_ca_system_score_codex":0.000007778257,"about_ca_system_score_gemma":0.000030868036,"threshold_uncertainty_score":0.48793525},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9909611,0.00008888383,0.0035594758,0.0005006765,0.002313797,0.00043801888,0.000017128816,0.00025846626,0.0018625059],"genre_scores_gemma":[0.9898831,0.0000059672375,0.009933302,0.00004815352,0.000008114512,0.00003181203,0.000004308409,0.000022261213,0.00006294899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973721,0.0002889214,0.0004670132,0.0006568006,0.00064920797,0.00056599575],"domain_scores_gemma":[0.995376,0.00069271954,0.00019627831,0.00297432,0.0004997739,0.00026090303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013283673,0.00023170133,0.00039120566,0.00024227847,0.00018151662,0.00008856791,0.0031338015,0.00017355151,0.00009083748],"category_scores_gemma":[0.0014944187,0.000224874,0.00018665113,0.001415206,0.00049037393,0.00070958864,0.00082974177,0.00067061716,0.00003943903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008688269,0.00026928363,0.0016270598,0.000018039349,0.000025283827,0.000015033164,0.00020283004,0.0000022578383,0.037724994,0.956551,0.00025325615,0.0032240502],"study_design_scores_gemma":[0.0018815384,0.0003614053,0.007737549,0.000009644513,0.0000061658193,0.00001599115,0.000023091754,0.00095861393,0.019053282,0.9692505,0.0004659915,0.00023623569],"about_ca_topic_score_codex":0.000047699283,"about_ca_topic_score_gemma":0.000041859836,"teacher_disagreement_score":0.018671712,"about_ca_system_score_codex":0.000029771252,"about_ca_system_score_gemma":0.00013549664,"threshold_uncertainty_score":0.9170096},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97804546,0.0016655102,0.005772541,0.0005043779,0.0050582383,0.0015515474,0.00011340396,0.00032761612,0.006961329],"genre_scores_gemma":[0.9750362,0.000034299075,0.016858889,0.00008572551,0.000079816076,0.0001239587,0.000010459803,0.0000980438,0.007672585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814045,0.00007501637,0.00068603834,0.00025666904,0.00046674363,0.00037508586],"domain_scores_gemma":[0.9973378,0.0012510157,0.00033783374,0.00056185666,0.00033897135,0.00017251943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007700069,0.00023538995,0.0006394011,0.00014293609,0.00007347313,0.000060822167,0.00038112022,0.0001444636,0.000026870339],"category_scores_gemma":[0.0021477763,0.00022623428,0.00017298877,0.00015894232,0.00019232243,0.00051266263,0.00018577612,0.00012377361,0.000036014688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026960235,0.00019581248,0.00006148871,0.0003780397,0.00009674869,0.0000029753717,0.00057383504,0.0000037570871,0.0004007853,0.9849671,0.013281967,0.000010527096],"study_design_scores_gemma":[0.0014088643,0.00013676462,0.000020529638,0.00009877165,0.00010865189,0.0000074301997,0.0016400318,0.000045489294,0.01020424,0.98593456,0.00015388109,0.00024079181],"about_ca_topic_score_codex":0.000039645576,"about_ca_topic_score_gemma":0.000007098642,"teacher_disagreement_score":0.013128086,"about_ca_system_score_codex":0.00015666841,"about_ca_system_score_gemma":0.00014643476,"threshold_uncertainty_score":0.9225566},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98911744,0.00007861835,0.000006767775,0.0003843484,0.0002954253,0.00018940568,0.0000015042382,0.00004806216,0.009878395],"genre_scores_gemma":[0.99945277,0.000022773911,0.00017382775,0.000035207202,0.0000012271114,0.000017964687,0.0000014457656,0.000006856934,0.00028791782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939066,0.000030471167,0.00019549787,0.000100257894,0.00013911413,0.00014399864],"domain_scores_gemma":[0.9991352,0.00023938727,0.00009366546,0.0004383861,0.000054310978,0.000039026414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027087764,0.00007752421,0.00011345228,0.000027828562,0.0001901016,0.000015046018,0.00028153975,0.00003982547,0.000013392853],"category_scores_gemma":[0.000042470023,0.000055962486,0.00007678126,0.00021425846,0.00006535226,0.000045978588,0.000020313908,0.000080124446,0.000019071218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023078128,0.00016288963,0.00014039896,0.000004029073,0.000014112775,3.1925185e-7,0.00012628309,1.1464568e-7,0.0010522391,0.99431944,0.0035559514,0.00060113514],"study_design_scores_gemma":[0.0006031056,0.000047776583,0.0013937592,0.000010837206,0.000016048165,0.0000010772252,0.00005433326,0.000006353486,0.00693744,0.9894499,0.001417366,0.00006200098],"about_ca_topic_score_codex":0.0000028534762,"about_ca_topic_score_gemma":8.687667e-7,"teacher_disagreement_score":0.010335306,"about_ca_system_score_codex":0.0000072193284,"about_ca_system_score_gemma":0.000010214952,"threshold_uncertainty_score":0.2282084},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9828403,0.00007770026,0.000016687341,0.0065205684,0.004965128,0.00036564906,0.000007388584,0.00014101688,0.0050655464],"genre_scores_gemma":[0.99705625,0.000014612778,0.00006812694,0.00037054354,0.000030567713,0.00005537921,0.000002800985,0.000027261956,0.0023744686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984728,0.00012880005,0.00030256814,0.0002462369,0.00034225086,0.0005073227],"domain_scores_gemma":[0.99662966,0.0021275908,0.00014965054,0.0008207219,0.00013677841,0.00013563076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010758693,0.00018746768,0.00023055861,0.00011242677,0.000663362,0.000099626406,0.0008285044,0.00016287263,0.00008429826],"category_scores_gemma":[0.003307518,0.00010403973,0.00014947233,0.0011565661,0.00017617167,0.000048661987,0.00016875417,0.00057592615,0.00017594169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051024736,0.00010470115,0.0050195768,0.000002454171,0.00007206297,0.0000031794054,0.0004414231,1.662545e-7,0.0001053527,0.9450234,0.048277017,0.00094552315],"study_design_scores_gemma":[0.0003925804,0.00007666655,0.018057717,0.0000050898852,0.000035970806,0.0000054101397,0.00021870491,0.000009755717,0.00030844915,0.9272648,0.053469352,0.00015548138],"about_ca_topic_score_codex":0.000113300484,"about_ca_topic_score_gemma":0.0006116362,"teacher_disagreement_score":0.01775862,"about_ca_system_score_codex":0.000020120402,"about_ca_system_score_gemma":0.00004484728,"threshold_uncertainty_score":0.5102111},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9808623,0.00012085707,0.00029792215,0.0003080637,0.0023103897,0.00038310775,0.000006797489,0.00034158563,0.015368938],"genre_scores_gemma":[0.99568164,0.0000104526125,0.003201359,0.00027223086,0.00006212632,0.000034690343,0.000014433349,0.00007564858,0.0006474359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983911,0.00017222852,0.00026541066,0.00025233053,0.00035790418,0.0005610582],"domain_scores_gemma":[0.99851066,0.00041548768,0.00014742075,0.0006094734,0.00008286805,0.00023410816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044363085,0.00028572476,0.0003286065,0.00012789175,0.00019444946,0.00003623243,0.00024170108,0.00014742893,0.00021879308],"category_scores_gemma":[0.00012585099,0.0002648861,0.000091292975,0.00030160457,0.000086691165,0.00038417592,0.00009010199,0.00031604705,0.00049889344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040506966,0.0004998959,0.0008678973,0.000025408011,0.00003929777,0.0000054679354,0.0007168444,0.0000024978378,0.001852403,0.98940486,0.0062671467,0.00027776617],"study_design_scores_gemma":[0.0013851293,0.00015590305,0.00060362444,0.00008486063,0.000058143756,0.000012345774,0.00024078625,0.00006415004,0.022880603,0.9683862,0.0056749717,0.00045331835],"about_ca_topic_score_codex":0.000006588277,"about_ca_topic_score_gemma":0.0000017389991,"teacher_disagreement_score":0.0210282,"about_ca_system_score_codex":0.00020379678,"about_ca_system_score_gemma":0.000023829207,"threshold_uncertainty_score":0.99998033},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.944861,0.0007209788,0.031511217,0.005808781,0.006202182,0.0007122114,0.0000020529426,0.000692952,0.00948864],"genre_scores_gemma":[0.9977651,0.000014334865,0.0019250866,0.00017346255,0.000010950763,0.000003793796,7.3151693e-7,0.000006467848,0.000100066965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982468,0.00014843485,0.00038038092,0.00037975304,0.00045611343,0.00038855514],"domain_scores_gemma":[0.99795187,0.00035269425,0.00016120887,0.00119183,0.00023661744,0.0001057689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006415302,0.00017195057,0.00023384904,0.00006746817,0.00020169771,0.00013603871,0.0018601199,0.000083121566,0.0000065511754],"category_scores_gemma":[0.0001560786,0.0001291516,0.00010278905,0.00079620036,0.000118513046,0.00023667897,0.00034615162,0.00021646368,0.00002873776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008321619,0.00020352224,0.002594191,0.000003875972,0.000014902945,0.000008515076,0.00027847665,0.000059842157,0.00017817438,0.92617,0.0011681827,0.06931201],"study_design_scores_gemma":[0.0005746477,0.00031025085,0.08499645,0.000010250816,0.0000043526197,0.000006791601,0.000014195693,0.036502983,0.001700769,0.8730565,0.0026389072,0.00018392902],"about_ca_topic_score_codex":0.000032505894,"about_ca_topic_score_gemma":0.00000382039,"teacher_disagreement_score":0.08240226,"about_ca_system_score_codex":0.00006389154,"about_ca_system_score_gemma":0.00009590289,"threshold_uncertainty_score":0.5266649},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9955014,0.00029843618,0.0000016718624,0.00009246779,0.0007172969,0.00017334576,0.0000038063206,0.000014474346,0.0031970826],"genre_scores_gemma":[0.999709,0.000020454207,0.000095304786,0.000017598803,0.0000048455872,0.000014289546,6.778795e-7,0.000009552095,0.00012824961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930865,0.00009869497,0.00021321148,0.00006246737,0.00016484284,0.00015214538],"domain_scores_gemma":[0.9985561,0.0005884715,0.00023931489,0.000507963,0.000075719465,0.000032449043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052964577,0.000073403025,0.000118402815,0.000020711257,0.00017444078,0.000005639562,0.00040166973,0.000034899844,0.000016324551],"category_scores_gemma":[0.00013431637,0.000041060117,0.00007994147,0.00033371442,0.00024229403,0.000060002134,0.00007886685,0.00009368642,0.00000536738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007030989,0.00014047485,0.013939308,0.00001379559,0.000029769888,2.1066308e-8,0.00042408484,2.0753556e-7,0.001517504,0.9831044,0.00063557184,0.00018782356],"study_design_scores_gemma":[0.00020636096,0.000023204051,0.007892274,0.000014481378,0.00003958408,0.000001196022,0.00014104498,0.0000020873144,0.016106974,0.9740837,0.0014422294,0.00004686265],"about_ca_topic_score_codex":0.000011806699,"about_ca_topic_score_gemma":0.0000051635498,"teacher_disagreement_score":0.01458947,"about_ca_system_score_codex":0.0000057826924,"about_ca_system_score_gemma":0.000017903832,"threshold_uncertainty_score":0.1674383},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9580757,0.000005598702,0.000113942384,0.0012458999,0.00022165127,0.00021731501,0.000004187004,0.000035154728,0.04008056],"genre_scores_gemma":[0.9987358,2.7321647e-7,0.00019807556,0.00009046712,0.000012893422,0.00018749428,0.0000129129985,0.0000049434675,0.0007571281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995315,0.00001140642,0.00009483373,0.00012883826,0.00008186524,0.00015153336],"domain_scores_gemma":[0.9996191,0.000030812786,0.00003356826,0.00019185778,0.000056203742,0.00006845951],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000037772905,0.00006237014,0.00006902829,0.00002215144,0.00017144985,0.00006183608,0.00017801569,0.000014274912,0.0013647241],"category_scores_gemma":[0.0000011647682,0.000059516125,0.000040861807,0.00017765233,0.000035572753,0.00016156009,0.00004287955,0.00006694321,0.0018609264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.9897112e-7,0.0001047208,0.012102323,5.508097e-7,0.0000072888824,8.7546915e-8,0.00005786637,0.0000049028226,0.0020646402,0.96646446,0.01609338,0.0030995025],"study_design_scores_gemma":[0.0002456471,0.00002396257,0.03634322,0.0000037938096,0.000006656474,3.252143e-7,0.00015338497,0.00047664446,0.0019768844,0.9532111,0.007441341,0.00011699917],"about_ca_topic_score_codex":0.00023422281,"about_ca_topic_score_gemma":5.577995e-7,"teacher_disagreement_score":0.040660117,"about_ca_system_score_codex":0.000011574869,"about_ca_system_score_gemma":0.000025189172,"threshold_uncertainty_score":0.99954814},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.981058,0.00007495575,0.00004274588,0.000009216234,0.0025490979,0.00013143146,0.0000055476885,0.00022590214,0.015903115],"genre_scores_gemma":[0.99976903,0.0000087166245,0.00012940429,0.000014453743,0.00000545241,0.000018026914,0.0000030796882,0.000027307357,0.000024528676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992848,0.00003294382,0.00025716226,0.00010539377,0.0001338924,0.0001857805],"domain_scores_gemma":[0.9994094,0.000068078785,0.000034168625,0.0003578337,0.000047706344,0.00008281175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025794245,0.00012891693,0.00021603839,0.00008561804,0.000030568182,0.000013042647,0.0002256581,0.000116849915,0.000031374813],"category_scores_gemma":[0.000027956801,0.00012681636,0.00008521704,0.00024399754,0.000071888026,0.000077103505,0.000019941597,0.00023157017,0.00003625154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029350392,0.00003146336,0.001102962,0.00007372594,0.00003475465,0.000003826722,0.00013368078,0.000009055946,0.15222992,0.845443,0.0007477324,0.00018692114],"study_design_scores_gemma":[0.0005706215,0.00007262419,0.04046984,0.000052334595,0.000021193799,0.000012633608,0.00003509789,0.00070932327,0.038813196,0.9174883,0.0014912712,0.00026361307],"about_ca_topic_score_codex":0.00001754511,"about_ca_topic_score_gemma":0.0000054900083,"teacher_disagreement_score":0.11341673,"about_ca_system_score_codex":0.000006900185,"about_ca_system_score_gemma":0.000012946599,"threshold_uncertainty_score":0.5171421},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99182016,0.000116696145,0.00012526555,0.00021083443,0.00016036871,0.00037051374,0.000017115553,0.000033827502,0.00714522],"genre_scores_gemma":[0.99711794,0.000015736581,0.002457352,0.000021400898,0.000012865099,0.000070585746,0.000007930722,0.000022005244,0.0002741962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990547,0.00004160917,0.00036387323,0.000114852555,0.00017724562,0.00024773608],"domain_scores_gemma":[0.9990745,0.00035083265,0.000135719,0.0003045174,0.00006736877,0.00006702978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038437248,0.00012852778,0.0003142103,0.00007429275,0.00003238443,0.000007709386,0.00015511534,0.00007759786,0.00013504893],"category_scores_gemma":[0.000111483976,0.00011615797,0.00004839941,0.0003020525,0.000036558708,0.0000827904,0.000026744128,0.000103074104,0.000034141314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009092679,0.0007233006,0.0013713014,0.00010986875,0.000027476313,7.420721e-7,0.0028283745,0.000001944965,0.0011446421,0.99099714,0.0025905112,0.00019559164],"study_design_scores_gemma":[0.0012086446,0.00003510103,0.0042778114,0.000089732646,0.000045181292,0.000006284998,0.00027074502,0.00010879624,0.008274363,0.98278284,0.0026845643,0.00021593258],"about_ca_topic_score_codex":0.00003186874,"about_ca_topic_score_gemma":0.000013981993,"teacher_disagreement_score":0.008214311,"about_ca_system_score_codex":0.000018857847,"about_ca_system_score_gemma":0.00002617013,"threshold_uncertainty_score":0.47367847},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952003,0.00021336529,0.0018359984,0.000030289377,0.00064013107,0.00054699613,0.00002869182,0.000039782393,0.0014644405],"genre_scores_gemma":[0.98415333,0.000019038955,0.014270513,0.0000093463605,0.000009461303,0.00005595338,0.0000046214145,0.00003699835,0.0014407358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986264,0.000050637314,0.00058294367,0.0001897471,0.00032613697,0.00022413889],"domain_scores_gemma":[0.99832946,0.0005933659,0.00034504037,0.0002877575,0.00033938914,0.000104965584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005272142,0.00015810838,0.00054857886,0.00008984157,0.000039767136,0.00002093691,0.00019581326,0.00008803694,0.0000167706],"category_scores_gemma":[0.0015631699,0.00015152752,0.00009938773,0.00012951942,0.000259974,0.00016783724,0.00012166866,0.00006771224,0.0000031130137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009324178,0.0001995729,0.00015219582,0.0006183011,0.000063796375,0.0000011261172,0.0011993529,0.0000042167267,0.0011198004,0.9926738,0.0038266797,0.000047896323],"study_design_scores_gemma":[0.0026968461,0.0001698932,0.000018087092,0.000091848844,0.000107676235,0.0000045210336,0.00055296085,0.0001610714,0.025476076,0.9704312,0.00014704153,0.00014275231],"about_ca_topic_score_codex":0.000024605693,"about_ca_topic_score_gemma":0.0000050914755,"teacher_disagreement_score":0.024356274,"about_ca_system_score_codex":0.000052402924,"about_ca_system_score_gemma":0.000070279835,"threshold_uncertainty_score":0.6179113},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9929596,0.00013395412,0.000091452785,0.000060981205,0.0008434094,0.0004761461,0.000007049305,0.000393378,0.005034013],"genre_scores_gemma":[0.9924798,0.0000029062521,0.0068226745,0.000040612293,0.000050740065,0.00006776266,0.000023346778,0.00013257372,0.00037958406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968858,0.00046450278,0.00038504362,0.00040376943,0.0007987487,0.0010621501],"domain_scores_gemma":[0.9974295,0.00060854334,0.00019247357,0.0011018617,0.00017497379,0.00049267855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022439745,0.00033924746,0.0004163644,0.00021558923,0.00028564056,0.000094626026,0.0005957946,0.00013910285,0.00020880885],"category_scores_gemma":[0.00033800266,0.00029436496,0.00009402471,0.000588855,0.00021724588,0.0007872805,0.00019039301,0.0005581427,0.00012478264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008582309,0.0006328677,0.020823857,0.00006122299,0.00008341808,0.000028693536,0.0008674961,9.343026e-7,0.0008664862,0.9752431,0.0008557306,0.00045037156],"study_design_scores_gemma":[0.0024666465,0.0006356621,0.0045997696,0.000086025415,0.00007384954,0.000063288244,0.00049519824,0.00022772847,0.0015162633,0.9885693,0.000782364,0.00048385953],"about_ca_topic_score_codex":0.000040457282,"about_ca_topic_score_gemma":0.000014766988,"teacher_disagreement_score":0.016224086,"about_ca_system_score_codex":0.000118285774,"about_ca_system_score_gemma":0.00006369357,"threshold_uncertainty_score":0.9999508},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90931195,0.000053507894,0.08732513,0.00059155514,0.0007273194,0.00026427206,0.0000057462976,0.00019072971,0.0015297957],"genre_scores_gemma":[0.9950954,0.000018914936,0.0045800754,0.00012048566,0.0000027321973,0.0000073134565,0.000005601494,0.000007051078,0.00016242755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988213,0.000046217792,0.0002254483,0.0002852485,0.00032350371,0.0002982759],"domain_scores_gemma":[0.99895793,0.000048295784,0.000116234296,0.0006144079,0.00017032101,0.000092783506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030895948,0.000111297464,0.00017125321,0.00020885815,0.00008397892,0.00004846122,0.0007565745,0.000048376376,0.000008806736],"category_scores_gemma":[0.000052324485,0.00011010089,0.00006312866,0.0011030862,0.000058758473,0.0006893174,0.00010578596,0.00011843865,0.00002218092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007789494,0.00012964598,0.00025868154,0.0000037934908,0.000004725029,0.0000019052961,0.00008687152,0.000003978165,0.2893327,0.7055673,0.000017395334,0.00458527],"study_design_scores_gemma":[0.0005408828,0.00023092741,0.024266293,0.000020497815,0.0000024365497,0.000006280395,0.0000031949703,0.00211881,0.07098843,0.90119964,0.00048607905,0.00013652997],"about_ca_topic_score_codex":0.0000032902633,"about_ca_topic_score_gemma":2.6031182e-7,"teacher_disagreement_score":0.21834424,"about_ca_system_score_codex":0.000020083246,"about_ca_system_score_gemma":0.000041753887,"threshold_uncertainty_score":0.4489784},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920266,0.0039982377,0.00023691196,0.0003865382,0.0020919552,0.00013678876,0.0000014029332,0.0001972228,0.0009243025],"genre_scores_gemma":[0.9899369,0.00011901503,0.009540321,0.00029666311,0.0000018588792,0.000008938251,0.0000016502847,0.000016300371,0.00007835954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835473,0.00006686302,0.00039624248,0.00034184658,0.00034563194,0.0004947048],"domain_scores_gemma":[0.9986025,0.00013587353,0.00018502743,0.00060564216,0.0002001057,0.00027081274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008080934,0.00020397251,0.0002947547,0.00021107406,0.00014747237,0.000059525566,0.00052623707,0.00011539696,0.0000071522054],"category_scores_gemma":[0.00010184641,0.00018974891,0.0000732427,0.00067523157,0.00014757364,0.0006167034,0.00033491408,0.00018239311,0.0000328649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003487818,0.00016108609,0.012793097,0.000028259783,0.000023678229,0.0000011918748,0.00077176286,0.0000012243106,0.0055609657,0.9772166,0.0011915006,0.0022471733],"study_design_scores_gemma":[0.0010253425,0.00013924828,0.0028861014,0.000058280093,0.000023994384,0.000019944106,0.000033223474,0.00082046574,0.013307346,0.98039705,0.0009866473,0.00030236706],"about_ca_topic_score_codex":0.000053011383,"about_ca_topic_score_gemma":5.021564e-7,"teacher_disagreement_score":0.009906995,"about_ca_system_score_codex":0.0000123629625,"about_ca_system_score_gemma":0.000033417964,"threshold_uncertainty_score":0.7737736},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9560814,0.000073606374,0.019233668,0.0012333501,0.0016639018,0.00028865036,0.000001046765,0.00020959387,0.0212148],"genre_scores_gemma":[0.99447334,0.0000050796593,0.0048466264,0.0002798661,0.0000048550764,0.000028316015,0.0000018121054,0.000007549081,0.00035256552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990673,0.000037775193,0.00020786005,0.00025192692,0.00021529383,0.00021982586],"domain_scores_gemma":[0.9989575,0.0001718635,0.00010098597,0.00057974964,0.00010854399,0.000081313214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006872586,0.00011839499,0.00015359763,0.00008539015,0.0001021588,0.000045989393,0.00067066506,0.000053372234,0.00016405342],"category_scores_gemma":[0.00006871445,0.000100225734,0.000055700326,0.00039462576,0.000053255528,0.00046624895,0.00013320865,0.00011351112,0.00042349473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.1887285e-7,0.00010044078,0.0002471602,0.0000037486043,0.0000070150477,0.0000013700812,0.00006958663,0.000026378328,0.00066115515,0.9938282,0.0031382267,0.0019160081],"study_design_scores_gemma":[0.00032374915,0.00012364905,0.00748154,0.000012516527,0.0000020881205,0.0000020527082,0.000008532092,0.0010910195,0.0046474678,0.9852867,0.00089645653,0.00012419203],"about_ca_topic_score_codex":0.00001585646,"about_ca_topic_score_gemma":9.1181255e-7,"teacher_disagreement_score":0.038391948,"about_ca_system_score_codex":0.000025241563,"about_ca_system_score_gemma":0.000030965693,"threshold_uncertainty_score":0.5443309},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9899111,0.000046243567,0.000021961314,0.00043365353,0.00024287515,0.00026280532,0.000011557761,0.000014136722,0.009055715],"genre_scores_gemma":[0.99965054,0.0000048554816,0.00009405072,0.0000496487,0.0000047127296,0.00005558791,0.0000032782566,0.000006543789,0.00013077114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931985,0.00016990761,0.00016831206,0.000069931324,0.00013654985,0.00013543785],"domain_scores_gemma":[0.99869156,0.0006184176,0.00009488048,0.00055188546,0.000022196364,0.000021047592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042305185,0.00006234935,0.000081801045,0.00002831831,0.000113795315,0.000008294461,0.0003435929,0.000027668633,0.000015171242],"category_scores_gemma":[0.00012034927,0.000037501217,0.00005619056,0.0004175305,0.000104078266,0.000067419875,0.00003431593,0.000121670986,0.000007430751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028122688,0.0001614809,0.029773979,0.0000094800835,0.000007247681,1.5485995e-7,0.002096417,6.639414e-7,0.00012364045,0.96679085,0.0010162592,0.000016997396],"study_design_scores_gemma":[0.00016550528,0.000004981724,0.060836833,0.000013253602,0.000017224602,0.0000026225584,0.0011203565,0.0000020999967,0.0005137906,0.936048,0.0012316597,0.00004368425],"about_ca_topic_score_codex":0.000016784088,"about_ca_topic_score_gemma":0.00002020251,"teacher_disagreement_score":0.031062854,"about_ca_system_score_codex":0.0000055775117,"about_ca_system_score_gemma":0.000008145891,"threshold_uncertainty_score":0.15292552},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9708567,0.00023027,0.009799539,0.000025082345,0.0006687856,0.00021072618,2.5386123e-7,0.00022416655,0.017984435],"genre_scores_gemma":[0.9967867,0.00001950257,0.0027370148,0.000014578248,0.000006631538,0.000005879176,0.0000033631734,0.000018233515,0.00040809368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996077,0.00000677927,0.00012221636,0.00006209437,0.00008424827,0.00011697516],"domain_scores_gemma":[0.99979216,0.000010587332,0.000018654437,0.000116172305,0.000021026899,0.00004137365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000034156245,0.00007021939,0.000086949534,0.000059014932,0.000014411078,0.000026899423,0.000105592124,0.00003056775,0.000080348436],"category_scores_gemma":[0.0000044564044,0.00007091908,0.000024692785,0.0001276294,0.000005776905,0.00013382157,0.00002182601,0.000040667575,0.000096131254],"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.000020233372,0.00012222205,0.013077453,0.0004832447,0.0004141084,0.000009592244,0.0034627656,0.39674103,0.04312673,0.2608206,0.22647344,0.055248577],"study_design_scores_gemma":[0.0038381864,0.00022830539,0.037553333,0.00019164434,0.000119081276,0.0000017256466,0.00035719917,0.48248702,0.04325419,0.41572344,0.0151044335,0.0011414302],"about_ca_topic_score_codex":0.00007389156,"about_ca_topic_score_gemma":3.6538103e-7,"teacher_disagreement_score":0.211369,"about_ca_system_score_codex":0.00001384129,"about_ca_system_score_gemma":0.0000032412524,"threshold_uncertainty_score":0.28919962},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8122468,0.001510775,0.17443347,0.001548118,0.006787095,0.00061044935,0.000010537189,0.00021217241,0.0026405775],"genre_scores_gemma":[0.9943739,0.000023262268,0.004739303,0.000045955567,0.00001847006,0.000019830011,0.0000012779722,0.0000067406195,0.00077121914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933094,0.00007702743,0.00019577847,0.00017225432,0.000086245,0.00013774079],"domain_scores_gemma":[0.99884784,0.0006322333,0.000096341864,0.0003306255,0.000058449285,0.000034536828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006367998,0.00008294775,0.0001276391,0.000041878386,0.0002784259,0.00006135169,0.00032212268,0.00004505949,0.0000057346247],"category_scores_gemma":[0.00012327437,0.00006021927,0.00005068124,0.00017333333,0.00006586581,0.00014466069,0.00011723889,0.00007208146,0.0000055364403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028553345,0.000015868096,0.00010107569,0.000010188352,0.000018862698,1.5026923e-7,0.00026530153,0.000094482195,0.0012217893,0.9831746,0.00057148864,0.014523292],"study_design_scores_gemma":[0.0012378456,0.00021434845,0.00082145986,0.000020692964,0.000037622576,0.000013995894,0.00016134251,0.29376197,0.0043513896,0.6896321,0.009537358,0.00020988456],"about_ca_topic_score_codex":0.00001398959,"about_ca_topic_score_gemma":7.6155357e-7,"teacher_disagreement_score":0.2936675,"about_ca_system_score_codex":0.0000068317045,"about_ca_system_score_gemma":0.00001953499,"threshold_uncertainty_score":0.24556705},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9540714,0.0002361,0.039672904,0.00039004016,0.0018661747,0.00028260067,0.000006596545,0.00016551238,0.0033086748],"genre_scores_gemma":[0.96952444,0.00000683311,0.030245377,0.00007419261,0.0000065524323,0.00002440383,0.0000027994627,0.000008739599,0.00010667934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989959,0.000031718417,0.0002616437,0.00024882122,0.0002318231,0.00023010967],"domain_scores_gemma":[0.99901223,0.00006288448,0.00013007506,0.00059512525,0.00012488781,0.00007478853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012545852,0.00011594499,0.00019748775,0.000059551545,0.00006193863,0.000031947857,0.00045749414,0.000043492266,0.0000410524],"category_scores_gemma":[0.000036567944,0.00010429166,0.00005431094,0.00023923282,0.000067979236,0.0008731226,0.00026217225,0.00007765401,0.0001572834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014443732,0.000037751324,0.0011487466,0.000019529665,0.0000083093355,0.0000037716225,0.0002722496,0.0000015661242,0.0018651943,0.9897468,0.0017561218,0.005138517],"study_design_scores_gemma":[0.0011012502,0.00021481945,0.019695943,0.000096567026,0.0000067238766,0.000024894716,0.00015766594,0.0015402735,0.020310847,0.9217961,0.034600478,0.0004544535],"about_ca_topic_score_codex":0.0002584566,"about_ca_topic_score_gemma":0.0000020142027,"teacher_disagreement_score":0.06795072,"about_ca_system_score_codex":0.00002540059,"about_ca_system_score_gemma":0.000032888755,"threshold_uncertainty_score":0.42528906},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95152134,0.00006203404,0.037089262,0.00039509402,0.0007479438,0.00037416947,8.679023e-7,0.0003473181,0.009461962],"genre_scores_gemma":[0.97818446,0.0000033738686,0.021585405,0.000073734904,0.000009340914,0.00002969228,0.0000015660013,0.000016582631,0.000095824675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978998,0.00038315638,0.00027167218,0.000539114,0.00037283683,0.0005334696],"domain_scores_gemma":[0.99848896,0.00022663269,0.00007624403,0.00096520793,0.00008767986,0.00015527928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015894643,0.00014565128,0.00018004706,0.00020804025,0.00012538384,0.00013180678,0.0013972978,0.00007145103,0.000005724907],"category_scores_gemma":[0.00016823095,0.00014548961,0.000038001595,0.00073140516,0.00006498279,0.0008290878,0.00030852415,0.00031248055,0.00006012727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010429665,0.000108078355,0.005335534,0.000009057251,0.0000021211454,0.000019517125,0.00043715432,0.00007212483,0.0020007358,0.9703971,0.000042532836,0.02156563],"study_design_scores_gemma":[0.0008246669,0.00019184122,0.0066986694,0.000030678344,7.003385e-7,0.000005586618,0.00002746201,0.043461405,0.0013961099,0.9465763,0.0005942099,0.00019238071],"about_ca_topic_score_codex":0.000025050576,"about_ca_topic_score_gemma":0.000011326674,"teacher_disagreement_score":0.04338928,"about_ca_system_score_codex":0.00006047156,"about_ca_system_score_gemma":0.00003957209,"threshold_uncertainty_score":0.5932894},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9783751,0.000073095776,0.00834685,0.0010250336,0.0010852452,0.000100228,0.0000033425692,0.000077744015,0.010913371],"genre_scores_gemma":[0.99716485,0.0000065032777,0.00037278372,0.00041701423,0.000022319431,0.000018897656,0.0000032161627,0.000011003956,0.0019833897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981365,0.0002216435,0.0004677241,0.000349864,0.0005878497,0.00023640667],"domain_scores_gemma":[0.99800694,0.0009575145,0.0002397042,0.0005100642,0.0001400543,0.0001457307],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025033362,0.00010561841,0.00016954003,0.00008503083,0.00040181837,0.00019307608,0.0005703988,0.000055927383,0.0003319937],"category_scores_gemma":[0.0016318413,0.000089151916,0.00007374165,0.00048830453,0.00007293687,0.00021583037,0.00009994696,0.00014255356,0.0015021111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010343193,0.000101635094,0.008037146,0.0000013619681,0.000011263596,5.248173e-7,0.00018824235,0.00005293329,0.0039431974,0.90179336,0.042147428,0.04371254],"study_design_scores_gemma":[0.0002631408,0.00002190787,0.00058502157,0.000006021574,0.0000046204686,0.0000021488374,0.00011085415,0.0007518853,0.0039624944,0.7977909,0.19639884,0.000102207],"about_ca_topic_score_codex":0.000006979635,"about_ca_topic_score_gemma":0.0000010796001,"teacher_disagreement_score":0.15425141,"about_ca_system_score_codex":0.000025287492,"about_ca_system_score_gemma":0.000013927869,"threshold_uncertainty_score":0.9992753},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95934135,0.000068189365,0.000037410573,0.0000154216,0.0021867116,0.000107497326,0.0000048721918,0.00014737324,0.038091157],"genre_scores_gemma":[0.9998117,0.000002126163,0.000041669988,0.00002252521,0.000005194844,0.000009894496,0.0000022915917,0.00002205572,0.00008255759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994012,0.000020100451,0.00015758838,0.000090665104,0.00015628187,0.00017414884],"domain_scores_gemma":[0.99953693,0.00004586998,0.0000198836,0.00022767634,0.000036374022,0.00013325196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002232317,0.000105642044,0.0001604472,0.00014819925,0.000023735458,0.0000095974765,0.0001590039,0.000058600584,0.000009261472],"category_scores_gemma":[0.000032549266,0.000103046885,0.0000559614,0.00033839582,0.000015712178,0.000053573935,0.000013642428,0.00008405674,0.0001202892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001729737,0.000033755103,0.0007066787,0.000034019835,0.00003453179,0.00000469157,0.00095925294,0.0027425445,0.0018187913,0.98854613,0.0047728755,0.0003294317],"study_design_scores_gemma":[0.0017380038,0.0005549326,0.001284925,0.00020165143,0.000028310249,0.00001053184,0.00083730544,0.0013359052,0.027702838,0.9579682,0.00782075,0.0005166593],"about_ca_topic_score_codex":0.000009120203,"about_ca_topic_score_gemma":0.000002512893,"teacher_disagreement_score":0.040470317,"about_ca_system_score_codex":0.00002898534,"about_ca_system_score_gemma":0.000007644744,"threshold_uncertainty_score":0.420213},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9842102,0.000016451397,0.0000052320183,0.0004068191,0.0001574026,0.00020116808,0.000005016442,0.000032001008,0.014965733],"genre_scores_gemma":[0.99952084,0.000002843369,0.00024588662,0.00008502363,0.0000021183455,0.000057759775,0.0000024581498,0.000015561765,0.00006749201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991992,0.000111814436,0.00022915292,0.00012697231,0.00018615977,0.00014670558],"domain_scores_gemma":[0.9987332,0.0006131268,0.00010656952,0.00042784403,0.000063642896,0.00005559108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063772284,0.00010397984,0.0001670468,0.00004273616,0.0000500588,0.0000100391435,0.00027590676,0.000055157743,0.000069129404],"category_scores_gemma":[0.00025050368,0.00007530246,0.00006547049,0.00029814272,0.00007045846,0.000042325846,0.00004696245,0.00014999806,0.00007582706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001890381,0.0002465569,0.0035893184,0.000008210293,0.000017005936,8.4504376e-7,0.0007702573,9.797353e-7,0.00007494423,0.99105734,0.0041758562,0.0000397947],"study_design_scores_gemma":[0.000496332,0.000026565822,0.00028132278,0.000025923791,0.000011474335,0.0000022571405,0.00030590405,0.000011931785,0.0017938945,0.99668574,0.00027770855,0.000080940816],"about_ca_topic_score_codex":0.000037130267,"about_ca_topic_score_gemma":0.0000062496783,"teacher_disagreement_score":0.01531068,"about_ca_system_score_codex":0.00001993718,"about_ca_system_score_gemma":0.00002715563,"threshold_uncertainty_score":0.30707452},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9734458,0.00010557227,0.0036686887,0.00023959954,0.008959501,0.00027710502,0.0000016811122,0.00016731117,0.013134785],"genre_scores_gemma":[0.99961215,0.0000017423279,0.00015973752,0.0000356818,0.000018933979,0.000012969143,0.0000014131052,0.000008390487,0.00014898997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986317,0.00020127521,0.00026720072,0.0003483255,0.00032671448,0.00022476588],"domain_scores_gemma":[0.99857956,0.00015009473,0.00016289641,0.0006782314,0.0003108195,0.00011840504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048767333,0.0001293103,0.00023410517,0.00013293764,0.00006337913,0.000055686716,0.0005200656,0.000057344187,0.0000033864044],"category_scores_gemma":[0.00023462129,0.00011606266,0.00006890159,0.00062094536,0.000037811307,0.00026549297,0.00011145156,0.00016029034,0.000025739659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016751183,0.00013089144,0.0014072737,0.000006530799,0.000017697408,0.000004750581,0.00024325655,0.00013358505,0.00007748114,0.98324114,0.013984705,0.00073592184],"study_design_scores_gemma":[0.002256411,0.0013768828,0.0078113633,0.00010377142,0.0000104938,0.000024637362,0.000097655044,0.018092385,0.0052157687,0.96169674,0.0028906295,0.00042327543],"about_ca_topic_score_codex":0.000112157046,"about_ca_topic_score_gemma":0.0000075917897,"teacher_disagreement_score":0.026166385,"about_ca_system_score_codex":0.00006544028,"about_ca_system_score_gemma":0.000092545604,"threshold_uncertainty_score":0.47328982},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97145164,0.000064693384,0.0016813404,0.0011086601,0.0043603596,0.00010958113,3.4314405e-7,0.0005850155,0.020638373],"genre_scores_gemma":[0.99695706,0.0000031957513,0.0018317396,0.0010511038,6.835195e-7,0.0000059117583,8.910723e-7,0.0000085133215,0.00014089103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989214,0.00007993474,0.00015058088,0.0003324478,0.0002746392,0.00024100085],"domain_scores_gemma":[0.9989078,0.00013373511,0.000054078657,0.0007197642,0.00006555521,0.000119058415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004075233,0.0001182729,0.00012606011,0.000118691336,0.00013789933,0.00008701843,0.00060251186,0.000052211974,0.000007841458],"category_scores_gemma":[0.0000631368,0.000103440965,0.000063411164,0.00037740794,0.000036546164,0.00013067524,0.000109524415,0.00012561186,0.0003125793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015265763,0.00006101241,0.0001558817,0.0000023382152,0.000005204069,0.0000017153685,0.000095717834,0.000018801044,0.00019831398,0.9918136,0.0050513432,0.002594546],"study_design_scores_gemma":[0.0004736155,0.00018867453,0.0003329491,0.000015429594,0.0000022979264,0.000002300926,0.0000017772904,0.003910383,0.0013918506,0.99228317,0.0012605244,0.00013702948],"about_ca_topic_score_codex":0.000015783779,"about_ca_topic_score_gemma":0.0000011163957,"teacher_disagreement_score":0.025505437,"about_ca_system_score_codex":0.000009978151,"about_ca_system_score_gemma":0.000013936926,"threshold_uncertainty_score":0.42182},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7034804,0.0002575586,0.24071151,0.00075580226,0.007405013,0.0026084555,0.000026859268,0.0006385451,0.044115856],"genre_scores_gemma":[0.96812123,0.000001554137,0.028555771,0.000020976639,0.000028907545,0.00015802117,0.000006255955,0.00003631599,0.0030709885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991775,0.000045359615,0.00020738576,0.0002030604,0.00017098017,0.00019571824],"domain_scores_gemma":[0.99834335,0.00086400134,0.00013368523,0.00043989948,0.00016181002,0.00005724211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026667636,0.000119990174,0.0001864519,0.000038555154,0.0001209868,0.000029641511,0.00017059101,0.000066254914,0.000008654459],"category_scores_gemma":[0.0006850919,0.00009997672,0.00003189755,0.00012987303,0.000043386783,0.0001170881,0.000028405293,0.00012206474,0.000029094423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000080986365,0.000042132695,0.0005196377,0.000056991164,0.000015357511,4.0341277e-7,0.000088201996,0.000016692866,0.000009444446,0.99592614,0.003084299,0.00023260637],"study_design_scores_gemma":[0.00073385413,0.00014725851,0.00008203435,0.00008533718,0.000024561894,0.000003961365,0.00003228929,0.0009946178,0.000099810015,0.98158765,0.016060226,0.00014840647],"about_ca_topic_score_codex":0.000002262239,"about_ca_topic_score_gemma":0.0000026427522,"teacher_disagreement_score":0.2646408,"about_ca_system_score_codex":0.000050339684,"about_ca_system_score_gemma":0.000025285388,"threshold_uncertainty_score":0.40769324},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9479208,0.00003393097,0.0023393694,0.00014950191,0.0016155983,0.0001999891,0.000026595952,0.00007241738,0.047641817],"genre_scores_gemma":[0.9952256,0.000001839646,0.0026114066,0.00003549913,0.000051286424,0.000065534456,0.00001791181,0.000014269077,0.001976646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993376,0.000011381688,0.00017313838,0.00016986733,0.0001052104,0.00020279034],"domain_scores_gemma":[0.9994318,0.0000817188,0.00007121401,0.00025654232,0.00008067226,0.00007804077],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008788968,0.000115513685,0.00013377138,0.000019744759,0.00018058941,0.00006623234,0.00018436693,0.000030017916,0.0024384402],"category_scores_gemma":[0.000014961556,0.00010758341,0.000055134144,0.00013475951,0.00009522393,0.00019395318,0.00007400038,0.0002541049,0.00012324467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011282108,0.00005925587,0.0004939883,0.0000079510355,0.000012997555,2.5155626e-7,0.00013199341,0.000002232666,0.0009788668,0.99654084,0.0008246482,0.0009458288],"study_design_scores_gemma":[0.00019524992,0.000011326992,0.000121550074,0.000008735056,0.0000075276275,6.9064043e-7,0.00022826075,0.00014587746,0.0016740962,0.9901237,0.0073434217,0.00013958223],"about_ca_topic_score_codex":0.000011483669,"about_ca_topic_score_gemma":0.0000037893585,"teacher_disagreement_score":0.047304828,"about_ca_system_score_codex":0.0000095220175,"about_ca_system_score_gemma":0.000032469994,"threshold_uncertainty_score":0.99847347},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9949703,0.00018059403,0.001171364,0.000007729998,0.00084489735,0.00016574292,0.000005817164,0.00008187363,0.0025716543],"genre_scores_gemma":[0.9998693,0.0000070053766,0.000035127032,0.0000043626283,0.000007909475,0.00003180983,0.0000028031814,0.00002248628,0.000019212639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992625,0.000042143503,0.0003048653,0.000097413,0.00013519914,0.00015788375],"domain_scores_gemma":[0.9994564,0.00013894681,0.00008801951,0.00020359768,0.00007375688,0.000039262395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017344939,0.00010593122,0.00020255016,0.000067742425,0.00004396524,0.000012669502,0.00017180176,0.000046116555,0.000054526365],"category_scores_gemma":[0.000029904058,0.00010902103,0.00006382891,0.00015116823,0.000031116255,0.0001449643,0.000020968238,0.00012266134,0.0000273386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051075303,0.00015098054,0.14895308,0.00091619056,0.00031608992,0.0000049364585,0.00630271,0.006273075,0.17248876,0.6571034,0.00052466,0.0069609657],"study_design_scores_gemma":[0.0019392545,0.00021151922,0.077183455,0.000758634,0.00006296794,0.0000137345305,0.0025090254,0.092473775,0.11738943,0.7066394,0.000104042985,0.0007147647],"about_ca_topic_score_codex":0.00013450491,"about_ca_topic_score_gemma":0.000008005045,"teacher_disagreement_score":0.0862007,"about_ca_system_score_codex":0.000016132319,"about_ca_system_score_gemma":0.000005860553,"threshold_uncertainty_score":0.44457483},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98752147,0.00013553465,0.000006188862,0.000012528498,0.0052262456,0.000110481276,0.000012143582,0.00018821684,0.0067871916],"genre_scores_gemma":[0.9997155,0.000012811602,0.00006788537,0.000012597202,0.000009961198,0.000016349226,0.000003720251,0.000024905978,0.00013627886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991741,0.000027253038,0.00024622417,0.00015121029,0.0001641704,0.00023702323],"domain_scores_gemma":[0.99930406,0.00007381413,0.00004781189,0.00044442888,0.000040394254,0.00008948042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019205347,0.0001537067,0.00023326305,0.00006833818,0.000045406712,0.000017422477,0.00032851487,0.00012173541,0.000047396476],"category_scores_gemma":[0.000028715685,0.00015204247,0.00007311432,0.00017196414,0.00008601688,0.00010287448,0.00003355504,0.00029015064,0.000081875995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049364894,0.00003641076,0.0018409757,0.00009412135,0.000026180696,0.0000048380557,0.00042986774,0.000023891393,0.09576022,0.90106016,0.00027028378,0.00044811578],"study_design_scores_gemma":[0.0006699208,0.00007936142,0.013082415,0.00007505303,0.000021421263,0.000018781973,0.00015487822,0.001543147,0.060059823,0.9224884,0.0014142338,0.0003925816],"about_ca_topic_score_codex":0.000014016206,"about_ca_topic_score_gemma":0.0000060455095,"teacher_disagreement_score":0.0357004,"about_ca_system_score_codex":0.000010209581,"about_ca_system_score_gemma":0.00001282987,"threshold_uncertainty_score":0.6200112},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9166163,0.00009207247,0.047359906,0.0037258822,0.0032735453,0.003066329,0.000060536742,0.0015411846,0.024264231],"genre_scores_gemma":[0.9264297,0.0000061224946,0.07234303,0.00007418048,0.000037513757,0.00018338792,0.000019588506,0.00004933944,0.0008571553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985958,0.00004210365,0.00043635812,0.00028852368,0.00026878616,0.0003684765],"domain_scores_gemma":[0.9977287,0.0010367836,0.000267962,0.0005477473,0.00031536946,0.000103404134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030848038,0.00021421727,0.0002927911,0.00011729211,0.0003912312,0.00006379371,0.00020384163,0.000116392504,0.00002767656],"category_scores_gemma":[0.0011748199,0.0002012893,0.000089500325,0.00053006184,0.000044271135,0.00033113142,0.000021918131,0.00021871291,0.000035379202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021376964,0.00021818913,0.00014006314,0.00002193696,0.000026144802,0.0000023351133,0.0002839779,0.000031706353,0.00005617726,0.9872862,0.011703498,0.00020837437],"study_design_scores_gemma":[0.0012237402,0.00035695743,0.00019605503,0.000086275,0.000094820614,0.0000131196675,0.00014497199,0.00028442396,0.00032199186,0.99206716,0.004952317,0.00025818596],"about_ca_topic_score_codex":0.000002638341,"about_ca_topic_score_gemma":0.0000050109497,"teacher_disagreement_score":0.024983121,"about_ca_system_score_codex":0.00014341685,"about_ca_system_score_gemma":0.000083786814,"threshold_uncertainty_score":0.8208339},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9818198,0.00053126644,0.00042201293,0.00027672618,0.008797069,0.00021616962,0.000008458611,0.00023345108,0.007695017],"genre_scores_gemma":[0.99953336,0.000009644687,0.00017935509,0.000043913937,0.000017336168,0.000004116625,0.0000024848284,0.000007860407,0.00020192111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886084,0.00013406923,0.00024544258,0.00025554447,0.0003163029,0.0001877817],"domain_scores_gemma":[0.9988383,0.0001209216,0.00009739577,0.0006669767,0.00014943395,0.00012698524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065030216,0.00011601726,0.0001851962,0.00012168125,0.000044036653,0.0000454713,0.0006408211,0.00006138173,0.0000013182985],"category_scores_gemma":[0.00007494711,0.000104111394,0.00006484581,0.00052518037,0.000044216344,0.00026221006,0.000062067375,0.00010432319,0.000064082255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012787167,0.00012082305,0.0000867084,0.00001004326,0.000017276772,0.000007645565,0.00075935706,0.00017619258,0.00021149365,0.99476993,0.0033834362,0.00032923266],"study_design_scores_gemma":[0.0046583647,0.002435524,0.00030802801,0.00014152715,0.000022803055,0.000008624078,0.0002937235,0.006607665,0.004484393,0.95618093,0.024391254,0.00046718415],"about_ca_topic_score_codex":0.000051311807,"about_ca_topic_score_gemma":0.0000010481897,"teacher_disagreement_score":0.038589012,"about_ca_system_score_codex":0.000023723514,"about_ca_system_score_gemma":0.00006324214,"threshold_uncertainty_score":0.42455396},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9912495,0.00014589763,0.00031321522,0.00041502688,0.0039330753,0.00018667629,1.5045634e-7,0.000081891434,0.0036745898],"genre_scores_gemma":[0.99898434,0.000003612177,0.00006130878,0.00018629563,0.00000882374,0.000026986749,1.4464047e-7,0.000005391104,0.000723073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992889,0.000052039584,0.00018455998,0.00016057926,0.0001663598,0.00014754513],"domain_scores_gemma":[0.99938095,0.000033400713,0.00007053464,0.00036686563,0.000105918276,0.000042327814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012827484,0.0000778619,0.00013273158,0.00005309938,0.000052094787,0.00007042737,0.00040416565,0.00004276979,0.000022858183],"category_scores_gemma":[0.000022768343,0.000058783124,0.000046103774,0.000121845,0.000024405479,0.0003696823,0.00007532671,0.0000751191,0.00022700086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012215057,0.000041707,0.000064484135,0.000010029127,0.000008360748,7.836535e-7,0.0002534984,0.000027672253,0.0013419966,0.9890351,0.008504885,0.000710253],"study_design_scores_gemma":[0.00063118455,0.0004139471,0.0010763395,0.0001739766,0.0000028055651,0.00000824766,0.00006711781,0.027807416,0.029820831,0.9384351,0.0013031192,0.00025993458],"about_ca_topic_score_codex":0.00016642654,"about_ca_topic_score_gemma":0.000001116902,"teacher_disagreement_score":0.05060003,"about_ca_system_score_codex":0.000022795453,"about_ca_system_score_gemma":0.000018312423,"threshold_uncertainty_score":0.29177123},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844216,0.0002006927,0.001564303,0.00012945972,0.001430139,0.00026815888,0.000003367725,0.0001528313,0.01182944],"genre_scores_gemma":[0.99721336,0.000014984334,0.0024422323,0.000085123036,0.000006766444,0.000025997122,0.0000016037069,0.000019327452,0.00019059752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815613,0.00013492336,0.000241408,0.00031713475,0.0005346873,0.0006156983],"domain_scores_gemma":[0.99839026,0.00029962175,0.00012103851,0.00083251327,0.00010590997,0.0002506754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006657008,0.00018097801,0.00026125237,0.00024779263,0.0001242874,0.00003339929,0.001148035,0.000080137725,0.000015617115],"category_scores_gemma":[0.00012007596,0.00017086139,0.0000925411,0.00073872076,0.00017538066,0.00062733004,0.00021247938,0.0002845754,0.00011062155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037329613,0.0002200523,0.020836653,0.000013608229,0.0000211784,0.0000034604882,0.00023853594,0.000002612579,0.0011255536,0.9760144,0.00044387727,0.0010427528],"study_design_scores_gemma":[0.000763524,0.0002888006,0.016417721,0.000027336195,0.000004739895,0.000007031952,0.0000198867,0.00007275149,0.012602026,0.96825784,0.0013311463,0.00020720164],"about_ca_topic_score_codex":0.000013666253,"about_ca_topic_score_gemma":9.356418e-7,"teacher_disagreement_score":0.012791759,"about_ca_system_score_codex":0.000055689667,"about_ca_system_score_gemma":0.000043115266,"threshold_uncertainty_score":0.6967525},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9966372,0.00053934683,0.000014908676,0.00006299194,0.0008545462,0.00026643818,0.0000140239135,0.00013479595,0.0014757481],"genre_scores_gemma":[0.9974367,0.00006213373,0.00215138,0.000058837362,0.0000086845985,0.000014428089,0.0000074223917,0.000050891456,0.00020951909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831223,0.000090605834,0.0004459152,0.0003467705,0.00043843946,0.0003660579],"domain_scores_gemma":[0.99854237,0.00022456632,0.00023130435,0.0005601399,0.00018989918,0.0002517178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062018196,0.00026439648,0.00048293592,0.0001675002,0.00008282384,0.000040963332,0.00028848654,0.00011147012,0.000018390174],"category_scores_gemma":[0.00027418943,0.00024896816,0.000117698466,0.0002967387,0.00018800299,0.00021514892,0.00014432412,0.00020814693,0.000017588485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030939056,0.00025888448,0.008967201,0.00012737916,0.00008384363,0.000011015319,0.0017013414,5.0862076e-7,0.0005581408,0.9795545,0.008511437,0.0001948456],"study_design_scores_gemma":[0.0020759036,0.00021460092,0.0014213788,0.000073058574,0.00006606131,0.000008781722,0.0005202642,0.000055245604,0.0030342436,0.99169236,0.0005604205,0.00027766058],"about_ca_topic_score_codex":0.00009000363,"about_ca_topic_score_gemma":0.00001868326,"teacher_disagreement_score":0.012137917,"about_ca_system_score_codex":0.000032164688,"about_ca_system_score_gemma":0.00005407793,"threshold_uncertainty_score":0.99999624},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96640635,0.000046833353,0.00009714706,0.00028626062,0.003354014,0.00012286827,0.0000022872982,0.00006719065,0.029617058],"genre_scores_gemma":[0.996543,0.0000027353442,0.0028659683,0.00001764853,0.000012707877,0.000009715718,3.5090443e-7,0.00001785178,0.0005300234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991759,0.0000704685,0.00026842233,0.00009953817,0.00021003454,0.00017564182],"domain_scores_gemma":[0.9963349,0.0029266549,0.000084318286,0.0005075388,0.0000835983,0.0000629879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010052319,0.00009350243,0.00016591437,0.000021102012,0.00023350558,0.000016118227,0.0003325377,0.00008172947,0.0001170558],"category_scores_gemma":[0.0027486768,0.000065636865,0.000079426776,0.00007232046,0.00038925212,0.000056371184,0.00005128138,0.00027904278,0.00004917559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009086051,0.00016589872,0.000028029468,0.000049047554,0.000011881187,0.0000021969277,0.0003701324,6.7590835e-9,0.0019680087,0.9934959,0.0035499197,0.000349938],"study_design_scores_gemma":[0.00019244988,0.000047588397,0.000031515592,0.000013977656,0.000020127609,0.000008124828,0.00008507536,0.00001852492,0.0016387758,0.9811698,0.016696913,0.00007708199],"about_ca_topic_score_codex":0.0000012849632,"about_ca_topic_score_gemma":0.000008210525,"teacher_disagreement_score":0.030136658,"about_ca_system_score_codex":0.00000900167,"about_ca_system_score_gemma":0.000020448595,"threshold_uncertainty_score":0.32906213},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9704797,0.00022560653,0.0061956625,0.00025170037,0.0016432174,0.00017470235,0.0000016633156,0.0003017591,0.020725954],"genre_scores_gemma":[0.9870684,0.000020992658,0.012726652,0.000063218715,0.000002029341,0.000012554982,3.7840198e-7,0.000011880711,0.00009386783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987051,0.00009848679,0.00014291627,0.0003811231,0.0002555889,0.00041677963],"domain_scores_gemma":[0.99895984,0.00023373505,0.000026484136,0.00049046683,0.00007341698,0.00021605878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038315504,0.00012328611,0.0001353789,0.00016470478,0.00018833033,0.000076722295,0.000689223,0.00005912376,0.000030354322],"category_scores_gemma":[0.000167546,0.00012226573,0.00004301544,0.00053503615,0.0002724612,0.000652954,0.00038938297,0.00021262765,0.0000837925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006184831,0.00004818534,0.0065152086,0.000007505805,0.000008235498,0.000038563638,0.0005098305,3.3404348e-8,0.0002969818,0.9903497,0.00014801283,0.0020715324],"study_design_scores_gemma":[0.00029168068,0.00009914107,0.0028726924,0.000011797918,0.000002764868,0.0000255854,0.000048095942,0.00014010545,0.0024208734,0.99373937,0.00019290947,0.00015501001],"about_ca_topic_score_codex":0.000018923449,"about_ca_topic_score_gemma":0.0000015325385,"teacher_disagreement_score":0.020632086,"about_ca_system_score_codex":0.000019971623,"about_ca_system_score_gemma":0.000024624802,"threshold_uncertainty_score":0.4985852},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98357594,0.001030594,0.007399347,0.0037716967,0.0012474153,0.0017122311,0.000003808157,0.0005071641,0.0007518273],"genre_scores_gemma":[0.99701744,0.00002135508,0.0026718366,0.00014774234,0.0000056420417,0.00007675966,0.0000028098852,0.000008835194,0.000047553858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845695,0.00025970393,0.00022380194,0.000406277,0.0002867446,0.00036650512],"domain_scores_gemma":[0.99832267,0.00091391575,0.00008458358,0.0004490072,0.00015577121,0.000074053365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009890388,0.00015939391,0.0002387235,0.00021395578,0.00021122258,0.00011735313,0.000594346,0.00007801663,0.000001424664],"category_scores_gemma":[0.0004715809,0.000116047624,0.000065150736,0.0011135517,0.00014970935,0.00012880922,0.000101803715,0.00021258647,0.0000016917247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013109297,0.000081228005,0.00013360393,0.00000567761,0.00000787716,0.0000038697553,0.00075795496,0.00009067733,0.00051295577,0.98906296,0.00012229665,0.009089804],"study_design_scores_gemma":[0.00433503,0.00014155054,0.007998492,0.00002142062,0.0000046965965,0.000004905581,0.000019514307,0.06119418,0.0012378364,0.92463326,0.00025627716,0.00015285569],"about_ca_topic_score_codex":0.000012349984,"about_ca_topic_score_gemma":0.000007214676,"teacher_disagreement_score":0.06442972,"about_ca_system_score_codex":0.00006319415,"about_ca_system_score_gemma":0.00003400856,"threshold_uncertainty_score":0.47322845},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98172367,0.00008881054,0.00021618704,0.00004423184,0.0023657593,0.000099410456,8.039823e-7,0.00013336404,0.01532776],"genre_scores_gemma":[0.99751765,0.000008495488,0.002186451,0.00015781379,3.634722e-7,0.0000069836897,4.894061e-7,0.000008198687,0.00011355142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900013,0.000046315905,0.0002281551,0.00027084645,0.00023794784,0.00021659862],"domain_scores_gemma":[0.9990613,0.000078100966,0.00010970731,0.00056133146,0.000102334365,0.00008725494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028547453,0.00011540991,0.00016943093,0.00014725012,0.00007324016,0.000020346039,0.0005274529,0.000059584738,0.000027256121],"category_scores_gemma":[0.000044056454,0.00010537881,0.000075421085,0.00043905334,0.000059822356,0.00016909915,0.00014641444,0.00011550245,0.00011683229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008700229,0.00016685257,0.0012706625,0.000007704383,0.000013381298,0.0000062234985,0.00041320524,0.0000059051235,0.0009564884,0.9947066,0.0021122368,0.00033208064],"study_design_scores_gemma":[0.000556094,0.0002976629,0.002431596,0.000035754947,0.000004812008,0.0000021420872,0.0000054848015,0.0004168708,0.025061134,0.97095174,0.00011246136,0.00012424072],"about_ca_topic_score_codex":0.00004801279,"about_ca_topic_score_gemma":4.2974193e-7,"teacher_disagreement_score":0.024104645,"about_ca_system_score_codex":0.000011951558,"about_ca_system_score_gemma":0.000032508517,"threshold_uncertainty_score":0.4297223},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99637556,0.0022649982,0.0000894387,0.000025472731,0.000618596,0.00022052837,0.0000035158714,0.00012317013,0.00027870017],"genre_scores_gemma":[0.9996715,0.00004922007,0.00010949449,0.000020270456,0.000014059069,0.00006230377,0.0000026533764,0.000032014355,0.000038488957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932766,0.000020282578,0.00012523883,0.00013037975,0.00008882765,0.00030761777],"domain_scores_gemma":[0.9995765,0.00009355621,0.000028226037,0.00013822777,0.000027594997,0.0001358719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023395952,0.00015691738,0.00018878271,0.000045409182,0.00009085715,0.00004952299,0.000057846122,0.000061546,0.000004227864],"category_scores_gemma":[0.000019887957,0.0001328303,0.000027543541,0.00009767059,0.000060211278,0.00028614234,0.00001962745,0.00007330002,0.0000026314162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009781835,0.000075037584,0.23754756,0.0006736375,0.00030866478,0.000006049242,0.002710108,0.00006664259,0.008201445,0.74754626,0.0014363944,0.0013303973],"study_design_scores_gemma":[0.017366152,0.002284488,0.30965516,0.001051486,0.0011515759,0.0004539729,0.003361644,0.008050326,0.08892561,0.4396833,0.1239637,0.004052598],"about_ca_topic_score_codex":0.0000071197337,"about_ca_topic_score_gemma":0.0000020696689,"teacher_disagreement_score":0.30786294,"about_ca_system_score_codex":0.000009056821,"about_ca_system_score_gemma":0.0000028451607,"threshold_uncertainty_score":0.54166627},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93479437,0.00002199866,0.00016919455,0.0016764363,0.0039634854,0.0002082942,0.0000028988416,0.00012862304,0.059034716],"genre_scores_gemma":[0.98961437,0.0000027196265,0.000117560936,0.00072041835,0.00003434611,0.000014138403,0.0000016638683,0.000024771976,0.009470023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898165,0.000063384956,0.00020542507,0.00020548653,0.00030908576,0.0002349528],"domain_scores_gemma":[0.9967715,0.0022908896,0.00010814886,0.0006693958,0.000076575525,0.0000834645],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00074046303,0.00016186757,0.00019177838,0.00010042325,0.00019904925,0.00004043152,0.00031938782,0.00013155049,0.0025631792],"category_scores_gemma":[0.0022144192,0.00010085492,0.00011955973,0.00045286334,0.00012386219,0.00004197033,0.000056066165,0.00055567623,0.0008358247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001230337,0.00009800144,0.0001964362,0.000005784009,0.000042859985,0.0000036055249,0.00007789368,3.9553132e-7,0.00005552595,0.9167802,0.082452826,0.00027417316],"study_design_scores_gemma":[0.0004456628,0.0000845441,0.00027401038,0.0000068931927,0.0000345151,0.000007749437,0.00007787705,0.000059728303,0.00083883497,0.9840184,0.014020361,0.00013144745],"about_ca_topic_score_codex":0.00000818249,"about_ca_topic_score_gemma":0.0000033828114,"teacher_disagreement_score":0.068432465,"about_ca_system_score_codex":0.000023154378,"about_ca_system_score_gemma":0.0000406931,"threshold_uncertainty_score":0.9999421},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.960895,0.005940963,0.016082203,0.0008037976,0.0031082288,0.0009236396,0.0000010583084,0.0024569351,0.009788162],"genre_scores_gemma":[0.92521137,0.000016441187,0.07462097,0.0000732646,0.000003178673,0.000031848307,0.0000011255178,0.0000087721955,0.00003301324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891245,0.00006350586,0.00019736947,0.00037598473,0.00020684667,0.00024384721],"domain_scores_gemma":[0.99922824,0.000026226046,0.00008659292,0.00052306603,0.000088440574,0.00004742855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003914022,0.00012819548,0.0001326168,0.00038104097,0.00005481631,0.00006569728,0.00092612975,0.00006181703,0.00000630742],"category_scores_gemma":[0.00008385118,0.00011904682,0.000044385175,0.0012277799,0.000051752686,0.00077910855,0.0001717064,0.00020254283,0.000011309976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047180256,0.00011551776,0.007360867,0.000011331698,0.000003570214,0.00002302368,0.0009490907,3.4706126e-8,0.00072133,0.97291124,0.00019190017,0.017707407],"study_design_scores_gemma":[0.00025399268,0.00005615966,0.0105468035,0.000032440566,0.0000020599177,0.000007774765,0.0000072002385,0.00014287115,0.041301288,0.94740033,0.00008294758,0.00016615195],"about_ca_topic_score_codex":0.00011097326,"about_ca_topic_score_gemma":0.000015692995,"teacher_disagreement_score":0.058538765,"about_ca_system_score_codex":0.000032738517,"about_ca_system_score_gemma":0.00003274025,"threshold_uncertainty_score":0.48545885},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97044814,0.000031144686,0.009003654,0.0022460974,0.0009231949,0.000585945,7.48202e-7,0.00008992228,0.016671179],"genre_scores_gemma":[0.99871206,0.0000024034337,0.00076026784,0.00013330356,0.00000250246,0.000053587024,5.305602e-7,0.000007568498,0.00032778212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988863,0.00017762401,0.00015311438,0.00020518963,0.00036078834,0.0002169839],"domain_scores_gemma":[0.99814445,0.0008554014,0.00008201989,0.0006802035,0.000181588,0.00005632921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045323334,0.00008987729,0.000107078675,0.00008107323,0.00010890187,0.00005739887,0.0010409958,0.000038916176,0.00008674081],"category_scores_gemma":[0.00025597378,0.00006298173,0.00005136831,0.00051795505,0.00011585512,0.0003712375,0.00017801856,0.00013922493,0.0002996495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045625475,0.000057128036,0.00007287531,0.0000034097236,0.000007422768,7.8929475e-7,0.00022349539,0.000007275739,0.0026502903,0.9913701,0.0024723245,0.003130345],"study_design_scores_gemma":[0.00030598926,0.00011521089,0.00089120545,0.000010407236,0.0000010447885,8.024809e-7,0.00003469272,0.0018393872,0.015528267,0.9810962,0.000104207116,0.0000725676],"about_ca_topic_score_codex":0.00002113827,"about_ca_topic_score_gemma":6.42421e-7,"teacher_disagreement_score":0.02826394,"about_ca_system_score_codex":0.00003477718,"about_ca_system_score_gemma":0.000029398067,"threshold_uncertainty_score":0.3851488},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901071,0.00007386538,0.00001424596,0.0008759153,0.00040883865,0.0002797513,0.0000046442847,0.000115840296,0.008119776],"genre_scores_gemma":[0.9986093,0.000014768176,0.00026446884,0.00019601408,0.000018684737,0.000014221826,0.0000033558636,0.000027617585,0.0008515926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853456,0.00016069434,0.00022604893,0.00029259807,0.0003869839,0.00039910132],"domain_scores_gemma":[0.9985577,0.00068031414,0.000060895476,0.0004864704,0.000059627433,0.00015502307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064762373,0.00017498586,0.0002496149,0.00009093182,0.00012805837,0.00006242836,0.000266762,0.00011168534,0.00012979389],"category_scores_gemma":[0.0006900323,0.0001629985,0.00005632638,0.00017817473,0.00007160457,0.00010813106,0.00007986747,0.0003175307,0.0002038494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009012148,0.00025125808,0.0001872415,0.00001669903,0.000019965619,0.000026971657,0.00031392946,5.0556855e-7,0.00059449684,0.985597,0.01080896,0.0020928166],"study_design_scores_gemma":[0.0011535016,0.00051717844,0.0015693202,0.000038394537,0.00001541155,0.000007764061,0.000028119186,0.0002555243,0.0027472998,0.99233556,0.0011513045,0.00018060025],"about_ca_topic_score_codex":0.000004791647,"about_ca_topic_score_gemma":0.0000010334762,"teacher_disagreement_score":0.009657656,"about_ca_system_score_codex":0.00006251809,"about_ca_system_score_gemma":0.000039275197,"threshold_uncertainty_score":0.6646886},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98679394,0.000030306166,0.000048758237,0.00055650034,0.00038409603,0.00027161947,0.000007166149,0.00005837113,0.01184922],"genre_scores_gemma":[0.9996023,0.0000040414548,0.00007739407,0.0001379979,0.0000060804823,0.00006120896,0.0000020703653,0.00001525688,0.00009360324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999221,0.000111919835,0.00020512317,0.00010021712,0.00015515323,0.00020653656],"domain_scores_gemma":[0.9978553,0.0013697494,0.00012791817,0.0005270254,0.00005791671,0.00006210678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044056194,0.00010981879,0.00015804697,0.000055342593,0.00013407852,0.000007778566,0.00024613063,0.000082157596,0.000117804586],"category_scores_gemma":[0.00033268266,0.00007671587,0.00009550225,0.00032705857,0.00009689817,0.000051904342,0.0000375727,0.00019008169,0.000037271064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012770965,0.0003020645,0.0013955747,0.00000985774,0.00003183129,1.6542336e-7,0.0006158024,2.0335987e-7,0.00105398,0.9933445,0.0031376523,0.00009558293],"study_design_scores_gemma":[0.00025871492,0.000035832803,0.002205413,0.000018949084,0.000031015257,0.0000012653146,0.00014770473,0.000012817241,0.013475237,0.98258835,0.0011353192,0.00008940696],"about_ca_topic_score_codex":0.000010711877,"about_ca_topic_score_gemma":0.000002716754,"teacher_disagreement_score":0.012808384,"about_ca_system_score_codex":0.00000824204,"about_ca_system_score_gemma":0.000012991559,"threshold_uncertainty_score":0.31283823},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99391085,0.0005968264,0.0027099212,0.00030267044,0.00063276617,0.0001425825,0.0000011937354,0.00004164162,0.0016615536],"genre_scores_gemma":[0.99888206,0.0001286544,0.0009234564,0.000015917349,0.0000024556155,0.000008824351,2.230668e-7,0.000006671502,0.000031731386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988087,0.00018821156,0.00022998091,0.0002143895,0.0003179653,0.00024080009],"domain_scores_gemma":[0.9981944,0.0008035495,0.00011519076,0.0006631992,0.00015006698,0.00007357306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000725824,0.0000943914,0.00018013759,0.00009443627,0.00013845401,0.000033909175,0.00082672643,0.000039852443,0.0000015122556],"category_scores_gemma":[0.00023173288,0.000067981324,0.000062314844,0.00052364956,0.0004693987,0.00019273872,0.0002851556,0.00011382076,0.0000021485073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012193741,0.00003633606,0.0049652345,0.000012080405,0.000016058922,4.742152e-7,0.000093957286,0.000004606661,0.0023772551,0.9835172,0.00008943729,0.008875128],"study_design_scores_gemma":[0.00033441378,0.00019789235,0.0036605888,0.000012925198,0.000003822951,0.0000023423686,0.000021925996,0.0021832108,0.027306879,0.96470344,0.0014970301,0.000075555],"about_ca_topic_score_codex":0.000011479361,"about_ca_topic_score_gemma":0.0000024696185,"teacher_disagreement_score":0.024929624,"about_ca_system_score_codex":0.000004765669,"about_ca_system_score_gemma":0.000029223198,"threshold_uncertainty_score":0.27721977},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9831923,0.00039133293,0.0012539165,0.0003242451,0.0007651374,0.00022156192,0.0000022824115,0.00010528726,0.013743887],"genre_scores_gemma":[0.99579877,0.000021090258,0.003447311,0.00006477154,0.0000019259264,0.0000120808645,7.866835e-7,0.000014128875,0.00063911994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984985,0.000119824275,0.00019519943,0.00036256143,0.0004688269,0.00035507054],"domain_scores_gemma":[0.998658,0.00023877747,0.000074593576,0.0006251655,0.00015348675,0.00024997175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006857132,0.0001418121,0.000221032,0.00017860027,0.00007910453,0.000056472418,0.00065319834,0.00006990646,0.000010377092],"category_scores_gemma":[0.0001533859,0.00013323534,0.0000536446,0.0006489101,0.0001618784,0.0005276223,0.00017284109,0.00020116569,0.000035092435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003356088,0.00012493534,0.0020114675,0.000010506478,0.000013925615,0.000008862977,0.00049581856,0.00004862069,0.00023592639,0.99369234,0.0018372441,0.0014867729],"study_design_scores_gemma":[0.0010922198,0.00036060667,0.0006317408,0.000019633264,0.0000031250781,0.000009446203,0.00008856085,0.001106724,0.0046320087,0.99102217,0.0008865784,0.0001471638],"about_ca_topic_score_codex":0.000029520741,"about_ca_topic_score_gemma":0.0000019089152,"teacher_disagreement_score":0.013104767,"about_ca_system_score_codex":0.0000354871,"about_ca_system_score_gemma":0.000074833486,"threshold_uncertainty_score":0.543318},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75871044,0.000543587,0.21101621,0.0002933869,0.010633092,0.00037338983,0.000022391601,0.0018415232,0.016566003],"genre_scores_gemma":[0.99021924,0.000012204792,0.009408588,0.00004881897,0.000030777977,0.00001285718,0.000018406732,0.000037838545,0.00021127054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993499,0.000009753802,0.00012903294,0.0001535648,0.00014064056,0.00021714493],"domain_scores_gemma":[0.9994638,0.000039342154,0.000019127234,0.00023615983,0.00005025475,0.00019131602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006992047,0.0001306922,0.00014183896,0.000054614386,0.000038270282,0.000046742043,0.0001333213,0.00006402675,0.000013593317],"category_scores_gemma":[0.0001072233,0.00014345505,0.000021629485,0.00011183428,0.000013070249,0.00010506063,0.00003877478,0.00011024117,0.00013866797],"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.000008383404,0.000019261628,0.000107155895,0.000007958835,0.000022222124,0.000010162425,0.000707596,0.97032315,0.0003506406,0.01791326,0.009127222,0.0014030172],"study_design_scores_gemma":[0.003041001,0.00025171717,0.0011661588,0.00011091303,0.00007157452,0.0000060222415,0.00070217677,0.1306195,0.05954964,0.7202474,0.08274528,0.0014886159],"about_ca_topic_score_codex":0.00004052396,"about_ca_topic_score_gemma":0.0000041607022,"teacher_disagreement_score":0.8397036,"about_ca_system_score_codex":0.00011260211,"about_ca_system_score_gemma":0.000013126925,"threshold_uncertainty_score":0.5849927},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97913575,0.000039985098,0.0004085837,0.0012794113,0.00020749592,0.00018150403,0.000023621376,0.000025737969,0.018697906],"genre_scores_gemma":[0.998599,0.000006477064,0.00044855668,0.00009818876,0.00001913002,0.000054200784,0.000008919444,0.000010140441,0.0007554086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995134,0.000015369724,0.000107490545,0.00014460734,0.00008314345,0.00013600966],"domain_scores_gemma":[0.99932563,0.00031715486,0.000057293935,0.00022095573,0.000023221062,0.000055727964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000087289554,0.000098187345,0.00010222494,0.000008051718,0.00018927107,0.000048817845,0.00014900541,0.00002370782,0.0004894292],"category_scores_gemma":[0.000011904727,0.00006282374,0.00003229814,0.000087700464,0.00009506853,0.000050166538,0.00003932677,0.00016395807,0.0000526339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019172203,0.000045501914,0.00012855699,0.000002149965,0.000009074526,8.480415e-8,0.000032311025,7.767394e-7,0.0024648989,0.9922676,0.0044663846,0.0005807578],"study_design_scores_gemma":[0.00017659029,0.000012524855,0.000020184136,0.0000037155003,0.0000077420445,2.8928983e-7,0.00006353122,0.00009140249,0.004789933,0.9800088,0.0147394575,0.00008586837],"about_ca_topic_score_codex":0.000026347103,"about_ca_topic_score_gemma":4.9781926e-7,"teacher_disagreement_score":0.019463224,"about_ca_system_score_codex":0.0000031197214,"about_ca_system_score_gemma":0.000009103053,"threshold_uncertainty_score":0.5358907},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99406105,0.00014474751,0.0004633717,0.00086408056,0.0010292319,0.00009770182,9.932041e-7,0.00018316638,0.0031556312],"genre_scores_gemma":[0.9986899,0.000005958395,0.0007200318,0.0005071874,4.4874332e-7,0.0000018325128,0.0000013203191,0.0000045171782,0.00006879825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989491,0.000043035976,0.0002181669,0.00027942777,0.00029728518,0.00021295779],"domain_scores_gemma":[0.9990409,0.000068161076,0.0001059827,0.00060897093,0.000093727,0.000082280094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001973525,0.000117526644,0.00017808881,0.00011172948,0.000059072867,0.00003127275,0.0005383158,0.00006831229,0.0000053241897],"category_scores_gemma":[0.000050470055,0.00010677829,0.000056212404,0.0005120268,0.00002947813,0.00013471098,0.00005235335,0.00012668547,0.000032263873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054866377,0.00017499168,0.0010378349,0.0000024073397,0.000005712071,0.0000065727554,0.00008864697,0.00014187716,0.0011006598,0.9885726,0.0028925121,0.0059707076],"study_design_scores_gemma":[0.0008093844,0.0003314771,0.021111539,0.000041552725,0.0000022300778,0.0000024843653,0.0000016389718,0.010506066,0.0034851218,0.96349806,0.00008628397,0.00012418385],"about_ca_topic_score_codex":0.000015326434,"about_ca_topic_score_gemma":8.423108e-7,"teacher_disagreement_score":0.025074553,"about_ca_system_score_codex":0.000014768435,"about_ca_system_score_gemma":0.0000343499,"threshold_uncertainty_score":0.43542922},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9718762,0.00023745949,0.0012270218,0.0002678613,0.0034179115,0.0006291402,0.0000074087557,0.00075180427,0.021585165],"genre_scores_gemma":[0.9867947,0.000011380777,0.011520572,0.000060902727,0.00003632938,0.00013373375,0.000007759478,0.00008791616,0.0013467139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979978,0.000101655,0.0004481889,0.00031196143,0.00066803826,0.00047236242],"domain_scores_gemma":[0.9978611,0.00044311563,0.00025354492,0.00074067066,0.00041188736,0.00028968204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047436,0.00029327764,0.0004267891,0.00010409931,0.00021876972,0.00016044169,0.00036031852,0.00010877148,0.000043346787],"category_scores_gemma":[0.001088959,0.00026380562,0.000073283016,0.00039119864,0.00018088246,0.00056689425,0.00014823582,0.00025227174,0.00013546375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022219327,0.000252108,0.0005407677,0.00006362147,0.00005431368,0.000031326785,0.0012366498,0.000009412947,0.000022151044,0.98294073,0.014810187,0.00001651599],"study_design_scores_gemma":[0.0016726519,0.00022484601,0.000024518211,0.000111966154,0.00007528714,0.000043568205,0.0010864659,0.0000710783,0.00093466096,0.9939672,0.0014332286,0.00035454304],"about_ca_topic_score_codex":0.000010978064,"about_ca_topic_score_gemma":0.000021144504,"teacher_disagreement_score":0.02023845,"about_ca_system_score_codex":0.00022201588,"about_ca_system_score_gemma":0.00019072411,"threshold_uncertainty_score":0.9999814},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.994317,0.00009417422,0.003142163,0.00019822849,0.0002694615,0.0003517918,0.0000014614211,0.00005531178,0.0015704405],"genre_scores_gemma":[0.9973944,0.0000225866,0.0024184464,0.000025057003,0.000001888957,0.000031827953,0.0000024897188,0.000008234907,0.00009507938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987845,0.000119330536,0.0002127094,0.00027835154,0.00035760415,0.00024754787],"domain_scores_gemma":[0.99901813,0.00017591835,0.000096358184,0.0003660961,0.00024191091,0.00010159812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003537253,0.000107833686,0.00015730855,0.00012693013,0.00010424009,0.000066928675,0.0005289494,0.000039455645,0.00009301454],"category_scores_gemma":[0.00005907559,0.000102026715,0.000037405378,0.00048653543,0.00006537346,0.0007713699,0.00037365025,0.000103554514,0.00008574871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035317082,0.000063544074,0.004944184,0.000016359332,0.000009149322,0.0000014490374,0.00018966998,6.408786e-7,0.0029473207,0.98822117,0.00035869336,0.003244281],"study_design_scores_gemma":[0.00073407404,0.00008916586,0.027015168,0.00001872585,0.0000022666593,0.00000600144,0.00002523463,0.004818637,0.0067916946,0.9602481,0.00013653102,0.00011438264],"about_ca_topic_score_codex":0.000028081482,"about_ca_topic_score_gemma":0.0000014511517,"teacher_disagreement_score":0.027973058,"about_ca_system_score_codex":0.000021567454,"about_ca_system_score_gemma":0.000017221166,"threshold_uncertainty_score":0.41605285},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98321587,0.000444165,0.00036906818,0.0005057361,0.005736994,0.000116603755,4.3692881e-7,0.00041799873,0.009193108],"genre_scores_gemma":[0.99728364,0.0000059314057,0.0019146417,0.00060801685,0.0000011485079,0.000008358476,9.750848e-7,0.000008721221,0.0001685499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894387,0.00005386609,0.0001444494,0.00021688991,0.00026565004,0.00037527256],"domain_scores_gemma":[0.9990184,0.00008827824,0.000054307704,0.0006062151,0.000049021837,0.00018378132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003648355,0.00011862141,0.00011332403,0.00011213549,0.00012378149,0.000056502475,0.00046900925,0.000057586516,0.000013506373],"category_scores_gemma":[0.0000434424,0.000103232334,0.00006167076,0.00040624983,0.000032107764,0.00031968142,0.00012627667,0.00013117783,0.0005171833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016217134,0.00015796654,0.0015685273,0.0000018045546,0.0000072666617,0.0000013862216,0.00015235906,0.0000020180576,0.00038683976,0.9915182,0.004928307,0.0012736755],"study_design_scores_gemma":[0.00035645603,0.00008832301,0.002183366,0.000011992979,0.000003031675,0.00000463632,0.000002516131,0.0002256202,0.004476272,0.99139255,0.0011097881,0.00014543801],"about_ca_topic_score_codex":0.000009910037,"about_ca_topic_score_gemma":1.1603065e-7,"teacher_disagreement_score":0.014067767,"about_ca_system_score_codex":0.000015748785,"about_ca_system_score_gemma":0.000018184557,"threshold_uncertainty_score":0.66475177},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9941428,0.00019266427,0.0004833265,0.0008384551,0.0017466967,0.00022518163,3.66778e-7,0.00042307389,0.0019474382],"genre_scores_gemma":[0.99685544,0.0000034231557,0.002281806,0.0005828081,6.802367e-7,0.000018525805,0.0000021167793,0.00001600387,0.00023922171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983703,0.000089499285,0.00018939588,0.00048133617,0.0005478563,0.00032162195],"domain_scores_gemma":[0.9984532,0.000038237376,0.00008019828,0.00080501224,0.0003617521,0.0002616129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003894359,0.00018506154,0.0001788352,0.00015436782,0.00013775607,0.00008938023,0.00044196006,0.000064640604,0.0000022638621],"category_scores_gemma":[0.00009848348,0.00012533565,0.00003988661,0.00074501056,0.00007434551,0.00025622544,0.00013574332,0.00016929822,0.00011554456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050633305,0.00018269174,0.00033315807,0.000004317974,0.000011669288,0.000030245663,0.00036669357,0.00014770245,0.00049151684,0.99207324,0.0057562008,0.0005519559],"study_design_scores_gemma":[0.0019628443,0.0010577629,0.00019726172,0.00010073219,0.0000070848682,0.000021185107,0.00004448977,0.0061201304,0.0035276583,0.9858189,0.00086602103,0.00027593094],"about_ca_topic_score_codex":0.000069336435,"about_ca_topic_score_gemma":0.0000026251255,"teacher_disagreement_score":0.006254316,"about_ca_system_score_codex":0.00003772715,"about_ca_system_score_gemma":0.0001140441,"threshold_uncertainty_score":0.5111039},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99154353,0.00027037505,0.000028433431,0.0003103984,0.0023117028,0.00018149428,7.1949734e-7,0.00004272222,0.005310606],"genre_scores_gemma":[0.99902433,0.000014351237,0.00081021833,0.000036286092,4.2972493e-7,0.000006794314,8.163402e-8,0.000005266449,0.00010223774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988398,0.000107802945,0.00026748783,0.00021511182,0.00038368907,0.0001861229],"domain_scores_gemma":[0.9983201,0.00007223209,0.00020693592,0.0011187342,0.0002416116,0.000040361592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060110557,0.000092118746,0.00012524561,0.000027110053,0.00016493698,0.000018102857,0.0013606922,0.00004015515,0.0000051200373],"category_scores_gemma":[0.000082367,0.000051076007,0.00008805611,0.00060053496,0.00023255213,0.0001259504,0.00027764155,0.0001461981,0.000009073331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002640414,0.00006166675,0.03068115,0.000006686323,0.00001345741,5.736433e-7,0.000758461,6.878182e-7,0.00060936017,0.9666443,0.00040652882,0.0008144887],"study_design_scores_gemma":[0.00017657097,0.00003171462,0.020303393,0.000024035662,0.0000066226257,0.0000069871658,0.000024426614,0.000068778296,0.03824318,0.940965,0.00008307699,0.0000661973],"about_ca_topic_score_codex":0.00021212263,"about_ca_topic_score_gemma":0.000008578391,"teacher_disagreement_score":0.037633818,"about_ca_system_score_codex":0.000005272153,"about_ca_system_score_gemma":0.00007666028,"threshold_uncertainty_score":0.25285274},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96123374,0.00022297277,0.02114296,0.0024294571,0.0024815272,0.0004331789,0.000001220174,0.0002559264,0.011799039],"genre_scores_gemma":[0.9990873,0.0000141857345,0.000742844,0.00007699921,0.0000027786784,0.000027068192,9.3454776e-7,0.0000050013828,0.00004292085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853045,0.0003439341,0.00017791509,0.00027579413,0.00031961707,0.00035226982],"domain_scores_gemma":[0.9985281,0.0006023126,0.000057626054,0.00062324596,0.00011623781,0.00007243581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010787477,0.000098610224,0.00010791726,0.00007281029,0.00020914116,0.0001345869,0.0011804504,0.000048538634,0.0000021035664],"category_scores_gemma":[0.00051174505,0.00007631916,0.000040345545,0.0012057516,0.00011829116,0.0003160683,0.00023633445,0.00015638265,0.0000439675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010166854,0.000029003995,0.0047022793,0.0000016361507,0.0000034992493,0.000002598931,0.000051937233,0.000009980692,0.000049825605,0.9788675,0.000116997115,0.0161546],"study_design_scores_gemma":[0.00071463274,0.00006455715,0.020299694,0.000006562334,6.9610036e-7,0.000003172771,0.000012497701,0.0076335007,0.00033346144,0.96911955,0.0017190465,0.00009263194],"about_ca_topic_score_codex":0.000016768872,"about_ca_topic_score_gemma":0.0000440011,"teacher_disagreement_score":0.03785355,"about_ca_system_score_codex":0.0000925086,"about_ca_system_score_gemma":0.00003351813,"threshold_uncertainty_score":0.31122047},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8558326,0.000016788108,0.00042107247,0.0005673704,0.0021981215,0.00036260663,0.000007450788,0.00009571275,0.1404983],"genre_scores_gemma":[0.9942253,0.0000063741268,0.0009479466,0.00008641889,0.00013205,0.000022335737,6.533455e-7,0.000032593412,0.004546317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873805,0.00011900123,0.000390323,0.00014971974,0.0003890051,0.00021387858],"domain_scores_gemma":[0.99639136,0.0027187038,0.00021951093,0.0005427168,0.00008443119,0.000043260723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058976887,0.00015125112,0.00033668816,0.000060895898,0.00010555919,0.00004019767,0.00036356974,0.0000637528,0.00033920386],"category_scores_gemma":[0.002995006,0.0001072129,0.000118382595,0.00011413547,0.0002020503,0.00011157843,0.00010986646,0.00014489247,0.00016739323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001155762,0.00009299645,0.00001731785,0.000065701286,0.000017766195,9.223344e-7,0.0005506031,0.0000010386785,0.00028591693,0.9834015,0.015472578,0.00008210611],"study_design_scores_gemma":[0.00032016856,0.00008488453,0.000057997484,0.00007867138,0.000027101809,0.0000017983622,0.00014494169,0.000037668306,0.01184286,0.98634446,0.000945116,0.00011435204],"about_ca_topic_score_codex":0.00000506805,"about_ca_topic_score_gemma":0.000004971688,"teacher_disagreement_score":0.13839272,"about_ca_system_score_codex":0.000039787912,"about_ca_system_score_gemma":0.000019490748,"threshold_uncertainty_score":0.43720153},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.995794,0.0002896263,0.00083458645,0.000040749754,0.0008173849,0.00023670186,0.0000023925074,0.00016769338,0.0018168889],"genre_scores_gemma":[0.99973553,0.0000060360735,0.00017182616,0.000030542295,0.0000071312857,0.000009605128,0.0000016867338,0.00002529372,0.000012338994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907273,0.00008015231,0.00023693047,0.00014890326,0.00020609375,0.00025517363],"domain_scores_gemma":[0.99936926,0.00006349944,0.00007110826,0.00039322866,0.000042860604,0.000060066475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022132322,0.00018351397,0.00025456044,0.00008048952,0.00014494009,0.00003331439,0.00030560445,0.00006823558,0.0000079902275],"category_scores_gemma":[0.000012296576,0.00013250933,0.00012224831,0.00042100105,0.00007359889,0.000103693106,0.000020697425,0.00017443098,0.0000052072096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011181106,0.00015193585,0.010180792,0.00028124385,0.00036837207,0.00002078789,0.005343553,0.011281394,0.096662894,0.87139076,0.0008640404,0.0033424378],"study_design_scores_gemma":[0.0014432675,0.00021580451,0.010499867,0.00043858142,0.000066168395,0.000023632118,0.0004251353,0.0031931158,0.02259234,0.9603433,0.00035341916,0.00040536653],"about_ca_topic_score_codex":0.000014282878,"about_ca_topic_score_gemma":0.000006478538,"teacher_disagreement_score":0.08895256,"about_ca_system_score_codex":0.000032382486,"about_ca_system_score_gemma":0.0000112712605,"threshold_uncertainty_score":0.54035735},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9876518,0.00030280693,0.0018404977,0.0003089367,0.0019767666,0.00008399239,0.0000019976217,0.00019549803,0.0076376908],"genre_scores_gemma":[0.9986986,0.000029464492,0.0008485132,0.0003678878,0.000009932238,0.0000066215352,7.651012e-7,0.0000054018874,0.000032809818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929893,0.000061923354,0.00008489357,0.00017136548,0.00013521616,0.00024765363],"domain_scores_gemma":[0.9993208,0.00016422744,0.00003122039,0.0003552806,0.000019253275,0.00010923546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000325468,0.00010168286,0.00010402594,0.000082539125,0.00012649012,0.00006751196,0.00030873748,0.000043269723,0.000005755987],"category_scores_gemma":[0.000027451908,0.00009268364,0.000037109447,0.00024445157,0.000054542357,0.00030153416,0.00015262268,0.000102075835,0.000054535656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000598393,0.000048556394,0.0033190374,0.0000036245578,0.0000063903085,0.00000144207,0.0011729597,3.9175947e-7,0.00011047653,0.9854964,0.00075006054,0.009084657],"study_design_scores_gemma":[0.0005248073,0.0001988871,0.015752314,0.00002281984,0.0000076291326,0.00001058988,0.000051811283,0.00036558384,0.002040091,0.9604765,0.020302039,0.00024689385],"about_ca_topic_score_codex":0.0000055441556,"about_ca_topic_score_gemma":6.0731975e-7,"teacher_disagreement_score":0.025019884,"about_ca_system_score_codex":0.000011221005,"about_ca_system_score_gemma":0.000009679814,"threshold_uncertainty_score":0.37795287},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9949626,0.00008727019,0.0015865205,0.000050723487,0.00045194317,0.0001761676,0.0000015184179,0.00006086178,0.0026224453],"genre_scores_gemma":[0.99742407,0.0000111069385,0.0024213437,0.000019033296,0.0000016020077,0.000014954238,7.994623e-7,0.000008459563,0.00009866157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891865,0.00010883319,0.00017669247,0.0002888548,0.00027903778,0.00022792885],"domain_scores_gemma":[0.9990146,0.0002087592,0.00008851337,0.00043960437,0.00015697963,0.00009154686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032572448,0.0001122685,0.00015503059,0.00022429258,0.00007328917,0.000026966985,0.00040254617,0.00005077798,0.00001105541],"category_scores_gemma":[0.00011979133,0.00010538905,0.000039258626,0.00062362064,0.00015507123,0.0004020107,0.00016299149,0.00009978515,0.000013838082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045953973,0.00012849255,0.0016501767,0.000011492889,0.000012039618,0.000010393073,0.0005819807,9.182492e-7,0.0049649747,0.9888589,0.00006334146,0.0036713704],"study_design_scores_gemma":[0.00065208296,0.00056483573,0.01665875,0.000017224584,0.0000037266254,0.0000065621693,0.000027679818,0.00042915595,0.07941408,0.9020707,0.000029509118,0.00012567606],"about_ca_topic_score_codex":0.000013182277,"about_ca_topic_score_gemma":0.000001691615,"teacher_disagreement_score":0.08678815,"about_ca_system_score_codex":0.000016389205,"about_ca_system_score_gemma":0.000027914528,"threshold_uncertainty_score":0.4297641},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99622405,0.000050265757,0.0013549774,0.00033680702,0.00089097704,0.00021204803,0.0000081020735,0.000081408405,0.00084135396],"genre_scores_gemma":[0.99697906,0.000013232068,0.0028823728,0.0000781597,0.0000023047912,0.000012432755,0.0000020729087,0.0000109231005,0.000019418103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884975,0.00008322291,0.000189353,0.00032720965,0.00026025003,0.0002902126],"domain_scores_gemma":[0.9982911,0.0006860765,0.00008980392,0.0007079415,0.00010994414,0.00011516277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042099104,0.0001522257,0.00021358953,0.00017123688,0.00012286603,0.0000423354,0.000755523,0.00005027363,0.000019338719],"category_scores_gemma":[0.0001360363,0.00012089599,0.000056097902,0.00036634243,0.0002377874,0.0002062749,0.00030292466,0.00030133483,0.000011912705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014805475,0.0000925258,0.0029027942,0.0000069235944,0.000014351792,0.0000033002038,0.0002352231,0.0000010804171,0.033652086,0.9565398,0.000060264138,0.006476857],"study_design_scores_gemma":[0.00076607213,0.00026217723,0.0035370353,0.0000104777455,0.0000014156574,0.0000060873945,0.00001758476,0.00044041255,0.08138177,0.9128183,0.0006417047,0.00011695443],"about_ca_topic_score_codex":0.000017474136,"about_ca_topic_score_gemma":0.0000070805595,"teacher_disagreement_score":0.047729682,"about_ca_system_score_codex":0.000007997485,"about_ca_system_score_gemma":0.000022067268,"threshold_uncertainty_score":0.49299952},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59041005,0.000035581426,0.34750482,0.00041207776,0.0028869277,0.00040643872,0.0000011533259,0.0006415814,0.05770138],"genre_scores_gemma":[0.99220806,0.00000263535,0.0070372173,0.00025337207,0.000007232333,0.000026001295,0.0000011757322,0.000018517278,0.00044576195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984823,0.00016613661,0.00013581976,0.00045134485,0.0003934256,0.00037099852],"domain_scores_gemma":[0.99850756,0.0003586225,0.00006122114,0.0008150742,0.00012781374,0.00012972555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004997807,0.00015898404,0.0001614417,0.00019005824,0.00017747455,0.00011391984,0.0008088407,0.000058334903,0.0000203615],"category_scores_gemma":[0.00012839475,0.00013237334,0.00004123415,0.0008767349,0.000086426764,0.00041445135,0.00015761162,0.00026920176,0.00013002731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048821712,0.00008801911,0.00037515792,0.000006150805,0.000013229562,0.000004354714,0.00008780605,0.00018282184,0.0005651931,0.99612373,0.0003752407,0.002129483],"study_design_scores_gemma":[0.0008317471,0.00093332434,0.00039631224,0.000033934575,0.000003019128,0.000012274976,0.000011496525,0.005071829,0.0028833216,0.9879419,0.0016956708,0.00018517663],"about_ca_topic_score_codex":0.000015198296,"about_ca_topic_score_gemma":0.000002990274,"teacher_disagreement_score":0.40179804,"about_ca_system_score_codex":0.00006061318,"about_ca_system_score_gemma":0.000041954838,"threshold_uncertainty_score":0.53980285},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9887005,0.0010038164,0.0001796449,0.000009974433,0.0028368738,0.00032197748,0.000009322599,0.00021249687,0.0067253793],"genre_scores_gemma":[0.99982435,0.000009376047,0.000020687095,0.0000086265445,0.000014890642,0.000028059123,0.000004049921,0.000017825667,0.00007213504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993531,0.000022077822,0.00024261254,0.00010013175,0.00009250465,0.00018959],"domain_scores_gemma":[0.99957675,0.000056039735,0.000039523165,0.00023802857,0.000037504706,0.000052179766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018247643,0.00010875037,0.00022070641,0.000055357166,0.00003548027,0.000015080912,0.00014923456,0.0000749642,0.000007346501],"category_scores_gemma":[0.000014818607,0.000110308836,0.00007845144,0.00012544499,0.0000145986005,0.000065405446,0.000004871903,0.000056789384,0.000021198664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008711542,0.000040081333,0.00020165762,0.00014508526,0.000035332967,0.0000012238643,0.00016506283,0.0018959953,0.009187714,0.9856278,0.0021607592,0.0005305969],"study_design_scores_gemma":[0.0023902378,0.00046594677,0.0032729157,0.00023265959,0.000056718385,0.000012522485,0.00033368837,0.012599128,0.02460118,0.9450584,0.010417704,0.00055892236],"about_ca_topic_score_codex":0.000005426294,"about_ca_topic_score_gemma":2.4876073e-7,"teacher_disagreement_score":0.040569402,"about_ca_system_score_codex":0.000019390469,"about_ca_system_score_gemma":0.0000048205497,"threshold_uncertainty_score":0.4498264},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99831486,0.000046106474,0.000016637527,0.00014016441,0.00009502881,0.00028071098,0.00001616715,0.000034243138,0.0010560584],"genre_scores_gemma":[0.9986082,0.000015179046,0.0012907116,0.000022592627,0.0000011182541,0.000015934784,0.0000054663506,0.000008143116,0.000032672306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992726,0.000038957547,0.0002601527,0.00017262224,0.00014186643,0.00011381742],"domain_scores_gemma":[0.9991565,0.00019173656,0.0001539951,0.00034451386,0.00010779601,0.000045465607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018965449,0.00009919149,0.00020135372,0.00012199782,0.00007219302,0.0000056368935,0.00011290651,0.00003479581,0.000011457069],"category_scores_gemma":[0.00013594388,0.00008973334,0.00006861325,0.00035741838,0.00011359276,0.000046514946,0.000012357637,0.00007851755,0.0000016689036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019137511,0.0004627233,0.00075802556,0.000030482395,0.000025343992,7.8187526e-7,0.00039206218,0.0000030551864,0.004943768,0.99270123,0.00043253324,0.00023083687],"study_design_scores_gemma":[0.00044475574,0.00019852577,0.008069553,0.000031800584,0.00004639305,0.0000045756783,0.00009675769,0.000009707219,0.014995946,0.9759966,0.00002086991,0.00008451978],"about_ca_topic_score_codex":0.0000031746602,"about_ca_topic_score_gemma":3.2390133e-7,"teacher_disagreement_score":0.016704654,"about_ca_system_score_codex":0.0000046134974,"about_ca_system_score_gemma":0.000013883514,"threshold_uncertainty_score":0.36592194},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9821577,0.000027693055,0.013574517,0.0026321285,0.00074246863,0.00032657624,0.0000019203185,0.000058096422,0.0004789216],"genre_scores_gemma":[0.99484515,7.2948825e-7,0.0048722797,0.00020847977,0.0000057761945,0.000035461104,9.72965e-7,0.000007980154,0.000023145247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986999,0.00034310366,0.00014114154,0.0002809221,0.00036006616,0.00017487741],"domain_scores_gemma":[0.99823815,0.000085626605,0.00011908443,0.0012874936,0.00015514181,0.00011452476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007228677,0.00011170798,0.00011365761,0.00004449743,0.00018411897,0.00013469707,0.0016814263,0.000032178374,6.7010353e-7],"category_scores_gemma":[0.000053793454,0.0000612594,0.0000546565,0.00082217075,0.00017042618,0.00024317135,0.00016064705,0.00011220217,0.000006034383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024545385,0.00011088985,0.0025406922,0.0000017983302,0.000020998532,7.668293e-7,0.0038119722,0.0003868546,0.00019437916,0.9903989,0.00066869246,0.0018395339],"study_design_scores_gemma":[0.00095254276,0.0008945778,0.029059872,0.000046736943,0.000035022244,0.000014970379,0.0009919473,0.026416833,0.004743534,0.92957205,0.0069690356,0.0003028847],"about_ca_topic_score_codex":0.00006169906,"about_ca_topic_score_gemma":0.000019121971,"teacher_disagreement_score":0.060826834,"about_ca_system_score_codex":0.000030373529,"about_ca_system_score_gemma":0.00009856741,"threshold_uncertainty_score":0.31245366},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94254553,0.000070306014,0.0018277683,0.0003390584,0.00010112473,0.00017424766,0.0000048245697,0.000034251963,0.054902866],"genre_scores_gemma":[0.9990706,9.540589e-7,0.00049117784,0.000018575402,0.000008382691,0.000011601481,0.000001929129,0.0000044698972,0.00039231396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963117,0.0000061015485,0.00012716,0.00007833732,0.000060418937,0.0000968003],"domain_scores_gemma":[0.9996941,0.000015167815,0.000049455997,0.00017384787,0.0000350204,0.00003242072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003236334,0.0000611187,0.000114544324,0.000010437425,0.000044083412,0.0000069876664,0.00009217798,0.000011526644,0.00008074698],"category_scores_gemma":[0.000004609971,0.000048638165,0.000043799555,0.000084446496,0.000039070143,0.000050220595,0.000013913934,0.000043625907,0.000020166373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028976754,0.00013580338,0.00009896316,0.000002766977,0.000006421751,4.472766e-8,0.000075563155,0.0000038197386,0.0043809814,0.99034244,0.00012505671,0.0048252507],"study_design_scores_gemma":[0.00017263404,0.000030415731,0.00018079621,0.00001455444,0.000006600114,9.115758e-8,0.0001113258,0.0000339125,0.03631594,0.9620142,0.0010614035,0.000058150526],"about_ca_topic_score_codex":0.000004227527,"about_ca_topic_score_gemma":4.0400263e-8,"teacher_disagreement_score":0.05652504,"about_ca_system_score_codex":0.0000042025003,"about_ca_system_score_gemma":0.000009842098,"threshold_uncertainty_score":0.19834067},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97439575,0.0001029311,0.013990183,0.00048180166,0.000111940186,0.0006612782,0.000031481657,0.000016330125,0.010208307],"genre_scores_gemma":[0.9988078,0.000004961009,0.000820714,0.000038090675,0.000010618339,0.0001477007,0.0000034080708,0.000009841267,0.00015685226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996304,0.000008529104,0.00009469264,0.000095518735,0.000065641005,0.00010525024],"domain_scores_gemma":[0.9993258,0.00030287396,0.000085013155,0.00022488642,0.000037219306,0.000024208495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008176858,0.00007796066,0.000108276894,0.0000064211413,0.00018061069,0.000016097345,0.00013402494,0.000012142653,0.000052709416],"category_scores_gemma":[0.0000037655568,0.00003559503,0.00003932501,0.00007263534,0.00010403051,0.000031868305,0.000025677715,0.000049785445,0.0000025489796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025831609,0.000059423546,0.00028110232,0.000007641312,0.0000449059,4.5119975e-8,0.00036243466,0.0000034766488,0.00003160034,0.9981753,0.00031635867,0.0006918704],"study_design_scores_gemma":[0.00044815667,0.00006314066,0.00033004142,0.0000080942345,0.00004125534,4.2701078e-7,0.000458241,0.00010518137,0.000892773,0.99554443,0.002046579,0.00006169254],"about_ca_topic_score_codex":0.000051225747,"about_ca_topic_score_gemma":0.0000010657938,"teacher_disagreement_score":0.024412068,"about_ca_system_score_codex":0.0000036711324,"about_ca_system_score_gemma":0.000010034519,"threshold_uncertainty_score":0.14515232},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9886681,0.00006985267,0.000043442593,0.0065365653,0.0009915567,0.0005385033,0.000027239172,0.00008197717,0.0030427992],"genre_scores_gemma":[0.9981619,0.00002075442,0.00036367172,0.0010959296,0.000062270345,0.000010319758,0.000027350414,0.000032714455,0.00022505119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981689,0.0003785773,0.000365798,0.00030281045,0.0004810534,0.0003028762],"domain_scores_gemma":[0.99778545,0.0008865709,0.00015630403,0.00081939343,0.00022968535,0.000122587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054565375,0.00028420132,0.00036863744,0.000060916107,0.00035760237,0.00009444094,0.0006770704,0.00014476776,0.00033244974],"category_scores_gemma":[0.000128577,0.00015966754,0.000102273734,0.0005459392,0.00013045612,0.000100898564,0.000090096044,0.00035229494,0.00018412403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015827258,0.00031972767,0.0006024161,0.000005404922,0.000090413385,0.000009689919,0.0016423443,0.000004185259,0.007263614,0.9772929,0.012496648,0.00011438278],"study_design_scores_gemma":[0.001113505,0.00065354974,0.0027611563,0.00018976649,0.0001429638,0.00000371548,0.0009622532,0.00019307896,0.08994126,0.90079707,0.002851811,0.0003898927],"about_ca_topic_score_codex":0.00009729117,"about_ca_topic_score_gemma":0.000022736875,"teacher_disagreement_score":0.08267765,"about_ca_system_score_codex":0.00004750822,"about_ca_system_score_gemma":0.00006347044,"threshold_uncertainty_score":0.65110534},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9713807,0.00001961139,0.00017279478,0.000013090655,0.0021037988,0.000138922,0.0000033297636,0.00029195938,0.025875775],"genre_scores_gemma":[0.9997321,0.000001279293,0.00005075897,0.000027184884,0.0000102567055,0.000023762395,0.0000030302112,0.000034152035,0.000117471245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994285,0.000026254007,0.00009545776,0.00013087312,0.00012096951,0.00019794772],"domain_scores_gemma":[0.9995457,0.0000828399,0.000013449282,0.0002521639,0.000026131458,0.000079717225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012402647,0.00014027518,0.00013021451,0.000054472213,0.00006289129,0.000024163384,0.00012211267,0.00008353609,0.00006095437],"category_scores_gemma":[0.000008236353,0.000119071454,0.000035745135,0.00014459334,0.000043118915,0.000076983306,0.000004222568,0.00029540402,0.00015066074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028454331,0.000033677818,0.00022168433,0.000017584041,0.00004373508,0.000022403714,0.0003943803,0.0002062354,0.023858044,0.9742172,0.000766975,0.00018965083],"study_design_scores_gemma":[0.0022575913,0.0005911493,0.0037774951,0.00011738329,0.000048240985,0.00005342548,0.00023200685,0.0014898473,0.10280517,0.88400096,0.003820604,0.0008061388],"about_ca_topic_score_codex":0.000004354861,"about_ca_topic_score_gemma":0.000012010456,"teacher_disagreement_score":0.09021623,"about_ca_system_score_codex":0.000011258148,"about_ca_system_score_gemma":0.000008466677,"threshold_uncertainty_score":0.48555928},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99611413,0.0003422303,0.00016283334,0.00012550277,0.0011709433,0.00007021704,4.6033537e-7,0.00009322615,0.0019204285],"genre_scores_gemma":[0.99763376,0.000021863958,0.0020989464,0.00021282639,6.2593085e-7,0.0000035822343,4.9487517e-7,0.000005875193,0.000022022832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918824,0.00005158604,0.00017296545,0.00017669013,0.00017684816,0.00023365936],"domain_scores_gemma":[0.99927676,0.0001233461,0.00008756097,0.00033524114,0.00005686191,0.000120217235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043367696,0.00009769884,0.00014561653,0.00008864351,0.00007911957,0.000026417803,0.0002159953,0.000054139433,0.0000031137201],"category_scores_gemma":[0.000045926197,0.00008747144,0.000043894386,0.0002295606,0.00006850122,0.00030073975,0.0001127572,0.00009706004,0.000008821761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033174938,0.00007117494,0.020379663,0.000010201162,0.0000104243745,4.8914757e-7,0.0004128027,0.0000017107959,0.0003197963,0.9775031,0.0005408901,0.00074639416],"study_design_scores_gemma":[0.00035507538,0.00010389004,0.0053470754,0.000032252985,0.0000058097835,0.0000033341848,0.000011109726,0.00039537478,0.0072709187,0.9863077,0.000061818195,0.000105632775],"about_ca_topic_score_codex":0.00006943328,"about_ca_topic_score_gemma":8.179469e-7,"teacher_disagreement_score":0.015032587,"about_ca_system_score_codex":0.000008263255,"about_ca_system_score_gemma":0.000012741653,"threshold_uncertainty_score":0.3566982},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9866538,0.000055062374,0.000010999435,0.0005217451,0.00029377828,0.0003351738,0.000007666103,0.000040610103,0.012081161],"genre_scores_gemma":[0.9980653,0.0000034505563,0.00006437737,0.00005308841,0.000004200222,0.000051052386,0.0000011116972,0.000020435418,0.001736983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990144,0.00017914915,0.00022601438,0.00014578701,0.00024557326,0.0001891082],"domain_scores_gemma":[0.9982048,0.0005017946,0.00020934382,0.00087792124,0.00012954265,0.00007657891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059309136,0.00012655681,0.00015867659,0.000031677904,0.00029043521,0.000024814964,0.00062251056,0.0000602146,0.000017831439],"category_scores_gemma":[0.000089435125,0.00006683574,0.00007988822,0.00043084566,0.00030746282,0.00005822008,0.000105104446,0.00023074285,0.00001116646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018190405,0.00009785479,0.003229766,0.000010686751,0.00004781092,3.9882653e-7,0.0005411717,6.777686e-7,0.000075995216,0.9908199,0.005029389,0.00012821663],"study_design_scores_gemma":[0.000688437,0.00007073076,0.0024375075,0.000020798954,0.000028360535,0.0000045132883,0.00079257594,0.000023263883,0.0014779234,0.98517984,0.009180913,0.000095115596],"about_ca_topic_score_codex":0.000007992755,"about_ca_topic_score_gemma":0.00007750761,"teacher_disagreement_score":0.011411497,"about_ca_system_score_codex":0.000016980403,"about_ca_system_score_gemma":0.0000687957,"threshold_uncertainty_score":0.27254823},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99486995,0.00021971669,0.0019635656,0.00009783327,0.00056776823,0.00019750372,0.0000020791465,0.00023049222,0.0018510845],"genre_scores_gemma":[0.9872122,0.000012506586,0.012608152,0.0001031172,3.6032725e-7,0.000019030447,0.0000024667827,0.000015086097,0.000027118009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860543,0.00011388686,0.00033172607,0.00034053632,0.00029259681,0.00031579813],"domain_scores_gemma":[0.9985684,0.00008169754,0.00019755811,0.00079244294,0.00022998033,0.00012988751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003217271,0.00018549238,0.0002902379,0.00019865303,0.000111768306,0.00003468592,0.0007533988,0.000062898755,0.000013482499],"category_scores_gemma":[0.00002063865,0.0001481706,0.00006575926,0.00086086505,0.0001729112,0.0002565566,0.00014573192,0.00011239467,0.000023202656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010722292,0.00015411018,0.004676413,0.00004272346,0.000040103332,0.000013730938,0.00076898426,0.0000112743355,0.0026118343,0.9909568,0.00025014888,0.00046319424],"study_design_scores_gemma":[0.0007815365,0.00044173273,0.005169722,0.00012961493,0.0000192513,0.000016576922,0.000028918183,0.0018594342,0.02353623,0.9676786,0.0000896387,0.00024872494],"about_ca_topic_score_codex":0.00022778245,"about_ca_topic_score_gemma":0.000011451441,"teacher_disagreement_score":0.02327814,"about_ca_system_score_codex":0.000012391364,"about_ca_system_score_gemma":0.000067347115,"threshold_uncertainty_score":0.6042222},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94337475,0.00062060123,0.001571249,0.0023186244,0.0005570722,0.00084644894,0.000015903188,0.00010021472,0.05059515],"genre_scores_gemma":[0.99675,0.000020679654,0.0006551347,0.000026582786,0.000027263957,0.00019933227,0.000005435413,0.000015640371,0.0022999072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922025,0.000023434759,0.00019175267,0.00018367119,0.000113669295,0.00026720756],"domain_scores_gemma":[0.99913496,0.0003094872,0.00007695048,0.00030460654,0.00006314429,0.00011086746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100382436,0.00013412646,0.00013505812,0.000010499142,0.00043301485,0.0001432544,0.00020308503,0.000028063536,0.00028073133],"category_scores_gemma":[0.000014078679,0.00009052652,0.000048392827,0.00011425999,0.0001908166,0.00015011654,0.000093141534,0.0001380325,0.00025304567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.847159e-7,0.00003072558,0.001034741,0.00000353215,0.000016623522,1.970021e-7,0.000055780125,0.0000016565015,0.0001531385,0.99215496,0.0012288396,0.005318835],"study_design_scores_gemma":[0.0002085454,0.00001628523,0.00064622035,0.000007064132,0.000009895712,0.0000013142085,0.00047897772,0.00017333198,0.00046295277,0.9852886,0.012585402,0.00012139706],"about_ca_topic_score_codex":0.00008412125,"about_ca_topic_score_gemma":4.935814e-7,"teacher_disagreement_score":0.05337529,"about_ca_system_score_codex":0.000013081295,"about_ca_system_score_gemma":0.000019120398,"threshold_uncertainty_score":0.36915645},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9979793,0.00021813328,0.00017107613,0.00032531132,0.0005411259,0.000056385103,4.581037e-7,0.000044647713,0.00066357985],"genre_scores_gemma":[0.99826497,0.000021872562,0.0015892058,0.00010070939,2.6308135e-7,0.0000015091852,0.0000011984121,0.000002383823,0.000017905902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991743,0.00003401692,0.00020368905,0.0002329892,0.00020315968,0.00015185073],"domain_scores_gemma":[0.99946016,0.00008290002,0.00007567168,0.00025381928,0.0000666835,0.000060778213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019605597,0.000089693924,0.00014593908,0.00014843557,0.000047164474,0.000028402466,0.00025794815,0.00005098778,0.0000027512042],"category_scores_gemma":[0.000039255287,0.000082086204,0.000030587653,0.00048670723,0.000048239806,0.00027753183,0.000050833543,0.00010383007,0.0000016934081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026730052,0.00009179657,0.023144798,0.000003883465,0.0000024063665,0.000003412139,0.00022055105,0.000010607252,0.0012780407,0.97435933,0.00006052149,0.0008219613],"study_design_scores_gemma":[0.00034529562,0.00008937281,0.124304175,0.000023845454,0.0000014170254,0.0000033348974,0.000016566333,0.00051656604,0.00199322,0.87258154,0.00003988943,0.00008476001],"about_ca_topic_score_codex":0.000048790927,"about_ca_topic_score_gemma":0.000002263024,"teacher_disagreement_score":0.10177779,"about_ca_system_score_codex":0.000009692685,"about_ca_system_score_gemma":0.000027027516,"threshold_uncertainty_score":0.3347378},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9235546,0.00019509632,0.00010611183,0.000015064058,0.0040432564,0.00007992165,0.0000012271743,0.0005456653,0.07145903],"genre_scores_gemma":[0.99968445,0.000009275542,0.000030944768,0.000032330503,0.000010258487,0.000016900294,0.00000319678,0.000028116148,0.00018454023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937254,0.000043245873,0.00014430366,0.00011631414,0.00010468999,0.0002188875],"domain_scores_gemma":[0.9995411,0.00004817605,0.000015746353,0.00029311134,0.00001883836,0.00008302214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002294182,0.000119112294,0.00014394998,0.0000644841,0.0000590249,0.000027268032,0.00016716003,0.00006775326,0.00005216525],"category_scores_gemma":[0.000016532198,0.00012036937,0.00006438141,0.00019031246,0.000024168765,0.00008618559,0.000014014933,0.00011372215,0.00030894636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017762258,0.000012905813,0.0013282103,0.00002642825,0.000020305602,0.0000012803665,0.00008010324,0.00013916208,0.0009785702,0.9912382,0.0051904013,0.0009826949],"study_design_scores_gemma":[0.00044451567,0.00003684355,0.0017240245,0.000019920875,0.000008991895,0.0000053387807,0.000028667582,0.0017364935,0.0030917013,0.9533246,0.039367158,0.00021174426],"about_ca_topic_score_codex":0.0000051928555,"about_ca_topic_score_gemma":0.0000012738485,"teacher_disagreement_score":0.07612982,"about_ca_system_score_codex":0.000013253508,"about_ca_system_score_gemma":0.0000027771853,"threshold_uncertainty_score":0.49085203},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9610474,0.00027445957,0.00008068502,0.00021945938,0.0019213791,0.00014419628,0.0000033279207,0.00017623616,0.03613287],"genre_scores_gemma":[0.997447,0.00002383629,0.0021341236,0.00018742082,5.850413e-7,0.00000447455,0.000001640893,0.000012834917,0.00018805836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840015,0.00009656173,0.00038852255,0.00045415453,0.00033352783,0.00032705945],"domain_scores_gemma":[0.9984522,0.000084899766,0.00013797212,0.0010602816,0.00014965837,0.0001150189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000492735,0.00017214194,0.00020427562,0.0002330625,0.00007855841,0.000026264763,0.0009090241,0.000088498404,0.000017981682],"category_scores_gemma":[0.00005870621,0.00014588698,0.00010477253,0.000780617,0.00011978275,0.00019038071,0.00017349598,0.00016007296,0.0001820311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016015718,0.00033798537,0.0010059658,0.0000062172116,0.000008663457,0.0000074766044,0.0014025501,0.0000026323125,0.0005925709,0.9939456,0.0011479243,0.0015264252],"study_design_scores_gemma":[0.0011222142,0.00044649714,0.004738199,0.000039489285,0.000007866757,0.0000045891175,0.000032920398,0.00035349716,0.008177821,0.98468596,0.00018791071,0.00020301396],"about_ca_topic_score_codex":0.0001136828,"about_ca_topic_score_gemma":0.0000026031744,"teacher_disagreement_score":0.036399636,"about_ca_system_score_codex":0.000012771309,"about_ca_system_score_gemma":0.00004491132,"threshold_uncertainty_score":0.59490985},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938045,0.00015951482,0.0008100091,0.00020599338,0.0018022987,0.00013731694,0.0000017556615,0.00020032973,0.002878246],"genre_scores_gemma":[0.99595416,0.000007900828,0.0037630547,0.00009923152,0.0000018439176,0.000009229107,0.000003868762,0.000016472766,0.00014425976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835515,0.00008780239,0.00029535167,0.00045994757,0.00042632653,0.00037541092],"domain_scores_gemma":[0.9985838,0.00018793091,0.00020664682,0.0006827666,0.00017445424,0.00016437902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044551387,0.00019829611,0.0002896466,0.00012666143,0.00024759248,0.00007262435,0.00069532864,0.00006428212,0.000004497844],"category_scores_gemma":[0.00012687573,0.00016685827,0.0000708899,0.0004894724,0.00009933699,0.00020914289,0.00024471217,0.00016607711,0.000024995072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019892734,0.00009213513,0.017549,0.000035424484,0.000027271542,0.000007896863,0.0005418054,0.000098954995,0.0007201506,0.9784662,0.0012142736,0.0012269695],"study_design_scores_gemma":[0.0026633332,0.00077097374,0.016157502,0.00039385745,0.000034029377,0.000028827799,0.00005417965,0.0121241715,0.0060122153,0.95945287,0.0017332583,0.0005748127],"about_ca_topic_score_codex":0.0001289036,"about_ca_topic_score_gemma":0.00002187007,"teacher_disagreement_score":0.019013386,"about_ca_system_score_codex":0.00004108496,"about_ca_system_score_gemma":0.000038569673,"threshold_uncertainty_score":0.68042827},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91533583,0.00007039203,0.08277615,0.00009442653,0.00080855313,0.00008768564,0.0000013005748,0.00009863008,0.0007270405],"genre_scores_gemma":[0.983912,0.000002311463,0.016031707,0.00002513495,0.0000061591354,0.00000572301,0.000007393672,0.0000052165833,0.0000043614596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917656,0.000090233196,0.00016099792,0.00021250529,0.00024729493,0.0001124048],"domain_scores_gemma":[0.99911934,0.00009450596,0.00013972259,0.00038378654,0.00019513858,0.0000675254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028360996,0.00008718037,0.00012645751,0.00012873087,0.00006471968,0.0000685106,0.00027512253,0.000044098328,0.0000051666234],"category_scores_gemma":[0.00006117185,0.00008066029,0.00003204397,0.00066104566,0.00009551517,0.00034469852,0.00004133113,0.00007015659,0.0000072726966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021496762,0.0000634976,0.0054608816,0.000003997973,0.000027457161,0.0000010666474,0.00066421437,0.000008988911,0.0015374036,0.99030215,0.000025512263,0.0018833602],"study_design_scores_gemma":[0.0005416431,0.00023301698,0.0032145928,0.00002639129,0.000023641369,0.0000054014845,0.00009177525,0.0025038556,0.012553463,0.9805968,0.00010097283,0.00010848029],"about_ca_topic_score_codex":0.00004150932,"about_ca_topic_score_gemma":0.0000033521555,"teacher_disagreement_score":0.06857617,"about_ca_system_score_codex":0.000029372099,"about_ca_system_score_gemma":0.00007348858,"threshold_uncertainty_score":0.32892314},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98305744,0.00014216643,0.0016654166,0.0025259077,0.0033705647,0.0003953932,0.000004581574,0.00017315795,0.008665343],"genre_scores_gemma":[0.999279,0.000007827788,0.0004493903,0.00015478743,0.000005883556,0.000015907974,0.0000024524813,0.000006240033,0.00007849974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988312,0.00011861107,0.0001467577,0.00032009,0.00038634572,0.00019698442],"domain_scores_gemma":[0.9985512,0.00013066453,0.000100874226,0.0010526334,0.00009879999,0.000065852204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009363121,0.0001176788,0.00013595443,0.000112586466,0.00007763721,0.00009214101,0.0012170512,0.00002171155,0.0000039069832],"category_scores_gemma":[0.00018661901,0.00008067037,0.00006441226,0.00084481895,0.000082317114,0.0004365397,0.00034468505,0.000121259975,0.000030419993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037242066,0.00014588397,0.0013449964,0.000004786522,0.000018470559,0.000003860659,0.0001338065,0.0000024020835,0.000022343898,0.9819943,0.011241095,0.0050843405],"study_design_scores_gemma":[0.0003790942,0.00019130022,0.004441748,0.000014007974,0.0000060485404,0.0000010428762,0.000024067525,0.0011115236,0.0012114821,0.99080247,0.0016965587,0.00012068942],"about_ca_topic_score_codex":0.000035310026,"about_ca_topic_score_gemma":0.000002009673,"teacher_disagreement_score":0.016221542,"about_ca_system_score_codex":0.000012168994,"about_ca_system_score_gemma":0.000032134103,"threshold_uncertainty_score":0.3289642},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9908766,0.00005096838,0.00012384419,0.000039902538,0.0008627127,0.00026223087,0.0000024115623,0.00006040757,0.0077209235],"genre_scores_gemma":[0.9996826,0.0000042774636,0.00019125604,0.00002507019,0.000005493432,0.000022745166,0.0000016362844,0.000025165113,0.00004177459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991275,0.000060056213,0.00028044023,0.00013037452,0.00013724514,0.00026434692],"domain_scores_gemma":[0.99962914,0.00004746653,0.000030786847,0.00016461682,0.000037347607,0.0000906676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021627393,0.0001307466,0.00023692164,0.00010912071,0.00003346488,0.000019843801,0.00012255594,0.00007003452,0.000077965444],"category_scores_gemma":[0.000015371783,0.00014600922,0.00005601317,0.00030651587,0.000019802832,0.00017602145,0.000017097967,0.00014926992,0.00011331339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017975352,0.0007235447,0.25221694,0.0013579883,0.0006482137,0.00022710167,0.061489128,0.018287541,0.16907912,0.46291146,0.008542118,0.024337085],"study_design_scores_gemma":[0.0040259142,0.00016018222,0.12287512,0.0019562463,0.00003994443,0.000043953183,0.0067838947,0.004661892,0.044922482,0.81193966,0.0013425237,0.0012481994],"about_ca_topic_score_codex":0.00013189338,"about_ca_topic_score_gemma":0.0000051598813,"teacher_disagreement_score":0.3490282,"about_ca_system_score_codex":0.00008000771,"about_ca_system_score_gemma":0.000005970178,"threshold_uncertainty_score":0.5954083},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8871276,0.000005606308,0.06406054,0.0002301635,0.0009951968,0.0007214934,0.0000028147065,0.00024286124,0.046613764],"genre_scores_gemma":[0.9871619,0.0000016263721,0.011270875,0.00009941479,0.000013896072,0.00013253157,0.000005336352,0.0000321812,0.0012822698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975978,0.00014408918,0.00026198782,0.0006416411,0.00082115066,0.00053334294],"domain_scores_gemma":[0.9982645,0.00023115615,0.00011454529,0.0008268119,0.00031676996,0.0002462463],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005688945,0.00024898697,0.00025675684,0.00018232397,0.00021899985,0.0001397532,0.00086802087,0.00010380529,0.00021277832],"category_scores_gemma":[0.00007353069,0.00022896414,0.00006506907,0.00097026455,0.000096688935,0.0010175924,0.00028905514,0.00026745745,0.0012967068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006029415,0.00029984757,0.0005724034,0.0000074516774,0.00002721288,0.000024841314,0.0019344176,0.00006631569,0.00028336464,0.9919986,0.00033554455,0.0038470738],"study_design_scores_gemma":[0.004691905,0.000698194,0.0064315917,0.00006222031,0.000010847455,0.000031363492,0.00007786554,0.0011922031,0.01707787,0.969115,0.00014162893,0.0004692949],"about_ca_topic_score_codex":0.00007941119,"about_ca_topic_score_gemma":0.000030516021,"teacher_disagreement_score":0.100034304,"about_ca_system_score_codex":0.00025372178,"about_ca_system_score_gemma":0.00009995617,"threshold_uncertainty_score":0.9994809},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99444896,0.00004519242,0.000020108351,0.0016440805,0.00075842085,0.00023337518,2.0849289e-7,0.00009508408,0.0027545493],"genre_scores_gemma":[0.99924815,0.0000024479114,0.00015058542,0.0005480706,3.601069e-7,0.000005911829,1.6578205e-7,0.0000038830394,0.000040411633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989378,0.00010392691,0.00020002924,0.00024072126,0.00033552005,0.00018199916],"domain_scores_gemma":[0.99890035,0.00012494258,0.00008941485,0.000756955,0.000074930926,0.00005340073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004713533,0.00010799239,0.00014370441,0.00008560303,0.00011580777,0.000042198888,0.00070778426,0.00002938829,0.0000033287868],"category_scores_gemma":[0.000048459126,0.00007158089,0.00006574109,0.000633896,0.000039204187,0.00008152434,0.00006334127,0.00012678294,0.000032390366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029227872,0.00048360464,0.001338071,9.206919e-7,0.000012830192,0.0000063961465,0.0010084271,0.000009594418,0.00019331757,0.99530786,0.0011453753,0.0004906714],"study_design_scores_gemma":[0.00050986797,0.00077173306,0.012423822,0.000017111106,0.000006563428,0.000002244112,0.00012864193,0.00019969122,0.00095264596,0.9848738,0.000023970686,0.00008993732],"about_ca_topic_score_codex":0.000018903815,"about_ca_topic_score_gemma":7.5594164e-7,"teacher_disagreement_score":0.011085751,"about_ca_system_score_codex":0.000008010386,"about_ca_system_score_gemma":0.000021525542,"threshold_uncertainty_score":0.29189843},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96188956,0.0002356887,0.03260803,0.00031779616,0.002118151,0.00016421816,0.000013399054,0.00020440837,0.0024487176],"genre_scores_gemma":[0.9971221,0.000007737667,0.002545956,0.00020659952,0.0000062341883,0.000009210453,0.000011698859,0.000007946432,0.00008249093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989431,0.00012711307,0.00020574708,0.00029693355,0.00019232559,0.00023480835],"domain_scores_gemma":[0.99907994,0.00021250626,0.00013909464,0.0003938868,0.00009745782,0.00007712706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002011494,0.00012765461,0.00019677842,0.000046711513,0.000082146405,0.000039550796,0.00053712155,0.000065864355,0.000010282577],"category_scores_gemma":[0.0001068157,0.0001154902,0.00004425589,0.00034737945,0.00006151054,0.00031666757,0.00015584925,0.00011503351,0.0000431071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073220617,0.00009987558,0.00089278334,0.000008324389,0.000018920917,0.0000024499184,0.00044096506,0.00026425396,0.0019375691,0.9885943,0.0029091984,0.004824031],"study_design_scores_gemma":[0.00082529004,0.0003323371,0.0005183514,0.000012356824,0.000008505395,0.000002041814,0.00001997123,0.029206315,0.033235833,0.92907,0.0065317233,0.00023725175],"about_ca_topic_score_codex":0.000013409023,"about_ca_topic_score_gemma":0.0000012877317,"teacher_disagreement_score":0.059524283,"about_ca_system_score_codex":0.000017555361,"about_ca_system_score_gemma":0.000027357366,"threshold_uncertainty_score":0.47095537},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8851658,0.000116643816,0.1124091,0.00025244307,0.0014449221,0.00012842486,0.0000018847397,0.00010719167,0.0003735899],"genre_scores_gemma":[0.9318986,0.0000022588506,0.06799427,0.000045887227,0.000022550252,0.0000051102247,0.000009009128,0.000008438535,0.000013909676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989614,0.00009963092,0.00019688248,0.0002344619,0.00029533097,0.00021231893],"domain_scores_gemma":[0.99902886,0.00013630817,0.00017903745,0.00042835873,0.00010386585,0.00012357724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024773524,0.00012814342,0.00015253735,0.00011277343,0.000116849646,0.000053002266,0.00024926194,0.000063975785,0.000036023222],"category_scores_gemma":[0.000030004663,0.00011988414,0.000055299428,0.000500328,0.00007248061,0.00057766767,0.000056042572,0.00010667847,0.000015806245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032372653,0.00009451656,0.0071533932,0.0000044460317,0.00003930808,5.859826e-7,0.0007302827,0.0000069945886,0.01097354,0.9792785,0.00013117118,0.0015549131],"study_design_scores_gemma":[0.0007372058,0.00016666204,0.015380294,0.0000492453,0.000050417282,0.000016526277,0.000033972665,0.002059417,0.021840412,0.95921373,0.00026263238,0.0001894589],"about_ca_topic_score_codex":0.000059418504,"about_ca_topic_score_gemma":0.000004417862,"teacher_disagreement_score":0.04673277,"about_ca_system_score_codex":0.0000322977,"about_ca_system_score_gemma":0.0000978277,"threshold_uncertainty_score":0.48887333},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98675704,0.000742649,0.00003124957,0.0000063795155,0.0017277611,0.00014623722,5.9762266e-7,0.00045216442,0.0101359],"genre_scores_gemma":[0.9997664,0.0000071249306,0.000026244184,0.000008954376,0.000023585208,0.000037667603,0.000002227441,0.000038565428,0.00008925017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99926406,0.00003327282,0.0001357262,0.00009093695,0.00013424717,0.00034174375],"domain_scores_gemma":[0.99958974,0.000014342552,0.000019942998,0.00024219819,0.000022632075,0.000111144866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012080052,0.00013752544,0.0001380042,0.000060162944,0.0000694642,0.000026830474,0.00012491838,0.00006340403,0.000014853565],"category_scores_gemma":[0.000009058241,0.00010922445,0.000028354943,0.00026918403,0.00002653077,0.00025765796,0.00001751861,0.00014632262,0.00008640558],"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.000048861955,0.000130338,0.050261617,0.00020465098,0.0001477743,0.000011364047,0.0022581639,0.0005421802,0.011675594,0.93255126,0.0014287333,0.00073945883],"study_design_scores_gemma":[0.016955933,0.0016837454,0.38579002,0.0022474395,0.00057453645,0.00066124735,0.006143732,0.013481532,0.19871457,0.28244573,0.08310909,0.008192413],"about_ca_topic_score_codex":0.000010993552,"about_ca_topic_score_gemma":0.0000011778175,"teacher_disagreement_score":0.65010554,"about_ca_system_score_codex":0.000039256913,"about_ca_system_score_gemma":0.000005766389,"threshold_uncertainty_score":0.44540438},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9864275,0.00009057522,0.0016970785,0.00004721842,0.001593566,0.0005332673,0.00003386514,0.00023553836,0.009341425],"genre_scores_gemma":[0.99191856,0.0000022085744,0.0071982704,0.00008029817,0.00006134711,0.000096864984,0.000028198683,0.00006146103,0.00055280107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876195,0.000096916076,0.00032221377,0.00018763472,0.00019290719,0.00043835648],"domain_scores_gemma":[0.9984106,0.0005333488,0.0001800977,0.00056692277,0.00008595228,0.00022312002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093061675,0.00020379687,0.000300683,0.00007045935,0.00028752995,0.000028641418,0.00026837192,0.00014423298,0.00014095148],"category_scores_gemma":[0.0002862818,0.00020150736,0.000118475844,0.000082774844,0.00008175336,0.00041706383,0.000028060913,0.00013077939,0.00012584534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002063302,0.0005644755,0.00029520312,0.0001220995,0.000032486027,0.0000010063319,0.0015790049,2.8790475e-7,0.0010515141,0.98987126,0.0055650417,0.00089698617],"study_design_scores_gemma":[0.00079631153,0.00013482537,0.0007563922,0.000032234464,0.00007541157,0.000012270633,0.00019275532,0.00007200835,0.002013851,0.98415035,0.011496315,0.00026729645],"about_ca_topic_score_codex":0.0000030133242,"about_ca_topic_score_gemma":0.0000041970934,"teacher_disagreement_score":0.008788624,"about_ca_system_score_codex":0.0001033718,"about_ca_system_score_gemma":0.000026288883,"threshold_uncertainty_score":0.82172316},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928475,0.000019175717,0.000043844197,0.0024736044,0.0026854316,0.00012287415,0.0000010724598,0.00009762017,0.0017088894],"genre_scores_gemma":[0.99857074,0.0000028909114,0.0010399958,0.00034131514,8.3464033e-7,0.000009881458,4.2058429e-7,0.000005376503,0.000028519065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896175,0.00007177223,0.00021802454,0.00026853007,0.00028453086,0.00019536616],"domain_scores_gemma":[0.9982504,0.00030369795,0.00009879734,0.0011487408,0.00012380829,0.00007454594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077416917,0.00010511701,0.00012919432,0.000063955864,0.00013123803,0.000045104734,0.00080233265,0.00006527048,0.000018390136],"category_scores_gemma":[0.00021635783,0.00006856065,0.00008728506,0.00049979804,0.00015762734,0.000110255256,0.00014372298,0.00030055223,0.000061214996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027175129,0.00010988062,0.0021946626,0.000003493871,0.0000050248523,6.273406e-7,0.000136325,0.0000042317483,0.010782888,0.9849138,0.001010233,0.0008360796],"study_design_scores_gemma":[0.00022311574,0.00007956316,0.005717123,0.000009247167,0.0000029383964,0.0000012367624,0.0000025307306,0.0009848413,0.031831335,0.9603519,0.0007124887,0.00008368655],"about_ca_topic_score_codex":0.000040999057,"about_ca_topic_score_gemma":0.000006477617,"teacher_disagreement_score":0.024561943,"about_ca_system_score_codex":0.000004763522,"about_ca_system_score_gemma":0.00003719164,"threshold_uncertainty_score":0.2795822},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99393255,0.00010676449,0.00026359977,0.000012306877,0.0020522827,0.00027009821,0.0000122527645,0.00022574498,0.0031244077],"genre_scores_gemma":[0.99979687,0.0000127066205,0.000025950763,0.00001684117,0.000006836397,0.000044554745,0.000014717494,0.000028806979,0.000052736876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912703,0.00005191055,0.0002907523,0.00013903303,0.00016949652,0.00022176557],"domain_scores_gemma":[0.9993875,0.00009339149,0.000058355065,0.00030764233,0.00006805578,0.00008504739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009981696,0.0001581392,0.00021636793,0.0001402637,0.00004748573,0.0000260171,0.00015394845,0.000079992904,0.00014647454],"category_scores_gemma":[0.000024423636,0.00015211185,0.00008003888,0.00032813376,0.00004348219,0.00016484474,0.000013582605,0.000107023996,0.0003279269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009700268,0.000090134825,0.008392624,0.000121238314,0.000091006965,0.0000013405328,0.0005130288,0.0022892477,0.07388958,0.9102277,0.0037774874,0.00059689506],"study_design_scores_gemma":[0.0019048396,0.00033273248,0.05425182,0.00023511024,0.000036965557,0.000002920464,0.00014678185,0.01873175,0.0675874,0.8502997,0.005726877,0.00074306136],"about_ca_topic_score_codex":0.000040353832,"about_ca_topic_score_gemma":0.0000024519998,"teacher_disagreement_score":0.059927966,"about_ca_system_score_codex":0.000017890112,"about_ca_system_score_gemma":0.000003986385,"threshold_uncertainty_score":0.6202941},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9962072,0.0000615113,0.0004346738,0.00032546383,0.0008272532,0.0001938572,6.5447824e-7,0.00007339256,0.0018760046],"genre_scores_gemma":[0.99383026,0.000008262549,0.006000964,0.000052075884,0.0000027670833,0.000025529847,7.014371e-7,0.000011146563,0.00006831675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855894,0.00010949891,0.00019024567,0.0004175681,0.00033576653,0.0003879714],"domain_scores_gemma":[0.9989199,0.00028730943,0.000057943376,0.0005316106,0.00006162522,0.00014158146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086940266,0.0001316943,0.00016178032,0.00021800828,0.00010541521,0.00012035776,0.000735143,0.00009155278,0.000007925347],"category_scores_gemma":[0.0002195328,0.00013088214,0.000027766306,0.0005062207,0.000094431365,0.00051743485,0.0005499722,0.0005870059,0.000018850344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007362848,0.000069820024,0.013578587,0.000008109933,0.0000042972842,0.00006769068,0.00084133993,0.0000023172768,0.0050519817,0.9298467,0.000031500793,0.05049032],"study_design_scores_gemma":[0.0011811433,0.00006678112,0.040388536,0.000019073997,0.0000010326787,0.000034787456,0.000050735573,0.0064302273,0.002365708,0.94916385,0.00012360356,0.00017449028],"about_ca_topic_score_codex":0.000019989535,"about_ca_topic_score_gemma":0.00010606516,"teacher_disagreement_score":0.050315827,"about_ca_system_score_codex":0.000029962779,"about_ca_system_score_gemma":0.000051252562,"threshold_uncertainty_score":0.53372186},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98271185,0.00009250749,0.0001282812,0.00021535865,0.0062365043,0.0005540788,0.00004683023,0.00013261253,0.009881969],"genre_scores_gemma":[0.9957934,0.000011822647,0.0025617483,0.0007614905,0.00015089667,0.0000664872,0.000015171584,0.00006561726,0.00057337974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856395,0.00008232443,0.00030220594,0.000254203,0.000268035,0.00052929803],"domain_scores_gemma":[0.99763435,0.0014187095,0.00014592904,0.0005352332,0.000078983794,0.00018677776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000610678,0.00026796342,0.0003227257,0.000080350175,0.00024714082,0.000025223731,0.00029817974,0.00019076392,0.00007188233],"category_scores_gemma":[0.0006563618,0.0002191473,0.00021289666,0.000113783084,0.00007583541,0.000071737995,0.000082202525,0.00027913327,0.000042653384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018098581,0.0003728036,0.0004635034,0.000049442413,0.00005816447,0.0000025026054,0.0009329571,0.000003902935,0.000035915902,0.98661524,0.007930371,0.0033542102],"study_design_scores_gemma":[0.0016161855,0.00037713573,0.0003998633,0.000050255316,0.00005010579,0.0000050817107,0.000042916537,0.000111668334,0.0017792506,0.9808102,0.014471534,0.00028577834],"about_ca_topic_score_codex":0.000003975522,"about_ca_topic_score_gemma":0.0000023391353,"teacher_disagreement_score":0.013081528,"about_ca_system_score_codex":0.000070134556,"about_ca_system_score_gemma":0.000027060081,"threshold_uncertainty_score":0.8936568},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954516,0.00018924201,0.0027986774,0.0007502364,0.00031901672,0.0001915332,9.34225e-7,0.00013646789,0.0001622901],"genre_scores_gemma":[0.988705,0.000013683017,0.010890479,0.0003397603,9.3418123e-7,0.000008854635,0.0000029721673,0.0000065246436,0.00003182027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988705,0.00003640057,0.00024563787,0.00039941224,0.00023616942,0.00021187826],"domain_scores_gemma":[0.9989271,0.000023765033,0.00008369018,0.0006283748,0.0001502272,0.00018683815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033087566,0.00012498042,0.00017294109,0.00014095062,0.00009346572,0.000058347265,0.00034307648,0.00006559072,0.0000014925411],"category_scores_gemma":[0.000014810201,0.00012285374,0.00003698776,0.00059190014,0.000040666102,0.00029133988,0.000072803785,0.000080342375,0.000012604374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007821062,0.00013769766,0.00036862455,0.0000047947165,0.0000054030206,0.0000015579293,0.00042080358,0.00010052157,0.028981218,0.9634227,0.00043532683,0.006113514],"study_design_scores_gemma":[0.0004439686,0.00038576403,0.0027370064,0.000022142718,0.0000073880246,0.000006113823,0.000009002314,0.008643214,0.014362696,0.97297955,0.00022769444,0.00017549307],"about_ca_topic_score_codex":0.000027219841,"about_ca_topic_score_gemma":0.0000017448539,"teacher_disagreement_score":0.014618523,"about_ca_system_score_codex":0.00000767789,"about_ca_system_score_gemma":0.000014697867,"threshold_uncertainty_score":0.50098306},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9887057,0.00015201299,0.0003089996,0.00039938235,0.0036735465,0.00011143561,7.267924e-7,0.00018076187,0.0064674644],"genre_scores_gemma":[0.9968503,0.0000043351433,0.0029067087,0.00015751163,7.3793444e-7,0.0000064806404,6.103298e-7,0.0000070209817,0.000066312125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989721,0.000049464,0.00020371485,0.00024889864,0.00032442735,0.0002013538],"domain_scores_gemma":[0.998968,0.00008089885,0.00009363021,0.0005289445,0.00017755908,0.0001509885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043688645,0.000103809965,0.00016267133,0.00014042194,0.000051127732,0.000033037097,0.0005099681,0.000054966527,0.0000013138928],"category_scores_gemma":[0.00009512741,0.00009459372,0.000056735873,0.0005305481,0.000047481284,0.0001497769,0.00015403738,0.00011118795,0.000060304832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007589283,0.00010126212,0.0006511328,0.000005151927,0.000006556891,0.000005612033,0.000381097,0.000053778764,0.0006166341,0.9947384,0.0024614583,0.00097133516],"study_design_scores_gemma":[0.0008728765,0.00035109968,0.00037791242,0.00003445693,0.000003808116,0.0000028217198,0.000010551482,0.0018145879,0.010512571,0.9851212,0.0007796088,0.00011853212],"about_ca_topic_score_codex":0.000036484253,"about_ca_topic_score_gemma":9.882799e-7,"teacher_disagreement_score":0.009895937,"about_ca_system_score_codex":0.000021905782,"about_ca_system_score_gemma":0.00007429849,"threshold_uncertainty_score":0.385742},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43823734,0.00007394253,3.6099735e-7,0.00025345903,0.0010064922,0.000054165048,8.499081e-7,0.00002735234,0.56034607],"genre_scores_gemma":[0.98518485,0.000022215432,0.000043703403,0.000053434946,0.000009671548,0.0000042110473,0.000001001685,0.000005026306,0.014675858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999322,0.000028179755,0.00010244414,0.00008337516,0.00029604652,0.00016793626],"domain_scores_gemma":[0.99951476,0.000041413026,0.000047773174,0.00010057825,0.00011114913,0.00018431958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035596828,0.00004497738,0.00010182802,0.000025860805,0.000021556343,0.000022094328,0.00017166836,0.000045849974,0.00002363689],"category_scores_gemma":[0.0003252753,0.000043972846,0.000034230354,0.00017609782,0.00014792618,0.00016129638,0.00003288643,0.00004341697,0.00005441118],"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.00000510349,0.000046288922,0.0035569568,0.0000025723298,0.0000047092394,0.0000019783874,0.004911213,2.7403536e-7,0.000014616856,0.9795051,0.0039132405,0.008037951],"study_design_scores_gemma":[0.00032489773,0.000066202214,0.0008671406,0.000008697982,0.000004328883,1.5136854e-7,0.0024848657,6.618885e-7,0.00029536476,0.20773384,0.78815216,0.00006168996],"about_ca_topic_score_codex":0.0003349279,"about_ca_topic_score_gemma":0.000063119594,"teacher_disagreement_score":0.78423893,"about_ca_system_score_codex":0.000043462853,"about_ca_system_score_gemma":0.00018417751,"threshold_uncertainty_score":0.17931606},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927462,0.00019178953,0.0027071445,0.0007283068,0.00068273436,0.0001815523,3.1559478e-7,0.00014136393,0.0026206274],"genre_scores_gemma":[0.9937309,0.000021269141,0.00581787,0.000109617526,0.0000040272735,0.000032591623,5.1292886e-7,0.000008872395,0.0002743387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989238,0.00008224708,0.00013367596,0.00030117412,0.00025246132,0.00030665818],"domain_scores_gemma":[0.9990718,0.00018036022,0.000047840764,0.00044449873,0.00009950068,0.00015600481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002443835,0.00009845513,0.00010632101,0.00009446326,0.00017835254,0.00020702904,0.000741258,0.000035742254,0.00003646471],"category_scores_gemma":[0.00010803132,0.00008722338,0.000022490614,0.0003139341,0.00007259804,0.0009265942,0.0005149849,0.000164374,0.00017350588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.118455e-7,0.000022754528,0.010331567,0.000005046732,0.000005022464,0.000007636548,0.00013637348,0.0000014197489,0.0010742071,0.9710228,0.0005818398,0.016810546],"study_design_scores_gemma":[0.00031287715,0.0000354146,0.014462948,0.000014579329,7.1608196e-7,0.000009867341,0.000018778866,0.005676518,0.0018676181,0.97715765,0.00032318354,0.000119826625],"about_ca_topic_score_codex":0.000047541347,"about_ca_topic_score_gemma":0.0000010402212,"teacher_disagreement_score":0.01669072,"about_ca_system_score_codex":0.000019020403,"about_ca_system_score_gemma":0.000019918094,"threshold_uncertainty_score":0.35568663},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9968284,0.00026304994,0.00019151754,0.00005788585,0.0010976662,0.00004647408,0.0000015663511,0.00007985507,0.0014335937],"genre_scores_gemma":[0.99969167,0.00010448745,0.00014267102,0.0000132802425,0.000010990125,0.000001999725,0.000004324707,0.000008659497,0.000021893155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957293,0.000017767434,0.00014100477,0.00006149004,0.00010419165,0.000102631035],"domain_scores_gemma":[0.99967575,0.00006821012,0.0000306204,0.00016352884,0.000035055513,0.000026828258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097429314,0.00006743004,0.00010743985,0.00002834553,0.000066851266,0.000010676072,0.00012351696,0.000035156616,0.0000063641464],"category_scores_gemma":[0.000028991057,0.000045547204,0.000051629726,0.00016527655,0.00002450938,0.00005363689,0.000008759167,0.00006286935,0.0000061044807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032221776,0.000005556048,0.0014589555,0.000011671449,0.000049084032,1.8685931e-7,0.000039742023,0.014149073,0.0006709871,0.98135585,0.0007501405,0.0015055337],"study_design_scores_gemma":[0.00036852446,0.000044196026,0.012717898,0.000009414235,0.00003950523,6.085433e-7,0.000017432936,0.26860934,0.0071358862,0.70820385,0.0026916936,0.00016164487],"about_ca_topic_score_codex":0.000014797966,"about_ca_topic_score_gemma":0.0000028078339,"teacher_disagreement_score":0.273152,"about_ca_system_score_codex":0.000010277637,"about_ca_system_score_gemma":0.0000023599607,"threshold_uncertainty_score":0.1857361},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9381857,0.0029301688,0.048448235,0.00035951342,0.0009053204,0.0007016248,0.00007983057,0.00011575017,0.008273886],"genre_scores_gemma":[0.98382926,0.000005431484,0.01563494,0.0000130852595,0.000025168649,0.00005407458,0.0000057773645,0.00001291962,0.00041931562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994123,0.00003447486,0.00018057581,0.00009246151,0.00007737617,0.00020281097],"domain_scores_gemma":[0.99950653,0.00006496097,0.000090219335,0.00022636766,0.00003657672,0.000075346616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016483267,0.000092419126,0.00016551254,0.0000111377785,0.00006443385,0.000008613373,0.00013334623,0.000020513784,0.000072180235],"category_scores_gemma":[0.000012718323,0.00007419149,0.00005186307,0.000092461596,0.000086636624,0.00019842963,0.000054148342,0.000073406576,0.000033037013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019646977,0.00013453382,0.0002833726,0.000015713284,0.000015949123,1.0123105e-8,0.000119093296,7.626351e-7,0.055659305,0.9412266,0.0002463151,0.00229639],"study_design_scores_gemma":[0.00011345942,0.000009752511,0.0000085935035,0.000012871494,0.000011723388,1.4356479e-7,0.00017156302,0.000030218522,0.16535068,0.830365,0.0038435655,0.00008245269],"about_ca_topic_score_codex":0.000015475796,"about_ca_topic_score_gemma":7.79969e-9,"teacher_disagreement_score":0.110861614,"about_ca_system_score_codex":0.000009861129,"about_ca_system_score_gemma":0.000010617901,"threshold_uncertainty_score":0.30254412},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9963943,0.000060740127,0.00022597895,0.00040512835,0.001074662,0.00019340188,9.3448654e-7,0.000091709066,0.0015531648],"genre_scores_gemma":[0.9981285,0.000015840093,0.0016050972,0.00014291902,0.0000017899935,0.00002475842,7.48673e-7,0.000013431307,0.000066953384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850506,0.00010354431,0.00017247333,0.00046990142,0.00032098553,0.00042802235],"domain_scores_gemma":[0.99857813,0.00039759133,0.00004106988,0.00077090797,0.000052190608,0.00016012357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005154433,0.00015317452,0.00016783805,0.0003087651,0.000102553924,0.00009767246,0.00079303316,0.000089651825,0.000015750375],"category_scores_gemma":[0.00019344722,0.00014817127,0.000034618068,0.00067368074,0.00016338997,0.0003049452,0.0002985898,0.00058900856,0.000069148366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000098913615,0.00008302204,0.0035776058,0.000006384174,0.0000032710075,0.000036824473,0.00017050016,0.0000065022873,0.001194553,0.9887591,0.00007094009,0.0060814195],"study_design_scores_gemma":[0.0007103462,0.00013889081,0.018308338,0.000015435126,0.0000011089145,0.000013754329,0.0000070418973,0.0027795848,0.0010028647,0.97669834,0.00015997117,0.00016433308],"about_ca_topic_score_codex":0.000017677177,"about_ca_topic_score_gemma":0.000032082276,"teacher_disagreement_score":0.014730732,"about_ca_system_score_codex":0.000018617513,"about_ca_system_score_gemma":0.00003612171,"threshold_uncertainty_score":0.60422486},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9044476,0.00019128105,0.00030415267,0.00009466619,0.0023784104,0.00018317315,0.000008949405,0.00021119083,0.092180565],"genre_scores_gemma":[0.9931025,0.0000023246216,0.0031948364,0.00011257392,0.000045351295,0.000019451112,0.000009448141,0.00003237683,0.0034811567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893576,0.00008791467,0.00025112077,0.000120629564,0.00026954175,0.00033504216],"domain_scores_gemma":[0.9988222,0.00049093255,0.00011619448,0.00034423813,0.000055937904,0.00017045594],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00070566684,0.0001546302,0.00022017793,0.0000561411,0.00017315736,0.000014054273,0.00018914821,0.00009561836,0.0011727072],"category_scores_gemma":[0.0003517359,0.00014986725,0.00009465634,0.000093990144,0.00010239981,0.00022707494,0.000048243583,0.00016624838,0.0010096176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005912812,0.00038590978,0.0003187332,0.000043737866,0.000032103973,0.0000029973664,0.0008797934,9.5910295e-8,0.00010465831,0.96222955,0.0359228,0.00007368462],"study_design_scores_gemma":[0.00041784043,0.000024338713,0.0002248208,0.000017132335,0.000035279867,0.000036883423,0.00008995075,0.0000074939926,0.0012117936,0.9696645,0.028086577,0.00018335956],"about_ca_topic_score_codex":9.499914e-7,"about_ca_topic_score_gemma":2.0419346e-7,"teacher_disagreement_score":0.08869941,"about_ca_system_score_codex":0.000079170226,"about_ca_system_score_gemma":0.000033800738,"threshold_uncertainty_score":0.9997682},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92840946,0.000267682,0.037192855,0.021673342,0.002043666,0.00033117173,0.000011475306,0.00049199094,0.009578333],"genre_scores_gemma":[0.9955154,0.000012622565,0.0025827782,0.0018327746,0.0000048689985,0.0000056428044,0.000004827945,0.0000029544083,0.000038112656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839604,0.00009540563,0.0002654237,0.0004811922,0.0003704266,0.00039152647],"domain_scores_gemma":[0.9986445,0.0003284305,0.00003880334,0.00077758165,0.000059646965,0.0001510372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025546202,0.00015117359,0.00024958426,0.00043115029,0.00007432547,0.000106493564,0.0012720822,0.00010002715,0.00003842794],"category_scores_gemma":[0.0008756578,0.00012584825,0.0000889191,0.0026962187,0.000048821286,0.00027218877,0.00019247012,0.00023830007,0.00017310647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012243406,0.0005042458,0.0006107063,0.0000014554663,0.00000660869,0.00012726961,0.000048275604,0.00001730792,0.00004810413,0.98035324,0.00077556144,0.017495004],"study_design_scores_gemma":[0.0007378386,0.0005564362,0.037399337,0.00001888413,0.000006063999,0.0000036505744,0.0000046191844,0.0029375048,0.0002099945,0.95730585,0.0006290519,0.0001907541],"about_ca_topic_score_codex":0.00004354742,"about_ca_topic_score_gemma":0.000005889394,"teacher_disagreement_score":0.067105934,"about_ca_system_score_codex":0.00004617576,"about_ca_system_score_gemma":0.000024904073,"threshold_uncertainty_score":0.51319426},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99471265,0.00025571167,0.000046235276,0.0008694464,0.002165941,0.00015907965,0.0000011158855,0.00005571115,0.0017340791],"genre_scores_gemma":[0.9983658,0.000002014065,0.0014102845,0.00012767992,0.0000011411228,0.0000040216732,3.8520574e-7,0.000007725098,0.00008093753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987267,0.000092507486,0.0002827591,0.0002638087,0.00045684614,0.00017736181],"domain_scores_gemma":[0.99838054,0.00006500678,0.00019713952,0.0009661114,0.00030478396,0.000086420936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005877124,0.00010976038,0.00018889205,0.00007278405,0.000051397816,0.000018359178,0.0008451635,0.000031356572,0.0000012594072],"category_scores_gemma":[0.0001922716,0.000076425276,0.00007000888,0.000587066,0.00010711491,0.000106601656,0.00021204301,0.00012109874,0.000012731795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044004923,0.00013394834,0.0019293688,0.000009564243,0.000010412754,8.6629825e-7,0.00054813625,0.00016890255,0.0025357099,0.99175864,0.0022290994,0.00067093543],"study_design_scores_gemma":[0.00092432206,0.00014594758,0.0004972144,0.00005919255,0.00000775178,0.0000030586707,0.00001377561,0.0011419541,0.052366465,0.9446662,0.000083072984,0.0000910532],"about_ca_topic_score_codex":0.00013263705,"about_ca_topic_score_gemma":0.0000026261885,"teacher_disagreement_score":0.049830757,"about_ca_system_score_codex":0.000018250757,"about_ca_system_score_gemma":0.00012879477,"threshold_uncertainty_score":0.31165323},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900222,0.000033249984,0.0000142985455,0.000009348561,0.0012375786,0.000120583034,0.0000044218114,0.00017479924,0.008383559],"genre_scores_gemma":[0.9997493,0.0000020217951,0.00008826183,0.0000093328945,0.00001036955,0.000013436498,0.0000015763632,0.00003146682,0.00009424387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999385,0.000021404901,0.00016608923,0.00010938567,0.00012865159,0.00018948497],"domain_scores_gemma":[0.9993924,0.00012261413,0.000034845838,0.00033593577,0.000042216925,0.00007197795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001536219,0.00012687694,0.00018706304,0.00003713031,0.000037772556,0.000012753089,0.00017515992,0.00008408547,0.00008025382],"category_scores_gemma":[0.000024634577,0.000111129666,0.0000445102,0.00019165737,0.000052141906,0.0000679645,0.00001325529,0.00019558528,0.0000274927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027931035,0.000086195665,0.007284546,0.00011926214,0.00010824621,0.0000123446525,0.00040943592,0.00043223795,0.15359119,0.83553106,0.0022263357,0.00017120548],"study_design_scores_gemma":[0.0030239522,0.000475434,0.015811197,0.00008199911,0.00008546352,0.00006216072,0.00033368618,0.0013908299,0.2600031,0.70658743,0.0112794135,0.0008653077],"about_ca_topic_score_codex":0.0000121402545,"about_ca_topic_score_gemma":0.000012202678,"teacher_disagreement_score":0.1289436,"about_ca_system_score_codex":0.000006774135,"about_ca_system_score_gemma":0.000011805792,"threshold_uncertainty_score":0.45317364},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.959057,0.00013210898,0.00005353104,0.00047312168,0.0009823334,0.0004399061,0.0000027870126,0.00022062493,0.03863863],"genre_scores_gemma":[0.9890097,0.000048406288,0.0027470344,0.0001629639,0.000031389896,0.00008318249,0.0000016336152,0.00006092655,0.007854796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891007,0.000043528533,0.0002523809,0.00023406748,0.00026975988,0.00029018216],"domain_scores_gemma":[0.9983465,0.00096840836,0.00009231719,0.00040388005,0.00006785612,0.000121015684],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001603383,0.00019205475,0.00027695706,0.00005138535,0.00009973304,0.000089507266,0.00017518969,0.00009005066,0.0005891758],"category_scores_gemma":[0.0006079383,0.00016121336,0.000053854044,0.000076210934,0.00015855435,0.00048016323,0.00011109096,0.00018448614,0.0008062858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031086156,0.00012558985,0.00009088701,0.00006548873,0.000023789114,0.000003534219,0.00027046876,1.8245528e-7,0.00013661214,0.985812,0.013344513,0.00012380756],"study_design_scores_gemma":[0.00046209438,0.000065010245,0.00020028513,0.00006432573,0.000018182447,0.0000058312244,0.00018360485,0.00004332318,0.000935257,0.9974518,0.00037693678,0.0001933899],"about_ca_topic_score_codex":0.000019414087,"about_ca_topic_score_gemma":0.0000011174204,"teacher_disagreement_score":0.030783834,"about_ca_system_score_codex":0.000041550804,"about_ca_system_score_gemma":0.000009515139,"threshold_uncertainty_score":0.9999717},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99637,0.00056507194,0.00027567483,0.00036675727,0.00005920554,0.00024063558,0.000014109191,0.000022387112,0.002086128],"genre_scores_gemma":[0.9993046,0.0000066065068,0.0003893975,0.000015715843,0.000012311719,0.0000137137795,0.000003733605,0.0000049318946,0.00024898903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995864,0.000007716493,0.00014116366,0.000092065486,0.00006515006,0.0001075012],"domain_scores_gemma":[0.99974763,0.000015892545,0.000054923596,0.00011243999,0.000030012783,0.000039083705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000039291754,0.000070822374,0.00013093515,0.000012088071,0.000062660234,0.000010560351,0.00007294022,0.000010454719,0.000051938503],"category_scores_gemma":[0.0000027851813,0.00005823865,0.00002788063,0.000053916196,0.000028411645,0.00007719937,0.000029566285,0.00004143964,0.0000088233455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031804834,0.00008743633,0.00006514669,0.000011248789,0.000009740755,5.728901e-8,0.000057477297,0.000001966172,0.006968588,0.9919255,0.00006296608,0.0008067234],"study_design_scores_gemma":[0.00028097408,0.000035536694,0.00010828226,0.000019121178,0.000010237175,1.6914596e-7,0.00010259779,0.00012894433,0.020145968,0.9783428,0.0007565351,0.000068833906],"about_ca_topic_score_codex":0.0000023780244,"about_ca_topic_score_gemma":1.5925098e-8,"teacher_disagreement_score":0.013582669,"about_ca_system_score_codex":0.0000038122607,"about_ca_system_score_gemma":0.0000064264405,"threshold_uncertainty_score":0.23749031},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99253803,0.0008686031,0.00032220443,0.0000042078773,0.0016510373,0.00016381446,0.00000561131,0.0000908479,0.004355642],"genre_scores_gemma":[0.9997804,0.0000033722608,0.000046718775,0.0000011376461,0.000006603903,0.000007773473,0.0000019607726,0.000020871674,0.00013112283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992237,0.000030550138,0.00025218123,0.00010501135,0.00023178864,0.00015676243],"domain_scores_gemma":[0.9993282,0.000044420558,0.00007779926,0.0003345674,0.00008827456,0.00012673416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016467378,0.0001324516,0.00031279723,0.00005938933,0.000011827657,0.000009709802,0.00020962254,0.0000756585,0.000004614439],"category_scores_gemma":[0.000011666103,0.00010950279,0.000035716068,0.00021424267,0.000037253347,0.00005248764,0.000020214788,0.000090012676,0.00000630811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076713004,0.00007120216,0.05126014,0.000473989,0.00023159546,0.000010398143,0.0011493999,0.004573411,0.0037192176,0.9341426,0.003727262,0.00056406733],"study_design_scores_gemma":[0.013640657,0.0027150468,0.047996465,0.0027861493,0.000356767,0.000141965,0.0027483923,0.031137109,0.057387467,0.83556086,0.0034856517,0.002043459],"about_ca_topic_score_codex":0.0001482623,"about_ca_topic_score_gemma":0.000018447461,"teacher_disagreement_score":0.09858174,"about_ca_system_score_codex":0.000022588536,"about_ca_system_score_gemma":0.000040790786,"threshold_uncertainty_score":0.44653943},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99123585,0.00007655047,0.00360083,0.00056203926,0.00032551875,0.00031951448,7.0308687e-7,0.00015390717,0.0037251008],"genre_scores_gemma":[0.9942501,0.0000071878244,0.005519508,0.00006882463,0.000003468196,0.00001872423,0.0000028043544,0.000009379648,0.0001199589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982501,0.00015903071,0.00022128201,0.00044387157,0.0004771799,0.000448494],"domain_scores_gemma":[0.99882805,0.00018344916,0.00007829345,0.0006450528,0.00014497383,0.00012016018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003132722,0.00016495408,0.00018516342,0.00045305755,0.00009846353,0.00009383343,0.0007837447,0.000060298196,0.0000041181147],"category_scores_gemma":[0.0000996096,0.00014890468,0.000040359566,0.0022316852,0.00007365224,0.00073008763,0.00010423998,0.00028099565,0.000020864663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007282758,0.00016714116,0.0019495931,0.0000024306737,0.000005326943,0.000098095625,0.00020949096,0.000056952627,0.0014217823,0.97893935,0.00009296692,0.016984018],"study_design_scores_gemma":[0.0025114124,0.000551957,0.08213682,0.000027027429,0.0000021300903,0.000025753181,0.000021465074,0.0030370222,0.0017523186,0.9096914,0.000031124942,0.00021156915],"about_ca_topic_score_codex":0.000015790385,"about_ca_topic_score_gemma":0.000012435485,"teacher_disagreement_score":0.080187224,"about_ca_system_score_codex":0.0000869302,"about_ca_system_score_gemma":0.0000780442,"threshold_uncertainty_score":0.6072157},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90241754,0.000010341452,0.08913787,0.0039022423,0.0039420305,0.0004572272,0.000026679141,0.000077680525,0.000028413404],"genre_scores_gemma":[0.99806154,0.0000045812335,0.0011671168,0.00060414465,0.000039867267,0.000046506335,0.000031708223,0.000008424251,0.000036118778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988163,0.00006163152,0.00021668726,0.00032757112,0.00033193853,0.00024583953],"domain_scores_gemma":[0.9985449,0.000055745237,0.00015691172,0.0008959103,0.00020427714,0.00014228656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003371057,0.00013505973,0.00018926644,0.00008988508,0.00018141468,0.00013471404,0.0010422958,0.00008170648,0.000012531989],"category_scores_gemma":[0.000102175596,0.000099424455,0.000046281464,0.00048839126,0.000022311235,0.00044129413,0.00046269267,0.00017941152,0.00008315233],"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.00001660641,0.00021763325,0.0067685065,0.000011338767,0.000012433557,0.0000044335643,0.00081884826,0.0000025157851,0.081709825,0.89522177,0.001167635,0.014048447],"study_design_scores_gemma":[0.0016313776,0.00068036735,0.7613425,0.00017910704,0.00002110931,0.000016896964,0.00008214665,0.012460109,0.06694089,0.08520015,0.07076232,0.00068297546],"about_ca_topic_score_codex":0.000040496165,"about_ca_topic_score_gemma":0.000022716666,"teacher_disagreement_score":0.81002164,"about_ca_system_score_codex":0.00002475627,"about_ca_system_score_gemma":0.000028355,"threshold_uncertainty_score":0.40544114},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96360934,0.00013370866,0.03407345,0.00027193586,0.00012873345,0.00031186527,0.000025460708,0.000024083241,0.0014214438],"genre_scores_gemma":[0.9933596,0.0000044240523,0.0063713524,0.000015129525,0.000018038121,0.000062572566,0.0000126741415,0.000009683721,0.00014648179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994098,0.00001689473,0.00020771241,0.00012456314,0.00007463263,0.00016638578],"domain_scores_gemma":[0.9994648,0.000112409616,0.00010031264,0.00017940326,0.00007921072,0.00006382622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000058820366,0.00008827238,0.00015988642,0.00002497731,0.00017450695,0.000023477309,0.000081395425,0.000020540747,0.00026841264],"category_scores_gemma":[0.000014323675,0.0000804668,0.000044095854,0.0001322864,0.00010706748,0.00020779797,0.000066948596,0.000055468758,0.000016551397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.4939454e-7,0.00006312786,0.0001966958,0.0000068147597,0.000018075869,3.611903e-8,0.000047363144,0.00004887952,0.009108586,0.9899034,0.000048116664,0.00055838854],"study_design_scores_gemma":[0.0002902413,0.000010212318,0.00011965945,0.000013270442,0.000020988597,3.1367233e-7,0.00010910048,0.005469304,0.002339733,0.9914336,0.000104111394,0.00008944986],"about_ca_topic_score_codex":0.0001716846,"about_ca_topic_score_gemma":2.1937674e-7,"teacher_disagreement_score":0.029750325,"about_ca_system_score_codex":0.000009359595,"about_ca_system_score_gemma":0.000023871487,"threshold_uncertainty_score":0.3281341},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93438697,0.00019286828,0.05348302,0.0002583961,0.004350237,0.0001582044,0.00000183066,0.00036251027,0.0068059475],"genre_scores_gemma":[0.98996,0.000010270695,0.0095603615,0.00019763125,0.000016324584,0.000013513102,0.000012269842,0.000007677333,0.0002219582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989761,0.00006354555,0.00020430065,0.00031526506,0.00022519327,0.00021558278],"domain_scores_gemma":[0.9991755,0.00009222096,0.000057666137,0.00039943922,0.00016898278,0.000106196465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020518588,0.00012536747,0.00012454228,0.00015508283,0.00013295125,0.00006838693,0.0005345073,0.000059462775,0.000057481127],"category_scores_gemma":[0.00007838195,0.00012455936,0.000064476364,0.000769859,0.000026244204,0.0004768621,0.00014538202,0.00010557066,0.00014499588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050042036,0.00014105855,0.0007973122,0.0000034746895,0.0000153538,0.000010520933,0.0005016072,0.000024745385,0.00041870566,0.987875,0.0013071364,0.008900098],"study_design_scores_gemma":[0.0007704902,0.00026903834,0.031780604,0.000010771731,0.0000093493245,0.000020899182,0.00002291655,0.010415411,0.025721677,0.9274332,0.0032291003,0.00031657197],"about_ca_topic_score_codex":0.00002631938,"about_ca_topic_score_gemma":0.000006238767,"teacher_disagreement_score":0.060441814,"about_ca_system_score_codex":0.000019302472,"about_ca_system_score_gemma":0.000057414847,"threshold_uncertainty_score":0.5079383},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96372974,0.00012399162,0.00022131378,0.006815087,0.00011065609,0.00022883838,0.0000016580004,0.0000668198,0.02870191],"genre_scores_gemma":[0.9967495,0.000054149532,0.001980274,0.0003640899,0.000007974006,0.0000088398465,7.6901307e-7,0.000012295036,0.00082206726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893177,0.00013567139,0.00024045618,0.00019109483,0.00027701352,0.00022399389],"domain_scores_gemma":[0.9983537,0.0010695246,0.00006752824,0.0003725587,0.000048482118,0.00008818797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008550673,0.00016762246,0.00028798202,0.00004661919,0.00016959642,0.00008399336,0.00020838004,0.00006952939,0.00021244516],"category_scores_gemma":[0.0003068298,0.000097479686,0.00009752331,0.00022311814,0.000060624392,0.00004858002,0.000022073898,0.00021267075,0.000035637753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007127567,0.0001821393,0.000057887053,0.000021880505,0.000045476703,0.0000034236782,0.00022807249,1.3366125e-7,0.000108574044,0.99642426,0.00097319926,0.0019478123],"study_design_scores_gemma":[0.0003267615,0.00014939228,0.000542625,0.000045054385,0.000094491224,0.0000034560496,0.00009861262,0.000314132,0.0021043634,0.9949003,0.0012923777,0.00012845728],"about_ca_topic_score_codex":0.0000042841966,"about_ca_topic_score_gemma":0.0000022828176,"teacher_disagreement_score":0.033019815,"about_ca_system_score_codex":0.000010585024,"about_ca_system_score_gemma":0.000012584278,"threshold_uncertainty_score":0.39751062},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9323436,0.000029184275,0.0073469346,0.0063929455,0.01725975,0.000275886,0.0000010241534,0.0003189746,0.036031686],"genre_scores_gemma":[0.99753416,0.0000014350286,0.0011128264,0.00062034954,0.000017686174,0.0000065070913,6.44131e-7,0.000005378495,0.0007010138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930674,0.000065563334,0.00009706899,0.00017937014,0.00019455675,0.0001566995],"domain_scores_gemma":[0.99877733,0.00040212902,0.00004378732,0.0006669845,0.000060029033,0.000049743885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005104345,0.00008142784,0.00006547291,0.00003095186,0.0001902926,0.0001192021,0.00089952315,0.000045480832,0.00016091892],"category_scores_gemma":[0.00020396011,0.000054172495,0.00003297708,0.0002853028,0.000039702674,0.0001553101,0.00012169453,0.00026017096,0.0007226225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020377981,0.000033999335,0.000024384335,8.8447416e-7,0.0000035903352,0.0000027794033,0.000090749236,0.0000029328276,0.00041204656,0.99450237,0.0025809016,0.0023433005],"study_design_scores_gemma":[0.00013786358,0.000058459573,0.00021224089,0.0000029048076,0.0000014295232,0.0000032983994,0.0000044772787,0.005896795,0.0027881765,0.98459506,0.00621804,0.000081253216],"about_ca_topic_score_codex":0.000003807608,"about_ca_topic_score_gemma":5.9694776e-7,"teacher_disagreement_score":0.065190546,"about_ca_system_score_codex":0.0000072763646,"about_ca_system_score_gemma":0.000033799428,"threshold_uncertainty_score":0.9288091},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9977915,0.00021914911,0.000029371464,0.00012350832,0.0009930362,0.00028798424,6.544425e-7,0.00008983942,0.0004649201],"genre_scores_gemma":[0.9992996,0.000011510836,0.0005927766,0.00006656298,6.335145e-7,0.000005517303,6.484309e-7,0.0000051780107,0.000017603752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985911,0.0000776481,0.00043359757,0.000291981,0.00039688573,0.00020875834],"domain_scores_gemma":[0.99880373,0.00005110878,0.00022650267,0.0006626836,0.00018033986,0.000075631404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003659722,0.00012848135,0.00029775608,0.0001932521,0.000059349546,0.000021971604,0.000669197,0.000052469208,0.0000020019977],"category_scores_gemma":[0.000027895176,0.00011621839,0.0000771434,0.00068783324,0.000047823698,0.00024966773,0.00010915936,0.000106493295,0.0000048834504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066593516,0.0014100334,0.0032659036,0.000010447585,0.000021542259,0.0000044712597,0.0010962771,0.00007219662,0.0030703691,0.98929876,0.00035537037,0.0013879911],"study_design_scores_gemma":[0.0015845693,0.0020310436,0.008976593,0.000031966978,0.000012038195,0.0000023387818,0.000055044384,0.00028676676,0.0032294302,0.9836489,0.0000152335615,0.00012606407],"about_ca_topic_score_codex":0.000071998074,"about_ca_topic_score_gemma":0.0000020559146,"teacher_disagreement_score":0.0057106894,"about_ca_system_score_codex":0.0000068846957,"about_ca_system_score_gemma":0.000038467882,"threshold_uncertainty_score":0.47392485},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.992211,0.000046142355,0.0003406723,0.00027395322,0.000103491046,0.0003155036,0.0000030981507,0.00008217912,0.006623961],"genre_scores_gemma":[0.9987126,0.000019200923,0.0002971981,0.000063976455,0.000007904007,0.0000766705,0.0000013614871,0.000020941816,0.00080015353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920785,0.0000980659,0.00014702919,0.00019376636,0.00014768742,0.00020559994],"domain_scores_gemma":[0.99837244,0.0010246563,0.00009537099,0.00038484362,0.000049009792,0.000073693795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003700941,0.00013599388,0.00014955385,0.00003208871,0.00040676928,0.00006085913,0.0001832327,0.00005251408,0.000011710258],"category_scores_gemma":[0.00013722059,0.00007600046,0.000031637737,0.0002016733,0.0002314214,0.00007494073,0.000048926977,0.00014705831,0.0000063497478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007275194,0.000075504126,0.0029200707,0.000011750979,0.00003312261,0.0000011014279,0.00032763323,1.5547614e-7,0.00004993827,0.99462044,0.0005567377,0.001330819],"study_design_scores_gemma":[0.00077458494,0.00014000584,0.0078222975,0.000025532812,0.000031520183,0.000010750871,0.00029963301,0.0000561835,0.00029968112,0.98441935,0.0059861164,0.00013433564],"about_ca_topic_score_codex":0.0000062655113,"about_ca_topic_score_gemma":0.000041686275,"teacher_disagreement_score":0.0102010565,"about_ca_system_score_codex":0.000008207217,"about_ca_system_score_gemma":0.000022905295,"threshold_uncertainty_score":0.31285816},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9953317,0.00083170075,0.000051171093,0.0004910696,0.0013691705,0.0001485309,3.2266658e-7,0.00014517417,0.0016311666],"genre_scores_gemma":[0.99357116,0.00004220663,0.006143895,0.000097436925,2.398342e-7,0.000009422004,9.3576347e-7,0.000008922268,0.0001258066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891496,0.000049170976,0.00030688118,0.0002974342,0.00020723481,0.0002243264],"domain_scores_gemma":[0.9990543,0.000084651605,0.000105417705,0.00046212954,0.00018117792,0.00011229198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027649346,0.0001225013,0.00018459088,0.000138138,0.00009519723,0.000067560584,0.00035307545,0.00008344053,0.000029465995],"category_scores_gemma":[0.000050545303,0.00010932473,0.00004982239,0.0005159108,0.00008430903,0.00034693247,0.00018691963,0.0001315989,0.000058095728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.4163096e-7,0.000058876547,0.0016010756,0.0000108822605,0.00002097701,0.000002657459,0.00028781313,0.000008102297,0.0076355245,0.9874631,0.0013416257,0.0015684337],"study_design_scores_gemma":[0.00061953044,0.000072046605,0.001483119,0.00003965691,0.000006591258,0.000010282823,0.000015228522,0.004085932,0.0027292755,0.9907488,0.000051454128,0.00013808573],"about_ca_topic_score_codex":0.00008221468,"about_ca_topic_score_gemma":5.1704194e-7,"teacher_disagreement_score":0.006092724,"about_ca_system_score_codex":0.0000060009916,"about_ca_system_score_gemma":0.00002139359,"threshold_uncertainty_score":0.4458133},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92429286,0.000054983982,0.0006676609,0.00007146595,0.001139262,0.00029596765,0.000013253298,0.00016152598,0.073303],"genre_scores_gemma":[0.9948727,0.0000055281816,0.004021963,0.00007539373,0.000010194588,0.000025229296,0.00000556164,0.000049771148,0.0009336471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831176,0.00007435383,0.0004395863,0.00030569604,0.0004240708,0.0004445112],"domain_scores_gemma":[0.99873036,0.00033270862,0.00020155236,0.00044336144,0.00008290717,0.00020913483],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005200437,0.00024454828,0.0003749691,0.0000700359,0.00012286718,0.00003946295,0.00032767002,0.00016156788,0.002160477],"category_scores_gemma":[0.00031799683,0.00021991073,0.00013474205,0.00011687685,0.00007528396,0.00011941203,0.00014996273,0.00029169614,0.00021317293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018818822,0.00029821065,0.0006383684,0.000058714217,0.00005378523,0.0000601158,0.0017510641,1.375091e-7,0.00017777472,0.9955236,0.00069026387,0.00072917616],"study_design_scores_gemma":[0.0006822548,0.00008871306,0.0011688905,0.000057369634,0.00003792917,0.00003119788,0.00021633321,0.002105064,0.00051196653,0.9946522,0.00016537904,0.0002826865],"about_ca_topic_score_codex":0.000040006613,"about_ca_topic_score_gemma":0.000008530403,"teacher_disagreement_score":0.07236935,"about_ca_system_score_codex":0.00007000155,"about_ca_system_score_gemma":0.000049494964,"threshold_uncertainty_score":0.9987517},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9981579,0.000027565213,0.0000052624005,0.00010965513,0.00050157384,0.00048553816,0.000028087024,0.0000069833695,0.0006774175],"genre_scores_gemma":[0.99983037,0.000004566314,0.000041480773,0.000010602671,0.000007637713,0.000018172956,0.000005078559,0.000021243217,0.000060842907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983686,0.0004016103,0.00045013864,0.000104316576,0.00043012167,0.00024520812],"domain_scores_gemma":[0.99821883,0.0005261205,0.00039279636,0.00064848975,0.00018199686,0.000031777883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001309752,0.00011422138,0.00031901806,0.000089912304,0.000038083755,0.000005914283,0.00051010813,0.00010522402,0.000029296038],"category_scores_gemma":[0.00085267087,0.000073143914,0.00007456352,0.0008057903,0.0001389881,0.000099023746,0.00021302426,0.00017181793,0.0000026539528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007035702,0.00039822093,0.099906616,0.00047113304,0.000049343165,3.4136934e-7,0.0077595483,0.0000010934209,0.14097193,0.7502264,0.00010240022,0.000042606225],"study_design_scores_gemma":[0.0018883691,0.00013371489,0.19645804,0.0006167918,0.000069288595,0.00000835035,0.0006208696,0.0004063363,0.24242361,0.5570256,0.00014604666,0.00020300063],"about_ca_topic_score_codex":0.00004387139,"about_ca_topic_score_gemma":0.0000260493,"teacher_disagreement_score":0.19320081,"about_ca_system_score_codex":0.000038194823,"about_ca_system_score_gemma":0.00009042886,"threshold_uncertainty_score":0.29827222},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25404793,0.00026124177,0.3735683,0.0010666059,0.00311796,0.0030197839,0.000055812412,0.0019374784,0.36292487],"genre_scores_gemma":[0.72173685,0.00008055867,0.27428046,0.00010132307,0.00002021685,0.00012615234,0.000019466686,0.000096508746,0.0035384437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987083,0.00008255248,0.00033401398,0.00019851756,0.00033819544,0.00033840715],"domain_scores_gemma":[0.9988524,0.00020688729,0.00008162974,0.00047051383,0.0002481091,0.00014050012],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032009007,0.00014535377,0.00018905348,0.00012659139,0.00018017522,0.000021685086,0.00039337907,0.000098085155,0.001160919],"category_scores_gemma":[0.0004646727,0.00014463229,0.00006900292,0.0003758246,0.000074929485,0.00047853915,0.000092737784,0.00026373696,0.00019412952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020028072,0.00029924384,0.00037607082,0.000073900505,0.0000406268,0.000009057886,0.0029552085,0.00004610849,0.00004521953,0.993048,0.0023069584,0.00077954703],"study_design_scores_gemma":[0.00075692375,0.00006183773,0.0002037167,0.000021628506,0.000014133953,0.000005596481,0.00019082947,0.015027393,0.0031722223,0.97922975,0.0011331614,0.00018283278],"about_ca_topic_score_codex":0.000017053968,"about_ca_topic_score_gemma":0.000005904674,"teacher_disagreement_score":0.46768892,"about_ca_system_score_codex":0.000054969296,"about_ca_system_score_gemma":0.00005694379,"threshold_uncertainty_score":0.99975216},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98355526,0.000020900165,0.00016439585,0.000026107626,0.00012182691,0.00018650014,0.000005467265,0.00005914401,0.015860379],"genre_scores_gemma":[0.99311304,0.0000043602067,0.006707937,0.000010892626,0.0000025779595,0.000027477667,0.0000015293339,0.000017426977,0.00011474135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940914,0.000038729555,0.00016473529,0.00013519291,0.00010430284,0.0001478818],"domain_scores_gemma":[0.9992933,0.000118881624,0.00010860727,0.00037945842,0.000044653556,0.00005505221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014534543,0.00009951499,0.00017156561,0.000059336875,0.000050911058,0.000004693646,0.0001988693,0.000040309453,0.00011317062],"category_scores_gemma":[0.000025597872,0.00008134871,0.00006611535,0.0002353993,0.00012888199,0.00005766701,0.000020918249,0.00008671307,0.000014148507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028078939,0.00027443923,0.0029779852,0.00002058492,0.0000490956,0.000002869642,0.0008570329,6.389473e-8,0.00047729668,0.99476105,0.00046897944,0.00008253467],"study_design_scores_gemma":[0.00045114852,0.00016994376,0.0039423993,0.000019311869,0.000045735527,0.000005523928,0.000098024444,0.0000016680264,0.022301102,0.9727702,0.00009287389,0.00010206556],"about_ca_topic_score_codex":0.00001658434,"about_ca_topic_score_gemma":0.0000042768984,"teacher_disagreement_score":0.021990834,"about_ca_system_score_codex":0.000007023883,"about_ca_system_score_gemma":0.000013205778,"threshold_uncertainty_score":0.33173043},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82478374,0.00011184426,0.000366883,0.0041205976,0.0015523297,0.00026197033,0.000015945574,0.000052006806,0.1687347],"genre_scores_gemma":[0.9976984,0.00003571864,0.000060805665,0.00079135626,0.000029553075,0.000021634314,0.000006142653,0.000016566266,0.0013397797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991924,0.000010744717,0.00031458342,0.00023778951,0.00004703858,0.00019742231],"domain_scores_gemma":[0.9992567,0.000069356145,0.00021257394,0.0003887397,0.000028489769,0.000044181226],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007884143,0.00010914298,0.00018205984,0.000078406534,0.00015070851,0.00008372619,0.00022778739,0.0000625214,0.0004525005],"category_scores_gemma":[0.000070064096,0.00008910568,0.000066975495,0.00018292408,0.000024549718,0.00008911871,0.00003157284,0.00013656057,0.00093580165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003641761,0.00005085882,0.019964648,0.0000047478125,0.000015632697,3.0125747e-7,0.00015123593,0.000098104014,0.0000036286065,0.97686857,0.0026333877,0.00020523171],"study_design_scores_gemma":[0.00029509657,0.000093964976,0.082632825,0.00000965142,0.0000036136635,5.558153e-7,0.0000066551356,0.02097452,0.00002160801,0.7803998,0.11541915,0.00014255368],"about_ca_topic_score_codex":0.0001670281,"about_ca_topic_score_gemma":0.000005895948,"teacher_disagreement_score":0.19646879,"about_ca_system_score_codex":0.00004427599,"about_ca_system_score_gemma":0.00000838569,"threshold_uncertainty_score":0.9998421},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96676266,0.00014334099,0.0009880757,0.00062703906,0.0005565693,0.00048603353,0.0000056628605,0.0000489346,0.03038167],"genre_scores_gemma":[0.9981573,0.000006267915,0.00024376977,0.00008596465,0.000007640178,0.00008765114,0.0000041533767,0.0000078293115,0.0013993889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985628,0.000096267846,0.0004163092,0.00020387539,0.00057719194,0.00014351623],"domain_scores_gemma":[0.9979271,0.0008287746,0.00018288271,0.00060246716,0.00038837577,0.00007036416],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009027636,0.00007981081,0.0001676564,0.0001300742,0.00008242327,0.00007195421,0.00054380234,0.00006968037,0.0010421062],"category_scores_gemma":[0.0004620784,0.000061163424,0.000076939796,0.0005276187,0.000086016764,0.00039035906,0.000074554446,0.00007232171,0.0023809294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047938365,0.00008084584,0.003184135,0.000003957176,0.000007959292,1.563557e-7,0.0005404362,0.000007385269,0.00082652335,0.95372486,0.011439827,0.030179141],"study_design_scores_gemma":[0.0002314176,0.000027459362,0.0072939545,0.0000037202922,0.0000034073723,6.037561e-7,0.00036635177,0.00016712939,0.0015032942,0.98056513,0.009766721,0.00007083407],"about_ca_topic_score_codex":0.000035151927,"about_ca_topic_score_gemma":0.0000029792034,"teacher_disagreement_score":0.03139466,"about_ca_system_score_codex":0.000016393391,"about_ca_system_score_gemma":0.000028466353,"threshold_uncertainty_score":0.9998711},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98554295,0.000012463538,0.0019361129,0.00064312504,0.0010913156,0.000259675,7.0528785e-7,0.00007892468,0.010434698],"genre_scores_gemma":[0.99245703,0.000011002062,0.006829184,0.00005730587,0.000009430047,0.000050729763,0.0000025877528,0.000014448403,0.0005682885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853903,0.0001350489,0.00021713118,0.00042492023,0.00035026227,0.00033362198],"domain_scores_gemma":[0.9988959,0.00029352662,0.00006990246,0.00049289357,0.00013749294,0.00011031669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081592065,0.00014518168,0.00016367805,0.00014717333,0.00010816181,0.00013599994,0.0005132897,0.00012183493,0.0000661754],"category_scores_gemma":[0.00023664646,0.00014577348,0.00003816279,0.0006608116,0.00011966858,0.001014921,0.00025111862,0.00041577526,0.00015971797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014173278,0.00009245242,0.032261577,0.0000066348143,0.0000039084625,0.000011697726,0.0004727915,8.580767e-7,0.002910117,0.9413956,0.00013342783,0.022696754],"study_design_scores_gemma":[0.0014945087,0.000026172234,0.061946753,0.000012406781,0.000002011151,0.000032728745,0.000027385262,0.0039947005,0.0034921532,0.9277228,0.0010591436,0.00018922512],"about_ca_topic_score_codex":0.000021748063,"about_ca_topic_score_gemma":0.000053720796,"teacher_disagreement_score":0.029685177,"about_ca_system_score_codex":0.000049504284,"about_ca_system_score_gemma":0.000041630756,"threshold_uncertainty_score":0.59444696},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96593446,0.00003480659,0.000023111603,0.00003068758,0.0019245251,0.00008181924,0.0000019605009,0.000092271126,0.03187638],"genre_scores_gemma":[0.9999052,0.000003024152,0.0000022389809,0.000036543806,0.000003952664,0.000010276562,8.9489845e-7,0.000011677334,0.000026159736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994871,0.00008987844,0.00013542948,0.00006945128,0.00010676922,0.00011136959],"domain_scores_gemma":[0.99935967,0.00023988595,0.000025970576,0.00032681672,0.00001917406,0.00002847798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041692806,0.00007965678,0.00012382188,0.000030278794,0.000041829353,0.000008148277,0.00017132562,0.000042366006,0.000031959396],"category_scores_gemma":[0.000050796676,0.00005689984,0.0000644377,0.00014800685,0.000046740537,0.000023503233,0.000010646282,0.00009457821,0.0000396435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004159858,0.000014887965,0.00063020195,0.000019044235,0.000018922643,1.7664858e-7,0.000085205065,0.000087807544,0.0006454582,0.9960044,0.0022594656,0.00023027092],"study_design_scores_gemma":[0.00018785594,0.00004922759,0.002741058,0.00002008825,0.0000060514294,5.249863e-7,0.000026725073,0.0005350721,0.005532926,0.9891811,0.0016439436,0.00007544621],"about_ca_topic_score_codex":0.000008203495,"about_ca_topic_score_gemma":0.000001065643,"teacher_disagreement_score":0.033970796,"about_ca_system_score_codex":0.0000067003166,"about_ca_system_score_gemma":0.0000022047018,"threshold_uncertainty_score":0.23203081},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9593129,0.000054350992,0.02655964,0.00021905721,0.005256603,0.00011079878,6.7085784e-7,0.00013366417,0.008352302],"genre_scores_gemma":[0.99947697,0.0000035879393,0.0002869812,0.000097443684,0.000012614754,0.000009547893,6.1003595e-7,0.000006967166,0.000105249346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988997,0.00017897952,0.0002553487,0.00025868198,0.00019679812,0.0002104878],"domain_scores_gemma":[0.998893,0.00023325506,0.000104786785,0.0005569972,0.00013920822,0.00007274233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006305837,0.0001065567,0.0002294218,0.000088649576,0.000082607316,0.00005511278,0.0004928458,0.00006583567,0.000014210777],"category_scores_gemma":[0.000090402624,0.000097639626,0.00009854641,0.0003697221,0.000043226308,0.00027578426,0.00011195345,0.00009892994,0.000040044233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025268228,0.000051479525,0.005137073,0.000009746468,0.00001281161,7.951446e-7,0.00020585716,0.000027888684,0.000498555,0.9906936,0.0017958643,0.0015637836],"study_design_scores_gemma":[0.0009937185,0.00042559113,0.009399215,0.000060578273,0.000007766255,0.000018424187,0.0000341028,0.06272296,0.008934873,0.9025947,0.014487329,0.0003207664],"about_ca_topic_score_codex":0.00008440366,"about_ca_topic_score_gemma":0.000013895763,"teacher_disagreement_score":0.08809894,"about_ca_system_score_codex":0.00001717804,"about_ca_system_score_gemma":0.000018268694,"threshold_uncertainty_score":0.39816284},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98243505,0.000040532952,0.00595884,0.00033786276,0.0046356134,0.00009843286,0.0000020083987,0.00038803223,0.006103644],"genre_scores_gemma":[0.9953532,0.0000067343058,0.0041221497,0.00030983382,0.000025814228,0.000009486627,0.0000013888517,0.000010487501,0.00016086274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990074,0.000051012685,0.00015109315,0.0003130551,0.0002017845,0.00027563988],"domain_scores_gemma":[0.9988586,0.00020413572,0.00006315401,0.0007043529,0.000055922228,0.00011384923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046160223,0.00013859481,0.0001388676,0.00010897202,0.0001749686,0.00011809887,0.0009257186,0.00008909133,0.00006548768],"category_scores_gemma":[0.00010019999,0.00013394645,0.00009388004,0.00045486598,0.00007897029,0.000293284,0.0002682057,0.00034378617,0.000115919174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004611126,0.00006526783,0.0028680272,0.0000036484903,0.0000106420175,0.000008687344,0.0002497419,0.0000034593932,0.0020577959,0.99131924,0.0005868391,0.0028220154],"study_design_scores_gemma":[0.00048828087,0.00008617629,0.004777846,0.000011547945,0.000004862112,0.000005246878,0.0000054722777,0.007015249,0.004791478,0.9586858,0.023884604,0.00024344397],"about_ca_topic_score_codex":0.000011603815,"about_ca_topic_score_gemma":0.0000059810895,"teacher_disagreement_score":0.032633472,"about_ca_system_score_codex":0.0000068892446,"about_ca_system_score_gemma":0.000027875936,"threshold_uncertainty_score":0.5462178},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907576,0.0006969947,0.000004117757,0.000039150458,0.004729613,0.0005717911,0.00008040298,0.00031055819,0.0028097765],"genre_scores_gemma":[0.9996703,0.000010010264,0.000020955367,0.00007490118,0.00006500614,0.000062817504,0.00003176679,0.000049725473,0.000014466708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988508,0.00018977316,0.00025297643,0.00022898283,0.00018510102,0.00029236477],"domain_scores_gemma":[0.9990234,0.0004000314,0.00005346897,0.00035778095,0.00006697932,0.000098383076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012991113,0.00027916557,0.00027160984,0.00005761174,0.000197569,0.00012565576,0.00029209864,0.00016650886,0.00015703692],"category_scores_gemma":[0.000035945122,0.00020457616,0.00004709604,0.00022803446,0.00022898892,0.00020497375,0.000058642567,0.0003112466,0.000040486175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023457074,0.00002339193,0.033237,0.000027946891,0.00024920207,0.0000057719294,0.0017327252,0.000027081182,0.0008750252,0.9582088,0.0052569136,0.0003327052],"study_design_scores_gemma":[0.0013076732,0.000060396953,0.036692824,0.000037139187,0.000039383245,0.000022610455,0.0037048194,0.00037962748,0.00080837053,0.9550217,0.0015845597,0.00034092757],"about_ca_topic_score_codex":0.0012221215,"about_ca_topic_score_gemma":0.000024647452,"teacher_disagreement_score":0.008912755,"about_ca_system_score_codex":0.000027710455,"about_ca_system_score_gemma":0.000017993312,"threshold_uncertainty_score":0.8342374},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98098516,0.00024913752,0.0061520115,0.0014464905,0.0012293631,0.00037483292,0.000001470963,0.0002487276,0.009312824],"genre_scores_gemma":[0.9908468,0.00002414505,0.0085787345,0.00020468437,0.000004501552,0.000060382394,5.4781225e-7,0.000014952921,0.00026526462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800986,0.0001485686,0.00020876912,0.00053294713,0.0005388523,0.0005610129],"domain_scores_gemma":[0.9980965,0.0005660843,0.00003673716,0.0007184025,0.00026101127,0.00032122352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037234783,0.0001782402,0.0001887944,0.00011066871,0.00020039367,0.0002711438,0.0010092919,0.000116508505,0.00013299307],"category_scores_gemma":[0.00031984583,0.00016946725,0.000050543127,0.00058250595,0.00035509755,0.0013298958,0.00064027717,0.00038173256,0.00061348634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030782444,0.000058406902,0.012584376,0.000010778253,0.000007883445,0.000022726741,0.0001104141,1.8453744e-7,0.0004890775,0.9783253,0.0009900628,0.00739771],"study_design_scores_gemma":[0.00038303286,0.00007183874,0.016927354,0.000014659707,0.0000023467146,0.000052348863,0.000029067965,0.0010364477,0.00089024875,0.980165,0.00021746824,0.00021015883],"about_ca_topic_score_codex":0.000044018394,"about_ca_topic_score_gemma":0.000001838131,"teacher_disagreement_score":0.009861645,"about_ca_system_score_codex":0.000024458799,"about_ca_system_score_gemma":0.000048458995,"threshold_uncertainty_score":0.78853303},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9912349,0.00001749811,0.0000022106688,0.000033297718,0.0030854982,0.0002292248,0.000014405869,0.000023017528,0.0053599346],"genre_scores_gemma":[0.99829876,0.0000079196825,0.0015394046,0.000017346549,0.000006381283,0.000013115082,0.000004200738,0.000015288244,0.00009755414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907875,0.00017292664,0.00032113597,0.00016653146,0.00011383664,0.00014680898],"domain_scores_gemma":[0.99882096,0.00045555452,0.00014758586,0.0004204317,0.0001092562,0.00004618506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010823822,0.00009998293,0.00024802954,0.00009421952,0.000085740816,0.000025982563,0.00041263876,0.0001309582,0.00011053168],"category_scores_gemma":[0.0010352348,0.00009233588,0.000037374546,0.00024589608,0.00012870373,0.00023099985,0.00018746518,0.00031100176,0.0000035386686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017067667,0.0000784609,0.066643834,0.000014306932,0.00001418304,0.0000012293875,0.00025819772,1.6811677e-7,0.00027596258,0.9312342,0.00032759944,0.0011347886],"study_design_scores_gemma":[0.00052863796,0.00002338933,0.12897749,0.000025230402,0.000006864499,0.000009020648,0.000029200251,0.000019370204,0.0005339198,0.8697037,0.000048666763,0.000094515875],"about_ca_topic_score_codex":0.0012121123,"about_ca_topic_score_gemma":0.0014172537,"teacher_disagreement_score":0.06233366,"about_ca_system_score_codex":0.000017489434,"about_ca_system_score_gemma":0.000053177755,"threshold_uncertainty_score":0.3765348},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.994991,0.00053485873,0.00012837801,0.00055588473,0.0023904503,0.00013543414,5.899893e-7,0.00008990126,0.0011734866],"genre_scores_gemma":[0.99794096,0.000019594752,0.0014965923,0.00047091718,0.0000010971446,0.000009123482,9.783065e-7,0.000008771093,0.000051953717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987141,0.00016572616,0.000230445,0.00019828753,0.00038672917,0.00030475023],"domain_scores_gemma":[0.9985995,0.00033251164,0.00013241066,0.0007347033,0.000094033305,0.00010683781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007595155,0.0001302885,0.00017026282,0.00021083347,0.00013600847,0.00003153966,0.0005390681,0.000052575655,0.000012223951],"category_scores_gemma":[0.00011666423,0.000082939485,0.00010644831,0.0010407225,0.00005862555,0.00018691686,0.00017532748,0.00012321296,0.00006432705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004137401,0.00013023705,0.0010061694,0.0000033507588,0.000017438031,7.3507977e-7,0.00020743479,0.000016983005,0.0026785673,0.9925347,0.0030734558,0.00032677216],"study_design_scores_gemma":[0.0005244069,0.000119530145,0.0018383019,0.000018770317,0.000011441257,0.000003723955,0.000013241784,0.0013090429,0.013914824,0.98188746,0.000227838,0.00013141755],"about_ca_topic_score_codex":0.0000322917,"about_ca_topic_score_gemma":1.8321514e-7,"teacher_disagreement_score":0.011236257,"about_ca_system_score_codex":0.000013397298,"about_ca_system_score_gemma":0.000016649805,"threshold_uncertainty_score":0.3382174},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99619704,0.00012216486,0.000027562575,0.00013035236,0.0026333139,0.000077049226,0.0000022701456,0.000080296835,0.0007299292],"genre_scores_gemma":[0.9950435,0.000016110489,0.004828844,0.00007368879,7.818453e-7,0.0000024323208,0.0000011584208,0.0000083096875,0.000025147363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988712,0.00003179394,0.00031446683,0.0002633534,0.00031827617,0.00020091562],"domain_scores_gemma":[0.9988167,0.00014456132,0.0001647757,0.00063132413,0.0001752069,0.00006738658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032822895,0.00012513531,0.000233831,0.00022204964,0.000062357896,0.000022568829,0.0005045337,0.00007415623,0.000006078116],"category_scores_gemma":[0.000093462586,0.00011211249,0.00009378535,0.00046100706,0.00013538738,0.00021882032,0.00014414777,0.00021567298,0.000014590447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040505797,0.00015282839,0.0010797251,0.000016799802,0.000012163681,0.0000019406962,0.00014632779,0.000033776792,0.094171375,0.9034606,0.00020063725,0.0007197392],"study_design_scores_gemma":[0.0005527861,0.00017836608,0.0011474087,0.000036180878,0.0000055639907,0.000003565049,0.000009289542,0.0014838099,0.07495928,0.9214965,0.000012583667,0.00011463472],"about_ca_topic_score_codex":0.000053448253,"about_ca_topic_score_gemma":0.0000010285466,"teacher_disagreement_score":0.019212091,"about_ca_system_score_codex":0.0000032674222,"about_ca_system_score_gemma":0.000041201845,"threshold_uncertainty_score":0.45718148},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9911236,0.00013582615,0.001059032,0.0007908832,0.0038276128,0.00011572154,8.454881e-7,0.000044844895,0.0029016014],"genre_scores_gemma":[0.99931246,0.000018414865,0.00057485583,0.000043714914,0.0000054108004,0.000005733379,1.0598874e-7,0.0000048738452,0.00003445606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990949,0.00012390538,0.00022877156,0.00015980197,0.00022239189,0.00017021422],"domain_scores_gemma":[0.9982039,0.0004763062,0.00018415421,0.0009923544,0.000111644295,0.000031693253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068696495,0.00009052386,0.00012642001,0.00006821506,0.00022794683,0.00004700578,0.0017936063,0.000053650638,0.0000044941958],"category_scores_gemma":[0.0001545882,0.000053422944,0.00015395033,0.00082217384,0.00033534807,0.0001276017,0.00034550385,0.00027569363,0.0000021352596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045532925,0.00003108297,0.0038931894,0.000007294738,0.000017755825,3.593728e-7,0.00038147825,9.0598775e-7,0.015298791,0.9774784,0.00046686022,0.00241935],"study_design_scores_gemma":[0.00016047002,0.000040314862,0.014264323,0.00002943054,0.000005133532,0.0000027647723,0.000091065485,0.00008654632,0.040121097,0.94160664,0.003521197,0.000071013885],"about_ca_topic_score_codex":0.000020644891,"about_ca_topic_score_gemma":0.000018016697,"teacher_disagreement_score":0.035871737,"about_ca_system_score_codex":0.0000040763375,"about_ca_system_score_gemma":0.0000515228,"threshold_uncertainty_score":0.33329967},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96854645,0.000711938,0.008109738,0.0008447943,0.008209799,0.0003563333,0.0000020917396,0.00037772654,0.012841152],"genre_scores_gemma":[0.9857643,0.000026889367,0.01356309,0.00024249038,0.00002360397,0.000019365318,0.000010570724,0.00001173835,0.0003379447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871397,0.00007300308,0.0002080912,0.00026669775,0.00023305645,0.00050516333],"domain_scores_gemma":[0.9991827,0.000029213788,0.00006689879,0.0005809815,0.000020669637,0.00011951876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005613386,0.00013930791,0.00016199522,0.0001935559,0.00007369975,0.00016846029,0.00091035245,0.000046360983,0.000022010998],"category_scores_gemma":[0.000023269804,0.00013943874,0.000046837744,0.0006749249,0.000023798822,0.0015852482,0.0004542335,0.00012132208,0.00012489466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017827784,0.00010852542,0.026306743,0.0000058347587,0.000009915331,0.000011357072,0.00041157386,0.0000022810204,0.00009953932,0.96238387,0.0034227741,0.0072358237],"study_design_scores_gemma":[0.005123483,0.00014425683,0.27596137,0.00008383617,0.000023872455,0.000012624349,0.00012928966,0.016352655,0.0029210362,0.5753757,0.12248911,0.0013828136],"about_ca_topic_score_codex":0.00006338991,"about_ca_topic_score_gemma":0.0000028470351,"teacher_disagreement_score":0.3870082,"about_ca_system_score_codex":0.000034207285,"about_ca_system_score_gemma":0.000014173904,"threshold_uncertainty_score":0.56861466},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98944956,0.00009771943,0.007892808,0.0014196147,0.0003995703,0.0004171684,0.00003158358,0.0000452315,0.00024674728],"genre_scores_gemma":[0.9827406,5.051287e-7,0.017108351,0.000044717824,0.000008819521,0.000046885183,0.000020570018,0.000007029304,0.000022519844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990139,0.00003459118,0.00030796896,0.00020606077,0.00024132588,0.00019612368],"domain_scores_gemma":[0.99879324,0.0002701528,0.000114624476,0.0005332872,0.00022621917,0.000062471074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032538772,0.000086399705,0.00014812438,0.000036593046,0.00009380644,0.000036228394,0.0006166281,0.000034723667,0.000006938982],"category_scores_gemma":[0.00016725496,0.00006660267,0.000067167646,0.00032099997,0.000085802705,0.0001890486,0.00025632905,0.00006615721,0.0000018824619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009979343,0.00006132134,0.0047130617,0.000049456394,0.000019502491,8.521822e-7,0.0018335783,0.000004299056,0.0013906773,0.98764384,0.002648789,0.001624662],"study_design_scores_gemma":[0.0017054385,0.00034735404,0.008071379,0.000041458276,0.000038869788,0.000009877132,0.0010569358,0.12104724,0.010010925,0.85543233,0.0020190484,0.00021916059],"about_ca_topic_score_codex":0.000099542725,"about_ca_topic_score_gemma":0.000012084026,"teacher_disagreement_score":0.1322115,"about_ca_system_score_codex":0.000016953232,"about_ca_system_score_gemma":0.000057866273,"threshold_uncertainty_score":0.2715978},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9760833,0.00004198295,0.000004985604,0.0001837066,0.0008345476,0.00028262174,0.0000046724385,0.00030134709,0.022262834],"genre_scores_gemma":[0.998443,0.000011842417,0.0006400509,0.00006157271,0.000012611162,0.000060886836,0.000008472084,0.000055311397,0.0007062398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786425,0.00046812146,0.00037664626,0.00035305662,0.00039917845,0.00053872593],"domain_scores_gemma":[0.9976214,0.0013125277,0.0000830124,0.0007548598,0.00008807325,0.00014010444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014460413,0.00020456144,0.000351734,0.00024321467,0.000098718025,0.000058548623,0.00044521742,0.00013848871,0.00015745497],"category_scores_gemma":[0.0015618057,0.00019976872,0.0000852325,0.0006186966,0.00012374674,0.00012882055,0.00014806761,0.0003559598,0.00020251065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032291562,0.0002553962,0.012454253,0.0000527019,0.000018871002,0.0000112096095,0.0003840989,4.5833022e-7,0.00034098417,0.98037106,0.00497202,0.0011066736],"study_design_scores_gemma":[0.0010540264,0.00009398232,0.013253658,0.000072439885,0.000008240504,0.0000027673025,0.000049480324,0.0003000744,0.00079639617,0.9800855,0.004058773,0.00022469436],"about_ca_topic_score_codex":0.000054593133,"about_ca_topic_score_gemma":0.00008889501,"teacher_disagreement_score":0.02235971,"about_ca_system_score_codex":0.000075738026,"about_ca_system_score_gemma":0.000032990854,"threshold_uncertainty_score":0.8146332},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99105644,0.00023790383,0.00063849305,0.000062682,0.0012160807,0.00038322073,0.000023614793,0.000090903966,0.006290685],"genre_scores_gemma":[0.9675639,0.000018607607,0.032262757,0.000022803286,0.000026102853,0.000029633959,0.000012097761,0.000046465284,0.000017584498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976726,0.0003237451,0.0008805043,0.00019971852,0.00050761463,0.00041579458],"domain_scores_gemma":[0.99579304,0.002243703,0.0008613449,0.00046745926,0.00045740747,0.0001770446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009191172,0.00026207065,0.000629618,0.0001561818,0.00015830935,0.00001910941,0.0003327777,0.0001139782,0.000056645196],"category_scores_gemma":[0.0021206639,0.00026578034,0.00017342747,0.00039898927,0.00026090114,0.00047390824,0.00014357951,0.00023359343,0.00001926901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038838472,0.0007168613,0.0013626165,0.00020576155,0.00009528675,0.0000028158124,0.0019260065,0.000005861563,0.024920573,0.97055894,0.000055638615,0.00011079319],"study_design_scores_gemma":[0.0005830369,0.00014447822,0.0002571957,0.0006534761,0.00012664548,0.000041759726,0.000697407,0.00005559357,0.16418484,0.83303034,0.0000150243795,0.00021023593],"about_ca_topic_score_codex":0.00012897831,"about_ca_topic_score_gemma":0.0000015264962,"teacher_disagreement_score":0.13926426,"about_ca_system_score_codex":0.00015395858,"about_ca_system_score_gemma":0.00008723829,"threshold_uncertainty_score":0.99997944},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9805949,0.00041264115,0.0012570827,0.0006715685,0.0046300623,0.00016890996,0.0000016859801,0.00023904878,0.012024124],"genre_scores_gemma":[0.9976434,0.000007832551,0.0016061567,0.00037987207,6.3581786e-7,0.000003526529,0.0000021690096,0.000012411433,0.00034400856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848294,0.000091338065,0.00030404984,0.00036955,0.0004673518,0.00028477778],"domain_scores_gemma":[0.99847424,0.00010335921,0.0001327058,0.000808393,0.00027300444,0.00020832327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005533142,0.00016958355,0.00023711685,0.00022402366,0.00004108469,0.000057671637,0.0007591607,0.00007942974,0.000010074387],"category_scores_gemma":[0.00011320368,0.0001450885,0.00009432733,0.0006878786,0.00009668657,0.00021065935,0.00020387974,0.00018639943,0.00029162943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009443548,0.00012411216,0.0008347384,0.0000074003733,0.000012398506,0.00001022921,0.00024132676,0.00004944267,0.00031833496,0.9796055,0.018325858,0.00046121716],"study_design_scores_gemma":[0.00095423835,0.00034561352,0.00020640287,0.000040134484,0.000006164172,0.0000066479743,0.000013668269,0.0016872556,0.0029949367,0.9931269,0.0004507956,0.00016722207],"about_ca_topic_score_codex":0.00006909291,"about_ca_topic_score_gemma":0.0000010782426,"teacher_disagreement_score":0.017875062,"about_ca_system_score_codex":0.000026119971,"about_ca_system_score_gemma":0.000077136145,"threshold_uncertainty_score":0.5916537},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.988171,0.000062486586,0.0060487054,0.00036985643,0.0032501314,0.000101786216,5.6338877e-7,0.000054858105,0.001940619],"genre_scores_gemma":[0.9286136,0.000017852582,0.071314685,0.000022339254,0.0000038824446,0.000005196955,1.6168921e-7,0.000003238759,0.000019037367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993642,0.0000782877,0.00014870384,0.00014267175,0.00015096705,0.0001151487],"domain_scores_gemma":[0.99901354,0.00017948155,0.00008828116,0.0005889024,0.00008675682,0.00004304088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010122797,0.000059578702,0.00007661562,0.000022446136,0.00012091584,0.000059656035,0.0006597112,0.000054245837,0.0000013126312],"category_scores_gemma":[0.00029093339,0.00004205923,0.00002145099,0.00015128538,0.00014825758,0.00021406474,0.00018922683,0.00028017745,0.0000050495505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014710113,0.000015822727,0.0012400773,0.0000030726976,0.0000025822953,2.484342e-7,0.0003089328,5.5958953e-8,0.00254833,0.95984656,0.000071161034,0.035961706],"study_design_scores_gemma":[0.0001811593,0.000050138915,0.036246426,0.000005416611,0.0000025060392,0.000006256115,0.00003521466,0.005871065,0.025578376,0.92974347,0.0022000612,0.00007991951],"about_ca_topic_score_codex":0.00002592866,"about_ca_topic_score_gemma":0.000010866824,"teacher_disagreement_score":0.065265976,"about_ca_system_score_codex":0.0000072858907,"about_ca_system_score_gemma":0.00002786599,"threshold_uncertainty_score":0.17151256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9911183,0.000020873877,0.0000077853065,0.000074825315,0.00052045233,0.00015638054,0.00000647229,0.000072398514,0.008022485],"genre_scores_gemma":[0.9985101,0.000005446315,0.0012546798,0.000019303821,0.000005269466,0.00001030218,0.0000035519251,0.00001658691,0.00017471258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992547,0.000038747232,0.00024409305,0.00015471528,0.00014893645,0.00015879763],"domain_scores_gemma":[0.99885887,0.0003338316,0.00016956385,0.00050852407,0.00006126846,0.00006794383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003117522,0.00010838058,0.00017931491,0.00009747361,0.00009393707,0.000011905183,0.0003239287,0.000102853315,0.00015345488],"category_scores_gemma":[0.00012026151,0.00009994581,0.00009166566,0.00032439313,0.00015648743,0.00007728273,0.000052879026,0.00023745948,0.000028683286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036915953,0.00021416419,0.00264364,0.00001892123,0.000021918058,8.066075e-7,0.00028917604,2.7035389e-8,0.013086868,0.9825301,0.0005161006,0.00067457376],"study_design_scores_gemma":[0.00033179234,0.000028645909,0.0027701003,0.000010980868,0.000029246145,0.000003933481,0.000093429146,0.000008806237,0.014144712,0.98165524,0.00081910583,0.00010402924],"about_ca_topic_score_codex":0.000009012728,"about_ca_topic_score_gemma":0.000015832573,"teacher_disagreement_score":0.007847773,"about_ca_system_score_codex":0.0000034063776,"about_ca_system_score_gemma":0.000019975325,"threshold_uncertainty_score":0.4075672},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9256414,0.00007440436,0.000082776125,0.0019327068,0.0066219633,0.00031320716,0.0000066853095,0.00016709835,0.065159716],"genre_scores_gemma":[0.9974315,0.0000208688,0.00032474534,0.00058309856,0.000091440874,0.000019067407,8.8631515e-7,0.000040085746,0.0014882981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986295,0.000111331705,0.0002908594,0.00024082864,0.00034189495,0.00038558972],"domain_scores_gemma":[0.99749166,0.0013920749,0.00013734808,0.0007983398,0.000094412586,0.0000861634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007203197,0.00020584307,0.00024260806,0.000023600345,0.0010007009,0.000093824805,0.00056155375,0.00013552562,0.00013866356],"category_scores_gemma":[0.0005706203,0.00013365441,0.00016859896,0.00013539816,0.00017623194,0.00007361398,0.00019982476,0.00025678924,0.00011113105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018307175,0.000029363679,0.0035438703,0.000017190117,0.000047687787,0.000002751863,0.000500707,1.2932377e-7,0.0000026936411,0.9136855,0.08104602,0.0011057964],"study_design_scores_gemma":[0.00063612714,0.000031464195,0.0014910224,0.000016546646,0.000029985133,0.00001266782,0.00002138472,0.000082168124,0.00020523503,0.855276,0.14202979,0.00016762393],"about_ca_topic_score_codex":0.000012729566,"about_ca_topic_score_gemma":0.000021664317,"teacher_disagreement_score":0.07179007,"about_ca_system_score_codex":0.000033579247,"about_ca_system_score_gemma":0.000015971395,"threshold_uncertainty_score":0.76966834},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.997067,0.0019563017,0.00018784073,0.0001369373,0.0003195915,0.00018844774,0.0000021539163,0.00007921773,0.00006251912],"genre_scores_gemma":[0.999581,0.00017547552,0.00015050816,0.000015870739,0.000012166907,0.00001726259,9.0721517e-7,0.000015430822,0.00003140117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99933714,0.00005187815,0.00024306617,0.000073485986,0.00014270475,0.00015171686],"domain_scores_gemma":[0.9994954,0.000055580153,0.00010002298,0.00025987992,0.00005984586,0.000029276704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024837875,0.00010187085,0.0002508283,0.0000245054,0.000050056708,0.00000839551,0.0001123113,0.000046043293,0.0000028265558],"category_scores_gemma":[0.00008647687,0.000054025284,0.00006706382,0.00015849192,0.00026357357,0.00018568647,0.000079115365,0.0001043515,0.0000017736575],"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.00011899937,0.0002455582,0.017809318,0.00018563466,0.00016683129,3.464083e-7,0.0010809995,0.0005951795,0.20064022,0.7780812,0.00022392003,0.00085183216],"study_design_scores_gemma":[0.0010715151,0.00006641345,0.007146423,0.00011372291,0.0001005074,0.0000025387433,0.00006355698,0.0052134707,0.80230296,0.18336782,0.00038104662,0.0001700179],"about_ca_topic_score_codex":0.000034760218,"about_ca_topic_score_gemma":0.000001053646,"teacher_disagreement_score":0.60166276,"about_ca_system_score_codex":0.000017481063,"about_ca_system_score_gemma":0.0000034493758,"threshold_uncertainty_score":0.2203087},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95781386,0.00018072121,0.00012321112,0.000042594536,0.002264079,0.00014378739,0.0000015112408,0.00060899643,0.038821224],"genre_scores_gemma":[0.99968106,0.000008748163,0.000029221286,0.00012130506,0.000015853275,0.000007997688,0.000003443928,0.000025320955,0.00010707433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991724,0.000050285616,0.00017442087,0.00015595065,0.00015400001,0.0002929365],"domain_scores_gemma":[0.9994805,0.00007174898,0.000022831868,0.00031090938,0.00001879131,0.00009525223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002083428,0.0001709687,0.00017341848,0.000089589084,0.00008857991,0.000042683627,0.00018406965,0.00008862548,0.000040391686],"category_scores_gemma":[0.000021962911,0.00017210793,0.000074299074,0.00021033648,0.00001594984,0.00009992155,0.000006865784,0.00017885471,0.00022314253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008885914,0.000043294687,0.00014495074,0.000013009835,0.00002079532,0.000019079785,0.00022239315,0.00065493165,0.0034748958,0.9890463,0.004253941,0.00209754],"study_design_scores_gemma":[0.00057905656,0.00022418534,0.0025434433,0.00008207719,0.000011402934,0.000007893588,0.00005221969,0.0009713324,0.008946311,0.98409784,0.0021636127,0.00032060093],"about_ca_topic_score_codex":0.000001720675,"about_ca_topic_score_gemma":5.276469e-7,"teacher_disagreement_score":0.04186716,"about_ca_system_score_codex":0.000045674336,"about_ca_system_score_gemma":0.000005425557,"threshold_uncertainty_score":0.70183575},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9237093,0.000039132006,0.006637001,0.0007885436,0.0003929268,0.00040481193,0.000027526286,0.000026941525,0.06797382],"genre_scores_gemma":[0.9975844,6.8777007e-7,0.0009284528,0.000022066635,0.000009339579,0.000011990594,0.0000037408943,0.0000036758415,0.0014356356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957395,0.000016507647,0.0001445596,0.00009857803,0.000079108184,0.00008728829],"domain_scores_gemma":[0.99946904,0.00006561796,0.00009585288,0.00028337073,0.00006296944,0.000023130691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004094156,0.000057598485,0.00009480788,0.0000076000892,0.0000741521,0.000009483166,0.00014771865,0.0000135709415,0.0003375841],"category_scores_gemma":[0.000013898513,0.00004177245,0.00004807555,0.00025711567,0.000040173833,0.000060480965,0.000027020753,0.000069047404,0.000014810047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001796772,0.000067930334,0.0004862482,0.0000029917212,0.000004844159,1.9243092e-8,0.00006357675,0.000008154406,0.0006396968,0.9952504,0.0004837693,0.0029905457],"study_design_scores_gemma":[0.0001611736,0.00001346258,0.0010048883,0.000009999875,0.0000060855155,1.3190876e-7,0.000088870074,0.00005432948,0.013316463,0.9832845,0.0020117406,0.000048377555],"about_ca_topic_score_codex":0.000002879586,"about_ca_topic_score_gemma":1.3208641e-7,"teacher_disagreement_score":0.073875114,"about_ca_system_score_codex":0.0000051159363,"about_ca_system_score_gemma":0.000013732517,"threshold_uncertainty_score":0.3696309},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954938,0.0007535324,0.00020529935,0.000074802774,0.0024281011,0.00012767053,0.0000036397114,0.0000678817,0.0008452307],"genre_scores_gemma":[0.99461883,0.0000037773566,0.0052963677,0.000009756531,0.0000037414327,0.0000044683807,0.0000025115605,0.000007872228,0.00005268625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866825,0.000088372595,0.00033730656,0.00024739496,0.0003369186,0.00032178048],"domain_scores_gemma":[0.99868315,0.000060466282,0.00020175173,0.0007511207,0.00018174732,0.00012176815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005966035,0.00013119572,0.00024819167,0.0000922512,0.000054630727,0.000016627251,0.00044497784,0.000042024312,0.000007654946],"category_scores_gemma":[0.000066316425,0.00012044986,0.000083896724,0.0004007841,0.00009119429,0.00037949003,0.0002615996,0.00012675267,0.000008581365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028577863,0.000420471,0.016953053,0.000028497312,0.000019917246,5.793185e-7,0.0003763572,0.000013637452,0.004150051,0.97491854,0.00036224836,0.0027538093],"study_design_scores_gemma":[0.0018753214,0.00027679803,0.027694922,0.000088585606,0.000034942303,0.000014327784,0.0000435756,0.0021330544,0.15510018,0.8122148,0.00014204359,0.00038142668],"about_ca_topic_score_codex":0.00008512143,"about_ca_topic_score_gemma":9.196693e-7,"teacher_disagreement_score":0.16270371,"about_ca_system_score_codex":0.000014689747,"about_ca_system_score_gemma":0.000059801503,"threshold_uncertainty_score":0.4911803},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98759085,0.00010050426,0.00001684868,0.00004209683,0.00035925026,0.00048109223,0.000010559367,0.0001471947,0.011251574],"genre_scores_gemma":[0.9985614,0.000011730186,0.00052956265,0.000019449852,0.0000037171544,0.00007733874,0.00000988116,0.00007035768,0.0007165833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976896,0.0003952426,0.0003873025,0.0003786681,0.00051236054,0.0006368082],"domain_scores_gemma":[0.9981864,0.0006954585,0.00019241525,0.00064111967,0.00014663558,0.00013798178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014211751,0.00026525595,0.00047234888,0.00025077115,0.00012388303,0.0000541084,0.00050052785,0.00017326316,0.0002076785],"category_scores_gemma":[0.0007665693,0.00022973161,0.000081601705,0.0008824984,0.0002948244,0.00021922686,0.00009581498,0.00034274132,0.000044653254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019579328,0.00054910657,0.05011544,0.000032606164,0.00010118232,0.00007909309,0.00202175,1.02750484e-7,0.00020931645,0.9459272,0.0007139828,0.0000544047],"study_design_scores_gemma":[0.001974366,0.00024324264,0.018552378,0.000118702854,0.00002697396,0.0000027060892,0.0003411588,0.000017045899,0.0040640705,0.9742847,0.00007380935,0.0003008395],"about_ca_topic_score_codex":0.000112350324,"about_ca_topic_score_gemma":0.00066875335,"teacher_disagreement_score":0.031563062,"about_ca_system_score_codex":0.00019125326,"about_ca_system_score_gemma":0.00009513624,"threshold_uncertainty_score":0.9368183},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8513451,0.002317561,0.12733893,0.003086849,0.00840576,0.0007111625,0.000005392214,0.00031277086,0.006476466],"genre_scores_gemma":[0.9958865,0.000018053614,0.003974407,0.00003961262,0.000005339856,0.000023706716,6.3114123e-7,0.000007977768,0.000043780896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986118,0.00026231742,0.00019523434,0.00015855538,0.00036076136,0.00041130203],"domain_scores_gemma":[0.9968576,0.0021424221,0.00005565824,0.0005943443,0.00023294947,0.000117068776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097646937,0.00008945004,0.00011892498,0.00009009657,0.00019865907,0.00005301616,0.00079137884,0.0000474465,0.000008723761],"category_scores_gemma":[0.0011111834,0.00006496523,0.00006604463,0.00058428914,0.00029913653,0.0006032946,0.00016621724,0.00015490779,0.000027981598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009335524,0.000078303914,0.0018721585,0.0000054716315,0.000009710025,7.3956613e-7,0.00021711849,2.8069664e-7,0.0017704889,0.9914446,0.0002283067,0.0043634973],"study_design_scores_gemma":[0.00029208593,0.00007124946,0.0073031047,0.0000071439704,0.0000034327716,0.000003901477,0.000030335917,0.00036590028,0.018406112,0.9728157,0.00061482674,0.00008624098],"about_ca_topic_score_codex":0.000002965693,"about_ca_topic_score_gemma":5.918647e-7,"teacher_disagreement_score":0.14454138,"about_ca_system_score_codex":0.000023284321,"about_ca_system_score_gemma":0.000022591816,"threshold_uncertainty_score":0.2649205},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9564229,0.00002363113,0.000030019815,0.00015843647,0.0006657226,0.00035955888,0.000008554891,0.00016747149,0.042163666],"genre_scores_gemma":[0.99799585,0.0000014177733,0.0008852402,0.00004040792,0.000006607796,0.0000610459,0.000005497158,0.000043303095,0.0009606323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984093,0.00021758015,0.00020646046,0.00028345338,0.00052437815,0.00035886478],"domain_scores_gemma":[0.99759936,0.001163501,0.000080942926,0.0006865769,0.00022529667,0.00024430346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008523297,0.00016857297,0.00021995477,0.00013184153,0.00007492867,0.000035909583,0.00042001394,0.00009269767,0.00006922467],"category_scores_gemma":[0.0019150212,0.00015137273,0.00007106196,0.00032518845,0.00011799988,0.00009641356,0.00012973878,0.0003186013,0.00070569676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010101922,0.00031334595,0.00056837936,0.000011304636,0.000031540414,0.000010533479,0.0007013268,0.0000018264606,0.00007796832,0.97709155,0.020840554,0.00025067007],"study_design_scores_gemma":[0.0015762926,0.0004058505,0.00029638322,0.000019934587,0.00000874901,0.0000024970407,0.00028859466,0.00014260654,0.0010059279,0.99551094,0.0005812016,0.00016101802],"about_ca_topic_score_codex":0.000009982866,"about_ca_topic_score_gemma":0.0000027480862,"teacher_disagreement_score":0.04157291,"about_ca_system_score_codex":0.00012351041,"about_ca_system_score_gemma":0.00006676126,"threshold_uncertainty_score":0.90705395},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.994688,0.00064455665,0.00009688847,0.0003393638,0.003449643,0.00008096,8.7788203e-7,0.00003923067,0.0006605213],"genre_scores_gemma":[0.9985857,0.000007636869,0.0012696018,0.000071517665,9.3516195e-7,0.0000013813135,4.6577475e-7,0.0000058949063,0.00005687288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990192,0.000102023965,0.00024568726,0.00013080327,0.0002823842,0.0002199001],"domain_scores_gemma":[0.9989943,0.00008873876,0.00015161507,0.0005761855,0.00012630285,0.00006289375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056751154,0.00008737479,0.000148372,0.000055318746,0.00006274772,0.000011918106,0.00051388267,0.00005064854,0.0000046146847],"category_scores_gemma":[0.00006711078,0.00006280928,0.000077508244,0.0005009329,0.00007100326,0.0002213169,0.00026597388,0.000103235194,0.000010202137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013595395,0.00012676058,0.011406646,0.000015197529,0.000011380631,1.6654167e-7,0.00041496393,0.00003116942,0.012401712,0.97420084,0.00054746127,0.00084233127],"study_design_scores_gemma":[0.00089514477,0.000108326836,0.0167912,0.00011622169,0.000021423015,0.000010730754,0.000040121035,0.0023177895,0.090524346,0.88874227,0.0002396267,0.00019278722],"about_ca_topic_score_codex":0.000069946334,"about_ca_topic_score_gemma":6.304851e-7,"teacher_disagreement_score":0.08545857,"about_ca_system_score_codex":0.0000115382145,"about_ca_system_score_gemma":0.00002937851,"threshold_uncertainty_score":0.25612882},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33140528,0.000011876068,0.66160154,0.0026802688,0.0012182299,0.00075109187,0.000020095335,0.0011641845,0.0011474114],"genre_scores_gemma":[0.9594212,0.0000013149076,0.038608328,0.0016523376,0.000008856052,0.00015437904,0.000027091484,0.000023474577,0.00010299028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853706,0.000035086923,0.00023161041,0.00048776556,0.000392664,0.00031579577],"domain_scores_gemma":[0.9985673,0.00006285301,0.000115001174,0.00059319567,0.00041707873,0.0002445706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040602416,0.0001839341,0.00018784778,0.0002971571,0.000094539224,0.0006108617,0.0010980151,0.000076072836,5.3573217e-7],"category_scores_gemma":[0.00031280497,0.00018836351,0.000068552516,0.0009214119,0.00003716025,0.0011360532,0.00022812012,0.000095650386,0.000020683576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021568007,0.00013062274,0.0001099043,0.00001747939,0.000011583014,0.000008588109,0.00047425003,0.0000016553155,0.0076093026,0.968302,0.0018587016,0.02145434],"study_design_scores_gemma":[0.0005288933,0.0007266212,0.00038308642,0.00006537828,0.0000070638303,0.0000065153577,0.000011768205,0.0013330703,0.013554816,0.9805751,0.0024871018,0.0003205785],"about_ca_topic_score_codex":0.0000031556067,"about_ca_topic_score_gemma":0.0000011036135,"teacher_disagreement_score":0.62801594,"about_ca_system_score_codex":0.000056945206,"about_ca_system_score_gemma":0.0001306795,"threshold_uncertainty_score":0.7681241},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95918983,0.00030018477,0.00003651223,0.0005615983,0.0020101345,0.00037187102,0.0000059797326,0.00022235257,0.037301533],"genre_scores_gemma":[0.9631816,0.00019763704,0.0052316827,0.00053402525,0.000071090246,0.00013794588,0.0000026834082,0.00011293203,0.03053041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986386,0.00009825909,0.00032852514,0.00025763328,0.00035311579,0.00032389673],"domain_scores_gemma":[0.9983622,0.00076466735,0.00014289524,0.0005457359,0.00009740895,0.00008713845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027980068,0.00024453737,0.00032162003,0.000054751396,0.00021029335,0.00008184369,0.00030713226,0.00009822044,0.000822452],"category_scores_gemma":[0.0004709345,0.00017380969,0.00007679685,0.00012771977,0.00029032413,0.00033691616,0.00018176125,0.00021724292,0.00020737278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013109625,0.0001368149,0.00011217008,0.00006172653,0.00006241095,0.000010811846,0.001283801,8.4388994e-8,0.000051884064,0.9838109,0.014440027,0.000016275666],"study_design_scores_gemma":[0.0005725582,0.000056557823,0.00025818407,0.000053376985,0.000054113374,0.000006147344,0.0002650203,0.000009950841,0.0015222017,0.99636286,0.0006163898,0.00022265209],"about_ca_topic_score_codex":0.000037581034,"about_ca_topic_score_gemma":0.0000054768802,"teacher_disagreement_score":0.013823637,"about_ca_system_score_codex":0.000041535663,"about_ca_system_score_gemma":0.00001624153,"threshold_uncertainty_score":0.9005273},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99137384,0.00030846387,0.0001933365,0.0014588133,0.004178656,0.00009754217,6.3250246e-7,0.000304267,0.0020844426],"genre_scores_gemma":[0.9854812,0.00002234843,0.013853973,0.00042755157,0.0000020677664,0.0000057160855,0.0000011259568,0.000010680245,0.00019536055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890196,0.000028837583,0.00018466564,0.0003970986,0.00020857995,0.000278875],"domain_scores_gemma":[0.9989802,0.00006763556,0.0000678462,0.00059005385,0.0001300335,0.00016422405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039542306,0.00014138174,0.00015148499,0.00009765488,0.00018996227,0.00019403268,0.0004981295,0.00008817773,0.000012046926],"category_scores_gemma":[0.00008748605,0.0001275741,0.000039158836,0.00034094692,0.000105530045,0.00031044084,0.0002698098,0.00032494316,0.00011165454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001059271,0.000051127197,0.0025158268,0.0000054376687,0.0000064942797,0.000007748505,0.00011285784,6.119094e-7,0.008987505,0.98268855,0.0026908165,0.0029319513],"study_design_scores_gemma":[0.0005868208,0.000054452154,0.0017248621,0.000010361165,0.0000062246086,0.000031530057,0.000004833387,0.0034518838,0.003893897,0.9857617,0.0042737876,0.00019966671],"about_ca_topic_score_codex":0.00003173068,"about_ca_topic_score_gemma":0.0000037886007,"teacher_disagreement_score":0.013660636,"about_ca_system_score_codex":0.0000042058477,"about_ca_system_score_gemma":0.00003573729,"threshold_uncertainty_score":0.520232},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98823047,0.00012439406,0.009676864,0.00034992234,0.00086416234,0.000072190516,0.000007370974,0.00013659932,0.00053800514],"genre_scores_gemma":[0.99886256,0.000016894626,0.00092252914,0.000098052034,0.0000025899178,0.0000035472674,0.0000104944365,0.0000067802116,0.00007655432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993246,0.000028655297,0.00015988262,0.00017404537,0.0001661049,0.0001466829],"domain_scores_gemma":[0.9993499,0.00005663027,0.000070967806,0.0003875896,0.00008167978,0.000053212447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000070864255,0.00007769665,0.00010522709,0.000055066044,0.00005522028,0.000034140507,0.00050654844,0.000041771207,0.000013445558],"category_scores_gemma":[0.000041299343,0.00007459585,0.00003203725,0.00037710683,0.000021180344,0.00020965796,0.00009552961,0.00007148631,0.000036594163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015169414,0.00010564604,0.0008603258,0.000005332691,0.000008798827,0.0000051230695,0.00032282932,0.00002302906,0.0033933285,0.99382514,0.0007488531,0.0007000632],"study_design_scores_gemma":[0.0010325371,0.00019384282,0.012290119,0.000036788526,0.0000073868914,0.000008918128,0.0000644301,0.0007300191,0.014941573,0.9696837,0.00082579104,0.00018488741],"about_ca_topic_score_codex":0.000093879105,"about_ca_topic_score_gemma":0.0000010314992,"teacher_disagreement_score":0.024141448,"about_ca_system_score_codex":0.0000308491,"about_ca_system_score_gemma":0.00006103991,"threshold_uncertainty_score":0.30419308},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94034386,0.0002907671,0.014028833,0.006024144,0.0021588458,0.00074681005,0.000007396643,0.0002629873,0.036136374],"genre_scores_gemma":[0.99868935,0.00001787834,0.00095330895,0.00018420418,0.000002775504,0.000016327223,2.358455e-7,0.000008081623,0.00012785586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998515,0.00024179049,0.00019050007,0.0002775328,0.00049128244,0.0002839139],"domain_scores_gemma":[0.997905,0.0006415321,0.00009179742,0.0011752639,0.00011326767,0.00007310353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005865883,0.000115926705,0.00014939418,0.00009879111,0.00014425413,0.00003815092,0.0014596235,0.00004642786,0.00006398516],"category_scores_gemma":[0.00025401937,0.000081480415,0.0000926801,0.00078138435,0.00018769848,0.00018019218,0.0002604706,0.00024232082,0.0001086745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006062723,0.00010920159,0.0004727147,0.000004408725,0.000008750725,0.000005201575,0.00028091102,0.0000057278517,0.00026644324,0.9879168,0.0007519952,0.010171762],"study_design_scores_gemma":[0.0003017762,0.00016599368,0.002529854,0.000013616807,0.0000018903477,0.000001966483,0.0000065368376,0.0035563186,0.006395453,0.9863009,0.0006287816,0.00009693437],"about_ca_topic_score_codex":0.000019094397,"about_ca_topic_score_gemma":0.0000037186373,"teacher_disagreement_score":0.05834549,"about_ca_system_score_codex":0.000025758334,"about_ca_system_score_gemma":0.000014515483,"threshold_uncertainty_score":0.3322675},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20302407,0.041271374,0.04198789,0.0029391514,0.5611777,0.018486226,0.00059036893,0.005429007,0.12509422],"genre_scores_gemma":[0.8042531,0.0048779114,0.065564595,0.0016544297,0.00032762674,0.0008473633,0.0010499007,0.0015535932,0.11987149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99091583,0.0006582337,0.0015897375,0.0025447723,0.002396513,0.0018948861],"domain_scores_gemma":[0.99236006,0.00061148853,0.0010466026,0.003517882,0.0014326978,0.0010312813],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0027599335,0.0012739905,0.0016943696,0.0039367955,0.00063770014,0.000447514,0.0042056125,0.0015369755,0.000028741162],"category_scores_gemma":[0.0007914966,0.0014062107,0.00052230695,0.0075967815,0.0007371062,0.0011561628,0.0018634549,0.0026902158,0.000037254486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006927586,0.0003231788,0.0007910223,0.00030028928,0.00021286093,0.00007643026,0.0007514678,0.000012581331,0.00088705414,0.7860157,0.20766863,0.0028915168],"study_design_scores_gemma":[0.0019752483,0.00080781104,0.0030161329,0.00086329936,0.000085117965,0.00005178339,0.00011700998,0.00058231043,0.0023087645,0.97145087,0.017182717,0.0015589662],"about_ca_topic_score_codex":0.0001402134,"about_ca_topic_score_gemma":0.00004399785,"teacher_disagreement_score":0.601229,"about_ca_system_score_codex":0.00021010484,"about_ca_system_score_gemma":0.00053708337,"threshold_uncertainty_score":0.99975926},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99541056,0.00027520407,0.0000019917945,0.0005303564,0.0014991169,0.0001745544,7.8102636e-7,0.00026569612,0.0018417157],"genre_scores_gemma":[0.9927805,0.000023543733,0.005711155,0.0013565576,1.8738762e-9,0.000017352995,0.0000012917402,0.00001551198,0.00009409776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845374,0.00015288002,0.00025130276,0.0005022062,0.0002492783,0.00039057806],"domain_scores_gemma":[0.9988187,0.00026878723,0.000071702765,0.0005286716,0.00006669451,0.00024547757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056801643,0.00018814557,0.00021012693,0.00022594561,0.00023376744,0.00014058338,0.00033255198,0.000105954656,0.000004158859],"category_scores_gemma":[0.00022544195,0.00018011444,0.000052231222,0.0007306343,0.00004786469,0.00026522815,0.00009162893,0.00022151614,0.00011458914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004966774,0.00005884595,0.00052944635,0.0000043743,0.000017796296,0.000015065047,0.00034986009,0.00015290454,0.0002077387,0.99619865,0.001909289,0.00055107375],"study_design_scores_gemma":[0.00073262386,0.00036960482,0.00031534032,0.00005198492,0.0000068393874,0.000015006267,0.000018472609,0.0009087817,0.0016291912,0.9956816,0.000035813126,0.00023476794],"about_ca_topic_score_codex":0.000026899877,"about_ca_topic_score_gemma":8.38515e-7,"teacher_disagreement_score":0.0057091634,"about_ca_system_score_codex":0.000029130335,"about_ca_system_score_gemma":0.000049962233,"threshold_uncertainty_score":0.7344854},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99576277,0.0005600577,0.00029338207,0.0008384409,0.0016575207,0.00013931007,0.000004020186,0.0002362563,0.00050826964],"genre_scores_gemma":[0.98919076,0.00006743836,0.010272853,0.00040114997,8.9536167e-7,0.0000058229284,0.000005416313,0.000014539806,0.000041118943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998476,0.000053440177,0.00030032342,0.0004156913,0.00041850464,0.00033600137],"domain_scores_gemma":[0.9987369,0.00004656925,0.00024019023,0.0006937173,0.00015299328,0.00012960362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029708014,0.00019379226,0.00031654898,0.00019721895,0.000118431526,0.00007405022,0.00072654674,0.00008518513,0.0000070603915],"category_scores_gemma":[0.000031334643,0.00017727065,0.00012175834,0.0005439384,0.000098355966,0.0002776787,0.00018618557,0.00014965559,0.000045848326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006692243,0.00013482771,0.0035164016,0.000021060134,0.000027642043,0.0000319214,0.00030869234,0.00014935355,0.0055391816,0.98950124,0.0006139096,0.00014907707],"study_design_scores_gemma":[0.0021178417,0.000099885445,0.0021075485,0.00008830653,0.000012968718,0.000022329114,0.000022725206,0.00033760784,0.02109038,0.97371906,0.00015087305,0.00023044753],"about_ca_topic_score_codex":0.0001795026,"about_ca_topic_score_gemma":0.000003909794,"teacher_disagreement_score":0.015782155,"about_ca_system_score_codex":0.000020999372,"about_ca_system_score_gemma":0.000058457623,"threshold_uncertainty_score":0.7228887},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99260557,0.0001330456,0.0034380846,0.00013738814,0.0008279319,0.0001462404,0.0000016824498,0.00008266703,0.0026273984],"genre_scores_gemma":[0.9927223,0.000015165632,0.007140499,0.000021743272,0.0000059398612,0.0000057505226,0.0000024397907,0.000007783885,0.00007843393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861294,0.00009581531,0.0003910222,0.00036401808,0.00028748685,0.00024869243],"domain_scores_gemma":[0.998494,0.00008698824,0.00019981826,0.0009897865,0.0001122195,0.000117175194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033127735,0.00013552234,0.00028217674,0.00009013166,0.000053072723,0.000020589445,0.00088019244,0.000065223685,0.000029740542],"category_scores_gemma":[0.000044525717,0.00012787807,0.000082878396,0.00045993426,0.00009831727,0.0005776361,0.00022764111,0.00011518189,0.000011514843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024894554,0.0006995223,0.009152514,0.000025546651,0.0000134133725,0.000010075639,0.00041993367,0.00020554033,0.003502826,0.976971,0.00008637514,0.008888394],"study_design_scores_gemma":[0.0007913721,0.0004819141,0.023492917,0.000020991054,0.000006266244,0.000018037434,0.000099478966,0.0026319167,0.015681343,0.9558511,0.00072699826,0.00019767409],"about_ca_topic_score_codex":0.00005221373,"about_ca_topic_score_gemma":0.0000038515636,"teacher_disagreement_score":0.021119874,"about_ca_system_score_codex":0.00003585401,"about_ca_system_score_gemma":0.000058120953,"threshold_uncertainty_score":0.5214716},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98909235,0.00019203592,0.00016588741,0.00040746745,0.0023686956,0.000112957,5.9291057e-7,0.0001408432,0.00751918],"genre_scores_gemma":[0.99895865,0.000014511441,0.00066131924,0.0002260911,9.331544e-7,0.0000107896285,5.8127875e-7,0.000009452146,0.000117694864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867594,0.00007245405,0.0002515444,0.00028622118,0.00036944597,0.00034439846],"domain_scores_gemma":[0.9984755,0.0005025947,0.00012639133,0.00069056044,0.00013289679,0.00007204013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005949351,0.00012966522,0.00017667635,0.00008941641,0.00045964026,0.00005008833,0.00088509347,0.00004816498,0.0000076095585],"category_scores_gemma":[0.00039530697,0.00009398024,0.000084966785,0.00062562875,0.00010941722,0.000177726,0.00030324384,0.00019141297,0.000032459404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030828655,0.0000777153,0.0012215525,0.0000063086864,0.000012230024,0.000009893458,0.0004631936,0.00004549255,0.0007317662,0.99283737,0.0043409965,0.00025037187],"study_design_scores_gemma":[0.0003473466,0.00012677528,0.0011898035,0.00006051528,0.0000042470633,0.000008675464,0.000015610998,0.0021521142,0.0055412864,0.9902738,0.00015519411,0.00012465555],"about_ca_topic_score_codex":0.00007122357,"about_ca_topic_score_gemma":8.855218e-7,"teacher_disagreement_score":0.009866286,"about_ca_system_score_codex":0.000019068766,"about_ca_system_score_gemma":0.000050420735,"threshold_uncertainty_score":0.3832403},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9818617,0.000095304014,0.0018763022,0.00037225024,0.00085932,0.00019054636,0.0000010379757,0.00010510577,0.01463845],"genre_scores_gemma":[0.9973165,0.000009933622,0.0016778266,0.00017049452,0.000010226731,0.000019933139,0.0000077273035,0.000004062366,0.0007833294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991684,0.00006268762,0.00015164874,0.000257674,0.00019175024,0.00016782942],"domain_scores_gemma":[0.9996164,0.000068218535,0.000026834132,0.00020662889,0.00003882834,0.000043112104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018194983,0.000085875574,0.00009671707,0.000120618395,0.00006102268,0.000066351924,0.00030677984,0.00004404406,0.00007167401],"category_scores_gemma":[0.00001664541,0.0000883291,0.000025422109,0.0006682253,0.000013688333,0.00034513028,0.000038264126,0.000096281954,0.00018131359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001759338,0.00017563388,0.0018279295,0.00000513297,0.0000074936215,0.000025425803,0.0010076965,0.0014513916,0.00010969181,0.91673714,0.0014349326,0.07719994],"study_design_scores_gemma":[0.0016911046,0.00031036648,0.06168868,0.000026874775,0.0000035560745,0.00003571146,0.000029373256,0.06301341,0.0022415498,0.85157466,0.01895504,0.00042964765],"about_ca_topic_score_codex":0.000048417132,"about_ca_topic_score_gemma":0.000011609646,"teacher_disagreement_score":0.0767703,"about_ca_system_score_codex":0.00005061335,"about_ca_system_score_gemma":0.00007734791,"threshold_uncertainty_score":0.3601956},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93357444,0.00077785173,0.03838743,0.0020103187,0.0026131552,0.0015097763,0.0000155143,0.0010266209,0.020084906],"genre_scores_gemma":[0.9843309,0.000042985324,0.013865686,0.0002321507,0.000004932756,0.00009686552,0.0000030880049,0.000015771378,0.0014076394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988297,0.000058717702,0.00014283226,0.00034525685,0.0002255091,0.00039794156],"domain_scores_gemma":[0.9987691,0.0002888115,0.00002540527,0.0006808489,0.0000964236,0.0001393909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028606132,0.00011101269,0.00013099302,0.000107402404,0.0002480091,0.00006796482,0.00084989244,0.000047982685,0.000075846714],"category_scores_gemma":[0.00004920897,0.00010668416,0.00009872275,0.00063466735,0.00008406512,0.00033694095,0.00009867743,0.000117479685,0.00015525376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013481471,0.00006686336,0.00014138543,0.0000033089682,0.000010985578,0.0000042660495,0.00007742498,0.0000143874895,0.00026047035,0.97434694,0.0021609997,0.022899516],"study_design_scores_gemma":[0.00064030755,0.00014217613,0.000335702,0.0000069191833,0.0000026234375,0.000004866746,0.0000052733617,0.001969877,0.0013025877,0.9675924,0.027859498,0.00013775876],"about_ca_topic_score_codex":0.0000036667725,"about_ca_topic_score_gemma":8.758205e-7,"teacher_disagreement_score":0.05075645,"about_ca_system_score_codex":0.00001876356,"about_ca_system_score_gemma":0.00003411181,"threshold_uncertainty_score":0.4350454},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946854,0.00017967113,0.00011947798,0.0011928319,0.0014932249,0.00015490707,0.00000108285,0.0000395717,0.0021338058],"genre_scores_gemma":[0.9994155,0.000020061561,0.00015748541,0.0002950444,5.683737e-7,0.000008792895,2.1677226e-7,0.00000601964,0.000096319905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988476,0.00012525657,0.0002563288,0.00020559522,0.00037978851,0.00018541802],"domain_scores_gemma":[0.9983351,0.0002657766,0.00017870606,0.0010373025,0.00014460021,0.000038490427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043890308,0.000109525,0.00015731166,0.00008131444,0.0001404129,0.000022478527,0.0011935153,0.000048477472,0.000008667025],"category_scores_gemma":[0.00008223002,0.000059413615,0.00014888257,0.0012249588,0.00016585259,0.00007727804,0.00019629969,0.00013367625,0.0000068642944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055849873,0.00013783874,0.0013839816,0.000007025644,0.000015906531,0.0000011373814,0.00037092817,0.000048621758,0.00091210945,0.99557954,0.0013105653,0.00022677118],"study_design_scores_gemma":[0.00034255988,0.00009733918,0.0017852567,0.00007172026,0.0000069819716,0.0000038048859,0.00003301323,0.0003023935,0.0101829255,0.98696065,0.00013876012,0.00007460557],"about_ca_topic_score_codex":0.00007350837,"about_ca_topic_score_gemma":0.00000391636,"teacher_disagreement_score":0.009270816,"about_ca_system_score_codex":0.000005715138,"about_ca_system_score_gemma":0.00003442473,"threshold_uncertainty_score":0.24228169},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9962408,0.00023979065,0.000016951168,0.00012487498,0.000640564,0.000081166,7.326719e-7,0.00004958208,0.0026055307],"genre_scores_gemma":[0.9991991,0.00004932322,0.00058626855,0.000021406162,1.4746843e-7,0.0000026551256,5.1674823e-7,0.000004897962,0.00013569384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902916,0.00006404795,0.00030753316,0.00014981156,0.0002775656,0.00017191134],"domain_scores_gemma":[0.99892944,0.00022779385,0.0001255021,0.0005844479,0.00007943995,0.00005338539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029309446,0.00009075817,0.00016041758,0.00004936514,0.000114259194,0.00002535045,0.0006719081,0.000038840783,0.00001983064],"category_scores_gemma":[0.000030672476,0.00005996035,0.00009330053,0.0005035031,0.00014068802,0.00011377543,0.00005410535,0.00007066582,0.00001327237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028071424,0.000059147693,0.0029346438,0.0000099697945,0.00002068816,5.2469085e-7,0.00048196694,0.000019336176,0.00035589092,0.9933111,0.0006207601,0.0021831589],"study_design_scores_gemma":[0.00032751917,0.00007450134,0.0031117392,0.000025819925,0.0000065706663,0.0000012352474,0.00003227829,0.0004698663,0.0059155426,0.9897201,0.00024021919,0.000074605974],"about_ca_topic_score_codex":0.00010921413,"about_ca_topic_score_gemma":0.000002370834,"teacher_disagreement_score":0.0055596516,"about_ca_system_score_codex":0.0000054391858,"about_ca_system_score_gemma":0.000029251923,"threshold_uncertainty_score":0.24451122},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8686575,0.001039605,0.028838368,0.00014230068,0.010746623,0.0027071333,0.0000378219,0.0012372088,0.08659341],"genre_scores_gemma":[0.986907,0.000011102475,0.0028620274,0.000032663374,0.000021187887,0.00008420074,0.000019754745,0.000095627634,0.009966425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747133,0.0002668144,0.0006059734,0.00049464795,0.00059499405,0.00056621013],"domain_scores_gemma":[0.9979477,0.0003720308,0.0002963402,0.00078086567,0.00034368038,0.00025941277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004350857,0.00038822752,0.00060681615,0.0001334528,0.0002499282,0.00011956014,0.00026868025,0.00018857839,0.00015388336],"category_scores_gemma":[0.00048110544,0.00029786813,0.00009903538,0.00070497097,0.00009975766,0.0002282599,0.000040216488,0.00027006623,0.00015480169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042075782,0.00032026277,0.0006385415,0.00007345073,0.00008436396,0.000020958129,0.000079549085,0.00007333215,0.0002729605,0.9947634,0.0035378316,0.000093325114],"study_design_scores_gemma":[0.0037914533,0.00065017695,0.00014685917,0.00018159888,0.00014091507,0.000098805,0.00031835094,0.0032047387,0.00032157518,0.961447,0.028845519,0.0008530343],"about_ca_topic_score_codex":0.00005734963,"about_ca_topic_score_gemma":0.000014387882,"teacher_disagreement_score":0.11824948,"about_ca_system_score_codex":0.00016852764,"about_ca_system_score_gemma":0.00012366,"threshold_uncertainty_score":0.99994737},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8398425,0.00006829435,0.15637928,0.0005664814,0.002330408,0.00018818093,0.0000026346647,0.000035205,0.00058698555],"genre_scores_gemma":[0.9920477,0.0000016619288,0.0076064365,0.0001306075,0.00002827624,0.000014088169,0.0000032491712,0.0000057009383,0.00016222708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992877,0.000029076204,0.00016221925,0.00019598118,0.0001862828,0.00013871165],"domain_scores_gemma":[0.99868655,0.0001804406,0.00014554353,0.0006987619,0.00024563426,0.00004307737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035748235,0.0000783078,0.000099065255,0.000023333807,0.0010548326,0.0008720093,0.0009048612,0.000038687365,0.000006959585],"category_scores_gemma":[0.00010905861,0.00006134896,0.00005662398,0.00008327571,0.0001341413,0.0006127617,0.00010923402,0.000052170068,0.0000085522315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001135234,0.00008002591,0.0038562582,0.000009611008,0.000019017014,7.569764e-7,0.00038792743,0.0004868425,0.0009582535,0.9744137,0.00050841173,0.019267851],"study_design_scores_gemma":[0.0009703117,0.00011419396,0.06484051,0.000021683114,0.000014466731,0.000009885794,0.000022965818,0.2679553,0.007973377,0.65065074,0.0072522974,0.00017428746],"about_ca_topic_score_codex":0.00003974921,"about_ca_topic_score_gemma":0.000006637617,"teacher_disagreement_score":0.32376295,"about_ca_system_score_codex":0.000016418966,"about_ca_system_score_gemma":0.00012560323,"threshold_uncertainty_score":0.8408806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60185343,0.000049997492,0.38718173,0.0026785717,0.005292348,0.00085082924,0.000021383203,0.0005745847,0.0014971149],"genre_scores_gemma":[0.99549294,0.0000037759492,0.0039374,0.00024290147,0.000033214837,0.00009274694,0.0000051155803,0.000021197882,0.00017071882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980585,0.000083303705,0.00031020952,0.00069840706,0.00034235689,0.00050721207],"domain_scores_gemma":[0.99748033,0.0010171258,0.00012900507,0.0010098474,0.00020183918,0.00016187114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045062383,0.00023414334,0.0002628788,0.000119671946,0.00018245493,0.000125025,0.0010932578,0.00011649247,0.000027140648],"category_scores_gemma":[0.00022814747,0.00017814733,0.00014632473,0.0002709298,0.000082912185,0.00044412533,0.00032002787,0.000102884056,0.0001825289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012988606,0.0001712636,0.0017644555,0.00001219975,0.00001661704,0.000008036171,0.000050553106,0.000008150078,0.00043388116,0.9318912,0.0029238453,0.062706806],"study_design_scores_gemma":[0.0016808969,0.00045019982,0.042797413,0.000038109527,0.000007175991,0.000011688771,0.0000025989214,0.0029425826,0.0036107625,0.9473378,0.00081473374,0.00030604505],"about_ca_topic_score_codex":0.000015869009,"about_ca_topic_score_gemma":0.000009496101,"teacher_disagreement_score":0.39363948,"about_ca_system_score_codex":0.00022744719,"about_ca_system_score_gemma":0.000074241485,"threshold_uncertainty_score":0.7264637},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9922561,0.00007386261,0.0020312131,0.0007447162,0.0014723198,0.00010620725,0.0000010742158,0.00019693538,0.003117567],"genre_scores_gemma":[0.9946933,0.000008910305,0.00496197,0.00009427399,3.657392e-7,0.0000080474165,2.70185e-7,0.000008185795,0.00022468693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988944,0.000066580295,0.00028137126,0.0002546335,0.00027759068,0.00022543136],"domain_scores_gemma":[0.99882364,0.00018238045,0.00012627021,0.0006432697,0.00013184696,0.00009260888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029677633,0.000113184804,0.0001860906,0.00008004497,0.000057769666,0.000023850032,0.00058261084,0.000054684333,0.000043571614],"category_scores_gemma":[0.000068723435,0.000075005606,0.00008405126,0.00043598522,0.0000842626,0.00024609175,0.0001457324,0.000042281034,0.00022314377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002228543,0.00007428325,0.0033876,0.000009672078,0.000014244944,0.0000031171073,0.00008566104,2.7830734e-7,0.009119142,0.9835303,0.0015447063,0.0022288035],"study_design_scores_gemma":[0.0008277891,0.000055989705,0.0008131131,0.00006536044,0.000005190102,0.0000071865984,0.0000031514621,0.00010985472,0.013243936,0.9846459,0.00010065612,0.000121871795],"about_ca_topic_score_codex":0.00001597,"about_ca_topic_score_gemma":3.8886836e-7,"teacher_disagreement_score":0.004124794,"about_ca_system_score_codex":0.000011151573,"about_ca_system_score_gemma":0.00003576726,"threshold_uncertainty_score":0.30586398},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98081344,0.00010865078,0.011719457,0.0026285334,0.00075416453,0.00047261582,0.000005080715,0.00021732609,0.0032807323],"genre_scores_gemma":[0.9954618,0.000020817124,0.0034093382,0.00006430281,0.000005496358,0.00007070682,0.000001217822,0.000025856934,0.00094041455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975945,0.00024081134,0.00027036926,0.0006265196,0.0006501753,0.00061763835],"domain_scores_gemma":[0.99760026,0.00051156495,0.00011689007,0.0014157809,0.00018022103,0.0001752635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070055784,0.00022516314,0.00024170252,0.00036652436,0.00016004016,0.000060962364,0.0017866701,0.00009659213,0.000021993104],"category_scores_gemma":[0.00025254648,0.00015848625,0.00006818801,0.00108435,0.00024926683,0.0009119924,0.0007388132,0.00017527139,0.00010872731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012672352,0.00010841844,0.024161302,0.000009873545,0.000015013908,0.00009778006,0.0001789489,0.0000029198893,0.002260696,0.95213664,0.0009057772,0.01999594],"study_design_scores_gemma":[0.004052368,0.0003454442,0.02809853,0.000092857204,0.0000032451878,0.000032972122,0.000018064626,0.00036397492,0.0040114666,0.96212095,0.0005603182,0.00029978246],"about_ca_topic_score_codex":0.00001287179,"about_ca_topic_score_gemma":0.00014664624,"teacher_disagreement_score":0.019696157,"about_ca_system_score_codex":0.00025057112,"about_ca_system_score_gemma":0.0000814566,"threshold_uncertainty_score":0.64628816},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9685256,0.000050887782,0.0063440744,0.005513884,0.0012949615,0.0003640379,0.000012122351,0.00017432348,0.017720144],"genre_scores_gemma":[0.9983161,0.000013852224,0.0007716726,0.00021112637,0.000002699548,0.00001710673,3.2376224e-7,0.00001215379,0.00065494416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850875,0.00019579886,0.00018088055,0.00030408966,0.00047434578,0.00033615206],"domain_scores_gemma":[0.9973045,0.0012975256,0.00008851403,0.0011282947,0.0000957608,0.00008543421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006386907,0.0001281999,0.00015074264,0.000081459235,0.00012211512,0.000029457502,0.0015424744,0.00004927649,0.0000846493],"category_scores_gemma":[0.0002611405,0.00006814489,0.000086516484,0.00052972336,0.00023550239,0.00025164362,0.00019520507,0.00014569318,0.00026370777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015815824,0.00005746869,0.0012786274,0.0000031711788,0.00001562954,0.0000092020255,0.00011508091,2.1719866e-7,0.0014577388,0.9913353,0.0036012551,0.0021105232],"study_design_scores_gemma":[0.00044559943,0.00008960576,0.0010610129,0.000033451637,0.0000014366416,0.0000053421377,0.000009928617,0.0000205848,0.0076381513,0.9891592,0.0014323951,0.00010328693],"about_ca_topic_score_codex":0.0000050327185,"about_ca_topic_score_gemma":6.9757306e-7,"teacher_disagreement_score":0.029790556,"about_ca_system_score_codex":0.00002752655,"about_ca_system_score_gemma":0.00003961278,"threshold_uncertainty_score":0.33895177},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9895366,0.00004571583,0.00019234783,0.0009691453,0.0001513455,0.00022436667,0.0000064856195,0.00004995167,0.008824041],"genre_scores_gemma":[0.99847746,0.000024167211,0.00012746542,0.000018633104,0.0000056392823,0.000054708275,5.140782e-7,0.000018361618,0.0012730666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921095,0.00006069246,0.00022267112,0.00015177649,0.0001650314,0.00018889112],"domain_scores_gemma":[0.99782956,0.0012840187,0.00015464368,0.00059420103,0.000082146165,0.00005544521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002776158,0.00012086423,0.00016380995,0.00003278954,0.0001912154,0.00001623127,0.00033809728,0.00006536217,0.000041161533],"category_scores_gemma":[0.0001416761,0.000059949056,0.00006209891,0.00016893259,0.00023113846,0.000051458937,0.000045296765,0.000093140676,0.000017011189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033697008,0.00009973724,0.0058645117,0.00000636179,0.000048946767,9.0620966e-7,0.00013554604,2.1059296e-7,0.0013340292,0.9899496,0.0016214274,0.0009050669],"study_design_scores_gemma":[0.00061791297,0.00008950383,0.0054811006,0.000046908808,0.000029159275,0.0000028752388,0.00019261584,0.0000020902933,0.008864803,0.9821205,0.0024465998,0.00010591182],"about_ca_topic_score_codex":0.000013542454,"about_ca_topic_score_gemma":0.00015855875,"teacher_disagreement_score":0.008940844,"about_ca_system_score_codex":0.000011475425,"about_ca_system_score_gemma":0.000036032056,"threshold_uncertainty_score":0.24446516},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7340372,0.00027087046,0.25996035,0.002002994,0.0018870158,0.00020428025,0.0000013295335,0.0004887893,0.0011471529],"genre_scores_gemma":[0.95437783,0.000021125816,0.045217842,0.00011098684,0.00001949878,0.000008617336,7.784703e-7,0.000013854654,0.00022947496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987405,0.00005777016,0.00016345106,0.00042882847,0.0002916155,0.00031786604],"domain_scores_gemma":[0.99891937,0.00011362494,0.00012878125,0.0006001609,0.000120478486,0.00011757563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014871315,0.00017726433,0.00018814023,0.00007105622,0.00015261091,0.00007512432,0.00051066704,0.000074226315,0.000017083456],"category_scores_gemma":[0.000046575584,0.00011005111,0.00004359081,0.0003371217,0.00017205699,0.00074922445,0.00012042744,0.00009197034,0.00008925893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008482152,0.00005143297,0.0018759016,0.000007432086,0.000017819419,0.000027534283,0.00009223086,0.000006144933,0.001748795,0.9785561,0.000065687236,0.017542465],"study_design_scores_gemma":[0.0015173169,0.00044777652,0.00085873733,0.00012830329,0.000015749203,0.00009360905,0.000049127237,0.0011962235,0.0118798185,0.9740421,0.009358022,0.0004131784],"about_ca_topic_score_codex":0.0000052626683,"about_ca_topic_score_gemma":0.0000018192022,"teacher_disagreement_score":0.2203406,"about_ca_system_score_codex":0.0000509373,"about_ca_system_score_gemma":0.00006039192,"threshold_uncertainty_score":0.44877538},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9899471,0.00006916355,0.00047780114,0.00004264308,0.0015496988,0.0003376918,0.000011152675,0.00042491476,0.007139854],"genre_scores_gemma":[0.9993465,0.000012909285,0.00015309725,0.000015757487,0.000005988183,0.00016820738,0.000002445562,0.000053101307,0.00024201308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999202,0.000026652151,0.00018468092,0.00016216454,0.00012487128,0.00029963822],"domain_scores_gemma":[0.9993649,0.0001538126,0.000032948134,0.00031538625,0.000042577627,0.00009037171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015621577,0.00017767526,0.00020493276,0.00006277105,0.000070227994,0.000022433805,0.00016820084,0.000074678865,0.000049572292],"category_scores_gemma":[0.000012735622,0.000115275194,0.00009328231,0.00021343998,0.000053279884,0.0001420211,0.000009500189,0.000051959505,0.00011713682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000218665,0.000025266248,0.0073072836,0.0000929775,0.000102861755,0.000003532236,0.00010656336,0.000008393706,0.0017295503,0.98706585,0.0027577933,0.0007780819],"study_design_scores_gemma":[0.0015185759,0.00007845246,0.0017189871,0.00014536653,0.00002941034,0.000017460281,0.00004601504,0.00006612781,0.003372398,0.9898849,0.0028448852,0.00027739513],"about_ca_topic_score_codex":0.0000026658722,"about_ca_topic_score_gemma":0.0000033262559,"teacher_disagreement_score":0.0093994,"about_ca_system_score_codex":0.000021454269,"about_ca_system_score_gemma":0.0000072437215,"threshold_uncertainty_score":0.4700786},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900336,0.0012011834,0.0003932964,0.003292881,0.0037905336,0.00013344611,0.000001546302,0.00018707484,0.0009664095],"genre_scores_gemma":[0.9982371,0.00014404423,0.001238153,0.00011256925,5.268149e-7,0.000008332449,2.2430221e-7,0.000009189793,0.00024991197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987396,0.00008007501,0.00028454314,0.00027101891,0.00032165853,0.0003031335],"domain_scores_gemma":[0.9983642,0.0004467252,0.00009645749,0.000804503,0.000203129,0.0000850014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006029469,0.000119671786,0.00014636728,0.00007228876,0.00023373247,0.00005861056,0.00089586264,0.00005678929,0.000005770585],"category_scores_gemma":[0.00014484835,0.000062987536,0.0000895406,0.00043085843,0.00014291969,0.00023114405,0.00021540716,0.00008055263,0.00006281865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003571567,0.00003666373,0.001939143,0.0000030797755,0.000017310696,0.0000016986045,0.00009211613,9.052145e-7,0.010642554,0.97645074,0.0021155037,0.00869672],"study_design_scores_gemma":[0.00063348503,0.00007746443,0.0005245542,0.000049001177,0.000005157389,0.0000032773016,0.000010200666,0.00017848755,0.013728499,0.9829049,0.001771147,0.00011381149],"about_ca_topic_score_codex":0.00002479287,"about_ca_topic_score_gemma":0.0000031735692,"teacher_disagreement_score":0.008582909,"about_ca_system_score_codex":0.000012818195,"about_ca_system_score_gemma":0.000048147347,"threshold_uncertainty_score":0.25685573},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92723465,0.0000308294,0.067624435,0.000908112,0.0015139811,0.00016518928,0.0000015972283,0.00013247207,0.0023887341],"genre_scores_gemma":[0.9979362,0.000007876343,0.0007669942,0.00013182174,0.000036693593,0.000021170683,4.424018e-7,0.00001818181,0.0010806387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864423,0.00013841513,0.00016698414,0.00046022958,0.00025337623,0.00033678583],"domain_scores_gemma":[0.9990624,0.00016752389,0.00011049178,0.00043598583,0.000111956724,0.000111598834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031164257,0.00019708987,0.00024653628,0.000055740355,0.00018397269,0.00022151093,0.00034179154,0.00009429367,0.000029334598],"category_scores_gemma":[0.000015208526,0.00012469859,0.000043165193,0.00016302348,0.000060822822,0.0006935398,0.00019215333,0.00012493474,0.000029776129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005607257,0.00010945436,0.27259278,0.000016704595,0.00011130416,0.00006226234,0.0019260345,0.000046818826,0.00033351025,0.7101062,0.0025020652,0.012136803],"study_design_scores_gemma":[0.005508562,0.0004469337,0.13111559,0.00037977073,0.000023106097,0.00052773836,0.00037509677,0.013942548,0.0012727543,0.8384853,0.0067745443,0.0011480597],"about_ca_topic_score_codex":0.00041399288,"about_ca_topic_score_gemma":0.00035507753,"teacher_disagreement_score":0.1414772,"about_ca_system_score_codex":0.000064145366,"about_ca_system_score_gemma":0.000038814003,"threshold_uncertainty_score":0.50850606},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.995058,0.00045383585,0.0009451375,0.0006038458,0.0015172159,0.000074840675,0.0000028688955,0.00009158484,0.0012526995],"genre_scores_gemma":[0.9954206,0.000045725264,0.0042411396,0.000059632745,7.4791865e-7,0.0000031412828,3.0222262e-7,0.000008002941,0.00022073538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893606,0.00004525682,0.00030664777,0.00023515553,0.0002790847,0.0001978152],"domain_scores_gemma":[0.9988154,0.00011561595,0.0001699336,0.00056092953,0.0002703362,0.00006777882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035400598,0.00010509893,0.00021275021,0.00014513449,0.00004581682,0.000015557911,0.0005522881,0.00006585477,0.000014779103],"category_scores_gemma":[0.0000880512,0.000071362156,0.00009169675,0.00044086462,0.00011305519,0.00018966511,0.00015700079,0.000051721443,0.000025972753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004539868,0.00007281493,0.006251106,0.000014387155,0.000023934072,0.0000014383095,0.000109034765,0.0000016966914,0.018307446,0.97192967,0.0010206238,0.0022633232],"study_design_scores_gemma":[0.00071083545,0.00015189878,0.0015583242,0.00009139741,0.00000849283,0.0000028814898,0.0000039768734,0.00010591197,0.0360416,0.9608198,0.00039469072,0.000110197674],"about_ca_topic_score_codex":0.00003482192,"about_ca_topic_score_gemma":9.2934835e-7,"teacher_disagreement_score":0.017734153,"about_ca_system_score_codex":0.00000847283,"about_ca_system_score_gemma":0.00005347921,"threshold_uncertainty_score":0.29100645},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99555355,0.000049532515,0.00034005236,0.00064419606,0.0019619307,0.00009178473,0.0000022942643,0.00014665055,0.0012099803],"genre_scores_gemma":[0.99887717,0.000012226818,0.0008706626,0.00009047883,9.2928616e-7,0.00000767257,4.755107e-7,0.000008065069,0.0001323159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888474,0.0000439751,0.00023080138,0.0003034839,0.00028640084,0.00025057374],"domain_scores_gemma":[0.9989467,0.00022763506,0.00010889467,0.0005508849,0.00006902609,0.00009686178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023780655,0.00012213607,0.00017719383,0.00014329061,0.0000705302,0.00002385117,0.00044812213,0.00006245668,0.0000073221718],"category_scores_gemma":[0.00006829028,0.000084830725,0.00007049398,0.00033352285,0.000061205414,0.0001698959,0.00014623241,0.00007820376,0.000081637896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012437977,0.00009250056,0.0008345213,0.000005747989,0.000010986385,0.000007725717,0.00010769728,0.000008167029,0.02498325,0.96952724,0.00055631885,0.0038533998],"study_design_scores_gemma":[0.0012672021,0.00040654853,0.0025080666,0.000116839095,0.0000048492566,0.000008819901,0.000002754185,0.00018363168,0.051758394,0.94332635,0.00024778408,0.00016877454],"about_ca_topic_score_codex":0.00002199094,"about_ca_topic_score_gemma":9.1113907e-7,"teacher_disagreement_score":0.026775144,"about_ca_system_score_codex":0.00001905654,"about_ca_system_score_gemma":0.000031433312,"threshold_uncertainty_score":0.34592965},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9924414,0.000052678064,0.00054983294,0.00033347428,0.00040446065,0.0005394434,0.000061396146,0.00007120104,0.0055461214],"genre_scores_gemma":[0.9977367,0.000016161363,0.0014900819,0.000036033358,0.0000028405507,0.00014747257,0.0000029141809,0.000022382228,0.0005454417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999243,0.000039433784,0.00023756397,0.00017894832,0.00011966591,0.00018136419],"domain_scores_gemma":[0.9976456,0.0015535398,0.00013810898,0.00035853634,0.00024766268,0.000056509278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026890534,0.000111807036,0.00020883986,0.00013967098,0.00008682807,0.0000074364657,0.00021003139,0.0000706516,0.000050633596],"category_scores_gemma":[0.00080926367,0.00008098197,0.00011863895,0.0005990797,0.00010371712,0.00006927868,0.00003704004,0.000045643137,0.000016821508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022545957,0.00023011501,0.00036971737,0.000037978898,0.000049301198,2.4423815e-7,0.000084013176,1.1598702e-8,0.003005963,0.99202514,0.0029103055,0.0012646554],"study_design_scores_gemma":[0.0011268846,0.000098347584,0.0005366567,0.00004895859,0.000052979383,0.000001121134,0.00004443111,0.0000045219413,0.010774452,0.985617,0.0015789862,0.00011569969],"about_ca_topic_score_codex":0.0000050465787,"about_ca_topic_score_gemma":0.0000020130717,"teacher_disagreement_score":0.0077684894,"about_ca_system_score_codex":0.000019232637,"about_ca_system_score_gemma":0.000028468801,"threshold_uncertainty_score":0.3302349},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8507881,0.00014269,0.12761995,0.001223607,0.005079394,0.0001078848,0.0000037661123,0.00026477536,0.014769838],"genre_scores_gemma":[0.9988967,0.00001073755,0.00052552676,0.00011909502,0.0000032304438,0.0000049517466,1.5071494e-7,0.0000046195155,0.00043499886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992026,0.00006947636,0.00014174789,0.00021860791,0.0002003853,0.00016718764],"domain_scores_gemma":[0.9990526,0.0002722279,0.000077748584,0.0004896014,0.00004628103,0.00006154233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018436948,0.00008753631,0.00011750777,0.00008688316,0.000044049666,0.000015511463,0.0007477856,0.000041220817,0.000014117744],"category_scores_gemma":[0.00005471362,0.000058408372,0.000055176442,0.00027063445,0.00006657878,0.00023692974,0.00011477805,0.000037705067,0.000033982844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004641787,0.000058948426,0.00017655829,0.0000013897853,0.0000063060493,0.000006215707,0.000060056307,4.9079864e-7,0.0015905837,0.9582534,0.0002747215,0.039566733],"study_design_scores_gemma":[0.00040364533,0.00019191741,0.0011247031,0.000040828185,0.0000013828144,0.0000024461156,0.0000022480217,0.000104744126,0.039712533,0.95802665,0.00030009044,0.0000888066],"about_ca_topic_score_codex":0.0000051290426,"about_ca_topic_score_gemma":7.2734986e-7,"teacher_disagreement_score":0.1481086,"about_ca_system_score_codex":0.000013417969,"about_ca_system_score_gemma":0.000024547891,"threshold_uncertainty_score":0.23818243},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99648607,0.00009217889,0.00076506037,0.00033811913,0.0013901031,0.000117727424,0.000006824857,0.00008159201,0.0007223318],"genre_scores_gemma":[0.9974307,0.0000052341397,0.0024897018,0.00002082785,0.0000015262755,0.0000048433217,6.547829e-7,0.000008187805,0.00003832356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984738,0.00009003937,0.00045470227,0.00036954068,0.00034727275,0.0002645957],"domain_scores_gemma":[0.99823487,0.0002990758,0.00026988014,0.0008207672,0.00026420204,0.000111190006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006280007,0.00013945783,0.00028879702,0.000105609564,0.000060163155,0.000024339673,0.00059404265,0.000070951624,0.000012547013],"category_scores_gemma":[0.00048466295,0.00009990598,0.00012403939,0.00049217837,0.00018031128,0.0002593414,0.0002718393,0.00008378105,0.000007544046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010148559,0.00020770155,0.03907805,0.000030790565,0.000019431085,0.0000027938613,0.00021515663,0.0000040080517,0.014354767,0.943435,0.00033137048,0.0023107633],"study_design_scores_gemma":[0.0009778112,0.00016011532,0.028586427,0.00013629673,0.000009504346,0.000004197237,0.000009301789,0.00023609519,0.029344145,0.94033825,0.00003929805,0.00015855292],"about_ca_topic_score_codex":0.000110673594,"about_ca_topic_score_gemma":0.0000041277076,"teacher_disagreement_score":0.014989377,"about_ca_system_score_codex":0.000018472603,"about_ca_system_score_gemma":0.000063216816,"threshold_uncertainty_score":0.40740475},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9915607,0.000076902455,0.000025821306,0.000015091024,0.0018686175,0.00009465495,0.0000072700295,0.00015599678,0.0061949654],"genre_scores_gemma":[0.999907,0.0000109808125,0.000007090507,0.0000064698856,0.0000031702143,0.000013248746,8.46717e-7,0.000015879155,0.00003530775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939245,0.000045577057,0.00018092134,0.000116492476,0.00011490776,0.00014963916],"domain_scores_gemma":[0.9994227,0.0001413785,0.000025366882,0.00033811745,0.000019828589,0.000052600262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021973765,0.0001015531,0.00015493941,0.00005439911,0.000021785507,0.000004071528,0.00014267463,0.000061448314,0.00006143663],"category_scores_gemma":[0.00003483261,0.00007197444,0.00007702165,0.00014092676,0.00005345644,0.0000654254,0.0000115944285,0.000055698358,0.00005988254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118062535,0.00004631418,0.004740691,0.000037421814,0.00002408748,8.910528e-7,0.000040562958,0.000006029294,0.010132879,0.98303306,0.0007354201,0.0011908273],"study_design_scores_gemma":[0.0005613531,0.00008227919,0.01093898,0.00006913744,0.0000052364153,9.448333e-7,0.000011253473,0.0000140746715,0.013968988,0.97358024,0.0006520194,0.00011548507],"about_ca_topic_score_codex":0.000003928755,"about_ca_topic_score_gemma":0.0000011307043,"teacher_disagreement_score":0.009452821,"about_ca_system_score_codex":0.000023616236,"about_ca_system_score_gemma":0.0000026836,"threshold_uncertainty_score":0.29350325},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952423,0.00077762856,0.00003124232,0.0015026839,0.0012624147,0.0005000001,0.000038141137,0.000018422019,0.00062718056],"genre_scores_gemma":[0.998646,0.0001653293,0.00014766504,0.00014995829,0.000029974542,0.00006307478,0.000023466122,0.000026171108,0.0007483286],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986181,0.000095663636,0.0002523359,0.0004489704,0.00024433105,0.00034059907],"domain_scores_gemma":[0.9986535,0.00001760176,0.00010771517,0.0009194402,0.00019170027,0.00011004875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037640124,0.00019642287,0.000191553,0.00007874138,0.00008172416,0.000014117615,0.0005055054,0.00006699841,0.000038840302],"category_scores_gemma":[0.00010582107,0.00012348103,0.00012789699,0.0002887686,0.000120904384,0.000004826665,0.00020351815,0.00006891062,0.00008149292],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056730267,0.0001585634,0.020833462,0.000020611113,0.00017583279,0.0000039262472,0.00012855894,0.0000050384174,0.9250435,0.0301357,0.019001702,0.004436326],"study_design_scores_gemma":[0.003010143,0.0008646588,0.016563134,0.000055585417,0.00008453417,0.000020422964,0.000065168824,0.0000024185579,0.84808296,0.06497161,0.06567891,0.00060042465],"about_ca_topic_score_codex":0.00007302618,"about_ca_topic_score_gemma":0.000042687676,"teacher_disagreement_score":0.076960556,"about_ca_system_score_codex":0.000015127619,"about_ca_system_score_gemma":0.000059530328,"threshold_uncertainty_score":0.503541},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9799015,0.00026052617,0.0043758284,0.00006610806,0.001747868,0.00045467514,0.000019912899,0.0008718815,0.012301736],"genre_scores_gemma":[0.9993721,0.000023855318,0.000120259596,0.000037985377,0.000029064364,0.00007660699,0.000004510203,0.0000923878,0.00024323454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983378,0.00015138969,0.00031069096,0.00035194616,0.00029957358,0.0005485888],"domain_scores_gemma":[0.9989066,0.00037078754,0.00007672192,0.00035557008,0.00010000774,0.00019028097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004310106,0.000329247,0.0003655974,0.0002315144,0.00016112455,0.000043980854,0.0002519154,0.0001564772,0.000049459588],"category_scores_gemma":[0.000054293956,0.00024312129,0.0001072348,0.0005671482,0.00011454633,0.00034260566,0.000026468642,0.000214497,0.00015881241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009816298,0.00013333252,0.0043318486,0.00012085787,0.00044071334,0.0001518289,0.0019715615,0.00008153734,0.028204272,0.9581418,0.0009657231,0.0053583747],"study_design_scores_gemma":[0.018714918,0.002559092,0.07905332,0.0028792932,0.00060534634,0.00040672402,0.0030929549,0.003650018,0.286417,0.59393126,0.003900106,0.004789981],"about_ca_topic_score_codex":0.0000103377315,"about_ca_topic_score_gemma":0.0000048754505,"teacher_disagreement_score":0.36421055,"about_ca_system_score_codex":0.00015412303,"about_ca_system_score_gemma":0.00003837615,"threshold_uncertainty_score":0.99141985},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9948374,0.00019967616,0.0001077441,0.0016365633,0.0014192907,0.00015157044,6.1521837e-7,0.00020218047,0.001444979],"genre_scores_gemma":[0.99834996,0.000020110325,0.0011228524,0.00021356564,4.845923e-7,0.000019821126,3.1964112e-7,0.0000105485915,0.00026233343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986795,0.00009866392,0.00021481066,0.00041060086,0.0002520051,0.000344398],"domain_scores_gemma":[0.99908817,0.00008193332,0.000051101713,0.00059257797,0.00008030496,0.000105894374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044860694,0.00013660792,0.00015534891,0.00017607558,0.00007727064,0.00008093598,0.00058272446,0.00007026335,0.0000149068865],"category_scores_gemma":[0.00006169867,0.00008685004,0.000058928406,0.0005748553,0.0000612839,0.00042546057,0.00017627479,0.00010608659,0.00025553224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039128317,0.000084979096,0.014406972,0.000004335711,0.000005734519,0.000019862908,0.00020083057,0.0000013700238,0.0037599895,0.9703291,0.001538075,0.009644813],"study_design_scores_gemma":[0.0011793716,0.00014206186,0.009456433,0.00007266945,0.0000020125003,0.000008586424,0.0000033275103,0.00032363666,0.0025896735,0.98531914,0.00070611836,0.0001969795],"about_ca_topic_score_codex":0.000060927534,"about_ca_topic_score_gemma":0.0000056965973,"teacher_disagreement_score":0.014990004,"about_ca_system_score_codex":0.000028829445,"about_ca_system_score_gemma":0.000056267243,"threshold_uncertainty_score":0.35416418},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86937183,0.00024307016,0.115807615,0.005207659,0.0041942443,0.0004040378,0.0000044291974,0.00038565372,0.0043814555],"genre_scores_gemma":[0.9967595,0.0000050832527,0.0028973587,0.00008035266,0.000010834975,0.000014200209,3.3845572e-7,0.000005836268,0.00022654985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924827,0.000042172156,0.00016844271,0.0001794628,0.00018974664,0.00017191046],"domain_scores_gemma":[0.99896663,0.0001165739,0.00012335229,0.0007200121,0.000036993326,0.000036444006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019668925,0.00006928517,0.000088016655,0.000015272706,0.00011102381,0.000026740585,0.0011121541,0.000027854127,0.000011066854],"category_scores_gemma":[0.000021380285,0.000039479786,0.0000621592,0.0002852466,0.000054174492,0.00014783243,0.0003772688,0.000047147358,0.000033810342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.3280315e-7,0.000025742142,0.002531718,0.0000017411586,0.000005782741,6.0322003e-7,0.000036266116,0.0000052872615,0.005654467,0.9804499,0.0015292161,0.009759053],"study_design_scores_gemma":[0.00048940146,0.000028396424,0.021893864,0.000056453027,0.0000057435577,0.0000074650666,0.0000018689557,0.0063128406,0.012087149,0.9510708,0.007929373,0.00011664634],"about_ca_topic_score_codex":0.000015179953,"about_ca_topic_score_gemma":0.000002063614,"teacher_disagreement_score":0.12738761,"about_ca_system_score_codex":0.0000220951,"about_ca_system_score_gemma":0.000023009774,"threshold_uncertainty_score":0.20666775},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939465,0.00011591041,0.00033515182,0.0021266812,0.00252376,0.00013449196,7.0977376e-7,0.00019415468,0.00062264426],"genre_scores_gemma":[0.9991432,0.000014618176,0.00057110627,0.00007248376,0.0000012167652,0.000015559532,5.3268917e-7,0.000008498296,0.0001727906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987185,0.000071722614,0.00021783481,0.00043550588,0.00023067588,0.00032576872],"domain_scores_gemma":[0.9990979,0.000054450084,0.00005395109,0.0006377276,0.00005960774,0.000096407624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017564734,0.0001303654,0.00015555178,0.00018283668,0.00006417163,0.00005494442,0.0005563962,0.00004428963,0.000016918582],"category_scores_gemma":[0.000047179765,0.00008828939,0.00005460312,0.00048424903,0.000054908407,0.0002680069,0.00015214903,0.00008450727,0.000079309146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026487803,0.00009271095,0.010245586,0.0000034942946,0.0000051603315,0.000010548471,0.00010346958,3.9690252e-7,0.008863683,0.9723129,0.00094494235,0.0074144388],"study_design_scores_gemma":[0.0009822814,0.000058455993,0.012517117,0.000043913013,0.0000022073452,0.0000046584614,0.0000021074625,0.000111412584,0.009913758,0.97595555,0.00024308533,0.00016547444],"about_ca_topic_score_codex":0.0000423571,"about_ca_topic_score_gemma":0.000008593689,"teacher_disagreement_score":0.007248964,"about_ca_system_score_codex":0.000023539753,"about_ca_system_score_gemma":0.000038016402,"threshold_uncertainty_score":0.3600337},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939734,0.00001970064,0.0002212674,0.00060145784,0.00019213164,0.00029223412,0.000015482765,0.00009343874,0.0045908964],"genre_scores_gemma":[0.99892133,0.000014675749,0.0006323539,0.000013540899,0.0000060290686,0.000047825826,0.0000016782477,0.000028322811,0.00033421651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989529,0.0001161692,0.00026362448,0.00019171998,0.00020097224,0.00027457692],"domain_scores_gemma":[0.99802196,0.0011382479,0.00019659009,0.0004831376,0.00009155659,0.00006849537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035748945,0.00015572355,0.00022012187,0.000032049924,0.00026494847,0.000026392807,0.0003582387,0.000060816947,0.00006480781],"category_scores_gemma":[0.00007283434,0.0000849364,0.000084825646,0.00026508377,0.0002564626,0.00009424352,0.00004049558,0.000118092124,0.000033357825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008967946,0.00011609389,0.0016828836,0.000016692258,0.00007871384,0.0000038609887,0.00032211794,1.487092e-7,0.0033533112,0.9934089,0.00058375864,0.00034382625],"study_design_scores_gemma":[0.0010482685,0.00007056065,0.0018216023,0.00007131558,0.00004159687,0.000018801089,0.00024030029,0.0000019603062,0.009553569,0.9865374,0.00044847326,0.0001461551],"about_ca_topic_score_codex":0.00001199854,"about_ca_topic_score_gemma":0.000019470208,"teacher_disagreement_score":0.0068715164,"about_ca_system_score_codex":0.000022622204,"about_ca_system_score_gemma":0.00003253148,"threshold_uncertainty_score":0.3463606},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99806184,0.000059233014,0.000024631776,0.00038406276,0.000117173244,0.00020577594,0.000015050609,0.00007459393,0.001057619],"genre_scores_gemma":[0.99908423,0.000027677657,0.00050883833,0.000023691811,0.000006526637,0.000048120197,0.000001984521,0.000021883343,0.00027706154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992312,0.000039640352,0.00019587264,0.00017143946,0.00019123597,0.00017061114],"domain_scores_gemma":[0.99893284,0.0002918098,0.00017391932,0.0004619887,0.00007325233,0.000066208995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018184735,0.00011852944,0.00020661706,0.00008733047,0.0000784334,0.000008129057,0.0002531652,0.000061743915,0.00003714736],"category_scores_gemma":[0.000048407303,0.000075579934,0.00005917651,0.00024224471,0.00021347242,0.00013895553,0.00004155231,0.000068924535,0.00002452141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022813285,0.00028937045,0.004634457,0.000037207657,0.00006595616,0.0000010767677,0.00030085864,2.7304806e-8,0.0033024866,0.9907473,0.00036426526,0.00023420918],"study_design_scores_gemma":[0.00073106075,0.00010790565,0.0036655923,0.00011130956,0.00004957631,0.0000020610032,0.00010106618,4.19236e-7,0.029242063,0.9657064,0.00016167488,0.00012087902],"about_ca_topic_score_codex":0.000006100789,"about_ca_topic_score_gemma":0.00000411355,"teacher_disagreement_score":0.025939576,"about_ca_system_score_codex":0.000010200138,"about_ca_system_score_gemma":0.00002259257,"threshold_uncertainty_score":0.30820602},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9343499,0.00020642378,0.059011377,0.00047461127,0.003870069,0.0003471273,0.000010147838,0.00024571008,0.0014846242],"genre_scores_gemma":[0.99952036,0.000053710217,0.00014517254,0.00005411126,0.000022511627,0.000027755232,0.0000014205609,0.000018909248,0.00015606533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974641,0.0004945512,0.0005232206,0.00069201627,0.00036296542,0.00046312343],"domain_scores_gemma":[0.99701595,0.0011851322,0.0003232364,0.0008640517,0.00039972394,0.00021192126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005062908,0.00027975446,0.0005213281,0.00026241026,0.00020517541,0.00008693159,0.0006255232,0.00023334255,0.000013449934],"category_scores_gemma":[0.0003851699,0.00021342079,0.000128037,0.0010417169,0.00026055827,0.00062765664,0.00033813258,0.00022215142,0.000017233433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005693705,0.00020583041,0.010887447,0.000028201677,0.000065506916,0.000022747787,0.00020112307,0.000004525689,0.005049264,0.96794945,0.0042752693,0.011253698],"study_design_scores_gemma":[0.0076655643,0.0018113588,0.31410426,0.0004951355,0.000051891555,0.00019079614,0.00013211847,0.013131699,0.021884413,0.6341516,0.005111454,0.0012697623],"about_ca_topic_score_codex":0.0003256443,"about_ca_topic_score_gemma":0.000048599515,"teacher_disagreement_score":0.3337979,"about_ca_system_score_codex":0.000113469556,"about_ca_system_score_gemma":0.000117507836,"threshold_uncertainty_score":0.8703047},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8772459,0.00008397434,0.08686,0.0027028848,0.008623172,0.00052614673,0.000002976016,0.00016667851,0.02378829],"genre_scores_gemma":[0.99775165,0.000005501454,0.00006425569,0.00017596275,0.000028831038,0.00002604262,2.7687312e-7,0.000010573429,0.0019368948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998723,0.00023635685,0.00024398277,0.0002631641,0.00028933262,0.00024416836],"domain_scores_gemma":[0.9984526,0.00044578253,0.00015344273,0.0007519767,0.00013944543,0.000056745663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063554576,0.00013313163,0.0002165053,0.00002522214,0.00011052192,0.00005370259,0.0006487329,0.000067294786,0.000046205932],"category_scores_gemma":[0.00004238675,0.000062384024,0.000090358015,0.0003026423,0.000060758906,0.00015942674,0.00009108574,0.00011636301,0.000052113923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022001175,0.00003579098,0.0030821387,0.0000030138924,0.000042560627,0.000005446953,0.000085370644,0.000045974804,0.000023961296,0.9806806,0.015015093,0.0009580548],"study_design_scores_gemma":[0.0065038186,0.0016951151,0.011393259,0.0012996155,0.0000618045,0.00020249955,0.00017698605,0.039886083,0.002288024,0.9155649,0.019648887,0.0012789957],"about_ca_topic_score_codex":0.000049102033,"about_ca_topic_score_gemma":0.00000575398,"teacher_disagreement_score":0.12050578,"about_ca_system_score_codex":0.00004386229,"about_ca_system_score_gemma":0.000030972813,"threshold_uncertainty_score":0.25439465},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91480595,0.0002141798,0.06714654,0.010701845,0.00332981,0.0003928839,0.000014662951,0.00042121438,0.0029728962],"genre_scores_gemma":[0.99819934,0.000022082555,0.0014613869,0.00016611423,0.0000041164185,0.000026599268,2.633679e-7,0.0000134066195,0.00010668418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981188,0.00019472024,0.00018469042,0.0005139188,0.0005558228,0.00043205195],"domain_scores_gemma":[0.9960664,0.0028858385,0.000025574569,0.00056518853,0.00020327573,0.00025374323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039159777,0.00015438673,0.00015779023,0.00021102958,0.00018184276,0.00012728354,0.00058111706,0.000091972746,0.000050436276],"category_scores_gemma":[0.0022274714,0.00011241477,0.000048987717,0.00029526383,0.0003375505,0.0007440768,0.00029174428,0.00018740236,0.000112250236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021493033,0.00010264737,0.00038337448,0.000009349834,0.000005419058,0.000024574943,0.00006439294,7.0943145e-8,0.0025218532,0.98272717,0.00017213382,0.013967492],"study_design_scores_gemma":[0.0007025975,0.00028995986,0.0044570086,0.000044961627,0.0000022515378,0.000011025884,0.0000065827026,0.00012708585,0.0057231877,0.9883324,0.00013422304,0.00016870644],"about_ca_topic_score_codex":0.0000017166296,"about_ca_topic_score_gemma":6.5759764e-7,"teacher_disagreement_score":0.08339338,"about_ca_system_score_codex":0.00006398808,"about_ca_system_score_gemma":0.000034527693,"threshold_uncertainty_score":0.4584141},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9915028,0.00067197514,0.0002935535,0.000017034497,0.000869527,0.00014005053,0.0000093638755,0.00031357675,0.0061820913],"genre_scores_gemma":[0.9997868,0.00006959868,0.000014403616,0.000014669842,0.000009168508,0.000017451921,0.0000012587287,0.000042154046,0.00004449602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912727,0.000033464494,0.00017194917,0.000200534,0.00015994746,0.00030684835],"domain_scores_gemma":[0.99940366,0.00016195433,0.00003607345,0.0002581515,0.000028773531,0.000111395006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016988323,0.00018793026,0.0002253223,0.00017561328,0.0000906701,0.000050097387,0.00013360668,0.000062994826,0.000012322977],"category_scores_gemma":[0.000017506909,0.00013303579,0.000039655235,0.00043368514,0.00006159359,0.00020482203,0.000026733916,0.000091392096,0.00002707614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010027607,0.000020042342,0.04776194,0.00011747986,0.00013936631,0.00002629613,0.00022450495,0.00003138646,0.013714663,0.93139416,0.00020456851,0.0063555385],"study_design_scores_gemma":[0.011864069,0.00093453424,0.18380411,0.002306059,0.00023289131,0.0003753207,0.00060391653,0.0015074472,0.024306946,0.74481964,0.025918983,0.0033260856],"about_ca_topic_score_codex":0.0000090674175,"about_ca_topic_score_gemma":0.0000034981554,"teacher_disagreement_score":0.18657455,"about_ca_system_score_codex":0.00003369657,"about_ca_system_score_gemma":0.0000055289797,"threshold_uncertainty_score":0.54250425},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9905854,0.00007809742,0.0004410457,0.0028849565,0.0027004157,0.00011186458,0.0000021296164,0.0005378365,0.0026582885],"genre_scores_gemma":[0.9983203,0.000010053508,0.00075936446,0.00056853646,8.6396057e-7,0.000010602876,8.0520874e-7,0.00001058739,0.0003189312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986976,0.00008023359,0.00019282867,0.00040552922,0.00031125944,0.00031255337],"domain_scores_gemma":[0.9986638,0.00031851738,0.0000695847,0.0006998455,0.000112906026,0.00013536094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024922987,0.0001456466,0.00014442609,0.0001494971,0.00012951235,0.00006428761,0.00062092656,0.000071616894,0.000031633706],"category_scores_gemma":[0.00014525217,0.00009493053,0.0000593515,0.000408715,0.00006704716,0.00020802092,0.0001343295,0.0000849101,0.000460523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059436516,0.00007623493,0.00032057043,0.0000016046702,0.000011685976,0.0000110228775,0.00004195746,0.0000011907148,0.0034783424,0.98088795,0.012313381,0.002850106],"study_design_scores_gemma":[0.0011884319,0.00022398992,0.0010206063,0.00004288863,0.0000030583105,0.000004641561,0.0000017025868,0.00007166117,0.009297515,0.9874668,0.0005040022,0.00017468946],"about_ca_topic_score_codex":0.000011819793,"about_ca_topic_score_gemma":0.0000010345703,"teacher_disagreement_score":0.011809379,"about_ca_system_score_codex":0.000019413354,"about_ca_system_score_gemma":0.00003856584,"threshold_uncertainty_score":0.5919245},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9774559,0.00004334241,0.0022368375,0.0012160073,0.0007379378,0.00012052864,0.0000044231424,0.00014663144,0.018038375],"genre_scores_gemma":[0.99187666,0.000018017206,0.00028536996,0.00022868003,0.00002106568,0.000010505311,8.9018494e-7,0.000027224143,0.0075315824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987533,0.000050640294,0.00024182846,0.00027357275,0.000390096,0.00029053088],"domain_scores_gemma":[0.9983454,0.00082731666,0.00011012629,0.0005175633,0.000088367495,0.00011123692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029040204,0.00016635271,0.00027188746,0.00024680546,0.00008958196,0.000017749688,0.00024656783,0.000120570076,0.0004718643],"category_scores_gemma":[0.0009094336,0.00010256431,0.00013741801,0.0006939211,0.000060047947,0.000094530136,0.00007112617,0.0001050122,0.0007702118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017454277,0.00016265719,0.004337553,0.000006750685,0.000058690966,0.0000072536827,0.000101182355,2.6098485e-7,0.00007036241,0.9698216,0.013619365,0.011796868],"study_design_scores_gemma":[0.0009677168,0.00009850441,0.0018085386,0.000033881483,0.000050395738,0.0000023987232,0.000026485284,0.00002282501,0.0006172253,0.98895764,0.00721966,0.00019474275],"about_ca_topic_score_codex":0.0000136121525,"about_ca_topic_score_gemma":0.0000034073666,"teacher_disagreement_score":0.019136027,"about_ca_system_score_codex":0.0000904841,"about_ca_system_score_gemma":0.000035411955,"threshold_uncertainty_score":0.9899772},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9898419,0.000007183499,0.0017359784,0.001464624,0.0011564363,0.00020770238,0.0000025412076,0.00012712897,0.00545653],"genre_scores_gemma":[0.9954465,0.000011320124,0.0037443556,0.00010247387,0.000014891242,0.000038433594,0.0000011759845,0.000028159797,0.0006126932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990788,0.000046957568,0.00024579008,0.0002161264,0.0001958841,0.0002164421],"domain_scores_gemma":[0.99854565,0.000868678,0.00009739023,0.000394403,0.000046458288,0.000047435144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017045821,0.00012149078,0.00014753557,0.00011468523,0.00005597819,0.000011583966,0.00014761834,0.00009347774,0.00009417301],"category_scores_gemma":[0.0010775671,0.00009564788,0.000039193204,0.00020678467,0.00003767522,0.00019232946,0.000035639387,0.00015002368,0.0001777885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011716693,0.0001505079,0.0012395098,0.000007306963,0.0000050343147,0.0000066829894,0.00009623726,3.768489e-7,0.0018878473,0.9927618,0.00063240004,0.0032005648],"study_design_scores_gemma":[0.00086704054,0.00005182817,0.004948726,0.00007553854,0.000004617055,0.0000024913024,0.000011151819,0.000006309245,0.008620461,0.9837132,0.0015663038,0.00013229625],"about_ca_topic_score_codex":0.0000046041887,"about_ca_topic_score_gemma":0.000023923036,"teacher_disagreement_score":0.009048579,"about_ca_system_score_codex":0.00021481382,"about_ca_system_score_gemma":0.000029081019,"threshold_uncertainty_score":0.39004076},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9955859,0.00005950251,0.00023245998,0.00005558022,0.00066804595,0.00028245547,0.000035660185,0.00005479931,0.0030255618],"genre_scores_gemma":[0.99688464,0.0000105491945,0.0029793498,0.000023172835,0.0000086836435,0.000010830798,0.0000022100455,0.0000268185,0.000053735203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982534,0.00025707445,0.0006636951,0.00023448077,0.00031532024,0.00027604718],"domain_scores_gemma":[0.9947665,0.0036560413,0.00044695553,0.000848211,0.00021404478,0.000068258494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010822961,0.0001934276,0.00046795094,0.00008514483,0.00010620066,0.000007007834,0.0004652426,0.00010777443,0.000094328054],"category_scores_gemma":[0.0021493256,0.00013008944,0.0001765097,0.000212807,0.00034531162,0.00010678141,0.0002800218,0.00014330617,0.0000032865119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006881754,0.00020325121,0.015263795,0.00019561383,0.00006776945,0.0000021570884,0.0012351653,0.0000014125723,0.0018038256,0.979472,0.0001260908,0.0015600969],"study_design_scores_gemma":[0.001582156,0.00015401327,0.0030565462,0.00020079249,0.000039517457,0.00000204394,0.000049408096,0.00003463479,0.006563647,0.9880488,0.00010435096,0.00016412645],"about_ca_topic_score_codex":0.00001995204,"about_ca_topic_score_gemma":0.000011967486,"teacher_disagreement_score":0.012207248,"about_ca_system_score_codex":0.000031731754,"about_ca_system_score_gemma":0.000033010103,"threshold_uncertainty_score":0.5304893},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99686086,0.000021654441,0.00017336116,0.000112175745,0.0001980972,0.0001359532,0.000004326933,0.000028496854,0.0024650686],"genre_scores_gemma":[0.99748766,0.000019920108,0.0022708415,0.000024366576,0.0000012636134,0.000022178747,0.0000030215374,0.000013167827,0.00015757882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992965,0.00008362308,0.00024176735,0.00014354236,0.0001053864,0.0001291744],"domain_scores_gemma":[0.9992325,0.00026387308,0.00010728523,0.0003029806,0.000057566485,0.000035839344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022841821,0.00008150179,0.00015015743,0.00008271892,0.00002524345,0.0000055508526,0.00012889036,0.000045521167,0.000045989746],"category_scores_gemma":[0.000117438525,0.00006502206,0.000061707746,0.0003341782,0.00006868705,0.00007190778,0.000023560155,0.00003924423,0.0000116560705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056587273,0.0001351335,0.008870085,0.000012927378,0.000011450108,8.6502826e-7,0.00015071066,0.000002342443,0.008718976,0.98145896,0.00043125768,0.00020162875],"study_design_scores_gemma":[0.00078667764,0.000014483196,0.0007808894,0.00004392163,0.0000116947895,0.0000012536149,0.000051667612,0.000010571335,0.02868568,0.96945095,0.00007671087,0.00008547281],"about_ca_topic_score_codex":0.00002481669,"about_ca_topic_score_gemma":0.000020475822,"teacher_disagreement_score":0.019966705,"about_ca_system_score_codex":0.000019904826,"about_ca_system_score_gemma":0.000015927399,"threshold_uncertainty_score":0.26515228},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81941605,0.00051685947,0.13530523,0.017592689,0.0075441618,0.0006787755,0.000017354001,0.002028712,0.016900178],"genre_scores_gemma":[0.9960082,0.000017408618,0.0034172977,0.00019537641,0.000005156436,0.000027170472,4.4892994e-7,0.00001728083,0.0003116695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998045,0.0002037821,0.00020711764,0.000509292,0.0004295968,0.0006052126],"domain_scores_gemma":[0.9973584,0.0010702851,0.000035470577,0.000996233,0.00027102474,0.00026857914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040691468,0.00016252557,0.00018356025,0.00018603947,0.00018813576,0.000104003004,0.0013459026,0.00008224884,0.00007273112],"category_scores_gemma":[0.0009697729,0.000117113836,0.00008496545,0.00072193786,0.00033365694,0.000816885,0.00039314525,0.00015984342,0.00041067382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009443857,0.00006541197,0.0009527075,0.000004275377,0.000010303334,0.000042043794,0.000052683194,1.0355103e-7,0.006728796,0.98280704,0.00077228504,0.00855488],"study_design_scores_gemma":[0.00072620355,0.00013909405,0.0031856564,0.000028688308,0.000002112768,0.000016292908,0.000005420656,0.000104863524,0.008631299,0.98486066,0.0020970327,0.00020267048],"about_ca_topic_score_codex":0.000003953993,"about_ca_topic_score_gemma":0.0000018636467,"teacher_disagreement_score":0.17659214,"about_ca_system_score_codex":0.00005544462,"about_ca_system_score_gemma":0.000068222434,"threshold_uncertainty_score":0.5278518},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99173385,0.000061362465,0.00027460838,0.0017207839,0.0021581103,0.00012570807,0.0000013120315,0.00012096571,0.0038032876],"genre_scores_gemma":[0.99918073,0.000008786747,0.00045305118,0.00023998717,7.7854645e-7,0.000010531303,3.1138995e-7,0.000009343035,0.00009649338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987782,0.00010451927,0.00025818148,0.00026681373,0.00034836927,0.0002439217],"domain_scores_gemma":[0.9982105,0.000686788,0.00014476269,0.0007729882,0.000110779096,0.000074164534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000489862,0.00012967459,0.00016353508,0.000046267498,0.00014300251,0.000051942487,0.0007744113,0.000044044522,0.00003461634],"category_scores_gemma":[0.00042392896,0.000067846035,0.00008556313,0.00035849735,0.00009594455,0.00013054746,0.00018863325,0.00009004514,0.00015502355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022132729,0.00008403701,0.001491744,0.000008799844,0.00001465723,0.0000027099586,0.00018727512,7.1965144e-7,0.0010324729,0.99026763,0.005294671,0.0016130373],"study_design_scores_gemma":[0.00046885858,0.00006003171,0.0015535147,0.00022342968,0.0000055618116,0.0000041742655,0.0000067240308,0.00038149033,0.0035280667,0.9935156,0.00013990357,0.00011264046],"about_ca_topic_score_codex":0.000023269464,"about_ca_topic_score_gemma":7.69449e-7,"teacher_disagreement_score":0.007446856,"about_ca_system_score_codex":0.000023089304,"about_ca_system_score_gemma":0.00003307178,"threshold_uncertainty_score":0.2766681},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952481,0.00007813524,0.00064592477,0.0005521564,0.00195523,0.000080491474,0.0000035186538,0.00014015366,0.0012963199],"genre_scores_gemma":[0.99859136,0.0000070029387,0.0011428881,0.00006377757,8.3964676e-7,0.000004594077,6.0327494e-7,0.000006949235,0.00018200399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988509,0.00006435908,0.00022423256,0.0003227069,0.00030545972,0.00023237652],"domain_scores_gemma":[0.99877286,0.00018974332,0.00010153977,0.0007178076,0.00011358651,0.00010443889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027137867,0.00012520324,0.00017154969,0.00012549684,0.00007050222,0.000024605386,0.0004910011,0.000068776884,0.000014169519],"category_scores_gemma":[0.00008176022,0.000085191015,0.00009127566,0.00035250073,0.00008880634,0.0001803704,0.000157482,0.000078059486,0.0000540313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057698985,0.00017778637,0.00051664683,0.00000496758,0.00001259062,0.0000031534985,0.000054894183,0.0000019882666,0.0036178313,0.9882903,0.0019276981,0.0053863726],"study_design_scores_gemma":[0.00088393316,0.00024124177,0.0023744414,0.000059590882,0.0000038008286,0.0000032194268,0.0000021659137,0.00013086025,0.019929402,0.97615534,0.000086488566,0.00012952257],"about_ca_topic_score_codex":0.000018934596,"about_ca_topic_score_gemma":8.229992e-7,"teacher_disagreement_score":0.01631157,"about_ca_system_score_codex":0.000015471864,"about_ca_system_score_gemma":0.000039047147,"threshold_uncertainty_score":0.34739888},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9941423,0.000021599848,0.0017817544,0.00026936748,0.00054641935,0.00020082995,0.0000040803016,0.00008494304,0.0029487077],"genre_scores_gemma":[0.9980472,0.000004534382,0.0016301171,0.000005474279,0.000004019757,0.000012251324,6.736713e-7,0.000010114099,0.00028562205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869204,0.00014475218,0.00022910592,0.00030391655,0.00041405146,0.00021614168],"domain_scores_gemma":[0.9984931,0.0003556375,0.00013797001,0.000684899,0.00026674807,0.00006169614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035867584,0.0001031977,0.0001903024,0.00011687752,0.000037670365,0.000009609159,0.00052209664,0.000037364433,0.000024380273],"category_scores_gemma":[0.00035979235,0.00007611078,0.000059338523,0.000534951,0.00013904895,0.00031337005,0.00013986939,0.00007138995,0.00003536779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003208624,0.0001459346,0.0028363457,0.000013034526,0.000013559522,0.00000266144,0.00014830142,0.000002109831,0.022037933,0.95928156,0.00014400692,0.015342451],"study_design_scores_gemma":[0.00083371415,0.000118514195,0.01837453,0.00006146815,0.0000025664795,0.000005116852,0.0000044669423,0.00013175703,0.17544957,0.80488634,0.000026649712,0.00010530167],"about_ca_topic_score_codex":0.000009946957,"about_ca_topic_score_gemma":8.1992613e-7,"teacher_disagreement_score":0.15439524,"about_ca_system_score_codex":0.000047791593,"about_ca_system_score_gemma":0.000053957152,"threshold_uncertainty_score":0.31037074},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902263,0.000057589357,0.00041289194,0.0012612594,0.0007111781,0.00021636029,0.00000453564,0.00017292955,0.0069369446],"genre_scores_gemma":[0.9962557,0.00001554652,0.0013953808,0.000055832417,0.000008567953,0.000023876437,4.985563e-7,0.000034066714,0.0022105442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878067,0.00014348101,0.0002517962,0.00025783657,0.00021909206,0.00034711044],"domain_scores_gemma":[0.9983656,0.0008258423,0.0001109281,0.00056651345,0.000048526545,0.0000825977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000645721,0.00015954534,0.0002635405,0.000081492515,0.000038405215,0.000012015161,0.00023458875,0.00009232286,0.00014651247],"category_scores_gemma":[0.0010143812,0.000115043855,0.000053762353,0.00020508199,0.00009920085,0.00021196906,0.00010731162,0.0001259706,0.00017975303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020889504,0.0001263119,0.0039165206,0.000019654342,0.000009333082,0.000016593394,0.00023779208,1.9125186e-7,0.0014263296,0.99103814,0.002060549,0.0011276848],"study_design_scores_gemma":[0.001318036,0.000033894496,0.0015915455,0.00007828351,0.0000064729347,0.0000027739047,0.00009043891,0.0000025949635,0.003855477,0.9910844,0.001754205,0.00018185188],"about_ca_topic_score_codex":0.000014503868,"about_ca_topic_score_gemma":0.000045804063,"teacher_disagreement_score":0.006029375,"about_ca_system_score_codex":0.00017722463,"about_ca_system_score_gemma":0.00003470975,"threshold_uncertainty_score":0.46913522},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98589694,0.000047781185,0.010196688,0.001561072,0.00050277135,0.00046545343,0.00056547,0.00014595043,0.0006178522],"genre_scores_gemma":[0.9982614,0.000006309394,0.0010018188,0.000036771828,0.000026527774,0.0002576203,0.000036335816,0.000018849527,0.00035434728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919665,0.00005986686,0.00020590003,0.00019880485,0.000106360785,0.00023241455],"domain_scores_gemma":[0.99678105,0.0025110363,0.00008827586,0.00048338677,0.00008037518,0.00005589803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024548464,0.00013040547,0.0001487073,0.000023150982,0.00047830696,0.00003528223,0.0002676827,0.000047380974,0.000052106625],"category_scores_gemma":[0.00042995368,0.00007627707,0.00014551658,0.00017829138,0.00014010213,0.00009011467,0.00006169275,0.00006740514,0.000043280765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011538735,0.00008413457,0.00045255126,0.0000035367686,0.00004721249,1.91611e-7,0.00015284822,3.108471e-7,0.0032850143,0.98900586,0.006444517,0.0005122811],"study_design_scores_gemma":[0.0009074569,0.000023160801,0.00082321075,0.00003055654,0.00006117443,9.86144e-7,0.00023410405,0.000030777708,0.004380364,0.9906773,0.0027038383,0.00012705514],"about_ca_topic_score_codex":0.00002319327,"about_ca_topic_score_gemma":0.000008526224,"teacher_disagreement_score":0.012364457,"about_ca_system_score_codex":0.000028018503,"about_ca_system_score_gemma":0.00002024329,"threshold_uncertainty_score":0.36787987},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99064547,0.000096393414,0.000044013985,0.000015852707,0.00091873313,0.00012477205,0.000004352285,0.00011518835,0.008035223],"genre_scores_gemma":[0.9997272,0.000009093286,0.0000267268,0.0000044533303,0.000004516924,0.000022901397,6.465883e-7,0.000023720158,0.00018073338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992231,0.000064825355,0.000278765,0.00011229893,0.000108940236,0.0002120742],"domain_scores_gemma":[0.999488,0.00013216957,0.00003455884,0.00027543705,0.00002119828,0.000048665162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024221271,0.00011611938,0.00023050437,0.00006233306,0.000018047058,0.000007671053,0.00017957181,0.00008242514,0.00009516592],"category_scores_gemma":[0.00001896953,0.000093868424,0.00005314536,0.0001748916,0.000036872338,0.000103072016,0.000025774838,0.00008344038,0.000041607473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000335665,0.00013307475,0.19632451,0.00012351065,0.000074888914,0.000025777486,0.0010309217,0.00009644689,0.06687863,0.73069805,0.0021953103,0.0023853092],"study_design_scores_gemma":[0.002857385,0.000068644054,0.026493065,0.0007402051,0.00002402145,0.00002221541,0.0001781733,0.0005180867,0.06648866,0.9006729,0.0014187177,0.0005179093],"about_ca_topic_score_codex":0.000029894398,"about_ca_topic_score_gemma":0.000011274332,"teacher_disagreement_score":0.16997486,"about_ca_system_score_codex":0.000036181013,"about_ca_system_score_gemma":0.000007216756,"threshold_uncertainty_score":0.38278434},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91757727,0.00008892866,0.058974564,0.0012131946,0.00430894,0.00020727572,0.0000014561595,0.0004270345,0.017201345],"genre_scores_gemma":[0.9977707,0.000010299352,0.0005852318,0.00018728197,0.000022805967,0.00001753262,2.8466104e-7,0.0000146500815,0.0013911594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988983,0.00006313667,0.00017952285,0.0003257907,0.00023529465,0.00029792497],"domain_scores_gemma":[0.9990302,0.00012282954,0.00005957813,0.0005652634,0.0001191639,0.0001030062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021720237,0.00014254508,0.0001743342,0.000068406574,0.00012484567,0.00011859377,0.0005645954,0.00006069167,0.00003140461],"category_scores_gemma":[0.000020812842,0.0000856726,0.000046084842,0.00029543648,0.000038086044,0.0005283077,0.00012603473,0.00008239218,0.00021250182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009738908,0.000036754645,0.0040478976,0.0000055441596,0.000026425609,0.000031095486,0.00017881978,0.000015309997,0.0012880297,0.9865632,0.0017809503,0.006016199],"study_design_scores_gemma":[0.013094229,0.0030794905,0.022738326,0.0016987156,0.000060817612,0.0018007976,0.0004090564,0.02307763,0.01702687,0.54750514,0.3660574,0.0034515646],"about_ca_topic_score_codex":0.000042148324,"about_ca_topic_score_gemma":0.000012582125,"teacher_disagreement_score":0.43905813,"about_ca_system_score_codex":0.000058351823,"about_ca_system_score_gemma":0.000047884347,"threshold_uncertainty_score":0.34936273},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925385,0.00021661217,0.0001820587,0.00062122924,0.0052256268,0.00060697267,0.000020043646,0.00008241737,0.00050650176],"genre_scores_gemma":[0.99845886,0.00014490192,0.00035645132,0.00003812956,0.00003179242,0.000040628274,8.420464e-7,0.00006640586,0.000862013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756104,0.0002619231,0.0007593557,0.00035393581,0.00059784023,0.00046593137],"domain_scores_gemma":[0.9938417,0.0039403564,0.00058877823,0.0012622143,0.00023233397,0.0001346288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075018185,0.00033331822,0.00052210176,0.00004725381,0.0004767578,0.000058648966,0.00084997574,0.00015393509,0.00003508398],"category_scores_gemma":[0.00271791,0.00015976695,0.00017003817,0.00024438946,0.00048291695,0.00017480954,0.0005887104,0.00020354953,0.000021706755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065231914,0.000131776,0.0010127557,0.000045930232,0.00005124034,0.000002356492,0.00019706931,4.1769816e-8,0.0035674642,0.98849714,0.0036497156,0.0027792586],"study_design_scores_gemma":[0.0021476718,0.00011263281,0.004785465,0.00018467444,0.00006575356,0.000013854305,0.000054526605,0.000081818165,0.0055163978,0.9848942,0.0018923341,0.00025066378],"about_ca_topic_score_codex":0.000011665777,"about_ca_topic_score_gemma":0.0000067065,"teacher_disagreement_score":0.005920298,"about_ca_system_score_codex":0.00011623992,"about_ca_system_score_gemma":0.00010085468,"threshold_uncertainty_score":0.6515107},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9264531,0.00006149385,0.0060757785,0.00073409267,0.0073910453,0.0007278661,0.000025709845,0.00043900163,0.05809188],"genre_scores_gemma":[0.99256366,0.0000111019535,0.0029077677,0.000039469523,0.000033785524,0.00001746055,7.098573e-7,0.000059243204,0.0043667937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982533,0.00008093241,0.00052355055,0.00027226759,0.00052945485,0.00034048656],"domain_scores_gemma":[0.99589866,0.0028280772,0.0002715858,0.0007054947,0.0001331593,0.00016300597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034357185,0.000239246,0.00050909416,0.00009467563,0.00006529148,0.000017549555,0.00039762162,0.000132238,0.0003682148],"category_scores_gemma":[0.0034160935,0.00016570355,0.00014787765,0.0002054296,0.00021151213,0.00021131513,0.00013287793,0.00012751065,0.00018505706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008983071,0.00024697854,0.000028378998,0.00006699585,0.0000460146,0.000005944933,0.00017503554,1.3459479e-7,0.0011118356,0.9842122,0.0134520745,0.0005645608],"study_design_scores_gemma":[0.0025930344,0.00027635318,0.000013421934,0.00024103448,0.000031071926,0.000003794488,0.000037304937,0.0000017453826,0.021986248,0.97391933,0.00068486726,0.00021182034],"about_ca_topic_score_codex":0.0000030366418,"about_ca_topic_score_gemma":5.405022e-7,"teacher_disagreement_score":0.06611054,"about_ca_system_score_codex":0.000108132444,"about_ca_system_score_gemma":0.00008504437,"threshold_uncertainty_score":0.67571944},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9931865,0.00010124313,0.00017756109,0.00026253465,0.0010373768,0.000182136,0.000009496621,0.00009892462,0.004944237],"genre_scores_gemma":[0.9973918,0.000043082953,0.0011841923,0.000031652366,0.000017941136,0.000010628805,0.0000012058836,0.000034684,0.0012848072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986022,0.00007061601,0.00042154256,0.0002686006,0.00032279853,0.00031424628],"domain_scores_gemma":[0.99849916,0.0003476766,0.00022799663,0.00068199454,0.00013630744,0.00010685662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044838004,0.00018182927,0.00037400163,0.00010015245,0.00007095295,0.000015249774,0.00032385782,0.000121468736,0.00011107891],"category_scores_gemma":[0.00039614984,0.00013095493,0.00015391153,0.00018818166,0.00014619606,0.00016216138,0.00010788611,0.00009977806,0.000048913782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016773169,0.00015277357,0.004186547,0.00007907053,0.000045795514,0.000008234057,0.00015627983,3.1848096e-8,0.0036378643,0.9844858,0.005186887,0.0020439574],"study_design_scores_gemma":[0.0009773774,0.000086609216,0.0033652447,0.00012797167,0.000029906598,0.000009312079,0.00003383509,0.000001637402,0.027374238,0.9664442,0.0013682159,0.00018143345],"about_ca_topic_score_codex":0.00003695604,"about_ca_topic_score_gemma":0.000013173726,"teacher_disagreement_score":0.023736374,"about_ca_system_score_codex":0.000042170523,"about_ca_system_score_gemma":0.000041972773,"threshold_uncertainty_score":0.5340187},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8600106,0.000041633983,0.000005524322,0.009647403,0.0015584957,0.00012615423,0.0000021299134,0.000070091686,0.12853797],"genre_scores_gemma":[0.9990061,0.000037194244,0.000022293552,0.0002835977,0.00006242528,0.000020034311,6.459199e-7,0.00000919805,0.00055852375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986372,0.00048564526,0.00015177058,0.00017669068,0.00019037831,0.00035831193],"domain_scores_gemma":[0.998858,0.00079134415,0.000037313064,0.00015251586,0.000052019364,0.00010884676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011046479,0.00007407875,0.00013117709,0.00006857074,0.00013194853,0.000012151208,0.0002397176,0.0001479949,0.00012496798],"category_scores_gemma":[0.0015161249,0.000059398735,0.000042215244,0.00016535842,0.0006017503,0.00020376236,0.00004338409,0.00009209478,0.00035293945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000597546,0.00005304873,0.0058386656,0.0000012811192,0.000003156696,0.0000036015003,0.0010613488,1.6318198e-8,0.00029445448,0.99102837,0.00020979416,0.0015003172],"study_design_scores_gemma":[0.00059466454,0.000025187888,0.012022788,0.000014905797,0.000002574097,2.4071977e-7,0.00035638004,5.682894e-7,0.00014410586,0.9830686,0.0036749996,0.00009501492],"about_ca_topic_score_codex":0.00019788336,"about_ca_topic_score_gemma":0.00004796759,"teacher_disagreement_score":0.1389955,"about_ca_system_score_codex":0.00032410832,"about_ca_system_score_gemma":0.00007662607,"threshold_uncertainty_score":0.453644},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99614733,0.000025931799,0.00010233832,0.0009705095,0.0002627668,0.0003972857,0.000023505301,0.0000736091,0.0019967316],"genre_scores_gemma":[0.99974084,0.000016723308,0.000047925518,0.00004022421,0.0000069695902,0.00004864585,6.4094445e-7,0.00002279706,0.00007521046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876493,0.00021646076,0.00024177994,0.00030741768,0.00020475981,0.00026466366],"domain_scores_gemma":[0.99519295,0.0038362078,0.00017744908,0.00065147714,0.00005719191,0.00008472167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076665095,0.00020002617,0.00029187676,0.00007956666,0.00020481487,0.000020932823,0.00026647447,0.00010094452,0.00006544141],"category_scores_gemma":[0.0006181845,0.00012227624,0.00011798269,0.00028145174,0.00032380834,0.00011710629,0.000058672493,0.00019542173,0.000009965445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047382153,0.00032230045,0.010099187,0.000019395036,0.000056550714,0.0000017888638,0.00015267487,1.3758167e-7,0.0029046969,0.98509926,0.0005930155,0.00070359895],"study_design_scores_gemma":[0.000803768,0.00012236246,0.0273219,0.000046996367,0.000031250427,0.000007104168,0.00005373551,0.000009393445,0.021805862,0.94956475,0.00007046602,0.00016241286],"about_ca_topic_score_codex":0.000042519372,"about_ca_topic_score_gemma":0.000039308026,"teacher_disagreement_score":0.035534523,"about_ca_system_score_codex":0.000031716325,"about_ca_system_score_gemma":0.000031717092,"threshold_uncertainty_score":0.49862805},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.995086,0.00012812464,0.00024314795,0.002232839,0.0014008196,0.0001634941,0.000013875148,0.00004937095,0.0006823078],"genre_scores_gemma":[0.9975423,0.000084904015,0.00006376425,0.00008626679,0.000060891627,0.000015997355,0.0000013380052,0.00002414121,0.0021203668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989753,0.00011868681,0.00031883697,0.00021185861,0.00016681393,0.00020855009],"domain_scores_gemma":[0.9974255,0.0018247036,0.00021350611,0.00039311254,0.00006525173,0.000077952805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003990353,0.0001451582,0.00028297334,0.000043637927,0.00012768574,0.000036627807,0.00017045066,0.00008781005,0.00007984952],"category_scores_gemma":[0.00033150573,0.00008271121,0.00007678622,0.00008800816,0.000267842,0.00013774351,0.000085380336,0.000112445705,0.000048265123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024240822,0.00015810148,0.005157379,0.000038989732,0.00008227154,0.0000019574945,0.00021299477,8.4179135e-8,0.0014889373,0.9864315,0.0054101157,0.0009934672],"study_design_scores_gemma":[0.0010487029,0.00012876301,0.062379155,0.0000955558,0.00011616842,0.0000070188316,0.00033518785,0.000024812194,0.00080612005,0.9320896,0.0027786712,0.00019024518],"about_ca_topic_score_codex":0.000010933631,"about_ca_topic_score_gemma":0.000010134385,"teacher_disagreement_score":0.057221778,"about_ca_system_score_codex":0.00002307853,"about_ca_system_score_gemma":0.00003163265,"threshold_uncertainty_score":0.33728653},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75780565,0.00009557761,0.2386112,0.00055940525,0.0009375972,0.0005717242,0.00003479621,0.00015906006,0.0012250093],"genre_scores_gemma":[0.99485487,0.00001573813,0.0048823687,0.000037299644,0.0000029431133,0.00006593145,0.0000018712564,0.000011607004,0.00012739793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876297,0.00007061003,0.00022988598,0.00033073316,0.00026051674,0.00034526084],"domain_scores_gemma":[0.99823904,0.00058572163,0.000119439326,0.000692594,0.00026882542,0.00009435739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045820756,0.000115478084,0.00019178467,0.00015179123,0.00010047368,0.000020536841,0.00090653653,0.00006329551,0.000011296093],"category_scores_gemma":[0.0001904466,0.00008588544,0.000115093906,0.00038787932,0.00015561913,0.0004656093,0.00019593968,0.00006421858,0.000018057623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021593341,0.00005350154,0.00093973405,0.000012774095,0.000016395825,0.0000011801754,0.00003979164,7.9325883e-7,0.022157744,0.96413994,0.00048800235,0.012128574],"study_design_scores_gemma":[0.0011291615,0.00023557962,0.004402307,0.000025270398,0.0000031728887,0.0000030196154,0.000004651573,0.00015643389,0.059982218,0.93337554,0.0005674749,0.00011514687],"about_ca_topic_score_codex":0.000005934777,"about_ca_topic_score_gemma":0.0000019223448,"teacher_disagreement_score":0.23704922,"about_ca_system_score_codex":0.000046100005,"about_ca_system_score_gemma":0.000055414028,"threshold_uncertainty_score":0.35023066},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85526216,0.00007386926,0.121804535,0.0047228895,0.0023123643,0.0008331688,0.000016823285,0.000238379,0.014735812],"genre_scores_gemma":[0.51786447,0.0000102671565,0.47530726,0.00027588653,0.000037117636,0.000030744373,7.4568555e-7,0.00006170104,0.00641179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862945,0.00017314225,0.00033182895,0.0002663212,0.00032694172,0.0002722923],"domain_scores_gemma":[0.99740326,0.0013114548,0.00016228891,0.00087935233,0.00015537158,0.00008828223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006413433,0.00016322212,0.00031110336,0.00003848899,0.00008833653,0.000011414141,0.00051887997,0.000085180574,0.000114107665],"category_scores_gemma":[0.00040886068,0.000099100056,0.0001046471,0.00030228618,0.00007651495,0.000105023355,0.00028391607,0.00011584552,0.00014042768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013966528,0.00007051159,0.00052225735,0.000023030863,0.00004628693,0.000004271099,0.00020050214,8.327391e-7,0.0027562722,0.98442996,0.008638932,0.0032931843],"study_design_scores_gemma":[0.0006351401,0.00003651284,0.00028983437,0.00008539466,0.000028614233,0.000015399337,0.000034251338,0.000008181412,0.019300323,0.9614224,0.017996581,0.00014735668],"about_ca_topic_score_codex":0.000009257197,"about_ca_topic_score_gemma":0.000002117892,"teacher_disagreement_score":0.35350272,"about_ca_system_score_codex":0.0000817138,"about_ca_system_score_gemma":0.000027060623,"threshold_uncertainty_score":0.4041183},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99338365,0.000056887202,0.0006730392,0.00092737295,0.000099852536,0.00023977361,0.00002385218,0.00003715411,0.0045584366],"genre_scores_gemma":[0.9993333,0.000024752104,0.00014555224,0.000033259654,0.0000029256905,0.00003684644,6.199267e-7,0.000014771328,0.00040793366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993568,0.00004787831,0.00014113415,0.00016882292,0.00013253938,0.0001528152],"domain_scores_gemma":[0.99865407,0.0007237133,0.00010867637,0.00043148894,0.000034905544,0.000047166115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001812913,0.00011491102,0.00014905477,0.000024686684,0.00012124905,0.000012168638,0.00018259256,0.00003145576,0.000023242865],"category_scores_gemma":[0.00007490123,0.00005808185,0.000037061585,0.00017403615,0.00031305,0.000051947005,0.00001730961,0.00007745525,0.0000058326846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053740132,0.00009795677,0.0015997142,0.000015808924,0.000022609704,0.0000012783868,0.00016176014,4.8571696e-8,0.0002894338,0.9963827,0.001152074,0.00022286763],"study_design_scores_gemma":[0.00051186956,0.00008880605,0.001331273,0.00009784674,0.000018936744,0.000002609933,0.00005092029,0.0000017883415,0.006313332,0.9905617,0.00092209043,0.00009882842],"about_ca_topic_score_codex":0.0000016473296,"about_ca_topic_score_gemma":0.000017591325,"teacher_disagreement_score":0.006023898,"about_ca_system_score_codex":0.00001385261,"about_ca_system_score_gemma":0.0000118766175,"threshold_uncertainty_score":0.2368509},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9951828,0.00021286609,0.0023393517,0.0008150864,0.0005753703,0.00020791923,0.0000016299408,0.00010388408,0.0005610583],"genre_scores_gemma":[0.9972426,0.0000891977,0.0022899427,0.000056062414,0.0000018679759,0.000039344995,7.4726296e-7,0.000011366554,0.00026884375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855417,0.00017884508,0.0001975716,0.00041744698,0.0002931017,0.00035888667],"domain_scores_gemma":[0.9990535,0.00024169282,0.00005461149,0.0004550618,0.00008297286,0.000112197245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050409726,0.00013644935,0.00016694468,0.000355244,0.00008387386,0.000064860964,0.0004537739,0.00006869657,0.000014991441],"category_scores_gemma":[0.00010736498,0.00010276107,0.00004646547,0.00073176995,0.00014054065,0.0007416592,0.00026128057,0.000108698914,0.000020486923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017493452,0.000046027395,0.0056796474,0.000003755241,0.0000072617772,0.000015363015,0.00013819546,8.9559427e-7,0.005605901,0.97231895,0.00014620951,0.016020311],"study_design_scores_gemma":[0.002081664,0.00007374724,0.020062175,0.000020790028,0.000001391461,0.0000116242745,0.000007856414,0.0002880038,0.003376858,0.9737922,0.0001239712,0.00015973086],"about_ca_topic_score_codex":0.000016040172,"about_ca_topic_score_gemma":0.000008553998,"teacher_disagreement_score":0.01586058,"about_ca_system_score_codex":0.000040514286,"about_ca_system_score_gemma":0.00002825425,"threshold_uncertainty_score":0.41904747},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94113874,0.000076396405,0.045664333,0.007728248,0.002029861,0.0003276198,0.0000063840207,0.00008967431,0.002938748],"genre_scores_gemma":[0.998731,0.000006666196,0.00090965925,0.00012709112,0.000004621802,0.000030579773,2.248747e-7,0.000010165683,0.0001799851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984998,0.00023739082,0.00018050692,0.0002978511,0.00047603442,0.0003083817],"domain_scores_gemma":[0.9964766,0.0024787716,0.000044851513,0.00074966194,0.00017076284,0.0000793418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058640906,0.00011454318,0.00013752213,0.00013370375,0.00012853311,0.00005590208,0.00070688355,0.000052896787,0.0000524093],"category_scores_gemma":[0.0009562758,0.00006346604,0.000098879726,0.00040660604,0.00036801433,0.00040573033,0.00016643049,0.00012761296,0.00009272629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022703874,0.00009542085,0.0002721036,0.0000041003723,0.000011143665,0.000003829729,0.00011761028,2.6233977e-7,0.007824438,0.98494136,0.00049658073,0.0062104496],"study_design_scores_gemma":[0.0004592304,0.00024862093,0.002928366,0.000040838637,0.0000027324536,0.000004597766,0.000012256617,0.00015430577,0.030930659,0.9650084,0.00011112323,0.00009886981],"about_ca_topic_score_codex":0.0000028028867,"about_ca_topic_score_gemma":4.2043837e-7,"teacher_disagreement_score":0.05759227,"about_ca_system_score_codex":0.000041917585,"about_ca_system_score_gemma":0.00003651917,"threshold_uncertainty_score":0.258807},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99083894,0.00034016813,0.00029640357,0.002827363,0.00034516345,0.00034297956,0.000009919335,0.000025723119,0.0049733184],"genre_scores_gemma":[0.9980572,0.000094955954,0.0005774822,0.00005262004,0.000009567294,0.000029801362,1.6814194e-7,0.000008907145,0.001169283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994032,0.00007777294,0.00023635008,0.000097104145,0.0000870876,0.00009848672],"domain_scores_gemma":[0.99743366,0.002170906,0.00010805834,0.00020061879,0.00004590741,0.000040836338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046284407,0.00007855002,0.00023893359,0.000028778031,0.000083109815,0.000018950415,0.000055795037,0.000040389456,0.00017399025],"category_scores_gemma":[0.0006798917,0.000038380687,0.00003671419,0.00004692948,0.00018277863,0.00005271476,0.000047706133,0.000037445647,0.0000088426095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044250064,0.00004656642,0.0004214191,0.000031914627,0.000055587567,2.0913721e-7,0.0002080104,4.825784e-9,0.00091572,0.9924929,0.0044598323,0.0013235947],"study_design_scores_gemma":[0.002120117,0.00003864396,0.0006454153,0.000056317323,0.0000790305,0.0000043225446,0.0000603772,0.000007877772,0.0017405791,0.9915671,0.0036163128,0.00006392072],"about_ca_topic_score_codex":0.000023518814,"about_ca_topic_score_gemma":0.000005547753,"teacher_disagreement_score":0.007218254,"about_ca_system_score_codex":0.00000796116,"about_ca_system_score_gemma":0.000011384822,"threshold_uncertainty_score":0.19050713},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99355006,0.00009504925,0.0026821562,0.0005733764,0.0012902196,0.0001650284,0.0000068406034,0.0002030572,0.0014341837],"genre_scores_gemma":[0.9964068,0.0000046495047,0.0033930936,0.000058805443,0.0000017731073,0.000010776174,0.0000013858909,0.000015177074,0.00010756567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981873,0.00009980692,0.000348341,0.0005260403,0.00043529202,0.000403223],"domain_scores_gemma":[0.9981906,0.00025683752,0.00019253974,0.0009319357,0.00026657482,0.00016150878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000596844,0.00020264932,0.0002806252,0.00009887799,0.0001418087,0.00007453608,0.0006226442,0.00007931346,0.000020863612],"category_scores_gemma":[0.00022706727,0.00012653123,0.00010005017,0.00052625494,0.00015933896,0.00041543553,0.00025104478,0.00013399024,0.000019977258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019837142,0.00019310378,0.055362098,0.00002285163,0.000029096378,0.000014763327,0.00017901731,0.000005801908,0.0029339737,0.93690765,0.0003571878,0.0039746114],"study_design_scores_gemma":[0.0014725985,0.00022787758,0.030170064,0.00013223606,0.0000105184845,0.000014592462,0.0000077033865,0.0002967997,0.00672326,0.96055734,0.00011281862,0.00027419298],"about_ca_topic_score_codex":0.00007737659,"about_ca_topic_score_gemma":0.0000063770194,"teacher_disagreement_score":0.025192032,"about_ca_system_score_codex":0.000031308417,"about_ca_system_score_gemma":0.000074249096,"threshold_uncertainty_score":0.51597935},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9955073,0.00014961493,0.00051409873,0.0011264174,0.0010941037,0.0001759627,0.0000063394905,0.00016652187,0.0012596545],"genre_scores_gemma":[0.99847937,0.00001690509,0.0010848946,0.00012954608,8.5907845e-7,0.000010550421,0.0000014157678,0.000012500206,0.00026395678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983567,0.00010667511,0.00026831118,0.00045782988,0.0004861303,0.00032435358],"domain_scores_gemma":[0.9983441,0.0002550215,0.00016819015,0.0008883085,0.00018825626,0.00015609001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032906618,0.00019777591,0.0002689205,0.00016637518,0.00010324211,0.000043534623,0.00070033554,0.00008094811,0.000028327639],"category_scores_gemma":[0.00006025291,0.00012181248,0.00007831098,0.0004077005,0.00016321875,0.00020844398,0.0001580007,0.00011578286,0.00003424577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027532566,0.00024529433,0.002919926,0.000010150595,0.000033690274,0.000009774061,0.00010776682,0.000002594985,0.0019389685,0.98846704,0.0017095406,0.004527746],"study_design_scores_gemma":[0.0018223388,0.00071686885,0.003742945,0.0001580359,0.000011572934,0.0000066211455,0.00001644973,0.0001192392,0.038422447,0.95456636,0.00018026185,0.00023683514],"about_ca_topic_score_codex":0.00007083764,"about_ca_topic_score_gemma":0.000007574387,"teacher_disagreement_score":0.036483478,"about_ca_system_score_codex":0.000024183792,"about_ca_system_score_gemma":0.00008525183,"threshold_uncertainty_score":0.49673688},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99744934,0.00009274303,0.000014877144,0.000067768575,0.00026684237,0.00006148435,0.000006157769,0.000014420186,0.0020263745],"genre_scores_gemma":[0.99907345,0.00009714796,0.00066201325,0.000061491104,0.0000069640487,0.0000022505496,0.000006505185,0.0000054074603,0.000084746],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994874,0.000039605024,0.00013024634,0.00017685095,0.000045473975,0.00012042139],"domain_scores_gemma":[0.9997304,0.000018038447,0.00006123043,0.00011845627,0.000035773137,0.00003607178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011193823,0.000073768846,0.00009462375,0.000011389198,0.000041130585,0.0000047112803,0.000068807116,0.00006378993,0.0000490038],"category_scores_gemma":[0.000014242621,0.00004930801,0.000036222893,0.00004067021,0.00007291731,0.0000030433262,0.000068341236,0.000024244442,0.000004503146],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005390349,0.000078147736,0.39549515,0.00001585295,0.0000874126,0.0000010136971,0.000022692597,1.3462733e-7,0.5439487,0.04251472,0.0013544906,0.016427772],"study_design_scores_gemma":[0.003974712,0.0009312202,0.04761166,0.00009777596,0.000050303766,0.000121082325,0.0001341698,0.000022419488,0.49917364,0.42522252,0.022101263,0.0005592336],"about_ca_topic_score_codex":0.000012309466,"about_ca_topic_score_gemma":0.0000017338338,"teacher_disagreement_score":0.38270777,"about_ca_system_score_codex":0.000005088726,"about_ca_system_score_gemma":0.000009233398,"threshold_uncertainty_score":0.20107223},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959719,0.00020850977,0.0003649899,0.00016253517,0.0010386425,0.00011797686,0.0000030308718,0.00005116804,0.0020812063],"genre_scores_gemma":[0.9992174,0.000029732784,0.00019224969,0.00022814919,0.000060554805,0.00000809698,0.0000063305324,0.00002121119,0.00023628723],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99870175,0.000106764026,0.00021293771,0.00049571786,0.000112812806,0.00037004243],"domain_scores_gemma":[0.99928236,0.0001739713,0.00012026731,0.00025964822,0.000049482667,0.00011427776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003198116,0.00021124764,0.00019795528,0.000034033015,0.00021389606,0.000035348283,0.00017939416,0.0001148546,0.000010561503],"category_scores_gemma":[0.0006378522,0.00014135469,0.00007413668,0.00008456313,0.000096754025,0.00000530209,0.00009272628,0.00012995114,0.00001754106],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049663093,0.00004726436,0.01751054,0.0000076136457,0.000029584515,0.000005662279,0.000025258287,0.0000013910677,0.957611,0.0016137782,0.00020862653,0.022889586],"study_design_scores_gemma":[0.0009878944,0.0007558561,0.005119956,0.00010631062,0.000013690558,0.00004828899,0.000076449374,0.000005565479,0.9721106,0.017724702,0.0026677414,0.00038290748],"about_ca_topic_score_codex":0.000011247818,"about_ca_topic_score_gemma":0.000008499145,"teacher_disagreement_score":0.022506678,"about_ca_system_score_codex":0.000021000973,"about_ca_system_score_gemma":0.00001842463,"threshold_uncertainty_score":0.57642764},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93713427,0.0003414396,0.055195257,0.0012465116,0.0013610024,0.0002959611,0.000009027063,0.00027695415,0.004139591],"genre_scores_gemma":[0.9952578,0.000034241475,0.004276137,0.000025494965,0.000003860957,0.000011992625,3.6145417e-7,0.000012362581,0.00037774644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848235,0.0001323452,0.0002292836,0.00035336948,0.00043591883,0.00036673876],"domain_scores_gemma":[0.99819714,0.00032108877,0.00010746594,0.0010654876,0.00017514582,0.0001336951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040392755,0.00012825723,0.00019382927,0.00019624353,0.00006864538,0.00002701257,0.0013307657,0.000057978257,0.000029686898],"category_scores_gemma":[0.00015836215,0.00009053093,0.000096536554,0.0007135487,0.00018792869,0.00052744045,0.0003239715,0.00009451056,0.000047526253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011232641,0.00007352384,0.0013370254,0.0000062055806,0.000017468083,0.000009372905,0.000071693816,5.451423e-7,0.009831084,0.9682527,0.0003245463,0.02006458],"study_design_scores_gemma":[0.0007838492,0.00018082945,0.0018052659,0.000037160145,0.0000022017055,0.0000042414904,0.000007767644,0.00005788779,0.03824861,0.95789146,0.00085339684,0.00012732552],"about_ca_topic_score_codex":0.0000062120002,"about_ca_topic_score_gemma":0.0000010228883,"teacher_disagreement_score":0.058123544,"about_ca_system_score_codex":0.00003179323,"about_ca_system_score_gemma":0.000061104634,"threshold_uncertainty_score":0.3691744},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99231,0.00014090599,2.1933155e-7,0.0043799262,0.00056351256,0.00006790685,0.000009924638,0.000020943718,0.002506699],"genre_scores_gemma":[0.99912304,0.0004142162,0.0000057087577,0.000055949196,0.000012974507,0.000008539152,9.0056653e-7,3.8966186e-7,0.00037831467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999342,0.000050411,0.00014628454,0.00012220525,0.00011396274,0.00022512047],"domain_scores_gemma":[0.9992898,0.00049737305,0.00006275777,0.000048156646,0.000059813367,0.000042059728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020596075,0.00006782065,0.00013260315,0.0000011696343,0.00021844795,0.000010859539,0.00021156811,0.00005390257,0.0004029696],"category_scores_gemma":[0.000095284464,0.000013583986,0.000059568993,0.00009556803,0.00014738266,0.000026425654,0.000100239566,0.000034230885,0.00006944751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013616489,0.000071702256,0.40864965,0.0000023482328,0.000046859655,0.0000059400645,0.000032100088,4.4883905e-8,0.014326843,0.45956442,0.011065774,0.10609816],"study_design_scores_gemma":[0.00038704605,0.0006265072,0.40633932,0.000010162141,0.000007909524,0.000007122142,0.00009088423,3.246614e-7,0.0029188972,0.41743582,0.1720424,0.00013361876],"about_ca_topic_score_codex":0.000055325894,"about_ca_topic_score_gemma":0.000105284984,"teacher_disagreement_score":0.16097662,"about_ca_system_score_codex":0.000023995593,"about_ca_system_score_gemma":0.0000025789127,"threshold_uncertainty_score":0.44122347},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9591375,0.00045158868,0.026121171,0.0005776614,0.00044352093,0.00045801324,0.000008992287,0.00019823256,0.012603307],"genre_scores_gemma":[0.9939296,0.000062587445,0.004659314,0.000039452047,0.0000022493123,0.00003584699,6.6313527e-7,0.000023407361,0.0012468724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760777,0.000099745324,0.00025962127,0.0005409334,0.0005299534,0.0009619916],"domain_scores_gemma":[0.9981521,0.0003956064,0.0001437955,0.0008629665,0.00023198556,0.00021358104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090220006,0.00021321379,0.0003198169,0.00021365038,0.00029030876,0.00012263059,0.0010257405,0.00007536975,0.000029302491],"category_scores_gemma":[0.00009646874,0.00014885112,0.00005010962,0.00080669933,0.0004272757,0.0011551661,0.0010782134,0.000149314,0.000017291584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007914269,0.00008180894,0.00475227,0.000032746586,0.000033937697,0.000027775784,0.000101719146,0.0000015526032,0.0096164495,0.98198754,0.00013501533,0.0031500172],"study_design_scores_gemma":[0.0018778226,0.00064419064,0.00093291956,0.000093830284,0.000006583234,0.000023489034,0.000022633283,0.00007401385,0.024519559,0.9703516,0.0012140125,0.00023934306],"about_ca_topic_score_codex":0.000048559894,"about_ca_topic_score_gemma":0.000014930776,"teacher_disagreement_score":0.034792095,"about_ca_system_score_codex":0.000072111296,"about_ca_system_score_gemma":0.00011506731,"threshold_uncertainty_score":0.60699725},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99555343,0.00018372416,0.00017965301,0.0000125292,0.0013754194,0.00017297891,0.000010686971,0.0002457893,0.002265758],"genre_scores_gemma":[0.99965596,0.000015339963,0.00021351651,0.000002316498,0.0000064591613,0.000022803652,0.0000023090697,0.00002692309,0.00005439426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927473,0.00004767133,0.00021012881,0.00014410361,0.0001285125,0.00019487247],"domain_scores_gemma":[0.9994315,0.000090921945,0.00004011441,0.0002849542,0.00008654495,0.00006598558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101435406,0.00014599708,0.00020581088,0.000099509976,0.000034645444,0.000008625569,0.00012612158,0.00008658293,0.00006121624],"category_scores_gemma":[0.000023496237,0.00009863576,0.00005415031,0.0002289327,0.00013082125,0.00015527605,0.000010857497,0.00006718669,0.000019078176],"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.00011805567,0.000071106195,0.053812023,0.00014153053,0.00028197706,0.000008274498,0.0006372371,0.00007192797,0.10673933,0.8332017,0.00080909,0.0041077584],"study_design_scores_gemma":[0.014583679,0.0008008991,0.0703581,0.001282786,0.00021364413,0.00013914911,0.0009170148,0.0011561532,0.5768048,0.32635304,0.0057060774,0.0016846446],"about_ca_topic_score_codex":0.000015151794,"about_ca_topic_score_gemma":0.000009200985,"teacher_disagreement_score":0.50684863,"about_ca_system_score_codex":0.000019237254,"about_ca_system_score_gemma":0.000011260381,"threshold_uncertainty_score":0.402225},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7967454,0.0016619661,0.19143915,0.001175133,0.0013049595,0.00043530014,0.000030401514,0.00018178794,0.0070259073],"genre_scores_gemma":[0.9934491,0.00007575236,0.006021109,0.000011960893,0.0000019765746,0.000013967477,3.0219675e-7,0.000012578623,0.00041328484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982891,0.000108127184,0.0003689584,0.00036910866,0.00053099124,0.00033368883],"domain_scores_gemma":[0.9976327,0.0005553792,0.00023971632,0.001180199,0.0003022541,0.0000897774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004658311,0.00013921778,0.00029178738,0.00015839418,0.000059074486,0.000014391231,0.0014481515,0.000056312587,0.00001246322],"category_scores_gemma":[0.0002513865,0.000102259575,0.00010442929,0.00089542754,0.0004152746,0.00049331377,0.00027782586,0.00009515388,0.00001068262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042448286,0.00007648657,0.009253885,0.000037893537,0.000017565038,0.0000050471845,0.00005040076,5.716284e-7,0.014092723,0.973397,0.00043105174,0.0025949073],"study_design_scores_gemma":[0.00061782164,0.00009418692,0.0094170645,0.00012777868,0.0000025386764,8.403252e-7,0.0000057861243,0.000020359304,0.049836025,0.9389139,0.00084029575,0.0001234216],"about_ca_topic_score_codex":0.000004608069,"about_ca_topic_score_gemma":0.00002926916,"teacher_disagreement_score":0.19670367,"about_ca_system_score_codex":0.00003699532,"about_ca_system_score_gemma":0.00007764306,"threshold_uncertainty_score":0.41700244},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97201896,0.0003623159,0.00013591052,0.011604058,0.008271302,0.00021630392,0.000011136878,0.00063877786,0.0067412164],"genre_scores_gemma":[0.996226,0.000047363923,0.0007888266,0.00088189193,0.000005742039,0.0000068459817,0.0000016894213,0.00001438235,0.0020272734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983179,0.00008266242,0.0002888778,0.0005498234,0.0003628896,0.00039786543],"domain_scores_gemma":[0.99840873,0.00021412424,0.00007420383,0.0010275828,0.00010788944,0.00016746004],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044772783,0.00017682432,0.00017081192,0.00014115355,0.00012002563,0.00008458077,0.00076530053,0.00008534898,0.000010603929],"category_scores_gemma":[0.00012696319,0.00011632167,0.00007786761,0.0003014098,0.00007174283,0.0004437013,0.00021235656,0.00011783246,0.0014784721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016308393,0.00010208167,0.00013711826,0.0000025716724,0.000008359168,0.000017303042,0.000092998795,0.0000016177227,0.0031210198,0.9655053,0.02830014,0.0026952068],"study_design_scores_gemma":[0.0019947055,0.00025769186,0.00088675594,0.00006767919,0.0000032517266,0.0000048953007,0.0000026670289,0.00013478663,0.0077645946,0.980904,0.007753536,0.00022547865],"about_ca_topic_score_codex":0.00001685267,"about_ca_topic_score_gemma":7.712454e-7,"teacher_disagreement_score":0.024207005,"about_ca_system_score_codex":0.000041896357,"about_ca_system_score_gemma":0.00005271358,"threshold_uncertainty_score":0.999299},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99151826,0.00003998512,0.00002466484,0.0019238951,0.0002764752,0.00030857316,0.00002096762,0.00006705771,0.0058201095],"genre_scores_gemma":[0.99866474,0.00001843212,0.00026749508,0.00010542244,0.000011266936,0.00006953933,0.00000195969,0.00002216333,0.0008390064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904025,0.00011461748,0.00025256322,0.00018868003,0.00018837502,0.00021549912],"domain_scores_gemma":[0.99838096,0.00074468285,0.00013248244,0.0006307309,0.000054156248,0.00005696523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003140847,0.00014315937,0.00019944707,0.00006477268,0.0001458746,0.000018329352,0.00034185086,0.000063599866,0.00041445927],"category_scores_gemma":[0.00011019478,0.00007524276,0.00015595615,0.00025407772,0.00017419255,0.00005291553,0.000034006356,0.00009241017,0.000068847454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000331676,0.0002065562,0.00044644572,0.0000079577685,0.000051391467,9.340466e-7,0.00015824901,1.5886807e-8,0.008552138,0.9843299,0.006050114,0.00016313784],"study_design_scores_gemma":[0.0008298321,0.000062443236,0.0009134712,0.00003512696,0.000032781387,0.0000022903575,0.000020033724,0.000004868227,0.037956662,0.9576544,0.002374899,0.00011317923],"about_ca_topic_score_codex":0.0000066418665,"about_ca_topic_score_gemma":0.000002042444,"teacher_disagreement_score":0.029404525,"about_ca_system_score_codex":0.000020839574,"about_ca_system_score_gemma":0.000020877766,"threshold_uncertainty_score":0.45380384},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97677964,0.00012213028,0.017933244,0.0010186592,0.0009955994,0.00011279927,0.0000010991579,0.00045133542,0.0025854998],"genre_scores_gemma":[0.99770844,0.000008891696,0.0017405725,0.00015669054,0.0000029537975,0.0000091152215,5.348426e-7,0.000008896452,0.0003639099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902475,0.00004824693,0.00011882241,0.0002941074,0.00021990597,0.00029415984],"domain_scores_gemma":[0.9991319,0.0002435818,0.0000984644,0.0003695678,0.00007416733,0.00008232871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001517621,0.0001210624,0.00013502866,0.00005741933,0.00012508567,0.00005746301,0.00055090117,0.000047373014,0.000011404396],"category_scores_gemma":[0.00009303348,0.0000707159,0.000034812725,0.00037522695,0.00006138038,0.000619017,0.00011046718,0.000067900146,0.00005330103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026581617,0.000044071137,0.007538063,0.0000013241214,0.000019334033,0.000022399456,0.000083471576,0.0000016112374,0.00035947328,0.98354256,0.00018054414,0.008204505],"study_design_scores_gemma":[0.0009329499,0.0001712204,0.015469751,0.00006380124,0.0000061993487,0.000004828711,0.000008268246,0.000117073214,0.0014434111,0.9806934,0.00087513984,0.00021393823],"about_ca_topic_score_codex":0.0000025601394,"about_ca_topic_score_gemma":0.000005364757,"teacher_disagreement_score":0.020928802,"about_ca_system_score_codex":0.000037365568,"about_ca_system_score_gemma":0.00002963721,"threshold_uncertainty_score":0.28837106},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98420435,0.000050091352,0.005771785,0.0015921084,0.0014415983,0.00014567471,9.586431e-7,0.00012805492,0.006665393],"genre_scores_gemma":[0.99889964,0.000005898825,0.000483145,0.0005523946,0.0000131926645,0.000022182423,3.0083066e-7,0.0000067682954,0.000016493139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987358,0.0002641987,0.00019747931,0.00027543286,0.0002528556,0.00027423367],"domain_scores_gemma":[0.9974608,0.001795837,0.00008959964,0.0005799692,0.00003855302,0.0000352716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012729432,0.00012578942,0.00012124027,0.00014219608,0.00018961752,0.00012211631,0.0011308352,0.000042900858,0.0000078264275],"category_scores_gemma":[0.00032042587,0.000074200565,0.00006007659,0.00064275117,0.00007090904,0.00025736445,0.00015523244,0.00015402831,0.00004727693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065152162,0.00005590996,0.0023729587,0.0000032048106,0.000004165786,0.000009909132,0.00095570815,0.000004449273,0.00031638925,0.9651189,0.00020275892,0.03094915],"study_design_scores_gemma":[0.0006322093,0.00014324841,0.0050556352,0.00015908062,0.0000022733936,0.0000053642552,0.00006246596,0.00054818764,0.00090634404,0.99160516,0.0007291791,0.00015086647],"about_ca_topic_score_codex":0.000011716467,"about_ca_topic_score_gemma":0.000005947868,"teacher_disagreement_score":0.030798282,"about_ca_system_score_codex":0.000028047207,"about_ca_system_score_gemma":0.000021541067,"threshold_uncertainty_score":0.30258113},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9962382,0.00033216114,0.00041681473,0.0006023203,0.0015119542,0.00010792469,0.0000018941969,0.00005433806,0.00073441706],"genre_scores_gemma":[0.99678177,0.0000253259,0.003021706,0.000021651316,5.182775e-7,0.00000474347,2.9754403e-7,0.0000063996204,0.00013757402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989021,0.000050864783,0.0003067148,0.00028347838,0.00027515172,0.00018172961],"domain_scores_gemma":[0.9986867,0.0000810542,0.00017245635,0.00075549964,0.00024691244,0.000057390702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034801828,0.000098948345,0.00020643526,0.00012056663,0.000031435073,0.000008649974,0.00055657985,0.00003760083,0.000011710544],"category_scores_gemma":[0.000082032675,0.00006556571,0.000072385876,0.00048838835,0.0001196283,0.00021457401,0.0001591264,0.00004164943,0.000018001405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004417151,0.000117243704,0.0036943473,0.000016981641,0.000015225863,0.0000012477769,0.00011903529,0.0000011981225,0.038151335,0.9492115,0.0008449376,0.00782256],"study_design_scores_gemma":[0.00057708996,0.00009872475,0.0025186143,0.00007164795,0.0000051155052,0.0000023724351,0.000003178395,0.00003089146,0.16317181,0.83314776,0.00027659518,0.00009620557],"about_ca_topic_score_codex":0.000021837086,"about_ca_topic_score_gemma":5.9857604e-7,"teacher_disagreement_score":0.12502049,"about_ca_system_score_codex":0.00000718118,"about_ca_system_score_gemma":0.00005018254,"threshold_uncertainty_score":0.2673692},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9881484,0.000020235284,0.00024324754,0.0014396261,0.0002518465,0.00025077132,0.000009257803,0.000059782964,0.009576821],"genre_scores_gemma":[0.9992621,0.0000125627585,0.000059057882,0.00009063429,0.0000038379903,0.00006500953,6.0946616e-7,0.000018445016,0.00048776818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990496,0.0001310819,0.0002603264,0.00017674171,0.00019418681,0.00018803186],"domain_scores_gemma":[0.9968112,0.0021596393,0.0001531923,0.0007666429,0.000056016146,0.000053283136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040578042,0.00013102485,0.00018500525,0.00007023731,0.00013788804,0.000009021043,0.00040104685,0.00008802844,0.00020843024],"category_scores_gemma":[0.00032990836,0.00007179178,0.00013198108,0.0002634472,0.0001707291,0.00005050246,0.00005256346,0.0001299881,0.0000530253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013382182,0.00030098605,0.0006147181,0.000006559436,0.000035730587,6.4383363e-7,0.00012946856,4.8622812e-8,0.0018632892,0.9921223,0.003853772,0.0010591311],"study_design_scores_gemma":[0.0004093179,0.00008191673,0.00069528475,0.000054025924,0.000022088327,0.0000013636354,0.00007969105,0.000007359402,0.0068875477,0.99107087,0.00058878853,0.000101732585],"about_ca_topic_score_codex":0.000008550663,"about_ca_topic_score_gemma":0.000006412387,"teacher_disagreement_score":0.011113663,"about_ca_system_score_codex":0.000011221888,"about_ca_system_score_gemma":0.000019125293,"threshold_uncertainty_score":0.29275838},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919002,0.0005474759,0.00019539599,0.0001661285,0.0020972202,0.0002477711,0.0000137011675,0.00018081497,0.0046513095],"genre_scores_gemma":[0.9835897,0.0001829038,0.0023398513,0.00002373524,0.000041267882,0.000015589787,0.000001033898,0.000058428934,0.013747474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846613,0.00006537086,0.0005427624,0.00022671571,0.00037326454,0.0003257253],"domain_scores_gemma":[0.99795544,0.0009338347,0.0002533146,0.0005855553,0.00017947765,0.000092373244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030914915,0.00020257456,0.00046461352,0.000117580916,0.00006952611,0.000025602858,0.000371457,0.000098858145,0.0003377282],"category_scores_gemma":[0.0014624506,0.00014759124,0.00012507885,0.00015097766,0.00024172848,0.0005126116,0.00018267056,0.000080859194,0.00022195258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017768878,0.00010531434,0.00022596717,0.00016266307,0.000052972107,0.0000062053223,0.00023381798,1.0617696e-7,0.0107096955,0.98338825,0.0049894317,0.000107839616],"study_design_scores_gemma":[0.0006783488,0.00008676903,0.00015952194,0.00014659704,0.00004443996,0.0000068710074,0.000094173665,0.0000018547929,0.039264392,0.9590476,0.00027549238,0.00019392253],"about_ca_topic_score_codex":0.000008002079,"about_ca_topic_score_gemma":0.0000022261816,"teacher_disagreement_score":0.028554697,"about_ca_system_score_codex":0.00007598118,"about_ca_system_score_gemma":0.000048695576,"threshold_uncertainty_score":0.6018596},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.969948,0.000008874068,0.02834122,0.000034558252,0.00076510885,0.00031788435,0.000027655227,0.000032913667,0.0005238141],"genre_scores_gemma":[0.9992248,0.000002285186,0.00048737775,0.000004086301,0.000005846775,0.000018965295,0.0000050995664,0.0000151543645,0.00023638386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899757,0.000054661363,0.00042652144,0.00016086275,0.00022968138,0.00013070073],"domain_scores_gemma":[0.99863255,0.0005213528,0.0003067727,0.00035542302,0.00013607446,0.00004782802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014604999,0.00009959582,0.0002611846,0.00007046704,0.00003338109,0.000003653708,0.00014354975,0.000055609944,0.000029763123],"category_scores_gemma":[0.0005056173,0.00006773123,0.00008060159,0.0001460681,0.00006475472,0.00004601098,0.000033931643,0.00004015134,0.000018666327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055699675,0.00036973017,0.000398626,0.000029309933,0.000015094258,1.7257157e-7,0.000056057983,0.000008235229,0.023016596,0.97298145,0.00013834816,0.0029306521],"study_design_scores_gemma":[0.0034716423,0.00020039885,0.0005174834,0.000114190385,0.000019611569,3.8982506e-7,0.000010725074,0.0012651308,0.019777402,0.9744073,0.00010509452,0.00011064095],"about_ca_topic_score_codex":0.000037695336,"about_ca_topic_score_gemma":0.0000053306417,"teacher_disagreement_score":0.029276831,"about_ca_system_score_codex":0.000053474214,"about_ca_system_score_gemma":0.000019798072,"threshold_uncertainty_score":0.27619994},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8964344,0.00019904731,0.061338656,0.0017289737,0.016882638,0.00029396277,0.0000018249327,0.00055553846,0.022564922],"genre_scores_gemma":[0.9988128,0.000009407124,0.0005599619,0.00006493676,0.000010413057,0.0000058623204,1.1492481e-7,0.000006662192,0.0005298394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913174,0.000056107172,0.000234463,0.00021353083,0.00018468779,0.0001794795],"domain_scores_gemma":[0.99915755,0.00013024111,0.00010702702,0.0004481313,0.0000978827,0.00005919823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026498633,0.00008959906,0.00016291156,0.000058934937,0.000050711,0.00003210304,0.0005538246,0.00005584161,0.000016698297],"category_scores_gemma":[0.000027568709,0.000059381273,0.00007255744,0.00019072361,0.000017383132,0.00030917858,0.00011132606,0.000049602975,0.00008086526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002493365,0.000046284506,0.0010955286,0.00000610455,0.000018504654,0.0000028214213,0.0003418302,7.743472e-7,0.0011114405,0.9875456,0.005015429,0.0048131878],"study_design_scores_gemma":[0.0028549968,0.0005452529,0.006196633,0.000276931,0.000013637675,0.000045871817,0.0000421739,0.013575167,0.013470567,0.9082932,0.0541622,0.00052336016],"about_ca_topic_score_codex":0.000024137751,"about_ca_topic_score_gemma":0.0000063461825,"teacher_disagreement_score":0.10237837,"about_ca_system_score_codex":0.00004121356,"about_ca_system_score_gemma":0.000030922383,"threshold_uncertainty_score":0.24214981},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9967883,0.000038902184,0.00016749241,0.000405934,0.00014631735,0.0002648647,0.000010120558,0.000054883887,0.0021231403],"genre_scores_gemma":[0.9984256,0.000012501685,0.0010804217,0.000033215412,0.0000040471205,0.000070173264,8.0471074e-7,0.000023268269,0.00034993826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991494,0.00010096683,0.00022561014,0.00017031112,0.00016791091,0.00018579634],"domain_scores_gemma":[0.9981533,0.00096003624,0.0001666588,0.00060485484,0.00006620707,0.000048921378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002766983,0.00012604412,0.00018375341,0.000055466608,0.00013736436,0.000011585447,0.00031660922,0.0000471485,0.00005408882],"category_scores_gemma":[0.00013190827,0.00006228062,0.000087282424,0.0003047581,0.00023950129,0.0000682669,0.000045007913,0.000074000556,0.00002843535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019906496,0.00011446965,0.003502207,0.000015928252,0.000046694753,6.326829e-7,0.00026080292,8.566578e-8,0.0070801126,0.98741317,0.00083697686,0.00070899026],"study_design_scores_gemma":[0.0006149008,0.00007498651,0.0020757497,0.00007560836,0.000051263978,0.0000044300837,0.00012450379,0.0000019073514,0.018442547,0.977908,0.0005165441,0.00010954603],"about_ca_topic_score_codex":0.000006157734,"about_ca_topic_score_gemma":0.0000043128807,"teacher_disagreement_score":0.011362434,"about_ca_system_score_codex":0.0000103427155,"about_ca_system_score_gemma":0.000019875093,"threshold_uncertainty_score":0.25397298},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952516,0.00005861157,0.0000954792,0.00010440867,0.0017993253,0.00010681158,0.0000049527157,0.00005655714,0.002522274],"genre_scores_gemma":[0.9999046,0.000011929864,0.000004156236,0.0000035401813,0.000005778743,0.000011668074,2.2217111e-7,0.000013386352,0.000044743687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99950975,0.000055831115,0.00014783634,0.0000748251,0.000107950495,0.000103786595],"domain_scores_gemma":[0.99944943,0.00020335101,0.000055458084,0.00023715825,0.00003201042,0.000022619357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019728795,0.000086567896,0.0001383937,0.000058701386,0.000020699292,0.0000038189382,0.0001242052,0.000047817124,0.000028305827],"category_scores_gemma":[0.000039446397,0.00004938338,0.00008011953,0.00018561246,0.00006048848,0.000046667526,0.000010849233,0.000057166348,0.000014502336],"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.000033261567,0.000027001259,0.0008770603,0.000045098313,0.000050856506,6.037567e-7,0.0006193791,0.000019429788,0.117437795,0.87993807,0.0006284648,0.00032296384],"study_design_scores_gemma":[0.0008239474,0.00033453526,0.0062218364,0.00047843976,0.000024495459,0.0000030781544,0.00036089594,0.00013676484,0.59852,0.3921989,0.00071560865,0.0001814987],"about_ca_topic_score_codex":0.000015161367,"about_ca_topic_score_gemma":0.000008423331,"teacher_disagreement_score":0.48773918,"about_ca_system_score_codex":0.00001995714,"about_ca_system_score_gemma":0.000004769237,"threshold_uncertainty_score":0.20137957},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.938999,0.000070146234,0.0000067222572,0.0014366268,0.0018421449,0.000110237466,0.0000010043873,0.00005266895,0.057481434],"genre_scores_gemma":[0.9938127,0.00014711726,0.000028855407,0.00014843585,0.000030118157,0.000007876096,4.867443e-7,0.000008443756,0.0058160047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989275,0.000070278984,0.00015446614,0.00017680132,0.00031715463,0.00035382478],"domain_scores_gemma":[0.9995795,0.00007206873,0.000060061535,0.00014268766,0.000041222578,0.00010448978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006437235,0.00007476281,0.000116566676,0.00003441706,0.00019652638,0.00003422935,0.00021624337,0.000094511226,0.00038390444],"category_scores_gemma":[0.00010088466,0.000060137132,0.00006139185,0.00018637854,0.00013680667,0.00020992062,0.000035034736,0.00008182892,0.000045723315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032895807,0.000056765253,0.15403418,0.0000013940848,0.000007907528,0.0000079773445,0.021716896,1.200211e-7,0.000077554556,0.81681824,0.0041678613,0.0031078027],"study_design_scores_gemma":[0.002741091,0.00007089725,0.12215762,0.00009716462,0.000013563022,8.307802e-7,0.055957943,0.000003120365,0.0002749514,0.6040445,0.21416862,0.00046970294],"about_ca_topic_score_codex":0.0015508116,"about_ca_topic_score_gemma":0.00047929797,"teacher_disagreement_score":0.21277377,"about_ca_system_score_codex":0.0003008516,"about_ca_system_score_gemma":0.00014253172,"threshold_uncertainty_score":0.42034844},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8790702,0.00015938644,0.012201891,0.03954,0.0005175821,0.0008564541,0.000049610127,0.00010472788,0.06750011],"genre_scores_gemma":[0.99746484,0.0000048919205,0.00013707289,0.00001339168,0.000032580076,0.00007474735,0.0000016299254,0.000008352598,0.0022624882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995387,0.00004405605,0.00012990016,0.000094442796,0.0000648482,0.00012802759],"domain_scores_gemma":[0.9973026,0.00232023,0.000059773112,0.0002548377,0.000023498893,0.000039055154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020346163,0.00007125986,0.000091080314,0.0000040701284,0.0005692397,0.000048591213,0.00013598979,0.000015477208,0.00002890005],"category_scores_gemma":[0.00008045161,0.000029541561,0.000035725167,0.00007018778,0.00039300078,0.00009856853,0.000061030172,0.000065835266,0.000044815308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008208974,0.000004877029,0.021876324,0.0000010157734,0.000012680773,1.8029311e-8,0.00007050791,3.3685595e-8,0.0000042734537,0.9753444,0.00024513638,0.0024325065],"study_design_scores_gemma":[0.0005310384,0.000007071258,0.007822711,0.0000087485,0.000012381884,2.0791194e-7,0.00019485959,7.1054103e-7,0.000078315774,0.97726274,0.014027832,0.000053405245],"about_ca_topic_score_codex":0.0000060889356,"about_ca_topic_score_gemma":4.929773e-7,"teacher_disagreement_score":0.118394606,"about_ca_system_score_codex":0.000005920207,"about_ca_system_score_gemma":0.0000087909275,"threshold_uncertainty_score":0.43781894},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9875332,0.000042740405,0.002556608,0.002292852,0.0018946803,0.00012983377,0.0000048369207,0.00007825045,0.005466958],"genre_scores_gemma":[0.9975222,0.000020806963,0.00094013655,0.00040730587,0.000018200823,0.000009709483,2.961984e-7,0.0000068784725,0.0010745148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990495,0.00012820285,0.00017063698,0.00020928045,0.0002413267,0.00020105031],"domain_scores_gemma":[0.998737,0.0004785949,0.000099771285,0.00057390594,0.000044058692,0.00006667973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004086841,0.000105344,0.00012091379,0.00006239179,0.00008626591,0.000030395511,0.0009497686,0.000043206797,0.0001093283],"category_scores_gemma":[0.00008256933,0.00005553349,0.00007878528,0.00027669853,0.00008556939,0.00019147109,0.00017235334,0.000076787495,0.0002293675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005208983,0.00004855435,0.00013455113,0.0000027754213,0.000010774591,0.000005027619,0.0000704377,0.0000024093515,0.0012153776,0.9877389,0.006738997,0.0040269783],"study_design_scores_gemma":[0.00047570455,0.00009254385,0.00057032274,0.000021965363,0.0000035965927,0.0000041184053,0.0000038490966,0.0011319993,0.012001483,0.98324984,0.0023351773,0.00010942436],"about_ca_topic_score_codex":0.000010674916,"about_ca_topic_score_gemma":9.551466e-7,"teacher_disagreement_score":0.010786106,"about_ca_system_score_codex":0.00002494501,"about_ca_system_score_gemma":0.000040231072,"threshold_uncertainty_score":0.29481316},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99181074,0.000021025795,0.0002561802,0.00058729976,0.00020955694,0.0002673092,0.000006946692,0.00016946309,0.0066714757],"genre_scores_gemma":[0.9981302,0.00000921786,0.00039549972,0.000060304803,0.000005836154,0.00008228013,0.0000013356054,0.000030951524,0.0012843561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999027,0.00006412841,0.00020620844,0.00024725814,0.00019336198,0.000262029],"domain_scores_gemma":[0.9985816,0.00057125394,0.00011069052,0.0005588214,0.00006823739,0.00010943033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022713021,0.00015726172,0.00019178994,0.00010793689,0.0001335119,0.000018956443,0.00027223476,0.00007991867,0.00009186846],"category_scores_gemma":[0.00010677161,0.00009627421,0.00007261855,0.00042205476,0.00013456159,0.000110120396,0.000039805946,0.00009512533,0.00011371371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003215211,0.00018879735,0.004032069,0.00001056731,0.00003703107,0.0000035057512,0.00011194581,2.7533751e-8,0.001127722,0.9904176,0.0030346313,0.0010039747],"study_design_scores_gemma":[0.0013616902,0.000092696304,0.002339993,0.000042544438,0.000030997377,0.000008279017,0.00005056362,0.0000015562903,0.0023313768,0.9910978,0.0024607077,0.00018180315],"about_ca_topic_score_codex":0.0000034938334,"about_ca_topic_score_gemma":0.0000036263145,"teacher_disagreement_score":0.0063194754,"about_ca_system_score_codex":0.000021788543,"about_ca_system_score_gemma":0.000027940845,"threshold_uncertainty_score":0.39259484},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9696643,0.00018524246,0.025130888,0.0013988739,0.001194157,0.0010159622,0.00005414669,0.00030349992,0.0010529315],"genre_scores_gemma":[0.99692017,0.000067538014,0.0023115675,0.00013417992,0.00000701002,0.00034043434,0.0000066092225,0.000027679553,0.00018483767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781203,0.00012527805,0.000336941,0.00059809285,0.00031880825,0.00080886786],"domain_scores_gemma":[0.99774504,0.0008792611,0.00009400859,0.0009186698,0.00016870044,0.00019431765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006346564,0.00021079909,0.00027100474,0.0005008461,0.00021962641,0.00008162597,0.0013143655,0.00011788437,0.000012971546],"category_scores_gemma":[0.00014706863,0.00016961839,0.00016493419,0.0009794872,0.00021355395,0.00082834123,0.00019967767,0.00015855019,0.000048792368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030915184,0.00010478662,0.006482591,0.000011023467,0.0000169146,0.00000801075,0.00012977487,0.0000017693371,0.00589195,0.9832747,0.0009786383,0.003068924],"study_design_scores_gemma":[0.0018139061,0.00018803003,0.014463299,0.00005105996,0.0000034180975,0.000006651061,0.000019518877,0.00017742504,0.008453851,0.9733411,0.0012313965,0.0002503513],"about_ca_topic_score_codex":0.000023423325,"about_ca_topic_score_gemma":0.000052433727,"teacher_disagreement_score":0.027255846,"about_ca_system_score_codex":0.0001029378,"about_ca_system_score_gemma":0.00007511688,"threshold_uncertainty_score":0.6916837},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99753153,0.00049968786,0.000027119015,0.00002664984,0.0009626615,0.000087194625,0.000004584428,0.000104159495,0.00075643195],"genre_scores_gemma":[0.9997243,0.00019475108,0.000008735474,0.0000044194203,0.0000031767124,0.000011022331,0.0000021188857,0.00001284736,0.000038624054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995441,0.000030306928,0.00015320562,0.00008312589,0.0000917212,0.00009753907],"domain_scores_gemma":[0.9997167,0.00007227956,0.000030654403,0.00011378902,0.000034987755,0.000031609325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012815307,0.00008087438,0.00011960468,0.00010060556,0.00002968067,0.00000758994,0.0000575416,0.000050464998,0.000005516421],"category_scores_gemma":[0.000017169294,0.00006341875,0.000028668583,0.000104808,0.000058539732,0.00021242099,0.000009909781,0.00003077165,0.000008188342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042418533,0.000015730295,0.0053407177,0.00005443649,0.000020459796,5.87243e-7,0.0002815545,0.0000040729906,0.024981853,0.9668615,0.00011906163,0.002315813],"study_design_scores_gemma":[0.0007897156,0.00005836871,0.025704091,0.00005996067,0.000010000999,0.0000025441059,0.00012751757,0.00015589852,0.02107676,0.95175827,0.00014664052,0.00011024994],"about_ca_topic_score_codex":0.000004088032,"about_ca_topic_score_gemma":7.28904e-7,"teacher_disagreement_score":0.020363374,"about_ca_system_score_codex":0.000012946992,"about_ca_system_score_gemma":0.0000032834241,"threshold_uncertainty_score":0.25861415},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9315436,0.00015499923,0.047346186,0.005129354,0.0046996167,0.0003043566,0.0000034327202,0.0010516553,0.009766816],"genre_scores_gemma":[0.99519277,0.000014921456,0.003562331,0.0005947842,0.000019166224,0.000014978221,6.3801565e-7,0.000014369457,0.0005860605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986178,0.000064391264,0.00020116405,0.0004677133,0.0002520245,0.0003968965],"domain_scores_gemma":[0.9986102,0.00034894168,0.00009503344,0.0007520427,0.000068480134,0.00012530235],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016594905,0.00017625517,0.00017996934,0.00008054541,0.00012573598,0.00005882637,0.00081929733,0.000074105024,0.000031503965],"category_scores_gemma":[0.00019200514,0.00011786496,0.0000734497,0.0003178963,0.00004691242,0.0003575079,0.00020604108,0.00011597433,0.00085003034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008441634,0.000058936588,0.00022704015,0.0000024392268,0.000005659969,0.000026229902,0.000077341705,0.000002478336,0.0024776948,0.9470784,0.0007176348,0.049317714],"study_design_scores_gemma":[0.0011667621,0.0002823149,0.003096614,0.00005064472,0.0000031734653,0.000011354027,0.0000037016152,0.00047081267,0.0071706367,0.9793592,0.008115839,0.00026890877],"about_ca_topic_score_codex":0.0000026589453,"about_ca_topic_score_gemma":9.3394146e-7,"teacher_disagreement_score":0.06364917,"about_ca_system_score_codex":0.00007461139,"about_ca_system_score_gemma":0.0000409033,"threshold_uncertainty_score":0.99992794},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99681205,0.000021382783,0.00033463212,0.0003133396,0.00013149195,0.00016991352,0.000017915801,0.000043025226,0.0021562714],"genre_scores_gemma":[0.99915904,0.000019596624,0.000115662646,0.00013481958,0.0000017269489,0.000049358554,0.0000016249451,0.0000209961,0.0004971711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991456,0.0001164322,0.00018186728,0.00019902101,0.00017810671,0.00017891974],"domain_scores_gemma":[0.9978355,0.0013949284,0.00013629823,0.0005160369,0.000054484437,0.00006276268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021511398,0.000140805,0.00018275206,0.00006997405,0.0001421148,0.000013918675,0.00023274877,0.00005866961,0.000029721949],"category_scores_gemma":[0.00009757244,0.00007307675,0.000047899208,0.00027771905,0.0002572973,0.00004350684,0.000045607452,0.00006614947,0.0000075746057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033493405,0.00018656268,0.0007389006,0.000007858617,0.00004128946,8.9354967e-7,0.0001137105,1.08255485e-7,0.000964904,0.995694,0.0011630299,0.001055269],"study_design_scores_gemma":[0.0008099189,0.00017250473,0.00053639297,0.000086396714,0.000031395677,0.0000025240051,0.00006263632,0.0000063871457,0.0060786763,0.99098957,0.0011060345,0.000117549214],"about_ca_topic_score_codex":0.000007400663,"about_ca_topic_score_gemma":0.00001630865,"teacher_disagreement_score":0.005113772,"about_ca_system_score_codex":0.00001081494,"about_ca_system_score_gemma":0.000013988606,"threshold_uncertainty_score":0.29799834},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9656736,0.00006579845,0.03075516,0.0004720932,0.0021639175,0.00046856992,0.00003666525,0.00020130108,0.00016287726],"genre_scores_gemma":[0.9991439,0.000026809514,0.00019257597,0.000008408163,0.000008946462,0.00040342807,0.000026514068,0.000021139385,0.00016826057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941623,0.0000089856385,0.00018976093,0.00016588216,0.0000716814,0.0001474658],"domain_scores_gemma":[0.9995548,0.00012198617,0.000032654814,0.00018214344,0.00006557081,0.000042818934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012609872,0.00008475316,0.00008786628,0.00009546485,0.00007210439,0.000027088543,0.00007089992,0.00006089464,0.000007725006],"category_scores_gemma":[0.000060603335,0.00007980535,0.000020708056,0.00014805443,0.000035270743,0.00010829221,0.000012566757,0.000049959548,0.0000266782],"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.000032558608,0.00053770887,0.015172182,0.00017353926,0.000080563936,0.0000015505036,0.0018968834,0.06018384,0.15993734,0.7157824,0.031540222,0.014661218],"study_design_scores_gemma":[0.0028650675,0.0001157744,0.070222326,0.00019239695,0.000056233428,0.000007894138,0.00029086813,0.6613245,0.019704098,0.23792893,0.0066227354,0.00066918106],"about_ca_topic_score_codex":0.000027338614,"about_ca_topic_score_gemma":0.00005499817,"teacher_disagreement_score":0.6011407,"about_ca_system_score_codex":0.000110969544,"about_ca_system_score_gemma":0.000011402009,"threshold_uncertainty_score":0.32543677},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98362195,0.000023365898,0.0020619235,0.000681715,0.0015176911,0.000086097425,0.0000039348083,0.00019042993,0.011812917],"genre_scores_gemma":[0.99828374,0.000007498881,0.0011395804,0.0002047455,0.0000044220888,0.000005340307,4.1503958e-7,0.000010364791,0.000343912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999001,0.00005789041,0.00018783515,0.00027723363,0.00024998304,0.00022604261],"domain_scores_gemma":[0.99883956,0.0002144845,0.000098333956,0.0007316789,0.00004191937,0.00007403894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024291998,0.00012107546,0.00016706323,0.0000614728,0.000050395254,0.00002774349,0.00075274333,0.00005753704,0.00005662872],"category_scores_gemma":[0.00004331342,0.00008188064,0.0000861795,0.00025309974,0.00006358025,0.00025799102,0.0001712293,0.000062258754,0.00028213614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054256375,0.00008644163,0.001174366,0.0000044966814,0.0000080717855,0.000010737407,0.00012991249,8.828563e-8,0.0033383677,0.9827023,0.0022131796,0.010326591],"study_design_scores_gemma":[0.00071507844,0.00010080253,0.0057739834,0.000069711954,0.000003185072,0.000007965867,0.0000033801223,0.000117899064,0.01962037,0.9708674,0.002572138,0.00014808975],"about_ca_topic_score_codex":0.000012658424,"about_ca_topic_score_gemma":5.9820104e-7,"teacher_disagreement_score":0.016282003,"about_ca_system_score_codex":0.000024187531,"about_ca_system_score_gemma":0.000025501686,"threshold_uncertainty_score":0.36263832},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99084866,0.00023677736,0.0002319782,0.000040900664,0.0015706974,0.00013087486,0.0000069637417,0.00043276604,0.0065003824],"genre_scores_gemma":[0.99965906,0.000028256087,0.000028886692,0.000011895369,0.0000053954136,0.00004558399,0.0000011024223,0.000027366379,0.00019244773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993876,0.00003256562,0.0001373435,0.0001421832,0.00009549771,0.00020480769],"domain_scores_gemma":[0.9994863,0.0000666176,0.000019300755,0.0003222692,0.000029205792,0.00007625782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110085064,0.00012291702,0.00013126322,0.000058653543,0.000044689103,0.00001048917,0.00017459413,0.00006592082,0.000038938524],"category_scores_gemma":[0.00001703855,0.00008879364,0.00006636226,0.0001563688,0.000045004916,0.00011076736,0.000017777082,0.000058834637,0.00029091325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004725873,0.000019118761,0.0014574111,0.000013600145,0.000048446134,0.0000038157527,0.00014811369,0.000021001111,0.052521326,0.9426068,0.00095419615,0.0022014384],"study_design_scores_gemma":[0.00089658727,0.000031759777,0.005333204,0.000051695188,0.000008792857,0.000004491049,0.0000382076,0.00027298334,0.036043048,0.9506857,0.006381676,0.00025186024],"about_ca_topic_score_codex":0.000002643643,"about_ca_topic_score_gemma":6.3059707e-7,"teacher_disagreement_score":0.016478276,"about_ca_system_score_codex":0.000027415002,"about_ca_system_score_gemma":0.0000032642015,"threshold_uncertainty_score":0.3739198},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99501514,0.00007133253,0.000038453083,0.0006124513,0.00032797415,0.00020083594,0.000011926691,0.00005622296,0.003665672],"genre_scores_gemma":[0.99936676,0.00004069486,0.00004800287,0.000029642051,0.000004793032,0.0000372512,9.3126056e-7,0.000014458263,0.00045747144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922365,0.00007406707,0.00024192457,0.00012261998,0.00016577261,0.00017196585],"domain_scores_gemma":[0.99794745,0.0012677603,0.0001450554,0.00052340236,0.000067936206,0.00004841289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041353633,0.000095525495,0.00014643105,0.000038700713,0.00021293541,0.000014723261,0.00033965803,0.00005421107,0.000028402248],"category_scores_gemma":[0.00011800147,0.000053095515,0.00008582126,0.00014621239,0.00027940437,0.0000777278,0.00004020186,0.00007248982,0.000043057393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012226233,0.00010289941,0.001966929,0.000009038355,0.000033431188,4.634408e-7,0.00006654438,1.9280126e-8,0.0021834844,0.99027693,0.004776786,0.0005712559],"study_design_scores_gemma":[0.00052765326,0.000028969125,0.0015423882,0.000022528777,0.000013884796,0.000001967603,0.000044896027,0.0000015966972,0.0072482764,0.9847091,0.005778384,0.00008039076],"about_ca_topic_score_codex":0.0000033315437,"about_ca_topic_score_gemma":0.0000019621498,"teacher_disagreement_score":0.005567858,"about_ca_system_score_codex":0.000012950597,"about_ca_system_score_gemma":0.00001954219,"threshold_uncertainty_score":0.21651722},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99158967,0.00008425344,0.0010109738,0.000767738,0.0015875248,0.00008068379,7.071078e-7,0.00016142328,0.0047170366],"genre_scores_gemma":[0.9958324,0.000010645686,0.0035119164,0.00006778144,6.0111034e-7,0.000005597763,2.8215922e-7,0.000006886565,0.0005638803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905044,0.000050121143,0.00023471598,0.00022344466,0.00024684338,0.0001944116],"domain_scores_gemma":[0.99903286,0.000106323714,0.00010628526,0.00057980977,0.00009837733,0.00007634859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023112373,0.000095411946,0.00015474194,0.000048877297,0.000048243117,0.000022476588,0.00051145005,0.000047244546,0.000040814884],"category_scores_gemma":[0.00005115865,0.000063519314,0.00006495883,0.00027928827,0.00006401602,0.00022166186,0.00016131999,0.00003909639,0.00027447552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010062482,0.00007003809,0.0048795347,0.000011236762,0.000011707341,0.0000033044914,0.0000855618,2.3044524e-7,0.0060373005,0.9811696,0.0016686782,0.006061796],"study_design_scores_gemma":[0.000660822,0.00004357178,0.0018698958,0.000093015085,0.000004634282,0.000008769227,0.0000029075009,0.00022481738,0.012385471,0.9842655,0.0003326602,0.00010790206],"about_ca_topic_score_codex":0.000011763835,"about_ca_topic_score_gemma":6.3378343e-7,"teacher_disagreement_score":0.00634817,"about_ca_system_score_codex":0.0000138166315,"about_ca_system_score_gemma":0.00003396723,"threshold_uncertainty_score":0.3527919},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90169245,0.0050987485,0.06410146,0.0019789522,0.010097917,0.0012444172,0.00014106398,0.00035348206,0.015291528],"genre_scores_gemma":[0.99578726,0.00061964407,0.0019849285,0.000051760988,0.000014705234,0.000026769905,0.0000014091352,0.000051839022,0.0014616692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952676,0.0005521717,0.0007962576,0.0010579076,0.0011907574,0.0011352542],"domain_scores_gemma":[0.9955565,0.00090329984,0.0003660764,0.0021403464,0.00063739484,0.0003964251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011328987,0.00046486786,0.0006640499,0.00041892033,0.00023575874,0.00007508065,0.0026674634,0.00018354734,0.0001703738],"category_scores_gemma":[0.00023454159,0.00036914682,0.00037648028,0.0018414636,0.0010112795,0.0010385773,0.00050000736,0.00037781862,0.00019138206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103056824,0.00034487626,0.0051007885,0.00009859315,0.00009535334,0.00005609129,0.00062372594,0.000003726072,0.009884059,0.9487218,0.00037541907,0.034592483],"study_design_scores_gemma":[0.0030754847,0.0005334858,0.002238872,0.0004523187,0.000028339595,0.000011165733,0.00013598253,0.00013781725,0.02045658,0.97187495,0.00056231,0.0004926857],"about_ca_topic_score_codex":0.000031129763,"about_ca_topic_score_gemma":0.0000117340405,"teacher_disagreement_score":0.094094835,"about_ca_system_score_codex":0.00013558869,"about_ca_system_score_gemma":0.00028466762,"threshold_uncertainty_score":0.999876},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9827886,0.00012591,0.0032513915,0.00093232427,0.0067115766,0.00077641406,0.00008102784,0.00036777757,0.0049649524],"genre_scores_gemma":[0.9916965,0.000023912617,0.005009076,0.00006961549,0.000035501726,0.00008445303,0.0000038005219,0.000041091585,0.0030360853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872637,0.00008577177,0.00029576838,0.00030846702,0.00014617867,0.00043745255],"domain_scores_gemma":[0.99361616,0.0055792895,0.00015110752,0.0004343938,0.00010232464,0.00011671726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034635598,0.00020757692,0.00030518146,0.000034761444,0.00016944896,0.000012883687,0.0002647749,0.00019287778,0.00021042497],"category_scores_gemma":[0.0033371572,0.00015542864,0.00013442077,0.000094926356,0.00019354596,0.0001901331,0.000056920788,0.00011859248,0.00008936091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006216005,0.00012347306,0.00027114674,0.000023272549,0.00009089609,0.0000050014232,0.00016045054,6.1854274e-7,0.000755,0.9880813,0.0064050662,0.0034621942],"study_design_scores_gemma":[0.007191912,0.00019671758,0.00009890741,0.000034239496,0.000051857096,0.0000019237618,0.0001314193,0.000009829188,0.006691227,0.97320473,0.012148552,0.00023870436],"about_ca_topic_score_codex":0.0000039141187,"about_ca_topic_score_gemma":0.0000122564525,"teacher_disagreement_score":0.01487657,"about_ca_system_score_codex":0.000085731364,"about_ca_system_score_gemma":0.000045680343,"threshold_uncertainty_score":0.6338196},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9923536,0.00010637524,0.0020344562,0.0031343654,0.0013387522,0.0001802851,0.0000015797798,0.00013959494,0.00071099825],"genre_scores_gemma":[0.99823916,0.000009918169,0.0012339489,0.00033693793,4.1642687e-7,0.000014963161,1.4704997e-7,0.000007751496,0.00015676967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890125,0.00010778796,0.0002374673,0.00024764705,0.00029299545,0.00021286512],"domain_scores_gemma":[0.9983209,0.0005424761,0.0001270982,0.00084614666,0.000098453296,0.00006492132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043192686,0.00011853513,0.00015037,0.00009278204,0.000103617866,0.000030374185,0.00077664276,0.000050120485,0.000013340546],"category_scores_gemma":[0.000169529,0.000058908823,0.00008727437,0.00038399067,0.00011655496,0.00011873066,0.00013965294,0.00007731102,0.00011760239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022958902,0.00012223487,0.00019097769,0.000005550429,0.00001515647,0.000002000611,0.00015785481,0.0000030334606,0.005418603,0.99034196,0.0027162095,0.0010240994],"study_design_scores_gemma":[0.00082052837,0.00014217384,0.000693312,0.00010735205,0.0000045983834,0.0000023419593,0.00000880911,0.0015477997,0.008971302,0.9875008,0.00009812997,0.00010289366],"about_ca_topic_score_codex":0.000015225429,"about_ca_topic_score_gemma":0.0000013996074,"teacher_disagreement_score":0.0058855545,"about_ca_system_score_codex":0.000013805366,"about_ca_system_score_gemma":0.00003370851,"threshold_uncertainty_score":0.24022321},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98324937,0.00012860801,0.00020110224,0.000119550255,0.0009027606,0.00010662628,0.000031216416,0.00004487381,0.015215907],"genre_scores_gemma":[0.9949055,0.000037961294,0.0027967652,0.000034697478,0.000010989083,0.0000065629274,0.0000027028202,0.000019893356,0.0021849792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991042,0.00011059063,0.00033019844,0.00014073658,0.00013314902,0.00018113578],"domain_scores_gemma":[0.9984441,0.00083642657,0.00019670508,0.00040223735,0.000077575394,0.00004299874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022749719,0.00012033175,0.00030731247,0.00008007175,0.00003311276,0.0000012620196,0.00020653207,0.000073525945,0.00015696145],"category_scores_gemma":[0.00020226857,0.00008401883,0.000076451244,0.00009313922,0.00033790147,0.0000663525,0.000084052386,0.00007925678,0.000022347573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049767954,0.000108168984,0.0023542868,0.000038908434,0.000051884894,0.0000029005455,0.00026323058,5.115082e-7,0.010310869,0.9844918,0.00095888803,0.0013687317],"study_design_scores_gemma":[0.0011654918,0.000086137064,0.00061117153,0.00005331022,0.000021673857,0.0000017127768,0.000048737827,7.552653e-7,0.04299142,0.95322853,0.0016915406,0.000099521996],"about_ca_topic_score_codex":0.000007185928,"about_ca_topic_score_gemma":0.0000038396515,"teacher_disagreement_score":0.03268055,"about_ca_system_score_codex":0.000014141921,"about_ca_system_score_gemma":0.000024532244,"threshold_uncertainty_score":0.34261882},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.965302,0.00042285453,0.023006588,0.0026004496,0.0035637591,0.00042560245,0.00001540084,0.0009213379,0.003742043],"genre_scores_gemma":[0.9951172,0.00003693656,0.0037872454,0.00042194614,0.000012939454,0.000039350143,0.0000027601893,0.000025012136,0.00055661437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980476,0.00009514858,0.000338477,0.00056391075,0.00039965136,0.0005552144],"domain_scores_gemma":[0.99795556,0.0002965366,0.0001497151,0.0012979149,0.000094566894,0.00020567965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049441156,0.0002577597,0.0003105421,0.00014456327,0.00019362188,0.00014795647,0.0015735752,0.00009789779,0.00006067868],"category_scores_gemma":[0.000064556334,0.00018468605,0.00016146377,0.00041959016,0.00013918629,0.00078524736,0.00045882893,0.00011438869,0.00038297832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012419255,0.00008104651,0.00046618804,0.0000062480526,0.000023648327,0.00003246568,0.00020324311,1.1600788e-7,0.004856,0.9620987,0.003311287,0.028908633],"study_design_scores_gemma":[0.0016879091,0.00018655857,0.0027542752,0.000062197236,0.000007778034,0.000038314814,0.0000117235995,0.00062436843,0.009525807,0.97296965,0.011801119,0.00033032408],"about_ca_topic_score_codex":0.000026504502,"about_ca_topic_score_gemma":0.000001727082,"teacher_disagreement_score":0.029815232,"about_ca_system_score_codex":0.000076760654,"about_ca_system_score_gemma":0.000050077844,"threshold_uncertainty_score":0.7531279},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27116245,0.0002131935,0.7217259,0.00168101,0.0018727707,0.000828392,0.000021700454,0.00022707199,0.0022674997],"genre_scores_gemma":[0.98565906,0.000014902632,0.013399967,0.000034479668,0.0000066164994,0.000019007668,0.0000010940768,0.0000127373205,0.00085210585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998824,0.00005498689,0.0001708755,0.00030539517,0.00031880956,0.00032596124],"domain_scores_gemma":[0.9985009,0.00048302868,0.00008570404,0.00063097733,0.00014665397,0.00015276355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003730121,0.0001049049,0.00016669801,0.00017233325,0.000081786005,0.000019803401,0.0009738239,0.0000578845,0.000025465008],"category_scores_gemma":[0.00015184346,0.00007781702,0.00010755088,0.00041800298,0.00007934264,0.00039668425,0.00017715809,0.0000595654,0.000043971966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060610546,0.00004063538,0.00079227204,0.00001007413,0.000015231751,0.0000019404108,0.000085669504,5.967924e-7,0.00884549,0.9592146,0.006098294,0.024834566],"study_design_scores_gemma":[0.0019066843,0.00032417386,0.00049273093,0.000035446494,0.0000027120998,0.0000018639618,0.000007083006,0.000071501505,0.05584514,0.9355717,0.005632339,0.000108659515],"about_ca_topic_score_codex":0.000008073049,"about_ca_topic_score_gemma":9.838736e-7,"teacher_disagreement_score":0.7144966,"about_ca_system_score_codex":0.000037867616,"about_ca_system_score_gemma":0.00010903702,"threshold_uncertainty_score":0.3173286},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85866374,0.0007983507,0.025998004,0.0751755,0.018985432,0.002303823,0.0000056922513,0.0013679483,0.016701484],"genre_scores_gemma":[0.99676454,0.000024038263,0.0022155924,0.00018836978,0.000013097545,0.00004528973,2.7870564e-7,0.000013001526,0.0007357745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978987,0.00026002812,0.0003653356,0.0005531788,0.0003906066,0.0005321419],"domain_scores_gemma":[0.9977648,0.0006081555,0.000089813606,0.0012899026,0.00013072192,0.00011658641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001107361,0.00019304168,0.00020682515,0.00007250198,0.00019173502,0.00018082384,0.0019071017,0.00007514251,0.000011991692],"category_scores_gemma":[0.00034615936,0.00008443655,0.00008083413,0.0005207376,0.00014262063,0.0004471886,0.0008881859,0.0001694198,0.00019554821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011982764,0.00020576759,0.005828045,0.0000050041444,0.000011144347,0.000032191663,0.000338034,0.0000027785684,0.0006843937,0.8230937,0.0026979735,0.16708897],"study_design_scores_gemma":[0.0012322154,0.00019267679,0.028248936,0.0000335301,0.0000020503692,0.000019516596,0.000016077904,0.0041749543,0.0014183145,0.9521857,0.012186794,0.00028926996],"about_ca_topic_score_codex":0.00010020615,"about_ca_topic_score_gemma":0.000050822844,"teacher_disagreement_score":0.16679971,"about_ca_system_score_codex":0.00022059635,"about_ca_system_score_gemma":0.00013114401,"threshold_uncertainty_score":0.3543901},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9923113,0.00028601062,0.00076879625,0.0031967289,0.0014674109,0.00018203717,0.0000017427972,0.00010802586,0.0016779577],"genre_scores_gemma":[0.9986086,0.00002828209,0.00088341435,0.00034962335,4.9997874e-7,0.000012683694,4.7479801e-7,0.0000076474125,0.00010879037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858683,0.00012081177,0.00026458804,0.00028881358,0.00053631526,0.00020266276],"domain_scores_gemma":[0.99744326,0.0014352051,0.00016096469,0.0006615263,0.0002307581,0.000068302834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006432518,0.00012113511,0.00014716445,0.00049789774,0.00012654804,0.000029302133,0.0006667327,0.000050136758,0.000015124534],"category_scores_gemma":[0.000519795,0.00006124239,0.000094129035,0.0024565128,0.00007335637,0.00015805419,0.00014413735,0.000079264224,0.00010111076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040832583,0.000095006515,0.0007372284,0.0000024294266,0.000015827527,0.0000013855789,0.000029094064,0.000008829156,0.0022641039,0.99065983,0.0022312037,0.003950988],"study_design_scores_gemma":[0.00054136437,0.00017762046,0.0032107905,0.00003990326,0.000005399474,0.0000017442724,0.000003116962,0.0004832394,0.011032342,0.9843209,0.00008544847,0.00009816303],"about_ca_topic_score_codex":0.000013044437,"about_ca_topic_score_gemma":2.7597733e-7,"teacher_disagreement_score":0.008768238,"about_ca_system_score_codex":0.000020566808,"about_ca_system_score_gemma":0.000039272083,"threshold_uncertainty_score":0.24973921},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99745446,0.00024334028,0.001193944,0.00026260279,0.00029457244,0.00016341242,0.0000031762963,0.000034823956,0.0003496429],"genre_scores_gemma":[0.9972464,0.00004081222,0.0026352264,0.0000047261547,0.000002805241,0.0000075473145,1.2284517e-7,0.00000748141,0.000054875934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989794,0.00008115295,0.00019304692,0.00027165783,0.00025731593,0.00021743793],"domain_scores_gemma":[0.9989118,0.00020492577,0.00009793723,0.00056384184,0.00014700595,0.00007446471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041734238,0.0000841578,0.00018228157,0.00010336973,0.00003942634,0.000009724274,0.0005007002,0.00002540484,0.0000035466496],"category_scores_gemma":[0.00015332577,0.000062654224,0.000030078494,0.00031028304,0.00020002904,0.00032154514,0.00028366598,0.000058703306,0.0000029809082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012792488,0.000047243804,0.010932989,0.000030190076,0.000011962596,0.000004393258,0.000261295,5.4656914e-7,0.049188517,0.92342466,0.000025792902,0.016059617],"study_design_scores_gemma":[0.0006613266,0.00022003976,0.01744068,0.00006542153,0.0000028154154,0.0000037125685,0.00002270593,0.00006812126,0.18828477,0.79294837,0.00017559553,0.00010644864],"about_ca_topic_score_codex":0.000010114953,"about_ca_topic_score_gemma":0.0000015676751,"teacher_disagreement_score":0.13909625,"about_ca_system_score_codex":0.000021255742,"about_ca_system_score_gemma":0.000051239953,"threshold_uncertainty_score":0.2554965},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99699295,0.00044580846,0.0007688276,0.000022438171,0.00067122804,0.00009803891,0.0000100396,0.0000996484,0.00089103595],"genre_scores_gemma":[0.99967813,0.00003721414,0.0002344851,0.0000044022017,0.000006085404,0.000008401887,0.0000016094375,0.000015472791,0.000014206965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994444,0.000041177915,0.0001932784,0.00010472381,0.000079683305,0.0001367068],"domain_scores_gemma":[0.99963063,0.00008275086,0.000037102975,0.00016170806,0.000028859944,0.000058953592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014071265,0.00010264168,0.00017269679,0.000103578626,0.00005768529,0.000012052235,0.0000967344,0.000063723244,0.00000834046],"category_scores_gemma":[0.00001045286,0.00007960453,0.000049381957,0.00015768134,0.00007737608,0.00012729772,0.000017872055,0.000042759035,0.0000035583018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014042522,0.000025147265,0.0020803,0.00009002501,0.00007881197,0.0000050695694,0.00043470747,0.00020590158,0.16576831,0.8296532,0.00010257379,0.0015418901],"study_design_scores_gemma":[0.0011369752,0.000051970404,0.00093506067,0.00020157188,0.00003299399,0.0000154174,0.00013100507,0.00091234705,0.039857246,0.95637214,0.00013597596,0.00021729397],"about_ca_topic_score_codex":0.00003991337,"about_ca_topic_score_gemma":0.000006942328,"teacher_disagreement_score":0.12671892,"about_ca_system_score_codex":0.000024099087,"about_ca_system_score_gemma":0.000008111413,"threshold_uncertainty_score":0.32461786},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97072506,0.00004119183,0.018927705,0.0036305678,0.0007772025,0.00032909375,0.000004243845,0.00008904623,0.0054758615],"genre_scores_gemma":[0.99879724,0.000006423268,0.00045444365,0.00006973823,0.000002371355,0.000018756993,3.198064e-7,0.000008323383,0.0006423722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987434,0.00020427014,0.00015829627,0.00024070089,0.0004280231,0.00022531534],"domain_scores_gemma":[0.9976145,0.0013570744,0.00009144236,0.00075221737,0.00012993261,0.00005485534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006611898,0.00009426819,0.000113310445,0.0000876647,0.00009129619,0.00002366756,0.0009355222,0.000037869933,0.00006595392],"category_scores_gemma":[0.0003652589,0.000051564974,0.000057925135,0.00042880786,0.00016563137,0.0002946147,0.00016152718,0.000079965124,0.000104350875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024359328,0.00005418022,0.000092199756,0.0000018895222,0.000009668,0.0000022309882,0.00012520506,0.0000020203495,0.009905403,0.97884065,0.0010105438,0.009931628],"study_design_scores_gemma":[0.0006378954,0.00017483991,0.0006497998,0.000024151455,0.0000013991041,6.78987e-7,0.00001676723,0.00014303178,0.04449695,0.9534907,0.00028690396,0.000076934426],"about_ca_topic_score_codex":0.000006138926,"about_ca_topic_score_gemma":0.000004704879,"teacher_disagreement_score":0.034591544,"about_ca_system_score_codex":0.000059119728,"about_ca_system_score_gemma":0.000042964002,"threshold_uncertainty_score":0.21027586},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37387174,0.0026232528,0.56565374,0.032216698,0.013817575,0.0031701282,0.00012183709,0.0011743299,0.007350705],"genre_scores_gemma":[0.99560744,0.000112517744,0.0027992055,0.00026258346,0.000026704287,0.0000630527,0.000003033642,0.000011243344,0.0011142517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894935,0.000027261967,0.00015340192,0.00036114294,0.0002129254,0.00029593674],"domain_scores_gemma":[0.9987746,0.00041352373,0.00008431276,0.0006006516,0.00005441633,0.000072481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036360117,0.00013765179,0.00012478235,0.00006710958,0.0002589332,0.0003024062,0.0010738866,0.00004353765,0.000006883929],"category_scores_gemma":[0.00009951711,0.000075357646,0.000042150274,0.00018194442,0.000092422604,0.001006068,0.0004791157,0.000059949307,0.000029021807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065998715,0.000032166572,0.0006437219,0.000008849224,0.000032153384,0.0000029841785,0.00010307619,6.4753357e-7,0.00014749663,0.8761904,0.005624671,0.1172072],"study_design_scores_gemma":[0.0060503636,0.00031022693,0.018108428,0.00010442019,0.00006925553,0.000010094373,0.000081434446,0.017791182,0.002402248,0.80627567,0.14803882,0.0007578397],"about_ca_topic_score_codex":0.000022356397,"about_ca_topic_score_gemma":0.000004322749,"teacher_disagreement_score":0.6217357,"about_ca_system_score_codex":0.000018668607,"about_ca_system_score_gemma":0.0000256306,"threshold_uncertainty_score":0.30729955},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89196706,0.00037491194,0.09515663,0.0021386,0.0017548123,0.00085136946,0.000020870526,0.0003203867,0.0074153533],"genre_scores_gemma":[0.99568534,0.000041439616,0.003577696,0.000044630247,0.0000023079315,0.000021752125,5.983188e-7,0.000018921104,0.00060732476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979903,0.00021105631,0.0002791312,0.0004730639,0.0005768807,0.0004695751],"domain_scores_gemma":[0.99808365,0.0004022398,0.00011931525,0.0008648786,0.00037033774,0.00015957445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048417418,0.00018867802,0.00026330305,0.00022194447,0.000092339375,0.000029993906,0.0011618823,0.00006625533,0.00011166351],"category_scores_gemma":[0.00013799436,0.00013800903,0.00012454961,0.00078771415,0.00025471227,0.0005380211,0.00031260657,0.00013794121,0.00012470991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038248145,0.0001399739,0.0020478207,0.000008751672,0.00004758937,0.00001913016,0.00040792284,8.012318e-7,0.016386734,0.9767468,0.00026477248,0.003891446],"study_design_scores_gemma":[0.0012802569,0.00034958232,0.005602774,0.00007198446,0.0000057612874,0.000013206648,0.00002959452,0.00006783987,0.048430692,0.94353765,0.00039799197,0.00021267415],"about_ca_topic_score_codex":0.000008367284,"about_ca_topic_score_gemma":0.0000014421541,"teacher_disagreement_score":0.10371827,"about_ca_system_score_codex":0.00005194709,"about_ca_system_score_gemma":0.000120818666,"threshold_uncertainty_score":0.56278443},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9782563,0.00020428842,0.000022372164,0.00008782158,0.002984411,0.000104812774,0.0000045563565,0.00013817509,0.018197248],"genre_scores_gemma":[0.9991728,0.000055245207,0.000010047907,0.000006028325,0.000009545838,0.000023277937,3.5675293e-7,0.000021296699,0.0007014092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933326,0.00004825186,0.00020659415,0.00008609853,0.00012395099,0.00020184947],"domain_scores_gemma":[0.99930584,0.00024832704,0.000035806584,0.00032709356,0.00003658779,0.000046338504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002645291,0.000101194935,0.00013435046,0.000017417005,0.000072970404,0.000012195289,0.000238118,0.00005944983,0.00006783864],"category_scores_gemma":[0.00003600633,0.00005534262,0.00007116749,0.00012767389,0.00008264762,0.000074073774,0.000022749227,0.000056381934,0.00024860815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010373901,0.000012849198,0.0030553595,0.000016455706,0.00004778588,0.0000016431885,0.00008228648,0.000004167235,0.0066163787,0.9830173,0.0043844553,0.0027509134],"study_design_scores_gemma":[0.0011369657,0.00004387486,0.0037484318,0.000093328126,0.000018817513,0.0000166346,0.00011476333,0.00010183877,0.031565275,0.89368004,0.06922206,0.00025796614],"about_ca_topic_score_codex":0.0000031167408,"about_ca_topic_score_gemma":0.0000013574154,"teacher_disagreement_score":0.08933729,"about_ca_system_score_codex":0.00002273409,"about_ca_system_score_gemma":0.0000074303102,"threshold_uncertainty_score":0.31954378},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9644956,0.00022196726,0.024478054,0.0025084878,0.003844862,0.00027348337,0.000026156711,0.00037566086,0.0037757207],"genre_scores_gemma":[0.98925537,0.000020353858,0.010539035,0.00006880162,0.0000078652165,0.000011769007,5.869733e-7,0.000010373015,0.00008587324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982148,0.000121422774,0.0003700019,0.00049337174,0.0004275903,0.0003728398],"domain_scores_gemma":[0.99727327,0.00032158225,0.00014727107,0.0019307387,0.00018402362,0.00014310025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005058192,0.00017820117,0.00027751655,0.00012443516,0.00013033062,0.00005653947,0.002185817,0.00008644826,0.00005597867],"category_scores_gemma":[0.00019568238,0.00013486197,0.00018640331,0.00062500796,0.00031675285,0.00057221524,0.00077124557,0.00012772287,0.000044254517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014537426,0.00018481947,0.0018660533,0.0000120169425,0.000017679295,0.0000052060814,0.0001292283,4.414017e-7,0.0014973417,0.97022486,0.00087663607,0.025171177],"study_design_scores_gemma":[0.0010172692,0.00030186586,0.013697856,0.000035123354,0.000005142833,0.000007692052,0.0000064692704,0.0005291724,0.002991536,0.979856,0.0013529152,0.00019896642],"about_ca_topic_score_codex":0.00006527119,"about_ca_topic_score_gemma":0.00001157635,"teacher_disagreement_score":0.02497221,"about_ca_system_score_codex":0.000037934133,"about_ca_system_score_gemma":0.0000671923,"threshold_uncertainty_score":0.54995114},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99128205,0.0001941926,0.000024764282,0.00014981788,0.004345775,0.00012975352,0.0000054959755,0.00046685166,0.0034012916],"genre_scores_gemma":[0.99970603,0.000048740698,0.0000051010516,0.000040971267,0.000014268059,0.000027422384,0.0000026613639,0.000031565763,0.00012321198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992585,0.00004489649,0.0001671641,0.00014825682,0.00015975394,0.0002214056],"domain_scores_gemma":[0.9994003,0.0001947105,0.000026298385,0.00028035603,0.000027901324,0.00007039521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017093838,0.00015307542,0.00015066579,0.00012036111,0.0000634584,0.000020909863,0.00015740954,0.00008595526,0.00003201532],"category_scores_gemma":[0.00003940268,0.000109800174,0.00007277318,0.0001568484,0.00003766654,0.00019468606,0.0000127431185,0.000078227255,0.00041151617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071139148,0.0000420511,0.00105643,0.000015919755,0.000026137908,0.0000033487502,0.000053244567,0.000013999623,0.0072981343,0.9881188,0.0012110877,0.0021537181],"study_design_scores_gemma":[0.00090871577,0.00010290522,0.0037376615,0.00007757579,0.0000068495137,0.000002156642,0.000009693683,0.00006820802,0.027600596,0.96577716,0.0015097347,0.00019871992],"about_ca_topic_score_codex":0.000002384645,"about_ca_topic_score_gemma":5.8637676e-7,"teacher_disagreement_score":0.02234163,"about_ca_system_score_codex":0.00004297096,"about_ca_system_score_gemma":0.0000043092436,"threshold_uncertainty_score":0.5289345},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.896428,0.000056526897,0.102253534,0.00050210336,0.0004185672,0.00013353543,0.000003524398,0.00007617843,0.00012802756],"genre_scores_gemma":[0.9990919,0.00003715285,0.0006680324,0.00003041892,0.0000027210187,0.000008441342,0.0000012503167,0.000004042923,0.0001560023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947196,0.000028607603,0.00012090635,0.00018234045,0.0000979053,0.00009830091],"domain_scores_gemma":[0.99951607,0.000043391872,0.000080210215,0.0002433691,0.000047620622,0.00006930951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011020583,0.00006615634,0.000088308836,0.00005860111,0.000042664462,0.000016800455,0.00028926937,0.000030880787,0.000005059722],"category_scores_gemma":[0.0000137131765,0.000048229216,0.000023919423,0.0002577262,0.000020802348,0.000355252,0.00008257355,0.00002416947,0.000013491585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018618015,0.000016660051,0.0006723987,0.000003528912,0.0000047117637,2.7652652e-7,0.00008981974,1.4798507e-8,0.08007907,0.8784264,0.000010907341,0.04069435],"study_design_scores_gemma":[0.00039052547,0.00004160721,0.017762735,0.000016521466,0.0000030007893,0.0000021343383,0.000001326589,0.00026220008,0.036402836,0.9447313,0.0003079218,0.00007790259],"about_ca_topic_score_codex":0.0000019009173,"about_ca_topic_score_gemma":1.1953226e-7,"teacher_disagreement_score":0.102663934,"about_ca_system_score_codex":0.000004524929,"about_ca_system_score_gemma":0.00001793063,"threshold_uncertainty_score":0.19667304},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99578017,0.0006717445,0.00056965085,0.001446678,0.0004366965,0.0002091315,0.0000395824,0.000052617408,0.0007937163],"genre_scores_gemma":[0.9988346,0.00011937876,0.00023326829,0.000039504328,0.000016349446,0.00008807762,0.0000010028623,0.00001334696,0.00065443234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948853,0.000021368858,0.00015354669,0.00012228759,0.00007378963,0.00014044513],"domain_scores_gemma":[0.9984976,0.0010506874,0.000080682265,0.0002991725,0.000034289522,0.00003756832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020021726,0.00008246825,0.00012859334,0.00003259269,0.00012585816,0.000013309517,0.0001738381,0.000040239112,0.000014110064],"category_scores_gemma":[0.000078652345,0.000046359037,0.00007632705,0.000086922664,0.00016287991,0.00006949455,0.000028853017,0.000029310386,0.0000012179446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014643428,0.00006335044,0.00018499902,0.000012868539,0.0000404931,1.3713587e-7,0.000083599654,1.3374824e-8,0.0025964251,0.9935091,0.0022264034,0.0012679506],"study_design_scores_gemma":[0.00061094796,0.000055615666,0.0005544575,0.000015850494,0.00003893553,0.000002153073,0.000024635152,0.00000767406,0.009249353,0.98310536,0.006263619,0.00007141819],"about_ca_topic_score_codex":0.0000066853067,"about_ca_topic_score_gemma":0.000003583406,"teacher_disagreement_score":0.010403775,"about_ca_system_score_codex":0.000007312041,"about_ca_system_score_gemma":0.000012136751,"threshold_uncertainty_score":0.18904667},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99577165,0.00005550706,0.000025292517,0.00021729356,0.00024104475,0.00016991857,0.000013602574,0.00009592377,0.0034097892],"genre_scores_gemma":[0.9994766,0.000037884256,0.00023343223,0.000011781646,0.0000016770225,0.0000067377855,0.0000016319611,0.000014114719,0.00021614585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991438,0.00007505999,0.00029949052,0.00016179647,0.00015341406,0.0001664883],"domain_scores_gemma":[0.9987139,0.00056741224,0.00022171937,0.00036839145,0.00006869621,0.00005988195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029859247,0.00010484662,0.00018734028,0.000099128985,0.000082624676,0.0000065688087,0.0002470685,0.000089564805,0.00013138489],"category_scores_gemma":[0.00020306547,0.0000723376,0.00009310195,0.0003570617,0.0001402933,0.00009448283,0.00004918083,0.00007239349,0.00004749969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008045169,0.0001964244,0.008302725,0.000018305498,0.00004186466,9.763546e-7,0.00021988658,6.527731e-8,0.0021556092,0.98736113,0.0008106187,0.000884372],"study_design_scores_gemma":[0.00060025544,0.000031026873,0.004792524,0.000049732633,0.00003297908,0.0000021225915,0.000050572704,0.0000019098254,0.017571572,0.9765281,0.00023916269,0.000100007484],"about_ca_topic_score_codex":0.000005684573,"about_ca_topic_score_gemma":0.0000013535049,"teacher_disagreement_score":0.015415964,"about_ca_system_score_codex":0.000013954928,"about_ca_system_score_gemma":0.000015419753,"threshold_uncertainty_score":0.2949842},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9884119,0.00011865801,0.00010633606,0.000020047511,0.0021159062,0.00006796084,0.000002751973,0.00012442203,0.0090320045],"genre_scores_gemma":[0.9997051,0.000012305636,0.0000139692465,0.000012367591,0.000005150637,0.0000045684337,5.423822e-7,0.000019841886,0.00022618116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995352,0.000030651318,0.0001237973,0.00008477422,0.000094263596,0.00013128888],"domain_scores_gemma":[0.9995771,0.00009177484,0.00001948234,0.00023702477,0.000033646713,0.000040951716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012077937,0.00008512141,0.00011954145,0.000050909362,0.000019015653,0.000004705847,0.00011638107,0.000056569163,0.000087089706],"category_scores_gemma":[0.000032178013,0.00006093056,0.000035480116,0.00012957142,0.000028538463,0.000053959968,0.000009067084,0.00004571029,0.00021705848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001602068,0.000023968147,0.00039196375,0.00002359554,0.000030990417,0.0000022785277,0.000063181134,0.000070776194,0.035067536,0.960462,0.0031931829,0.0006545488],"study_design_scores_gemma":[0.0010247186,0.00024820122,0.0014282095,0.00020728218,0.000013557095,0.0000029874216,0.00002337373,0.00012877966,0.10799485,0.8859618,0.0027247474,0.00024155123],"about_ca_topic_score_codex":0.0000014371536,"about_ca_topic_score_gemma":2.781646e-7,"teacher_disagreement_score":0.07450022,"about_ca_system_score_codex":0.000018121833,"about_ca_system_score_gemma":0.000006921712,"threshold_uncertainty_score":0.278992},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99480504,0.000070358685,0.0041988925,0.000076034834,0.00029586884,0.0002782865,0.000029419838,0.000017797873,0.00022829165],"genre_scores_gemma":[0.9997379,0.00000803293,0.0000755541,0.0000012308285,0.000010228691,0.00003437627,0.0000012289496,0.000009051659,0.00012237471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992537,0.000045344525,0.00034809433,0.000105890496,0.00014607492,0.000100907215],"domain_scores_gemma":[0.9987164,0.0006620248,0.0002758574,0.000199059,0.00010600621,0.000040645267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016695044,0.00007352165,0.00019557416,0.000021035848,0.000066422675,0.000006031306,0.000113779344,0.00004389827,0.0000035846979],"category_scores_gemma":[0.00017815972,0.00004034437,0.00003578609,0.000063733634,0.00006023209,0.000040922976,0.000043166263,0.000030023954,0.0000044288577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023248347,0.00004211154,0.00039701525,0.000099117584,0.000019792358,1.2498275e-7,0.000034295335,6.649878e-8,0.016965175,0.9807331,0.000024129105,0.0016618543],"study_design_scores_gemma":[0.0026150208,0.00019985755,0.014135823,0.00048412767,0.00009567245,0.000011600591,0.00018327574,0.0027797075,0.009184911,0.9693483,0.0006822337,0.0002794839],"about_ca_topic_score_codex":0.0000075672574,"about_ca_topic_score_gemma":0.000002933785,"teacher_disagreement_score":0.013738807,"about_ca_system_score_codex":0.000029369372,"about_ca_system_score_gemma":0.000018805993,"threshold_uncertainty_score":0.16451956},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99122405,0.00008348264,0.001648258,0.0005507374,0.0014758126,0.00018592185,0.00000600929,0.00028543064,0.0045402693],"genre_scores_gemma":[0.9950851,0.000006208428,0.004722776,0.000058788017,0.0000014957698,0.00001252436,0.0000011951142,0.000019699968,0.000092200964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796,0.00007717483,0.00041903846,0.0005438321,0.00052139215,0.00047861857],"domain_scores_gemma":[0.9981109,0.00041692948,0.00030891306,0.00063188357,0.00033027807,0.00020112355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005615103,0.00023810082,0.0003354715,0.00012697052,0.00019872884,0.00011951694,0.00070085423,0.00007690937,0.000011530697],"category_scores_gemma":[0.0006017197,0.00016227271,0.00009518531,0.00051844853,0.00032572026,0.00037920303,0.00030173315,0.0001599521,0.000012637745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015001093,0.000086994914,0.016114827,0.00002376413,0.000038350052,0.000040669056,0.00025619412,0.0000053906274,0.00317242,0.9747775,0.00024979102,0.005219057],"study_design_scores_gemma":[0.002934045,0.00052007183,0.01057935,0.0008953412,0.000031931122,0.000096895375,0.00006803342,0.0004963531,0.007350469,0.97622615,0.0002482688,0.00055310846],"about_ca_topic_score_codex":0.00008291511,"about_ca_topic_score_gemma":0.0000048379598,"teacher_disagreement_score":0.005535477,"about_ca_system_score_codex":0.00005035093,"about_ca_system_score_gemma":0.000106951265,"threshold_uncertainty_score":0.6617289},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9754182,0.00011904093,0.019093422,0.0013508654,0.0006832013,0.00020023977,0.0000039422557,0.00046296767,0.0026681165],"genre_scores_gemma":[0.99744207,0.000025247165,0.0023579872,0.000042911204,0.0000015889931,0.000016120222,0.0000016368092,0.000008778849,0.00010368742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991069,0.000037989448,0.000208443,0.0002729784,0.0001805584,0.0001931372],"domain_scores_gemma":[0.9988181,0.00015628386,0.00010256538,0.00078457815,0.000059096274,0.000079370155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012384284,0.000104818195,0.00014698945,0.00008083058,0.00007676278,0.000031443742,0.00088509155,0.000046065896,0.000013573749],"category_scores_gemma":[0.000023318084,0.00007518338,0.000072478964,0.0004149471,0.000041097443,0.0003053528,0.00021032197,0.000053326185,0.000100517726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.2493376e-7,0.00010438524,0.0007985063,0.000005289958,0.000016166068,0.0000015198647,0.00017255143,5.683899e-8,0.011565249,0.9767667,0.00036456654,0.010204368],"study_design_scores_gemma":[0.00088694645,0.00006028411,0.007378621,0.000031722488,0.000011947773,0.0000066389534,0.000007655779,0.0020731583,0.027924208,0.9570274,0.004389244,0.00020218438],"about_ca_topic_score_codex":0.000019338162,"about_ca_topic_score_gemma":0.0000021052672,"teacher_disagreement_score":0.022023838,"about_ca_system_score_codex":0.000023780076,"about_ca_system_score_gemma":0.00004366767,"threshold_uncertainty_score":0.30658895},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9955055,0.0003246965,0.00027920157,0.0003640597,0.0007959873,0.00016177386,0.000010782278,0.00005558736,0.0025023893],"genre_scores_gemma":[0.9997834,0.000048578113,0.000022392416,0.000015442485,0.0000065270738,0.000026849264,5.2097505e-7,0.000009550276,0.00008674094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956965,0.000016876596,0.00012009697,0.000079353464,0.000115870505,0.00009814382],"domain_scores_gemma":[0.99939233,0.00036541247,0.000026137348,0.00015519263,0.000030199173,0.00003074703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010462739,0.000071494636,0.000100011704,0.000026417361,0.000027674027,0.0000112324005,0.000089827394,0.000031150375,0.00000524036],"category_scores_gemma":[0.000048047365,0.000041520194,0.000023844046,0.000047451827,0.000035536425,0.000045036373,0.000017135293,0.000043822914,0.00001554405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011264597,0.000015372345,0.0007901369,0.000031077325,0.000024069133,0.0000018950307,0.000065624656,0.0011029986,0.0066789007,0.9870111,0.00022645302,0.0040411097],"study_design_scores_gemma":[0.006235257,0.000459717,0.13610579,0.001268892,0.00007328496,0.00003097134,0.0000998096,0.18280794,0.0024500503,0.6646937,0.004858552,0.0009160303],"about_ca_topic_score_codex":0.000008433477,"about_ca_topic_score_gemma":0.0000023249436,"teacher_disagreement_score":0.3223174,"about_ca_system_score_codex":0.000022274084,"about_ca_system_score_gemma":0.0000069672137,"threshold_uncertainty_score":0.16931444},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97468746,0.0007506309,0.008363527,0.0035913733,0.0030354373,0.0014833458,0.000095748044,0.00045398928,0.0075384835],"genre_scores_gemma":[0.95421475,0.00014650394,0.025309708,0.000050950493,0.00005102244,0.00020021913,0.0000027977574,0.00006763557,0.019956408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990605,0.000028795856,0.00028820938,0.00022565514,0.00014645694,0.00025034664],"domain_scores_gemma":[0.99737376,0.0020322215,0.00012681473,0.00029210243,0.000079607045,0.00009551605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023871503,0.00013980776,0.00023389887,0.00004916023,0.00013593886,0.00003182153,0.000139291,0.00008079716,0.0000492207],"category_scores_gemma":[0.0019381666,0.00010555639,0.000060169397,0.00006773279,0.00015001104,0.00041853497,0.000073960604,0.00006495078,0.00007002166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000082155075,0.00005064758,0.00021726817,0.000057689336,0.000018099237,7.161437e-7,0.00016353079,3.756151e-8,0.00032917323,0.98874015,0.010028011,0.00038646584],"study_design_scores_gemma":[0.00080584054,0.000046067074,0.00009759058,0.00013136044,0.000032985386,0.0000040608697,0.000057541867,0.000009769223,0.0012056812,0.9955946,0.0018493074,0.00016516745],"about_ca_topic_score_codex":0.0000041755834,"about_ca_topic_score_gemma":0.000004831467,"teacher_disagreement_score":0.020472711,"about_ca_system_score_codex":0.00006987465,"about_ca_system_score_gemma":0.000029184714,"threshold_uncertainty_score":0.43044648},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.996407,0.0005142918,0.0000075172775,0.0005047014,0.00019166365,0.00025346616,0.000010535782,0.00006631276,0.0020445536],"genre_scores_gemma":[0.9989306,0.0005460331,0.00007491204,0.000020293035,0.0000020921777,0.00005738186,0.0000010315543,0.00001798954,0.0003496978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989969,0.0001263341,0.00030729652,0.00018925245,0.00016594576,0.00021423075],"domain_scores_gemma":[0.9974892,0.0016583969,0.00021661645,0.00051502004,0.000043949945,0.000076806595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005456547,0.00013845804,0.00020978504,0.000109181914,0.0002900637,0.00002146504,0.00032146313,0.000075924305,0.00001931444],"category_scores_gemma":[0.00016033981,0.000075572294,0.00009624436,0.000379727,0.0004541959,0.00008801099,0.000065666536,0.00008682249,0.000011208518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016813137,0.00007732108,0.0054895175,0.000011413523,0.000055869827,4.807557e-7,0.00014407841,3.8288843e-9,0.0016405586,0.9858611,0.0009966402,0.0057061673],"study_design_scores_gemma":[0.0011120947,0.000055267174,0.005837292,0.00004473853,0.00004922985,0.0000028883558,0.00006760179,0.0000012126085,0.0025395232,0.9877483,0.0024331093,0.00010870941],"about_ca_topic_score_codex":0.000008974329,"about_ca_topic_score_gemma":0.000026030108,"teacher_disagreement_score":0.0055974578,"about_ca_system_score_codex":0.0000073560996,"about_ca_system_score_gemma":0.000015383093,"threshold_uncertainty_score":0.30817485},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99001807,0.00010555282,0.000052569518,0.000015838295,0.0015896686,0.00009796389,0.00003529284,0.00011006556,0.007975005],"genre_scores_gemma":[0.99975485,0.00002068331,0.000024083594,0.000003542839,0.0000019610777,0.00001471277,0.0000030442968,0.000020002311,0.00015710774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934506,0.00005084949,0.00025397775,0.00009722417,0.000107287975,0.00014558874],"domain_scores_gemma":[0.9994326,0.00010371335,0.000056843204,0.00029368006,0.00005694486,0.000056190056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013180997,0.00010099797,0.00018703497,0.00011022518,0.000028726572,0.000003987372,0.00015901116,0.00006783068,0.00012860155],"category_scores_gemma":[0.000025515117,0.00008111805,0.000077527104,0.0001993945,0.0000610791,0.00011370892,0.00002889086,0.00006165551,0.000033311764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023207147,0.00010142248,0.0024764002,0.00015904993,0.0001587655,0.0000030236763,0.0013040869,0.000092746304,0.23734383,0.7557438,0.0018700883,0.00072357635],"study_design_scores_gemma":[0.001616535,0.00023119707,0.0023175534,0.00066366803,0.00004356426,0.00001208296,0.0010915251,0.00024589652,0.29271507,0.6986494,0.0021055527,0.00030791335],"about_ca_topic_score_codex":0.000026388605,"about_ca_topic_score_gemma":0.000006172701,"teacher_disagreement_score":0.05709437,"about_ca_system_score_codex":0.00002259871,"about_ca_system_score_gemma":0.00001391542,"threshold_uncertainty_score":0.3307898},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9307578,0.000119423035,0.06374547,0.0025872611,0.0008484282,0.00035491766,0.0000090546255,0.0002754419,0.0013021748],"genre_scores_gemma":[0.99216455,0.000020632966,0.0072885333,0.00008211111,0.00001323031,0.0000803336,0.000001955527,0.000019783522,0.00032884616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821997,0.00011466116,0.00027460844,0.0005183177,0.0002935199,0.0005789325],"domain_scores_gemma":[0.99828726,0.00050582294,0.000102514365,0.0006882914,0.00017854618,0.00023753908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046987753,0.0001836423,0.00021053327,0.00016805342,0.00084661273,0.00036361234,0.0005735665,0.000079780584,0.000019474199],"category_scores_gemma":[0.00031886713,0.00014694552,0.000056036017,0.0007474552,0.00039851334,0.0009475981,0.0003696509,0.00016075744,0.000089131274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026926358,0.00026323847,0.018594317,0.000024944618,0.000044776767,0.000074361924,0.0007970377,0.000032682554,0.040623073,0.90805596,0.0022760811,0.029186612],"study_design_scores_gemma":[0.0015523778,0.00014655445,0.020799939,0.00012735135,0.0000071188606,0.000023416944,0.00003077401,0.0019361153,0.006205439,0.9675418,0.0013363407,0.00029273418],"about_ca_topic_score_codex":0.000016472311,"about_ca_topic_score_gemma":0.00002063273,"teacher_disagreement_score":0.061406743,"about_ca_system_score_codex":0.000064086096,"about_ca_system_score_gemma":0.00014047613,"threshold_uncertainty_score":0.65115464},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9974455,0.00011307029,0.000030114594,0.00040528495,0.00020511902,0.00018531305,0.000004822097,0.000032286192,0.0015784645],"genre_scores_gemma":[0.99938315,0.00003170644,0.00008733392,0.000013094969,0.0000057256534,0.00006707389,7.0138583e-7,0.000010370906,0.00040084796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920464,0.00012175879,0.00025232518,0.00011703162,0.00014847393,0.00015577617],"domain_scores_gemma":[0.9980161,0.0014693992,0.00013078297,0.0003071307,0.000045926365,0.00003066624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051382004,0.000083213155,0.00015200145,0.00005720118,0.00010307633,0.000009412344,0.0002532455,0.000048095564,0.000027661557],"category_scores_gemma":[0.00030556528,0.000044474702,0.000056977624,0.00021538328,0.00016272774,0.00006215791,0.00004090113,0.00005961527,0.000009063628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050917224,0.00010928824,0.0020349184,0.0000052951013,0.00001893233,4.6282167e-7,0.00050502096,5.8566147e-8,0.0030817818,0.99331635,0.0003192243,0.00055776525],"study_design_scores_gemma":[0.0017598462,0.000022953896,0.0027496365,0.00004095258,0.000009360829,7.969407e-7,0.00019646603,0.0000039429974,0.009679686,0.98517734,0.00029176442,0.00006724611],"about_ca_topic_score_codex":0.000006410725,"about_ca_topic_score_gemma":0.000008658154,"teacher_disagreement_score":0.008138988,"about_ca_system_score_codex":0.0000139978,"about_ca_system_score_gemma":0.000026259851,"threshold_uncertainty_score":0.18136257},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9595944,0.000011109164,0.024626233,0.00022911011,0.00024495285,0.00019621654,0.00002227834,0.000054420063,0.0150212785],"genre_scores_gemma":[0.99791694,0.000001341945,0.00079283834,0.000011186012,0.000027692182,0.000040625404,0.000007654378,0.000018810573,0.0011829394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925214,0.000021749263,0.00019235433,0.00021935812,0.000102629616,0.00021174381],"domain_scores_gemma":[0.9991489,0.00038378662,0.00008640059,0.00022690606,0.00004005554,0.0001139698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010452668,0.00012244772,0.00014129393,0.000020950047,0.00022494135,0.00003412539,0.000105990526,0.00003776253,0.00016449411],"category_scores_gemma":[0.000034516845,0.000093288676,0.000046478097,0.000120980476,0.00017100303,0.00014788748,0.00006522587,0.00007964843,0.00007565103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003670313,0.00005345489,0.08925936,0.0000037276402,0.00001088045,1.858679e-7,0.00008144957,0.000003816025,0.00007581319,0.90875226,0.00027974416,0.0014756377],"study_design_scores_gemma":[0.0006844894,0.0000132134355,0.005507309,0.000031168856,0.000019541592,3.5684602e-7,0.0001676124,0.00004103021,0.00034173336,0.99025714,0.0027771478,0.00015925468],"about_ca_topic_score_codex":0.000037447142,"about_ca_topic_score_gemma":0.0000011876142,"teacher_disagreement_score":0.08375205,"about_ca_system_score_codex":0.000022666432,"about_ca_system_score_gemma":0.000014330201,"threshold_uncertainty_score":0.38042018},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99108166,0.00006352501,0.00005192463,0.0012158207,0.001908714,0.00021401871,0.000027747898,0.00005593971,0.005380672],"genre_scores_gemma":[0.9984686,0.000038533344,0.0002100756,0.00008946273,0.0001980486,0.000015478248,8.810934e-7,0.000026068574,0.0009529009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874705,0.00007391778,0.00037037724,0.0002330897,0.00031657962,0.0002589979],"domain_scores_gemma":[0.99737257,0.0016201321,0.00021188261,0.0006665252,0.00006887253,0.000060034854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038127488,0.00016230656,0.00024476668,0.00006697545,0.0000904844,0.000011593666,0.00035165594,0.000085659114,0.000121382516],"category_scores_gemma":[0.0011893737,0.00008597798,0.000103204664,0.0001990762,0.00012987046,0.00013598209,0.00008230954,0.00011980855,0.00012832177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011714989,0.00013942308,0.00007685638,0.000012585325,0.000020315478,0.0000059930667,0.00017595146,5.2254656e-8,0.0017841813,0.9825506,0.00793319,0.0071836826],"study_design_scores_gemma":[0.001332788,0.00018392345,0.0016610485,0.000113455404,0.000012638364,0.0000022095073,0.000062161234,7.778449e-7,0.011994742,0.9828949,0.001607191,0.00013415053],"about_ca_topic_score_codex":7.570257e-7,"about_ca_topic_score_gemma":0.0000019918914,"teacher_disagreement_score":0.010210561,"about_ca_system_score_codex":0.000043234373,"about_ca_system_score_gemma":0.00002333132,"threshold_uncertainty_score":0.35060805},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19249906,0.0002263092,0.78707314,0.0050366432,0.0050152256,0.0008885419,0.0000049942487,0.00093147927,0.008324623],"genre_scores_gemma":[0.9983153,0.0000032389992,0.0012608636,0.00005929663,0.000008332869,0.00004554341,0.0000019573151,0.0000075449525,0.00029797415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988719,0.00011412958,0.00023035902,0.00031952237,0.00019518529,0.00026887274],"domain_scores_gemma":[0.99911034,0.000113043425,0.00009168836,0.0005356295,0.00008293996,0.00006636981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050961843,0.00011903242,0.00014888709,0.00010936335,0.00004970794,0.00007975899,0.00076251803,0.00009503766,0.0000050664935],"category_scores_gemma":[0.00006822641,0.000089783774,0.000028177343,0.0005888524,0.000027492833,0.0003012537,0.00014552526,0.00009258972,0.00015883033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029333319,0.00008142862,0.005048286,0.000014752052,0.000005131827,0.000015198333,0.00018748632,0.000038326587,0.0011756632,0.9843734,0.00451629,0.0045410837],"study_design_scores_gemma":[0.0030362068,0.00030528696,0.02716938,0.00081516744,0.000005401293,0.00006633797,0.000037794853,0.0086847795,0.007163899,0.8887676,0.062966846,0.0009813083],"about_ca_topic_score_codex":0.000059176116,"about_ca_topic_score_gemma":0.000006556722,"teacher_disagreement_score":0.8058162,"about_ca_system_score_codex":0.00010106765,"about_ca_system_score_gemma":0.00008015525,"threshold_uncertainty_score":0.3661276},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9873401,0.000075101016,0.005480672,0.003226584,0.000559019,0.0006211246,0.000005389884,0.00012425224,0.0025677918],"genre_scores_gemma":[0.9990041,0.00004444336,0.00030821122,0.00027586342,0.0000060600314,0.00008250609,6.150805e-7,0.000025374267,0.0002528165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972666,0.0007576243,0.00036400152,0.00050155044,0.0005636779,0.0005465495],"domain_scores_gemma":[0.99093276,0.0071512633,0.00019560636,0.0013058162,0.00029638,0.00011818534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012680739,0.00024862573,0.0003525041,0.000079562706,0.00034318256,0.000096649645,0.0013688419,0.0000898778,0.00013902296],"category_scores_gemma":[0.0012628357,0.000119401004,0.00012493695,0.00086919736,0.0009631207,0.00028324235,0.00050183636,0.0002872559,0.00012554103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012719516,0.00005407943,0.002065991,0.000010260004,0.000054783446,0.0000068011186,0.00045829525,0.000002632995,0.0008368265,0.9950205,0.0002909193,0.0010717269],"study_design_scores_gemma":[0.0033173768,0.000080872356,0.0021038572,0.000107921616,0.000014657662,0.00003528188,0.00006100254,0.0012160947,0.0036043113,0.9891614,0.0001039166,0.00019333416],"about_ca_topic_score_codex":0.00004590515,"about_ca_topic_score_gemma":0.0000070621345,"teacher_disagreement_score":0.011664045,"about_ca_system_score_codex":0.000037750186,"about_ca_system_score_gemma":0.000059663478,"threshold_uncertainty_score":0.48690316},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937336,0.00011177159,0.000046551086,0.00059753266,0.00026773097,0.0001570887,0.000006360884,0.00005602702,0.0050233607],"genre_scores_gemma":[0.9989242,0.00008232595,0.00014486218,0.000013182533,0.0000031053892,0.000032884353,4.0302362e-7,0.000013304929,0.0007857365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993108,0.000080047794,0.00021081835,0.0001128332,0.0001306436,0.00015487602],"domain_scores_gemma":[0.9983095,0.00093149894,0.000118598,0.00053347513,0.00006604177,0.000040908988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003847834,0.000082985855,0.00011678047,0.000030905794,0.00018824176,0.000009528483,0.00032470605,0.000041173473,0.000026895817],"category_scores_gemma":[0.00017106239,0.000043699565,0.00008746064,0.00018862095,0.00022452902,0.00004764702,0.000048966183,0.00005094947,0.000040551102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050510357,0.00006773194,0.0006797161,0.0000050932854,0.000026063388,1.9214507e-7,0.00006888211,1.1841287e-8,0.002607331,0.99124926,0.0016393248,0.0036513358],"study_design_scores_gemma":[0.0002887495,0.00002625222,0.00084596814,0.000023948644,0.000017997709,0.0000012715432,0.0000626377,0.0000013632318,0.012232028,0.9829289,0.003505174,0.00006571828],"about_ca_topic_score_codex":0.0000030075569,"about_ca_topic_score_gemma":0.0000032445841,"teacher_disagreement_score":0.009624696,"about_ca_system_score_codex":0.000009343016,"about_ca_system_score_gemma":0.00001544613,"threshold_uncertainty_score":0.17820166},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99523634,0.00008584922,0.000069140035,0.00025412499,0.0010400487,0.00018550237,0.000007932055,0.00010456465,0.00301648],"genre_scores_gemma":[0.99868447,0.00002566036,0.00076263613,0.0000378647,0.000022404334,0.000014676458,0.0000016937072,0.0000495878,0.00040098894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985046,0.000056548633,0.0004470634,0.0002789838,0.00033599362,0.00037685892],"domain_scores_gemma":[0.9982261,0.0004249893,0.0003660322,0.0007556958,0.00012649667,0.00010070546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045503597,0.00022117903,0.00043509173,0.00011275743,0.00011624074,0.000022144975,0.00044758158,0.00012412181,0.00009665502],"category_scores_gemma":[0.0003094821,0.0001642292,0.00017700005,0.00020093497,0.00014344265,0.0001792058,0.00016748962,0.00013580896,0.00005277191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000122639885,0.00020190803,0.019232545,0.000115232346,0.000066733104,0.000009156356,0.00041209243,6.645428e-8,0.00880953,0.9661239,0.003412245,0.0016043476],"study_design_scores_gemma":[0.0011938425,0.00006313836,0.01031304,0.00033747702,0.000033631764,0.0000060591174,0.0001780241,0.0000058184683,0.05023803,0.93705016,0.00035363232,0.00022712105],"about_ca_topic_score_codex":0.000018497749,"about_ca_topic_score_gemma":0.000009668978,"teacher_disagreement_score":0.041428495,"about_ca_system_score_codex":0.000044680914,"about_ca_system_score_gemma":0.000030125873,"threshold_uncertainty_score":0.66970724},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8576686,0.0000067045016,0.0020274026,0.0058698365,0.00043645242,0.00032414205,0.000026453403,0.0000201146,0.13362029],"genre_scores_gemma":[0.99875736,5.5880645e-7,0.00004152753,0.00006680939,0.0000072200214,0.000028334616,3.2593462e-7,0.0000072584708,0.0010905842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995973,0.000020363443,0.000104189065,0.00008198526,0.00009472954,0.00010145052],"domain_scores_gemma":[0.99904627,0.0004502319,0.00007186751,0.00038230643,0.000027387776,0.000021939932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006950389,0.00006328864,0.000074989235,0.0000041542644,0.00010096275,0.0000056297245,0.00023688129,0.000011845459,0.0004670726],"category_scores_gemma":[0.000025521696,0.000024819245,0.00007363224,0.00009222535,0.00010576777,0.000025822637,0.00005545666,0.000052273455,0.000068221416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023049213,0.00004744297,0.00035482488,9.07483e-7,0.000011635515,1.2555675e-8,0.000037517944,6.575148e-7,0.00040831475,0.9964485,0.0017406002,0.00094724575],"study_design_scores_gemma":[0.00016486454,0.000010148682,0.00019363349,0.000020989037,0.000005389544,5.1148067e-8,0.00009324477,0.0000021058854,0.007278981,0.98763716,0.004552212,0.000041239295],"about_ca_topic_score_codex":0.0000048841675,"about_ca_topic_score_gemma":9.323795e-8,"teacher_disagreement_score":0.14108877,"about_ca_system_score_codex":0.000008302146,"about_ca_system_score_gemma":0.000011206605,"threshold_uncertainty_score":0.5114117},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99562603,0.00019052521,0.00050323247,0.0010404928,0.00009550522,0.00067039335,0.00007310144,0.0001065833,0.0016941511],"genre_scores_gemma":[0.99910915,0.00017792199,0.00024580615,0.000031302312,0.000008188538,0.00029459017,0.0000033449246,0.00001539632,0.00011427651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992409,0.000039308623,0.00026669318,0.00016337562,0.00012701073,0.00016273253],"domain_scores_gemma":[0.9989971,0.0004880346,0.000070799084,0.00030598373,0.000056305264,0.00008178612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017350691,0.00011847639,0.00016887035,0.00011797999,0.00014697952,0.000009015721,0.00016231157,0.00006151875,0.000022912418],"category_scores_gemma":[0.000043807897,0.00008850383,0.00007773226,0.00023952551,0.000092377624,0.00015525983,0.000013727329,0.00007394972,0.000029126033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000927052,0.00021383163,0.000041274896,0.000031433774,0.000026509808,1.7489354e-7,0.00019115624,1.3676821e-7,0.007185581,0.9913571,0.00031173008,0.0006317932],"study_design_scores_gemma":[0.00069657696,0.000068018504,0.0003336131,0.000035342495,0.000034827106,0.000003715616,0.000029766197,0.000005071498,0.023941593,0.97357136,0.0011688638,0.00011125273],"about_ca_topic_score_codex":9.926373e-7,"about_ca_topic_score_gemma":0.0000012080114,"teacher_disagreement_score":0.017785748,"about_ca_system_score_codex":0.000014230409,"about_ca_system_score_gemma":0.000016250242,"threshold_uncertainty_score":0.36090815},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97405773,0.001082023,0.011940373,0.0063665723,0.0041005523,0.00019372953,0.000024958437,0.0002747469,0.0019593048],"genre_scores_gemma":[0.99953747,0.00015008546,0.000141296,0.000034897846,0.000008506292,0.000014290304,9.665481e-7,0.000004820346,0.000107641165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908125,0.00010728976,0.00019047153,0.00019864709,0.00018117367,0.0002411926],"domain_scores_gemma":[0.9984992,0.0005316033,0.000092273534,0.00074240105,0.00006683082,0.000067703404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038935532,0.00009713873,0.00011598264,0.000050116992,0.00031276266,0.000038816834,0.0010524918,0.000042207146,0.000009130408],"category_scores_gemma":[0.00006534279,0.000054159274,0.00010926847,0.0003992149,0.0002210656,0.0003054644,0.00026335922,0.00006824499,0.00004221559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065082154,0.000060834234,0.0008618592,0.0000017554848,0.000018386481,0.000002452642,0.000037546928,9.496156e-8,0.0032016402,0.9860685,0.0016611076,0.008079333],"study_design_scores_gemma":[0.0003438197,0.000090958965,0.0044592842,0.000024683155,0.000005863307,0.000003031764,0.0000041306685,0.000034804998,0.00910355,0.97183275,0.01400155,0.000095567695],"about_ca_topic_score_codex":0.0000030398844,"about_ca_topic_score_gemma":6.741839e-7,"teacher_disagreement_score":0.025479756,"about_ca_system_score_codex":0.000023381264,"about_ca_system_score_gemma":0.000037955448,"threshold_uncertainty_score":0.24055491},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9038684,0.00094445643,0.0026871527,0.06567524,0.021253655,0.001675456,0.000053000418,0.001211485,0.0026311737],"genre_scores_gemma":[0.99736726,0.00003740449,0.000722611,0.0013867031,0.0000038512444,0.000054256703,0.0000016005076,0.000017232418,0.000409073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831355,0.00006842593,0.00029788507,0.0005333825,0.0003607609,0.00042599562],"domain_scores_gemma":[0.9969489,0.0015882495,0.00012323297,0.0010934465,0.00013158061,0.000114602626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007816838,0.0001927263,0.000167501,0.00013117265,0.00041042542,0.00011100159,0.00089718984,0.0000820692,0.000001448302],"category_scores_gemma":[0.00033546682,0.000103424754,0.0001263268,0.0003153522,0.00007361504,0.00020654436,0.00010215807,0.0001261332,0.00010874148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004654265,0.000085323365,0.000022260345,0.0000032441853,0.000019777566,0.0000026007,0.00009870431,0.000023864037,0.0009035996,0.9788625,0.015110229,0.0048213056],"study_design_scores_gemma":[0.0024588134,0.00051859545,0.0001361194,0.000102894955,0.000008679508,0.0000014274875,0.000005856103,0.001006298,0.0048277145,0.9890144,0.0017338005,0.00018538583],"about_ca_topic_score_codex":0.000019229372,"about_ca_topic_score_gemma":0.0000021578937,"teacher_disagreement_score":0.09349888,"about_ca_system_score_codex":0.000032236676,"about_ca_system_score_gemma":0.00004403536,"threshold_uncertainty_score":0.42175388},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9701379,0.0005480683,0.016277773,0.0029555361,0.0007016479,0.00045470337,0.00004159716,0.00014947382,0.008733324],"genre_scores_gemma":[0.993892,0.000039000646,0.0023221178,0.0000803855,0.00009329438,0.000032769716,0.00000664384,0.000021355763,0.0035124416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993348,0.000015282307,0.0001641132,0.00019731696,0.00007971424,0.00020873715],"domain_scores_gemma":[0.99926424,0.00025813645,0.0000664514,0.0002434081,0.000026289132,0.00014145805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000058223224,0.00012408542,0.00016599792,0.000016332468,0.00011682242,0.00003362385,0.000109315704,0.000028023946,0.00030055607],"category_scores_gemma":[0.00002157878,0.00008896544,0.000049462324,0.000077397206,0.000056899302,0.00019156944,0.00008634342,0.000057605423,0.0000869781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003885633,0.000032559426,0.0010541354,0.0000038188045,0.000018455636,2.6436757e-7,0.0000657427,8.865879e-7,0.0009348647,0.9918057,0.0013684114,0.0047112806],"study_design_scores_gemma":[0.0008253342,0.000013419216,0.00012716134,0.000026384114,0.000011999526,2.9908526e-7,0.000047480113,0.00003232399,0.0018098988,0.98549044,0.0114730215,0.0001422143],"about_ca_topic_score_codex":0.00004331565,"about_ca_topic_score_gemma":5.3373367e-7,"teacher_disagreement_score":0.023754114,"about_ca_system_score_codex":0.000013764616,"about_ca_system_score_gemma":0.000024648794,"threshold_uncertainty_score":0.36279055},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97633797,0.00015308041,0.010189562,0.007282267,0.0020163865,0.00016004173,0.000025179996,0.00017381775,0.0036617015],"genre_scores_gemma":[0.99961287,0.000026576363,0.0000717979,0.00019721006,0.0000069611797,0.000013970097,9.3701294e-7,0.0000045425927,0.00006512135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991557,0.00011611095,0.0001516435,0.00019862434,0.00018762724,0.00019029737],"domain_scores_gemma":[0.9983337,0.00074096065,0.00007618094,0.00073660025,0.000045131765,0.00006741822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033463442,0.000097118434,0.000114115726,0.00005613144,0.00016458455,0.000024693627,0.00090917386,0.000039954924,0.00004966475],"category_scores_gemma":[0.00011916061,0.000052499803,0.00010444952,0.00034625476,0.00014647462,0.00020409883,0.00017034695,0.00008035317,0.00007233144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059385548,0.000087915636,0.00033644252,0.0000015129672,0.000016332506,0.0000018428145,0.000044254542,1.3414797e-7,0.0015903938,0.9923199,0.00324056,0.0023547797],"study_design_scores_gemma":[0.00027524558,0.00009594737,0.002234132,0.00003686148,0.0000048929915,0.0000016901178,0.0000025404142,0.000022625201,0.014365868,0.9804698,0.0024042276,0.000086151755],"about_ca_topic_score_codex":0.000002537764,"about_ca_topic_score_gemma":3.128109e-7,"teacher_disagreement_score":0.02327492,"about_ca_system_score_codex":0.000021041868,"about_ca_system_score_gemma":0.00003206848,"threshold_uncertainty_score":0.21408798},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94107157,0.0000826201,0.05475274,0.0007159336,0.00051910774,0.0002797523,0.000036827416,0.00016758671,0.0023738903],"genre_scores_gemma":[0.99859893,0.000016083663,0.0012276237,0.00005525968,0.0000016508353,0.000014409659,6.5341106e-7,0.000014922267,0.0000704738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980292,0.00021869713,0.00022381208,0.00044863852,0.000545854,0.00053382554],"domain_scores_gemma":[0.9979823,0.00058322714,0.00006112919,0.0008544087,0.00033617963,0.0001827225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039408225,0.00017075006,0.00026478356,0.00013410946,0.0000891558,0.000024620975,0.000876513,0.00006882871,0.000029078134],"category_scores_gemma":[0.00013350582,0.00011187983,0.00007926424,0.00065870717,0.00032926342,0.00049922825,0.00018709255,0.0001547806,0.000020621477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053730637,0.00017178337,0.008716118,0.000015000127,0.000033307162,0.00002423826,0.00020378147,1.2650699e-7,0.004386036,0.98405486,0.000023359136,0.002317673],"study_design_scores_gemma":[0.0016430388,0.00035393922,0.015435699,0.00007214908,0.0000047519643,0.000006684253,0.000022773404,0.00008233593,0.03075664,0.95126915,0.00015536854,0.00019748253],"about_ca_topic_score_codex":0.000009684855,"about_ca_topic_score_gemma":0.000006455471,"teacher_disagreement_score":0.057527382,"about_ca_system_score_codex":0.00004232238,"about_ca_system_score_gemma":0.00008918684,"threshold_uncertainty_score":0.45623273},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99429023,0.000050219376,0.000861417,0.0014960363,0.000091046684,0.00046720932,0.000004237796,0.00010645321,0.0026331472],"genre_scores_gemma":[0.99888605,0.000021679696,0.00034172638,0.00007251168,0.0000071982568,0.00011164687,4.6853543e-7,0.000039779083,0.00051893486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987674,0.00012414203,0.00019951921,0.0003297378,0.00024684478,0.00033238472],"domain_scores_gemma":[0.9977785,0.0012051973,0.00010794455,0.0006913644,0.000068992245,0.00014800372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044179804,0.0002160424,0.00021356576,0.000092469425,0.00055063464,0.00008339777,0.00031780294,0.000077170764,0.000014283766],"category_scores_gemma":[0.00008028745,0.00010669759,0.000043891654,0.00039920004,0.00020321629,0.00011839087,0.000090645146,0.00020494782,0.0000114129125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014965486,0.00006488434,0.009009227,0.00000839924,0.00006955852,0.0000059759263,0.00059565593,6.193282e-7,0.00053530716,0.9877128,0.0003512433,0.0014966667],"study_design_scores_gemma":[0.0010128795,0.0002466865,0.0075477483,0.00012540226,0.000042338652,0.00002705118,0.0004957839,0.000005799741,0.00077347603,0.9886354,0.0008585769,0.00022881739],"about_ca_topic_score_codex":0.000037174308,"about_ca_topic_score_gemma":0.00023448863,"teacher_disagreement_score":0.0045958217,"about_ca_system_score_codex":0.00002336201,"about_ca_system_score_gemma":0.00004082359,"threshold_uncertainty_score":0.43510014},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69524735,0.0005207048,0.29685608,0.0014659867,0.0012454813,0.00033366706,0.0000020565149,0.00092913856,0.0033995695],"genre_scores_gemma":[0.9900806,0.00005763707,0.009356775,0.00013648072,0.000005360376,0.000016740558,9.0699933e-7,0.000011185995,0.00033431506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884206,0.0000821927,0.00021838944,0.00039806394,0.00018497472,0.0002743373],"domain_scores_gemma":[0.99920887,0.000102150065,0.000069374895,0.00045157666,0.00007717933,0.00009084727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025911976,0.00013985031,0.00016890005,0.0001306114,0.00007336644,0.00006762762,0.00036513252,0.000084110354,0.000010179599],"category_scores_gemma":[0.00007923489,0.00011125574,0.000032194574,0.00037844808,0.000052086536,0.00032040942,0.00027001486,0.000090201705,0.000024228888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000641196,0.00014944846,0.011959829,0.000010066192,0.000021410537,0.000044487817,0.0004246624,0.00007095133,0.00090691436,0.97263324,0.0033336657,0.010438929],"study_design_scores_gemma":[0.0062106485,0.00042887818,0.05940269,0.00034074872,0.000016970836,0.00011952619,0.000044431352,0.070883006,0.010614708,0.8430262,0.00753627,0.0013759146],"about_ca_topic_score_codex":0.000029079154,"about_ca_topic_score_gemma":0.0000013551834,"teacher_disagreement_score":0.29483327,"about_ca_system_score_codex":0.000047000074,"about_ca_system_score_gemma":0.000041140313,"threshold_uncertainty_score":0.45368773},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.985936,0.00014043169,0.00008674321,0.00001498204,0.0008972996,0.000118524564,0.00000752968,0.00020256001,0.012595916],"genre_scores_gemma":[0.99973065,0.000024126013,0.000041216015,0.0000068716645,0.0000034043715,0.000015381422,0.000001248402,0.00002833207,0.00014875866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924076,0.00003569661,0.0001977986,0.00013794645,0.00016326238,0.00022454612],"domain_scores_gemma":[0.9994174,0.00007059642,0.0000463806,0.00034737348,0.000045985227,0.00007225538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014761333,0.00014417,0.00021964018,0.00006205871,0.00004083836,0.000010933062,0.00017282396,0.00006864812,0.000047627986],"category_scores_gemma":[0.00001006981,0.00009564995,0.000066321285,0.00023861637,0.00010420925,0.00012477279,0.000016059086,0.00007166916,0.000030669322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032852557,0.00004228641,0.026616491,0.000065575325,0.00012024819,0.0000069159855,0.00017623967,0.00001680763,0.0045064376,0.96732837,0.0006243373,0.00046344992],"study_design_scores_gemma":[0.0028580776,0.00024484916,0.021105554,0.0003948345,0.00005078072,0.000021551039,0.000109341636,0.00007447319,0.04574745,0.9251937,0.003661625,0.0005377148],"about_ca_topic_score_codex":0.000021117956,"about_ca_topic_score_gemma":0.000019319146,"teacher_disagreement_score":0.042134613,"about_ca_system_score_codex":0.000027395126,"about_ca_system_score_gemma":0.000013730691,"threshold_uncertainty_score":0.39004916},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99696755,0.00024533417,0.0014614307,0.00041247628,0.00048173277,0.000167549,0.000004333684,0.00003504052,0.00022456629],"genre_scores_gemma":[0.99916923,0.00005739041,0.0007021306,0.0000166087,8.4601027e-7,0.000009016708,2.2321824e-7,0.000005582752,0.00003899357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988435,0.00018824328,0.00021813456,0.00023576351,0.00032367875,0.00019068187],"domain_scores_gemma":[0.9986062,0.00039512024,0.00015938719,0.0005816981,0.00020348106,0.00005408443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035618665,0.000098461845,0.00015762083,0.00012143619,0.00009457259,0.000017044486,0.00074943184,0.000050053284,0.000007813242],"category_scores_gemma":[0.00019361505,0.000056378856,0.000061644736,0.0006448225,0.00038871725,0.0003756479,0.00022099083,0.00007851944,0.000001894146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008332768,0.000024201852,0.008572921,0.000009715518,0.000012633742,8.7578246e-7,0.00017983779,8.8794076e-7,0.086187996,0.8976152,0.00002968318,0.007357734],"study_design_scores_gemma":[0.00038670047,0.0000911041,0.016127938,0.000036324967,0.0000033120589,0.000003790413,0.000011346813,0.000048700917,0.18887678,0.79432964,0.000019945064,0.000064396365],"about_ca_topic_score_codex":0.00002894355,"about_ca_topic_score_gemma":0.000010908945,"teacher_disagreement_score":0.10328553,"about_ca_system_score_codex":0.0000139224385,"about_ca_system_score_gemma":0.000058980346,"threshold_uncertainty_score":0.22990629},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933584,0.000100884245,0.0042187306,0.00034585973,0.0008059067,0.00013647575,0.0000017960731,0.00008476459,0.0009472017],"genre_scores_gemma":[0.9981265,0.000077584045,0.0015127172,0.00003740134,0.0000020030395,0.000010461312,2.1919584e-7,0.000009817572,0.00022327376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988609,0.00013026678,0.00017687352,0.00031495534,0.00025673307,0.0002602688],"domain_scores_gemma":[0.998744,0.0004112921,0.000078473146,0.0005111034,0.00014061936,0.00011452803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041050217,0.00010972202,0.00016881671,0.000109250395,0.00008150861,0.000026530604,0.00040674864,0.00005735815,0.00002871837],"category_scores_gemma":[0.00020143153,0.000082791135,0.000049313156,0.0004125322,0.00020752862,0.00045304786,0.00022432815,0.00008006217,0.000050554623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022799837,0.000043669857,0.013251919,0.000007762742,0.000015414138,0.000008396706,0.000100308804,2.1556833e-7,0.005303239,0.9683597,0.0002835039,0.012603082],"study_design_scores_gemma":[0.0010629469,0.000086206666,0.006555312,0.000038767434,0.0000030476813,0.000030167756,0.000011456909,0.00012324027,0.012102622,0.9795298,0.0003366067,0.00011985806],"about_ca_topic_score_codex":0.000010724923,"about_ca_topic_score_gemma":0.0000019423717,"teacher_disagreement_score":0.012483223,"about_ca_system_score_codex":0.000025803023,"about_ca_system_score_gemma":0.000031204137,"threshold_uncertainty_score":0.33761245},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902953,0.000049087856,0.0010825684,0.0040852176,0.00019292791,0.00078754465,0.000027572481,0.00015276647,0.0033269962],"genre_scores_gemma":[0.99874765,0.000014004411,0.00033397507,0.0004466752,0.0000038010166,0.00022788286,0.0000022971544,0.000025362908,0.00019837139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988425,0.00023387262,0.00023810877,0.00029484683,0.00018180803,0.00020890904],"domain_scores_gemma":[0.9956498,0.003406269,0.00014361666,0.00064390444,0.00006633598,0.00009003056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005300616,0.00018574997,0.00023023302,0.00008498402,0.00027149776,0.00003029755,0.00031922685,0.00009153631,0.00004725291],"category_scores_gemma":[0.0003363435,0.000096607946,0.00009192521,0.00026660974,0.00042020375,0.00007577418,0.000060204085,0.00015325738,0.00005893387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002353837,0.00021252205,0.00042974504,0.000010544328,0.000045235698,0.0000017608113,0.0001696663,5.0019516e-8,0.00051547796,0.9958186,0.0015374009,0.0010235842],"study_design_scores_gemma":[0.005493213,0.00005867034,0.003447889,0.000075745294,0.000033591856,0.0000023290643,0.000024271789,0.00014103936,0.0020484822,0.9881824,0.000333538,0.00015882828],"about_ca_topic_score_codex":0.000010261302,"about_ca_topic_score_gemma":0.0000037972275,"teacher_disagreement_score":0.008452311,"about_ca_system_score_codex":0.000015815727,"about_ca_system_score_gemma":0.00003351373,"threshold_uncertainty_score":0.39395577},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99845296,0.00043781998,0.000027335765,0.00016714112,0.0004084396,0.0001103301,0.0000025785675,0.000026363867,0.0003670501],"genre_scores_gemma":[0.99921423,0.00016192875,0.0005019542,0.000010956744,2.9586636e-7,0.0000043042837,1.7164494e-7,0.0000074105055,0.000098735996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895257,0.000054909335,0.00034733862,0.00023086714,0.00023313706,0.00018120324],"domain_scores_gemma":[0.99862003,0.00046779023,0.00026034316,0.0004009176,0.00017625402,0.0000746711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004701306,0.00012390765,0.00026605016,0.00007133042,0.000080685415,0.00002016321,0.0003277113,0.000067578185,0.0000040711875],"category_scores_gemma":[0.00012616705,0.000069029644,0.000064501524,0.00029446214,0.00033141222,0.00017671513,0.00020503599,0.000057438796,9.612595e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012655465,0.000043064858,0.04602812,0.000019689343,0.000042631862,5.878467e-7,0.0003982616,1.4309421e-7,0.0112546915,0.9410361,0.00016189062,0.0010021717],"study_design_scores_gemma":[0.0013316927,0.000133656,0.016120143,0.00008741637,0.000022671402,0.000004443739,0.000051681658,0.000038924405,0.059123248,0.9227782,0.00019519482,0.00011271431],"about_ca_topic_score_codex":0.00007320302,"about_ca_topic_score_gemma":0.0000012358092,"teacher_disagreement_score":0.047868557,"about_ca_system_score_codex":0.0000050479202,"about_ca_system_score_gemma":0.000027467411,"threshold_uncertainty_score":0.28149474},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87102205,0.00015238352,0.12214435,0.0011713845,0.0015739299,0.0001563281,0.0000015091517,0.00024772246,0.0035303412],"genre_scores_gemma":[0.9965542,0.000009648725,0.003136039,0.000040024144,0.000008870658,0.0000050175445,3.4026877e-7,0.000007158897,0.00023867832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990373,0.00008850986,0.0002108832,0.0002645006,0.00019846488,0.00020032882],"domain_scores_gemma":[0.99882996,0.0002837946,0.00012596011,0.0005993344,0.00007208268,0.00008886701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047698867,0.000102252234,0.00014598717,0.000102327554,0.00007319296,0.000040360137,0.0006798258,0.00005211093,0.00003145243],"category_scores_gemma":[0.00008993922,0.00007740041,0.00009949526,0.000401437,0.00004562896,0.00028370466,0.00015986765,0.000057037967,0.000037437225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065272866,0.000034103457,0.0026260721,0.0000060650136,0.000015167412,8.4848045e-7,0.0003389599,1.509304e-7,0.013918157,0.9405606,0.000550062,0.04194332],"study_design_scores_gemma":[0.00066039566,0.00011857207,0.0046024485,0.00008430169,0.000011549383,0.0000032035286,0.00001057567,0.00039238055,0.023554744,0.96858144,0.0018360545,0.00014430995],"about_ca_topic_score_codex":0.000011215683,"about_ca_topic_score_gemma":7.9326196e-7,"teacher_disagreement_score":0.12553217,"about_ca_system_score_codex":0.0000248213,"about_ca_system_score_gemma":0.00006241089,"threshold_uncertainty_score":0.3156297},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99447477,0.00007756949,0.0011259024,0.0006763933,0.0012680746,0.000517289,0.00003668305,0.00038851093,0.0014347977],"genre_scores_gemma":[0.9954281,0.00007370455,0.0034907777,0.000037630532,0.000023411127,0.000106597035,0.000009751963,0.000065711625,0.00076433487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822354,0.00013316033,0.00049155625,0.00037192748,0.00036465912,0.00041513372],"domain_scores_gemma":[0.9974614,0.0013214791,0.00025909577,0.00052856765,0.00025078678,0.00017870481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025695836,0.00026769517,0.0003739529,0.00011194081,0.00021651147,0.00005382644,0.00021042426,0.00015913058,0.00008275169],"category_scores_gemma":[0.0021778666,0.00020736434,0.000059626676,0.00038294855,0.00011617143,0.00037581017,0.00012561498,0.00015430534,0.00009006079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018270968,0.0001641994,0.00041732582,0.00006024092,0.00003484367,0.000012639518,0.00035371105,3.8347335e-7,0.0050915303,0.98923486,0.0039864117,0.0006255978],"study_design_scores_gemma":[0.002141909,0.00014648757,0.00033470753,0.00013939274,0.00006400676,0.000016122895,0.00011170934,0.000052276293,0.0041962746,0.99142057,0.0010745616,0.00030196228],"about_ca_topic_score_codex":0.0000058101873,"about_ca_topic_score_gemma":0.0000042589863,"teacher_disagreement_score":0.00291185,"about_ca_system_score_codex":0.00013989811,"about_ca_system_score_gemma":0.00006537843,"threshold_uncertainty_score":0.8456072},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9909069,0.00017806092,0.0038773187,0.0024230701,0.0012957938,0.000146631,0.0000012360565,0.00040028765,0.00077072514],"genre_scores_gemma":[0.9944073,0.000019377261,0.0048524123,0.00026723192,0.0000017913297,0.000005887417,8.4761524e-7,0.000017347444,0.0004278147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983573,0.00008005927,0.00021320596,0.00053222716,0.00040578112,0.00041145977],"domain_scores_gemma":[0.99838865,0.00009511818,0.00010609524,0.0010308718,0.0002056737,0.00017362145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031277063,0.00019974854,0.0002269409,0.00013216071,0.00015042366,0.000112884256,0.0006808393,0.00007578189,0.000016006421],"category_scores_gemma":[0.000042257903,0.00012335596,0.000059983104,0.0004603799,0.00013206186,0.0004109926,0.00021781294,0.000095958814,0.0003121061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008699202,0.00009375453,0.005298961,0.0000071362156,0.000022236884,0.00008354284,0.00008308097,0.0000056717677,0.0077958447,0.9805027,0.0036185482,0.002479812],"study_design_scores_gemma":[0.0013281563,0.00022232266,0.0030943938,0.000105588304,0.000011165795,0.00005109469,0.0000075991306,0.00021673765,0.019272953,0.9739366,0.0014609765,0.00029239312],"about_ca_topic_score_codex":0.000032748747,"about_ca_topic_score_gemma":0.0000035220305,"teacher_disagreement_score":0.011477108,"about_ca_system_score_codex":0.000027335938,"about_ca_system_score_gemma":0.00006851749,"threshold_uncertainty_score":0.503031},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9979006,0.00019338439,0.000068923546,0.0004722752,0.00073040865,0.00016198253,0.0000035574553,0.000045732366,0.00042311993],"genre_scores_gemma":[0.9961471,0.00007642937,0.0034077961,0.00001779069,0.000018081486,0.0000059663057,3.7464557e-7,0.000021866903,0.00030462237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918485,0.000030713418,0.0002172673,0.00022931666,0.00015236868,0.0001854625],"domain_scores_gemma":[0.99915737,0.0003235252,0.00011733927,0.0002773217,0.000060124425,0.000064296524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020465751,0.00011450345,0.00020742048,0.00003493615,0.000044732686,0.00000981564,0.000086664586,0.000058738533,0.000011190353],"category_scores_gemma":[0.00072282995,0.000087245025,0.000018151362,0.000066095716,0.00018597514,0.00019054934,0.00009803628,0.00007205847,0.000003527846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013168952,0.000029616125,0.0031515455,0.00007287303,0.000022518785,0.0000029785679,0.0003052192,2.8250275e-8,0.005267612,0.989829,0.00023695269,0.001068483],"study_design_scores_gemma":[0.0008317731,0.000055066463,0.00039719758,0.00006970501,0.000019056755,0.0000049330897,0.00005998629,0.0000022640606,0.029126503,0.9687293,0.0005838399,0.00012034209],"about_ca_topic_score_codex":0.000004736911,"about_ca_topic_score_gemma":0.0000011279983,"teacher_disagreement_score":0.02385889,"about_ca_system_score_codex":0.000023647717,"about_ca_system_score_gemma":0.00002178157,"threshold_uncertainty_score":0.3557749},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96739596,0.00024434223,0.020398574,0.0058140606,0.0010002764,0.0005223228,0.000008074498,0.00014172062,0.0044746757],"genre_scores_gemma":[0.99937034,0.000034276694,0.00018086546,0.00011440298,0.0000038176595,0.000024865556,1.457404e-7,0.000013635472,0.00025767426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982227,0.0002625559,0.00023403045,0.00038357452,0.0005443468,0.00035277798],"domain_scores_gemma":[0.9961856,0.0018728204,0.00012466214,0.0015749318,0.00012585842,0.00011610749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088361703,0.0001606695,0.00023048012,0.0002076031,0.00013668553,0.0000469092,0.0018812642,0.00007405761,0.000019127963],"category_scores_gemma":[0.0007659176,0.00008927336,0.000086062,0.0006623064,0.00034840932,0.00031208212,0.0006210588,0.00017910881,0.000019991901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006108655,0.000094128736,0.004567805,0.000005192517,0.000021906913,0.000006302546,0.000097551936,4.5763917e-7,0.00059203233,0.973435,0.00080826215,0.020310296],"study_design_scores_gemma":[0.001859725,0.00032582198,0.007520684,0.000044172568,0.0000023474597,0.000003864192,0.000017717914,0.00026067696,0.0032866066,0.98628277,0.00026864567,0.0001269713],"about_ca_topic_score_codex":0.0000120667955,"about_ca_topic_score_gemma":0.000008679703,"teacher_disagreement_score":0.031974364,"about_ca_system_score_codex":0.000028849792,"about_ca_system_score_gemma":0.000050992476,"threshold_uncertainty_score":0.3640462},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940281,0.00007342739,0.00015473468,0.0021375162,0.0023161569,0.00014835525,0.0000020182383,0.0001300051,0.0010097055],"genre_scores_gemma":[0.9990964,0.000010024343,0.00051983696,0.00025190576,0.000001857205,0.000013490621,4.3559035e-7,0.000012256533,0.00009381815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985106,0.00011255176,0.00030713034,0.00032445329,0.0004377877,0.00030750327],"domain_scores_gemma":[0.99824,0.0005855859,0.00017233007,0.0008087355,0.00010128011,0.00009209633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047977726,0.00016267045,0.0002060819,0.000060172377,0.00016297375,0.0000658453,0.0007033809,0.00005645158,0.000022558628],"category_scores_gemma":[0.00034496293,0.00008917614,0.00011520109,0.00035702158,0.000106900385,0.00022772452,0.00023172003,0.00011997005,0.00016585876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038111073,0.00010492122,0.00073765643,0.0000115625735,0.00001667731,0.0000049872237,0.00028061226,0.0000022973427,0.0031875337,0.99241257,0.001390969,0.001846386],"study_design_scores_gemma":[0.00064746506,0.00009250624,0.0019626217,0.00027766786,0.000008472108,0.000010010358,0.000006922123,0.0011098163,0.0059653237,0.9896949,0.00006967096,0.00015463482],"about_ca_topic_score_codex":0.000036839218,"about_ca_topic_score_gemma":7.3743297e-7,"teacher_disagreement_score":0.005068294,"about_ca_system_score_codex":0.00003477181,"about_ca_system_score_gemma":0.000046382942,"threshold_uncertainty_score":0.36364973},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99659127,0.000077264645,0.000003763455,0.0001380059,0.00044259333,0.000102751466,0.000003631171,0.0000124597,0.0026282812],"genre_scores_gemma":[0.9996179,0.00004688578,0.00011876795,0.000009890714,0.000003360719,0.000007932057,1.5528485e-7,0.000011653835,0.00018349382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927497,0.000067580135,0.0002113459,0.00011758207,0.00016431643,0.00016422459],"domain_scores_gemma":[0.99888945,0.00069718785,0.000083237326,0.00026562746,0.000031054533,0.00003343696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036912246,0.0000905539,0.00014687,0.00002697256,0.00008482547,0.0000110536985,0.00017801639,0.00006757416,0.000026360838],"category_scores_gemma":[0.00021395701,0.000044895405,0.000037055168,0.00006304984,0.00015811424,0.000057047546,0.00013394345,0.00007555512,0.000002117309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002805172,0.000023717117,0.16062224,0.000009395391,0.000015079254,0.0000030987997,0.00028845173,1.6379978e-8,0.00004771593,0.8354325,0.00023273045,0.0032969806],"study_design_scores_gemma":[0.0007229883,0.000021017606,0.1421605,0.000031225063,0.00000641748,0.0000083613,0.000054334287,0.0000028527948,0.00045323567,0.8563021,0.00017572117,0.00006127297],"about_ca_topic_score_codex":0.000010962591,"about_ca_topic_score_gemma":0.00007981688,"teacher_disagreement_score":0.02086954,"about_ca_system_score_codex":0.000017001916,"about_ca_system_score_gemma":0.0000119771685,"threshold_uncertainty_score":0.18307814},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2118874,0.0016700255,0.7812235,0.0019546018,0.0013823607,0.00041715565,0.00014330495,0.00044364174,0.0008780308],"genre_scores_gemma":[0.9934988,0.00032846455,0.0051801307,0.00011661242,0.000030435496,0.000022351087,0.000047180456,0.000028364999,0.0007476848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978505,0.0001134394,0.0003543815,0.0007690868,0.0004400606,0.00047252455],"domain_scores_gemma":[0.9983811,0.00030568705,0.00019969938,0.00084730156,0.00006865809,0.00019755533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074333954,0.00026950668,0.0002797821,0.000068772824,0.0003623639,0.00035051306,0.0010459905,0.00006485239,0.000006153624],"category_scores_gemma":[0.000058474947,0.00022971706,0.00005081352,0.0004708254,0.0001342601,0.0016355291,0.0004253993,0.00022912574,0.00007406033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004293212,0.00006434422,0.04536861,0.000029555818,0.000039118735,0.00001777015,0.00017225949,0.0000012129414,0.00033290708,0.9385322,0.005322923,0.010114849],"study_design_scores_gemma":[0.0038210992,0.00012908825,0.0062997933,0.00024887876,0.00005253602,0.0000031132663,0.000023843999,0.0036400424,0.00075595686,0.78566086,0.19842489,0.00093991414],"about_ca_topic_score_codex":0.00004438996,"about_ca_topic_score_gemma":0.0000054492843,"teacher_disagreement_score":0.7816114,"about_ca_system_score_codex":0.00008445517,"about_ca_system_score_gemma":0.0000165289,"threshold_uncertainty_score":0.936759},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927042,0.00006558668,0.0021274984,0.00023838898,0.0013960978,0.00044884766,0.000033510983,0.00011786844,0.00286799],"genre_scores_gemma":[0.99473315,0.000020514306,0.004863906,0.000008757257,0.000011507562,0.00001990908,0.0000037693144,0.000047200654,0.0002912896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981889,0.0001136979,0.00077416946,0.00022767484,0.00043841908,0.00025714526],"domain_scores_gemma":[0.997099,0.0011342512,0.00065108575,0.00075768237,0.00027910288,0.000078899524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003634438,0.00021033816,0.0005462419,0.00013075833,0.000041520812,0.000006268946,0.00036483543,0.00016046726,0.000038495204],"category_scores_gemma":[0.0013875316,0.00016108608,0.00011813546,0.00031840228,0.00012261774,0.00018472056,0.000074875876,0.000105219966,0.000021068397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041212836,0.0002928315,0.0003347451,0.00015295044,0.00005718833,0.0000025386526,0.00023801492,5.5667965e-7,0.037759624,0.9594508,0.0009786249,0.0006909445],"study_design_scores_gemma":[0.0017385061,0.00019269444,0.00010861495,0.0002392208,0.000045726814,0.0000034332652,0.000043432636,0.000020506393,0.089679495,0.9072267,0.0005334369,0.00016826906],"about_ca_topic_score_codex":0.000007719374,"about_ca_topic_score_gemma":0.0000039034444,"teacher_disagreement_score":0.0522241,"about_ca_system_score_codex":0.00009049147,"about_ca_system_score_gemma":0.00007077005,"threshold_uncertainty_score":0.65689},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902147,0.00009378173,0.0060441014,0.00057433086,0.0012860699,0.00029944288,0.000009331311,0.00010951905,0.0013687013],"genre_scores_gemma":[0.9976146,0.000028038065,0.0019070709,0.00007853169,0.0000032064675,0.000018932293,3.3533476e-7,0.000014368344,0.0003348944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774474,0.00026405457,0.0003725613,0.00049803866,0.00064527994,0.00047534742],"domain_scores_gemma":[0.9969512,0.001165417,0.0001627255,0.0012223667,0.00026552594,0.00023272369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073091063,0.00018676533,0.0002995826,0.00013264162,0.00009740594,0.000043157685,0.0015648645,0.000087626424,0.000104133374],"category_scores_gemma":[0.00076482864,0.00013713216,0.00013839696,0.00072286645,0.0002366648,0.0008213213,0.00059986225,0.00016693129,0.00012015118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008557629,0.00042691603,0.039056506,0.000021482545,0.00005718512,0.000016532038,0.00020853197,0.0000025398867,0.010717762,0.9334832,0.001001737,0.014922025],"study_design_scores_gemma":[0.0017444192,0.00026348344,0.028254889,0.00006435899,0.0000037733764,0.000005323536,0.0000060441234,0.000076520904,0.015494641,0.9533385,0.00056026794,0.00018778454],"about_ca_topic_score_codex":0.000008276502,"about_ca_topic_score_gemma":0.0000013578108,"teacher_disagreement_score":0.019855287,"about_ca_system_score_codex":0.00011112187,"about_ca_system_score_gemma":0.00012413289,"threshold_uncertainty_score":0.5592087},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99510455,0.000088859146,0.0042790854,0.00007620396,0.00022662799,0.00009470785,0.00003148754,0.00001704424,0.00008142711],"genre_scores_gemma":[0.99563235,0.00003905936,0.0041067936,0.00002498715,0.000010466909,0.0000040786426,0.00006964557,0.000008821377,0.00010378985],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993473,0.00005206128,0.00014923267,0.0002466502,0.000078271565,0.00012644482],"domain_scores_gemma":[0.9995266,0.000031911837,0.00010859298,0.00018374479,0.00010947261,0.00003965442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007693376,0.000102709426,0.00012685433,0.000017504364,0.000039761868,0.000005619286,0.000106691936,0.000115624185,0.000016359816],"category_scores_gemma":[0.000051942192,0.000062339954,0.00004086738,0.000052467527,0.0001640113,0.0000037011469,0.00005314661,0.000039334216,0.000008287464],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010289819,0.00009706162,0.020997498,0.0000059190443,0.00007551538,0.0000010090822,0.000027359825,0.000003300204,0.97061586,0.0029414755,0.000032204105,0.0050998935],"study_design_scores_gemma":[0.0045203026,0.00090866786,0.071807235,0.00013479621,0.00008592633,0.000014472311,0.0001473632,0.0017104665,0.90106785,0.017779093,0.0013250767,0.00049875496],"about_ca_topic_score_codex":0.00002175427,"about_ca_topic_score_gemma":0.0000115068315,"teacher_disagreement_score":0.06954802,"about_ca_system_score_codex":0.000012770254,"about_ca_system_score_gemma":0.000026403923,"threshold_uncertainty_score":0.25421497},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9896554,0.0006314057,0.00130025,0.000023997654,0.0022694843,0.0002465823,0.0000563239,0.00020111889,0.005615438],"genre_scores_gemma":[0.9995613,0.00010539235,0.000027750217,0.000018524013,0.000020978128,0.00003228043,0.000004547517,0.00004734104,0.00018188532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986374,0.00009905309,0.00037899776,0.00023878408,0.00029857855,0.0003471988],"domain_scores_gemma":[0.998868,0.0004681571,0.000115608236,0.00033694776,0.00009179942,0.00011949753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027542998,0.0002475222,0.00036191253,0.00025929377,0.000046332778,0.000021818,0.00029104642,0.000116922165,0.00013534233],"category_scores_gemma":[0.00007138169,0.00018871091,0.00012738784,0.00046819216,0.00007559231,0.00021161232,0.000047059082,0.000107917345,0.00015024327],"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.00020473468,0.00083877466,0.29606932,0.00097267586,0.0010442579,0.00010465205,0.0014861531,0.00017676933,0.098900415,0.505766,0.013515341,0.08092095],"study_design_scores_gemma":[0.010799598,0.0012706686,0.102988176,0.0020030648,0.0003627243,0.00007219015,0.00046322116,0.00085213024,0.65787596,0.20937821,0.011217764,0.0027163064],"about_ca_topic_score_codex":0.000021111076,"about_ca_topic_score_gemma":0.0000014971245,"teacher_disagreement_score":0.5589755,"about_ca_system_score_codex":0.000056871228,"about_ca_system_score_gemma":0.000020122132,"threshold_uncertainty_score":0.7695408},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9680232,0.00015469069,0.028548865,0.0010806047,0.0009950147,0.00033551277,0.000009989744,0.00004237016,0.00080977],"genre_scores_gemma":[0.99857974,0.000022251032,0.00049050624,0.0000086753325,0.000011831284,0.000006826625,4.803421e-7,0.0000103048,0.0008693844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992554,0.000048664973,0.00027072476,0.00012322729,0.00015405058,0.00014792569],"domain_scores_gemma":[0.9987107,0.0007767598,0.00013436306,0.00024648348,0.00004643229,0.00008528705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001764616,0.00008480433,0.00016278481,0.000020551517,0.000096712596,0.000018961118,0.00011366719,0.000043807664,0.00002274236],"category_scores_gemma":[0.00047495362,0.000042694293,0.000041073512,0.00007431498,0.00008167155,0.00004213044,0.00007682593,0.000041214782,0.00000891623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023505629,0.000051649113,0.00014130773,0.000009432219,0.000015865859,4.4258007e-7,0.0001496755,5.2066156e-7,0.00163638,0.99070966,0.0013196291,0.005941907],"study_design_scores_gemma":[0.0012244103,0.00009757119,0.00066360657,0.000069492766,0.00001697273,0.000002441533,0.000044141176,0.00038935503,0.0005670558,0.99428976,0.0025442732,0.00009090085],"about_ca_topic_score_codex":0.00005545872,"about_ca_topic_score_gemma":0.000024751724,"teacher_disagreement_score":0.030556558,"about_ca_system_score_codex":0.000028913053,"about_ca_system_score_gemma":0.000042003834,"threshold_uncertainty_score":0.17410226},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99608636,0.00020191494,0.000073769064,0.00092017575,0.00075543526,0.00009530063,5.9207014e-7,0.00010238821,0.0017640527],"genre_scores_gemma":[0.99865186,0.000044926197,0.00082306087,0.00028371872,3.9280542e-7,0.000011951119,2.3214534e-7,0.000008387466,0.00017549036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988608,0.000073986186,0.00018372183,0.0004096082,0.00018454847,0.00028735577],"domain_scores_gemma":[0.99915326,0.00022410005,0.000053107306,0.00040416874,0.000048845963,0.000116499425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030144004,0.00012825905,0.00016063258,0.00016945896,0.000067496716,0.00006599006,0.00028304418,0.000065179425,0.000007716247],"category_scores_gemma":[0.00008937657,0.00009566503,0.000039326977,0.00043687824,0.000060188955,0.00019312584,0.00016272561,0.00009841983,0.000042313164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061950327,0.00008885537,0.00517348,0.0000055461087,0.0000057508587,0.000037921964,0.00023153963,0.0000017819841,0.0014027451,0.9903861,0.0009947353,0.0016653148],"study_design_scores_gemma":[0.0015971945,0.000115208844,0.0031996742,0.00014640971,0.0000020256339,0.000012582816,0.000009982701,0.00021965924,0.0016783118,0.9926492,0.00020344206,0.00016631918],"about_ca_topic_score_codex":0.000047605732,"about_ca_topic_score_gemma":0.00001603983,"teacher_disagreement_score":0.002565469,"about_ca_system_score_codex":0.000029367742,"about_ca_system_score_gemma":0.000037104754,"threshold_uncertainty_score":0.39011067},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.940254,0.000063175234,0.0022825643,0.001769773,0.00027383896,0.00027299445,0.00004316047,0.000085600695,0.054954898],"genre_scores_gemma":[0.99807024,0.000012810882,0.00036751298,0.00003900207,0.000025389889,0.000048314163,0.0000032116786,0.000014589179,0.0014189399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993921,0.000009965786,0.00013892673,0.00019358694,0.000089721136,0.00017568012],"domain_scores_gemma":[0.9992749,0.0003258999,0.000062819905,0.00022437153,0.000027487855,0.000084527455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000058797355,0.000115635856,0.00014272284,0.000018832689,0.00011079987,0.000022785493,0.000102718106,0.000024324088,0.00035471533],"category_scores_gemma":[0.000011628697,0.00007550986,0.000042329666,0.00009620825,0.000053763106,0.000096805015,0.000048523358,0.00005435931,0.00016435549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007538399,0.000074435186,0.0010581092,0.0000039427305,0.000014179533,2.8617174e-7,0.000021348242,2.26451e-7,0.00028799783,0.98607224,0.0010801275,0.011379566],"study_design_scores_gemma":[0.00054812257,0.000031811207,0.00030684544,0.000027976092,0.00000946553,3.909693e-7,0.000055444438,0.000004597225,0.0030341381,0.98030543,0.015554021,0.00012177604],"about_ca_topic_score_codex":0.000007806606,"about_ca_topic_score_gemma":1.6505813e-7,"teacher_disagreement_score":0.057816233,"about_ca_system_score_codex":0.000012157921,"about_ca_system_score_gemma":0.000009160607,"threshold_uncertainty_score":0.38838843},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959147,0.00012699403,0.00044967426,0.00055287185,0.0014575311,0.0001640037,0.000004526041,0.00010043875,0.0012292552],"genre_scores_gemma":[0.99885327,0.0000070345895,0.0009724424,0.00005168838,7.4598466e-7,0.0000068148465,7.7207363e-7,0.00000971139,0.00009752369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998582,0.00007612211,0.0003448513,0.00037689367,0.0003871748,0.0002329513],"domain_scores_gemma":[0.9983973,0.000160558,0.00022932276,0.0008761781,0.00025490043,0.00008172177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034178808,0.00013801138,0.00024216012,0.00016076799,0.000041015825,0.00001325859,0.00059614313,0.00006132393,0.00001428429],"category_scores_gemma":[0.00014679164,0.000096553675,0.000072504095,0.00047662505,0.00011356449,0.00016239977,0.00015659395,0.00008098471,0.00003076046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032562108,0.00024091116,0.0009019079,0.000022916634,0.000025284866,0.0000040272917,0.00016576158,0.000011326915,0.02271938,0.96868354,0.003134695,0.0040576784],"study_design_scores_gemma":[0.0015170362,0.00078590587,0.0014772225,0.0001461941,0.0000068928434,0.000005006281,0.000008276392,0.0003026642,0.066843174,0.9285347,0.00019950364,0.0001734449],"about_ca_topic_score_codex":0.0000342862,"about_ca_topic_score_gemma":0.0000015971682,"teacher_disagreement_score":0.044123795,"about_ca_system_score_codex":0.000016162892,"about_ca_system_score_gemma":0.00007438724,"threshold_uncertainty_score":0.39373446},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99408996,0.00027298843,0.0018251466,0.001011058,0.0012659753,0.00015237952,0.000001820244,0.00015628756,0.0012243693],"genre_scores_gemma":[0.9982034,0.000020585288,0.0014262466,0.0001585865,7.1566814e-7,0.0000052779974,4.3545248e-7,0.0000110713845,0.00017366341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986756,0.000063847714,0.00022836306,0.00036592333,0.00041627674,0.00024998697],"domain_scores_gemma":[0.9985948,0.00029934518,0.00014693609,0.0006684369,0.00017760755,0.00011283238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029597513,0.00015065075,0.00023460636,0.00025939013,0.00007853217,0.000026271295,0.00047234545,0.000053771215,0.000015039256],"category_scores_gemma":[0.00008270404,0.00008381676,0.00005134957,0.00070897763,0.00009487099,0.00019321032,0.00014390681,0.000074735515,0.000079163394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021214813,0.00013522757,0.001231246,0.0000067867677,0.000019125458,0.000009857141,0.000057825575,0.0000071856903,0.0069472175,0.9857049,0.0013399845,0.004519442],"study_design_scores_gemma":[0.0023263108,0.0011996627,0.0022421724,0.00022263193,0.000014023729,0.000012978355,0.000010791698,0.0003337702,0.15141502,0.8416803,0.00027116446,0.00027116365],"about_ca_topic_score_codex":0.000027882474,"about_ca_topic_score_gemma":6.4992423e-7,"teacher_disagreement_score":0.1444678,"about_ca_system_score_codex":0.000023094713,"about_ca_system_score_gemma":0.000057966005,"threshold_uncertainty_score":0.34179482},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9507332,0.00004370619,0.0070073046,0.0083506,0.0006251919,0.0012492558,0.000009461168,0.0004721373,0.03150918],"genre_scores_gemma":[0.9956704,0.000011034234,0.001689338,0.000030654388,0.000009829029,0.00021052187,0.0000011502842,0.000019846746,0.0023572363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991317,0.00007465716,0.00026918756,0.00015133132,0.00015892468,0.00021424882],"domain_scores_gemma":[0.997354,0.0019462762,0.000107042826,0.0004420953,0.000091455906,0.000059152677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006233439,0.00010742217,0.00011584991,0.00003082954,0.000507502,0.000041349595,0.00020901553,0.00006344842,0.000096046344],"category_scores_gemma":[0.0004458603,0.000056173063,0.000077090466,0.0001727582,0.00011889373,0.00011682385,0.000042552987,0.00007457252,0.00022699192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076180686,0.000080806574,0.00008338272,0.00001001289,0.000019775476,2.3649709e-7,0.00009422013,6.406367e-8,0.00076955877,0.9924345,0.0042174505,0.0022823801],"study_design_scores_gemma":[0.0004617198,0.00003322749,0.00010611329,0.000031385913,0.000020387675,0.0000069690964,0.00004269019,0.000025485046,0.0014575497,0.9901096,0.007606681,0.00009817083],"about_ca_topic_score_codex":7.916935e-7,"about_ca_topic_score_gemma":0.0000021885814,"teacher_disagreement_score":0.044937227,"about_ca_system_score_codex":0.00003491813,"about_ca_system_score_gemma":0.000019643625,"threshold_uncertainty_score":0.3903346},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93759626,0.00006877606,0.05513791,0.00046165416,0.0021653702,0.00017404133,0.0000015517039,0.0001421094,0.0042523257],"genre_scores_gemma":[0.99900496,0.0000051678503,0.00055332814,0.00004209999,0.000015034422,0.000015835087,2.4946235e-7,0.000010982629,0.00035232506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873936,0.00012644005,0.00024326843,0.00035331503,0.0002778827,0.00025972084],"domain_scores_gemma":[0.998617,0.00020323902,0.00016770576,0.0007344497,0.00019390185,0.00008369823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004077064,0.00014275964,0.00025517182,0.0000980266,0.000080432845,0.00004411819,0.00055879576,0.000052479503,0.0000141742385],"category_scores_gemma":[0.00003370454,0.00008688475,0.00008147938,0.0004106785,0.000080175545,0.00041939758,0.00011123667,0.000075673095,0.000021854394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000164801,0.000066321954,0.009052503,0.000008360034,0.00003672316,0.000009497854,0.00015359446,0.000008133986,0.0015710695,0.98446256,0.0009459917,0.0036687534],"study_design_scores_gemma":[0.005038282,0.0012341773,0.019115727,0.0005434427,0.000021983573,0.00013146258,0.000059247228,0.0027336208,0.038799923,0.92462623,0.0069750263,0.0007208693],"about_ca_topic_score_codex":0.00008939624,"about_ca_topic_score_gemma":0.000034947243,"teacher_disagreement_score":0.061408717,"about_ca_system_score_codex":0.000038212023,"about_ca_system_score_gemma":0.000040451523,"threshold_uncertainty_score":0.3543057},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9852639,0.00003816458,0.007581431,0.001776505,0.0007240627,0.00019076317,0.0000019648023,0.00008168964,0.004341529],"genre_scores_gemma":[0.99883235,0.000019823965,0.00060562225,0.000105796615,0.0000026667872,0.000025895415,7.748623e-8,0.000010498543,0.0003972698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870276,0.00017649881,0.00016438933,0.00027070782,0.00038054213,0.00030512715],"domain_scores_gemma":[0.99758977,0.0011009873,0.00008020441,0.0010479053,0.00010842611,0.000072707895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050322997,0.000111132555,0.00013165265,0.00007189511,0.00009969133,0.000025104024,0.0014193669,0.000041895775,0.00007338985],"category_scores_gemma":[0.00022680391,0.00005825216,0.00008915664,0.00059399765,0.00016424137,0.0002166775,0.00027505253,0.00012459098,0.0003277231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000137328825,0.00005584227,0.0010351735,0.000002169225,0.000013976263,0.000004568932,0.000071466595,9.336046e-7,0.002096432,0.99257964,0.0008975504,0.003228486],"study_design_scores_gemma":[0.00041167636,0.00008561904,0.0010315052,0.00002925264,0.0000013269381,0.000004360851,0.0000071859276,0.000053873577,0.016463008,0.9815552,0.0002704935,0.00008646517],"about_ca_topic_score_codex":0.000005666423,"about_ca_topic_score_gemma":8.7754194e-7,"teacher_disagreement_score":0.0143665755,"about_ca_system_score_codex":0.000032647695,"about_ca_system_score_gemma":0.000047990343,"threshold_uncertainty_score":0.42123267},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99094296,0.000033614953,0.0037631954,0.00021285226,0.000690092,0.00008664389,0.0000031102652,0.00009265929,0.0041748704],"genre_scores_gemma":[0.9988373,0.000007817153,0.00078534015,0.000058750113,0.000006791762,0.0000030457375,3.6769995e-7,0.0000076064107,0.0002929984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906164,0.00008661738,0.00014293822,0.00022965187,0.00028898614,0.00019017736],"domain_scores_gemma":[0.99897224,0.00030078625,0.00011544165,0.00047987723,0.000060345614,0.000071334514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028888034,0.000114539456,0.00014371148,0.00006875967,0.00008010277,0.00004686632,0.0006555257,0.00004055806,0.000041932904],"category_scores_gemma":[0.000036978658,0.00006930572,0.000036941557,0.00025910884,0.000047254303,0.00045989544,0.00013709806,0.00007921735,0.000041950654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017158338,0.00009026296,0.00090691657,0.000011702743,0.000012335462,0.000012946221,0.00009005319,0.000003771193,0.0008551439,0.9944018,0.00034241617,0.0032554667],"study_design_scores_gemma":[0.0012586485,0.000429396,0.0076552033,0.0001387168,0.000008493664,0.000009373811,0.000011102025,0.00030462348,0.012205347,0.97698,0.00078258617,0.00021651408],"about_ca_topic_score_codex":0.000015227663,"about_ca_topic_score_gemma":0.0000013170508,"teacher_disagreement_score":0.017421832,"about_ca_system_score_codex":0.000028515446,"about_ca_system_score_gemma":0.000034809524,"threshold_uncertainty_score":0.28262052},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88885665,0.00043648985,0.09206493,0.00014329013,0.002519884,0.00026192758,0.000014151357,0.0009682782,0.014734408],"genre_scores_gemma":[0.9969699,0.00010123803,0.0026916924,0.000011175097,0.000008604918,0.000009166448,0.000002956925,0.000022642793,0.00018264669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955136,0.000007556293,0.00009572971,0.00011301292,0.00007242585,0.00015989221],"domain_scores_gemma":[0.99973696,0.000049491544,0.00001727633,0.00012377217,0.000018440243,0.000054081913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047988375,0.000093177834,0.0000824204,0.000034282304,0.000050634466,0.000018043425,0.000055341894,0.000036677222,0.000025670111],"category_scores_gemma":[0.000035268262,0.00007498999,0.000012145442,0.00004118859,0.00002415872,0.00010583202,0.000023788256,0.00004464956,0.000013387179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060268205,0.00015731955,0.017512012,0.0004634085,0.0003080984,0.000047421767,0.0012012025,0.2801112,0.017871413,0.45730403,0.013163855,0.2117998],"study_design_scores_gemma":[0.007955707,0.0003243878,0.020706922,0.00050041167,0.00009363086,0.000015501835,0.00019915026,0.069460765,0.06585637,0.81786764,0.015079758,0.0019397922],"about_ca_topic_score_codex":0.000002805773,"about_ca_topic_score_gemma":5.458582e-7,"teacher_disagreement_score":0.36056358,"about_ca_system_score_codex":0.000040493273,"about_ca_system_score_gemma":0.0000028070604,"threshold_uncertainty_score":0.30580032},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99108905,0.0006417258,0.000457215,0.0046915975,0.00019776015,0.00068660016,0.000017818566,0.00003635526,0.0021818813],"genre_scores_gemma":[0.9993484,0.00018608329,0.000046467747,0.00004883213,0.0000029885184,0.00008390471,4.213359e-7,0.000014600985,0.00026832847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911743,0.00018233928,0.00019229454,0.0001455505,0.0001836455,0.00017873164],"domain_scores_gemma":[0.995921,0.0031432193,0.00018321398,0.0006549775,0.00006067814,0.00003686731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005946606,0.000118590855,0.00015375411,0.000022788061,0.00038082915,0.000033346278,0.00045327164,0.000034806675,0.0000076004876],"category_scores_gemma":[0.00016669759,0.00003960793,0.00006607347,0.00029200863,0.0010178307,0.00006823169,0.00007009956,0.000109448105,0.0000032581984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012512835,0.00004131784,0.005068206,0.000008528155,0.000062327366,5.179991e-7,0.0003333007,7.0731126e-8,0.00002953997,0.9919642,0.0010724829,0.0012943852],"study_design_scores_gemma":[0.0011968678,0.000033632125,0.0055817473,0.000037375943,0.00004622946,0.000003517998,0.0002455905,0.000007980928,0.00033849137,0.99029595,0.0021375576,0.00007507615],"about_ca_topic_score_codex":0.000008365906,"about_ca_topic_score_gemma":0.000015933947,"teacher_disagreement_score":0.008259326,"about_ca_system_score_codex":0.000009653109,"about_ca_system_score_gemma":0.000019218975,"threshold_uncertainty_score":0.37502393},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9944649,0.00014875266,0.0006859196,0.00036387317,0.002989174,0.000094517825,0.0000044827434,0.0002008852,0.0010475471],"genre_scores_gemma":[0.9953478,0.000009787745,0.0043964684,0.000074574295,0.0000019814402,0.00000869965,0.000001100678,0.000012408919,0.00014715739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845433,0.00007346383,0.0003722913,0.00038702507,0.0003391443,0.0003737531],"domain_scores_gemma":[0.998723,0.00018846737,0.00017312083,0.0005888848,0.00018850982,0.00013807206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040423148,0.00015889909,0.00025182337,0.00014148364,0.00014716378,0.000065347056,0.0006070434,0.00006074378,0.000010130238],"category_scores_gemma":[0.00016264372,0.00012060497,0.000106134066,0.0004667626,0.000106814434,0.00032128935,0.00031304915,0.000089632886,0.000038424307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048665074,0.00005053974,0.0053276415,0.000009837405,0.000020055939,0.000007970449,0.00012431545,0.000013738678,0.043344468,0.94827724,0.0007533998,0.0020659089],"study_design_scores_gemma":[0.0012085541,0.00016607891,0.005929964,0.00013411236,0.000009396425,0.000013888025,0.000005012622,0.0028881757,0.013961633,0.9749901,0.0004388204,0.000254233],"about_ca_topic_score_codex":0.0000808821,"about_ca_topic_score_gemma":0.0000023495443,"teacher_disagreement_score":0.029382834,"about_ca_system_score_codex":0.00002661793,"about_ca_system_score_gemma":0.000043998487,"threshold_uncertainty_score":0.4918128},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9823594,0.000019553374,0.015390423,0.0011268881,0.0005606246,0.0003284343,0.00004233433,0.00007604288,0.000096309595],"genre_scores_gemma":[0.9994195,0.000019083329,0.00024522888,0.000096616786,0.0000027649467,0.000029319204,0.0000031397924,0.000019103054,0.00016521575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983537,0.00013120129,0.00017600863,0.00037647662,0.0006296552,0.0003329579],"domain_scores_gemma":[0.99820477,0.00018528377,0.0002621755,0.0010908757,0.00017335135,0.00008352709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025566647,0.0001674038,0.00020832253,0.000083487874,0.00014433004,0.00005099237,0.0014619344,0.00006870269,0.000010379301],"category_scores_gemma":[0.000053716663,0.000091122696,0.00006598992,0.00063678087,0.0002648295,0.0006302111,0.0003626952,0.00012750394,0.0000122244655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006597638,0.00007456821,0.04853521,0.000011265043,0.00002960461,0.0000034956374,0.00006090829,6.72259e-7,0.12729444,0.82075876,0.00011412827,0.0030509687],"study_design_scores_gemma":[0.001314173,0.00012282083,0.22774366,0.000108256325,0.000006052297,0.0000043743225,0.000005835935,0.000050191607,0.23142292,0.538875,0.00016239553,0.0001843219],"about_ca_topic_score_codex":0.00001986247,"about_ca_topic_score_gemma":0.000019219051,"teacher_disagreement_score":0.28188375,"about_ca_system_score_codex":0.00006303852,"about_ca_system_score_gemma":0.00006945462,"threshold_uncertainty_score":0.37158757},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9945228,0.00015294692,0.00079981756,0.0018599003,0.00078096846,0.00016628912,0.0000017400298,0.000099357356,0.0016161865],"genre_scores_gemma":[0.99894536,0.000009292582,0.00065837667,0.00025996313,5.3605066e-7,0.000008888022,6.1501277e-7,0.000011259562,0.000105684856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984908,0.000117924894,0.00023517366,0.00037069223,0.00048277288,0.00030262562],"domain_scores_gemma":[0.99827063,0.00033317792,0.0001107579,0.001027408,0.00017343639,0.00008459348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046246022,0.00016836438,0.0001850322,0.00012024374,0.00015044832,0.000042376785,0.00096329063,0.00003766445,0.000018144625],"category_scores_gemma":[0.000043943346,0.00007855012,0.00007371639,0.0005656767,0.00024969812,0.0001820267,0.00015766095,0.00009952706,0.00009101574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009820307,0.00016078168,0.0016087858,0.0000041207873,0.000012981405,0.0000040021364,0.000102638915,0.000009639789,0.009377538,0.9870095,0.0011227223,0.0005774363],"study_design_scores_gemma":[0.0011769191,0.00029585772,0.0015628757,0.000100308825,0.000008518418,0.000006925326,0.00000878769,0.0002431951,0.012038938,0.98424083,0.0001601908,0.0001566464],"about_ca_topic_score_codex":0.0000403185,"about_ca_topic_score_gemma":0.0000015399135,"teacher_disagreement_score":0.00442259,"about_ca_system_score_codex":0.000015400183,"about_ca_system_score_gemma":0.000037958,"threshold_uncertainty_score":0.3203181},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959941,0.0002900469,0.000039569786,0.000033059725,0.0012215251,0.00032947236,0.000011428843,0.00011049152,0.0019703193],"genre_scores_gemma":[0.9997596,0.00003150353,0.00006178208,0.0000042971865,0.000007358714,0.00005791456,0.00000209254,0.000027786777,0.000047634494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924076,0.000032887805,0.0002707124,0.00013345077,0.00008097651,0.00024124273],"domain_scores_gemma":[0.999542,0.000104841725,0.000039670118,0.00022162919,0.000041541858,0.00005032562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023988965,0.00012122514,0.00021450783,0.00010992021,0.00002188933,0.000008679488,0.00014834375,0.00007509349,0.00001821472],"category_scores_gemma":[0.000025735226,0.00009370133,0.000069691305,0.0002834006,0.000034576922,0.00012728707,0.000012521758,0.00004905325,0.000015705915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011924663,0.000124636,0.014226209,0.0003763011,0.000103875485,0.0000039349816,0.0010568855,0.00013447352,0.14549428,0.8334921,0.00095972646,0.003908347],"study_design_scores_gemma":[0.0041440423,0.0003357711,0.00773565,0.00054853346,0.000025340454,0.0000043519003,0.00013902974,0.0006924068,0.1196341,0.8566709,0.0095624095,0.00050747086],"about_ca_topic_score_codex":0.000008885743,"about_ca_topic_score_gemma":0.000016750755,"teacher_disagreement_score":0.025860189,"about_ca_system_score_codex":0.000021694099,"about_ca_system_score_gemma":0.000009320076,"threshold_uncertainty_score":0.38210294},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83809507,0.00008515379,0.14767699,0.0019487316,0.0022393523,0.00033551146,0.00000466154,0.00021695676,0.009397578],"genre_scores_gemma":[0.9968379,0.000019932564,0.0022898074,0.00002603436,0.0000035755613,0.000012016044,3.661746e-7,0.000008689493,0.00080167875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988605,0.00009923646,0.00017731592,0.0002541731,0.0003475476,0.0002612647],"domain_scores_gemma":[0.99872696,0.00032474927,0.00009519837,0.00060714764,0.00015979067,0.00008617065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042051414,0.000091615715,0.00013498506,0.00013709681,0.00005779746,0.00001781434,0.00080794835,0.000048423186,0.000029468172],"category_scores_gemma":[0.00019598096,0.00006703715,0.0000566147,0.000447394,0.0001215137,0.00050763873,0.0002097863,0.00006712791,0.0000871083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009709932,0.00004728458,0.0007875039,0.000005036361,0.000008640507,0.0000038011735,0.00015379618,8.866158e-7,0.00978834,0.96351063,0.00023155498,0.025452795],"study_design_scores_gemma":[0.0009008443,0.00009954457,0.0021194657,0.00002598915,0.0000015607444,0.0000034052007,0.00001113505,0.00021796128,0.04710258,0.9486388,0.00076952623,0.00010918859],"about_ca_topic_score_codex":0.0000061244455,"about_ca_topic_score_gemma":0.000001492847,"teacher_disagreement_score":0.15874285,"about_ca_system_score_codex":0.000062320214,"about_ca_system_score_gemma":0.000047575035,"threshold_uncertainty_score":0.27336955},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9912428,0.00029885463,0.001309318,0.0021860586,0.0017767515,0.00008707308,0.0000019290326,0.00022208632,0.0028750838],"genre_scores_gemma":[0.99554795,0.000029212491,0.004058769,0.00017479096,6.0013986e-7,0.0000024661333,3.1230059e-7,0.000008404022,0.00017751318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891514,0.000039616873,0.000245916,0.00029082835,0.0002665082,0.00024202008],"domain_scores_gemma":[0.99891883,0.0001038395,0.000115411836,0.0005991263,0.00017422321,0.00008857869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032380057,0.000108174674,0.00017445182,0.00010290541,0.000057993966,0.000026893878,0.00060994894,0.0000521861,0.00001897803],"category_scores_gemma":[0.00007926964,0.000074545926,0.00006592279,0.0003680414,0.0000869171,0.0002891737,0.00019089201,0.00005635544,0.00013586991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024270223,0.00007300328,0.0016234127,0.0000055840787,0.000010187397,0.000004107803,0.00009246248,0.0000016225179,0.022919625,0.97003466,0.001673756,0.0035591633],"study_design_scores_gemma":[0.0008639923,0.00009554658,0.0007115554,0.00005910774,0.000004165233,0.000004881742,0.0000035501985,0.0003889009,0.02757393,0.96958977,0.00057137565,0.00013322088],"about_ca_topic_score_codex":0.000025504438,"about_ca_topic_score_gemma":3.0170693e-7,"teacher_disagreement_score":0.0046543065,"about_ca_system_score_codex":0.000013030931,"about_ca_system_score_gemma":0.000040415478,"threshold_uncertainty_score":0.30398944},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9981788,0.00015669204,0.00021527625,0.000024735558,0.0005495959,0.00026089026,0.000038011724,0.000044945362,0.0005310532],"genre_scores_gemma":[0.9998041,0.00001752689,0.000086618886,0.0000025546162,0.0000027306228,0.000023968205,6.961733e-7,0.000023796616,0.00003804525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915206,0.00005208763,0.00031207656,0.00011136324,0.0001933254,0.00017910132],"domain_scores_gemma":[0.9988297,0.00044908657,0.00009727612,0.00043122287,0.00014622766,0.000046470323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024723323,0.00012705688,0.00029705165,0.000060903367,0.000048429774,0.000005529181,0.00027573804,0.000041754978,0.000013262743],"category_scores_gemma":[0.00007186398,0.00006437872,0.00005205882,0.00040271078,0.00014815852,0.000055112934,0.00003471446,0.000047288628,0.0000041177263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061290344,0.00009915281,0.046626024,0.00027184768,0.00027479173,0.0000039874167,0.0010647291,0.0003300158,0.059241686,0.8899182,0.00041991865,0.0011367189],"study_design_scores_gemma":[0.009497199,0.0025772604,0.112454385,0.002346379,0.00012688467,0.000017778419,0.0022487466,0.00090978766,0.23993687,0.6247702,0.0041301847,0.0009842783],"about_ca_topic_score_codex":0.00005572956,"about_ca_topic_score_gemma":0.00020087212,"teacher_disagreement_score":0.26514798,"about_ca_system_score_codex":0.000011323821,"about_ca_system_score_gemma":0.00001812098,"threshold_uncertainty_score":0.2625288},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.581622,0.00022300749,0.338109,0.03358014,0.012723063,0.0011428616,0.000018125615,0.0011840218,0.03139781],"genre_scores_gemma":[0.99326426,0.0000030743342,0.002501372,0.0003063123,0.00002450625,0.00001752756,0.000006504595,0.000006568046,0.003869868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990489,0.00007067726,0.00017294301,0.00028530543,0.0002640316,0.0001581397],"domain_scores_gemma":[0.99925166,0.00015152502,0.00006396654,0.00035597765,0.000101966165,0.00007490125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019302049,0.00010138307,0.00009897605,0.000119929486,0.00014120451,0.00006220854,0.00033975023,0.000045939632,0.000027452774],"category_scores_gemma":[0.00011301627,0.00005803682,0.000043130167,0.00037062433,0.000019765988,0.00031381575,0.000041009374,0.000049375023,0.0002848222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009485144,0.000079462974,0.00016115703,0.000001719803,0.000008403196,0.0000036525012,0.000044710847,0.00005346221,0.0016647507,0.9308249,0.009936179,0.057212118],"study_design_scores_gemma":[0.0033923665,0.00050363597,0.027247794,0.00007060795,0.000009034187,0.0000127636795,0.0000036531162,0.009910253,0.010010217,0.8178344,0.13052072,0.0004846098],"about_ca_topic_score_codex":0.000006139687,"about_ca_topic_score_gemma":0.0000021083363,"teacher_disagreement_score":0.41164228,"about_ca_system_score_codex":0.00008341034,"about_ca_system_score_gemma":0.000076499804,"threshold_uncertainty_score":0.3660908},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5492726,0.00028479352,0.38114226,0.044280965,0.006227825,0.002721898,0.000036965503,0.0008904794,0.015142238],"genre_scores_gemma":[0.99758863,0.000011104864,0.0010279844,0.00047401458,0.0000066437697,0.00015321285,3.6927904e-7,0.000014388039,0.0007236603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871624,0.00010550647,0.0001303297,0.00034005576,0.00030982186,0.00039805734],"domain_scores_gemma":[0.99635184,0.0024085536,0.000053332085,0.00097573386,0.00011974267,0.00009078634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005894626,0.00012461636,0.000114628354,0.00009104877,0.00024448126,0.00007135181,0.0014965994,0.000041126288,0.000021966265],"category_scores_gemma":[0.00044449215,0.00006267566,0.00010422698,0.00040698083,0.00014657217,0.0002629892,0.00019480621,0.00009429051,0.00014673217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020208596,0.0000430523,0.00009075673,0.0000019393965,0.000012157647,0.0000021692108,0.00004135097,5.4128e-7,0.0014665305,0.9832601,0.007458332,0.007602842],"study_design_scores_gemma":[0.0006103651,0.00022814941,0.00023098322,0.000018862747,0.0000013658769,0.0000017949513,0.0000045290562,0.000117531556,0.009764095,0.98209554,0.006813808,0.000112969356],"about_ca_topic_score_codex":0.0000011568305,"about_ca_topic_score_gemma":5.941772e-7,"teacher_disagreement_score":0.44831607,"about_ca_system_score_codex":0.00003499198,"about_ca_system_score_gemma":0.00003509444,"threshold_uncertainty_score":0.27810788},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98493177,0.0009423937,0.000015278336,0.00006112222,0.008678791,0.00018006121,0.0000076074493,0.00042910967,0.0047538746],"genre_scores_gemma":[0.9996903,0.00007659338,0.000001989628,0.000009029777,0.000015837286,0.000017456223,0.0000015186287,0.00003341874,0.0001538879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990639,0.00007365384,0.00024060834,0.00019522324,0.00016406593,0.00026251486],"domain_scores_gemma":[0.9994711,0.00011285832,0.00003661237,0.00021881238,0.00003734907,0.00012324571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000288021,0.00017779102,0.0002242181,0.00007559325,0.00008371731,0.000039770595,0.0001703638,0.00016256722,0.00008045929],"category_scores_gemma":[0.00005928917,0.00013748916,0.00005537693,0.0002006979,0.000048229987,0.0003824695,0.0000431232,0.0001281024,0.00017759521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008536366,0.000016897278,0.0009057877,0.00003275322,0.000059329923,0.000012403333,0.000117970994,0.0000023806435,0.008593964,0.9894994,0.0004728222,0.00027778276],"study_design_scores_gemma":[0.002139752,0.00006378817,0.0018914808,0.000076069344,0.00002142505,0.000028527895,0.000018446764,0.00010244664,0.007061846,0.9862949,0.002037792,0.00026350326],"about_ca_topic_score_codex":0.0000032126982,"about_ca_topic_score_gemma":0.0000017767502,"teacher_disagreement_score":0.014758507,"about_ca_system_score_codex":0.00004169964,"about_ca_system_score_gemma":0.000009050583,"threshold_uncertainty_score":0.56066453},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91314524,0.0009057651,0.0011463737,0.046161626,0.027786532,0.00050488306,0.000015725635,0.002034475,0.008299375],"genre_scores_gemma":[0.993791,0.00005283127,0.0028005347,0.0010619696,0.000016800224,0.000005297097,0.0000013370509,0.000016243088,0.0022539874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983316,0.00006484251,0.0003027957,0.0005402264,0.0003798897,0.00038065435],"domain_scores_gemma":[0.998382,0.00025292306,0.00010671884,0.0009305184,0.000084739004,0.00024313365],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040397223,0.0001732806,0.00017741307,0.00013037049,0.00013275183,0.000090705034,0.0007530201,0.00009159456,0.000006189032],"category_scores_gemma":[0.00024128563,0.000117571995,0.000080095924,0.00032149913,0.000042650718,0.00037188077,0.00020129008,0.00011628912,0.00089075253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028215914,0.00006350983,0.00006142258,0.0000013253849,0.000010115145,0.000010844185,0.00007506429,0.000004543305,0.0025758855,0.94624525,0.036468696,0.014455152],"study_design_scores_gemma":[0.0027560587,0.00029850221,0.00021691067,0.00007133959,0.0000037746638,0.0000032765026,0.0000013360157,0.00012333537,0.007206234,0.9821267,0.006981371,0.00021113406],"about_ca_topic_score_codex":0.00005828426,"about_ca_topic_score_gemma":0.0000013928487,"teacher_disagreement_score":0.080645755,"about_ca_system_score_codex":0.000035835976,"about_ca_system_score_gemma":0.00011284446,"threshold_uncertainty_score":0.99988717},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9727743,0.0030140954,0.0014608655,0.004251286,0.014017279,0.0003937831,0.000035350105,0.00033009762,0.003722946],"genre_scores_gemma":[0.99591625,0.00032313084,0.0019873702,0.00019480649,0.000004075262,0.000011017441,0.0000017150538,0.000036743073,0.0015248996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655694,0.00019813438,0.0008721072,0.0008736977,0.00074004725,0.0007590895],"domain_scores_gemma":[0.9966683,0.00037359053,0.0004963843,0.0014896153,0.00063434005,0.00033779276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096948876,0.00040176214,0.00057403895,0.00034727188,0.00022031329,0.00009887195,0.0014289,0.00027048626,0.00013396029],"category_scores_gemma":[0.0002494941,0.00029885044,0.0002797148,0.0012671864,0.00044003318,0.00052489125,0.0005724041,0.00023307862,0.00046721727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018077073,0.00034405882,0.0019097555,0.00004521234,0.00007816602,0.000016050612,0.00043291104,0.000002469294,0.017118344,0.9621249,0.010722083,0.0071879765],"study_design_scores_gemma":[0.002479949,0.000672183,0.0006594676,0.0005661993,0.00005168707,0.000010609704,0.000026618885,0.00020689395,0.024260512,0.96687293,0.0037139675,0.00047897367],"about_ca_topic_score_codex":0.00012540046,"about_ca_topic_score_gemma":0.0000022171605,"teacher_disagreement_score":0.023141945,"about_ca_system_score_codex":0.00004446769,"about_ca_system_score_gemma":0.00021848844,"threshold_uncertainty_score":0.99994636},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933974,0.00012704497,0.0028444377,0.0006695526,0.0022988343,0.00022783126,0.000003248489,0.00013982615,0.00029181357],"genre_scores_gemma":[0.99607146,0.000016900201,0.003620177,0.00016263273,9.238475e-7,0.000034785186,3.360368e-7,0.00000981619,0.000082973405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988268,0.00003391193,0.0002576579,0.0003399297,0.00026342456,0.00027830323],"domain_scores_gemma":[0.9985501,0.00049291784,0.00013751918,0.0005788058,0.00015007079,0.000090568836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041662419,0.0001251024,0.00018520618,0.00014933295,0.00009888981,0.00002610127,0.00067253027,0.000052769232,0.000003127841],"category_scores_gemma":[0.00019293209,0.00008884456,0.000092066235,0.0002811105,0.000072432806,0.000325985,0.00014983986,0.000055295564,0.000026054855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015038515,0.00006619281,0.00056150014,0.00001236429,0.000010811283,0.0000025498377,0.000046604193,0.0000042099537,0.007521095,0.9847934,0.00087820285,0.006088003],"study_design_scores_gemma":[0.0010150848,0.00039896034,0.0006407516,0.00011179571,0.0000044378553,0.000002231962,0.0000024643464,0.00021645069,0.035660453,0.9617096,0.00010738676,0.00013037954],"about_ca_topic_score_codex":0.000014463649,"about_ca_topic_score_gemma":0.0000012042356,"teacher_disagreement_score":0.028139357,"about_ca_system_score_codex":0.000024173765,"about_ca_system_score_gemma":0.000048923233,"threshold_uncertainty_score":0.3622976},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99587876,0.00026992167,0.0013129307,0.0008600135,0.0007252185,0.0003083765,0.000004818334,0.000050727715,0.0005892355],"genre_scores_gemma":[0.9981919,0.00008431472,0.0014995246,0.000019006635,0.0000031390703,0.000012001383,5.863228e-7,0.000010145563,0.00017936516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985896,0.00013590517,0.00028279333,0.00035962352,0.00038686203,0.00024525376],"domain_scores_gemma":[0.99837446,0.0003550345,0.00019811894,0.0006178084,0.00036994388,0.00008464653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061708945,0.000120733544,0.0002634749,0.00020074053,0.000048400943,0.000015085022,0.0005813975,0.000058866564,0.0000075268576],"category_scores_gemma":[0.00031102015,0.00009280123,0.00004196844,0.00053562,0.0004537711,0.00075085106,0.00023799669,0.00007879346,0.000008482934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002514043,0.000064010084,0.002972487,0.000047803445,0.000019733121,0.0000022377078,0.0002258098,2.0262993e-7,0.06757993,0.9225103,0.000127096,0.006425194],"study_design_scores_gemma":[0.000949916,0.00017550454,0.0046778913,0.000047482175,0.0000037904358,0.000003899621,0.000019598327,0.000050219573,0.19357313,0.8002731,0.00012326213,0.000102153],"about_ca_topic_score_codex":0.000008973287,"about_ca_topic_score_gemma":5.301548e-7,"teacher_disagreement_score":0.1259932,"about_ca_system_score_codex":0.00002343884,"about_ca_system_score_gemma":0.000071260016,"threshold_uncertainty_score":0.37843242},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940448,0.000110480505,0.00023232761,0.0015437338,0.0010909077,0.000089942376,0.0000013347606,0.00005646489,0.0028300136],"genre_scores_gemma":[0.9993539,0.00002458209,0.00025900567,0.00021938948,5.8461956e-7,0.0000044684107,1.7229497e-7,0.000006057261,0.00013188276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900717,0.000082960076,0.00017972117,0.00027008503,0.00025582424,0.00020422248],"domain_scores_gemma":[0.9989913,0.0002723526,0.00006333199,0.00051393744,0.00009709416,0.00006196761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038585396,0.0001076065,0.00011741873,0.00005453475,0.0001097697,0.000041317147,0.00044184708,0.000045669076,0.00003788411],"category_scores_gemma":[0.00007659248,0.000055662844,0.000053743148,0.0002946154,0.00018101669,0.00015113807,0.00016209389,0.00007178554,0.00009056172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027917874,0.00005681587,0.002391059,0.0000035315197,0.000005721334,0.0000017369046,0.00011621597,4.541249e-7,0.003993849,0.99055153,0.002049119,0.0008271903],"study_design_scores_gemma":[0.00045159645,0.000081381666,0.0010433388,0.000035489476,0.000004727305,0.0000073639285,0.000005972691,0.00007954504,0.006972982,0.99109036,0.00013293051,0.00009433195],"about_ca_topic_score_codex":0.000023105047,"about_ca_topic_score_gemma":6.7052935e-7,"teacher_disagreement_score":0.0053090625,"about_ca_system_score_codex":0.000008119073,"about_ca_system_score_gemma":0.00003055667,"threshold_uncertainty_score":0.22698648},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98868,0.000016339955,0.00016394483,0.0035029047,0.000088672234,0.00038994916,0.0000061884975,0.000037149413,0.007114852],"genre_scores_gemma":[0.99946314,0.000018935894,0.000038869784,0.00012712143,0.0000035009339,0.00009355588,3.6992833e-7,0.000019484927,0.00023503469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909645,0.00016965641,0.00020461464,0.00016935395,0.000196559,0.00016338145],"domain_scores_gemma":[0.99625325,0.0029101423,0.00017536018,0.0005729508,0.00004667946,0.000041602383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000512844,0.00014069735,0.00020452132,0.000037402344,0.00024150778,0.000022137547,0.0003140888,0.0000673631,0.00006578409],"category_scores_gemma":[0.00013762747,0.000057919395,0.000067945744,0.00023281237,0.00043433308,0.000058144586,0.00006537831,0.00018008419,0.000014560791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010051002,0.000081176295,0.003654692,0.000010860539,0.00007278391,5.9596425e-7,0.0006958013,2.685865e-7,0.00013867313,0.9941643,0.0008543059,0.00022605057],"study_design_scores_gemma":[0.0013976753,0.000038989845,0.0024870045,0.00009339747,0.00003827995,0.0000050851563,0.00025872688,0.0000068220606,0.0006591165,0.9947454,0.0001722858,0.000097214375],"about_ca_topic_score_codex":0.000046687932,"about_ca_topic_score_gemma":0.000014950356,"teacher_disagreement_score":0.0107831275,"about_ca_system_score_codex":0.000007335387,"about_ca_system_score_gemma":0.00001623671,"threshold_uncertainty_score":0.23618844},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9751697,0.00005469703,0.016637854,0.004570067,0.0014042413,0.00022005249,0.0000026705063,0.00019441104,0.0017462665],"genre_scores_gemma":[0.9969677,0.00000955756,0.0027401072,0.000068658905,0.0000033397641,0.000030868232,6.561528e-7,0.000013702085,0.00016545576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816984,0.00020036519,0.00024816708,0.0004534472,0.0004405998,0.00048756498],"domain_scores_gemma":[0.99821395,0.000919715,0.00003828293,0.00056800357,0.000115959876,0.00014407598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007029329,0.00014304451,0.00017068253,0.00030164528,0.000096147414,0.00007659387,0.00080647087,0.00008335273,0.000023980258],"category_scores_gemma":[0.00083946576,0.00011268488,0.00006246703,0.0007049579,0.0001970613,0.0010414144,0.00027274218,0.00019005011,0.00010737961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022454813,0.000087895765,0.0009666374,0.000006575982,0.0000035189312,0.0000516172,0.00016261492,5.934602e-7,0.006992392,0.97996444,0.00015541559,0.011585846],"study_design_scores_gemma":[0.0011778458,0.00010743047,0.014824588,0.000054138967,0.0000011220504,0.000017034368,0.000012880411,0.00042025823,0.0027448656,0.98040676,0.00006757717,0.00016551274],"about_ca_topic_score_codex":0.000011330757,"about_ca_topic_score_gemma":0.0000034959075,"teacher_disagreement_score":0.021797914,"about_ca_system_score_codex":0.000101951984,"about_ca_system_score_gemma":0.00005961842,"threshold_uncertainty_score":0.4595156},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9729272,0.00029730925,0.006065274,0.007905541,0.004496568,0.0001952404,0.0000023723098,0.0009911894,0.0071192794],"genre_scores_gemma":[0.9951755,0.000040131268,0.0038636283,0.00042924317,5.5219067e-7,0.000012435646,3.4916653e-7,0.00000948713,0.00046870823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988951,0.000071902854,0.00018169008,0.0003454263,0.00022407781,0.00028181972],"domain_scores_gemma":[0.99885505,0.00012394291,0.000061246115,0.00071100594,0.00011242805,0.00013632808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003200724,0.00012272608,0.00012832633,0.00012769001,0.0001114493,0.000058853337,0.0006700694,0.00006715232,0.00002228348],"category_scores_gemma":[0.00005804989,0.000081287195,0.000073934025,0.00047156302,0.00006181775,0.0003166107,0.0001840314,0.00006765306,0.00022703344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013426378,0.000041363866,0.0016364194,0.0000020961115,0.000008795002,0.0000069430557,0.00004439937,3.1623205e-7,0.0032280374,0.98143524,0.005442599,0.008152469],"study_design_scores_gemma":[0.0005389052,0.000065392975,0.0009724055,0.00003176656,0.000002827407,0.000006211356,0.0000018047494,0.0000819938,0.012485955,0.98321277,0.0024480575,0.00015191862],"about_ca_topic_score_codex":0.00002117754,"about_ca_topic_score_gemma":0.0000013473103,"teacher_disagreement_score":0.022248238,"about_ca_system_score_codex":0.000019871024,"about_ca_system_score_gemma":0.000042970376,"threshold_uncertainty_score":0.33147955},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97170234,0.00005755733,0.001771057,0.0045866207,0.001672451,0.00038943547,0.000004795003,0.00012054788,0.019695213],"genre_scores_gemma":[0.99841446,0.000011193766,0.001348589,0.00011467552,0.000002689512,0.000013595181,4.2994225e-7,0.000009643825,0.000084754625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986377,0.00016117308,0.00017931026,0.00030468742,0.00040557943,0.00031155226],"domain_scores_gemma":[0.99693316,0.00044961288,0.00021570754,0.0021668717,0.00015814397,0.0000765267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084811234,0.00012296635,0.00017920152,0.0000862612,0.00080393837,0.00016035682,0.0031725438,0.00004374096,0.000014800578],"category_scores_gemma":[0.00069307984,0.00008523618,0.000094157265,0.00019961693,0.00088619906,0.00034436918,0.0006611826,0.00027734888,0.00005361178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011734351,0.000060697166,0.00073935126,0.000005211622,0.00001529995,0.0000070875362,0.000114586415,0.0000015175791,0.00041415053,0.9945975,0.00042341123,0.003609441],"study_design_scores_gemma":[0.00033026305,0.000121752,0.006092677,0.000028441336,0.0000019326162,0.0000029309629,0.000014799696,0.00064383197,0.006933463,0.9855946,0.00013366608,0.00010168282],"about_ca_topic_score_codex":0.000029072908,"about_ca_topic_score_gemma":0.00000539439,"teacher_disagreement_score":0.026712107,"about_ca_system_score_codex":0.00002250898,"about_ca_system_score_gemma":0.00003480926,"threshold_uncertainty_score":0.6183325},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94537467,0.00083015533,0.043708295,0.0026289092,0.0032551659,0.0005139912,0.000005292692,0.0003078423,0.003375701],"genre_scores_gemma":[0.99573547,0.00007242169,0.004044161,0.00006049695,0.0000042071265,0.000011535485,5.989385e-7,0.0000095132045,0.00006162628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986118,0.00009334573,0.00023206828,0.000264831,0.0004400444,0.00035791856],"domain_scores_gemma":[0.9984342,0.00026673934,0.00009857754,0.00093909417,0.00016379237,0.00009763031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058215245,0.0001185568,0.00015212805,0.00009221951,0.00025440642,0.000045296118,0.0016858557,0.000049854414,0.0000016190164],"category_scores_gemma":[0.00013006166,0.000085910215,0.0000908035,0.0008406206,0.0002184481,0.00027327533,0.00031022378,0.00022472285,0.00003229714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010572471,0.000063200336,0.0005713545,0.0000044735048,0.000015664238,0.000009252714,0.0001593453,0.00007795762,0.00032955018,0.99695826,0.00007630678,0.0017240852],"study_design_scores_gemma":[0.0005391344,0.00013636236,0.0012768189,0.000010698865,0.0000021231149,0.0000046064524,0.000016007254,0.00030653548,0.009063171,0.9874137,0.001132117,0.000098735036],"about_ca_topic_score_codex":0.000032391254,"about_ca_topic_score_gemma":0.000005476414,"teacher_disagreement_score":0.05036079,"about_ca_system_score_codex":0.000043323576,"about_ca_system_score_gemma":0.00008641111,"threshold_uncertainty_score":0.3503317},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70990914,0.0007268465,0.15632507,0.005375379,0.080060646,0.0020842527,0.0000448677,0.0014267198,0.044047087],"genre_scores_gemma":[0.99601513,0.0000145462545,0.0031281086,0.00013680248,0.000057867783,0.00009818848,0.0000053428116,0.000014760768,0.00052923383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872947,0.000029929995,0.00021635166,0.0003918788,0.00025699145,0.00037538577],"domain_scores_gemma":[0.99805456,0.00011325939,0.00020898375,0.0013572465,0.00015462632,0.00011131166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023930802,0.0001693049,0.0002232355,0.00005697713,0.0012510092,0.0006781622,0.001748712,0.00008644685,0.000012693307],"category_scores_gemma":[0.00026167533,0.00017047628,0.00013450673,0.00006903827,0.00014715982,0.0014934901,0.00040117317,0.00010677405,0.00006920881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070162314,0.00006940059,0.00033637,0.000010844488,0.000015963196,0.000008075298,0.000065983724,0.0000054096636,0.00014650926,0.9949042,0.0034333712,0.0009968219],"study_design_scores_gemma":[0.0014919359,0.00012895284,0.0018170717,0.000013993785,0.000009226801,0.000005486118,0.000010427302,0.0008917069,0.002163371,0.9856086,0.0076327045,0.00022655276],"about_ca_topic_score_codex":0.000008978593,"about_ca_topic_score_gemma":0.0000018257118,"teacher_disagreement_score":0.28610602,"about_ca_system_score_codex":0.000048785347,"about_ca_system_score_gemma":0.000060376053,"threshold_uncertainty_score":0.9621877},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98708975,0.00003855692,0.0023845541,0.0002923624,0.0019157446,0.000105952866,9.0197824e-7,0.00017250536,0.007999691],"genre_scores_gemma":[0.9980752,0.00000645412,0.0015426032,0.0001576603,0.000008062386,0.0000070562323,8.5252464e-7,0.000010690884,0.00019144814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869365,0.00005440844,0.00013252089,0.0004295337,0.00034073892,0.0003491436],"domain_scores_gemma":[0.99802357,0.00012318355,0.00018692594,0.0014450963,0.00009386701,0.00012737804],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004318033,0.00017426454,0.00018720815,0.00021058907,0.0013127429,0.0006155595,0.001575634,0.000061359046,0.000005197413],"category_scores_gemma":[0.000118100485,0.00013967037,0.000071728,0.00045326783,0.00012884843,0.00061497453,0.00027957483,0.00022111252,0.000082581675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009454873,0.00008422991,0.0095453495,0.0000044282133,0.000020323449,0.00006664094,0.00009151456,0.0000022337779,0.00002458023,0.9791631,0.00018875388,0.010799387],"study_design_scores_gemma":[0.0008120542,0.00032145166,0.084271915,0.000039084236,0.000007901817,0.000020237185,0.000007857435,0.00075697096,0.00323787,0.90971935,0.0005304345,0.00027487375],"about_ca_topic_score_codex":0.000031363816,"about_ca_topic_score_gemma":0.0000026646956,"teacher_disagreement_score":0.07472656,"about_ca_system_score_codex":0.000024826251,"about_ca_system_score_gemma":0.00003310903,"threshold_uncertainty_score":0.9999874},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8964867,0.000032411015,0.005043782,0.009035218,0.0031415713,0.00044177068,0.0000021325636,0.00016887668,0.08564752],"genre_scores_gemma":[0.9978719,0.000009071874,0.00060488784,0.00020915926,0.000009124543,0.000031205076,5.3778274e-7,0.0000109890225,0.0012531518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870825,0.00013373171,0.000117186064,0.00031259048,0.0004269372,0.00030132188],"domain_scores_gemma":[0.9972964,0.0004512002,0.0001131022,0.0019474082,0.00011688873,0.00007500042],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006822209,0.000117877804,0.00010416037,0.00004289976,0.001063503,0.0004895929,0.002655836,0.000049072274,0.0000682814],"category_scores_gemma":[0.0006048495,0.000083516396,0.000064213724,0.00013460997,0.00018522971,0.0006458231,0.000530905,0.00025168044,0.00086907914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008948858,0.0000454379,0.0009410159,0.0000016469253,0.000007220976,0.000008011005,0.00013422903,0.0000020096077,0.00012898524,0.98539424,0.001974988,0.011353291],"study_design_scores_gemma":[0.0003990328,0.00004962822,0.0069903806,0.000014423007,0.0000012885408,0.000005280507,0.00001194019,0.0012617417,0.002504279,0.98609734,0.0025548136,0.00010986331],"about_ca_topic_score_codex":0.000011021362,"about_ca_topic_score_gemma":0.0000010249406,"teacher_disagreement_score":0.101385154,"about_ca_system_score_codex":0.000048315527,"about_ca_system_score_gemma":0.00003278711,"threshold_uncertainty_score":0.99990886},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9567877,0.000027982867,0.000023108929,0.008505254,0.0003046205,0.00048240754,0.000006409198,0.000044301178,0.033818185],"genre_scores_gemma":[0.9977907,0.000010557969,0.00065252115,0.00015260761,0.000011325075,0.000108120585,0.0000015706544,0.000019885421,0.0012527329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912393,0.000045379296,0.00019690051,0.0001746908,0.00024879692,0.00021027349],"domain_scores_gemma":[0.9977218,0.00041713528,0.00018215994,0.0016121217,0.00002338012,0.000043402935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000509578,0.00012502394,0.00017692766,0.000041165382,0.00042413888,0.00013904678,0.00081233704,0.00006779984,0.000040486764],"category_scores_gemma":[0.0005019842,0.00008813855,0.000066097324,0.00005807215,0.000081365855,0.00008490759,0.0000851398,0.00019081146,0.00011545422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002034271,0.00026664228,0.00006746964,0.00001638328,0.000007383254,0.0000043712,0.0003835644,2.2368963e-7,0.000075083204,0.9594092,0.0396818,0.00008589493],"study_design_scores_gemma":[0.00040702673,0.000034919714,0.00081846997,0.00004272643,0.000012194022,0.0000026878404,0.000097295655,0.00010525338,0.00036723787,0.9938016,0.004201509,0.00010910311],"about_ca_topic_score_codex":0.000022768549,"about_ca_topic_score_gemma":0.000011244272,"teacher_disagreement_score":0.041002948,"about_ca_system_score_codex":0.000026315214,"about_ca_system_score_gemma":0.000021496158,"threshold_uncertainty_score":0.35941857},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9102943,0.001363757,0.00475118,0.012130486,0.010068253,0.0010800262,0.000022938526,0.00040941936,0.059879623],"genre_scores_gemma":[0.9974773,0.000072712304,0.0020182848,0.000036836856,0.0000043500495,0.000015562346,2.3577593e-7,0.00001100027,0.0003637458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985539,0.00010254173,0.00020085888,0.00028224176,0.0004746247,0.0003858575],"domain_scores_gemma":[0.99497056,0.0007687832,0.00020945322,0.0038040243,0.00014641999,0.00010078866],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00079248514,0.00012103493,0.00016366939,0.000047669982,0.0009863479,0.00024430876,0.006715743,0.000052416297,0.0000048150773],"category_scores_gemma":[0.0011905548,0.00008834666,0.00009366483,0.0001795205,0.00050799904,0.00047640348,0.0009860396,0.00021077352,0.000025693567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016985909,0.000031926094,0.0020416742,0.000005400742,0.000019900579,0.000012152,0.000078025,6.073996e-7,0.00048433896,0.9904602,0.0015057607,0.0053429925],"study_design_scores_gemma":[0.0006250869,0.00009319661,0.011714225,0.0000114872455,0.0000022946415,0.0000040804125,0.000016335001,0.00011259536,0.003526773,0.9815172,0.0022746087,0.00010212996],"about_ca_topic_score_codex":0.000029675286,"about_ca_topic_score_gemma":0.000011961826,"teacher_disagreement_score":0.087182954,"about_ca_system_score_codex":0.000018286713,"about_ca_system_score_gemma":0.000055041924,"threshold_uncertainty_score":0.9986584},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99314326,0.00012737751,0.0000013252995,0.00019504783,0.00022429944,0.00023712436,0.000013683974,0.000061599574,0.005996276],"genre_scores_gemma":[0.9994215,0.000108931294,0.00015713919,0.000033185883,0.0000019142267,0.000039338684,0.0000034302648,0.00002261374,0.00021194661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904627,0.00006280468,0.00026443464,0.00025346488,0.00017132815,0.00020172868],"domain_scores_gemma":[0.99803644,0.00042277723,0.00038391288,0.0010236143,0.00003955307,0.00009372319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003273712,0.00016733314,0.00027672367,0.00016182946,0.00047224486,0.00005807962,0.0005134746,0.000101759,0.0000282096],"category_scores_gemma":[0.00020340513,0.00015213365,0.000102810845,0.00014700412,0.00035057633,0.0001332652,0.0001020735,0.00017438532,0.000015522688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000129727705,0.00022675688,0.005784469,0.000028187887,0.000054012122,0.0000016916753,0.00016343428,3.2118162e-8,0.0008125307,0.99083656,0.0008606054,0.0012187609],"study_design_scores_gemma":[0.0008063667,0.00011014812,0.030437589,0.000058981757,0.000056306926,0.0000023545529,0.00003574235,0.000008057615,0.00416571,0.96393377,0.00023750769,0.00014748191],"about_ca_topic_score_codex":0.00003353402,"about_ca_topic_score_gemma":0.000025887335,"teacher_disagreement_score":0.026902791,"about_ca_system_score_codex":0.0000080104455,"about_ca_system_score_gemma":0.000015190867,"threshold_uncertainty_score":0.620383},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9805057,0.00009309678,0.013842224,0.00027442788,0.0010020374,0.0002199892,0.0000064096257,0.00011642992,0.0039396775],"genre_scores_gemma":[0.99787587,0.00000674347,0.0017912469,0.000021177237,0.0000048996053,0.00001765952,0.0000013175476,0.000015324735,0.0002657735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837136,0.000081654995,0.00018916333,0.00041091954,0.00048641974,0.00046049056],"domain_scores_gemma":[0.99712867,0.0001564225,0.00024147928,0.002046788,0.0003095277,0.00011713308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047098007,0.00015599917,0.00025906102,0.00011353498,0.0004862533,0.00017698416,0.0026322934,0.000057060217,0.000012054738],"category_scores_gemma":[0.00021910312,0.00012704791,0.000055452216,0.0003103893,0.0002672067,0.0008001332,0.00070575543,0.00017477029,0.000026336138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029844887,0.0002078496,0.022118472,0.000015669315,0.000020860854,0.000033837,0.0003102264,0.000012593814,0.000464998,0.97550565,0.00010388082,0.0011760959],"study_design_scores_gemma":[0.002635934,0.00053702167,0.08367242,0.000096967226,0.000009306584,0.000014287986,0.00014287395,0.0020106907,0.020606792,0.888507,0.0013710539,0.0003956539],"about_ca_topic_score_codex":0.000023787916,"about_ca_topic_score_gemma":0.00005287498,"teacher_disagreement_score":0.08699867,"about_ca_system_score_codex":0.00002608063,"about_ca_system_score_gemma":0.0000986683,"threshold_uncertainty_score":0.5180863},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8860305,0.009956194,0.00651771,0.00718214,0.04176061,0.001126283,0.0001545682,0.0004705214,0.046801485],"genre_scores_gemma":[0.9948924,0.00068363926,0.0026949942,0.00016299832,0.000060957158,0.000009690258,0.000007939541,0.00002840176,0.0014589357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759287,0.000088953144,0.00033698435,0.0008695431,0.0004794903,0.0006321675],"domain_scores_gemma":[0.99607426,0.00010101037,0.000397277,0.0029109528,0.0001405793,0.00037591552],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005098129,0.0003443267,0.00040572067,0.00007253158,0.0019314894,0.0024947976,0.0023836535,0.00021379077,0.000059982904],"category_scores_gemma":[0.00017462896,0.0003295972,0.000084669075,0.00009502901,0.00033230108,0.0021164822,0.0034117587,0.00036088174,0.00026336752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016083755,0.00021356835,0.0066217356,0.00006836917,0.000043699936,0.00018186485,0.00050905993,0.0000015346271,0.00023342411,0.8695397,0.018443622,0.10412735],"study_design_scores_gemma":[0.0029839466,0.00040754865,0.086185746,0.00046214357,0.000056409284,0.000060357008,0.000057084162,0.05014843,0.0011275408,0.8048925,0.052606303,0.0010120127],"about_ca_topic_score_codex":0.0004047201,"about_ca_topic_score_gemma":0.000008251961,"teacher_disagreement_score":0.10886195,"about_ca_system_score_codex":0.000051605686,"about_ca_system_score_gemma":0.00013856174,"threshold_uncertainty_score":0.9999156},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9967391,0.00004748428,0.00022214749,0.00005608051,0.000039338658,0.00017762507,0.000008729205,0.0000150368,0.0026944468],"genre_scores_gemma":[0.98532784,0.000014657411,0.014567059,0.0000023561076,0.0000033630647,0.000015608062,0.0000012311057,0.000012120558,0.000055782068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993898,0.000017380868,0.00022786656,0.00012156533,0.0001454301,0.00009793592],"domain_scores_gemma":[0.99878293,0.00015658826,0.00042398824,0.00052235305,0.00007089304,0.0000432458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022509845,0.00008838405,0.00026929055,0.000026455877,0.00015397611,0.000040743642,0.00023228124,0.00003893811,0.0000184707],"category_scores_gemma":[0.000094841074,0.00006756962,0.000027410966,0.000029755243,0.00014211929,0.00012585889,0.000051396728,0.0000491179,6.481514e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012438383,0.00017362679,0.0014090082,0.00024256558,0.000027698929,0.0000020407936,0.0005809168,0.000002165454,0.0025417237,0.99461514,0.00013360464,0.00025909313],"study_design_scores_gemma":[0.0008522362,0.00014535691,0.0009784481,0.00017491338,0.000040714356,0.0000042786764,0.00019661718,0.00044127717,0.023352198,0.97356766,0.00013328811,0.00011299277],"about_ca_topic_score_codex":0.000056244804,"about_ca_topic_score_gemma":0.000029730105,"teacher_disagreement_score":0.021047438,"about_ca_system_score_codex":0.0000065482495,"about_ca_system_score_gemma":0.000024014453,"threshold_uncertainty_score":0.27554092},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8973958,0.00027254925,0.00999227,0.01161503,0.02343608,0.0008077899,0.00004152992,0.00094523653,0.05549373],"genre_scores_gemma":[0.99776554,0.00001915503,0.0016028682,0.00021784905,0.000022121458,0.000014158376,0.0000027800481,0.000019109926,0.00033640684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976988,0.00014532785,0.00021777322,0.0006100961,0.00078404153,0.0005439701],"domain_scores_gemma":[0.9966298,0.00072454574,0.000105509724,0.0019763536,0.00029991544,0.0002639291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041286796,0.0002005055,0.00020808098,0.00017652744,0.001041181,0.00049585826,0.0023185355,0.00012245157,0.000061845036],"category_scores_gemma":[0.001879405,0.0001920594,0.000093329254,0.00026021796,0.0003684434,0.0011048759,0.00053577154,0.0005651313,0.0004965175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006412146,0.0001471079,0.001516494,0.0000057411744,0.000017006274,0.00006147018,0.00005894721,0.000003412038,0.00068065757,0.99340487,0.0013939987,0.0026461738],"study_design_scores_gemma":[0.00063259207,0.00030571796,0.021053936,0.000023848552,0.0000024446256,0.000011218325,0.000006154222,0.0005666469,0.0026821431,0.9703924,0.0040941336,0.00022874717],"about_ca_topic_score_codex":0.000024478057,"about_ca_topic_score_gemma":0.0000026054347,"teacher_disagreement_score":0.10036977,"about_ca_system_score_codex":0.00007152375,"about_ca_system_score_gemma":0.00010707291,"threshold_uncertainty_score":0.8008028},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74383503,0.00091158465,0.028098773,0.035683896,0.065323874,0.0015754078,0.0000050285093,0.0017878228,0.12277856],"genre_scores_gemma":[0.9955012,0.000022548793,0.0035840857,0.00015547132,0.000031476902,0.000022085156,4.8960584e-7,0.000012873115,0.00066972914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818164,0.00011788955,0.0002558707,0.0005074292,0.00044202845,0.00049514935],"domain_scores_gemma":[0.99572474,0.00039612604,0.00022171167,0.0033501298,0.00015331515,0.0001539582],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009118937,0.00019085761,0.00019314929,0.000027545186,0.0020182007,0.001542207,0.0051047173,0.00008213621,0.000009379564],"category_scores_gemma":[0.00046737652,0.00014205764,0.00011963631,0.00013194449,0.00029499974,0.0006286499,0.0016510002,0.00026356435,0.00026156515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028087525,0.000059762264,0.00458895,0.0000030116787,0.0000172236,0.00001631069,0.00018379292,0.000004883892,0.000016616263,0.94558316,0.0040156823,0.045507822],"study_design_scores_gemma":[0.0005406092,0.00006937407,0.039621376,0.0000074703066,0.0000045304455,0.000014614452,0.000015815845,0.010640625,0.0002603944,0.9216135,0.026973415,0.0002382481],"about_ca_topic_score_codex":0.0001641318,"about_ca_topic_score_gemma":0.00003410982,"teacher_disagreement_score":0.2516662,"about_ca_system_score_codex":0.00008952293,"about_ca_system_score_gemma":0.000100871606,"threshold_uncertainty_score":0.9994943},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9696911,0.00013030617,0.0073274383,0.0011597428,0.001815884,0.00036109512,0.0000014714219,0.00011538604,0.019397572],"genre_scores_gemma":[0.9975764,0.000016802378,0.0020813646,0.000018567664,0.0000032930395,0.000023449677,1.7426092e-7,0.0000093468425,0.00027060643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872535,0.00012719694,0.00020037062,0.00022755092,0.00039488205,0.00032466024],"domain_scores_gemma":[0.9970052,0.0004651359,0.00020712143,0.0021019618,0.00013682708,0.000083720595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000726495,0.00010362661,0.00015525118,0.000036829017,0.00091763615,0.0002512157,0.0031374805,0.00003978819,0.000009072782],"category_scores_gemma":[0.00036282258,0.00007428445,0.00008870059,0.00019264796,0.0003991176,0.000506726,0.0006488606,0.00013743955,0.00008889899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008788488,0.000040661766,0.0022054634,0.0000074675854,0.000018231953,0.000006082755,0.00014497085,0.0000018697559,0.00038005374,0.99279433,0.00017519773,0.0042168503],"study_design_scores_gemma":[0.00047816077,0.00004010403,0.004909839,0.000016123686,0.0000025263976,0.0000053277267,0.00001794376,0.0008405485,0.0025282796,0.990866,0.00020539585,0.000089773326],"about_ca_topic_score_codex":0.000022610528,"about_ca_topic_score_gemma":0.0000039160846,"teacher_disagreement_score":0.02788529,"about_ca_system_score_codex":0.00001657215,"about_ca_system_score_gemma":0.000043808297,"threshold_uncertainty_score":0.7057808},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98690474,0.00005602757,0.0012026043,0.0007211128,0.0018429675,0.00013055658,0.0000028483205,0.00007955145,0.009059562],"genre_scores_gemma":[0.99914575,0.0000136535,0.00052884186,0.00015256352,0.0000132497,0.000008421513,4.6454306e-7,0.000007955816,0.00012910042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896693,0.0001048596,0.00016313657,0.0002746234,0.00028343094,0.0002070087],"domain_scores_gemma":[0.9976,0.00031204504,0.00018695227,0.001772278,0.00007164924,0.00005703396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048307024,0.00013567664,0.00017066817,0.00006166048,0.00062241673,0.00014803192,0.002040734,0.000057693356,0.0000338639],"category_scores_gemma":[0.00013107756,0.000092891176,0.0001320577,0.00012544141,0.0001874962,0.00027199366,0.0003453882,0.0001561293,0.000036147027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017452938,0.00011441392,0.00043797155,0.0000042241313,0.000026295516,0.000004511254,0.0002324508,0.0000024477806,0.00043048974,0.9960123,0.00089863344,0.0018188494],"study_design_scores_gemma":[0.00039916162,0.00015245334,0.011507082,0.000037849397,0.000006905767,0.0000012907641,0.0000070697565,0.002419253,0.008980831,0.97542036,0.00094394386,0.00012381248],"about_ca_topic_score_codex":0.000020647132,"about_ca_topic_score_gemma":0.0000025255642,"teacher_disagreement_score":0.020591913,"about_ca_system_score_codex":0.000010728821,"about_ca_system_score_gemma":0.000026088323,"threshold_uncertainty_score":0.4787189},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99127156,0.0001426634,0.00016450901,0.0014164165,0.004378884,0.00019992288,0.0000018512385,0.000088346984,0.002335847],"genre_scores_gemma":[0.99764365,0.000009322556,0.0017107549,0.00022334859,0.0000014956189,0.000009845745,4.484843e-7,0.000009557268,0.00039160176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862856,0.00005955262,0.00029626457,0.0003488569,0.00039881835,0.00026792963],"domain_scores_gemma":[0.996885,0.00006316856,0.000397221,0.0023684439,0.00020475798,0.00008138597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054533436,0.00014459871,0.00019430538,0.00004597793,0.0006272339,0.0001797141,0.0025938705,0.00007365801,0.0000055505916],"category_scores_gemma":[0.0002791235,0.00010485805,0.00011154801,0.00015876578,0.0001763354,0.00032693104,0.0010823626,0.00017365678,0.00004100023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004153779,0.00011930644,0.013909541,0.000012258762,0.00002152758,0.000001692047,0.0002597904,0.000008580787,0.006903702,0.97507334,0.0024341217,0.0012519605],"study_design_scores_gemma":[0.0014688649,0.00008012762,0.0068147215,0.00009595805,0.000014587949,0.0000041938856,0.000010339845,0.0048411353,0.038796842,0.94658774,0.0010805764,0.00020491771],"about_ca_topic_score_codex":0.00015190369,"about_ca_topic_score_gemma":0.0000023779055,"teacher_disagreement_score":0.03189314,"about_ca_system_score_codex":0.000018781615,"about_ca_system_score_gemma":0.00006400261,"threshold_uncertainty_score":0.48242396},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9956091,0.0000069483094,0.000014739546,0.00002670508,0.0010293474,0.00017158415,0.0000075754633,0.000021594007,0.0031124093],"genre_scores_gemma":[0.99990034,0.000003299909,0.000006317836,0.000004699986,0.000002908547,0.0000117749805,7.959737e-7,0.000012322805,0.00005755506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99951744,0.000044415556,0.00014752614,0.00006179741,0.00014006787,0.00008873435],"domain_scores_gemma":[0.9990547,0.000018517512,0.00016329368,0.0007082716,0.000039542967,0.000015678146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011863071,0.00007990691,0.0001248336,0.000011356769,0.00012833197,0.000016953607,0.00047553584,0.00003821427,0.000006990987],"category_scores_gemma":[0.000021020756,0.00004421882,0.00005638069,0.00010714265,0.00013392375,0.000107289496,0.000038809398,0.00007337019,0.0000029676912],"study_design_candidate":"observational","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.000011851086,0.00003941622,0.20902689,0.000299596,0.000103576094,0.0000010780963,0.0010417285,0.00007167437,0.25405666,0.53502285,0.000032790398,0.0002918756],"study_design_scores_gemma":[0.00058238755,0.000024330044,0.7170766,0.0005506177,0.000050990337,0.000015612855,0.000063655505,0.00044726214,0.1274312,0.15349515,0.00009741825,0.00016475117],"about_ca_topic_score_codex":0.000019476993,"about_ca_topic_score_gemma":0.000008110321,"teacher_disagreement_score":0.5080497,"about_ca_system_score_codex":0.000008980041,"about_ca_system_score_gemma":0.000010822668,"threshold_uncertainty_score":0.18031912},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93096524,0.000044276592,0.000018438977,0.0005801719,0.0020228683,0.00008182216,0.0000036809479,0.000048106012,0.06623538],"genre_scores_gemma":[0.99960315,0.000026870646,0.00003226012,0.00009323298,0.000061772815,0.0000040318814,0.000007454286,0.000012293637,0.00015890802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994259,0.0000043643245,0.00019956443,0.00015102807,0.00009649154,0.00012268481],"domain_scores_gemma":[0.9992745,0.00004611342,0.00028985253,0.00026659112,0.00011297713,0.000009951803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012231292,0.00009754448,0.00015171678,0.00007216447,0.00033058284,0.00019793073,0.00024227373,0.00005451802,0.000060713784],"category_scores_gemma":[0.0002547124,0.000086967535,0.00004512323,0.00004649949,0.00025946033,0.0006020659,0.00014062518,0.000083198625,0.00002300134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004381235,0.000030227535,0.046584804,0.00002449304,0.000034095294,0.0000016030295,0.00004278204,0.0000010196962,0.00071540615,0.95129293,0.00049187493,0.0007764041],"study_design_scores_gemma":[0.0007629892,0.000008913636,0.089760594,0.00006242644,0.000025669868,0.0000040436203,0.00022144489,0.000625655,0.00051780144,0.90176183,0.006104724,0.00014392518],"about_ca_topic_score_codex":0.00026052404,"about_ca_topic_score_gemma":0.000010397848,"teacher_disagreement_score":0.06863792,"about_ca_system_score_codex":0.000010830038,"about_ca_system_score_gemma":0.000007713874,"threshold_uncertainty_score":0.35464332},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9847847,0.00001671402,0.00016282081,0.000121079545,0.00040748573,0.00011816941,0.0000029000898,0.000043748667,0.014342367],"genre_scores_gemma":[0.99911743,0.0000025041236,0.00061485165,0.000015003083,0.000008444368,0.00000675705,0.0000013439517,0.0000140683,0.00021957056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935734,0.000029702709,0.00020746188,0.00013945192,0.000124005,0.00014205238],"domain_scores_gemma":[0.99861133,0.00017549268,0.00028345743,0.0008049022,0.00007884387,0.00004598213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002962777,0.00009155275,0.00018273159,0.00003538962,0.00035227227,0.00003371851,0.00045066638,0.00006261176,0.000037701342],"category_scores_gemma":[0.00019641776,0.000086650485,0.00006784788,0.00005379248,0.00013640482,0.00007779605,0.00013787721,0.00009510196,0.000017590271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000476428,0.00011229888,0.00771213,0.000024135501,0.000021228072,7.8131256e-7,0.00015433865,0.00000123622,0.0004894819,0.989825,0.00075792253,0.00089664425],"study_design_scores_gemma":[0.00044345963,0.000017014538,0.010914173,0.000033461976,0.000015990303,0.0000014749804,0.000043984095,0.00014618224,0.0033356524,0.98439044,0.00056403416,0.00009411439],"about_ca_topic_score_codex":0.000020230791,"about_ca_topic_score_gemma":0.0000036513686,"teacher_disagreement_score":0.014332742,"about_ca_system_score_codex":0.000008441512,"about_ca_system_score_gemma":0.000018106844,"threshold_uncertainty_score":0.35335043},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9913343,0.00002042395,0.00014520706,0.00055692036,0.0042254305,0.0005039246,0.00002047274,0.00020623079,0.0029870432],"genre_scores_gemma":[0.99781686,0.0000019125757,0.001273531,0.00023378778,0.00009902678,0.000068316425,0.0000032651578,0.00006786236,0.0004354478],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973106,0.00025814906,0.0003202938,0.00077656127,0.0005967201,0.0007377147],"domain_scores_gemma":[0.99719137,0.000103449194,0.00029555545,0.0019504031,0.00016312137,0.00029610711],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001024287,0.00035543452,0.000491551,0.00012267385,0.0007551239,0.0008992173,0.0012846083,0.00015679769,0.00032114884],"category_scores_gemma":[0.0005373253,0.00031639327,0.00007614168,0.00012211683,0.00016410853,0.0005090572,0.00051771465,0.00014681042,0.0005230414],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031163933,0.00014524901,0.019222038,0.000015511934,0.000025465672,0.00018194305,0.00031981972,0.000016933516,0.87159365,0.107278235,0.0007442118,0.00014527976],"study_design_scores_gemma":[0.0017983164,0.0004412485,0.15214743,0.000054730994,0.000031621938,0.00004778158,0.00005347181,0.00006108499,0.8268021,0.01738973,0.0005518295,0.000620702],"about_ca_topic_score_codex":0.00085533125,"about_ca_topic_score_gemma":0.00022818084,"teacher_disagreement_score":0.13292538,"about_ca_system_score_codex":0.00017435593,"about_ca_system_score_gemma":0.00016539404,"threshold_uncertainty_score":0.99992883},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91965497,0.00013136839,0.0039327163,0.005166588,0.0040270425,0.00033607206,0.0000044059398,0.000537509,0.066209316],"genre_scores_gemma":[0.9922432,0.0000027037047,0.0069758967,0.00026330195,0.0000036641702,0.0000072882235,2.4248885e-7,0.000010501048,0.0004932362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897206,0.000028106968,0.00018603838,0.0002593216,0.000361476,0.00019301656],"domain_scores_gemma":[0.9977821,0.000099561905,0.0002944416,0.0016293221,0.00014661369,0.00004797729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027453006,0.000121416604,0.00014448099,0.000038211405,0.00033186466,0.00048222338,0.0033186246,0.0000566969,0.0000030418623],"category_scores_gemma":[0.0005351885,0.00008905138,0.000074196025,0.000113159884,0.00020279162,0.00079882034,0.0009077282,0.00016836064,0.000027317099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035326889,0.000106749925,0.0007209338,0.000010123043,0.000008049429,0.0000027640317,0.0000749817,3.7739593e-7,0.0006127948,0.98917025,0.0024581582,0.0068313093],"study_design_scores_gemma":[0.00032445323,0.000075642776,0.004889426,0.00010854205,0.0000042255424,0.0000031139152,0.0000013215573,0.0007386188,0.03950146,0.9537314,0.00050823967,0.0001135575],"about_ca_topic_score_codex":0.000018541994,"about_ca_topic_score_gemma":8.5799917e-7,"teacher_disagreement_score":0.07258818,"about_ca_system_score_codex":0.00002809522,"about_ca_system_score_gemma":0.00008092432,"threshold_uncertainty_score":0.61668855},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8200148,0.00015793764,0.14765458,0.005097326,0.014978711,0.0018152625,0.000049363145,0.00092379824,0.009308234],"genre_scores_gemma":[0.9836187,0.0000047635713,0.015866283,0.00016365662,0.00004845478,0.00009560975,0.000010247652,0.000022374219,0.0001699141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979979,0.000059378996,0.00032842776,0.0007290131,0.00032591363,0.00055938755],"domain_scores_gemma":[0.99670285,0.00025518957,0.00027851146,0.0023108292,0.000260139,0.00019248074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056951324,0.00025392696,0.00032693637,0.000088429966,0.00096325664,0.00074942905,0.002732455,0.00014089604,0.0000122924575],"category_scores_gemma":[0.00028682346,0.0002599862,0.00017538,0.000115572984,0.00016777635,0.0008696988,0.00085517153,0.00017803145,0.00008589916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007702361,0.00016857573,0.0054899147,0.000026069323,0.000027539241,0.000012722678,0.00016625955,0.000012222101,0.0003718919,0.9488534,0.0028821963,0.041981522],"study_design_scores_gemma":[0.0013254582,0.00020182025,0.17686589,0.000016736243,0.000011324095,0.000015121757,0.000007232759,0.020464428,0.0013125889,0.79537135,0.004065998,0.0003420361],"about_ca_topic_score_codex":0.00013669497,"about_ca_topic_score_gemma":0.00004815329,"teacher_disagreement_score":0.17137598,"about_ca_system_score_codex":0.00015151454,"about_ca_system_score_gemma":0.0001110051,"threshold_uncertainty_score":0.9999852},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.982594,0.000021368993,0.00007536522,0.0013016701,0.0004712195,0.0006908918,0.0000147928595,0.00008594211,0.014744748],"genre_scores_gemma":[0.9974952,0.000014331802,0.00092606596,0.00002768978,0.000013464582,0.00021923425,0.0000025525087,0.000026649715,0.0012748255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908936,0.000039154547,0.00016556724,0.00022072646,0.00018429573,0.00030092444],"domain_scores_gemma":[0.9980613,0.00053861336,0.00022437515,0.0010161272,0.000079355545,0.00008024198],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00045397962,0.00014560463,0.00016110652,0.000020312498,0.0018131941,0.00020133467,0.0007903061,0.00007616915,0.000018297858],"category_scores_gemma":[0.00021601502,0.0000992501,0.00009188743,0.00007944511,0.0002836013,0.00014694936,0.000055899825,0.00018520767,0.000043595253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048238606,0.0000760528,0.004741939,0.000012462785,0.000048038055,0.0000022233876,0.00015250633,8.578287e-8,0.00007188953,0.99167734,0.0027719687,0.00039724418],"study_design_scores_gemma":[0.0008305451,0.00006711281,0.0041257595,0.000021674734,0.000041095274,0.0000121739895,0.00007551107,0.000014526432,0.0013587008,0.98756564,0.005735764,0.00015148072],"about_ca_topic_score_codex":0.000019169529,"about_ca_topic_score_gemma":0.000070976406,"teacher_disagreement_score":0.014901185,"about_ca_system_score_codex":0.000018737306,"about_ca_system_score_gemma":0.000035552654,"threshold_uncertainty_score":0.9994863},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99096215,0.000013113436,0.00006116536,0.0000842371,0.00020176683,0.00017070853,0.0000070646893,0.000020151556,0.0084796455],"genre_scores_gemma":[0.9985571,0.000008208992,0.0012790088,0.0000037750794,0.0000027362469,0.000017503813,0.0000015050955,0.000010133944,0.00012002029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935645,0.00003537083,0.00025972544,0.00011094177,0.00013078788,0.000106712745],"domain_scores_gemma":[0.99860674,0.00018864,0.00043536036,0.0006557787,0.00008056144,0.000032895634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026571236,0.000078222016,0.00019937055,0.000079914935,0.00013314691,0.000012800879,0.00035658004,0.000058876747,0.00001884585],"category_scores_gemma":[0.00028098666,0.00007591747,0.0001069269,0.000095636475,0.0001559694,0.000098502685,0.00004336336,0.00007071163,0.0000039391543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010105676,0.00019585685,0.0025009334,0.00004466807,0.000012594888,5.846402e-7,0.00015158903,3.318755e-8,0.0045301244,0.9912935,0.000107798005,0.0011522422],"study_design_scores_gemma":[0.0004999495,0.000055700504,0.011397533,0.000024109015,0.00003512355,0.0000014456859,0.000028682362,0.000037638878,0.043427415,0.94434285,0.00008303878,0.00006651245],"about_ca_topic_score_codex":0.000011088473,"about_ca_topic_score_gemma":0.0000043839104,"teacher_disagreement_score":0.046950616,"about_ca_system_score_codex":0.000008572577,"about_ca_system_score_gemma":0.0000147511155,"threshold_uncertainty_score":0.30958247},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99453336,0.00024903967,0.000045192774,0.00035069595,0.0020242052,0.000121064564,9.140811e-7,0.000056656434,0.0026188593],"genre_scores_gemma":[0.99726135,0.000013874735,0.0026414515,0.000014026435,8.350938e-7,0.000005272126,3.7805773e-7,0.000006643215,0.000056166973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895114,0.000032876495,0.00027720173,0.00028439876,0.0002591323,0.00019525699],"domain_scores_gemma":[0.9978762,0.000035792556,0.00034398062,0.0014701883,0.00020703489,0.000066747154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004226072,0.00010321673,0.0002320245,0.00010734253,0.00019440934,0.0000538098,0.0011619523,0.00003899678,0.0000022390855],"category_scores_gemma":[0.00013690552,0.00009599048,0.00008342464,0.00017540454,0.00014935787,0.00031340355,0.0002873744,0.000088363275,0.000005410866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002830457,0.000086157044,0.0138805,0.000030708226,0.000017743454,0.0000030226572,0.00023692625,0.0000062026265,0.008712933,0.9747878,0.00027336914,0.001961828],"study_design_scores_gemma":[0.000520578,0.00011933044,0.019794727,0.00006238992,0.000008792095,0.0000026867592,0.000007512503,0.00034785186,0.09750289,0.88142437,0.00009357231,0.0001153192],"about_ca_topic_score_codex":0.00016664245,"about_ca_topic_score_gemma":0.0000033654521,"teacher_disagreement_score":0.09336343,"about_ca_system_score_codex":0.0000067432115,"about_ca_system_score_gemma":0.00005234855,"threshold_uncertainty_score":0.39143783},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74365586,0.00013440766,0.23593055,0.002852853,0.010888476,0.0012814339,0.00002200433,0.00062282116,0.004611601],"genre_scores_gemma":[0.990024,0.000004340021,0.009550684,0.00011733993,0.000049874707,0.00008355139,0.000010085599,0.000019962006,0.00014020017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812883,0.000054883672,0.00030842525,0.0006788825,0.00031372107,0.0005152453],"domain_scores_gemma":[0.9969467,0.00027826166,0.00026891349,0.0020791355,0.00025706418,0.00016990925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005606864,0.00023191476,0.00030300123,0.000079461475,0.0008354464,0.0007115566,0.0025235387,0.00012765764,0.000012664333],"category_scores_gemma":[0.00028748967,0.00023704767,0.00016344427,0.00010827009,0.00014346096,0.00091794465,0.0008582232,0.00016531123,0.00007544423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008332673,0.00018247336,0.0160404,0.000033218308,0.000029852537,0.000019044659,0.00013518185,0.000016715541,0.00017325264,0.9301314,0.0024096519,0.050820522],"study_design_scores_gemma":[0.0011760901,0.00016314746,0.25122908,0.000016500391,0.0000109990515,0.000016437827,0.000005117426,0.018808829,0.0013716641,0.72581124,0.0010902355,0.00030066806],"about_ca_topic_score_codex":0.00009404358,"about_ca_topic_score_gemma":0.00003739169,"teacher_disagreement_score":0.24636811,"about_ca_system_score_codex":0.00013489503,"about_ca_system_score_gemma":0.00009152416,"threshold_uncertainty_score":0.9666524},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9922085,0.00018185849,0.000037069738,0.00030553405,0.001425153,0.00019640119,0.000009727864,0.00013647956,0.0054992824],"genre_scores_gemma":[0.9984498,0.00009266164,0.00088840025,0.000079366706,0.000021843975,0.00001566125,0.0000038907824,0.000041386516,0.00040696462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987117,0.0000363624,0.0002692606,0.0003603935,0.00024797957,0.0003743176],"domain_scores_gemma":[0.9985022,0.00016055342,0.00024338711,0.000886167,0.00004770425,0.00015999087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032143755,0.00023916342,0.0003522828,0.0001112255,0.0006809766,0.000269751,0.0004992585,0.00011441289,0.000017487826],"category_scores_gemma":[0.00024675386,0.00022709671,0.00009400684,0.000049984348,0.0001843684,0.0003012596,0.00013922316,0.00021090082,0.000032514366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012732502,0.000085165724,0.03897702,0.00007714917,0.00006863836,0.000036300997,0.00041336517,5.3656052e-8,0.00015186385,0.95375896,0.0055822064,0.000836531],"study_design_scores_gemma":[0.0010750985,0.00006342618,0.036491405,0.000089142544,0.00004290558,0.000017074737,0.00006474167,0.000022165197,0.00063299586,0.9603431,0.0008793024,0.0002786074],"about_ca_topic_score_codex":0.00009534417,"about_ca_topic_score_gemma":0.00003764382,"teacher_disagreement_score":0.00658416,"about_ca_system_score_codex":0.000017514718,"about_ca_system_score_gemma":0.000016236156,"threshold_uncertainty_score":0.9260735},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9750923,0.000011528293,0.000033341803,0.00054565637,0.00043658042,0.00013490955,0.0000033383951,0.000028582795,0.023713743],"genre_scores_gemma":[0.99898314,0.000009260426,0.00016615514,0.000012304098,0.000007305489,0.0000256957,5.811302e-7,0.000013834057,0.00078173354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999411,0.00004272568,0.0001698709,0.00010528017,0.00013201746,0.00013909778],"domain_scores_gemma":[0.9983457,0.00040539537,0.0002569692,0.00089624774,0.00005944573,0.000036295136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039534154,0.00007930731,0.00012272107,0.000010696663,0.00082415773,0.00006565228,0.00055723183,0.000048945178,0.000026136406],"category_scores_gemma":[0.00020170315,0.00005769197,0.00006483005,0.000040191844,0.00015703113,0.00010850914,0.00011136653,0.00012514836,0.000032274187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069137136,0.00005805165,0.0036627522,0.000010673962,0.00002574967,6.0153025e-7,0.00027895413,3.669896e-7,0.0002610755,0.9939061,0.0012908395,0.0004979209],"study_design_scores_gemma":[0.00024827864,0.0000074001105,0.0072130486,0.000018467346,0.000015664511,0.0000022040263,0.00013906296,0.000011329652,0.001343596,0.9881147,0.0028184543,0.000067759545],"about_ca_topic_score_codex":0.000059639824,"about_ca_topic_score_gemma":0.000015607015,"teacher_disagreement_score":0.02389081,"about_ca_system_score_codex":0.000010729095,"about_ca_system_score_gemma":0.0000172921,"threshold_uncertainty_score":0.63388383},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9625888,0.000045415276,0.0038913426,0.0020964397,0.0031986893,0.00024753655,0.0000031674983,0.0002473025,0.027681315],"genre_scores_gemma":[0.9933109,0.000004104149,0.0058114333,0.00019192448,0.000013766507,0.00000916417,9.693412e-7,0.000010918871,0.0006467872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989288,0.000058787613,0.00011347852,0.00036449166,0.00023852626,0.00029592312],"domain_scores_gemma":[0.9982606,0.0001056122,0.00012901436,0.0013577482,0.000027021628,0.0001199869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021888578,0.00015779807,0.00017305928,0.000050190665,0.00046058503,0.00044106838,0.0016263545,0.000049328137,0.000020583042],"category_scores_gemma":[0.000045349745,0.00012609358,0.000057131267,0.000072944924,0.00011126345,0.0005841825,0.00018145869,0.00019293424,0.00018432469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002724151,0.00007997366,0.00042466065,0.000004518333,0.000020691985,0.00014413492,0.00011608085,0.0000103612865,0.000021575379,0.99371266,0.0012587241,0.004179372],"study_design_scores_gemma":[0.0010965595,0.00051401625,0.0060785366,0.000035831807,0.0000065051627,0.000027947886,0.000004933099,0.0021741083,0.003962296,0.9847593,0.0010847269,0.00025527293],"about_ca_topic_score_codex":0.000019234873,"about_ca_topic_score_gemma":9.52132e-7,"teacher_disagreement_score":0.030722141,"about_ca_system_score_codex":0.000027873213,"about_ca_system_score_gemma":0.00004116066,"threshold_uncertainty_score":0.51419467},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.987831,0.000008184241,0.000019808942,0.00044329034,0.00021047099,0.0003090584,0.000011222821,0.000037396727,0.011129552],"genre_scores_gemma":[0.9992883,0.0000038142675,0.00027500186,0.00004767592,0.0000043756854,0.00005232632,0.00000180244,0.000022146973,0.00030454953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991987,0.00007815934,0.00017873969,0.00017510809,0.00018264606,0.00018669349],"domain_scores_gemma":[0.9977002,0.0007489756,0.0002676268,0.0011815828,0.000045513592,0.000056060493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028636502,0.00014163816,0.0002095268,0.000051249925,0.00044813126,0.000056733206,0.00063282397,0.000057505564,0.00005689241],"category_scores_gemma":[0.00021863995,0.000089669345,0.00009264826,0.000116373805,0.00031669583,0.00007237778,0.00004654897,0.00016623933,0.000026411755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035354602,0.00019897336,0.002230551,0.000016525611,0.000052242307,0.0000023793993,0.00019970653,2.6542887e-7,0.0006585271,0.99501264,0.0014484841,0.00014436495],"study_design_scores_gemma":[0.0005703028,0.00013996095,0.0053360914,0.0000542455,0.000040175582,0.000002296788,0.0000626351,0.000007677916,0.010427178,0.98308134,0.00015846154,0.00011961566],"about_ca_topic_score_codex":0.000014569002,"about_ca_topic_score_gemma":0.000012818297,"teacher_disagreement_score":0.011931267,"about_ca_system_score_codex":0.000009635721,"about_ca_system_score_gemma":0.0000164892,"threshold_uncertainty_score":0.36566097},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9936636,0.00028201664,0.00016097836,0.0009033943,0.0019962783,0.00021601438,0.0000033548476,0.0000935432,0.0026807946],"genre_scores_gemma":[0.9981293,0.000014449173,0.0014379103,0.000111946356,0.0000021804938,0.000013229146,6.1257055e-7,0.000013026195,0.00027733226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842954,0.00005667671,0.00034108522,0.00047391196,0.0003806778,0.00031809547],"domain_scores_gemma":[0.99753594,0.00013855545,0.00050570734,0.0014972726,0.00021476738,0.00010777875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006466812,0.00018757733,0.00025518637,0.00004361271,0.0009248323,0.0003612864,0.0014583495,0.00007775942,0.0000018833406],"category_scores_gemma":[0.0007332367,0.00014695204,0.000074119096,0.00017047049,0.00027558248,0.0004186029,0.001193667,0.00022840437,0.0000051435204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006881899,0.000069057314,0.04542405,0.000033818058,0.000019497365,0.0000031293162,0.00041780583,0.000007646308,0.0030045786,0.94990623,0.00026784439,0.0008394836],"study_design_scores_gemma":[0.0020813702,0.00012739054,0.04544461,0.00035089816,0.000029013194,0.000011531393,0.00003620578,0.008078506,0.017331708,0.92482924,0.0012656715,0.00041383374],"about_ca_topic_score_codex":0.00025330303,"about_ca_topic_score_gemma":0.0000075033267,"teacher_disagreement_score":0.025076946,"about_ca_system_score_codex":0.000027905497,"about_ca_system_score_gemma":0.000049241993,"threshold_uncertainty_score":0.7113156},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9975473,0.00009815434,0.00013745739,0.00053221034,0.00088049506,0.00020354072,0.000010014143,0.000023455368,0.00056737155],"genre_scores_gemma":[0.99863577,0.000008435176,0.0012631422,0.000042278654,5.4747363e-7,0.000010838269,0.0000011093692,0.000006942129,0.000030955158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990376,0.0000576758,0.0003123023,0.00018446452,0.0002499902,0.00015796538],"domain_scores_gemma":[0.99768484,0.0005292423,0.00046481384,0.0010759967,0.00020775721,0.000037353686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056010176,0.00010791278,0.00026762226,0.00006666971,0.0002470883,0.000040599894,0.0011401151,0.00005304981,0.0000019659187],"category_scores_gemma":[0.00022252469,0.000075930446,0.00015053197,0.00010330862,0.00029985688,0.00013135272,0.00018853805,0.00007625809,9.5321326e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027296603,0.0001635068,0.0050952653,0.00003834035,0.000031987507,2.994307e-7,0.0003320013,0.000053152256,0.001973378,0.99083495,0.0009270502,0.0005227662],"study_design_scores_gemma":[0.0009979664,0.00036107498,0.0074083377,0.00009965189,0.000010344559,5.874705e-7,0.000031725765,0.005390205,0.028564854,0.9569918,0.00005550809,0.0000879801],"about_ca_topic_score_codex":0.00015692848,"about_ca_topic_score_gemma":0.000010688798,"teacher_disagreement_score":0.033843193,"about_ca_system_score_codex":0.000005028589,"about_ca_system_score_gemma":0.000042642812,"threshold_uncertainty_score":0.30963537},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99779886,0.0002217872,0.000063551066,0.0004086829,0.0007900524,0.00020034831,0.000010990612,0.00008054298,0.00042516447],"genre_scores_gemma":[0.9965215,0.000054274256,0.0032786527,0.00010849194,3.204386e-7,0.000010340971,0.0000023068683,0.000010443965,0.0000137145535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983448,0.00009025083,0.0004183887,0.00048039455,0.000303241,0.00036296758],"domain_scores_gemma":[0.9980068,0.00012683506,0.00031719144,0.0012672282,0.00013373035,0.0001481668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057062303,0.00019483684,0.00038203417,0.00023327292,0.00035934884,0.00016759067,0.0010758826,0.00007881998,0.0000029400703],"category_scores_gemma":[0.000096036645,0.00019085646,0.00008323973,0.00026671172,0.0003580996,0.0004388065,0.00056403066,0.00019796725,0.000008772389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009396357,0.00009877524,0.098985575,0.000023898068,0.000015805866,0.000010210582,0.00028405376,0.000010240974,0.00903602,0.89069396,0.00017430207,0.0006577801],"study_design_scores_gemma":[0.001433219,0.00009541789,0.24046682,0.00006327676,0.0000052138403,0.0000037993727,0.000009255972,0.0066139596,0.0006912013,0.7503009,0.00013215534,0.00018480097],"about_ca_topic_score_codex":0.0008429583,"about_ca_topic_score_gemma":0.00010339036,"teacher_disagreement_score":0.14148125,"about_ca_system_score_codex":0.000012027488,"about_ca_system_score_gemma":0.000027485956,"threshold_uncertainty_score":0.77829003},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95232415,0.00071105786,0.020441784,0.004492301,0.0070084324,0.00076528493,0.00002548267,0.00063274737,0.013598786],"genre_scores_gemma":[0.9970702,0.000034549306,0.001811779,0.00007809257,0.000012328574,0.000024731413,0.0000048201605,0.000018876075,0.0009446424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983042,0.0000779943,0.0001678867,0.00054760015,0.00041190223,0.0004904399],"domain_scores_gemma":[0.99713594,0.00015147596,0.0001429363,0.0022898647,0.0001410464,0.00013874388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056275085,0.00016358867,0.00018112767,0.00007053298,0.0007173877,0.00053197553,0.0029574663,0.000058920417,0.000007725715],"category_scores_gemma":[0.0006635426,0.00016531642,0.000047557663,0.00021434076,0.00018325925,0.0013989976,0.0010030495,0.00026642927,0.00014666028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009894362,0.00006676244,0.0026935865,0.00001465982,0.000014207987,0.000027538517,0.00014129071,0.0000068812624,0.002789164,0.9859147,0.004568529,0.0037527508],"study_design_scores_gemma":[0.00073969696,0.00010863697,0.0033254928,0.00002037352,0.000002651028,0.0000064324586,0.000007821006,0.0014564161,0.019245736,0.96020526,0.014589457,0.00029205275],"about_ca_topic_score_codex":0.000018907265,"about_ca_topic_score_gemma":0.0000016553736,"teacher_disagreement_score":0.044746056,"about_ca_system_score_codex":0.000048928556,"about_ca_system_score_gemma":0.00005282473,"threshold_uncertainty_score":0.6741408},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9278551,0.00031138962,0.03583003,0.0025265745,0.0065555773,0.00063750404,0.000005452993,0.0005388277,0.02573959],"genre_scores_gemma":[0.9926049,0.000012129027,0.0070345425,0.000048072532,0.000015941412,0.000043083808,0.0000016016,0.000022061115,0.00021764409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778545,0.00018065887,0.00025498233,0.00061315217,0.0005837087,0.0005820333],"domain_scores_gemma":[0.99694765,0.0004677894,0.00012829198,0.0019474801,0.00026736068,0.00024141982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009180273,0.00019783214,0.00022857386,0.00019794643,0.0011848052,0.00081316015,0.0029169999,0.00008400813,0.000017369894],"category_scores_gemma":[0.0012320506,0.00020474508,0.00011332244,0.00023252386,0.0004171888,0.0020568392,0.00097007136,0.00034433685,0.00012290708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011107059,0.00010298886,0.0032689723,0.00001120963,0.000009639506,0.000040483796,0.00016998977,0.000002570437,0.00096452894,0.9794879,0.0003178852,0.01561274],"study_design_scores_gemma":[0.0009062288,0.000085319494,0.027350722,0.00003891478,0.0000057959833,0.0000127762905,0.000011538927,0.0032307336,0.0040545654,0.9636814,0.00038299744,0.00023899898],"about_ca_topic_score_codex":0.000030454485,"about_ca_topic_score_gemma":0.00001011906,"teacher_disagreement_score":0.06474987,"about_ca_system_score_codex":0.0000883377,"about_ca_system_score_gemma":0.000073675656,"threshold_uncertainty_score":0.91126835},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99564016,0.00110904,0.000026536885,0.00057892594,0.0017491733,0.00011218498,0.0000017759335,0.000120178964,0.000662041],"genre_scores_gemma":[0.99738425,0.00011597444,0.002324917,0.000061525534,8.2339585e-7,0.0000047974577,0.0000012193568,0.000011610582,0.00009487197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987702,0.000053715878,0.00030236976,0.00037202777,0.00024097129,0.0002607294],"domain_scores_gemma":[0.99830574,0.00006961933,0.00029413294,0.0010790479,0.00012731095,0.00012418025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044867472,0.0001444835,0.00024002921,0.00010899292,0.00045095666,0.00015475352,0.00082347624,0.000101349804,0.0000028569827],"category_scores_gemma":[0.00013521206,0.00013519067,0.00006533294,0.00015371575,0.00016022073,0.00061300624,0.00044982755,0.00016919897,0.000015258884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027113315,0.00006767603,0.0053652604,0.000016866057,0.000023012983,0.000009090949,0.00030316444,0.000005966592,0.004470371,0.9875222,0.00028134306,0.0019323339],"study_design_scores_gemma":[0.0009549611,0.00009335134,0.007862349,0.000077703626,0.000011351868,0.0000069072235,0.000008919635,0.003398248,0.0021015024,0.9852433,0.00007601184,0.00016535542],"about_ca_topic_score_codex":0.000102290716,"about_ca_topic_score_gemma":0.000001357081,"teacher_disagreement_score":0.0033922815,"about_ca_system_score_codex":0.000008418041,"about_ca_system_score_gemma":0.0000366549,"threshold_uncertainty_score":0.5512916},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98408794,0.0006771801,0.00047593596,0.00087533484,0.005084609,0.00018634282,0.0000014675221,0.00016436954,0.0084468005],"genre_scores_gemma":[0.9942026,0.00006387076,0.005466909,0.00008868925,8.142481e-7,0.000006792385,8.530956e-7,0.000010233964,0.0001592517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860317,0.00004894572,0.00029677435,0.00036321513,0.00039993605,0.00028795924],"domain_scores_gemma":[0.9977539,0.0000802396,0.0003297617,0.0014657702,0.00025294302,0.00011738638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044792044,0.00014421692,0.0002283244,0.00025153087,0.00044780294,0.00020092838,0.0015010057,0.000072744966,0.000009689975],"category_scores_gemma":[0.0002181502,0.00013161388,0.00009904556,0.00049912103,0.00012249332,0.00042698972,0.000495125,0.00014867011,0.000044852917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023012722,0.0001114283,0.010723214,0.00001846365,0.000020278383,0.0000068092672,0.00008402847,0.0000052276987,0.00074837153,0.9837949,0.0009645323,0.0035204242],"study_design_scores_gemma":[0.00088340254,0.00010470382,0.015111846,0.000052062962,0.0000117674645,0.0000053291296,0.000010783114,0.0023584482,0.0036868576,0.97719896,0.0003970342,0.0001788327],"about_ca_topic_score_codex":0.00012319023,"about_ca_topic_score_gemma":0.0000025607103,"teacher_disagreement_score":0.010114626,"about_ca_system_score_codex":0.000017357088,"about_ca_system_score_gemma":0.000057908623,"threshold_uncertainty_score":0.53670585},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98697144,0.000068147776,0.00001644086,0.00030232326,0.0010422993,0.000105555395,0.0000033422982,0.000042249656,0.011448178],"genre_scores_gemma":[0.99838144,0.000017020173,0.00089219766,0.000024399498,0.000007970846,0.000005370366,0.0000010107995,0.000015710553,0.0006548856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991118,0.000041325115,0.00024762555,0.00017805715,0.00019640857,0.00022481939],"domain_scores_gemma":[0.99837095,0.00017936683,0.00030627273,0.0009834367,0.00008873117,0.00007126933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032288852,0.00011909225,0.00033374116,0.00010893918,0.00021267254,0.000021800037,0.00056414073,0.00011529197,0.00009794429],"category_scores_gemma":[0.0010611535,0.00010886777,0.00011000582,0.000121975514,0.00024897186,0.00009463165,0.00017170087,0.00012297406,0.000025636115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005538451,0.00013436377,0.010802458,0.000030888812,0.000036964393,0.000007353305,0.000092575174,2.893686e-8,0.00031267686,0.98456556,0.0032300467,0.00078154384],"study_design_scores_gemma":[0.0006471047,0.00007224339,0.036936857,0.000014304508,0.000028995242,0.0000067723504,0.00003299543,0.000004160761,0.005562577,0.9559546,0.00063194754,0.00010743086],"about_ca_topic_score_codex":0.000107416105,"about_ca_topic_score_gemma":0.0000048466486,"teacher_disagreement_score":0.028610948,"about_ca_system_score_codex":0.000012476609,"about_ca_system_score_gemma":0.00001994576,"threshold_uncertainty_score":0.44394985},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.971579,0.000075911026,0.02354736,0.00066448003,0.000058899564,0.000652875,0.000027100714,0.00006819481,0.0033261406],"genre_scores_gemma":[0.9794059,0.000015391428,0.020148784,0.000034618628,0.000009906217,0.00013756768,0.000012776965,0.0000179566,0.00021713872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992749,0.000018579669,0.0002511769,0.00015958917,0.0001831637,0.00011259477],"domain_scores_gemma":[0.9988932,0.00019297354,0.00030450607,0.0004211741,0.00012818207,0.00005998026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016077321,0.000099762634,0.00018817476,0.000027027952,0.00027947806,0.000066583605,0.00018882996,0.000045025216,0.000027706668],"category_scores_gemma":[0.00007203811,0.000085838336,0.000026631958,0.000045218185,0.00015997655,0.00013451588,0.00006238508,0.000059935257,0.0000061035375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041211565,0.00011262313,0.0006220125,0.00013847851,0.00002613143,2.4994029e-7,0.00016882199,0.000013099056,0.00005447465,0.99820006,0.0004854913,0.00017440868],"study_design_scores_gemma":[0.00051453576,0.00002874458,0.0008429049,0.000039757913,0.00003527121,0.0000031007442,0.00007274925,0.0023496212,0.00031031988,0.9953927,0.00030656354,0.00010372944],"about_ca_topic_score_codex":0.000032716518,"about_ca_topic_score_gemma":0.0000047241874,"teacher_disagreement_score":0.007826823,"about_ca_system_score_codex":0.000015588672,"about_ca_system_score_gemma":0.00003121884,"threshold_uncertainty_score":0.35003856},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9908456,0.00013282515,0.0021260295,0.0007768167,0.0013792337,0.00016369902,0.000001419629,0.00006306801,0.004511307],"genre_scores_gemma":[0.9987037,0.000015653075,0.0012186279,0.00002085079,0.0000024933465,0.00001375231,4.1173564e-7,0.000006980537,0.000017526161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987423,0.00012816547,0.00022607452,0.0002901511,0.00030113917,0.00031219906],"domain_scores_gemma":[0.99800074,0.0005911708,0.000108502914,0.0010198653,0.00019019893,0.00008953297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051173376,0.00009898904,0.00019654744,0.00017134873,0.00020463324,0.00012448471,0.0013602953,0.00007090294,0.000010194875],"category_scores_gemma":[0.0018526515,0.000099282835,0.000052828862,0.00022727411,0.00028632794,0.0011473293,0.00026480822,0.00022274992,0.000015562007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030539602,0.00012106002,0.013338414,0.000013705609,0.0000074957384,0.00002636744,0.000093698785,0.0000014665904,0.0033690433,0.97674805,0.000025904013,0.0062242467],"study_design_scores_gemma":[0.0007397236,0.00009669334,0.14836907,0.000031317843,0.0000024372123,0.000003633412,0.000015264368,0.0013754738,0.011296452,0.83793306,0.000041291703,0.00009555116],"about_ca_topic_score_codex":0.00007992791,"about_ca_topic_score_gemma":0.000036795485,"teacher_disagreement_score":0.13881497,"about_ca_system_score_codex":0.000029980074,"about_ca_system_score_gemma":0.000047774112,"threshold_uncertainty_score":0.40486366},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43134388,0.0007371318,0.0380573,0.016005399,0.04402837,0.0016142299,0.000099602905,0.0027006965,0.46541336],"genre_scores_gemma":[0.98953766,0.000024217321,0.0067965356,0.00022627643,0.000030678377,0.000012024332,0.00002910497,0.000017444296,0.0033260398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870193,0.000030419953,0.00017512526,0.00039879864,0.00031014788,0.00038356232],"domain_scores_gemma":[0.997915,0.0000427051,0.00019008547,0.0017045632,0.000059569615,0.000088051325],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00043809076,0.00015094249,0.00016649207,0.00006834237,0.00075374835,0.0012468323,0.002986683,0.000052600793,0.000013997379],"category_scores_gemma":[0.000082863546,0.0001517256,0.000047509864,0.00012419652,0.00006564611,0.001830886,0.00071866723,0.00014494061,0.00033953373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026036043,0.000052509702,0.0027844934,0.000007838286,0.000024249694,0.00006520788,0.00004895086,0.0000019184022,0.00003910841,0.9541352,0.038402285,0.004435664],"study_design_scores_gemma":[0.0023014492,0.00013330836,0.023482107,0.00008216739,0.000024474435,0.000012356188,0.000028691766,0.03333253,0.0008756403,0.7330793,0.20590964,0.00073833304],"about_ca_topic_score_codex":0.00015759158,"about_ca_topic_score_gemma":0.000010280874,"teacher_disagreement_score":0.5581938,"about_ca_system_score_codex":0.000030791944,"about_ca_system_score_gemma":0.0000395925,"threshold_uncertainty_score":0.99978995},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9538251,0.00029630834,0.0000033940892,0.0000029266903,0.0013502528,0.00007393604,0.0000040095083,0.000024753708,0.044419285],"genre_scores_gemma":[0.9997145,0.00002120197,0.000050554212,7.3880017e-7,0.0000027709648,0.0000034847776,6.539672e-7,0.000012834888,0.00019325974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939126,0.000014569691,0.00025252652,0.00007737248,0.00011697223,0.0001472794],"domain_scores_gemma":[0.99914455,0.000041596853,0.00015569183,0.00052715983,0.00009931473,0.00003170298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026272205,0.00008021656,0.00026227222,0.000043203705,0.000044651926,0.0000068679624,0.00037965132,0.00005982233,0.0000203282],"category_scores_gemma":[0.000073023504,0.000081779115,0.000055491244,0.0000820946,0.00010535167,0.000120715165,0.00006407951,0.000060382732,0.000007599256],"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.000020508996,0.000040200277,0.00903434,0.00042357255,0.0000524159,0.0000013795607,0.00026625508,0.000068163,0.05133642,0.9384511,0.00015422134,0.0001514216],"study_design_scores_gemma":[0.0011003825,0.0003275848,0.020753942,0.00042486316,0.00004813425,0.0000032267405,0.00022366043,0.0004955353,0.508497,0.46657646,0.001291539,0.00025767458],"about_ca_topic_score_codex":0.000044725923,"about_ca_topic_score_gemma":0.0000013354488,"teacher_disagreement_score":0.47187465,"about_ca_system_score_codex":0.000009628891,"about_ca_system_score_gemma":0.000012574988,"threshold_uncertainty_score":0.33348554},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9802584,0.00016232373,0.0034492768,0.0010922103,0.0018047441,0.00031248873,0.0000031740303,0.00012795464,0.012789417],"genre_scores_gemma":[0.9980778,0.00003993971,0.001569773,0.000032099488,0.000004787519,0.000011070097,7.6143857e-7,0.000010656361,0.00025308417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887025,0.000084112005,0.00015822216,0.00033415662,0.00027403934,0.0002792064],"domain_scores_gemma":[0.9984448,0.00014429931,0.00017246591,0.0010148332,0.00010764075,0.0001159801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045683357,0.00011908219,0.00018598123,0.000098022465,0.0004087936,0.00015529596,0.0009791536,0.00006894488,0.000014556658],"category_scores_gemma":[0.00029073146,0.00012157574,0.000050203824,0.00014253057,0.0003751408,0.0007550958,0.00042289638,0.00016462864,0.000012193983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016361724,0.00004211082,0.004697037,0.000016348004,0.000027944196,0.000011226978,0.00043759818,0.000006731104,0.001023692,0.98719376,0.0006561535,0.005871039],"study_design_scores_gemma":[0.0011903612,0.00014926362,0.012846559,0.000023390076,0.0000051686866,0.0000133407375,0.00012223354,0.0014301908,0.00645527,0.9769496,0.000638557,0.00017606665],"about_ca_topic_score_codex":0.00010892218,"about_ca_topic_score_gemma":0.000010711955,"teacher_disagreement_score":0.017819418,"about_ca_system_score_codex":0.000022558974,"about_ca_system_score_gemma":0.000043040185,"threshold_uncertainty_score":0.49577147},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9599588,0.00066869456,0.028423836,0.00033008397,0.0072993464,0.00022600591,5.788773e-7,0.00010654679,0.0029861385],"genre_scores_gemma":[0.9992496,0.00006687111,0.00050814956,0.00005266635,0.000027956115,0.000007691392,7.073206e-7,0.000012207706,0.000074152355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987757,0.00008252059,0.00030484586,0.0003631104,0.0002027485,0.00027104176],"domain_scores_gemma":[0.99837154,0.00010267203,0.00032672498,0.0009711368,0.00011382167,0.00011412165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005259974,0.00016041995,0.00029961357,0.000073922456,0.00047526578,0.00030702277,0.00086268823,0.00011271319,0.000004738951],"category_scores_gemma":[0.000059324357,0.00014824879,0.000084738764,0.00010913245,0.00009497771,0.0005286554,0.00034385532,0.00017851366,0.0000045734037],"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.0000063846296,0.000043864868,0.011294,0.00003222226,0.000053021668,0.000014289581,0.0009314727,0.0004900162,0.00015285997,0.9786655,0.0016297413,0.0066866633],"study_design_scores_gemma":[0.0012706933,0.00025872036,0.02270969,0.00029048912,0.000017332528,0.00004989536,0.00011669532,0.7754708,0.00032153243,0.19717488,0.0018632092,0.00045607766],"about_ca_topic_score_codex":0.00024227204,"about_ca_topic_score_gemma":0.000018025856,"teacher_disagreement_score":0.78149056,"about_ca_system_score_codex":0.000029993776,"about_ca_system_score_gemma":0.00002472196,"threshold_uncertainty_score":0.604541},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95320654,0.000017280978,0.00014661241,0.0004985824,0.0007178288,0.00026374077,0.0000074197337,0.0000293854,0.04511262],"genre_scores_gemma":[0.99736404,0.0000059530885,0.00008437775,0.000020229532,0.000006944189,0.000024112253,0.0000011247927,0.000019057374,0.0024741278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887276,0.00015975375,0.0002585101,0.00014591619,0.00036377247,0.0001992943],"domain_scores_gemma":[0.997934,0.00035419397,0.00028260093,0.0012244117,0.00015389724,0.000050917937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067532004,0.000099925455,0.00018302641,0.000040806233,0.0004578641,0.0001129135,0.0008849275,0.000055605702,0.0002849931],"category_scores_gemma":[0.0017728794,0.00007389571,0.00014158341,0.000076012766,0.00059427816,0.00019032825,0.00029776365,0.00017558267,0.00005765865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009837402,0.00007927437,0.0047464333,0.000049784896,0.000049851133,0.0000021392007,0.0008421574,4.055242e-7,0.00011940475,0.99219286,0.0018124054,0.000095427364],"study_design_scores_gemma":[0.00035955972,0.00002508719,0.0021921003,0.00009275656,0.00005700615,0.0000040685145,0.00029161284,0.0002784377,0.0031866739,0.9933894,0.000046655892,0.00007662549],"about_ca_topic_score_codex":0.000027092088,"about_ca_topic_score_gemma":0.000016513135,"teacher_disagreement_score":0.044157546,"about_ca_system_score_codex":0.000051066116,"about_ca_system_score_gemma":0.00005768129,"threshold_uncertainty_score":0.35215667},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92080104,0.0002604919,0.032769725,0.0006752521,0.020315325,0.0002392265,0.0000010160752,0.00016778507,0.024770152],"genre_scores_gemma":[0.9989988,0.000008372467,0.0005383283,0.000038137958,0.00006851718,0.0000059713147,5.643848e-7,0.000008367436,0.00033290026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892426,0.00007699195,0.00030181347,0.00025956577,0.00019829588,0.00023906319],"domain_scores_gemma":[0.99818295,0.00009757684,0.00035135774,0.0011655085,0.00014375216,0.000058843634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448997,0.00010510671,0.00021634085,0.000040526935,0.00040688703,0.00027238016,0.0013254116,0.000082037826,0.000005534506],"category_scores_gemma":[0.00008793263,0.000099006094,0.000070335445,0.0000808031,0.000058562153,0.00044041596,0.00037638366,0.00012509174,0.000012425583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041285857,0.00002642187,0.006076865,0.000009879386,0.000016871698,0.000008996068,0.00014446775,0.00020081532,0.0000552683,0.9877556,0.0019442934,0.0037563874],"study_design_scores_gemma":[0.002765356,0.0004216315,0.07142583,0.00049954874,0.000024719364,0.00006655472,0.0001421149,0.32951334,0.005582841,0.5798755,0.00876874,0.00091379613],"about_ca_topic_score_codex":0.00012843215,"about_ca_topic_score_gemma":0.000010296445,"teacher_disagreement_score":0.40788007,"about_ca_system_score_codex":0.00002132308,"about_ca_system_score_gemma":0.000030509573,"threshold_uncertainty_score":0.40373513},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9810586,0.00018060674,0.0014039715,0.001720919,0.0018775086,0.00032708116,0.0000026721214,0.00030146036,0.013127205],"genre_scores_gemma":[0.9968235,0.000020589358,0.0028525586,0.000070361966,0.0000067498045,0.00003507023,0.0000015020512,0.000019547484,0.00017014853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978195,0.00017365286,0.00027657358,0.0006075009,0.00046426014,0.00065850007],"domain_scores_gemma":[0.9960136,0.00026358917,0.00017520707,0.0032557354,0.00012406161,0.00016779997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073069835,0.00021246294,0.00029678422,0.0003427451,0.0005665149,0.00044014625,0.005048502,0.00010989953,0.000011348568],"category_scores_gemma":[0.001004722,0.00021674804,0.0000986835,0.0005014421,0.00024715788,0.0013510153,0.0015208618,0.0004413428,0.00005026408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020067573,0.000080616286,0.018552303,0.0000049095142,0.000014641863,0.00015472909,0.00027375494,0.000020439997,0.00096181396,0.9764264,0.00057015417,0.0029201473],"study_design_scores_gemma":[0.0018139777,0.00008643034,0.07655388,0.000038680246,0.0000020295167,0.000009323576,0.000025008909,0.0023630036,0.0020012762,0.91650045,0.0003663808,0.00023955246],"about_ca_topic_score_codex":0.00008767399,"about_ca_topic_score_gemma":0.0001134471,"teacher_disagreement_score":0.059925966,"about_ca_system_score_codex":0.00006735977,"about_ca_system_score_gemma":0.000071589006,"threshold_uncertainty_score":0.9381456},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8603573,0.00005899411,0.11672676,0.002313504,0.0012020317,0.00047926002,0.0000022725724,0.00032312938,0.018536761],"genre_scores_gemma":[0.9697992,0.0000017757775,0.027109953,0.000073821786,0.000039811366,0.0000103326065,0.0000014176259,0.00002160865,0.0029420545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982215,0.00005050183,0.0003418491,0.0004382007,0.0007012071,0.0002467527],"domain_scores_gemma":[0.99718857,0.0004860845,0.00042535746,0.0014168759,0.00031367326,0.0001694157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010265239,0.00014752235,0.00022219837,0.00011376345,0.0010696603,0.00062454294,0.0010191464,0.000085142645,0.00014608816],"category_scores_gemma":[0.0014857173,0.00011407234,0.00007472565,0.00029024508,0.00007265498,0.0004050991,0.00015906672,0.00017868119,0.0002002315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005616892,0.00013882933,0.07060714,0.000003203816,0.000039580627,0.000021173046,0.0007742289,0.0008041675,0.0012958385,0.8120726,0.019215988,0.09497113],"study_design_scores_gemma":[0.000999093,0.00012704058,0.012704026,0.00004493209,0.000024945224,0.000015909882,0.00029100533,0.008941486,0.014926476,0.9330159,0.028560583,0.0003486476],"about_ca_topic_score_codex":0.00025928853,"about_ca_topic_score_gemma":0.000019103765,"teacher_disagreement_score":0.12094331,"about_ca_system_score_codex":0.00003676886,"about_ca_system_score_gemma":0.00012342562,"threshold_uncertainty_score":0.82270706},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9815715,0.000014865394,0.000017542783,0.00023125853,0.00016894618,0.00023793224,0.0000100417965,0.000050777573,0.017697126],"genre_scores_gemma":[0.9990578,0.000004648406,0.0005190111,0.0000155255,0.0000046794803,0.0000333554,0.0000016985827,0.000023075789,0.00034016703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991748,0.000024783249,0.00020569748,0.0001981285,0.00020363297,0.00019297675],"domain_scores_gemma":[0.99830914,0.00022268659,0.00029205056,0.0010196741,0.00007908599,0.00007738907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022165693,0.00014595863,0.00024139755,0.000040544157,0.00033723883,0.000047063862,0.00053302664,0.000082148115,0.00005140952],"category_scores_gemma":[0.000118875796,0.00012325194,0.00007726887,0.0000962503,0.00026429666,0.00014876676,0.00006963879,0.0001576739,0.000008609186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003900328,0.0002068733,0.03130632,0.000035107125,0.000049596816,0.00000604731,0.00016977279,4.857327e-7,0.0004767152,0.9670194,0.0005653371,0.0001253694],"study_design_scores_gemma":[0.00086049654,0.00008558948,0.021250527,0.000055230466,0.000041532076,0.0000054128404,0.00008786165,0.000016278173,0.002555193,0.9746638,0.00023184148,0.0001462373],"about_ca_topic_score_codex":0.000022342841,"about_ca_topic_score_gemma":0.000033976903,"teacher_disagreement_score":0.017486328,"about_ca_system_score_codex":0.000009268562,"about_ca_system_score_gemma":0.00003384547,"threshold_uncertainty_score":0.5026068},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75640315,0.0042080753,0.024267707,0.028229691,0.078083485,0.0026532952,0.000016534494,0.0041341293,0.10200391],"genre_scores_gemma":[0.9895907,0.000041724048,0.007762838,0.00072057307,0.000115174036,0.000031640353,0.0000022540664,0.000027719005,0.0017073447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975443,0.00011755991,0.0003507598,0.000830849,0.0005405136,0.000616058],"domain_scores_gemma":[0.9957549,0.0001870332,0.00027301948,0.0033656803,0.00015461436,0.00026476142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058343244,0.0003009927,0.00038133824,0.00008412336,0.0007715968,0.00092783803,0.0043100556,0.00015275025,0.000042254163],"category_scores_gemma":[0.0002518892,0.0002994055,0.00017930631,0.00014303642,0.00023177541,0.001924899,0.0018470172,0.0003259584,0.0005682308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004784784,0.0002199554,0.0047414512,0.000012422715,0.000028411921,0.000070417154,0.00025813095,0.000005717306,0.00006644153,0.95741636,0.0094162375,0.027759667],"study_design_scores_gemma":[0.0012373499,0.00014709072,0.0385208,0.000018582095,0.000009791999,0.000023110777,0.0000065318586,0.010198379,0.00094486255,0.9310269,0.017403634,0.00046300617],"about_ca_topic_score_codex":0.0001727683,"about_ca_topic_score_gemma":0.000014602914,"teacher_disagreement_score":0.23318756,"about_ca_system_score_codex":0.00014979822,"about_ca_system_score_gemma":0.00013603263,"threshold_uncertainty_score":0.9999458},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99438256,0.00001630477,0.001513801,0.0011054464,0.0014496796,0.00013133469,0.0000016898807,0.000012032901,0.0013871443],"genre_scores_gemma":[0.99923,0.0000019955594,0.0005256127,0.000121156794,0.0000044400103,0.0000050029257,2.7157208e-7,0.0000032954063,0.0001081907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921846,0.00007032056,0.00017875861,0.00014268601,0.00028964604,0.000100133744],"domain_scores_gemma":[0.9986034,0.00017643314,0.00029578788,0.0007926223,0.00010826428,0.000023499997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003631209,0.00007088707,0.00010518013,0.00003103421,0.0006011919,0.00017356951,0.0008686088,0.000027362013,0.000007326175],"category_scores_gemma":[0.0003067232,0.00003799905,0.000085068554,0.0001988411,0.0001739416,0.0001617609,0.00023223643,0.00008308511,0.0000031571212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007852281,0.000059189922,0.00042537847,0.0000068085305,0.000011396856,8.962079e-7,0.0005286782,0.00023006521,0.00094784016,0.9951376,0.0005388191,0.0021055127],"study_design_scores_gemma":[0.00040123676,0.0000928569,0.04499082,0.00007892014,0.000005745772,0.000003779549,0.000021054577,0.010766322,0.016808974,0.92659414,0.00016144878,0.00007468336],"about_ca_topic_score_codex":0.000047752223,"about_ca_topic_score_gemma":0.000006315192,"teacher_disagreement_score":0.068543404,"about_ca_system_score_codex":0.000013329345,"about_ca_system_score_gemma":0.00012270265,"threshold_uncertainty_score":0.46239427},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99786943,0.00023965705,0.000014086866,0.0001261445,0.00021504366,0.000045162575,0.000005239999,0.0000032930495,0.0014819158],"genre_scores_gemma":[0.9993445,0.00008286764,0.00038234805,0.000021297548,0.0000122258825,0.0000046609393,0.000022973034,0.000006090729,0.0001229857],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996612,0.000013360724,0.000097848635,0.00011321476,0.000040844658,0.000073518815],"domain_scores_gemma":[0.9995594,0.0000049364494,0.00008850926,0.00027174916,0.000045089382,0.000030292957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006276441,0.000059566988,0.000075068936,0.000013224891,0.00017146149,0.00003230121,0.00012495721,0.000055538505,0.0000074638356],"category_scores_gemma":[0.000027703905,0.000059892383,0.000026715332,0.000007981795,0.00008210211,0.000005702576,0.00011494299,0.000023852092,0.0000022242582],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005022273,0.00011255385,0.16545397,0.00006267397,0.000086048676,0.0000020408052,0.00032188618,0.0000047369003,0.61777776,0.21296427,0.0006370006,0.0025268497],"study_design_scores_gemma":[0.0010992604,0.0003107315,0.2557223,0.000024942328,0.000028698125,0.000013089086,0.00014667441,0.000029868375,0.60574436,0.13354875,0.0031157262,0.00021558639],"about_ca_topic_score_codex":0.00008162092,"about_ca_topic_score_gemma":0.000015261234,"teacher_disagreement_score":0.090268336,"about_ca_system_score_codex":0.0000043778837,"about_ca_system_score_gemma":0.00001813769,"threshold_uncertainty_score":0.24423406},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9779257,0.00097593095,2.9960316e-7,0.00032875588,0.0005064665,0.000074857315,0.0000047498834,0.000010265553,0.020172967],"genre_scores_gemma":[0.9981753,0.00013496514,0.000007419622,0.000048100217,0.000027452807,0.000029567005,0.0000015830045,0.000009589052,0.001566021],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99913985,0.000046794834,0.00020899996,0.00017567376,0.00025160148,0.00017707613],"domain_scores_gemma":[0.9984432,0.00026426892,0.0002797133,0.00095890893,0.000029325232,0.000024584606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035330045,0.00012527227,0.00014985495,0.000007674518,0.0008655203,0.0000641993,0.0010063512,0.000071817005,0.00003412076],"category_scores_gemma":[0.00035848882,0.00006397896,0.000053289255,0.000043868633,0.00054257683,0.00009823233,0.00016513444,0.00023343867,9.543173e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009916557,0.0014257535,0.23024236,0.00075766817,0.0004679446,0.00006148478,0.030040737,0.000021746615,0.5087632,0.19918923,0.0065247626,0.021513453],"study_design_scores_gemma":[0.012382449,0.000043603595,0.021055458,0.00046277628,0.00010809385,0.000014530936,0.0048738,0.00008348574,0.70729625,0.18931282,0.06378219,0.00058451225],"about_ca_topic_score_codex":0.000023526263,"about_ca_topic_score_gemma":0.000011360901,"teacher_disagreement_score":0.2091869,"about_ca_system_score_codex":0.000029986262,"about_ca_system_score_gemma":0.000028350447,"threshold_uncertainty_score":0.665697},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9810237,0.000056643577,0.000201906,0.00017300535,0.0008777831,0.00014395856,0.0000145765125,0.00007492178,0.01743347],"genre_scores_gemma":[0.9928755,0.000033162232,0.00077736867,0.000026876723,0.000033048127,0.000015154962,0.0000027073265,0.000033928387,0.0062022163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984308,0.00010340564,0.00024479302,0.0003219406,0.00051600207,0.00038309797],"domain_scores_gemma":[0.9973696,0.0006510307,0.0001838852,0.0015296589,0.00010962691,0.0001561852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040528242,0.00018855368,0.00032313183,0.000051517207,0.00045959157,0.00026473787,0.0012555927,0.0000998046,0.0004410426],"category_scores_gemma":[0.0011391976,0.00016535362,0.000097524106,0.000044981192,0.00028968067,0.00017082326,0.00047144823,0.00029907774,0.00040107896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032338525,0.00012913188,0.054324463,0.000019870955,0.000059793703,0.000047567315,0.00035024754,3.51717e-8,0.0010060268,0.9406019,0.0016018876,0.0018267473],"study_design_scores_gemma":[0.0007377625,0.000031167907,0.06299996,0.00007570276,0.000028085875,0.000002469612,0.0001307432,0.00012732831,0.002135941,0.9333468,0.00020455146,0.00017945407],"about_ca_topic_score_codex":0.00058807986,"about_ca_topic_score_gemma":0.000054759716,"teacher_disagreement_score":0.011851803,"about_ca_system_score_codex":0.00006250067,"about_ca_system_score_gemma":0.000053876887,"threshold_uncertainty_score":0.6742925},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9932812,0.00023806997,0.0013492,0.00047581882,0.0006067039,0.00011923953,0.0000015914592,0.00004870232,0.003879493],"genre_scores_gemma":[0.9979024,0.000045645473,0.0019642843,0.000025761221,0.0000016800135,0.000004246,2.0867127e-7,0.000005220076,0.00005055289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911624,0.000054232954,0.00012472356,0.0002529005,0.0002375343,0.00021439244],"domain_scores_gemma":[0.9983345,0.00012692442,0.00011120134,0.0012233992,0.00010508537,0.000098848126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041914475,0.00008256693,0.00014708647,0.000070383685,0.00030811434,0.00013070376,0.0013605369,0.000044873985,0.000004082075],"category_scores_gemma":[0.0002652399,0.000079391306,0.000037231162,0.00010905761,0.0003140007,0.0006891301,0.000678348,0.00013179031,0.0000053489466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000747126,0.000038408143,0.028125398,0.000013585648,0.000010107288,0.0000074460513,0.0001162344,4.7348541e-7,0.0007739979,0.9666264,0.0000675541,0.0042129457],"study_design_scores_gemma":[0.00045761507,0.00007017375,0.07275897,0.000011500311,0.0000025829295,0.000002376395,0.000006425746,0.00081614906,0.007335682,0.9182053,0.00024761492,0.00008558674],"about_ca_topic_score_codex":0.00003151775,"about_ca_topic_score_gemma":0.00000510948,"teacher_disagreement_score":0.04842106,"about_ca_system_score_codex":0.000009004599,"about_ca_system_score_gemma":0.000028902403,"threshold_uncertainty_score":0.32374835},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9530278,0.00025261543,0.000028502816,0.00003559523,0.0024291691,0.000103861064,0.000002540052,0.0003853446,0.04373456],"genre_scores_gemma":[0.99954975,0.000011290067,0.00002252869,0.000058257545,0.00002043146,0.000021323165,0.0000039739057,0.000028515253,0.0002839142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992536,0.000027796703,0.00017080308,0.00014411232,0.00015498677,0.00024873702],"domain_scores_gemma":[0.9995559,0.000046827477,0.000011117558,0.000283194,0.00001745553,0.00008554188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017102416,0.0001450744,0.00014785577,0.00006365145,0.00005855371,0.000028165974,0.00019461935,0.00008281965,0.00007334867],"category_scores_gemma":[0.000010421418,0.00014316243,0.00006236189,0.00016084798,0.000029235569,0.0001180456,0.000011274125,0.00016016961,0.0004844294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051078305,0.00003345939,0.0007798951,0.000016208154,0.000029297253,0.000009087418,0.00013557416,0.001976479,0.001721567,0.98621523,0.007436449,0.0016416217],"study_design_scores_gemma":[0.0007157984,0.00013770605,0.0019026082,0.00009426984,0.000023324601,0.00002238419,0.000061664185,0.003858784,0.034415588,0.9202769,0.037818,0.000673009],"about_ca_topic_score_codex":0.0000033028814,"about_ca_topic_score_gemma":0.0000031740556,"teacher_disagreement_score":0.06593839,"about_ca_system_score_codex":0.00005745371,"about_ca_system_score_gemma":0.0000061159017,"threshold_uncertainty_score":0.6226521},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98239464,0.001131762,0.0022961255,0.0007576805,0.00063740055,0.00033766642,0.0000031172026,0.00019772576,0.0122438595],"genre_scores_gemma":[0.9908189,0.0001345505,0.00802784,0.00006919543,0.00000857026,0.000018438459,0.0000019772915,0.000024765219,0.0008957643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774855,0.00020813163,0.00037419028,0.0005601137,0.00054106995,0.0005679593],"domain_scores_gemma":[0.9979357,0.00063822,0.00018083159,0.00081984844,0.00023085732,0.00019450569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008358087,0.00023882849,0.00036595564,0.00026493552,0.00021893394,0.00010912289,0.0011179515,0.00010103541,0.000056432422],"category_scores_gemma":[0.00032547247,0.00023512507,0.000086328575,0.0009043827,0.00027497645,0.0007853834,0.0007448886,0.00028366307,0.000039910257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027097001,0.000121078265,0.009096407,0.0000326957,0.000038278286,0.000053003412,0.00073512585,0.00001761919,0.0019153086,0.96767735,0.000781046,0.019504964],"study_design_scores_gemma":[0.001272751,0.0002004724,0.00430552,0.00007919715,0.000009227502,0.000048956892,0.00013350302,0.007598864,0.0070497566,0.9781618,0.0008232774,0.00031664871],"about_ca_topic_score_codex":0.000022227368,"about_ca_topic_score_gemma":0.0000018378756,"teacher_disagreement_score":0.019188317,"about_ca_system_score_codex":0.000042287807,"about_ca_system_score_gemma":0.00007152656,"threshold_uncertainty_score":0.95881224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9897728,0.00001730566,0.0001733041,0.0004442793,0.0007089856,0.0004453713,0.0000046275863,0.00006514438,0.008368188],"genre_scores_gemma":[0.9988814,0.0000027113329,0.0002216823,0.000035293433,0.000011525168,0.000039571056,0.0000027631042,0.000026863216,0.0007781898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987069,0.00010697329,0.00028193233,0.00023947949,0.00038965346,0.00027509624],"domain_scores_gemma":[0.99847424,0.00010493278,0.00025933282,0.0008791705,0.00018912909,0.00009318523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000884542,0.00012649439,0.00026556398,0.00009528479,0.0003074964,0.00006479259,0.0003523552,0.00010930897,0.00023328235],"category_scores_gemma":[0.00093918125,0.0001258503,0.00008441703,0.00012206075,0.00011437313,0.00025408508,0.00021157843,0.00018535831,0.0001581329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013209616,0.00019524242,0.01415218,0.000076477176,0.00008547047,0.000009659467,0.0016112243,5.207567e-7,0.0011606726,0.98047423,0.00087604375,0.001226186],"study_design_scores_gemma":[0.0006464712,0.00019988707,0.023734737,0.00013429766,0.000048788683,0.000003401955,0.00013898421,0.0003583139,0.00128656,0.97301,0.0002955891,0.00014297946],"about_ca_topic_score_codex":0.00005885249,"about_ca_topic_score_gemma":0.000010757071,"teacher_disagreement_score":0.009582557,"about_ca_system_score_codex":0.00010261508,"about_ca_system_score_gemma":0.00003165802,"threshold_uncertainty_score":0.51320267},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98934805,0.000030074856,0.000121686906,0.00021150614,0.00071420026,0.0002491428,0.0000029773591,0.00001878249,0.009303546],"genre_scores_gemma":[0.9950812,0.000020952586,0.004790686,0.000006714703,0.000006767196,0.0000150025835,6.2548054e-7,0.000023161056,0.000054887307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890494,0.00007026691,0.00048864936,0.00014818889,0.00021640201,0.00017155297],"domain_scores_gemma":[0.99747455,0.0008944113,0.0006359972,0.00080862275,0.00015372684,0.000032707572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005863588,0.00013586889,0.00038738866,0.000040535182,0.0001543348,0.000032724813,0.0004855508,0.000079189434,0.000018859222],"category_scores_gemma":[0.0013390142,0.000110106885,0.000060983006,0.00008472518,0.0002789869,0.00017784392,0.00026181163,0.00021471689,0.0000035536252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011363174,0.00016782664,0.00677802,0.00015103034,0.000025503605,0.0000021610776,0.0011353446,9.669599e-7,0.0006491309,0.99081403,0.000095733114,0.00016889231],"study_design_scores_gemma":[0.0007982158,0.0000310171,0.0023737592,0.00025483593,0.000029583838,0.000007989375,0.00036581315,0.00016424524,0.002543336,0.993281,0.000043970627,0.00010620861],"about_ca_topic_score_codex":0.00007627988,"about_ca_topic_score_gemma":0.000013234105,"teacher_disagreement_score":0.009248658,"about_ca_system_score_codex":0.000033465898,"about_ca_system_score_gemma":0.00002852719,"threshold_uncertainty_score":0.44900286},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9692827,0.00009371663,0.000030056957,0.0025932984,0.010380613,0.00023923768,0.000016986249,0.00008049679,0.017282892],"genre_scores_gemma":[0.995387,0.00001598117,0.00078595063,0.00064137153,0.00007101113,0.000022611428,0.0000023126602,0.000024727451,0.0030489934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962252,0.0002022688,0.00067373086,0.0007479046,0.0017788913,0.00037204506],"domain_scores_gemma":[0.99493414,0.0009076626,0.00025349727,0.0032750503,0.000412435,0.00021720791],"candidate_categories":["metaresearch","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021778706,0.00022636927,0.0003770992,0.0003719742,0.0016841922,0.002451022,0.0028407287,0.00012947028,0.0003781369],"category_scores_gemma":[0.008878523,0.0001753914,0.00018848943,0.0002519192,0.00019582963,0.0012003155,0.00051640463,0.00024973985,0.0038415566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024681554,0.00013295696,0.004321728,8.3061104e-7,0.000012169893,0.00003111249,0.0001492451,0.000077336146,0.0014593465,0.95948213,0.02142821,0.012880242],"study_design_scores_gemma":[0.0010043406,0.00009050613,0.053947877,0.000024702682,0.000006760968,0.0000055064693,0.00007680862,0.0013987662,0.000998308,0.92322165,0.018974764,0.00025000185],"about_ca_topic_score_codex":0.000057521098,"about_ca_topic_score_gemma":0.000021459153,"teacher_disagreement_score":0.04962615,"about_ca_system_score_codex":0.000046465295,"about_ca_system_score_gemma":0.00007392765,"threshold_uncertainty_score":0.9996155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98420435,0.00028284176,0.0014670722,0.0010227025,0.0027907414,0.00025282864,0.0000017393006,0.00008353248,0.00989419],"genre_scores_gemma":[0.998025,0.00009168832,0.0012035298,0.000028756655,0.0000040256314,0.000023238694,2.2595253e-7,0.0000129983055,0.0006105396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985414,0.00011252192,0.00020431982,0.00030493457,0.00041465793,0.0004221301],"domain_scores_gemma":[0.9967714,0.00034971698,0.00018270612,0.0024143113,0.00017571953,0.00010615377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063191453,0.00013046425,0.00017068053,0.00004707724,0.00095313444,0.0002610002,0.003664392,0.000057936435,0.000012649418],"category_scores_gemma":[0.000316558,0.000095735224,0.00012367625,0.00021147475,0.00037341495,0.0005577331,0.0008473736,0.0002293629,0.00014557841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013861548,0.000040587885,0.013564685,0.0000042176625,0.00002477083,0.000007665453,0.000109356755,0.0000012146164,0.00032605627,0.97842604,0.00061133393,0.006870233],"study_design_scores_gemma":[0.0004938841,0.000044501172,0.021177879,0.000014600954,0.0000028918978,0.000008197459,0.000018035975,0.00064116786,0.003406577,0.9726764,0.0014010953,0.000114788505],"about_ca_topic_score_codex":0.00004016841,"about_ca_topic_score_gemma":0.0000071576665,"teacher_disagreement_score":0.013820645,"about_ca_system_score_codex":0.000028482864,"about_ca_system_score_gemma":0.00008117697,"threshold_uncertainty_score":0.7330836},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99417144,0.00028244572,0.000028777189,0.0003545296,0.0028030418,0.00009627731,0.0000013788467,0.00004339739,0.0022187408],"genre_scores_gemma":[0.999006,0.000037647875,0.00083654077,0.000019214054,0.0000015670012,0.0000052384526,5.823564e-7,0.0000073226115,0.000085922846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988247,0.00005338995,0.00034038664,0.00020590931,0.00035016445,0.00022542306],"domain_scores_gemma":[0.9979336,0.00023415743,0.0004040926,0.0012116318,0.00015689842,0.000059607813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000500742,0.00011483385,0.00022077613,0.000026924625,0.0005151414,0.00016381376,0.0012172128,0.000045326182,0.0000028152626],"category_scores_gemma":[0.00051993073,0.00008268028,0.00008808592,0.00009145976,0.00023890473,0.00032137972,0.0005023073,0.000105648374,0.000013531355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031337622,0.000068299996,0.005412397,0.00003309829,0.00002475111,0.0000025841339,0.00047098377,0.0000071142845,0.00080409466,0.9903244,0.0005953577,0.002253826],"study_design_scores_gemma":[0.0005713161,0.000058817655,0.020085065,0.00015014799,0.000011146179,0.0000066122066,0.000056989527,0.0051968475,0.004200439,0.9694544,0.00008239996,0.0001257934],"about_ca_topic_score_codex":0.00018837195,"about_ca_topic_score_gemma":0.0000029972841,"teacher_disagreement_score":0.020869935,"about_ca_system_score_codex":0.000014500939,"about_ca_system_score_gemma":0.000051237323,"threshold_uncertainty_score":0.3962103},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99443275,0.00002145424,0.000011703061,0.0004965093,0.00008923973,0.00022777214,0.000004381843,0.000019114712,0.0046970854],"genre_scores_gemma":[0.99962986,0.000009703429,0.00019467421,0.000037677586,0.0000027973,0.000031879474,4.92052e-7,0.000012449867,0.000080451595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994379,0.000054815628,0.000121575984,0.00013744405,0.00011919094,0.00012905018],"domain_scores_gemma":[0.99846613,0.0006753798,0.00016592395,0.0006257817,0.000024421222,0.000042354757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023734912,0.00010131731,0.00015640231,0.0000378369,0.00034143904,0.000056881247,0.00030542724,0.000036718004,0.000016711683],"category_scores_gemma":[0.00014701564,0.00006138477,0.000042657077,0.00007145856,0.00026157935,0.00007422476,0.000031863598,0.00010673557,0.0000042860893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003951519,0.000118204516,0.002740899,0.000016164338,0.00004085934,0.0000015138511,0.00027910192,1.0076932e-7,0.00039282822,0.99594754,0.0002606218,0.00016266137],"study_design_scores_gemma":[0.0005448477,0.00013569312,0.010574632,0.000032594766,0.000047953596,0.0000021542573,0.0000799975,0.000010157637,0.0055067325,0.98290634,0.000074143136,0.00008472269],"about_ca_topic_score_codex":0.000011191735,"about_ca_topic_score_gemma":0.000008903238,"teacher_disagreement_score":0.013041159,"about_ca_system_score_codex":0.000005003644,"about_ca_system_score_gemma":0.000008547,"threshold_uncertainty_score":0.26261076},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9762621,0.000002660338,0.0000124784,0.0006077349,0.000114239985,0.0002818109,0.0000060947445,0.000032857435,0.022680052],"genre_scores_gemma":[0.99955875,0.0000020475436,0.00014842863,0.000033790708,0.0000025070135,0.00005152358,0.0000012367681,0.000017471937,0.00018426027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931324,0.000053942564,0.0001647215,0.00013407346,0.00019252335,0.0001415148],"domain_scores_gemma":[0.9980599,0.0005021164,0.00027908408,0.0010670843,0.000048619455,0.00004318731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026858313,0.0001197056,0.00017671198,0.000022997665,0.00044195086,0.00004504736,0.00055453804,0.00005070776,0.00008127595],"category_scores_gemma":[0.00017004312,0.00007631425,0.000060692237,0.00009128503,0.00025322888,0.00007151532,0.000042741045,0.00014735942,0.000036767986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016486416,0.00017116658,0.004522998,0.000029666657,0.000048719532,0.0000019276333,0.00025529563,3.886451e-7,0.00006312534,0.9935326,0.0012852341,0.00007241699],"study_design_scores_gemma":[0.00044150377,0.00006966104,0.008781479,0.00008850778,0.00003132937,0.0000040914556,0.00010586453,0.000018500741,0.0014093961,0.98883396,0.0001201869,0.00009551033],"about_ca_topic_score_codex":0.000024578956,"about_ca_topic_score_gemma":0.000015630492,"teacher_disagreement_score":0.023296662,"about_ca_system_score_codex":0.00000943586,"about_ca_system_score_gemma":0.000023487735,"threshold_uncertainty_score":0.33991733},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99019116,0.00008754815,0.00011371091,0.003925458,0.001870546,0.00040542736,0.0000020762272,0.000038015387,0.003366075],"genre_scores_gemma":[0.999534,0.000008877185,0.00014351163,0.00006710502,0.000003255404,0.00002364247,1.3941262e-7,0.0000097211405,0.00020975572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985469,0.00019679568,0.00014860234,0.00032492823,0.00047730134,0.0003054972],"domain_scores_gemma":[0.9957806,0.00027880812,0.00020232641,0.0035798873,0.00010998524,0.000048390244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000740504,0.0001220272,0.00013087122,0.000047367208,0.00080784207,0.0001459082,0.004673772,0.00002958034,0.000007865744],"category_scores_gemma":[0.00052690844,0.00006721581,0.000103474136,0.00025494487,0.00039216087,0.00030507502,0.00093315996,0.00030973004,0.00002656095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071803706,0.00004862179,0.0017346818,0.000004163127,0.000014925095,0.0000016563466,0.00016059878,0.000016065369,0.000429958,0.99475515,0.00076458417,0.0020624357],"study_design_scores_gemma":[0.00023739485,0.000066829096,0.023769904,0.000023652534,0.0000023246478,0.0000016740593,0.000012137624,0.0004859421,0.017374517,0.95780164,0.00014538958,0.00007856853],"about_ca_topic_score_codex":0.000019036872,"about_ca_topic_score_gemma":0.000003835421,"teacher_disagreement_score":0.036953464,"about_ca_system_score_codex":0.000027056436,"about_ca_system_score_gemma":0.0000745384,"threshold_uncertainty_score":0.8685109},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56232893,0.000007370206,0.0014779364,0.005363614,0.00051289523,0.0003336266,0.00001938971,0.000043602122,0.4299126],"genre_scores_gemma":[0.99735093,9.622688e-7,0.00030957666,0.000114327646,0.00002981374,0.000081528044,0.0000049411206,0.0000127972835,0.0020951477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994943,0.000015903393,0.00010420406,0.00013622465,0.00009103819,0.00015833515],"domain_scores_gemma":[0.99889565,0.00014165363,0.00010598603,0.0007814967,0.000022350758,0.000052858835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008194829,0.0000974186,0.0001101062,0.000005591335,0.0007814442,0.00010960605,0.00039359817,0.000017929136,0.0008299719],"category_scores_gemma":[0.000027495513,0.000062880725,0.000069800364,0.00002695727,0.00009305936,0.00006670911,0.0000806939,0.000108380365,0.000264819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032882938,0.000055832727,0.00017950119,0.0000011098741,0.00001575183,2.0586495e-7,0.000033892647,0.0000017211505,0.000040902905,0.9950514,0.003543171,0.0010732441],"study_design_scores_gemma":[0.00028565593,0.000010752906,0.00027802188,0.000008928221,0.000007415756,1.0619561e-7,0.00005373273,0.000060881775,0.0011083221,0.9882484,0.009851829,0.00008593564],"about_ca_topic_score_codex":0.00003108663,"about_ca_topic_score_gemma":3.9322066e-7,"teacher_disagreement_score":0.43502194,"about_ca_system_score_codex":0.000008277509,"about_ca_system_score_gemma":0.000010010891,"threshold_uncertainty_score":0.908761},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99564713,0.00017497863,0.0019408315,0.00029896415,0.0010647844,0.000064556014,0.0000051492675,0.00004513429,0.00075847533],"genre_scores_gemma":[0.9993422,0.000016639877,0.00052349526,0.00005565942,0.0000076735,0.0000039785955,0.0000011719596,0.000006483025,0.00004270891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992017,0.00006249317,0.00021992678,0.00017946395,0.00019743918,0.00013893854],"domain_scores_gemma":[0.9984487,0.00026047535,0.0003425507,0.00082959357,0.000078632045,0.000039990886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037952603,0.000085717504,0.00018408774,0.000062494204,0.00022742117,0.00009222376,0.001136353,0.00003539698,0.000015275698],"category_scores_gemma":[0.00017965875,0.000080026155,0.00006341747,0.000058095742,0.000102379665,0.0008152022,0.00029511825,0.00007417933,0.000012205076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016168287,0.00008019776,0.009892601,0.00004404303,0.000018693592,0.000005492917,0.0006380115,0.000005357374,0.0029860642,0.9771811,0.0001577259,0.0089891],"study_design_scores_gemma":[0.00069110986,0.00010092653,0.04887157,0.00014147074,0.000015831509,0.0000040189334,0.00012864383,0.0107962275,0.05747356,0.88146144,0.00013560266,0.00017958686],"about_ca_topic_score_codex":0.000102685495,"about_ca_topic_score_gemma":0.0000018756006,"teacher_disagreement_score":0.09571964,"about_ca_system_score_codex":0.00000992882,"about_ca_system_score_gemma":0.00003315592,"threshold_uncertainty_score":0.3263372},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9740669,0.00010327042,0.00020766503,0.0004600401,0.0031628162,0.00040134627,0.0000040012724,0.00023945606,0.021354498],"genre_scores_gemma":[0.9890355,0.000047727975,0.00991659,0.000040047325,0.00003454663,0.00003571232,0.0000011522262,0.00007643864,0.00081229256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983862,0.000050564162,0.00037584954,0.00039655258,0.00035288293,0.0004379609],"domain_scores_gemma":[0.99724907,0.00041616327,0.00042820364,0.0015878502,0.00011786744,0.0002008758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039617534,0.00030446154,0.00047830393,0.000053154992,0.00076994085,0.0002445512,0.00073190965,0.00014943274,0.00004347532],"category_scores_gemma":[0.0017610727,0.00030005738,0.000091055364,0.00006254366,0.0002425971,0.0004324433,0.0003997022,0.00031366508,0.000079107806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011833812,0.00013490296,0.0014301019,0.00008066162,0.000040649786,0.000023300925,0.00034519486,1.1042716e-7,0.00039809252,0.9952343,0.0015634438,0.0007373748],"study_design_scores_gemma":[0.0014521163,0.00007860714,0.0008511222,0.0000746047,0.00005789142,0.000028580189,0.00008067209,0.000068383386,0.0017800876,0.99348915,0.0016923937,0.00034637103],"about_ca_topic_score_codex":0.000025061561,"about_ca_topic_score_gemma":0.0000090857175,"teacher_disagreement_score":0.020542204,"about_ca_system_score_codex":0.00008144458,"about_ca_system_score_gemma":0.000045505585,"threshold_uncertainty_score":0.99994516},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99238235,0.0015696131,0.00018473905,0.0014734052,0.0021423055,0.00029530906,0.000009071677,0.00020421535,0.0017389844],"genre_scores_gemma":[0.99617195,0.0002833544,0.0028238986,0.00027132058,0.000003112371,0.000023786775,0.0000034586876,0.000029095498,0.00039004956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972021,0.00011982522,0.00058418064,0.00087138504,0.0006303561,0.00059213553],"domain_scores_gemma":[0.99616,0.00018072045,0.0006023278,0.0024204634,0.0003273709,0.00030912022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074949197,0.00039583462,0.00059854746,0.00039833607,0.0007196866,0.00037029586,0.0018689455,0.00020326195,0.000010876224],"category_scores_gemma":[0.00017009735,0.00036808892,0.00023991743,0.00054411317,0.00046637194,0.0009382197,0.00070678454,0.0002910136,0.000024729801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004085226,0.00039906733,0.0429699,0.00006193114,0.00014569855,0.00004220856,0.00075647375,0.000001409854,0.005003659,0.92844325,0.008799943,0.013335591],"study_design_scores_gemma":[0.0028714894,0.00036834355,0.045071766,0.00010532655,0.000051366937,0.000021251031,0.000026822278,0.00080013764,0.010601606,0.939144,0.000477101,0.00046078133],"about_ca_topic_score_codex":0.00037044604,"about_ca_topic_score_gemma":0.000086402695,"teacher_disagreement_score":0.012874809,"about_ca_system_score_codex":0.000017181803,"about_ca_system_score_gemma":0.00008355221,"threshold_uncertainty_score":0.9998771},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9477775,0.00061883527,0.000053163618,0.0072972076,0.017586388,0.00026967106,0.00000678006,0.0006116943,0.025778782],"genre_scores_gemma":[0.9977667,0.000092450675,0.0013539919,0.00031777483,0.000004494571,0.000006334122,0.0000020117348,0.0000106865355,0.0004455743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853593,0.000043350105,0.00023970779,0.0005146455,0.00034944055,0.0003169423],"domain_scores_gemma":[0.9971836,0.00007592339,0.0001963992,0.002318138,0.000083433915,0.00014250039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046221117,0.00015627747,0.0001641536,0.00012000993,0.00072720565,0.0004975873,0.0016664283,0.00007589063,0.0000028349953],"category_scores_gemma":[0.00010611042,0.00013926397,0.000086698965,0.00012188517,0.00010758246,0.00051934255,0.00030898288,0.00018797617,0.00042525114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012432657,0.00008679163,0.00015669421,0.0000019576387,0.0000073716355,0.000024428587,0.00007659362,0.00000477852,0.00040096574,0.9760918,0.02105395,0.0020822107],"study_design_scores_gemma":[0.001257745,0.0001561025,0.004227974,0.00003408403,0.0000018709712,0.000003863923,0.0000021863054,0.0002705231,0.0025729565,0.98538256,0.0059060883,0.0001840223],"about_ca_topic_score_codex":0.000027660399,"about_ca_topic_score_gemma":7.6356815e-7,"teacher_disagreement_score":0.0499892,"about_ca_system_score_codex":0.000017175309,"about_ca_system_score_gemma":0.000025595398,"threshold_uncertainty_score":0.567902},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9965027,0.0001317762,0.0011031016,0.00021816221,0.0005134702,0.00017533285,6.9915023e-7,0.000070639115,0.0012840956],"genre_scores_gemma":[0.9959892,0.0000119295055,0.0038873295,0.00002020445,0.0000031182722,0.000021433454,8.209888e-7,0.000014947471,0.000051039573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836373,0.00014562273,0.0002467396,0.00048228624,0.00029350218,0.00046813095],"domain_scores_gemma":[0.9982538,0.00030123742,0.00020279198,0.0010534455,0.00006527293,0.00012343768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006968428,0.00016766577,0.00022104452,0.0001930397,0.000659234,0.00044472297,0.0012797271,0.00006802714,0.0000026632945],"category_scores_gemma":[0.0005322506,0.0001701821,0.000041624575,0.00024545594,0.00019940644,0.0008944283,0.0012177763,0.00034768437,0.000007815686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003874206,0.000053356845,0.07348266,0.000019944555,0.00000786342,0.000030437412,0.0005203293,0.0000042210486,0.000814901,0.86270964,0.000005719286,0.062347062],"study_design_scores_gemma":[0.0010783586,0.000055097407,0.17977974,0.00006450621,0.0000019663946,0.000013232607,0.000052606636,0.025503755,0.0010922598,0.7921569,0.0000033479532,0.00019823734],"about_ca_topic_score_codex":0.00006529252,"about_ca_topic_score_gemma":0.000024492592,"teacher_disagreement_score":0.106297076,"about_ca_system_score_codex":0.00004663476,"about_ca_system_score_gemma":0.000032293206,"threshold_uncertainty_score":0.6939825},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90920395,0.00038610052,0.064025305,0.00038501428,0.014398655,0.0002996767,0.0000011780019,0.000113990325,0.011186136],"genre_scores_gemma":[0.9994694,0.000026196583,0.0003623147,0.000023890068,0.000034801717,0.0000069520215,9.4412127e-7,0.000010812403,0.00006467737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987451,0.00008357366,0.0004014523,0.00028335105,0.0002485266,0.0002379971],"domain_scores_gemma":[0.997872,0.000082795385,0.00050433964,0.0013151849,0.00014657296,0.00007912922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047466336,0.00013724678,0.00033372905,0.00006437536,0.00024458632,0.000117438285,0.0013786346,0.00011356507,0.000011618316],"category_scores_gemma":[0.000062198254,0.00012677365,0.00013237834,0.00011031237,0.00010117383,0.0003888988,0.00029343832,0.00015278738,0.000008362042],"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.000007287007,0.000100784455,0.006319663,0.00003941493,0.000072703086,0.0000097730945,0.0008158902,0.0010077882,0.00022569053,0.9795338,0.0020640984,0.009803136],"study_design_scores_gemma":[0.0018313963,0.00046475127,0.035372764,0.00040440823,0.000025539828,0.000028950551,0.00011134516,0.6938595,0.0022385358,0.2634508,0.0016608086,0.0005511743],"about_ca_topic_score_codex":0.0004914367,"about_ca_topic_score_gemma":0.000017293585,"teacher_disagreement_score":0.71608293,"about_ca_system_score_codex":0.000030149693,"about_ca_system_score_gemma":0.000042638556,"threshold_uncertainty_score":0.5169679},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.997406,0.000041476127,0.000024062201,0.00013351542,0.00058205187,0.0002756917,0.000044059077,0.00004606661,0.0014470691],"genre_scores_gemma":[0.99944496,0.00003534746,0.00022432567,0.000029284374,0.000011125494,0.000029173314,0.000015611562,0.000025902478,0.00018428474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896955,0.00008133953,0.0003078806,0.00025547363,0.00016548242,0.00022027943],"domain_scores_gemma":[0.998466,0.00021240719,0.000360136,0.00077403843,0.00007229741,0.00011508857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003408348,0.00017869481,0.00035685173,0.00007452314,0.0005118088,0.00008133549,0.00040600705,0.000116044655,0.00004489384],"category_scores_gemma":[0.00019531402,0.000173818,0.00008831893,0.00006467916,0.00025774166,0.00015589458,0.00012935896,0.00013031693,0.000012716021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007119872,0.0001632422,0.0060614413,0.00005288773,0.0000377564,0.000003577929,0.00024384969,2.8333368e-8,0.0073208767,0.9841666,0.00088436896,0.0009941552],"study_design_scores_gemma":[0.0014657298,0.00007826319,0.048387565,0.00005437484,0.00006521488,0.000004996319,0.000039213657,0.00005279327,0.0046211085,0.9444368,0.00059237203,0.0002015924],"about_ca_topic_score_codex":0.000043974047,"about_ca_topic_score_gemma":0.000016241638,"teacher_disagreement_score":0.042326123,"about_ca_system_score_codex":0.000014510825,"about_ca_system_score_gemma":0.000024167799,"threshold_uncertainty_score":0.70880926},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792568,0.000043437158,0.0001067286,0.00046845785,0.00021555813,0.00035029333,0.000011512123,0.000051585663,0.019495618],"genre_scores_gemma":[0.9989718,0.000013829989,0.0004339285,0.000008080627,0.0000074953105,0.000051300438,0.0000021306537,0.000023118215,0.00048828105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990617,0.00006484858,0.00024601351,0.00017160605,0.00021676907,0.00023906157],"domain_scores_gemma":[0.9978885,0.0004474581,0.00037179224,0.0011565643,0.00006672497,0.0000689579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034472946,0.0001490393,0.00023956661,0.000018711708,0.0009246105,0.000102049155,0.0007337903,0.000050969833,0.000026749087],"category_scores_gemma":[0.00011535339,0.0000995464,0.00008988552,0.000106132524,0.00050830457,0.00012228714,0.000053170872,0.00014172496,0.000019844172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003155072,0.00013661286,0.007546202,0.000044110242,0.000073401905,0.0000034822442,0.00042471226,2.2781452e-7,0.00015651995,0.9905141,0.0009228532,0.00014622686],"study_design_scores_gemma":[0.00064214686,0.00005568234,0.008313311,0.00007630354,0.00005720963,0.0000062149834,0.00022770917,0.000017934748,0.001845867,0.9877586,0.00086376566,0.00013527989],"about_ca_topic_score_codex":0.000019537909,"about_ca_topic_score_gemma":0.00006304776,"teacher_disagreement_score":0.019715024,"about_ca_system_score_codex":0.000017841427,"about_ca_system_score_gemma":0.000031242813,"threshold_uncertainty_score":0.711145},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9972098,0.00024966194,0.0000364743,0.0003131542,0.00015181125,0.000111170055,0.000004378421,0.000023594412,0.0018999431],"genre_scores_gemma":[0.9991992,0.00021639887,0.00023852321,0.000014931903,0.000002857136,0.0000219509,7.0224274e-7,0.00001347543,0.00029197038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934983,0.000057997004,0.00018978344,0.00015596182,0.00011179508,0.00013463647],"domain_scores_gemma":[0.9985735,0.00051216333,0.00024146031,0.0005740585,0.000039176663,0.00005968722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037145763,0.00010396845,0.00017720042,0.000036184592,0.0008388572,0.000090601054,0.00028067012,0.00005056303,0.0000023664584],"category_scores_gemma":[0.00016154026,0.000074103096,0.000041355604,0.000051171617,0.0002763624,0.00009390821,0.00014461091,0.00008034451,8.1435996e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012910075,0.00004245556,0.0037324205,0.00001724137,0.000027818183,4.094989e-7,0.00028077592,1.7943819e-8,0.0004561191,0.993081,0.0003135695,0.0020352672],"study_design_scores_gemma":[0.0005128836,0.000034976703,0.00915971,0.000028342838,0.00003169603,0.0000039262554,0.00013261002,0.000029601264,0.0008381085,0.98833877,0.0008042605,0.0000851179],"about_ca_topic_score_codex":0.000036585065,"about_ca_topic_score_gemma":0.0000128746615,"teacher_disagreement_score":0.0054272898,"about_ca_system_score_codex":0.0000033609442,"about_ca_system_score_gemma":0.000008695686,"threshold_uncertainty_score":0.64518964},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9765929,0.00021684036,0.0065230373,0.001492368,0.0042136135,0.00013962548,0.0000027908318,0.000026814543,0.010792034],"genre_scores_gemma":[0.99721193,0.000018122904,0.0024366453,0.000023126293,0.000009837892,0.0000033054482,0.0000011848123,0.0000030542544,0.00029279036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999276,0.000043604257,0.00020337146,0.00012770301,0.00024534453,0.00010400973],"domain_scores_gemma":[0.99864393,0.00016365125,0.0002695202,0.0006995507,0.00019132164,0.000032019878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042254204,0.000059516642,0.000105747604,0.000023965431,0.00040184183,0.00012681828,0.00094562536,0.00003024303,0.0000072334255],"category_scores_gemma":[0.0001993793,0.00004661297,0.000055583063,0.00010502677,0.00012315663,0.00029304376,0.00024414223,0.000054846754,0.000020765212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053268077,0.000040305873,0.0030762872,0.000006065733,0.000014636205,0.0000010426014,0.00009162234,0.000009388777,0.00026094416,0.9802366,0.0011491061,0.015108713],"study_design_scores_gemma":[0.00053595984,0.00003653461,0.050463103,0.000016288855,0.0000048771813,0.000005311633,0.000007314395,0.00252273,0.011389881,0.9284705,0.006469065,0.000078450714],"about_ca_topic_score_codex":0.000019156609,"about_ca_topic_score_gemma":0.0000026375549,"teacher_disagreement_score":0.05176608,"about_ca_system_score_codex":0.000012066726,"about_ca_system_score_gemma":0.000100447134,"threshold_uncertainty_score":0.3090683},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99231845,0.000014433542,0.000035768975,0.00024128825,0.00048109595,0.00029206192,0.000030230884,0.000064300286,0.0065223416],"genre_scores_gemma":[0.99950707,0.0000036662618,0.00019647485,0.00008383709,0.000004976996,0.000030398169,0.000008448696,0.00002416703,0.00014093255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990275,0.00007402482,0.00024201757,0.00021850172,0.00023077162,0.00020718513],"domain_scores_gemma":[0.997905,0.00033962843,0.00030011992,0.0012993844,0.00007161222,0.0000842392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036499303,0.00014806351,0.00024267164,0.00010687099,0.00042391958,0.000041549516,0.00065850053,0.000091815295,0.000024093972],"category_scores_gemma":[0.0002103318,0.0001411933,0.000120877965,0.00011315887,0.00020499023,0.00008903855,0.00006187068,0.0001393766,0.00003514422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018756718,0.00060245977,0.0009626859,0.000028040624,0.000017989349,0.000002331685,0.00006771606,0.0000047319254,0.0007306253,0.9966483,0.0005384059,0.00037797162],"study_design_scores_gemma":[0.0009787553,0.00009666203,0.0026758611,0.000063047795,0.000031151616,4.5812877e-7,0.000026046202,0.000344933,0.009420312,0.98591053,0.00030660056,0.00014563717],"about_ca_topic_score_codex":0.000009270181,"about_ca_topic_score_gemma":0.0000025272238,"teacher_disagreement_score":0.010737751,"about_ca_system_score_codex":0.000015899584,"about_ca_system_score_gemma":0.00002870904,"threshold_uncertainty_score":0.57576954},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99209875,0.00032456237,0.000004960535,0.000016114214,0.0011202265,0.00015062561,0.0000018202219,0.0001630046,0.006119932],"genre_scores_gemma":[0.99967533,0.000010473632,0.000007803482,0.0000038727326,0.0000067385154,0.000019496412,0.0000010494167,0.000026981334,0.0002482566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994912,0.000016411786,0.000092215174,0.0001287354,0.000095568146,0.0001758591],"domain_scores_gemma":[0.99942684,0.000012224064,0.000030974978,0.0004334355,0.00002369471,0.00007281263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008064909,0.00013427979,0.00015262357,0.000024971314,0.00024152694,0.00014547555,0.00020854102,0.000054985765,0.000007647615],"category_scores_gemma":[0.000016017035,0.000098200086,0.000019225103,0.000027460748,0.000092217895,0.0002589954,0.00003491112,0.00009490453,0.000008103467],"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.00013721688,0.0001198456,0.25380674,0.00070584595,0.00042847396,0.000063650186,0.0063418406,0.0002930052,0.012366654,0.72144824,0.0020670055,0.0022214507],"study_design_scores_gemma":[0.008597844,0.00077439373,0.5543597,0.0012204004,0.00023054342,0.00008013612,0.0019491311,0.006935724,0.15985717,0.23735178,0.025576005,0.0030672078],"about_ca_topic_score_codex":0.000038272363,"about_ca_topic_score_gemma":0.000009153152,"teacher_disagreement_score":0.4840965,"about_ca_system_score_codex":0.000012248454,"about_ca_system_score_gemma":0.0000062979207,"threshold_uncertainty_score":0.40044832},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9813524,0.000427718,0.0012070215,0.0021201596,0.00635913,0.0005178602,0.0000060094885,0.000078607154,0.007931131],"genre_scores_gemma":[0.9978349,0.000060744398,0.0008629129,0.000055752385,0.000009085479,0.000027025959,4.1873133e-7,0.000012269126,0.0011368974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998318,0.00021680979,0.00021526546,0.0002990275,0.0005252481,0.00042561183],"domain_scores_gemma":[0.99603015,0.000282374,0.00026125676,0.00316969,0.00017235898,0.000084150284],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007876916,0.00013101094,0.00016153748,0.000041819003,0.0017791808,0.00031679642,0.005065514,0.000045865927,0.000004823579],"category_scores_gemma":[0.0004033902,0.000076728946,0.000147731,0.00027466562,0.0005491002,0.00043635155,0.0014016621,0.00021705586,0.000019317455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012532988,0.000028460077,0.0028916723,0.0000032503249,0.000023841352,0.0000037226557,0.00015966865,0.000008505972,0.0011029434,0.99248034,0.0008238516,0.0024612402],"study_design_scores_gemma":[0.0006771205,0.00004779964,0.0103585385,0.000015314588,0.0000050787335,0.000005786595,0.000023032344,0.00050928973,0.010371297,0.970379,0.007494354,0.000113391536],"about_ca_topic_score_codex":0.00007626694,"about_ca_topic_score_gemma":0.000017370017,"teacher_disagreement_score":0.022101313,"about_ca_system_score_codex":0.000031817897,"about_ca_system_score_gemma":0.000082194354,"threshold_uncertainty_score":0.99952036},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9909662,0.00007409317,0.000055228615,0.000013446376,0.0028187695,0.00015136976,0.000008718473,0.000050865194,0.005861293],"genre_scores_gemma":[0.9999151,0.0000051411685,0.0000063302687,0.000003897262,0.0000075730627,0.000011575057,0.0000025100726,0.000017329374,0.000030546347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994416,0.000028194503,0.0002042471,0.00010188625,0.00010785957,0.000116201605],"domain_scores_gemma":[0.9993042,0.00004287537,0.00012488727,0.00045678703,0.000037174817,0.000034090197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015666182,0.00011157261,0.00021041356,0.0001048648,0.00006558319,0.000014869825,0.00022784172,0.00009020318,0.000013097119],"category_scores_gemma":[0.00004173699,0.00010456558,0.00009065139,0.000078939156,0.000073674855,0.00008688413,0.000019512872,0.00012578203,0.0000046130135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000836041,0.00013720959,0.005804332,0.0004963717,0.00020194631,0.000006604283,0.0014712216,0.0013716487,0.0132499235,0.9746488,0.00062048633,0.0019078584],"study_design_scores_gemma":[0.001985213,0.00077723985,0.013407923,0.00062969147,0.00004833418,0.000006422011,0.00029062454,0.001334352,0.28676948,0.6938546,0.00054641935,0.0003497216],"about_ca_topic_score_codex":0.000024592395,"about_ca_topic_score_gemma":0.000009293971,"teacher_disagreement_score":0.28079423,"about_ca_system_score_codex":0.000013497664,"about_ca_system_score_gemma":0.000004995318,"threshold_uncertainty_score":0.42640606},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9960597,0.000059435508,0.0013518356,0.00068900525,0.00041384972,0.00014161825,4.366583e-7,0.000030718977,0.0012533786],"genre_scores_gemma":[0.9994532,0.000011831563,0.0004616008,0.000010915563,0.000001422815,0.000008164075,8.00928e-7,0.0000037878,0.000048317885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993144,0.00006505602,0.0001782085,0.00016606334,0.00017464887,0.0001016041],"domain_scores_gemma":[0.99889433,0.0001409412,0.00023866593,0.0006133217,0.00007778753,0.000034950674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067443337,0.00006440011,0.0001328506,0.00002928711,0.0003615522,0.00012323844,0.00041674206,0.000049730952,0.0000014218224],"category_scores_gemma":[0.000098259865,0.000046614925,0.000030057592,0.000070287664,0.0001680242,0.0003200075,0.00015786101,0.000097629614,0.0000074408085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010066343,0.000009795211,0.100791425,0.000004355636,0.0000126428085,1.8108652e-7,0.00037333666,0.000011575171,0.00007867361,0.89743495,0.000035317356,0.0012376966],"study_design_scores_gemma":[0.0020181048,0.0000142845765,0.23382033,0.000019029647,0.000011310481,8.100903e-7,0.000009117991,0.0062963767,0.00042237042,0.75731313,0.00002159143,0.000053515447],"about_ca_topic_score_codex":0.000104815466,"about_ca_topic_score_gemma":9.1430985e-7,"teacher_disagreement_score":0.14012179,"about_ca_system_score_codex":0.0000083110945,"about_ca_system_score_gemma":0.000017998895,"threshold_uncertainty_score":0.27808037},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9961681,0.00002318675,0.0000074019235,0.00020048849,0.00029412817,0.00048489723,0.000008603038,0.000044449185,0.002768797],"genre_scores_gemma":[0.99907416,0.000008022103,0.0006790922,0.000014934686,0.0000041309295,0.000090184956,0.0000034872953,0.000022873368,0.00010313571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989604,0.000053372147,0.00028910078,0.00027977463,0.00019252437,0.00022485512],"domain_scores_gemma":[0.9981918,0.00029455157,0.00029398737,0.0011083891,0.000048874295,0.000062422456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003605026,0.00015589994,0.0002518664,0.00013970603,0.00023701214,0.000038489103,0.00044720157,0.00006466948,0.00004421969],"category_scores_gemma":[0.00043329137,0.00014037838,0.00008852593,0.00016427913,0.00017887319,0.00011317887,0.0000911051,0.00022996706,0.000018448793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020148325,0.00071362994,0.015652847,0.00006105943,0.000019713489,0.000006934001,0.00029015238,6.0648205e-7,0.0010003122,0.9813977,0.00023150655,0.000605427],"study_design_scores_gemma":[0.0006537671,0.000071147886,0.07576738,0.00017144116,0.000021112526,0.0000021510677,0.000008299674,0.000035040866,0.0074428185,0.9156523,0.00003804804,0.00013653419],"about_ca_topic_score_codex":0.000012787478,"about_ca_topic_score_gemma":0.000009274179,"teacher_disagreement_score":0.065745406,"about_ca_system_score_codex":0.000018522946,"about_ca_system_score_gemma":0.000020423093,"threshold_uncertainty_score":0.57244647},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98223215,0.00007610611,0.000010378676,0.00033902176,0.001801799,0.00019002486,0.000010587509,0.00011211314,0.015227841],"genre_scores_gemma":[0.9965845,0.00005629267,0.0020160286,0.000060621776,0.000011847105,0.000014460132,0.000008037922,0.00003072171,0.0012175293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992207,0.000024528745,0.00017440939,0.00023046878,0.00013809279,0.0002117781],"domain_scores_gemma":[0.99862564,0.0001503551,0.00012880571,0.00091314083,0.00008697058,0.0000950665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013556126,0.0001438182,0.00020106466,0.00004548421,0.0005223841,0.000115224706,0.00033917572,0.00009315485,0.00011285282],"category_scores_gemma":[0.0007745474,0.00014528999,0.000036477628,0.00004964081,0.00023156102,0.00029941645,0.00019075951,0.00016753818,0.000055617063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005878236,0.000048935555,0.004014251,0.000026922256,0.000025346064,0.000013524659,0.00010476205,1.8419835e-8,0.00030873946,0.99180114,0.0034097303,0.00024072324],"study_design_scores_gemma":[0.0007129804,0.000052443153,0.008610789,0.000031191925,0.00002046915,0.000012164715,0.000036006586,0.0000064450082,0.0013086238,0.98727995,0.0017582977,0.0001706395],"about_ca_topic_score_codex":0.000009650309,"about_ca_topic_score_gemma":0.0000076197375,"teacher_disagreement_score":0.014352334,"about_ca_system_score_codex":0.000024583955,"about_ca_system_score_gemma":0.00002410393,"threshold_uncertainty_score":0.59247535},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5722893,0.00004899239,0.002098113,0.0027628865,0.00054859254,0.0003620472,0.000033263335,0.00007202308,0.4217848],"genre_scores_gemma":[0.9970871,0.000004017641,0.001093825,0.000032800428,0.00003418661,0.000040910527,0.0000070505503,0.000016660273,0.0016834222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993623,0.00000949098,0.00013613555,0.00020402487,0.00008010712,0.00020795956],"domain_scores_gemma":[0.99909866,0.00005057671,0.00012076941,0.0005812051,0.000023269531,0.00012550007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000676654,0.00012525146,0.00016385665,0.000011804383,0.00063391525,0.00014724954,0.00023440758,0.000042368163,0.00026894288],"category_scores_gemma":[0.000015035505,0.00011153857,0.000047768037,0.000029883455,0.00014518386,0.00017987483,0.00013904284,0.00015693305,0.00007864021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024480307,0.000051853185,0.0033340885,0.0000059975255,0.000016755108,7.3170304e-7,0.00007227146,1.9016927e-7,0.000048031834,0.99097586,0.00045860177,0.00503319],"study_design_scores_gemma":[0.00038848643,0.000014281667,0.0041271322,0.000016294855,0.0000143433535,8.808399e-7,0.00014521542,0.00004053067,0.0005268809,0.98335564,0.0112272985,0.00014299],"about_ca_topic_score_codex":0.000054798562,"about_ca_topic_score_gemma":0.0000012403406,"teacher_disagreement_score":0.42479783,"about_ca_system_score_codex":0.000008458922,"about_ca_system_score_gemma":0.000013476744,"threshold_uncertainty_score":0.48756275},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99078494,0.00016009786,0.0002628467,0.00060775824,0.002989065,0.00010426608,0.0000015909229,0.00012726354,0.0049621467],"genre_scores_gemma":[0.99509096,0.000014097736,0.0045435326,0.00014155074,0.0000010555507,0.0000047533877,7.1149935e-7,0.000009383746,0.00019395603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988423,0.000039545146,0.0002336647,0.00032403792,0.00032136985,0.00023905927],"domain_scores_gemma":[0.99784327,0.00010259492,0.0002641468,0.0015483964,0.00014715412,0.00009442808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043318863,0.00012865811,0.00019695087,0.000078210665,0.0003695335,0.00015674307,0.0012815152,0.00006881209,0.0000066806315],"category_scores_gemma":[0.00022859697,0.00011541586,0.000073977244,0.000110472094,0.000084178944,0.0002755296,0.0003069788,0.00014498156,0.000079707985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004155485,0.000103081984,0.0010091744,0.000009020171,0.000011099592,0.00000854386,0.0001330138,0.0000194618,0.002114795,0.99308664,0.0012505776,0.0022504108],"study_design_scores_gemma":[0.00069848663,0.00017111561,0.0011532296,0.00008294203,0.0000048807424,0.000001988412,0.0000049071796,0.0021642947,0.008681776,0.98672205,0.00017278321,0.00014154347],"about_ca_topic_score_codex":0.00008222784,"about_ca_topic_score_gemma":0.0000013619765,"teacher_disagreement_score":0.006566981,"about_ca_system_score_codex":0.000012639474,"about_ca_system_score_gemma":0.000041376625,"threshold_uncertainty_score":0.47065222},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9944135,0.000079735546,0.0000766375,0.00039639237,0.0003023601,0.00026822372,0.0000080318105,0.000041649753,0.004413459],"genre_scores_gemma":[0.9996055,0.00005916282,0.00015546354,0.000009439912,0.0000057995935,0.000025017049,0.0000032831413,0.0000147280025,0.000121611265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993043,0.00008008559,0.00019961648,0.00014517878,0.00011900576,0.00015184365],"domain_scores_gemma":[0.9983268,0.0006063229,0.0002673578,0.0006729647,0.000080399455,0.00004620487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004284175,0.00010489263,0.0001578555,0.000029987057,0.0007883033,0.00008766809,0.00037263168,0.000056119155,0.000009924468],"category_scores_gemma":[0.00038061195,0.00007614925,0.000050818348,0.00008945217,0.00038530238,0.000089459834,0.00006489709,0.0000960575,0.000002693352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018094297,0.00006250247,0.00209805,0.000015366766,0.000034743312,7.1870704e-7,0.0002119066,1.00288574e-7,0.0019428562,0.99485296,0.00035028625,0.00041240655],"study_design_scores_gemma":[0.0005113198,0.00003563528,0.009467449,0.000016211547,0.000037991125,0.0000029340429,0.00009797907,0.00004285369,0.008914522,0.9805594,0.00022310842,0.00009057699],"about_ca_topic_score_codex":0.000008781066,"about_ca_topic_score_gemma":0.0000068420386,"teacher_disagreement_score":0.0142935505,"about_ca_system_score_codex":0.0000070836277,"about_ca_system_score_gemma":0.000013253348,"threshold_uncertainty_score":0.60630715},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9785055,0.0000901723,0.0000037070486,0.00042386889,0.0018390864,0.00024367434,0.000010878705,0.000042078784,0.018841049],"genre_scores_gemma":[0.9993842,0.000019081523,0.00015773883,0.00010889591,0.000017840508,0.000010888482,9.674176e-7,0.000030035742,0.0002703321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998857,0.00010403351,0.00026628506,0.0002149186,0.00031536628,0.00024238585],"domain_scores_gemma":[0.9973254,0.0007244666,0.00037394871,0.0014387966,0.00008182465,0.000055569886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056039536,0.00019316691,0.00029532518,0.0000639461,0.0009105914,0.0000685381,0.0009612321,0.00013229133,0.00010452286],"category_scores_gemma":[0.0008671161,0.000119595345,0.00019431111,0.00007077994,0.00033166684,0.000080157566,0.00021344783,0.0003115493,0.000007426656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002414551,0.00005844412,0.0014905363,0.000040206833,0.00007552019,0.0000048241336,0.0011050774,9.1916576e-7,0.000113468515,0.9945665,0.0022386147,0.0002817653],"study_design_scores_gemma":[0.00052615325,0.00008149555,0.0043196967,0.000097597294,0.000039203045,0.000004073447,0.00016026253,0.000015519923,0.003447323,0.9906896,0.00047164698,0.00014746767],"about_ca_topic_score_codex":0.000021472184,"about_ca_topic_score_gemma":0.000005575767,"teacher_disagreement_score":0.020878734,"about_ca_system_score_codex":0.000015567433,"about_ca_system_score_gemma":0.000021454458,"threshold_uncertainty_score":0.7003625},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.991808,0.0009439692,0.00015287563,0.000066012,0.0018312465,0.00014212601,0.0000056491695,0.00022435938,0.0048257387],"genre_scores_gemma":[0.9994573,0.000013492593,0.0001846947,0.000023775614,0.000020176516,0.000018275612,0.000005135532,0.000034729903,0.00024241798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999143,0.000041657186,0.0002770247,0.00014358763,0.00015652641,0.00023817086],"domain_scores_gemma":[0.999447,0.00006065832,0.00004282473,0.0003279479,0.00004132462,0.000080252066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019622194,0.00015543509,0.00022900851,0.00009447514,0.00006404473,0.000024670435,0.0002026242,0.00009245498,0.00009200722],"category_scores_gemma":[0.000027540487,0.00015781217,0.0000690307,0.00031015853,0.000058883725,0.0001365956,0.00002365682,0.00013537175,0.00009072784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007406748,0.0004974441,0.0064017484,0.0006722328,0.00038142435,0.000031264935,0.0033670256,0.0044508753,0.034921534,0.9165808,0.023302156,0.009319401],"study_design_scores_gemma":[0.008365941,0.0007894656,0.03457992,0.0011549446,0.0003158782,0.00013416054,0.0012433912,0.035340138,0.04575163,0.6215908,0.24766725,0.0030665118],"about_ca_topic_score_codex":0.000013883274,"about_ca_topic_score_gemma":0.000008692163,"teacher_disagreement_score":0.29499006,"about_ca_system_score_codex":0.000037554888,"about_ca_system_score_gemma":0.000012170117,"threshold_uncertainty_score":0.64353937},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94955647,0.00058593234,0.000013518676,0.00011526619,0.00086142775,0.00011733086,0.0000010144468,0.0008424459,0.04790661],"genre_scores_gemma":[0.99887604,0.0005175915,0.00016071426,0.00002589396,0.000010914244,0.00002067594,0.000003288781,0.000018353365,0.00036655142],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939746,0.000011651076,0.00015504342,0.00012714381,0.00008836514,0.00022035862],"domain_scores_gemma":[0.9997315,0.000017133805,0.000011418363,0.00015481444,0.000013573738,0.00007159052],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000065918255,0.00010091611,0.00013437215,0.000048173,0.00004540033,0.000008436703,0.00011039121,0.0001679349,0.001294965],"category_scores_gemma":[0.000011550393,0.00010367921,0.000036880607,0.00017441204,0.00006325429,0.00007557205,0.000009410697,0.00022700804,0.00036763295],"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.00002747708,0.00009855457,0.0011030593,0.00009394385,0.000079430436,0.000029742409,0.00020044156,0.00017845645,0.001345129,0.2927254,0.010787995,0.69333035],"study_design_scores_gemma":[0.0027046364,0.00036698728,0.0014361489,0.000111474605,0.00003722356,0.00016221976,0.00009669758,0.015025813,0.00872486,0.46945313,0.50126,0.00062084245],"about_ca_topic_score_codex":0.00000651021,"about_ca_topic_score_gemma":0.0000016931275,"teacher_disagreement_score":0.6927095,"about_ca_system_score_codex":0.000038153747,"about_ca_system_score_gemma":0.000009904389,"threshold_uncertainty_score":0.999618},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7959697,0.0012748226,0.052661855,0.004009459,0.0044410336,0.00094006764,0.000012189431,0.0018732791,0.13881758],"genre_scores_gemma":[0.99126387,0.0000071213744,0.007385495,0.00011656595,0.0000066776356,0.000031690208,0.0000058637256,0.000014163509,0.0011685342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848026,0.00009160895,0.00018365245,0.00038502086,0.00040182617,0.00045765215],"domain_scores_gemma":[0.99890405,0.00009905701,0.000051630235,0.0007223392,0.0001261949,0.00009672612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002833753,0.0001369345,0.00013558962,0.000182068,0.00025465383,0.0001450143,0.0009888988,0.00004967356,0.000019171863],"category_scores_gemma":[0.000020606676,0.00013910611,0.00007792592,0.0008939506,0.00013405953,0.0006052055,0.00024307777,0.00020216488,0.00021644717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034149455,0.000088191904,0.0011264127,0.0000039434176,0.0000059814947,0.000028141585,0.000020902286,0.000032416585,0.001455265,0.9925948,0.0024920546,0.002148496],"study_design_scores_gemma":[0.00039197746,0.00005920853,0.007944174,0.00000721071,0.000001660123,0.000009615164,0.0000025767258,0.00049341435,0.004777333,0.98167396,0.0044717393,0.00016715223],"about_ca_topic_score_codex":0.00004967751,"about_ca_topic_score_gemma":0.0000061455817,"teacher_disagreement_score":0.19529417,"about_ca_system_score_codex":0.000055824126,"about_ca_system_score_gemma":0.00005452218,"threshold_uncertainty_score":0.56725824},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9897411,0.00059313554,0.000034941902,0.000015995776,0.0012065202,0.0001887897,0.000004344592,0.00007368761,0.008141511],"genre_scores_gemma":[0.99961495,0.000052574458,0.00018714809,0.000010189134,0.0000047444105,0.000024010124,0.000002092585,0.000030517895,0.00007379084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989615,0.00012050853,0.00033775208,0.00015097947,0.00015867896,0.0002705819],"domain_scores_gemma":[0.99949646,0.00006309548,0.00005706105,0.00030420616,0.000027902153,0.000051302046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030272585,0.00015656633,0.00027116176,0.00007542443,0.000033960303,0.000013397839,0.0001604786,0.00008813239,0.000034166398],"category_scores_gemma":[0.0000504017,0.00016370234,0.000076413315,0.00026595723,0.000040712224,0.00016548333,0.000016055721,0.00015286132,0.000023591638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027683538,0.00022162104,0.032610975,0.00021808996,0.00015837589,0.00006486904,0.00328216,0.0034746919,0.0136582395,0.94446623,0.0012989318,0.0005181191],"study_design_scores_gemma":[0.0036603478,0.00013898243,0.011174007,0.0004157065,0.000035642766,0.000033643304,0.0012500488,0.0015641213,0.07509224,0.8901953,0.015824411,0.0006155216],"about_ca_topic_score_codex":0.000028327282,"about_ca_topic_score_gemma":0.0000099972485,"teacher_disagreement_score":0.061434004,"about_ca_system_score_codex":0.000048062397,"about_ca_system_score_gemma":0.00001048891,"threshold_uncertainty_score":0.6675587},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79886967,0.000709183,0.0854948,0.0048577846,0.0075825998,0.0006599616,0.000007315151,0.0016384566,0.10018025],"genre_scores_gemma":[0.9946708,0.0000023725288,0.0048056855,0.00017901859,0.00000609793,0.000018475597,0.0000013744024,0.000012919315,0.0003032659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984062,0.00011544181,0.0001635519,0.00040018838,0.0004623372,0.00045229262],"domain_scores_gemma":[0.998407,0.00061589014,0.000024643401,0.00074329425,0.00009849452,0.00011068258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029386365,0.00013417678,0.00013270226,0.00017213686,0.00017688696,0.0001119019,0.0009572251,0.00005902682,0.000024610259],"category_scores_gemma":[0.00017932756,0.00012843456,0.00007566837,0.0006579647,0.00015479639,0.00033938224,0.00019819803,0.00024176041,0.00032156144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007394736,0.00014536094,0.0003360595,0.0000036013878,0.0000029679782,0.000041719846,0.000012690941,0.000013946978,0.00028312896,0.99552536,0.0027983682,0.00082941714],"study_design_scores_gemma":[0.00034830993,0.0001556312,0.0009594149,0.000009673152,0.0000011983567,0.000007014427,0.0000023412533,0.0006170509,0.0022694704,0.99468094,0.00079881656,0.00015015423],"about_ca_topic_score_codex":0.00001166876,"about_ca_topic_score_gemma":0.0000012127615,"teacher_disagreement_score":0.19580114,"about_ca_system_score_codex":0.000039084025,"about_ca_system_score_gemma":0.000031009822,"threshold_uncertainty_score":0.52374095},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4477337,0.00011075788,0.5461953,0.00069332495,0.0024188939,0.00039995587,0.0000069161742,0.00018968525,0.0022514565],"genre_scores_gemma":[0.9742283,0.0000036282986,0.0250567,0.0004986871,0.0000137780735,0.000050524388,0.000038339644,0.000009053799,0.00010097713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989349,0.000112300906,0.00020849868,0.0003145257,0.00019634227,0.00023338494],"domain_scores_gemma":[0.99900657,0.00034294077,0.00008131654,0.0002558106,0.00022103194,0.00009234875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036623445,0.00012600055,0.00012789502,0.00011464679,0.00023705645,0.00012342427,0.00027043233,0.0000591205,0.000021076812],"category_scores_gemma":[0.00015947531,0.00012968143,0.0000809913,0.0004665399,0.000021967275,0.00031497655,0.000038032074,0.0000702583,0.000026875685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010457141,0.00008765858,0.00012232747,0.0000050233166,0.000015956954,0.0000017928926,0.00007699888,0.00027099022,0.0014911555,0.99342036,0.0014484266,0.0030488258],"study_design_scores_gemma":[0.0010909243,0.0001743245,0.0013771524,0.0000072632733,0.000008536373,0.000028313563,0.000009511838,0.019977126,0.011593976,0.9579122,0.007620498,0.00020019167],"about_ca_topic_score_codex":0.000001924973,"about_ca_topic_score_gemma":0.0000019296035,"teacher_disagreement_score":0.5264946,"about_ca_system_score_codex":0.000042575626,"about_ca_system_score_gemma":0.00013118096,"threshold_uncertainty_score":0.5288255},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99366504,0.00021473676,0.00078903796,0.00013317233,0.0007564033,0.00020748253,0.000006483277,0.00017922178,0.0040484197],"genre_scores_gemma":[0.9996672,0.000025545618,0.000012284189,0.000105315805,0.000020383448,0.000063144704,0.000014630954,0.000029813613,0.000061635285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991391,0.00018639085,0.00018957937,0.00014136979,0.00014607326,0.00019749474],"domain_scores_gemma":[0.9991618,0.0004800544,0.000036506914,0.00023560901,0.000030433346,0.00005559132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056103966,0.00014461495,0.00018374484,0.00003702836,0.00022942144,0.000106636144,0.0001741124,0.000048286955,0.000037712573],"category_scores_gemma":[0.00006834316,0.00011013943,0.000056309862,0.0000860975,0.000084866995,0.00014154465,0.000029114055,0.00014550496,0.000038497354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068026134,0.000008088331,0.021726137,0.000031640873,0.00004323103,0.0000015193763,0.0021090407,0.00031314787,0.00017584788,0.9747218,0.00025799323,0.00060476444],"study_design_scores_gemma":[0.002597159,0.000024890447,0.0106937615,0.000034345645,0.0000416346,0.00003518209,0.0026724269,0.046568923,0.0010786405,0.93369997,0.002267471,0.00028559042],"about_ca_topic_score_codex":0.000059100894,"about_ca_topic_score_gemma":0.000012150526,"teacher_disagreement_score":0.046255775,"about_ca_system_score_codex":0.000021296433,"about_ca_system_score_gemma":0.0000050169365,"threshold_uncertainty_score":0.44913557},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8518928,0.000104116654,0.028153924,0.0017532373,0.00065652584,0.00053934235,0.00014858003,0.00009135017,0.116660126],"genre_scores_gemma":[0.99329716,0.0000042074203,0.0046008825,0.000037674916,0.000015764252,0.00005135761,0.000013295746,0.000017548911,0.0019620808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993961,0.000017274264,0.00012362152,0.00020471404,0.00008474663,0.00017354736],"domain_scores_gemma":[0.9991359,0.00016089859,0.00010961046,0.00047500533,0.00002127199,0.000097296885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009905891,0.00012324736,0.00016782251,0.000010803962,0.0005328879,0.00012547146,0.00020248044,0.000029285093,0.00023448505],"category_scores_gemma":[0.000023288298,0.00010966591,0.000046881392,0.00002988972,0.00009174717,0.00010407893,0.000086427244,0.00011419669,0.00010073593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048965476,0.000066621025,0.00044195668,0.0000051822635,0.000017092878,2.675192e-7,0.00004907404,0.0000011141336,0.00021170107,0.99072444,0.0030225585,0.0054550976],"study_design_scores_gemma":[0.0004171853,0.000026668027,0.00013354325,0.0000125798415,0.000013386133,4.0349468e-7,0.00009062819,0.00007586906,0.0011006346,0.9810781,0.016921027,0.0001299929],"about_ca_topic_score_codex":0.000045201614,"about_ca_topic_score_gemma":1.9671518e-7,"teacher_disagreement_score":0.14140439,"about_ca_system_score_codex":0.000010096746,"about_ca_system_score_gemma":0.000009836747,"threshold_uncertainty_score":0.44720462},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9815232,0.0002058416,0.008489982,0.003638344,0.0025195135,0.00012119997,0.0000013480834,0.00010657013,0.0033939835],"genre_scores_gemma":[0.99872553,0.000024345947,0.0006783816,0.00050360727,6.3472e-7,0.000014902771,5.8349707e-7,0.000006794326,0.000045190427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989136,0.00005947989,0.00021748712,0.00027935475,0.00034117748,0.00018892899],"domain_scores_gemma":[0.99746704,0.00026733457,0.00026052387,0.0017644323,0.0001771014,0.00006358017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004204203,0.00012274855,0.00013919732,0.00010086534,0.00069963734,0.00019733261,0.0017105368,0.00005863623,0.000007733122],"category_scores_gemma":[0.0001576535,0.000085413616,0.00008863511,0.00024851013,0.00021913127,0.00031176922,0.00029226573,0.000113636896,0.00001701814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025850893,0.00005778917,0.0015899495,0.0000017299626,0.000014642021,0.0000019274141,0.00004313178,0.00003574642,0.00033464684,0.995537,0.0017237535,0.000657095],"study_design_scores_gemma":[0.00025020784,0.000091669215,0.0071132057,0.000032027492,0.0000050855388,0.0000018347035,0.0000054914335,0.0015788302,0.0030290582,0.98775685,0.000031463802,0.0001042679],"about_ca_topic_score_codex":0.00030137599,"about_ca_topic_score_gemma":0.00008104772,"teacher_disagreement_score":0.017202342,"about_ca_system_score_codex":0.00000897776,"about_ca_system_score_gemma":0.00005690803,"threshold_uncertainty_score":0.53811157},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9860255,0.000034493794,0.004123086,0.0004566063,0.0014507466,0.00023575354,0.000002613392,0.000101060046,0.0075701],"genre_scores_gemma":[0.9899912,0.000020088879,0.009539871,0.000027832413,0.0000043448645,0.000021559057,0.0000020074347,0.000012806893,0.00038031695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985452,0.00015098635,0.00023570532,0.00033851987,0.00042787998,0.0003016496],"domain_scores_gemma":[0.9976476,0.00011908405,0.00026690253,0.0016253255,0.0002380334,0.00010305362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005920255,0.00013334135,0.00022277578,0.00010340717,0.0003579652,0.00015421616,0.0018927688,0.00006612775,0.000027565302],"category_scores_gemma":[0.00025416177,0.00013021586,0.00011460322,0.00019364074,0.00022715575,0.0008762438,0.00050106295,0.00012752344,0.000059534614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019824889,0.00006335223,0.0074314917,0.000010523271,0.000020743817,0.000012340046,0.00017707504,0.0000020476223,0.0030076415,0.9842056,0.00027158362,0.0047777845],"study_design_scores_gemma":[0.001328107,0.00004584886,0.018096145,0.00001643752,0.0000042222396,0.0000074590625,0.000009305263,0.0013092345,0.011064722,0.96767515,0.00029613,0.00014723596],"about_ca_topic_score_codex":0.000039315266,"about_ca_topic_score_gemma":0.0000032793007,"teacher_disagreement_score":0.01653044,"about_ca_system_score_codex":0.000031249965,"about_ca_system_score_gemma":0.00004560301,"threshold_uncertainty_score":0.53100485},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9837037,0.000045831053,0.005677306,0.0012594057,0.0014048924,0.00021771001,7.9869835e-7,0.00009569453,0.007594685],"genre_scores_gemma":[0.9975976,0.000011076789,0.002175527,0.000030268535,0.0000021547658,0.000021651826,9.498659e-7,0.000007906969,0.00015291097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988102,0.00009166235,0.00015334805,0.00033245367,0.00029761807,0.0003147611],"domain_scores_gemma":[0.99843436,0.00011602026,0.000086554,0.0012067836,0.000072169794,0.000084095176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005723822,0.00009837126,0.00013317155,0.00018948552,0.0002804847,0.00023434979,0.0019687028,0.00006195186,0.0000060648704],"category_scores_gemma":[0.00033007492,0.000100171055,0.000046927966,0.00022518617,0.00014780996,0.0009861229,0.0005139017,0.00022560233,0.0000597927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071135337,0.00006212749,0.010563482,0.0000031168358,0.0000029196606,0.00003012815,0.00007882153,0.0000036149875,0.00031546818,0.978816,0.000053067786,0.010064179],"study_design_scores_gemma":[0.0007198112,0.00004064826,0.0802746,0.000011769341,5.9994915e-7,0.0000032089756,0.0000055557175,0.009070451,0.0006612702,0.90898407,0.00012047626,0.00010753644],"about_ca_topic_score_codex":0.000025862544,"about_ca_topic_score_gemma":0.000021689297,"teacher_disagreement_score":0.069831885,"about_ca_system_score_codex":0.00006664387,"about_ca_system_score_gemma":0.00003476891,"threshold_uncertainty_score":0.4084857},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8789096,0.002334149,0.041089065,0.019957287,0.043657705,0.0019315026,0.0000074150125,0.0009468036,0.011166467],"genre_scores_gemma":[0.9988135,0.000015858503,0.00068706623,0.00008795516,0.0000032051794,0.0000611701,0.0000011678216,0.000010500313,0.0003195809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891245,0.000028686116,0.0001916963,0.00033068022,0.00022803835,0.000308416],"domain_scores_gemma":[0.99783725,0.0001612515,0.00018756586,0.0015868726,0.0001472192,0.00007982405],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00068982464,0.00012989466,0.00012200983,0.000036502355,0.0021781784,0.00069886533,0.001320254,0.000057381116,0.0000017280405],"category_scores_gemma":[0.00014061651,0.000084768275,0.00013327351,0.000079879814,0.00013700576,0.00037104834,0.0002985595,0.00010897085,0.000028063963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012854061,0.000033794393,0.0012130046,0.0000034194109,0.00001977095,8.152429e-7,0.000034948855,0.0000032413052,0.00020986077,0.98009086,0.0028239868,0.015553452],"study_design_scores_gemma":[0.0006554188,0.00014106996,0.010260898,0.000012893221,0.000011480725,0.0000021655899,0.0000053116664,0.0071156085,0.00026621303,0.9777289,0.0036761516,0.00012390755],"about_ca_topic_score_codex":0.00003711297,"about_ca_topic_score_gemma":0.000041184634,"teacher_disagreement_score":0.11990389,"about_ca_system_score_codex":0.0000113406595,"about_ca_system_score_gemma":0.000033953987,"threshold_uncertainty_score":0.99912083},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99085,0.00036103936,0.00001993637,0.000023809307,0.0011562054,0.00006670093,0.0000032913626,0.0000624669,0.007456589],"genre_scores_gemma":[0.99984807,0.000030704556,0.00006508126,0.0000040561717,0.0000034779425,0.000008543658,0.000001882248,0.000012203124,0.000026000198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996216,0.000015700565,0.000121913814,0.00008095793,0.000059215992,0.00010059735],"domain_scores_gemma":[0.9995148,0.000025516958,0.00003859069,0.00034630942,0.000022347642,0.000052397223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010145032,0.00007820474,0.00013202711,0.00004828889,0.00017914268,0.00003704495,0.00016802781,0.00004882746,0.000009395517],"category_scores_gemma":[0.000011163524,0.000081463506,0.000039051803,0.0000379304,0.00008292439,0.00012345673,0.00003337564,0.00006513068,0.000009961085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036994172,0.000028044897,0.008863854,0.00008005389,0.000046664918,0.0000031689478,0.00038963667,0.000021669337,0.007733456,0.98172885,0.00050173,0.0005991568],"study_design_scores_gemma":[0.00049937825,0.00004765629,0.026185837,0.00006640305,0.000018892666,0.0000062234803,0.00007484582,0.00038390496,0.012889824,0.95893186,0.00075061317,0.00014456021],"about_ca_topic_score_codex":0.000035211116,"about_ca_topic_score_gemma":0.00000941294,"teacher_disagreement_score":0.022797003,"about_ca_system_score_codex":0.000006929966,"about_ca_system_score_gemma":0.0000032836983,"threshold_uncertainty_score":0.33219853},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99392426,0.000072091796,0.00004255748,0.00087679614,0.0012011379,0.00021358186,0.0000029282312,0.000033324788,0.0036333117],"genre_scores_gemma":[0.999481,0.000008307941,0.00030514467,0.00014196747,7.7618824e-7,0.000015704081,5.691e-7,0.000007802835,0.000038728696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987697,0.00006669537,0.00027287012,0.00027860835,0.00039807628,0.00021405732],"domain_scores_gemma":[0.9976858,0.00020933799,0.00040424295,0.0014452549,0.00020100859,0.000054336047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045592207,0.00013311741,0.00022742449,0.000084653126,0.00033415997,0.000097365504,0.001448847,0.00007020999,0.0000046949913],"category_scores_gemma":[0.00018343369,0.000091013535,0.00012442768,0.00015096083,0.00032651966,0.00020824879,0.00033775455,0.0001386362,0.00001339196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017146385,0.00017978744,0.00958913,0.000007925518,0.00004181641,0.0000021354858,0.00037081077,0.0000021142894,0.0044986224,0.98426765,0.00047926023,0.00054361264],"study_design_scores_gemma":[0.000745195,0.0002681866,0.064794004,0.00009167937,0.000010741406,0.0000010397114,0.000020356489,0.00077894074,0.036705017,0.8963581,0.00011480569,0.000111944435],"about_ca_topic_score_codex":0.00012391084,"about_ca_topic_score_gemma":0.00000733897,"teacher_disagreement_score":0.08790955,"about_ca_system_score_codex":0.000011981703,"about_ca_system_score_gemma":0.000053163967,"threshold_uncertainty_score":0.37114245},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95758367,0.0028293938,0.00005781906,0.0030909711,0.01600139,0.00049178494,0.0000083647055,0.00034816243,0.019588424],"genre_scores_gemma":[0.9930515,0.0001425092,0.0010237674,0.00027475067,0.00000720089,0.000006735924,0.000006951614,0.0000491669,0.0054374104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969683,0.0001440626,0.00041913934,0.00095283746,0.0007101807,0.00080542674],"domain_scores_gemma":[0.9953473,0.000109280765,0.00052457594,0.0030576251,0.00059825054,0.00036293757],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005836625,0.00045483798,0.00049201923,0.00015684377,0.0013126727,0.0015437654,0.0023377645,0.00022026422,0.000095150324],"category_scores_gemma":[0.00020559001,0.00039353792,0.00012415013,0.00037981194,0.00046688545,0.000799591,0.000753889,0.00046305318,0.0013685134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093857954,0.00039307695,0.0108909095,0.00007788167,0.00013292719,0.00023999152,0.0008626264,0.000011589772,0.0011166283,0.9684589,0.01598617,0.001735477],"study_design_scores_gemma":[0.0051924763,0.002214543,0.021452619,0.00079524243,0.00014945035,0.000075070675,0.000115209405,0.002904511,0.0046919095,0.94804215,0.012895983,0.0014708295],"about_ca_topic_score_codex":0.00045913702,"about_ca_topic_score_gemma":0.000039960578,"teacher_disagreement_score":0.03546782,"about_ca_system_score_codex":0.000052633284,"about_ca_system_score_gemma":0.0002950308,"threshold_uncertainty_score":0.9999875},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8096148,0.0013814088,0.0014837295,0.0054900604,0.03443611,0.001593384,0.000041489984,0.00043933268,0.1455197],"genre_scores_gemma":[0.9950156,0.0002019026,0.00037028038,0.00030367443,0.000029914287,0.00003436413,0.0000027676233,0.000057317717,0.0039841393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99563694,0.0003613821,0.0004438269,0.001194775,0.0010691066,0.0012939582],"domain_scores_gemma":[0.99259835,0.0009195492,0.0005412279,0.005016347,0.0003798249,0.0005446776],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013896809,0.0004964243,0.00056796276,0.0003329819,0.0025307925,0.0017295055,0.0055716075,0.00027485215,0.00016470916],"category_scores_gemma":[0.0013520041,0.00050925347,0.00029162737,0.0004061707,0.0008537902,0.0017808975,0.0013107021,0.0011415508,0.0020043203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119977965,0.0004715586,0.0017952285,0.00003032916,0.000085599684,0.00022946525,0.000228215,0.000007874732,0.0003846398,0.978483,0.005461822,0.01270228],"study_design_scores_gemma":[0.00244506,0.0007096953,0.009916693,0.00015233915,0.00001808715,0.000014794771,0.000021550388,0.0012758259,0.0037512518,0.97580254,0.005340267,0.00055187516],"about_ca_topic_score_codex":0.000084151674,"about_ca_topic_score_gemma":0.000011190055,"teacher_disagreement_score":0.18540087,"about_ca_system_score_codex":0.00014677586,"about_ca_system_score_gemma":0.00025453817,"threshold_uncertainty_score":0.9998087},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.994789,0.00022510008,0.00018083736,0.00021236685,0.0029250584,0.00011872744,0.0000028038762,0.000058881073,0.0014872068],"genre_scores_gemma":[0.99845093,0.000020185902,0.0013058594,0.00007212036,0.0000013137857,0.0000062401336,8.7208736e-7,0.000010364928,0.0001321026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879444,0.000037889877,0.00021375359,0.0003827557,0.00028005868,0.00029110294],"domain_scores_gemma":[0.99836874,0.0000894339,0.00020057755,0.0011431279,0.00007230951,0.00012581443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029735768,0.00015104793,0.00022416434,0.00011135579,0.00032938927,0.00020502355,0.0007104453,0.000064653774,0.00000732329],"category_scores_gemma":[0.000070802496,0.00013416029,0.000066019464,0.00009092287,0.00016331105,0.00061055645,0.00031083787,0.0001409202,0.000011942843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008339704,0.00010876817,0.0036223,0.00000889059,0.000020550662,0.0000062575805,0.000076984594,0.0000106295565,0.00051964185,0.99378955,0.0007528193,0.0010752438],"study_design_scores_gemma":[0.0011551109,0.0003462753,0.0047950777,0.000055095104,0.000009948513,0.0000022411375,0.0000074156715,0.001266156,0.0040824986,0.98800755,0.00010263842,0.00016998587],"about_ca_topic_score_codex":0.00009198828,"about_ca_topic_score_gemma":0.0000017466241,"teacher_disagreement_score":0.005782017,"about_ca_system_score_codex":0.000012985875,"about_ca_system_score_gemma":0.000027908336,"threshold_uncertainty_score":0.54708976},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98259884,0.00013110576,0.0019883972,0.0002764921,0.00199645,0.00027116892,0.000004209391,0.00011423563,0.012619086],"genre_scores_gemma":[0.9969138,0.0000219552,0.0025876926,0.000030484754,0.0000046084797,0.000016021857,9.1065095e-7,0.000015151876,0.00040938848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983012,0.000090658126,0.00024781708,0.00042956555,0.00050999626,0.0004207587],"domain_scores_gemma":[0.9969143,0.00014117784,0.0002659265,0.0022915544,0.00022486843,0.00016217426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053175737,0.00017100133,0.00029775404,0.00014711433,0.00044472935,0.0001794719,0.003327958,0.00008155667,0.0000128130505],"category_scores_gemma":[0.0003537239,0.0001638596,0.000121646655,0.00026318338,0.00036574248,0.0008580605,0.0008481538,0.00023316806,0.000032022213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017447583,0.00009484067,0.038124412,0.00001681122,0.00002397308,0.000012941493,0.0001380267,6.6095487e-7,0.0012834746,0.9561145,0.00036711417,0.0038058457],"study_design_scores_gemma":[0.0007522088,0.00013537896,0.041461956,0.000027501823,0.0000057411717,0.000004126973,0.000009434209,0.0007817945,0.010546242,0.9456568,0.00043572873,0.00018308473],"about_ca_topic_score_codex":0.00014818368,"about_ca_topic_score_gemma":0.000018277584,"teacher_disagreement_score":0.014314931,"about_ca_system_score_codex":0.000036332403,"about_ca_system_score_gemma":0.000075734686,"threshold_uncertainty_score":0.6682001},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98012835,0.000055293716,0.000009859727,0.0017283316,0.0004216929,0.00042087038,0.000016057102,0.000056286193,0.01716328],"genre_scores_gemma":[0.99860424,0.000040128616,0.000092723334,0.00012697662,0.000008105629,0.000021214457,0.0000016131919,0.000015127819,0.0010898756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893004,0.00012513952,0.00030047176,0.00017796013,0.0002793216,0.00018705164],"domain_scores_gemma":[0.99764234,0.001050588,0.00020628967,0.0009854506,0.000056379864,0.000058965088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029756845,0.00013351096,0.00015753522,0.000057883066,0.00036146076,0.000010534306,0.0006035178,0.00006112135,0.000029997665],"category_scores_gemma":[0.00038946222,0.00007326149,0.00019716455,0.0008657203,0.00016541498,0.0000368979,0.0000671212,0.00020564318,0.00002581634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024736864,0.00015435462,0.0009166989,0.000004915731,0.000026971114,7.4905904e-7,0.0004958738,9.999482e-7,0.00009005962,0.9533042,0.04487533,0.00010511942],"study_design_scores_gemma":[0.00055711885,0.000039723876,0.006768584,0.000027951439,0.000025905143,0.000004162218,0.00006406173,0.000004126023,0.0060629677,0.9820676,0.0042912173,0.00008657987],"about_ca_topic_score_codex":0.000023393928,"about_ca_topic_score_gemma":0.000003854572,"teacher_disagreement_score":0.040584113,"about_ca_system_score_codex":0.000010896148,"about_ca_system_score_gemma":0.000045113142,"threshold_uncertainty_score":0.2987517},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9374224,0.00015107705,0.000008357336,0.0017626783,0.004590779,0.00015924116,0.0000023057942,0.00009810665,0.05580505],"genre_scores_gemma":[0.99658906,0.000027429554,0.00005448004,0.0010260125,0.00018560208,0.000018292809,0.000011832311,0.000028011125,0.002059302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989036,0.0000063683956,0.00023953312,0.00028422702,0.0002643539,0.0003019428],"domain_scores_gemma":[0.9984946,0.000011763609,0.0005853279,0.000764967,0.0001252801,0.00001800943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019067412,0.00018494505,0.00022048492,0.00005938536,0.0008186733,0.00079531374,0.0007337241,0.000069494585,0.00028251475],"category_scores_gemma":[0.00018889939,0.00018116384,0.00009041568,0.00011023512,0.00007759972,0.0014295367,0.00029054927,0.000138905,0.00060666073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000550908,0.0001651205,0.0923838,0.000047619887,0.000037414782,0.0000588098,0.000019204885,0.000003923977,0.000747082,0.8456934,0.056167483,0.0046210247],"study_design_scores_gemma":[0.0023802966,0.000011808125,0.12220574,0.000053881377,0.000039347302,0.0000017882396,0.00001454668,0.00049630506,0.0001925701,0.4959208,0.3782934,0.0003895107],"about_ca_topic_score_codex":0.0020073752,"about_ca_topic_score_gemma":0.0001895353,"teacher_disagreement_score":0.34977263,"about_ca_system_score_codex":0.00004062559,"about_ca_system_score_gemma":0.000019711308,"threshold_uncertainty_score":0.7797599},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9631266,0.000011212885,0.000036647543,0.0012160571,0.00032840413,0.00018665347,0.000009866573,0.000028194698,0.035056364],"genre_scores_gemma":[0.99943584,0.000007615549,0.00016961191,0.000036183752,0.0000047580343,0.000024077715,7.154152e-7,0.000010795902,0.00031039873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945337,0.00003567132,0.00013892785,0.000117762334,0.00012884736,0.00012541286],"domain_scores_gemma":[0.99832743,0.00036785592,0.00019146553,0.0010483166,0.000035206096,0.000029732531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028299884,0.00008411144,0.0001228144,0.000018056755,0.00039485976,0.000031453445,0.00052858266,0.00003529985,0.000043031803],"category_scores_gemma":[0.0002561224,0.00005825239,0.000085761276,0.00005586966,0.00020252858,0.0000474895,0.000040965235,0.00012189237,0.000026746096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010605763,0.00011343832,0.00057260745,0.000010116395,0.000012156812,7.1863326e-7,0.00014859282,1.0575082e-7,0.00042115126,0.99661887,0.001999541,0.00009212095],"study_design_scores_gemma":[0.00020176933,0.000030902356,0.003646659,0.000027067732,0.000014554874,5.281636e-7,0.00002412692,0.000009413843,0.009036448,0.98606265,0.0008787177,0.000067188084],"about_ca_topic_score_codex":0.000005934551,"about_ca_topic_score_gemma":0.000006192107,"teacher_disagreement_score":0.036309242,"about_ca_system_score_codex":0.000008300799,"about_ca_system_score_gemma":0.00000960132,"threshold_uncertainty_score":0.30369818},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94758135,0.000020537404,0.00027822456,0.001571302,0.0032230592,0.00057900994,0.000004829911,0.00010568325,0.04663602],"genre_scores_gemma":[0.9972999,0.0000050666076,0.001981024,0.00004592943,0.000018550894,0.000041812855,4.967367e-7,0.000051826377,0.0005553791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984593,0.00008567669,0.00042205086,0.00024104999,0.0004906072,0.00030131786],"domain_scores_gemma":[0.9948883,0.0017301805,0.0007217678,0.0024149145,0.0001670093,0.00007781728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006172868,0.00023724156,0.00042070745,0.00004747174,0.00052459585,0.000082933315,0.0013044123,0.00010271969,0.00007357848],"category_scores_gemma":[0.0056092083,0.00016725826,0.00014968826,0.00008303016,0.00026047727,0.00015188368,0.00018407851,0.00029582248,0.000076085766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021355072,0.00026288093,0.000081716775,0.000053556054,0.000043348566,0.0000047380045,0.00034733964,4.6352002e-7,0.00083351665,0.9961335,0.0020658458,0.00015171962],"study_design_scores_gemma":[0.0007661028,0.00015486978,0.00011977578,0.00014240954,0.000034475925,0.000003131157,0.00008628442,0.000021898672,0.017121537,0.9806547,0.00071746926,0.00017733536],"about_ca_topic_score_codex":0.000020830914,"about_ca_topic_score_gemma":0.0000053596987,"teacher_disagreement_score":0.049718577,"about_ca_system_score_codex":0.000056686466,"about_ca_system_score_gemma":0.000047594152,"threshold_uncertainty_score":0.68205935},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98069715,0.0000428163,0.00015951936,0.00024503595,0.00040842293,0.00014981173,0.000009329038,0.00004432824,0.018243574],"genre_scores_gemma":[0.99850965,0.000009048713,0.00077969424,0.0000078107405,0.000007887197,0.000017022066,0.0000015963236,0.000013549452,0.000653756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938303,0.000025154206,0.00018466488,0.0001406009,0.00011790826,0.00014864314],"domain_scores_gemma":[0.998586,0.00013954546,0.00022798472,0.000952538,0.000042567637,0.000051357274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020578923,0.00009156072,0.0001841519,0.00002258148,0.00026006985,0.000030756975,0.00047096272,0.00004551902,0.00004553089],"category_scores_gemma":[0.00019966144,0.00008752344,0.00008104266,0.00004849763,0.00017841894,0.00009605955,0.000050153394,0.000092740185,0.000023914294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009328937,0.00022834272,0.0032004188,0.000020124087,0.000018268247,0.0000018771362,0.00014035813,8.1720856e-8,0.0005668571,0.9942364,0.00131232,0.00026560648],"study_design_scores_gemma":[0.00040979506,0.000036323527,0.008708818,0.000023260258,0.0000203419,0.0000015996719,0.000031727668,0.000016432836,0.006034931,0.9833481,0.0012743297,0.000094347815],"about_ca_topic_score_codex":0.000018001958,"about_ca_topic_score_gemma":0.000017828623,"teacher_disagreement_score":0.017812472,"about_ca_system_score_codex":0.000013893662,"about_ca_system_score_gemma":0.000015945277,"threshold_uncertainty_score":0.35691023},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946191,0.00024712365,0.00012504238,0.00015548569,0.0014894285,0.00006248896,0.0000013400506,0.000045517005,0.0032544858],"genre_scores_gemma":[0.99583435,0.000015965721,0.0040407646,0.000026849848,5.1230876e-7,0.0000021765202,4.0127875e-7,0.0000057399607,0.0000732186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991631,0.000024306619,0.00023054625,0.0002034209,0.00022345908,0.00015516538],"domain_scores_gemma":[0.99836326,0.0000442789,0.00032041562,0.0010258821,0.00018785153,0.00005833673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030652471,0.000088133835,0.00020083532,0.000089312605,0.00014374284,0.000050077666,0.0010685364,0.00004112243,0.0000055404494],"category_scores_gemma":[0.00008396759,0.000080353115,0.00007953265,0.00013234279,0.00014293735,0.00023356883,0.00028386136,0.000070845876,0.000011948727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024028684,0.00005833518,0.006456926,0.000014690182,0.000018224759,0.0000025078657,0.00017501393,0.000010037216,0.0041231937,0.98698705,0.00045905024,0.0016925656],"study_design_scores_gemma":[0.0006157818,0.00008383342,0.003592837,0.000040507908,0.000008624671,0.0000023304453,0.0000036067881,0.0011446021,0.03170342,0.96260655,0.00010793119,0.00008996098],"about_ca_topic_score_codex":0.00018046271,"about_ca_topic_score_gemma":0.0000022394368,"teacher_disagreement_score":0.027580224,"about_ca_system_score_codex":0.0000044630033,"about_ca_system_score_gemma":0.000034333127,"threshold_uncertainty_score":0.32767048},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99508226,0.00001604651,0.0007074308,0.00020618853,0.00020486998,0.000115801995,0.000018825927,0.000019928577,0.003628676],"genre_scores_gemma":[0.99967796,0.0000068890395,0.0000099325225,0.000009822377,0.000014939485,0.000012909497,0.000060838443,0.000009556437,0.0001971329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994364,0.000036516907,0.00016812648,0.000118721684,0.000112350426,0.00012790938],"domain_scores_gemma":[0.9990267,0.00003942402,0.00030596094,0.00050079526,0.00009855681,0.000028563858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012209563,0.00008806628,0.00013612182,0.000021688027,0.0004337261,0.000099012206,0.00038820328,0.000022568274,0.000025284546],"category_scores_gemma":[0.0000063429434,0.00006908971,0.000079354504,0.00006779853,0.00010281131,0.00012875789,0.00010945524,0.00008532685,0.0000033238625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001528396,0.00010350238,0.2167308,0.0000016648415,0.00014642993,2.1009767e-7,0.0000917697,3.7969156e-7,0.024063367,0.74442065,0.0024153113,0.012010601],"study_design_scores_gemma":[0.0004643126,0.000056056484,0.32745764,0.000030015432,0.000053618696,1.1269387e-7,0.000033898563,0.0004991809,0.056111973,0.61243474,0.0026585162,0.00019993383],"about_ca_topic_score_codex":0.0002348132,"about_ca_topic_score_gemma":0.000002951272,"teacher_disagreement_score":0.13198595,"about_ca_system_score_codex":0.000008395361,"about_ca_system_score_gemma":0.000012695009,"threshold_uncertainty_score":0.33359143},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99214554,0.00006942361,0.0002916438,0.0008050714,0.00090827735,0.00085665344,0.000030964828,0.00009934952,0.0047931066],"genre_scores_gemma":[0.99804586,0.000013528108,0.00084306597,0.00009794873,0.000027118414,0.00034090056,0.0000086923465,0.00003067929,0.00059219985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908435,0.00006156046,0.00019910843,0.00023025347,0.00014097341,0.0002837727],"domain_scores_gemma":[0.99741364,0.0006592101,0.00018808329,0.0015566212,0.000093376904,0.000089086505],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00083615404,0.00015010059,0.00019412138,0.00003520194,0.0024039545,0.00027687228,0.00094141753,0.0000817173,0.000047199224],"category_scores_gemma":[0.00023991457,0.0001111191,0.00012972002,0.00006776024,0.00019998949,0.00023767391,0.00006225922,0.00014263486,0.00004447083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001621053,0.00022248054,0.0032943813,0.000017412081,0.000043888926,4.6385733e-7,0.00019317871,0.0000011728639,0.00022417837,0.99111086,0.004665816,0.00020992655],"study_design_scores_gemma":[0.0006090597,0.00005419122,0.0054351334,0.000011812973,0.00006314346,0.00000212205,0.00012509918,0.00017528357,0.0015670634,0.9741711,0.017632069,0.00015394967],"about_ca_topic_score_codex":0.00003722321,"about_ca_topic_score_gemma":0.000044448243,"teacher_disagreement_score":0.016939817,"about_ca_system_score_codex":0.000014622836,"about_ca_system_score_gemma":0.00002956659,"threshold_uncertainty_score":0.99889475},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9813058,0.0003013881,0.0002518047,0.0012192148,0.0030870766,0.00013227279,0.0000016227514,0.00014690752,0.01355393],"genre_scores_gemma":[0.9964871,0.000019137178,0.0031592888,0.00011268913,6.890628e-7,0.000004452735,6.9808203e-7,0.000008445209,0.00020752745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881035,0.000046954,0.0002585421,0.00032309451,0.00030151504,0.00025954554],"domain_scores_gemma":[0.99774456,0.000053471857,0.00028038112,0.0016391454,0.00016978492,0.00011266167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040196444,0.00013198135,0.00022068492,0.00011666902,0.00029442605,0.00016789138,0.0015328481,0.00007430557,0.000007615016],"category_scores_gemma":[0.000120926845,0.00011920191,0.00010789454,0.0001729196,0.00016698135,0.00037723023,0.00041206114,0.00013590872,0.000065090724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025196057,0.00007856667,0.0048659965,0.000010482255,0.000014674791,0.000009377222,0.00009492907,0.0000023199984,0.0016378635,0.9884095,0.0023456926,0.0025280707],"study_design_scores_gemma":[0.0007389027,0.0000981637,0.010603466,0.000038845857,0.0000070000046,0.000005843712,0.0000047400868,0.0016492907,0.005027971,0.9812293,0.0004507784,0.00014571371],"about_ca_topic_score_codex":0.00012599831,"about_ca_topic_score_gemma":0.000005073031,"teacher_disagreement_score":0.01518129,"about_ca_system_score_codex":0.00001003393,"about_ca_system_score_gemma":0.000054577242,"threshold_uncertainty_score":0.4860913},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.979258,0.00032914378,0.000003971539,0.000016256283,0.013915105,0.0001901726,0.0000051735624,0.00012760962,0.0061545763],"genre_scores_gemma":[0.9997445,0.00006319625,0.000008689344,0.0000024083915,0.000025520276,0.00002402404,0.0000014882692,0.000034869307,0.00009533816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989302,0.00007060831,0.00034091223,0.0001469019,0.00021246624,0.00029891246],"domain_scores_gemma":[0.99850816,0.00012381416,0.00016563604,0.0010519777,0.00007565466,0.00007478478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005382329,0.00017569795,0.00028642474,0.00003637578,0.0006016136,0.00011078833,0.0008264806,0.00012117151,0.0000069106327],"category_scores_gemma":[0.0001651988,0.00013824122,0.00011169093,0.00008024525,0.00019593032,0.00015508471,0.00006055648,0.00016646468,0.000029407553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078130644,0.00006871062,0.022420514,0.00010366614,0.00014773187,0.000024964935,0.00046621554,0.000030219255,0.0063196067,0.9644753,0.0020151276,0.0038498596],"study_design_scores_gemma":[0.002266976,0.0001569971,0.020065594,0.00013705216,0.00005105913,0.000014184125,0.00015725446,0.0023147487,0.06404012,0.9022752,0.008073422,0.000447377],"about_ca_topic_score_codex":0.000037610433,"about_ca_topic_score_gemma":0.000008756902,"teacher_disagreement_score":0.062200032,"about_ca_system_score_codex":0.000028244322,"about_ca_system_score_gemma":0.000017674409,"threshold_uncertainty_score":0.5637313},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97467595,0.000027097121,0.000023445533,0.00008591057,0.0007311027,0.00040719227,0.000018481594,0.00003188315,0.023998957],"genre_scores_gemma":[0.9967461,0.0000325575,0.0017325577,0.000017095046,0.0000075171492,0.000021151582,0.0000021809606,0.00004646768,0.0013943253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979643,0.00011609496,0.00048182218,0.0003181883,0.0007286039,0.00039098985],"domain_scores_gemma":[0.99539,0.001648993,0.0005385073,0.0018296164,0.00047551154,0.0001173989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011172115,0.00021764802,0.0005512006,0.00038958047,0.00019834943,0.000042959586,0.001245365,0.0001637639,0.00014107644],"category_scores_gemma":[0.00580081,0.00017843202,0.00014235146,0.0007542187,0.00035635295,0.00015214349,0.00032913004,0.00033201525,0.00006743939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035046416,0.00074003823,0.0028586558,0.00054595416,0.00008347832,0.000031849566,0.0005803697,7.7957134e-7,0.003270256,0.9885766,0.001677399,0.0012841809],"study_design_scores_gemma":[0.0019704038,0.0008135426,0.0041958136,0.0002858071,0.00004240298,0.000005231693,0.00008339015,0.00023243547,0.027496627,0.9644862,0.00016443396,0.0002237334],"about_ca_topic_score_codex":0.00007947537,"about_ca_topic_score_gemma":0.000012112009,"teacher_disagreement_score":0.024226371,"about_ca_system_score_codex":0.000052951516,"about_ca_system_score_gemma":0.00013924087,"threshold_uncertainty_score":0.72762465},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99296635,0.000033876644,0.0000040443138,0.00055995205,0.00032082002,0.0002392925,0.000017650387,0.000009226029,0.0058487765],"genre_scores_gemma":[0.9997743,0.000010610985,0.00006670791,0.000030243402,0.0000036407107,0.0000061007127,5.2855637e-7,0.00001336729,0.00009449558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894935,0.00012819437,0.00034253937,0.000118978176,0.0003281946,0.00013274663],"domain_scores_gemma":[0.9967215,0.00092591316,0.00084561674,0.0013498763,0.00013249749,0.00002457619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006691113,0.000118885415,0.00034081872,0.000031248437,0.00022998192,0.000015532949,0.00095142436,0.00006212249,0.000014045571],"category_scores_gemma":[0.0012276329,0.000069155845,0.00015767002,0.000067580644,0.00053006737,0.00006457344,0.00015781626,0.00017537955,0.0000016330619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021428461,0.0001696025,0.007505046,0.000092942166,0.00008031013,6.386185e-7,0.0015290072,7.3263413e-7,0.00089780195,0.98778075,0.0018641544,0.000057573063],"study_design_scores_gemma":[0.00038917735,0.00007385055,0.034594197,0.00020406103,0.000034046512,6.857641e-7,0.00020083862,0.000009702841,0.08959713,0.8747946,0.000040343304,0.00006135131],"about_ca_topic_score_codex":0.00020230096,"about_ca_topic_score_gemma":0.000020513366,"teacher_disagreement_score":0.11298614,"about_ca_system_score_codex":0.0000126167915,"about_ca_system_score_gemma":0.000027554552,"threshold_uncertainty_score":0.28200936},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952488,0.00013899404,0.00007369012,0.0016136831,0.0008547149,0.0002119764,0.0000032316084,0.000030517107,0.0018244128],"genre_scores_gemma":[0.9986554,0.00001217709,0.0010531207,0.00007964184,7.718025e-7,0.00001104197,2.6528312e-7,0.000008807038,0.00017877448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987772,0.00007823325,0.000271464,0.00022755373,0.00043102526,0.00021448484],"domain_scores_gemma":[0.997061,0.00014462048,0.00047743856,0.002014315,0.00025189458,0.00005072202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003827079,0.00013287584,0.00020106905,0.000026281738,0.0006041177,0.00011716404,0.0019237649,0.000054372034,0.0000057166785],"category_scores_gemma":[0.0000903223,0.00006818556,0.000112533184,0.00023721808,0.00039043627,0.00017418076,0.00039490077,0.00012894871,0.000012491675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010724202,0.00009851639,0.024067977,0.000041484192,0.000064502194,0.0000029717442,0.0012026047,0.000008181326,0.00022330659,0.9705428,0.0024919694,0.001244987],"study_design_scores_gemma":[0.00079103303,0.000101293896,0.022288928,0.00016430064,0.000021336475,0.0000107058795,0.00006342933,0.00087119295,0.005906929,0.96955603,0.000110435816,0.00011440865],"about_ca_topic_score_codex":0.000314505,"about_ca_topic_score_gemma":0.00003498256,"teacher_disagreement_score":0.005683622,"about_ca_system_score_codex":0.000008708171,"about_ca_system_score_gemma":0.0000750226,"threshold_uncertainty_score":0.46464458},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99222803,0.00063842017,0.000009491461,0.0030169624,0.0025537796,0.0001520264,0.0000041592866,0.00014813502,0.0012489883],"genre_scores_gemma":[0.9979964,0.00026872443,0.0011469091,0.0003572205,0.000008179787,0.0000048296065,0.0000020653338,0.00001296181,0.00020270707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845856,0.00006551237,0.0002580341,0.00061269896,0.00028985745,0.0003153576],"domain_scores_gemma":[0.9982318,0.00011599096,0.00020934407,0.0011416476,0.000093250506,0.00020791948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007569331,0.00018949332,0.00022926471,0.00009024483,0.0007677256,0.0005519371,0.0006541832,0.00010280885,8.211592e-7],"category_scores_gemma":[0.00021502204,0.00017078333,0.00003785143,0.00007347073,0.00017609759,0.00048114665,0.00050350936,0.00023330994,0.000021534264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041158495,0.000045545898,0.00044422393,0.000010161571,0.00001908512,0.000023022165,0.0005464416,0.0000015519922,0.0006403897,0.9899822,0.0021936628,0.0060525406],"study_design_scores_gemma":[0.0031527,0.00038732108,0.0057886806,0.00010354712,0.0000142318295,0.00001312118,0.000013445925,0.0031915607,0.0020600893,0.98424745,0.00072238425,0.0003054457],"about_ca_topic_score_codex":0.000134774,"about_ca_topic_score_gemma":0.000013781242,"teacher_disagreement_score":0.005768365,"about_ca_system_score_codex":0.000016341324,"about_ca_system_score_gemma":0.000036288722,"threshold_uncertainty_score":0.6964342},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950339,0.00014405977,0.0016429394,0.0010642522,0.0005412638,0.00037549945,0.000013860556,0.000094892814,0.0010893295],"genre_scores_gemma":[0.9944501,0.000071161456,0.005257039,0.00011181039,0.0000052678884,0.000024947896,0.0000013862109,0.000022997518,0.000055281234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978447,0.00010291052,0.00026708274,0.0006401529,0.0006275535,0.0005176046],"domain_scores_gemma":[0.99728864,0.00023566949,0.00021987734,0.0017320563,0.00018418353,0.00033957383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004651455,0.00025571405,0.0003863796,0.00022196413,0.00054428773,0.0002533165,0.0020167397,0.00008013071,0.0000047051662],"category_scores_gemma":[0.00019549656,0.00022210885,0.000064367334,0.00031034267,0.00046539845,0.0006696374,0.00066939957,0.00024681864,0.00001192853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013932068,0.00014340767,0.035319757,0.000035409153,0.00004452441,0.000040472954,0.00037033617,0.0000064161304,0.002148438,0.9541915,0.0002596512,0.007300737],"study_design_scores_gemma":[0.0013372161,0.00046761468,0.28021273,0.00011877136,0.000012515353,0.000012700322,0.00005494954,0.00035138254,0.014313406,0.7023023,0.00043999826,0.0003764263],"about_ca_topic_score_codex":0.00021412544,"about_ca_topic_score_gemma":0.00009234225,"teacher_disagreement_score":0.25188926,"about_ca_system_score_codex":0.00004705756,"about_ca_system_score_gemma":0.00007249369,"threshold_uncertainty_score":0.9057336},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901183,0.000070440314,0.0028212513,0.0010669315,0.0014303441,0.00026508584,8.842318e-7,0.0001276488,0.004099082],"genre_scores_gemma":[0.9978058,0.00002374746,0.0019467076,0.00005458362,0.0000041826993,0.000027694581,0.0000016662125,0.000012476051,0.00012317946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851793,0.00012337173,0.00019745284,0.00040119747,0.00035546214,0.00040458576],"domain_scores_gemma":[0.9980608,0.00018649176,0.0001458955,0.001388801,0.00012340814,0.00009457111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080052635,0.00013052151,0.00017533507,0.00029658698,0.0004314415,0.0003704467,0.0019572887,0.00007335618,0.000007080075],"category_scores_gemma":[0.0005126921,0.00013549007,0.000057871457,0.00040870972,0.0001270532,0.0013274559,0.0005655698,0.00026066497,0.000051280083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016135953,0.00006515672,0.022780674,0.000006198122,0.000005182981,0.000034906494,0.0002532493,0.000007531683,0.0006372945,0.9656777,0.00009672135,0.010419297],"study_design_scores_gemma":[0.000986875,0.000066778535,0.093524694,0.000030488287,0.0000011373514,0.000003267729,0.000013201093,0.0044703865,0.0030159787,0.8974229,0.00031140924,0.00015285317],"about_ca_topic_score_codex":0.000045219243,"about_ca_topic_score_gemma":0.000027448647,"teacher_disagreement_score":0.07074402,"about_ca_system_score_codex":0.000070552735,"about_ca_system_score_gemma":0.000040455423,"threshold_uncertainty_score":0.55251247},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99592793,0.0000014893895,0.000103688944,0.00025450118,0.000572288,0.0013071228,0.00002980101,0.00012029714,0.001682881],"genre_scores_gemma":[0.9988733,0.0000013592978,0.0001795327,0.000044676115,0.000009849411,0.0005071536,0.000023989647,0.000030881827,0.00032929357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916166,0.000051745545,0.000209405,0.00026087335,0.0001289391,0.00018735151],"domain_scores_gemma":[0.9982954,0.000269586,0.00024823155,0.0010167287,0.00011153843,0.00005846569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033361226,0.00014796201,0.00019993295,0.000070700466,0.00082713447,0.000115363866,0.00042843286,0.00006729058,0.000012307618],"category_scores_gemma":[0.00047751688,0.00014008989,0.00008490202,0.00008137203,0.000053447737,0.0001307373,0.00004914896,0.000095184936,0.000028812863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037917383,0.0007944751,0.0032279503,0.000012371127,0.00004742673,0.000001676123,0.0004557572,2.4703567e-8,0.0029699137,0.9915046,0.00025999427,0.00068790675],"study_design_scores_gemma":[0.0013871269,0.00025222148,0.1101898,0.000019528345,0.000048918326,8.6727084e-7,0.00010792982,0.000012276905,0.0021565259,0.885304,0.00037478376,0.0001460664],"about_ca_topic_score_codex":0.00000339407,"about_ca_topic_score_gemma":0.0000075984594,"teacher_disagreement_score":0.10696185,"about_ca_system_score_codex":0.000015974798,"about_ca_system_score_gemma":0.000015052195,"threshold_uncertainty_score":0.63617337},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98771656,0.000043693588,0.0025555475,0.0029222246,0.0014569069,0.00027300898,0.0000018402153,0.00009066995,0.0049395273],"genre_scores_gemma":[0.9984528,0.000010989816,0.0010385079,0.000052976033,0.000015886282,0.000021964597,0.0000017500827,0.000010910261,0.00039425757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878645,0.000078570076,0.0001365084,0.00038781393,0.000352625,0.0002580216],"domain_scores_gemma":[0.99848527,0.00017115907,0.00014082254,0.0009845145,0.0001119605,0.000106299536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051424577,0.00012912003,0.00013736871,0.00014864311,0.00066708936,0.00040336882,0.0010179706,0.00007359135,0.000004550346],"category_scores_gemma":[0.0003727136,0.00012574588,0.000036689744,0.00010313821,0.00017994242,0.001026228,0.000403425,0.00018107412,0.0000376948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003759601,0.00005314506,0.0015158491,0.0000056192594,0.0000072336065,0.000012135415,0.00026390998,0.0000036882386,0.00090342737,0.95445675,0.0004810471,0.042259615],"study_design_scores_gemma":[0.0022584877,0.0002571772,0.10540272,0.000030771134,0.0000043315385,0.000009015052,0.000024706882,0.005625724,0.011365159,0.8735641,0.0012028143,0.0002549819],"about_ca_topic_score_codex":0.000014797717,"about_ca_topic_score_gemma":0.0000049038917,"teacher_disagreement_score":0.10388687,"about_ca_system_score_codex":0.00006711692,"about_ca_system_score_gemma":0.00003206622,"threshold_uncertainty_score":0.513078},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5912396,0.00032098862,0.36883157,0.0011758282,0.02423575,0.0018579125,0.00008431557,0.0004510917,0.011802974],"genre_scores_gemma":[0.99659663,0.0000037051861,0.0028887147,0.00004426028,0.000033139208,0.000050114784,0.000003631341,0.00001270606,0.00036708175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885786,0.000070129965,0.0002706621,0.00034660185,0.00018401127,0.0002707368],"domain_scores_gemma":[0.9981473,0.00021015362,0.00033157994,0.0010267354,0.00020160912,0.00008259404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051153183,0.00014689672,0.00032707216,0.000079531215,0.00044302226,0.00018962253,0.001080792,0.00010656633,0.000007570797],"category_scores_gemma":[0.00008842684,0.00013935257,0.00017403357,0.00009420181,0.00006996264,0.0004389698,0.00013025918,0.00009931622,0.000029637105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008822753,0.00012011656,0.0011178578,0.000027178596,0.0000589196,0.000005830865,0.00026381822,0.0000029671064,0.00026127105,0.9658164,0.009529004,0.02278784],"study_design_scores_gemma":[0.0026637884,0.0007211711,0.0085595725,0.00015324469,0.000021740754,0.00003143914,0.00003593595,0.1701381,0.0033715167,0.80555207,0.008254607,0.0004967988],"about_ca_topic_score_codex":0.00011623198,"about_ca_topic_score_gemma":0.00001084187,"teacher_disagreement_score":0.4053571,"about_ca_system_score_codex":0.000031613916,"about_ca_system_score_gemma":0.000038932503,"threshold_uncertainty_score":0.5682633},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96356606,0.0001584134,4.5186852e-7,0.0056803883,0.0011209006,0.00006368874,8.6998335e-7,0.000025113242,0.029384127],"genre_scores_gemma":[0.99578416,0.000051713192,0.00005094067,0.00005294051,0.000049540307,0.000005204437,0.0000012989807,0.0000035277158,0.0040006763],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994698,0.000043296193,0.00008662717,0.00011673194,0.00013831607,0.00014518216],"domain_scores_gemma":[0.999453,0.0001286767,0.00007806226,0.0001881419,0.000033016673,0.000119090386],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00031748437,0.00005025108,0.00007690796,0.00002658335,0.0022616123,0.00025294247,0.00024078967,0.000073437266,0.00003643424],"category_scores_gemma":[0.00053529476,0.000043588854,0.000023592174,0.000036772006,0.00042668622,0.0002617268,0.0000330126,0.00008046715,0.000030329807],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.2517764e-7,0.000007871769,0.5989515,0.0000014291487,0.00000174744,3.1128604e-7,0.006083769,4.6993356e-9,6.609081e-7,0.39242852,0.0007356185,0.0017882211],"study_design_scores_gemma":[0.00013716222,0.000010818962,0.8037373,0.000007767325,0.0000048899674,1.09278545e-7,0.002997658,2.8840518e-7,0.0000117277905,0.11521923,0.07780557,0.00006750948],"about_ca_topic_score_codex":0.0013927405,"about_ca_topic_score_gemma":0.00024477346,"teacher_disagreement_score":0.27720928,"about_ca_system_score_codex":0.000013297357,"about_ca_system_score_gemma":0.000060235343,"threshold_uncertainty_score":0.9990373},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9799726,0.00021609454,0.0000047880803,0.00003483907,0.0008906844,0.00015242388,0.000006947758,0.000043984423,0.01867762],"genre_scores_gemma":[0.9998636,0.000024705136,0.0000060840985,0.0000130873295,0.000003449087,0.000014395379,6.012482e-7,0.000016678192,0.00005736948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994677,0.000044777727,0.00013042119,0.00011285454,0.00010279488,0.00014146614],"domain_scores_gemma":[0.99912655,0.0002483952,0.00006409813,0.00046686895,0.00005031876,0.00004374248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026049017,0.000116601695,0.00015525421,0.00007926381,0.00023229762,0.00004667172,0.00019484905,0.000062918516,0.000014473797],"category_scores_gemma":[0.00015481247,0.00008528027,0.000041561667,0.00015756849,0.00010358557,0.00007710074,0.00003731572,0.00013592465,0.000008287087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006447187,0.000020488676,0.0014865887,0.000039156203,0.000068390174,0.00004962821,0.00037136365,0.000014771038,0.00045073984,0.99622715,0.00066561153,0.0005996805],"study_design_scores_gemma":[0.0012636546,0.00019995592,0.02068037,0.00015141221,0.00006195043,0.00020227398,0.00093253236,0.0010581767,0.014039907,0.9603279,0.0006921138,0.00038971545],"about_ca_topic_score_codex":0.000034385732,"about_ca_topic_score_gemma":0.000004569106,"teacher_disagreement_score":0.035899196,"about_ca_system_score_codex":0.000009654759,"about_ca_system_score_gemma":0.000005099451,"threshold_uncertainty_score":0.34776285},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9891597,0.00009006073,0.00011689254,0.0010236176,0.0022252712,0.00010730249,0.0000017317062,0.00008404507,0.0071913637],"genre_scores_gemma":[0.99771756,0.000027361632,0.0019422829,0.00015758649,9.922749e-7,0.000004564068,5.357536e-7,0.0000087417275,0.00014037044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897903,0.00003500542,0.00019013442,0.000336611,0.0002443874,0.00021485503],"domain_scores_gemma":[0.99840015,0.000074120355,0.0001823517,0.0011303948,0.00010307079,0.00010990063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027291072,0.0001315111,0.00019437734,0.00006587423,0.00030323636,0.00016007933,0.0007395948,0.00007643237,0.0000057686175],"category_scores_gemma":[0.00008724716,0.00011792956,0.00006060332,0.00010531528,0.00020786517,0.00025501745,0.00031785102,0.0001302494,0.000054632557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006644786,0.00008209402,0.0065680775,0.000012000974,0.000011132485,0.000007978494,0.00016207961,0.0000012423021,0.00049573387,0.9868415,0.0016631371,0.0041483724],"study_design_scores_gemma":[0.00083456945,0.00011065268,0.008464419,0.000056494842,0.000006431898,0.0000075914054,0.000003441595,0.0005524464,0.005212161,0.9840978,0.0005113216,0.00014267971],"about_ca_topic_score_codex":0.00013428148,"about_ca_topic_score_gemma":0.000005121308,"teacher_disagreement_score":0.00855785,"about_ca_system_score_codex":0.0000073870156,"about_ca_system_score_gemma":0.000028777806,"threshold_uncertainty_score":0.48090276},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97266805,0.000091693706,0.003476514,0.0003615905,0.010495598,0.00008226928,0.0000017470534,0.000030098015,0.01279241],"genre_scores_gemma":[0.999627,0.0000059864774,0.000043694385,0.000033378994,0.000009497107,0.0000054185307,1.3291181e-7,0.00000494452,0.00026994804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911,0.00010432006,0.00023475118,0.00018578101,0.00021845018,0.00014669451],"domain_scores_gemma":[0.9979103,0.00008762999,0.00040996994,0.0014010624,0.00015804303,0.000032945456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003757889,0.00008720657,0.00020616589,0.000039640945,0.00030153262,0.0000895635,0.0015463805,0.000063492225,0.0000045122283],"category_scores_gemma":[0.000082117454,0.00006312722,0.00014998806,0.00013099483,0.00013593801,0.00028248806,0.00036302517,0.000078227895,0.0000013910495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027862939,0.000046522684,0.01120461,0.000007804582,0.000020675281,6.606358e-7,0.0001374107,0.0000061961114,0.00042685666,0.9859334,0.0010981965,0.0011148802],"study_design_scores_gemma":[0.00054720906,0.00011502901,0.051155377,0.000074923104,0.0000073505066,0.000008285792,0.000018864892,0.0051540695,0.021511544,0.91868067,0.0025867787,0.00013992617],"about_ca_topic_score_codex":0.0008504532,"about_ca_topic_score_gemma":0.000116928226,"teacher_disagreement_score":0.067252755,"about_ca_system_score_codex":0.000017692866,"about_ca_system_score_gemma":0.000044716155,"threshold_uncertainty_score":0.28735852},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6770194,0.000011202081,0.005737855,0.00016304462,0.0003697273,0.00014118162,0.000015599291,0.000023523142,0.31651846],"genre_scores_gemma":[0.99743295,6.4320716e-7,0.0021429108,0.0000066739562,0.000019635048,0.00001638822,0.0000034428328,0.000009111971,0.00036823953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995744,0.0000054283432,0.00013220227,0.00010200707,0.000069933376,0.000116002295],"domain_scores_gemma":[0.99922407,0.000054915177,0.00015577425,0.00047853138,0.000043029715,0.00004369646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006446718,0.00006809878,0.0001332221,0.00000786927,0.00023345639,0.00002962027,0.00025009614,0.000012696842,0.00016885177],"category_scores_gemma":[0.00001581424,0.00006334377,0.00005578056,0.000026104208,0.00009566629,0.00009196239,0.000085544045,0.00006594395,0.00003512745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017387846,0.000059357983,0.0033655763,0.00000466818,0.00001365258,1.1585485e-7,0.000048389942,0.0000046734754,0.0003636712,0.99411637,0.00006369985,0.0019581076],"study_design_scores_gemma":[0.00037211273,0.000008410279,0.000415028,0.000015343772,0.000010663467,9.3166754e-8,0.000105558865,0.00006985933,0.0051385383,0.9926882,0.0011060596,0.000070170085],"about_ca_topic_score_codex":0.000053093525,"about_ca_topic_score_gemma":3.0130317e-7,"teacher_disagreement_score":0.32041353,"about_ca_system_score_codex":0.000004501097,"about_ca_system_score_gemma":0.000010571013,"threshold_uncertainty_score":0.25830838},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96554357,0.00036135377,0.0030966266,0.00038769885,0.0034012902,0.00013737792,0.0000017471729,0.0001619263,0.026908407],"genre_scores_gemma":[0.99803734,0.000033554425,0.0017490312,0.00005399062,0.00000430328,0.0000060361535,5.145876e-7,0.000007675993,0.000107541055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899065,0.00005716581,0.00018748778,0.00028388307,0.0002452249,0.00023555954],"domain_scores_gemma":[0.99787796,0.00011726511,0.00021781269,0.0015534426,0.00014850771,0.00008502749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004329213,0.00012492621,0.00019219492,0.00023809665,0.00036386453,0.00016520385,0.0020813723,0.00006468869,0.000018510322],"category_scores_gemma":[0.00019778215,0.00012006013,0.00012126254,0.0007203221,0.00013260216,0.00043685353,0.0004257515,0.00012466623,0.000028380473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046165683,0.00008396417,0.008756738,0.000009267241,0.000023023385,0.0000051927873,0.000113330294,7.852676e-7,0.00036749485,0.9783684,0.0006869098,0.011580291],"study_design_scores_gemma":[0.00051608396,0.00010767723,0.01681932,0.000022078912,0.000009233416,0.0000037232676,0.0000071490167,0.0002847496,0.004650842,0.975542,0.0018799147,0.00015719452],"about_ca_topic_score_codex":0.000029074341,"about_ca_topic_score_gemma":0.0000015147408,"teacher_disagreement_score":0.03249378,"about_ca_system_score_codex":0.00000898192,"about_ca_system_score_gemma":0.00003818846,"threshold_uncertainty_score":0.489591},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9563453,0.00003626329,0.0069977893,0.00027448332,0.0009104644,0.00022848895,0.0000029365515,0.0006621609,0.03454208],"genre_scores_gemma":[0.9614481,0.0000066796742,0.038336135,0.00001912579,0.0000015919866,0.0000144846745,0.0000016415396,0.000015132189,0.00015715789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988203,0.000041008585,0.00023263606,0.0003435135,0.00032782764,0.00023469064],"domain_scores_gemma":[0.997794,0.000035156096,0.0005391883,0.0011812536,0.0003815242,0.00006887587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030890427,0.00015813373,0.0002396041,0.000090097565,0.00027068256,0.00048292257,0.0013952545,0.000093329356,0.0000032302935],"category_scores_gemma":[0.00020551104,0.00014280957,0.000068859685,0.00028638064,0.00030923286,0.0020429504,0.00026364182,0.00012896233,0.000006999098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015588595,0.00018856714,0.0715255,0.000025824,0.00007616738,0.000020973423,0.000109758366,1.6995602e-7,0.0007150662,0.8746922,0.00073336257,0.051896844],"study_design_scores_gemma":[0.00054835895,0.00010565395,0.021960106,0.00016571392,0.000012562196,0.00004355046,0.0000053828685,0.00016918777,0.02465572,0.95209926,0.000034849065,0.0001996618],"about_ca_topic_score_codex":0.00005456592,"about_ca_topic_score_gemma":0.00000797266,"teacher_disagreement_score":0.07740708,"about_ca_system_score_codex":0.00003430262,"about_ca_system_score_gemma":0.000076982054,"threshold_uncertainty_score":0.5823605},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9945657,0.00053047866,0.00003240333,0.00036842728,0.0022775051,0.00014289301,0.0000014812937,0.000062722924,0.0020183444],"genre_scores_gemma":[0.9977656,0.00002015018,0.0020731254,0.000018557517,0.0000012177684,0.0000069366306,5.153889e-7,0.0000076844335,0.000106192674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878925,0.00003281344,0.00029832442,0.0003019395,0.00028651522,0.00029114087],"domain_scores_gemma":[0.9978534,0.000040762294,0.00036077332,0.001464049,0.00020557958,0.000075423726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058524555,0.00011106658,0.00026550225,0.000113390415,0.00026665314,0.00007040376,0.0012462382,0.000042117696,0.0000025059474],"category_scores_gemma":[0.000133471,0.00010517871,0.00007984715,0.00017223545,0.00015463175,0.0005861969,0.00047189824,0.00009067343,0.0000064553806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032238545,0.000091440066,0.0069346596,0.00004042153,0.000019238914,0.000002903077,0.0001705212,0.0000112998205,0.016826626,0.9747191,0.00037882495,0.0008017324],"study_design_scores_gemma":[0.00050334097,0.00013005105,0.0045208298,0.000060444934,0.000008766048,0.0000019994295,0.000008000915,0.00036468054,0.11938568,0.8748285,0.00007782839,0.00010983242],"about_ca_topic_score_codex":0.00019926265,"about_ca_topic_score_gemma":0.000002406523,"teacher_disagreement_score":0.10255906,"about_ca_system_score_codex":0.000009577672,"about_ca_system_score_gemma":0.000070308946,"threshold_uncertainty_score":0.42890635},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.958564,0.000015137643,0.0023367614,0.0018841827,0.0010205529,0.00021005486,0.0000013513182,0.00004604595,0.03592192],"genre_scores_gemma":[0.99914664,0.000007051507,0.0004884309,0.000053334963,0.000002613118,0.000015987824,2.7454954e-7,0.0000060396405,0.00027963167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904674,0.00009634988,0.00011977633,0.0001982564,0.00035713756,0.00018174428],"domain_scores_gemma":[0.9976694,0.00044842117,0.00015324586,0.0015622274,0.00012452212,0.00004219122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005907954,0.00008028099,0.000102146136,0.000046065292,0.00041831564,0.00013004385,0.0020667228,0.000034930978,0.000025311328],"category_scores_gemma":[0.00048629617,0.000055744207,0.00006238084,0.00014825907,0.00021684144,0.0003989934,0.00032999064,0.0001462114,0.00008871931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008495229,0.000048381655,0.0018792262,0.0000027459032,0.0000083549785,0.000002570217,0.00011252347,0.0000012855786,0.00022125599,0.99377483,0.0005026116,0.0034377046],"study_design_scores_gemma":[0.00030457502,0.00004326311,0.010491355,0.000014659994,0.0000012773562,0.0000016796881,0.000007801723,0.00044097734,0.0074317423,0.9809692,0.00022986098,0.00006360153],"about_ca_topic_score_codex":0.0000109804605,"about_ca_topic_score_gemma":0.0000011798909,"teacher_disagreement_score":0.040582642,"about_ca_system_score_codex":0.000016323098,"about_ca_system_score_gemma":0.000022383567,"threshold_uncertainty_score":0.38405195},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98299986,0.000010262983,0.000030495365,0.00028765947,0.0002567066,0.00022954853,0.000004456271,0.0000920449,0.01608896],"genre_scores_gemma":[0.9987853,0.000004843229,0.0006877487,0.000031716037,0.0000055771034,0.000046641824,0.0000030767635,0.000025775467,0.00040929837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991997,0.000027675436,0.0001516015,0.00021954875,0.00017899481,0.0002224627],"domain_scores_gemma":[0.9985341,0.000103010876,0.00018481615,0.0010385659,0.000045661127,0.0000938744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017408624,0.0001462173,0.0001711561,0.000043640222,0.0006576232,0.000122416,0.0005485015,0.00006284496,0.000059063714],"category_scores_gemma":[0.00006759259,0.00012318653,0.00006302541,0.00007753134,0.00018649657,0.00019086625,0.000075213524,0.00017414705,0.000047216203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021573542,0.000169922,0.020009132,0.0000137410225,0.00003351006,0.000009279454,0.0001035279,1.05488006e-7,0.000112886955,0.9784908,0.0007659205,0.00026958802],"study_design_scores_gemma":[0.00081286865,0.00005986588,0.029998505,0.00002337532,0.000033819106,0.00001395225,0.000073656796,0.000007733623,0.0009514493,0.9672083,0.0006520388,0.000164402],"about_ca_topic_score_codex":0.000035774498,"about_ca_topic_score_gemma":0.000022025553,"teacher_disagreement_score":0.015785458,"about_ca_system_score_codex":0.000015170367,"about_ca_system_score_gemma":0.000026281412,"threshold_uncertainty_score":0.50579727},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95799935,0.00013052775,0.00026638905,0.0002057361,0.010206088,0.0005418627,0.000022634957,0.0002111292,0.030416263],"genre_scores_gemma":[0.9944885,0.00003328773,0.0019631009,0.000019216155,0.000046662568,0.00003079212,0.0000053425733,0.000066513174,0.0033465899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979991,0.00007461292,0.0006740831,0.00031076872,0.00055481755,0.0003866237],"domain_scores_gemma":[0.9966528,0.00067323056,0.00071139843,0.0014291952,0.00039683311,0.00013654072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043124397,0.00027716233,0.0006164843,0.0001337596,0.0004985648,0.00022864234,0.0010228438,0.00015915534,0.0001851913],"category_scores_gemma":[0.003931748,0.00028370824,0.0001962997,0.00010367156,0.0004815948,0.0010960095,0.00043610256,0.00027470442,0.00013427316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002561718,0.00023059468,0.0004391917,0.00021937222,0.000105210594,0.000016844084,0.00061454985,9.0393877e-7,0.00037730605,0.9942457,0.0036559391,0.00006877368],"study_design_scores_gemma":[0.0011697501,0.00013170166,0.0003927897,0.00018271038,0.000108609245,0.000008141551,0.0002259294,0.000088711044,0.0045525827,0.9926985,0.00016393408,0.00027667073],"about_ca_topic_score_codex":0.000031138887,"about_ca_topic_score_gemma":0.000009123904,"teacher_disagreement_score":0.036489125,"about_ca_system_score_codex":0.00010195168,"about_ca_system_score_gemma":0.00007535597,"threshold_uncertainty_score":0.9999615},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99529517,0.000030778057,0.000022478223,0.00022894349,0.0010864681,0.00027866042,0.000036579782,0.000063827494,0.002957089],"genre_scores_gemma":[0.99757445,0.000022234652,0.0012011586,0.000049204045,0.000019869456,0.00005747452,0.000016577134,0.00003053011,0.001028528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989145,0.00008049324,0.00037166954,0.00022954284,0.0001725506,0.00023127871],"domain_scores_gemma":[0.9980112,0.00015799313,0.0004634293,0.0011779927,0.00009489644,0.00009452191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030090162,0.0001732391,0.00038720752,0.00004927597,0.00041444117,0.000060288785,0.0006394159,0.000103530016,0.00022717837],"category_scores_gemma":[0.00030911094,0.00016725188,0.00014756726,0.00005381156,0.0001951919,0.00012588325,0.00012766664,0.00011453698,0.000049279788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005499761,0.00018359323,0.0011710447,0.00002944087,0.000055032757,0.0000026743496,0.000118405755,1.061967e-7,0.016820803,0.9764235,0.004699322,0.0004410984],"study_design_scores_gemma":[0.0018662162,0.000040742936,0.0106265275,0.000024526445,0.000070638955,0.0000043511213,0.000010728743,0.000071570794,0.0101198405,0.9747162,0.002259138,0.0001895025],"about_ca_topic_score_codex":0.000065398905,"about_ca_topic_score_gemma":0.0000059166414,"teacher_disagreement_score":0.0094554825,"about_ca_system_score_codex":0.00002266509,"about_ca_system_score_gemma":0.00003875538,"threshold_uncertainty_score":0.68203336},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9856999,0.00001686188,0.000012786518,0.0016974948,0.00040309713,0.00040032752,0.000016418027,0.00006354632,0.011689591],"genre_scores_gemma":[0.99376535,0.000002230782,0.00016861586,0.00031351438,0.000009935357,0.00014993825,0.0000029631587,0.00002856554,0.0055588605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991179,0.000053228796,0.00014440987,0.00023925173,0.00018719469,0.00025799443],"domain_scores_gemma":[0.99818176,0.00018838649,0.0001923449,0.0012656411,0.000058475434,0.00011339798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040079397,0.00015679363,0.0001695808,0.000057985475,0.0009872719,0.0001479941,0.00078864,0.00006261394,0.00018088777],"category_scores_gemma":[0.00007612773,0.00010122773,0.000063956664,0.00016632676,0.00015933208,0.00015200788,0.00012905839,0.00018761156,0.00014464688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012206047,0.000079028905,0.0028617163,0.000013767036,0.000045056233,0.0000023021273,0.0007167964,1.3069747e-7,0.00018238829,0.9834013,0.012554241,0.00013104216],"study_design_scores_gemma":[0.00053598866,0.000055024564,0.008951718,0.000022420008,0.00003599054,0.0000052736696,0.00013307751,0.0000018207764,0.002023689,0.9567767,0.03129184,0.00016645377],"about_ca_topic_score_codex":0.000015597934,"about_ca_topic_score_gemma":0.00013167421,"teacher_disagreement_score":0.026624618,"about_ca_system_score_codex":0.000012501169,"about_ca_system_score_gemma":0.00002389496,"threshold_uncertainty_score":0.75933975},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.974247,0.000014535354,0.001175325,0.0017734392,0.001674281,0.0002133818,0.0000013173672,0.00006590906,0.020834856],"genre_scores_gemma":[0.9992386,0.000008076712,0.00036192354,0.0000917079,0.000003129723,0.000017238792,2.863406e-7,0.000007739483,0.00027129476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989493,0.00013070456,0.00012910609,0.00023701291,0.00033563867,0.00021823091],"domain_scores_gemma":[0.99751914,0.00050104526,0.00015880725,0.0016418649,0.00012570206,0.000053450833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006736202,0.0000942945,0.00012163051,0.000050568062,0.0005546778,0.00012858465,0.0018541052,0.00004357627,0.000039478393],"category_scores_gemma":[0.00055846607,0.00006727451,0.00007621824,0.0001765636,0.000258348,0.00035060223,0.0003223178,0.00019253054,0.00009741228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011921777,0.000047584184,0.0023579386,0.0000031057114,0.000013093116,0.0000034197212,0.0000961141,0.000002475285,0.00027630225,0.9947882,0.00084179663,0.0015580445],"study_design_scores_gemma":[0.00035227125,0.00006832156,0.0054380023,0.00001540734,0.0000015314131,0.000004059752,0.000012854335,0.00042012677,0.006847611,0.98644525,0.00031749165,0.00007709579],"about_ca_topic_score_codex":0.000019865569,"about_ca_topic_score_gemma":0.000001562797,"teacher_disagreement_score":0.024991646,"about_ca_system_score_codex":0.00001887662,"about_ca_system_score_gemma":0.00002690941,"threshold_uncertainty_score":0.4266189},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93169487,0.001527822,0.0015464621,0.0019215682,0.023251044,0.00043950728,0.000029078177,0.000392726,0.03919692],"genre_scores_gemma":[0.9965444,0.00024561453,0.00049029995,0.00039729383,0.000094882904,0.000022829072,0.0000044937974,0.00004683435,0.002153326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636436,0.00032889616,0.000533776,0.0011026358,0.00068618153,0.0009841417],"domain_scores_gemma":[0.9942695,0.00035681503,0.0006170148,0.0041740714,0.00017048832,0.00041213032],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011723951,0.00055591465,0.00062780856,0.00021440278,0.0024545821,0.0022499508,0.004621385,0.00032845017,0.00039150903],"category_scores_gemma":[0.00034571838,0.0005866387,0.00045662074,0.00036115793,0.0006543905,0.0013800942,0.0016394373,0.00063263456,0.0013762456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004454509,0.0005545517,0.015352632,0.00004003321,0.00013253556,0.00008931002,0.0006680554,9.0254474e-7,0.00028576996,0.9604447,0.0115668615,0.010820136],"study_design_scores_gemma":[0.0016072775,0.00051324634,0.05141029,0.00021056323,0.00007454,0.000014773667,0.000027208815,0.0011380829,0.0012167189,0.9070236,0.035994645,0.0007690218],"about_ca_topic_score_codex":0.00017114809,"about_ca_topic_score_gemma":0.000027480814,"teacher_disagreement_score":0.064849555,"about_ca_system_score_codex":0.00007445642,"about_ca_system_score_gemma":0.00015280732,"threshold_uncertainty_score":0.9996585},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99050593,0.000047120535,0.00005031553,0.0018133401,0.0010107837,0.00025509644,0.000002223745,0.00009369517,0.0062214923],"genre_scores_gemma":[0.99917305,0.0000036320687,0.00047491278,0.00018822071,8.89903e-7,0.000026536825,9.2068643e-7,0.000013069335,0.00011876087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846905,0.00006944575,0.0002566624,0.00038567453,0.0004796399,0.00033951385],"domain_scores_gemma":[0.9978018,0.00017514525,0.00032870285,0.00140137,0.00019307132,0.00009991137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005839101,0.0001802229,0.0002347161,0.000054265514,0.0008231389,0.0003602459,0.0012258436,0.000045290715,0.0000061981964],"category_scores_gemma":[0.00025750275,0.00010947532,0.00007722301,0.00015652568,0.0002787366,0.00027701087,0.0004116336,0.00021033321,0.000027317774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020470226,0.000091180016,0.0020575828,0.000011823687,0.000031543408,0.000013856637,0.00024475367,0.000074783544,0.0008061601,0.99558455,0.0006865783,0.0003767371],"study_design_scores_gemma":[0.0009669526,0.0006165038,0.008410067,0.00024836345,0.000017701615,0.00001309229,0.000019652161,0.0042015687,0.0036908565,0.9811983,0.0003686278,0.0002483095],"about_ca_topic_score_codex":0.00016652173,"about_ca_topic_score_gemma":0.0000062130725,"teacher_disagreement_score":0.014386226,"about_ca_system_score_codex":0.000017108992,"about_ca_system_score_gemma":0.00005091951,"threshold_uncertainty_score":0.6331002},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8295493,0.0000467064,0.0004325225,0.001961808,0.0005475229,0.000296251,0.000008099944,0.000024483725,0.1671333],"genre_scores_gemma":[0.9986521,0.000003837745,0.00016449283,0.000011310481,0.000019771747,0.0000610499,0.0000012221902,0.0000074847917,0.001078705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995469,0.000009259363,0.00012701337,0.00010135461,0.000054471748,0.00016100775],"domain_scores_gemma":[0.99921507,0.00013260724,0.00009439736,0.00050612603,0.000016819953,0.00003500404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012752869,0.00006558518,0.00009325688,0.0000060790844,0.00061010453,0.00011643551,0.0003540219,0.00001398555,0.00005160102],"category_scores_gemma":[0.00003207582,0.000046408535,0.000036948793,0.000025607076,0.00008691382,0.000088351364,0.000107237465,0.00008587505,0.00006206925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022132463,0.000029408711,0.0038422577,9.3623885e-7,0.000004931687,1.4443145e-7,0.000027345675,0.0000011480518,0.00004635129,0.9901214,0.00032578013,0.0055980855],"study_design_scores_gemma":[0.00024497297,0.0000049321943,0.0038809287,0.000007313576,0.000002328347,6.1921824e-8,0.00007724895,0.00003420258,0.0007723359,0.97917455,0.015740495,0.000060649243],"about_ca_topic_score_codex":0.000049150196,"about_ca_topic_score_gemma":0.0000023942569,"teacher_disagreement_score":0.16910282,"about_ca_system_score_codex":0.000009940882,"about_ca_system_score_gemma":0.000011482454,"threshold_uncertainty_score":0.46924922},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85237956,0.00071907527,0.11090473,0.0069602365,0.01983299,0.0028108752,0.00011395878,0.0002587208,0.006019866],"genre_scores_gemma":[0.9936245,0.000015608652,0.0060204044,0.00009673639,0.000024246094,0.00004832142,0.0000026841444,0.000012066851,0.00015541914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884087,0.000060584756,0.0003438332,0.0002514003,0.00020300584,0.00030033037],"domain_scores_gemma":[0.9972753,0.0006075847,0.00045441874,0.0014510816,0.00013960943,0.00007203547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007935246,0.00016561463,0.00032409854,0.000060867886,0.0007085925,0.0002125429,0.0027772742,0.00006199324,0.000009914033],"category_scores_gemma":[0.00026767617,0.00011810868,0.00022008382,0.00009377459,0.00020471957,0.00049655954,0.0004611607,0.0001066397,0.00001574231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021538392,0.00005584545,0.00006525802,0.00004110619,0.0000676586,0.0000017658565,0.00037933784,0.0000027994245,0.00042266317,0.9883553,0.0013078767,0.009278849],"study_design_scores_gemma":[0.0013845416,0.00030228362,0.0023706506,0.000073748226,0.000034030556,0.00001030978,0.00007550202,0.013077892,0.009247792,0.9695276,0.0036923322,0.00020328563],"about_ca_topic_score_codex":0.00005093717,"about_ca_topic_score_gemma":0.0000061728183,"teacher_disagreement_score":0.14124496,"about_ca_system_score_codex":0.000025486912,"about_ca_system_score_gemma":0.000049636797,"threshold_uncertainty_score":0.5449992},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97005194,0.0000033564395,0.000015114111,0.0009472635,0.00013697366,0.00019138647,0.000005559256,0.000028192924,0.028620202],"genre_scores_gemma":[0.99910605,0.0000019097251,0.00038154252,0.0000242546,0.0000069817165,0.000025175665,8.55505e-7,0.000016238959,0.0004369669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941623,0.000045644767,0.00013400242,0.00012557924,0.00014221144,0.0001363055],"domain_scores_gemma":[0.99837303,0.00053478393,0.0002072312,0.0008213981,0.000029864457,0.000033663426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002470621,0.00010267707,0.00015370717,0.000014895118,0.00040212017,0.000045863835,0.00047600362,0.00003536587,0.00007557392],"category_scores_gemma":[0.00010355737,0.00006467169,0.00005967465,0.000044923683,0.00016627883,0.00006327636,0.000041095216,0.00012912374,0.00003398725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028588633,0.0001433009,0.0010268508,0.000010594581,0.000038601585,0.000002182868,0.0005220805,7.072551e-7,0.00040747895,0.99611634,0.0016545439,0.000048746588],"study_design_scores_gemma":[0.00041117016,0.00006220784,0.005305889,0.00005258549,0.00002845469,0.0000043196706,0.0001686569,0.000008701841,0.0038755252,0.9898651,0.00013372085,0.000083640494],"about_ca_topic_score_codex":0.000018822768,"about_ca_topic_score_gemma":0.00001815761,"teacher_disagreement_score":0.029054124,"about_ca_system_score_codex":0.000010221437,"about_ca_system_score_gemma":0.000014592039,"threshold_uncertainty_score":0.3092824},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9779641,0.0003517434,0.000067105175,0.000011864019,0.003058873,0.00008714702,0.000003670483,0.00016161594,0.018293869],"genre_scores_gemma":[0.99987656,0.000003184809,0.000031428524,0.000007718029,0.00000687396,0.000007690049,0.0000029537598,0.000021237423,0.000042325802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933386,0.00003612688,0.00019957568,0.000096246506,0.00016083391,0.00017338345],"domain_scores_gemma":[0.99951494,0.000028616581,0.00003427968,0.0002564637,0.000054351443,0.00011137847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025062726,0.0001088835,0.00018207522,0.000067169465,0.000017229006,0.00001017268,0.000158933,0.000082020124,0.00001962988],"category_scores_gemma":[0.000026917709,0.00011117405,0.000049735987,0.00019212221,0.000033368848,0.000098211196,0.000022194827,0.000103421924,0.00007418876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007584595,0.00008397345,0.008612575,0.0001582406,0.00012333642,0.000022846318,0.0016524364,0.0018171989,0.0022054906,0.9610766,0.023322454,0.0008489649],"study_design_scores_gemma":[0.0024923217,0.00051453325,0.0023449117,0.000089864894,0.000029235398,0.000027948452,0.0012356516,0.004541085,0.009396568,0.9637545,0.015065818,0.00050757814],"about_ca_topic_score_codex":0.000017097196,"about_ca_topic_score_gemma":0.0000031557352,"teacher_disagreement_score":0.021912474,"about_ca_system_score_codex":0.00002652225,"about_ca_system_score_gemma":0.000015521517,"threshold_uncertainty_score":0.45335463},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31514853,0.00008337704,0.68279254,0.00012931327,0.00095165154,0.000093041774,5.6115346e-7,0.00038477147,0.00041618102],"genre_scores_gemma":[0.6892656,0.000015478554,0.31059483,0.00002071349,0.0000057300163,0.000013789277,5.348698e-7,0.000011987986,0.00007131905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901533,0.000029145149,0.00022130522,0.00028429387,0.00024125625,0.00020866517],"domain_scores_gemma":[0.99804294,0.000032321685,0.00015332934,0.0015890707,0.00010652663,0.00007580232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002544147,0.00014491491,0.00024324286,0.0000841497,0.00020435908,0.00014733437,0.0019167899,0.00007730634,0.000004558981],"category_scores_gemma":[0.000037320693,0.00014766991,0.00007797149,0.000058610025,0.000071417104,0.0005383826,0.00063444325,0.000115521565,0.000009824167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016281483,0.000026585707,0.0009876366,0.000018045786,0.000014283424,0.000007864077,0.0003041631,0.00007194158,0.0035513765,0.9836907,0.00071327836,0.010612536],"study_design_scores_gemma":[0.0008356014,0.0001363549,0.003022322,0.00013693383,0.000013024535,0.0000117751015,0.0000022196305,0.10693182,0.08780755,0.783494,0.017124277,0.0004841178],"about_ca_topic_score_codex":0.00014785452,"about_ca_topic_score_gemma":0.0000015364778,"teacher_disagreement_score":0.3741171,"about_ca_system_score_codex":0.00004514518,"about_ca_system_score_gemma":0.000037812548,"threshold_uncertainty_score":0.6021804},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9884642,0.00069078885,0.00010411437,0.0015852272,0.0047804085,0.00014408646,0.0000011767709,0.00011521227,0.004114795],"genre_scores_gemma":[0.999007,0.00006268304,0.0005523788,0.00007880978,6.793332e-7,0.000010866082,3.52331e-7,0.000007788015,0.0002794447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989755,0.00007319063,0.00021100813,0.00025237404,0.00022269574,0.00026519917],"domain_scores_gemma":[0.99768645,0.00033154743,0.00024076184,0.0015145431,0.00015615493,0.000070555856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062926987,0.00012197224,0.00017500448,0.00005607298,0.0010131815,0.00030751893,0.0017109822,0.000055262404,0.0000019306217],"category_scores_gemma":[0.00026229635,0.00008745456,0.00010038655,0.00011533602,0.00031905464,0.00023541006,0.00038420712,0.00012611871,0.000015531308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039597594,0.000037632988,0.0018236132,0.0000063956486,0.00002301226,0.0000029556345,0.00021738374,0.0000028659392,0.00051527144,0.99262875,0.0013384775,0.003399652],"study_design_scores_gemma":[0.000563468,0.000091013186,0.0044523217,0.0000292839,0.0000061064043,0.000003564587,0.000025412779,0.0015732978,0.005050813,0.98739445,0.00069335767,0.00011690239],"about_ca_topic_score_codex":0.00014724609,"about_ca_topic_score_gemma":0.000018135655,"teacher_disagreement_score":0.010542807,"about_ca_system_score_codex":0.000009288207,"about_ca_system_score_gemma":0.00005824481,"threshold_uncertainty_score":0.77926755},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96772873,0.00003041075,0.0021573782,0.0011154802,0.0077127684,0.00016615902,0.0000010727985,0.00005325486,0.021034734],"genre_scores_gemma":[0.9996229,0.0000037029597,0.000035727215,0.00012660694,0.000012442557,0.0000132945315,1.454129e-7,0.000005442622,0.00017978308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991234,0.00011749508,0.00016586427,0.00022194158,0.00020450872,0.00016681185],"domain_scores_gemma":[0.99790126,0.00030420785,0.00023545898,0.001416197,0.00010303142,0.000039859693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006623297,0.00009817572,0.00015955238,0.00003547401,0.0004970935,0.00019360954,0.0013451232,0.000053177,0.000012323826],"category_scores_gemma":[0.00020563662,0.000065016335,0.00010182472,0.0000847104,0.00007674962,0.00024030978,0.00020148962,0.00014234931,0.000033428943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003620543,0.000049425966,0.0014594834,0.0000035097223,0.00001421037,0.000002613385,0.0001732449,0.0000052587807,0.00006817332,0.9911425,0.006021544,0.0010564127],"study_design_scores_gemma":[0.0003315016,0.000168291,0.013109566,0.000053547206,0.0000028291308,0.000004489263,0.000018987323,0.0062818644,0.0017567825,0.9771881,0.00097007386,0.00011392888],"about_ca_topic_score_codex":0.000104618026,"about_ca_topic_score_gemma":0.0000100676025,"teacher_disagreement_score":0.031894114,"about_ca_system_score_codex":0.00001819707,"about_ca_system_score_gemma":0.000023213976,"threshold_uncertainty_score":0.38232914},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87627655,0.000026486687,0.00013603213,0.0008204173,0.0010277318,0.00009483176,0.0000063235134,0.00003311097,0.12157852],"genre_scores_gemma":[0.999834,0.000036890124,0.000030546926,0.000031378026,0.000008074326,0.000019736599,9.0067374e-7,0.0000035191113,0.000034930075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996698,0.0000045703896,0.00007789893,0.000052911455,0.000075085234,0.000119773205],"domain_scores_gemma":[0.9997544,0.000050457817,0.0000110937735,0.00015741783,0.0000053830045,0.000021246618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007915019,0.000052832816,0.000055867255,0.000010203021,0.00035717373,0.0000500376,0.0001991604,0.000018132836,0.00017563258],"category_scores_gemma":[0.000022223127,0.000034306635,0.000018870744,0.000052755502,0.00010316065,0.000070462534,0.000020828587,0.00007112358,0.000047625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014575853,0.000009772729,0.0002469026,0.0000021109106,0.0000024681717,4.838595e-7,0.00008227832,0.0009249426,0.000050045677,0.996585,0.00017836886,0.0019161834],"study_design_scores_gemma":[0.0001393919,0.000010741716,0.015226145,0.000009685839,0.0000015112957,1.897691e-7,0.0001042446,0.0015138182,0.00042596916,0.9794205,0.0030821615,0.00006566947],"about_ca_topic_score_codex":0.0000038227467,"about_ca_topic_score_gemma":0.000009077958,"teacher_disagreement_score":0.123557486,"about_ca_system_score_codex":0.000014661466,"about_ca_system_score_gemma":0.0000018513492,"threshold_uncertainty_score":0.27471277},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.867388,0.00039162303,0.026002169,0.023185968,0.007670381,0.00085471256,0.0000057723796,0.0008245254,0.07367683],"genre_scores_gemma":[0.99725235,0.00002432029,0.0019921304,0.00028941064,0.000009443464,0.000021667978,0.0000010445856,0.000007306752,0.00040236014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991503,0.00003969977,0.00011097526,0.00024481706,0.00017794185,0.00027626046],"domain_scores_gemma":[0.9983071,0.00010639294,0.0001358566,0.001284483,0.00007152125,0.00009462426],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00014355169,0.000115987365,0.00010827201,0.000017138434,0.0021154543,0.0005425053,0.0014889033,0.000031537173,0.0000036670265],"category_scores_gemma":[0.00003393529,0.00007288911,0.00003765888,0.000072198,0.00024477433,0.00061607064,0.00029061682,0.00014563285,0.00011164486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050251656,0.000026343216,0.0010816903,0.0000013623063,0.000013148395,0.000022877099,0.00010515417,0.00002688493,0.000046690944,0.9952969,0.0017102836,0.001663673],"study_design_scores_gemma":[0.0007110412,0.000144574,0.009096751,0.000017182581,0.000007445386,0.000018903966,0.00002190556,0.002829322,0.00062927185,0.96621376,0.020119071,0.00019077414],"about_ca_topic_score_codex":0.000020380034,"about_ca_topic_score_gemma":0.00006469066,"teacher_disagreement_score":0.1298643,"about_ca_system_score_codex":0.000022391127,"about_ca_system_score_gemma":0.0000432886,"threshold_uncertainty_score":0.99918365},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.987408,0.000040475734,0.00003424667,0.0020392607,0.00033577782,0.0003245287,0.000016767726,0.00011178522,0.009689158],"genre_scores_gemma":[0.9980036,0.000015488875,0.00018515313,0.00015321969,0.000008926829,0.00014715877,0.00000555078,0.000027667887,0.0014532425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991065,0.00004003543,0.00014939922,0.00023160745,0.00018934502,0.00028306944],"domain_scores_gemma":[0.99792135,0.0002848681,0.00022633215,0.0014118113,0.0000900534,0.00006559329],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00030968277,0.00016652716,0.00018026869,0.000040403927,0.0017590922,0.00010761039,0.0007114437,0.000067085646,0.000055263445],"category_scores_gemma":[0.00013520001,0.00010555325,0.0000854974,0.00016138871,0.00023844892,0.00013588673,0.00014485119,0.00018228756,0.00006646101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015478687,0.00017257496,0.0019364962,0.000013698361,0.00005696234,0.0000037705759,0.0005559766,2.324808e-7,0.000023233923,0.9835417,0.013633852,0.00004599394],"study_design_scores_gemma":[0.0008675567,0.00004771414,0.0037112504,0.00003015816,0.000057454985,0.0000038789303,0.00015449396,0.000015032413,0.00062000536,0.9488893,0.04544817,0.00015496848],"about_ca_topic_score_codex":0.0000313296,"about_ca_topic_score_gemma":0.000097627155,"teacher_disagreement_score":0.034652412,"about_ca_system_score_codex":0.0000146702105,"about_ca_system_score_gemma":0.000021178308,"threshold_uncertainty_score":0.9995405},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9957674,0.00007554095,0.00009173532,0.00023880688,0.002315635,0.00008585426,0.00000262374,0.000047692974,0.0013746774],"genre_scores_gemma":[0.9992851,0.000007853107,0.00060232054,0.000054378306,4.3565598e-7,0.000004748956,5.639392e-7,0.000007611631,0.000036984915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988899,0.00004671934,0.00027397773,0.00027410148,0.0003203877,0.00019486417],"domain_scores_gemma":[0.99783367,0.000092674614,0.00037407974,0.001480103,0.00014363514,0.0000758581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039490417,0.00011516382,0.000246403,0.00012614613,0.00021153681,0.000057104815,0.0012946427,0.0000674054,0.000005022248],"category_scores_gemma":[0.00014335202,0.00010388394,0.00008947643,0.00014554037,0.00014404852,0.00037843187,0.0002701315,0.00010064332,0.000015403119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007951828,0.0002012283,0.001372212,0.000018867231,0.000018366114,0.0000046470755,0.00010594654,0.000024557923,0.0016203047,0.99501324,0.00027952992,0.001333177],"study_design_scores_gemma":[0.00080360577,0.00017123013,0.012300968,0.00006342534,0.000006025496,0.0000013835337,0.000002920701,0.0011970303,0.02129475,0.96404195,0.000009259931,0.00010743193],"about_ca_topic_score_codex":0.00010978461,"about_ca_topic_score_gemma":0.000001003817,"teacher_disagreement_score":0.030971244,"about_ca_system_score_codex":0.0000061420333,"about_ca_system_score_gemma":0.00003394139,"threshold_uncertainty_score":0.42362642},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9695229,0.00010319321,0.0005736049,0.0006259232,0.0013227346,0.00038589287,0.000024146566,0.000024981611,0.027416613],"genre_scores_gemma":[0.99915695,0.000015970323,0.0002836646,0.0000028877737,0.000045930177,0.000050527415,0.000006011748,0.000012192607,0.00042587533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991721,0.000031053336,0.00025331124,0.00019019973,0.00016568325,0.00018768772],"domain_scores_gemma":[0.9985702,0.0003215692,0.0003130634,0.0006288392,0.00009502269,0.00007128133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017327024,0.00011802175,0.00019568983,0.0000118096805,0.0009034883,0.00014133732,0.0003644137,0.00003465011,0.000034646164],"category_scores_gemma":[0.00007699818,0.00008867074,0.00006829782,0.00005727356,0.00042438626,0.00018837584,0.0001607169,0.00012053651,0.000010878866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012037401,0.000053801297,0.006796193,0.0000063419056,0.000027776292,4.0365057e-7,0.00008625255,0.0000020628388,0.00033048127,0.9897999,0.00013085248,0.0027539064],"study_design_scores_gemma":[0.00063913065,0.000029603265,0.0027866552,0.000013002838,0.000022124066,8.457481e-7,0.000332743,0.000114208895,0.004159543,0.9905894,0.0012134063,0.00009933868],"about_ca_topic_score_codex":0.00011023385,"about_ca_topic_score_gemma":8.4305145e-7,"teacher_disagreement_score":0.02963403,"about_ca_system_score_codex":0.000010577825,"about_ca_system_score_gemma":0.000026181868,"threshold_uncertainty_score":0.6948993},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950039,0.00001965148,0.000040687322,0.00029402992,0.00015245262,0.00023691755,0.000008730639,0.00005102317,0.0041926145],"genre_scores_gemma":[0.99924815,0.000009842147,0.00037738789,0.000020297795,0.0000024960164,0.000044064906,0.0000030059061,0.000023444903,0.00027132203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999233,0.000027314221,0.00018463872,0.00018339865,0.0001953156,0.0001763395],"domain_scores_gemma":[0.9983328,0.00011183514,0.00027853384,0.0011181665,0.00009100196,0.000067636465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018627859,0.00012873621,0.00023392771,0.000056447436,0.00029826156,0.000038550796,0.00052987126,0.00006976564,0.000032131273],"category_scores_gemma":[0.00007095442,0.00011073091,0.000074858486,0.00009772502,0.00025460642,0.00013578855,0.00008409783,0.00014117206,0.000013509843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028734401,0.00029340351,0.01704717,0.000041123196,0.00007768519,0.0000020019754,0.00027807886,1.2377126e-7,0.00050997763,0.9811136,0.00040133286,0.00020677426],"study_design_scores_gemma":[0.0008151417,0.00007490037,0.034826033,0.000075885,0.00005855716,0.0000029044943,0.00008152465,0.000017738714,0.007972068,0.9558568,0.00008704381,0.00013138798],"about_ca_topic_score_codex":0.000036985224,"about_ca_topic_score_gemma":0.00001998613,"teacher_disagreement_score":0.025256779,"about_ca_system_score_codex":0.000010098281,"about_ca_system_score_gemma":0.000026944224,"threshold_uncertainty_score":0.45154753},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9331233,0.000528493,0.04385481,0.001426225,0.00773187,0.00057464786,4.0549932e-7,0.00023760746,0.012522658],"genre_scores_gemma":[0.9994001,0.000029115026,0.00037195545,0.000091702495,0.000033551114,0.000034335964,3.472288e-7,0.000006438052,0.000032483465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986783,0.00021189547,0.00021571401,0.0003599332,0.00024027802,0.00029386152],"domain_scores_gemma":[0.9981031,0.00013100466,0.00014105748,0.0015121341,0.000052460182,0.000060250422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012867616,0.000121265286,0.0001543162,0.0000389968,0.0008963089,0.00048672114,0.0017759841,0.00007713548,0.000004311351],"category_scores_gemma":[0.00026867678,0.000092848066,0.000058743444,0.00018923021,0.00011271401,0.0005414196,0.00054628134,0.0004192833,0.000014971629],"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.000017949234,0.00021229888,0.009816773,0.00001530924,0.000012962095,0.00001229735,0.0006362622,0.0024647296,0.000015531297,0.95783687,0.0008079489,0.028151082],"study_design_scores_gemma":[0.000536135,0.000048886002,0.07202329,0.000027783995,0.0000036886054,0.0000106692,0.000013297995,0.48950493,0.00008446571,0.43640324,0.0011592105,0.00018440271],"about_ca_topic_score_codex":0.00021504587,"about_ca_topic_score_gemma":0.000062321786,"teacher_disagreement_score":0.5214336,"about_ca_system_score_codex":0.00006279152,"about_ca_system_score_gemma":0.000028207913,"threshold_uncertainty_score":0.6893774},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98471206,0.00016902896,0.000019152822,0.00015460413,0.0006600922,0.00007356739,0.0000041871945,0.000012965737,0.014194332],"genre_scores_gemma":[0.9990548,0.000019197538,0.00037946066,0.00015931496,0.000041763567,0.0000029478363,0.000014674109,0.00000958961,0.00031825659],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99919075,0.00003799912,0.00019511714,0.00025903704,0.00009265053,0.00022447415],"domain_scores_gemma":[0.99909323,0.000026671258,0.00021770605,0.000513254,0.00008356173,0.000065585766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024960982,0.000121528596,0.0001727893,0.000013782024,0.0001815088,0.000037847567,0.0004216607,0.0001430361,0.000012046812],"category_scores_gemma":[0.00043507785,0.00010408126,0.00009334722,0.000022275097,0.00013100603,0.0000027346014,0.00035945183,0.000088595676,0.0000052463124],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010130879,0.0002426176,0.23549385,0.00003753632,0.00021583398,0.000029105144,0.000048865797,0.0000071588634,0.70277673,0.046838745,0.0037820695,0.010426175],"study_design_scores_gemma":[0.0042517204,0.0016398205,0.16780776,0.00014868329,0.00011597333,0.000051654402,0.000100028294,0.00027865887,0.65807176,0.08490505,0.081522375,0.0011065326],"about_ca_topic_score_codex":0.000031494186,"about_ca_topic_score_gemma":0.0000052226465,"teacher_disagreement_score":0.077740304,"about_ca_system_score_codex":0.000005408667,"about_ca_system_score_gemma":0.000028936223,"threshold_uncertainty_score":0.42443106},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903327,0.00032795253,0.00051047886,0.000092267255,0.0008777017,0.0001292637,0.0000019652011,0.00024533595,0.0074822996],"genre_scores_gemma":[0.9992687,0.00004873309,0.0005504891,0.000010566406,0.0000034983238,0.0000073954016,4.5645447e-7,0.000015917029,0.00009425269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994917,0.000012353362,0.00013712987,0.00009060733,0.00014986272,0.0001183271],"domain_scores_gemma":[0.99909496,0.000037283193,0.00007749161,0.0007209027,0.0000394295,0.000029924406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006647022,0.00008534636,0.00015901428,0.00004368798,0.00012522074,0.000015435173,0.00043160142,0.00004501712,0.000011168776],"category_scores_gemma":[0.00012338602,0.000060806156,0.0000829759,0.00018614497,0.0000644315,0.0001043174,0.00012617419,0.000111708134,0.000009977556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026682408,0.000463089,0.08325325,0.0001910817,0.00075858954,0.000022438098,0.0003681563,0.008712668,0.15855816,0.65422386,0.021393657,0.07202835],"study_design_scores_gemma":[0.00054016407,0.00006730571,0.050560392,0.00006104836,0.00011221764,0.0000024710914,0.000021700827,0.012498883,0.46552724,0.46562368,0.0046326728,0.00035221488],"about_ca_topic_score_codex":0.000021377915,"about_ca_topic_score_gemma":0.000001505419,"teacher_disagreement_score":0.3069691,"about_ca_system_score_codex":0.000030394125,"about_ca_system_score_gemma":0.000003687632,"threshold_uncertainty_score":0.24796031},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95267713,0.00069526536,0.0011457221,0.0041517913,0.010459206,0.00023901691,0.0000021958092,0.00065521064,0.029974485],"genre_scores_gemma":[0.9938236,0.00001608838,0.0052867346,0.00019540131,0.0000023837222,0.000005349548,0.0000011220459,0.000011518133,0.00065783126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998701,0.000038876657,0.00020330635,0.00040753474,0.00029502116,0.00035430188],"domain_scores_gemma":[0.9977399,0.000047396516,0.00017602538,0.0017549152,0.00013469286,0.00014704165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040412115,0.00014968996,0.00017106012,0.00007103868,0.0006844728,0.0005886199,0.0017730934,0.00007122961,0.000013479963],"category_scores_gemma":[0.00013627484,0.00013981533,0.00007040822,0.0001048262,0.00009684995,0.0005826863,0.0005426524,0.00018214529,0.00036482883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013340261,0.000054460914,0.0024660882,0.000004491314,0.000011181615,0.000015238583,0.00008086689,0.000009106013,0.00048081132,0.99137187,0.002543366,0.0029611662],"study_design_scores_gemma":[0.00076693064,0.00006810317,0.0024741753,0.000030125326,0.000006375348,0.000006227071,0.000006437371,0.0052124546,0.0015003823,0.98788863,0.0018287664,0.0002114164],"about_ca_topic_score_codex":0.00009466973,"about_ca_topic_score_gemma":0.000003752229,"teacher_disagreement_score":0.041146465,"about_ca_system_score_codex":0.000019122333,"about_ca_system_score_gemma":0.000054882195,"threshold_uncertainty_score":0.5701504},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9929691,0.00008596544,0.0010584466,0.0001248667,0.0005785866,0.00055509474,0.000016968203,0.00004138333,0.0045696166],"genre_scores_gemma":[0.99280816,0.00001923384,0.006672554,0.0000048473566,0.000006605614,0.000022561304,0.00000240672,0.000023912336,0.00043970862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836266,0.00010674631,0.0004993572,0.0002540901,0.0005361835,0.0002409428],"domain_scores_gemma":[0.9975461,0.00019574008,0.0005889747,0.0010666073,0.000532582,0.00006999915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000790488,0.00014071362,0.00037726044,0.0000681926,0.0002313279,0.000037496797,0.0006357164,0.000068921116,0.0001014468],"category_scores_gemma":[0.0037417158,0.00011774924,0.0000814821,0.000091267735,0.0005264588,0.00018130428,0.00044700582,0.00014901302,0.0000048884017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017807815,0.00067748775,0.008853693,0.00039978052,0.00009801186,0.0000030923786,0.0015199012,0.00013259046,0.0055742674,0.97919625,0.00036819672,0.0029986463],"study_design_scores_gemma":[0.004690759,0.00037068233,0.0027906848,0.00049658667,0.00004615844,0.000001706518,0.00049532496,0.0074640648,0.163148,0.8198183,0.00032210207,0.00035559112],"about_ca_topic_score_codex":0.00004457124,"about_ca_topic_score_gemma":0.000004334514,"teacher_disagreement_score":0.15937792,"about_ca_system_score_codex":0.00007952213,"about_ca_system_score_gemma":0.00010532952,"threshold_uncertainty_score":0.48016745},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98996633,0.000053625092,0.0005874175,0.00035285932,0.00023264936,0.00031053647,0.0000053043213,0.00010432378,0.008386932],"genre_scores_gemma":[0.998559,0.000008347821,0.0010718148,0.00003678354,0.000004221093,0.00007317556,0.000002713406,0.00003615161,0.00020777847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989171,0.00003365107,0.00019391098,0.00029365972,0.00027528117,0.00028640722],"domain_scores_gemma":[0.9979973,0.00021941667,0.00022289275,0.0013281029,0.000108510154,0.00012382102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028795932,0.0001892389,0.00023460864,0.00017654782,0.0007547914,0.00015693509,0.00066169014,0.000096333424,0.00004604795],"category_scores_gemma":[0.00031233983,0.00016354588,0.00009334236,0.00033906693,0.00020572662,0.00015993194,0.00012006711,0.00019993476,0.00004153128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015218448,0.00022474019,0.009430734,0.000029422308,0.000056731136,0.000025981035,0.00007680624,0.0000019581425,0.00007980114,0.98932767,0.00043988854,0.00029102058],"study_design_scores_gemma":[0.00092277996,0.00008046082,0.010950809,0.000039224837,0.00006220763,0.00001380992,0.00004041002,0.000037900307,0.0018091769,0.9850021,0.0008146736,0.00022643477],"about_ca_topic_score_codex":0.000030282346,"about_ca_topic_score_gemma":0.000015903635,"teacher_disagreement_score":0.0085926615,"about_ca_system_score_codex":0.000020314455,"about_ca_system_score_gemma":0.00002460205,"threshold_uncertainty_score":0.6669207},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.956838,0.00016748215,0.0007856134,0.0006401305,0.0048025562,0.00069220865,0.000009701894,0.0004851252,0.035579145],"genre_scores_gemma":[0.985069,0.0000337766,0.0054522906,0.00004471665,0.00004667837,0.000050898747,0.000004531463,0.000053209184,0.00924493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998727,0.000027029842,0.00034128292,0.00022535461,0.00035542317,0.00032388573],"domain_scores_gemma":[0.99798256,0.00031344674,0.00032703852,0.0011658997,0.00011173075,0.00009929423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003057526,0.00018818397,0.00030834237,0.000056653076,0.00054854614,0.00023795548,0.00058446574,0.00010389665,0.0000694986],"category_scores_gemma":[0.0013723734,0.00017889545,0.00010130135,0.000035377016,0.00013713668,0.0012206805,0.00025080668,0.00016076697,0.00032563537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005665255,0.00009777453,0.00015363225,0.00012181688,0.000023435434,0.000007857458,0.00018120544,3.915614e-7,0.0001697578,0.9935868,0.005463211,0.00018847075],"study_design_scores_gemma":[0.0006577207,0.000034131783,0.00037407933,0.00007470117,0.000030680254,0.000004351968,0.00006885998,0.00019338142,0.0023303586,0.9948218,0.0011982734,0.00021167364],"about_ca_topic_score_codex":0.000012767908,"about_ca_topic_score_gemma":0.000008695959,"teacher_disagreement_score":0.02823093,"about_ca_system_score_codex":0.00008025871,"about_ca_system_score_gemma":0.0000255091,"threshold_uncertainty_score":0.7295145},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9981195,0.00010061005,0.000034167773,0.00015721927,0.00059703,0.00015089323,0.000005794109,0.000030626397,0.0008041767],"genre_scores_gemma":[0.9970231,0.000016169544,0.0028947035,0.000010684377,4.9041876e-7,0.0000040359528,0.0000016961983,0.000007660285,0.00004145327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872786,0.0000612331,0.00030501848,0.00032548938,0.00039914623,0.00018123069],"domain_scores_gemma":[0.99732465,0.00008590748,0.0005197063,0.0016069489,0.00040734455,0.000055458902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038878855,0.00014207725,0.00032932687,0.00013220098,0.0001260522,0.00002689582,0.0009386359,0.000058334717,0.0000012180797],"category_scores_gemma":[0.00019012285,0.000110611676,0.000059607522,0.00026186186,0.0003155899,0.00019377093,0.0001937011,0.000107658016,0.0000011061019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027309992,0.0003996969,0.008432424,0.00010025959,0.000032785356,0.0000025793468,0.00036976414,0.000015861655,0.003587193,0.9852641,0.00024185544,0.0015261589],"study_design_scores_gemma":[0.0011223237,0.0008137076,0.023079801,0.00021866558,0.000015484347,0.0000014087885,0.000031266685,0.0003932928,0.117147006,0.85700625,0.00002320574,0.00014758554],"about_ca_topic_score_codex":0.0002448606,"about_ca_topic_score_gemma":0.000006845272,"teacher_disagreement_score":0.12825786,"about_ca_system_score_codex":0.0000064691917,"about_ca_system_score_gemma":0.00009787767,"threshold_uncertainty_score":0.45106134},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9934612,0.00020063652,0.00041133465,0.0025302216,0.0018704347,0.00042197757,0.0000036718318,0.000051010094,0.0010495168],"genre_scores_gemma":[0.9996353,0.000014180001,0.00018371726,0.00006280546,0.0000029743783,0.000016237356,0.0000012680928,0.000011489617,0.00007207567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803597,0.000274648,0.00056646945,0.00024593686,0.00059573574,0.00028122548],"domain_scores_gemma":[0.99526876,0.00096537673,0.00094259874,0.0025608067,0.00020529745,0.000057139547],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012356668,0.00016758917,0.0002813813,0.000050970193,0.0013359933,0.00020111584,0.0024213342,0.00009259925,0.0000023569319],"category_scores_gemma":[0.00044336444,0.00008441018,0.00018832553,0.00036670134,0.0005534054,0.00025469417,0.00059978256,0.00023899638,0.0000132310515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029575829,0.000053695916,0.022570794,0.00003744479,0.000071614166,6.546828e-7,0.0006373592,0.00008958345,0.0005369317,0.9724303,0.0022803708,0.0012882816],"study_design_scores_gemma":[0.0005275871,0.00008714477,0.08965527,0.00009865314,0.00004748759,0.0000029924065,0.000048432863,0.014684747,0.0016538348,0.8928702,0.00021769416,0.000105953965],"about_ca_topic_score_codex":0.0001597723,"about_ca_topic_score_gemma":0.000020051328,"teacher_disagreement_score":0.079560116,"about_ca_system_score_codex":0.000021309717,"about_ca_system_score_gemma":0.00009536141,"threshold_uncertainty_score":0.9999641},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9784051,0.00011238622,0.00022719147,0.0005775527,0.00018151362,0.00018839879,0.000009744912,0.000016825767,0.02028127],"genre_scores_gemma":[0.99865085,0.0000064059045,0.0006108275,0.000010328266,0.000022076054,0.000029099461,0.0000017427294,0.000009909085,0.0006587822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995742,0.0000064589362,0.00012354155,0.00011634267,0.00006242007,0.000117066134],"domain_scores_gemma":[0.9994091,0.00002012545,0.000114444934,0.00036587057,0.000041107676,0.00004937769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000454053,0.0000808171,0.00014592068,0.000008350836,0.00025114036,0.000043340093,0.00015508299,0.000018748557,0.000051262778],"category_scores_gemma":[0.000016101652,0.00006490592,0.000029578623,0.000021883961,0.00016248433,0.00017204799,0.000101264115,0.000059397185,0.000012990298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033891406,0.000061927676,0.0013712166,0.000017429322,0.000017295484,1.0364647e-7,0.0001083947,3.7769757e-7,0.0006442962,0.9961707,0.00007849912,0.0015263972],"study_design_scores_gemma":[0.00029388446,0.000013238649,0.00073098094,0.000030004148,0.000011227124,2.2908353e-7,0.00017884473,0.000034994962,0.008914019,0.9884973,0.0012102672,0.0000849988],"about_ca_topic_score_codex":0.000048799317,"about_ca_topic_score_gemma":3.487998e-7,"teacher_disagreement_score":0.020245712,"about_ca_system_score_codex":0.0000036820593,"about_ca_system_score_gemma":0.000013714068,"threshold_uncertainty_score":0.26467866},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940092,0.00016429636,0.0017651023,0.00013951046,0.0011087577,0.00019633926,0.0000018990266,0.000073027615,0.0025418412],"genre_scores_gemma":[0.99634856,0.000030401226,0.0034972387,0.000012968285,0.0000073861997,0.0000125669485,4.5784205e-7,0.000013388118,0.00007702709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870616,0.0000928815,0.00022803749,0.0003767507,0.0002633043,0.00033288996],"domain_scores_gemma":[0.9983664,0.00021256841,0.00023848987,0.0009511989,0.00010491585,0.00012643113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000695691,0.00014490027,0.0002698935,0.00017067279,0.0004778831,0.00020440493,0.0013868464,0.00006072726,0.0000028660838],"category_scores_gemma":[0.00037575935,0.00014137819,0.00006240297,0.00015891161,0.00032321017,0.0007677481,0.00055340334,0.00023064551,0.0000045973334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004007205,0.00003979666,0.057200342,0.000026535326,0.000030468556,0.00001614447,0.000584853,8.112744e-7,0.0024446724,0.9298547,0.000037863367,0.00972375],"study_design_scores_gemma":[0.0015662163,0.00020996088,0.036652077,0.00008815927,0.0000070997758,0.000016752216,0.00016043927,0.00068517897,0.01036484,0.9498853,0.00015495684,0.00020902757],"about_ca_topic_score_codex":0.000058817117,"about_ca_topic_score_gemma":0.000016945736,"teacher_disagreement_score":0.020548267,"about_ca_system_score_codex":0.000027550046,"about_ca_system_score_gemma":0.00003716546,"threshold_uncertainty_score":0.57652354},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98989767,0.000302126,0.00008770263,0.000031031417,0.004606323,0.00024072596,0.000012741441,0.00006715736,0.0047545503],"genre_scores_gemma":[0.9997099,0.000014785424,0.000021931468,0.0000041528033,0.0000123756745,0.000036598576,0.000001364781,0.000019235074,0.00017967846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948484,0.000013598169,0.00015348059,0.00009273937,0.000091840986,0.00016347581],"domain_scores_gemma":[0.9989784,0.00017156905,0.00007058896,0.0007010815,0.000043947064,0.000034409342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021622446,0.00010347703,0.00015978327,0.000019006024,0.00028989904,0.000050469214,0.0005750803,0.0000550814,0.000008243369],"category_scores_gemma":[0.00006757281,0.000074659525,0.000089197914,0.00003525607,0.00009685329,0.000114118084,0.00003227339,0.00006963391,0.000005539083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010472894,0.000019379702,0.006901807,0.00012188862,0.00007419382,9.3845495e-7,0.00062501023,0.000081565406,0.0016589301,0.98900783,0.0006965172,0.00080144295],"study_design_scores_gemma":[0.0016871912,0.00014541233,0.15212807,0.0001743295,0.00009305978,0.0000047944777,0.00090524333,0.0037023546,0.05098018,0.7668922,0.022742974,0.0005441985],"about_ca_topic_score_codex":0.000029198754,"about_ca_topic_score_gemma":0.000008469256,"teacher_disagreement_score":0.22211567,"about_ca_system_score_codex":0.0000120951645,"about_ca_system_score_gemma":0.000007340977,"threshold_uncertainty_score":0.30445272},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98781216,0.0000819542,0.0000075847156,0.000017809238,0.003750743,0.0000962089,0.0000038390262,0.00003114197,0.008198549],"genre_scores_gemma":[0.9998851,0.0000050427993,0.000005540362,0.000002950625,0.000007014067,0.00000537132,4.2541487e-7,0.000010651935,0.00007790522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995628,0.000038621696,0.0001585404,0.00005985208,0.00009328176,0.000086891254],"domain_scores_gemma":[0.9992921,0.00003295343,0.000104736544,0.0005159936,0.000035109653,0.000019143483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022760639,0.000066429566,0.00013887392,0.00002216795,0.00009607427,0.000011568431,0.00026799727,0.000040184044,0.000012948026],"category_scores_gemma":[0.00005341909,0.00005202126,0.00007541524,0.00004828411,0.00007122416,0.00006848091,0.000032813732,0.00007248488,0.0000046112677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058468477,0.00002608011,0.015238807,0.00008884336,0.000047418485,7.306296e-7,0.00037150376,0.0002058425,0.029349787,0.95358425,0.0005625072,0.0005183973],"study_design_scores_gemma":[0.0014320463,0.000053806245,0.04789543,0.00016016862,0.000029827263,0.000005132257,0.0001426358,0.0012514377,0.22904651,0.7188223,0.0009946417,0.00016607177],"about_ca_topic_score_codex":0.000042620144,"about_ca_topic_score_gemma":0.000006617737,"teacher_disagreement_score":0.23476195,"about_ca_system_score_codex":0.000010224808,"about_ca_system_score_gemma":0.000006295869,"threshold_uncertainty_score":0.21213655},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.975195,0.00080218783,0.0040851827,0.0040450767,0.0046788,0.0008267296,0.000015405252,0.0005536801,0.009797968],"genre_scores_gemma":[0.99327433,0.00018233323,0.0043224134,0.0003213808,0.000014787649,0.000050156403,0.0000012890225,0.00002894922,0.0018043456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736834,0.00015712235,0.00029294845,0.00072876835,0.0007126781,0.0007401569],"domain_scores_gemma":[0.9964638,0.00023962808,0.00025921987,0.002548277,0.0001996798,0.0002894059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006495483,0.0002806677,0.00035745066,0.0001920125,0.0011751879,0.000715454,0.00396183,0.000118237054,0.00006443349],"category_scores_gemma":[0.00031316726,0.00023065048,0.00011926813,0.00032644166,0.00034227758,0.0019044636,0.0007305591,0.00033407146,0.0002623639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020426828,0.00025658787,0.03244949,0.000046569632,0.00010905491,0.00016244387,0.0006485293,0.000010047613,0.0010471693,0.9494787,0.007302366,0.008284799],"study_design_scores_gemma":[0.0013352669,0.0002720724,0.02227761,0.00007434043,0.000013896352,0.000019417728,0.000057772017,0.001277905,0.00976137,0.9576729,0.006805164,0.00043229587],"about_ca_topic_score_codex":0.00008204998,"about_ca_topic_score_gemma":0.000032165353,"teacher_disagreement_score":0.018079374,"about_ca_system_score_codex":0.00007229592,"about_ca_system_score_gemma":0.00015329321,"threshold_uncertainty_score":0.94056535},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97826874,0.0001513014,0.000015922617,0.000010773995,0.0031417545,0.00009183336,0.00001368359,0.000062183644,0.01824381],"genre_scores_gemma":[0.999867,0.00002594529,0.00004663365,0.0000012158715,0.0000037029006,0.000007840435,0.0000013904607,0.000013355976,0.00003289124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940723,0.000023562978,0.0002441907,0.00008375007,0.00011279026,0.00012846282],"domain_scores_gemma":[0.9992083,0.00003371714,0.00011329564,0.0005472937,0.000052535175,0.00004490992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016224939,0.000092550334,0.00021438021,0.00006964398,0.00009877572,0.000012293427,0.0002664242,0.00006006544,0.00003215108],"category_scores_gemma":[0.000030266121,0.000095203504,0.000105282554,0.00006411778,0.00020209418,0.0001017546,0.00003051224,0.00007804334,0.0000068761656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000464579,0.00002854883,0.018095031,0.00012323658,0.00008078456,0.0000016309094,0.00016331709,0.00006883105,0.005953329,0.9745674,0.00043595172,0.00047726615],"study_design_scores_gemma":[0.0011361847,0.00009778479,0.041305445,0.00018513908,0.000058068945,0.0000137703355,0.0003935748,0.00037591258,0.06920427,0.885866,0.0011035406,0.00026035274],"about_ca_topic_score_codex":0.000024164834,"about_ca_topic_score_gemma":0.0000025678694,"teacher_disagreement_score":0.08870147,"about_ca_system_score_codex":0.000009036544,"about_ca_system_score_gemma":0.000008727925,"threshold_uncertainty_score":0.38822863},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.939016,0.00004876632,0.000091197646,0.001499073,0.00088830804,0.00067091663,0.000017225748,0.00007613684,0.0576924],"genre_scores_gemma":[0.99494267,0.0000034075915,0.0005792876,0.00003969147,0.000011742388,0.000047520738,0.0000017191861,0.00003293781,0.0043410254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987971,0.00005611489,0.00030742574,0.00020259325,0.0003893688,0.00024735348],"domain_scores_gemma":[0.99678797,0.00095830817,0.00054121116,0.0015495755,0.00010489717,0.00005802473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000347753,0.00018796403,0.00034908138,0.000032265543,0.00032669128,0.000084496,0.00085869775,0.00009417548,0.00013501837],"category_scores_gemma":[0.0034114982,0.00012477914,0.00010751912,0.00005217843,0.00034950057,0.0001534982,0.00022982318,0.00026983864,0.000047050595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005578127,0.00019456292,0.00033493916,0.00013824565,0.00004354012,0.000008589371,0.00066028367,5.240232e-7,0.00009527502,0.9892883,0.009174118,0.000056070203],"study_design_scores_gemma":[0.00047103956,0.00008350115,0.0004030535,0.00015128982,0.000034607267,0.000006670324,0.00010133347,0.000025885443,0.015893672,0.98234606,0.00034608776,0.00013679426],"about_ca_topic_score_codex":0.000045622874,"about_ca_topic_score_gemma":0.000028694889,"teacher_disagreement_score":0.055926695,"about_ca_system_score_codex":0.000037274047,"about_ca_system_score_gemma":0.000036535755,"threshold_uncertainty_score":0.5088346},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97781485,0.00059768505,0.000014262979,0.00004212655,0.0034002967,0.00011321577,0.0000022667502,0.00008653574,0.017928757],"genre_scores_gemma":[0.9997372,0.00007752183,0.0000071793743,0.0000031663542,0.000006854214,0.000015556943,4.1553392e-7,0.00001531342,0.00013676066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936277,0.000033183835,0.00019468708,0.000081996994,0.00013947187,0.00018789718],"domain_scores_gemma":[0.9989209,0.00010364037,0.00008805233,0.0008145386,0.00003064254,0.00004222253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032733442,0.0000981085,0.0001444512,0.000024414236,0.0003569258,0.000069051224,0.00064182957,0.00004950215,0.000008286469],"category_scores_gemma":[0.000060490325,0.00007298912,0.00007360072,0.000052975432,0.00016768686,0.00012033736,0.00004746689,0.0000964632,0.000034511362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004221639,0.000013262475,0.0019317863,0.0001052213,0.000055164655,0.0000028845568,0.00016451904,0.00004916251,0.0036489114,0.9919311,0.0012021665,0.0008916034],"study_design_scores_gemma":[0.000472213,0.000051198567,0.015492875,0.00013187065,0.000020461688,0.000005606077,0.00012958776,0.0013987516,0.010674289,0.96910644,0.0023351952,0.0001815416],"about_ca_topic_score_codex":0.000009212406,"about_ca_topic_score_gemma":0.000004032632,"teacher_disagreement_score":0.022824688,"about_ca_system_score_codex":0.000011634517,"about_ca_system_score_gemma":0.000007045677,"threshold_uncertainty_score":0.29764098},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9911981,0.00025706302,0.0006073206,0.00023006718,0.005064179,0.00011406122,0.0000017008895,0.0001888575,0.0023386173],"genre_scores_gemma":[0.9960851,0.000013348922,0.0034210512,0.00028467592,0.000001972891,0.000005885935,0.0000016219169,0.000011766113,0.0001745411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859273,0.00006827453,0.00029803152,0.00038074033,0.00034661542,0.00031357547],"domain_scores_gemma":[0.99843985,0.00007968622,0.000099183686,0.0008467132,0.00040860823,0.0001259699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037698465,0.00015164519,0.00021669926,0.00017373293,0.00013677312,0.000056791505,0.0008483577,0.00008068458,0.000028920438],"category_scores_gemma":[0.000041474108,0.00013716657,0.00008883562,0.00079957425,0.00032288147,0.0003015102,0.00026299624,0.00011548235,0.00011831957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048824063,0.00012740692,0.0022682296,0.000010564781,0.000017827628,0.0000038428075,0.0005687943,0.0000019821928,0.0031783986,0.985968,0.006997284,0.0008527856],"study_design_scores_gemma":[0.00065755466,0.00029384033,0.0016614341,0.000033353477,0.000008384991,0.000005645011,0.000025831758,0.00089869316,0.013978009,0.9805591,0.0016765912,0.00020154144],"about_ca_topic_score_codex":0.00005123002,"about_ca_topic_score_gemma":0.0000032338146,"teacher_disagreement_score":0.01079961,"about_ca_system_score_codex":0.000011700579,"about_ca_system_score_gemma":0.00006752377,"threshold_uncertainty_score":0.55934906},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.960256,0.0009037868,0.000090293506,0.00005813088,0.006561513,0.00019877059,0.000004386061,0.00041665495,0.031510502],"genre_scores_gemma":[0.99926674,0.000033525357,0.000014725181,0.00005921019,0.00004638375,0.000032815784,0.000001189389,0.000040328152,0.00050510536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989996,0.00006639495,0.0002180436,0.00016276391,0.00018766536,0.00036553977],"domain_scores_gemma":[0.99917614,0.00011800015,0.000029307628,0.0004915476,0.00008173391,0.000103278755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032813614,0.0001737921,0.00014923191,0.00004928498,0.00032973386,0.00008431147,0.00039729645,0.000096170625,0.000056371242],"category_scores_gemma":[0.000036464415,0.00013418484,0.0000916687,0.00031111162,0.00017743406,0.00007000729,0.000038402886,0.00014741837,0.00075147045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017992426,0.00002288207,0.00021031593,0.000017922066,0.00011639821,0.000022639684,0.00048338072,0.000049180184,0.002309389,0.9866395,0.006757586,0.0033528288],"study_design_scores_gemma":[0.0005031241,0.00020020381,0.0007415672,0.00003704463,0.000020307227,0.00006723672,0.00016576501,0.000558385,0.012766458,0.929191,0.055434167,0.0003147713],"about_ca_topic_score_codex":0.000013588582,"about_ca_topic_score_gemma":0.000018067622,"teacher_disagreement_score":0.057448518,"about_ca_system_score_codex":0.000027351045,"about_ca_system_score_gemma":0.000019072722,"threshold_uncertainty_score":0.9658883},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99150944,0.00026907405,0.00071373157,0.00020807523,0.0060046115,0.0002022066,0.0000017553868,0.0002745813,0.0008165279],"genre_scores_gemma":[0.97481954,0.0000069045022,0.024936773,0.00014003283,0.000013890489,0.0000035843548,0.0000037001994,0.000018918488,0.000056672918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997933,0.00013875218,0.00049241504,0.0005837086,0.00040286273,0.0004493096],"domain_scores_gemma":[0.99822795,0.0000886827,0.0002538845,0.0008140566,0.00047564064,0.00013977765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067853177,0.00021809843,0.00034305057,0.00020871886,0.00026742276,0.00009218796,0.00070154027,0.00006997301,0.0000098767705],"category_scores_gemma":[0.000108085536,0.00021036583,0.00012967277,0.00086275133,0.00022893956,0.00024807692,0.0004158391,0.00016776321,0.000052291354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016381475,0.0001431913,0.002299136,0.000023088793,0.000047047477,0.000007309863,0.00080054026,0.000041865766,0.039624184,0.9522803,0.001711362,0.0030056064],"study_design_scores_gemma":[0.002696948,0.0005670668,0.0024430328,0.00012059244,0.000032044074,0.000047453934,0.000029768013,0.021108149,0.060080137,0.9120529,0.00025519848,0.00056665554],"about_ca_topic_score_codex":0.00011196538,"about_ca_topic_score_gemma":0.0000026026871,"teacher_disagreement_score":0.040227335,"about_ca_system_score_codex":0.000019143996,"about_ca_system_score_gemma":0.00009352045,"threshold_uncertainty_score":0.857847},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97442436,0.000054242963,0.006742065,0.00014451731,0.00089804333,0.00040601086,0.0000044530834,0.00015274723,0.017173536],"genre_scores_gemma":[0.970098,0.000007836624,0.025066165,0.00034126686,0.000039702598,0.000064945634,0.0000014223849,0.00003993464,0.00434073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998807,0.000047580714,0.00022953229,0.00034208602,0.00026797788,0.00030581106],"domain_scores_gemma":[0.99893636,0.00019744394,0.00007633604,0.0005542464,0.00009921037,0.0001364343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001943463,0.00018433775,0.0002489638,0.00006993642,0.00018755726,0.00007667339,0.00032924308,0.00008199407,0.00003386814],"category_scores_gemma":[0.00048940175,0.00017182292,0.00003496815,0.00019157576,0.00017226656,0.000113606824,0.00029885783,0.00014983953,0.00006620127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007043707,0.00011386272,0.00056398695,0.000045522585,0.000022597536,0.000002158304,0.0013286178,3.9679723e-8,0.00035471743,0.9938815,0.0028991427,0.0007807638],"study_design_scores_gemma":[0.0005170681,0.00008856966,0.002118901,0.00003098589,0.000018726007,0.000008661817,0.00012307336,0.00005166282,0.0017451299,0.99449074,0.0005985166,0.0002079615],"about_ca_topic_score_codex":0.000006626878,"about_ca_topic_score_gemma":0.0000043210325,"teacher_disagreement_score":0.018324101,"about_ca_system_score_codex":0.000051961546,"about_ca_system_score_gemma":0.000020488314,"threshold_uncertainty_score":0.7006735},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901828,0.000086048894,0.0009170157,0.000007627621,0.0016018498,0.00022097325,0.000005330207,0.00092519535,0.0060531124],"genre_scores_gemma":[0.999363,0.000002293465,0.00031768534,0.000046507226,0.00006929051,0.00003907712,0.000016915703,0.00008070326,0.00006452942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872905,0.00009514317,0.00024419057,0.00027693744,0.00020789061,0.000446793],"domain_scores_gemma":[0.9991161,0.00006062827,0.000050554216,0.0005039583,0.000070908296,0.00019783167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037417962,0.0002479065,0.00024962248,0.00009338468,0.00021901996,0.00007290605,0.00029851033,0.00011922566,0.00011584833],"category_scores_gemma":[0.00001543883,0.00022994347,0.000049964434,0.00033693385,0.00010866397,0.0003276437,0.000027827606,0.00018678416,0.00015340807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007685007,0.00019017853,0.008591889,0.00010144612,0.00019556846,0.000066451474,0.0019075747,0.00026607554,0.01383944,0.96880037,0.0039086654,0.0020554864],"study_design_scores_gemma":[0.005729302,0.0038218023,0.019333927,0.00031022125,0.00018417733,0.00021048162,0.0014090397,0.04534468,0.040357005,0.85803443,0.022701364,0.0025635862],"about_ca_topic_score_codex":0.000026406684,"about_ca_topic_score_gemma":0.000026124988,"teacher_disagreement_score":0.110765964,"about_ca_system_score_codex":0.0000499963,"about_ca_system_score_gemma":0.000017124396,"threshold_uncertainty_score":0.9376823},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6757418,0.0003665888,0.091929495,0.0026831338,0.027518038,0.0012890047,0.000037125727,0.0020022935,0.19843253],"genre_scores_gemma":[0.9862733,0.000012703076,0.010215227,0.0005221503,0.00008885244,0.000015949972,0.000032976048,0.00002353669,0.0028153174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840033,0.000033937627,0.00022863712,0.00048265661,0.00037345896,0.0004809513],"domain_scores_gemma":[0.9987607,0.000045095476,0.000108566266,0.0008687631,0.00011537002,0.00010149913],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042643314,0.00017830062,0.00018411539,0.00012219943,0.00030615125,0.00056688953,0.0015285405,0.000061339844,0.000042107407],"category_scores_gemma":[0.000028852673,0.00017937821,0.00004890093,0.00068066193,0.00007681684,0.0013820517,0.00041139097,0.00014044945,0.0013975968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006635848,0.00011079934,0.0021621704,0.000017461514,0.000047775222,0.000051909392,0.00031108112,0.0000018157174,0.00042480676,0.84948194,0.1395347,0.007848881],"study_design_scores_gemma":[0.002868924,0.00062336103,0.01057943,0.00011552113,0.000033611053,0.000015233161,0.00006577641,0.075919114,0.0056535206,0.5657433,0.33724213,0.0011400582],"about_ca_topic_score_codex":0.00012349199,"about_ca_topic_score_gemma":0.000007114716,"teacher_disagreement_score":0.3105315,"about_ca_system_score_codex":0.000039994273,"about_ca_system_score_gemma":0.00004306792,"threshold_uncertainty_score":0.99937993},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92870927,0.000296087,0.0015877641,0.0064442363,0.014472744,0.000373973,0.000004162218,0.0013968324,0.046714947],"genre_scores_gemma":[0.9904209,0.000014591381,0.0072431546,0.0009587231,0.0000059144622,0.0000037809666,0.0000027469716,0.000014357279,0.0013358678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982835,0.000078741774,0.00030051498,0.00056836253,0.00038340472,0.000385474],"domain_scores_gemma":[0.99817353,0.00011745293,0.00011784962,0.001190262,0.00014433073,0.00025657564],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040975623,0.00018503302,0.00017184363,0.0002025557,0.00023923244,0.00013861983,0.00096604927,0.00009651669,0.000011824159],"category_scores_gemma":[0.00009955776,0.00016512151,0.00008310337,0.00096760417,0.00008588119,0.0002306547,0.00021355157,0.00018471973,0.0008085905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014375108,0.000061027582,0.00009248268,0.000001191251,0.000011000549,0.0000071729023,0.00021338461,0.000002068351,0.00024715782,0.93439364,0.054698683,0.010257826],"study_design_scores_gemma":[0.001433911,0.0005775191,0.000774987,0.000036175643,0.000004661936,0.0000055810024,0.000004620269,0.00091115444,0.0051579075,0.9803302,0.010546611,0.00021662671],"about_ca_topic_score_codex":0.0001221123,"about_ca_topic_score_gemma":0.0000084853955,"teacher_disagreement_score":0.06171161,"about_ca_system_score_codex":0.00002189456,"about_ca_system_score_gemma":0.00008334282,"threshold_uncertainty_score":0.9999694},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96756464,0.00002796157,0.000034566987,0.00019491138,0.0010115831,0.00036990788,0.0000051830198,0.00018703486,0.030604206],"genre_scores_gemma":[0.9975957,0.0000061771148,0.0008128145,0.0000865774,0.000032781645,0.00004198923,0.000004858462,0.00007421086,0.0013448396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979933,0.00018005034,0.0002563471,0.00038027109,0.0006361987,0.00055383303],"domain_scores_gemma":[0.9981994,0.00035336954,0.000075791366,0.0008652587,0.00030178367,0.00020441096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080069306,0.00023296812,0.00029078446,0.00018445376,0.00022561853,0.00009239526,0.0005656416,0.00013863845,0.00059759954],"category_scores_gemma":[0.00027867997,0.00019051178,0.000067632536,0.0005273438,0.00039861113,0.00018040228,0.00019755348,0.0003419369,0.00060890947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011945963,0.0002367243,0.0043879496,0.00004866495,0.0000741755,0.000035074452,0.0007489823,2.8887149e-8,0.00047031874,0.9852905,0.008098959,0.00048912544],"study_design_scores_gemma":[0.0014559533,0.000634487,0.0022013572,0.000060807935,0.000024780564,0.000028971292,0.00020778709,0.000010670635,0.0066434345,0.9865639,0.0018930824,0.00027474485],"about_ca_topic_score_codex":0.000029955989,"about_ca_topic_score_gemma":0.00006609791,"teacher_disagreement_score":0.030031107,"about_ca_system_score_codex":0.000084667096,"about_ca_system_score_gemma":0.000104146886,"threshold_uncertainty_score":0.78265023},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9953973,0.00006741903,0.000012422811,0.0007828567,0.00039789997,0.0002233589,0.0000046330924,0.000053887634,0.003060203],"genre_scores_gemma":[0.9989825,0.0000127676085,0.00009505513,0.0002888347,0.000033893903,0.000025959811,0.000001926298,0.0000225632,0.0005365145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915564,0.00007447164,0.00021279116,0.00020596234,0.00016113887,0.00018998714],"domain_scores_gemma":[0.9987016,0.00045068614,0.00011510012,0.00056278886,0.00009104333,0.00007883708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029879695,0.00014274108,0.00018288147,0.000082161925,0.00021576416,0.00002863534,0.0002429941,0.00008956947,0.00008824608],"category_scores_gemma":[0.00017132524,0.000098405784,0.00006772906,0.00032851653,0.00034751045,0.00009899238,0.000067188594,0.0001348646,0.000025792424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020635325,0.00012264014,0.0009910502,0.000008654399,0.000041297844,2.554747e-7,0.0005637414,6.4298575e-8,0.0013710059,0.9893701,0.0073335893,0.0001769825],"study_design_scores_gemma":[0.00051417813,0.000116446085,0.0033838549,0.000029240211,0.00003152789,0.0000019698102,0.00009315117,0.000020337668,0.009472372,0.9838179,0.0023974746,0.00012159286],"about_ca_topic_score_codex":0.000018967066,"about_ca_topic_score_gemma":0.0000066940347,"teacher_disagreement_score":0.0081013655,"about_ca_system_score_codex":0.000009434028,"about_ca_system_score_gemma":0.0000327473,"threshold_uncertainty_score":0.40128717},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98594373,0.0000135157325,0.000047123693,0.00046562174,0.0002845491,0.0002093524,0.0000038133744,0.000048787046,0.012983504],"genre_scores_gemma":[0.99955344,0.000003577758,0.00007329111,0.00011969752,0.000005821853,0.00003915046,9.1024907e-7,0.000014922957,0.00018915726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929017,0.000080617734,0.00018800226,0.00013467275,0.0001624874,0.00014406726],"domain_scores_gemma":[0.99842685,0.00072081253,0.00011855549,0.00060788356,0.000090291054,0.00003561952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003904416,0.000098093304,0.00013359629,0.000052719275,0.00015936565,0.000011125222,0.0003385966,0.00005558484,0.00014660726],"category_scores_gemma":[0.00020011414,0.0000678942,0.00008329227,0.0003207396,0.000242364,0.00003071936,0.00004391718,0.00012886808,0.00009722561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013972996,0.00026392203,0.0004194442,0.000008000131,0.000027562079,2.3871021e-7,0.0002606656,2.4099258e-8,0.00050821534,0.9919786,0.0062539508,0.00026543997],"study_design_scores_gemma":[0.00025816791,0.00014509125,0.00128744,0.000021672524,0.00001803471,8.1008443e-7,0.000082615894,0.0000229546,0.012983523,0.98458904,0.00051622145,0.00007443552],"about_ca_topic_score_codex":0.0000068174186,"about_ca_topic_score_gemma":0.0000064555306,"teacher_disagreement_score":0.013609737,"about_ca_system_score_codex":0.000009236222,"about_ca_system_score_gemma":0.000017148031,"threshold_uncertainty_score":0.27686453},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919661,0.00011360175,0.0004529195,0.0002523529,0.00021616174,0.00019883539,0.000012836608,0.000023835872,0.0067633004],"genre_scores_gemma":[0.9988106,0.00000433504,0.00073143974,0.000018850773,0.00006568568,0.000029134533,0.000002014853,0.0000115274115,0.00032639375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994735,0.000014005959,0.0001794785,0.00013279071,0.00006122237,0.00013901126],"domain_scores_gemma":[0.9995726,0.000035183097,0.000085316104,0.00020492221,0.000046661386,0.00005531263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007074823,0.00009055368,0.00017012718,0.000018013756,0.00010618793,0.000018007322,0.000093585186,0.000020942733,0.00008912886],"category_scores_gemma":[0.000009605833,0.00007173706,0.000031974592,0.00007576076,0.00018890567,0.0001059617,0.00007220018,0.000046893478,0.000028337943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073115493,0.000063837986,0.00020155053,0.000013013111,0.000020099045,4.6610566e-8,0.00018433333,1.879459e-7,0.006485279,0.9917358,0.00011741846,0.001171078],"study_design_scores_gemma":[0.00026734572,0.000044023174,0.00017764985,0.000027605895,0.000012878881,2.3088752e-7,0.0001404653,0.000044484375,0.066023424,0.93186533,0.0013096788,0.00008685316],"about_ca_topic_score_codex":0.000027097321,"about_ca_topic_score_gemma":1.6785481e-7,"teacher_disagreement_score":0.059870485,"about_ca_system_score_codex":0.000004959276,"about_ca_system_score_gemma":0.000017066475,"threshold_uncertainty_score":0.29253522},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9826546,0.00029559704,0.013796351,0.0010896072,0.0012490123,0.00032852808,0.0000021694916,0.000068818204,0.00051534554],"genre_scores_gemma":[0.99956113,0.000021102036,0.0002500083,0.000064760985,0.000032705466,0.000028155759,0.000001295482,0.0000032933497,0.0000375393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941605,0.000036397385,0.00016680227,0.00016295303,0.000104704064,0.00011308847],"domain_scores_gemma":[0.9994687,0.00011423359,0.000085773645,0.00020560225,0.00008326129,0.000042437627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017301008,0.00006523843,0.00007743792,0.000036048805,0.0002668091,0.00009322721,0.00032382848,0.000026248576,0.00000196499],"category_scores_gemma":[0.000025088248,0.000050017676,0.000019894016,0.00016363035,0.00007610469,0.00019903854,0.00012190691,0.000044298708,0.000026770735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064070687,0.0000234792,0.000082054685,0.000004307765,0.0000071989316,1.8166293e-7,0.00022289202,3.973465e-7,0.0037185661,0.96224433,0.0002886813,0.033401486],"study_design_scores_gemma":[0.0014813126,0.000574997,0.046662398,0.000027904951,0.000020777747,0.000022474702,0.000032317406,0.056434736,0.036182195,0.84474635,0.0134053575,0.00040916345],"about_ca_topic_score_codex":0.000009205505,"about_ca_topic_score_gemma":0.000002552499,"teacher_disagreement_score":0.11749798,"about_ca_system_score_codex":0.00001042785,"about_ca_system_score_gemma":0.00004048108,"threshold_uncertainty_score":0.20521069},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9704972,0.00009065998,0.0007745066,0.00028440327,0.0011621347,0.00036613087,0.000005486873,0.0003313538,0.026488112],"genre_scores_gemma":[0.99292094,0.000017383732,0.0060082916,0.000085680076,0.000026137437,0.000054188185,0.0000016769833,0.000044930777,0.0008407494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871707,0.00008270708,0.0003056494,0.00029324854,0.0002480599,0.0003532773],"domain_scores_gemma":[0.99811244,0.0009666129,0.000110930116,0.0004635567,0.00019236129,0.00015410791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042588072,0.00021391318,0.00033520363,0.000060072907,0.00029650546,0.000053228214,0.00018574408,0.00010852384,0.00015121614],"category_scores_gemma":[0.001563582,0.00019305435,0.000055663128,0.00026838158,0.00048867165,0.00020779727,0.00016064667,0.00017136578,0.00018790124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001595083,0.00017173572,0.00022565995,0.00006529607,0.000024795041,0.0000054819234,0.000441261,4.314382e-8,0.0001756543,0.99570996,0.0029745894,0.00018959095],"study_design_scores_gemma":[0.0006911761,0.00029901386,0.00013544619,0.000044739074,0.000041583986,0.000019838542,0.00013584299,0.00007968034,0.00404875,0.99170375,0.0025696594,0.0002305076],"about_ca_topic_score_codex":0.0000016305091,"about_ca_topic_score_gemma":0.0000018266854,"teacher_disagreement_score":0.025647363,"about_ca_system_score_codex":0.000057995345,"about_ca_system_score_gemma":0.000027366503,"threshold_uncertainty_score":0.7872528},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9932797,0.000013581299,0.000021080024,0.000060966227,0.00029568534,0.0002653255,0.0000127887115,0.000014101812,0.006036754],"genre_scores_gemma":[0.99920404,0.000005282094,0.0006491002,0.0000052988157,0.000003992886,0.000016881379,8.003508e-7,0.000014520269,0.0001001075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989776,0.000120315046,0.00046347076,0.00012130345,0.00017081584,0.00014649623],"domain_scores_gemma":[0.9987529,0.00028031258,0.00033273845,0.00054088404,0.000067514346,0.000025660305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046683723,0.00010035098,0.00027681942,0.000059919963,0.00004790038,0.0000032986406,0.00037599078,0.000069944224,0.00005820587],"category_scores_gemma":[0.0001074317,0.00007791924,0.00013206426,0.00051813916,0.00025466928,0.000050047118,0.00007896,0.000106349275,0.0000052771693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017873595,0.00028135296,0.016093075,0.00012558137,0.000021662943,2.8485235e-7,0.0010838198,3.6375323e-7,0.0121559305,0.9699308,0.00019478636,0.00009441981],"study_design_scores_gemma":[0.0005974005,0.00002984039,0.0121408915,0.00015551179,0.000025635996,0.000002278169,0.00014977057,0.0000044015665,0.05319508,0.9336065,0.000025489731,0.000067173525],"about_ca_topic_score_codex":0.000040979638,"about_ca_topic_score_gemma":0.000024143543,"teacher_disagreement_score":0.04103915,"about_ca_system_score_codex":0.000009360638,"about_ca_system_score_gemma":0.000019524454,"threshold_uncertainty_score":0.31774545},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9462205,0.0022812006,0.000016715636,0.00005584437,0.006321718,0.0001879674,0.000014669052,0.00019430008,0.04470709],"genre_scores_gemma":[0.99910605,0.00023085272,0.000031587235,0.000050114064,0.0000879784,0.000012460102,0.0000034988984,0.00005802479,0.00041944816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986921,0.00009258618,0.00028631496,0.0003109268,0.0001769065,0.00044117993],"domain_scores_gemma":[0.99917513,0.00008991015,0.000059209426,0.00043760182,0.000067515146,0.00017064405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034723373,0.00027730627,0.00032023934,0.00009345792,0.00021687863,0.00018575498,0.00020491713,0.00020886246,0.0001424261],"category_scores_gemma":[0.000036262907,0.00029644652,0.00007294706,0.00024496502,0.00018663515,0.00022528028,0.000088211615,0.00021478707,0.000529667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019536332,0.00005080519,0.008572976,0.0001991756,0.00010215364,0.000015756896,0.00054927636,0.0000058900955,0.0029820767,0.9832257,0.0025175312,0.0017591077],"study_design_scores_gemma":[0.0020818536,0.0005415216,0.018732987,0.00053322845,0.000110225206,0.000046541514,0.00024975324,0.0020694535,0.013040053,0.8794586,0.082193814,0.00094197347],"about_ca_topic_score_codex":0.000040498326,"about_ca_topic_score_gemma":0.0000018732611,"teacher_disagreement_score":0.10376712,"about_ca_system_score_codex":0.00004287056,"about_ca_system_score_gemma":0.000019674457,"threshold_uncertainty_score":0.99994874},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98684675,0.00034280942,0.0018273091,0.00038790144,0.0033904817,0.0001616895,0.000007992287,0.000409263,0.006625797],"genre_scores_gemma":[0.99717987,0.000013439625,0.0023672665,0.00028076203,0.000043207438,0.000010722104,0.000006695789,0.00001832904,0.00007973447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983639,0.000085339016,0.0003640509,0.0004487539,0.0003528947,0.00038506763],"domain_scores_gemma":[0.9981163,0.0002764471,0.00018352289,0.0010586127,0.00022876658,0.0001363362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036532525,0.00020923396,0.00030725787,0.00015344637,0.00012535801,0.000053437594,0.0013625695,0.000105127154,0.00011236501],"category_scores_gemma":[0.00011900463,0.00019837757,0.00012511773,0.0008364127,0.0002959109,0.0004029887,0.00037139154,0.00015173406,0.00011767284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012878005,0.00016745474,0.0013637145,0.00002682937,0.00004663299,0.000029590796,0.0003964313,4.8412153e-7,0.009205757,0.97563183,0.010702973,0.0024153988],"study_design_scores_gemma":[0.0010215202,0.0003894465,0.0053576757,0.00009358781,0.000014157764,0.000047856312,0.000052265226,0.002368885,0.09076453,0.8978065,0.0017186283,0.00036494542],"about_ca_topic_score_codex":0.000059085876,"about_ca_topic_score_gemma":0.000004646708,"teacher_disagreement_score":0.08155877,"about_ca_system_score_codex":0.000023380979,"about_ca_system_score_gemma":0.00008633978,"threshold_uncertainty_score":0.80896026},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9867205,0.00060697994,0.009191769,0.00054368144,0.0015003928,0.00023249883,0.0000033782699,0.000226792,0.0009740122],"genre_scores_gemma":[0.9932828,0.000041847143,0.0062907417,0.00015977793,0.000022523322,0.000011617317,0.0000010107959,0.000018072982,0.00017158632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773675,0.00023035519,0.00025798782,0.0005246284,0.00062766275,0.00062261336],"domain_scores_gemma":[0.9982091,0.00041890985,0.00016552652,0.0006621755,0.00033316138,0.00021113288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009065439,0.00019785615,0.00022574645,0.00025130244,0.0004567796,0.00024946564,0.0008883329,0.000110091416,0.000017189386],"category_scores_gemma":[0.00027809292,0.00019615956,0.00008064469,0.0009932793,0.00024726597,0.0009457228,0.0005222942,0.00022589783,0.00004301529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017959637,0.00009705011,0.08275793,0.000015329462,0.000068252586,0.000014555051,0.00062356086,0.0000020113769,0.0024865894,0.9099046,0.0007888028,0.0032233638],"study_design_scores_gemma":[0.000935315,0.0003012672,0.025310278,0.000037442805,0.000017915692,0.000011723467,0.000049844028,0.0061660414,0.0050634616,0.95968467,0.002074893,0.00034714513],"about_ca_topic_score_codex":0.00004134543,"about_ca_topic_score_gemma":0.000012185449,"teacher_disagreement_score":0.057447646,"about_ca_system_score_codex":0.0001423717,"about_ca_system_score_gemma":0.00006833998,"threshold_uncertainty_score":0.79991543},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9774344,0.000020221703,0.00005706692,0.00044227843,0.0006318037,0.00022883293,0.0000059374256,0.000069804606,0.02110964],"genre_scores_gemma":[0.99866706,0.000004472542,0.00088611455,0.00021409047,0.000031051724,0.000013198087,0.0000014384585,0.000030047313,0.0001525428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988132,0.00011699147,0.0003147045,0.00019801776,0.00030775747,0.00024928784],"domain_scores_gemma":[0.99804926,0.0009250359,0.00025780796,0.00053275283,0.00018129307,0.000053843985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005318978,0.00017273209,0.00026702552,0.00006763378,0.00022977102,0.000026632104,0.0003704249,0.0000720555,0.000066762375],"category_scores_gemma":[0.00054963795,0.00012219958,0.00010494005,0.0002395962,0.0003415315,0.00007017599,0.00010380989,0.00023626545,0.00007425737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026639067,0.00015114852,0.0008428108,0.000025663368,0.000043664884,0.0000023358407,0.0046128514,3.8629307e-7,0.000401305,0.9868845,0.006715565,0.000293174],"study_design_scores_gemma":[0.0004938124,0.0003294817,0.0022270735,0.000108051914,0.000023365608,0.0000022817896,0.00027102098,0.00008397871,0.020780109,0.9749388,0.0005992506,0.0001427528],"about_ca_topic_score_codex":0.000053152064,"about_ca_topic_score_gemma":0.000014402729,"teacher_disagreement_score":0.021232631,"about_ca_system_score_codex":0.000029379651,"about_ca_system_score_gemma":0.000029747445,"threshold_uncertainty_score":0.49831542},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9565236,0.000021137486,0.0000051793972,0.00003867171,0.0021026782,0.00014769041,0.000007674813,0.00007554089,0.041077808],"genre_scores_gemma":[0.9986748,0.0000086396685,0.0008480193,0.00015542476,0.000016008049,0.0000048459406,0.000002011713,0.000032930348,0.00025729512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880874,0.00009485364,0.00030864315,0.00022792461,0.00030107956,0.00025876635],"domain_scores_gemma":[0.9984616,0.0004549247,0.00017060405,0.00069917395,0.00012962925,0.000084041196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032667344,0.00017819459,0.00028385583,0.00011262921,0.00017854775,0.000011800326,0.00038263045,0.00013268313,0.00021733079],"category_scores_gemma":[0.00034652033,0.00014845496,0.00013647997,0.00028328766,0.00035273077,0.000059352686,0.000110035864,0.0001777671,0.0000252842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056337114,0.0001088402,0.0008046102,0.000029879053,0.00006777633,0.0000029591029,0.0009913064,1.1355416e-7,0.00014683546,0.99120414,0.0063710255,0.00021615352],"study_design_scores_gemma":[0.0006615482,0.0003099671,0.00077433354,0.00004619384,0.0000305664,0.000002882791,0.00010237629,0.000010323238,0.004745177,0.99218696,0.00096385396,0.00016583863],"about_ca_topic_score_codex":0.000016945089,"about_ca_topic_score_gemma":0.0000059269582,"teacher_disagreement_score":0.042151205,"about_ca_system_score_codex":0.000023708575,"about_ca_system_score_gemma":0.000020154863,"threshold_uncertainty_score":0.6053817},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9734314,0.000043056458,0.00012457882,0.000071837734,0.0009867565,0.00021618817,0.000004405274,0.0000596635,0.025062077],"genre_scores_gemma":[0.986263,0.0000049676905,0.011594035,0.0000061713076,0.000017425924,0.0000074310647,8.803126e-7,0.000027982422,0.0020781455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989039,0.00003427562,0.00041863887,0.00016199217,0.00029818193,0.00018305774],"domain_scores_gemma":[0.99834794,0.00037852017,0.00025809548,0.0005258342,0.00044886064,0.000040761992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025594578,0.00011778703,0.00034839901,0.000055029628,0.000031080257,0.0000060454995,0.00022912446,0.00005965871,0.00016928888],"category_scores_gemma":[0.001907984,0.00010731063,0.00005681873,0.00023723602,0.00035161086,0.00013785662,0.00010803518,0.00007545587,0.000059296934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010767666,0.00017118714,0.00031109081,0.00041936547,0.000034788754,0.0000010518048,0.00075781124,4.680253e-8,0.0051090186,0.9874802,0.005669843,0.00003481161],"study_design_scores_gemma":[0.00029061956,0.00009228836,0.000096335454,0.00008795135,0.000026942871,0.0000020905356,0.00013908278,0.000006876166,0.19319203,0.80573887,0.0002431956,0.0000837472],"about_ca_topic_score_codex":0.000012532907,"about_ca_topic_score_gemma":0.000004136247,"teacher_disagreement_score":0.18808301,"about_ca_system_score_codex":0.000021853757,"about_ca_system_score_gemma":0.000035205572,"threshold_uncertainty_score":0.43760005},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844921,0.000024274344,0.0106291585,0.00027904095,0.0017767343,0.00032133382,0.0000026544758,0.00018891355,0.0022857953],"genre_scores_gemma":[0.99649376,0.0000062405447,0.0031516943,0.00020233782,0.000029508312,0.000018020879,6.8037633e-7,0.00002951282,0.000068251466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753445,0.00037176535,0.00041879495,0.0005621797,0.00056137476,0.0005514219],"domain_scores_gemma":[0.9966896,0.0015294617,0.00027861362,0.001099492,0.00027889883,0.00012390039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013538211,0.00025849775,0.00031857347,0.000286986,0.00042976032,0.00008789346,0.0019763617,0.00009120699,0.000032740292],"category_scores_gemma":[0.0010925861,0.00017474382,0.00013261112,0.0012062686,0.000492265,0.00038255032,0.0005237911,0.0005689441,0.000049653194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019537211,0.00012234438,0.0040327897,0.000020072368,0.00006340172,0.000014395963,0.0028399029,0.000008007198,0.0017688179,0.98798853,0.00024410288,0.0027022513],"study_design_scores_gemma":[0.00078261114,0.0010681781,0.0013382635,0.00023126576,0.000009610876,0.000019844496,0.0012037064,0.006961982,0.036312617,0.9516498,0.00010942772,0.00031271524],"about_ca_topic_score_codex":0.00008484783,"about_ca_topic_score_gemma":0.000053194482,"teacher_disagreement_score":0.036338765,"about_ca_system_score_codex":0.00008400404,"about_ca_system_score_gemma":0.000074974676,"threshold_uncertainty_score":0.7125846},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98639786,0.000064976404,0.00031672473,0.0008797955,0.0012315474,0.00012215925,3.8569783e-7,0.00004583198,0.010940746],"genre_scores_gemma":[0.9989396,0.000003697608,0.000048921098,0.00080547103,0.0001284357,0.000007313012,0.0000037242828,0.0000112721755,0.000051604587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943644,0.0000053395256,0.00014184111,0.00012434674,0.000113387076,0.00017863084],"domain_scores_gemma":[0.99948627,0.000026783315,0.00012998027,0.00015004602,0.00020333998,0.000003609352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034926127,0.00008943971,0.00009994169,0.00022315452,0.00022903527,0.00009039271,0.00011707921,0.000039469032,0.00004558633],"category_scores_gemma":[0.00004740756,0.00006503031,0.000025368563,0.0010498182,0.00013633673,0.00053394685,0.00007753823,0.00006255668,0.000021120035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010038201,0.000020407639,0.007810388,0.000050203686,0.000014392389,6.4345045e-7,0.00015560149,5.766268e-7,0.0011265683,0.98745406,0.00051560235,0.002841537],"study_design_scores_gemma":[0.0010984048,0.00004834264,0.069115795,0.00017186877,0.00008272685,0.0000037314924,0.0010147187,0.0018459168,0.0047370647,0.90978044,0.011721387,0.00037958883],"about_ca_topic_score_codex":0.000056681038,"about_ca_topic_score_gemma":0.0000070128967,"teacher_disagreement_score":0.077673584,"about_ca_system_score_codex":0.000004238899,"about_ca_system_score_gemma":0.000006411036,"threshold_uncertainty_score":0.26518592},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9916966,0.00023112043,0.00017047294,0.000010776275,0.0017563167,0.00027025235,0.0000071761533,0.00024818952,0.0056090807],"genre_scores_gemma":[0.9995175,0.000003840911,0.00027665755,0.000037412225,0.000050101065,0.000028095512,0.0000057348384,0.00003359412,0.000047090274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991548,0.000084711304,0.00016019863,0.00021777701,0.00013631949,0.00024620938],"domain_scores_gemma":[0.9995608,0.000088543,0.00002214196,0.00016649271,0.00007062279,0.00009144593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002622772,0.00017597713,0.0001861488,0.00007711522,0.00013071996,0.000021634243,0.00008756548,0.00008359317,0.00002614584],"category_scores_gemma":[0.000013487618,0.00017128086,0.00004315906,0.0001985654,0.00014502136,0.00014644701,0.000022747976,0.000151355,0.00007179513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001639719,0.00012281894,0.0013821053,0.00009991523,0.00030550337,0.0000475219,0.004491248,0.00020380477,0.059837513,0.9305857,0.0015320873,0.0012278458],"study_design_scores_gemma":[0.006523137,0.0015378084,0.008505044,0.000362049,0.00015032574,0.000178874,0.0011069546,0.036912996,0.1092167,0.83163476,0.0022223417,0.0016490364],"about_ca_topic_score_codex":0.000021211255,"about_ca_topic_score_gemma":0.000008766842,"teacher_disagreement_score":0.09895093,"about_ca_system_score_codex":0.00003066668,"about_ca_system_score_gemma":0.000011627444,"threshold_uncertainty_score":0.6984631},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892282,0.0001124776,0.00004216015,0.00009977365,0.0025408135,0.00014149313,0.000008473784,0.00003051119,0.00779613],"genre_scores_gemma":[0.996751,0.000012145356,0.00059491204,0.000029793624,0.000048812955,0.0000061059045,0.000002013524,0.000020987003,0.0025342398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990063,0.00004857462,0.00036488287,0.00015695734,0.0002265477,0.00019676553],"domain_scores_gemma":[0.9984226,0.0003598396,0.00021669183,0.0005664812,0.00039088455,0.000043456894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042432072,0.00011801365,0.00023047916,0.000039548475,0.00018401681,0.000023185758,0.00025156292,0.00007963847,0.0002943738],"category_scores_gemma":[0.0003656868,0.00008800621,0.00009039838,0.00021256064,0.00037635773,0.000086984066,0.000083598796,0.00013807781,0.000054428936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049751045,0.0006630923,0.001421542,0.00009238745,0.00011085309,0.0000011362999,0.00044562985,1.3077964e-7,0.0018074281,0.973039,0.02136256,0.001006545],"study_design_scores_gemma":[0.0006222981,0.00027408125,0.003427484,0.000035815112,0.000038364076,0.0000035856924,0.00013826798,0.000050853112,0.011248387,0.96865016,0.015390509,0.000120199446],"about_ca_topic_score_codex":0.000031431126,"about_ca_topic_score_gemma":0.00010952723,"teacher_disagreement_score":0.009440959,"about_ca_system_score_codex":0.000020457106,"about_ca_system_score_gemma":0.00007823678,"threshold_uncertainty_score":0.3588789},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99621713,0.00004643346,0.00034197772,0.00020827321,0.0011178282,0.000078232624,4.779004e-7,0.00008521516,0.0019044589],"genre_scores_gemma":[0.9978926,0.000011157606,0.0018593863,0.00017788337,0.0000014535774,0.0000056596205,2.1419771e-7,0.0000069400962,0.0000447049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991021,0.000036186902,0.00017460417,0.00028020045,0.00020955056,0.00019736872],"domain_scores_gemma":[0.99923146,0.00008278262,0.000083986066,0.00039501442,0.00012338402,0.000083354804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023973518,0.00010304363,0.0001460922,0.000091908856,0.00010722601,0.00004274877,0.0002985002,0.0000586899,0.0000065838935],"category_scores_gemma":[0.000035727124,0.00009445549,0.000036475572,0.00043053718,0.00013098265,0.00013458778,0.00017090747,0.000104974395,0.000045308465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012625396,0.00006781869,0.006992642,0.000008122993,0.000011075075,0.0000032364699,0.00037741006,0.000001241139,0.0011701477,0.9893985,0.0004179336,0.0015392711],"study_design_scores_gemma":[0.0008822607,0.0002702198,0.0055251275,0.00005631669,0.0000049679734,0.000009013908,0.0000063317766,0.0023949954,0.010649608,0.97981036,0.00025915276,0.00013165797],"about_ca_topic_score_codex":0.000054703305,"about_ca_topic_score_gemma":0.00000253175,"teacher_disagreement_score":0.009588129,"about_ca_system_score_codex":0.000010462744,"about_ca_system_score_gemma":0.000031616833,"threshold_uncertainty_score":0.38517833},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42182672,0.00020072973,0.2161135,0.0009927922,0.0005147363,0.001443424,0.00009986315,0.00026239996,0.35854584],"genre_scores_gemma":[0.99795157,0.0000020810614,0.0013314284,0.000058488447,0.00006735417,0.00019049882,0.000009694238,0.000013716728,0.00037519247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995216,0.000008766544,0.000107808024,0.00016792667,0.00004202949,0.00015183931],"domain_scores_gemma":[0.9995163,0.000062919586,0.00004695045,0.00024925344,0.000049003676,0.00007556147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000054429755,0.000098930526,0.00010911404,0.00001379486,0.00021538677,0.0000251022,0.000107994594,0.000019658568,0.00019946723],"category_scores_gemma":[0.0000023749237,0.000081725804,0.000029633766,0.00013136854,0.0001586424,0.000058128484,0.0000622103,0.00005976585,0.00013990328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014976108,0.000044669996,0.00023841117,0.0000033639735,0.000013362918,1.7182673e-8,0.00016858455,6.0917024e-8,0.00025754995,0.98877996,0.00028162156,0.010210873],"study_design_scores_gemma":[0.00016913255,0.00001864295,0.00005912169,0.0000041890526,0.0000057347343,4.0009525e-7,0.0003275007,0.000035538058,0.0024290183,0.96240807,0.03444641,0.00009622723],"about_ca_topic_score_codex":0.00001058489,"about_ca_topic_score_gemma":4.2037988e-7,"teacher_disagreement_score":0.57612485,"about_ca_system_score_codex":0.0000065958134,"about_ca_system_score_gemma":0.00000878777,"threshold_uncertainty_score":0.33326817},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8838034,0.0008190178,0.022189338,0.01024306,0.050829355,0.0009613647,0.00001501545,0.0012708782,0.02986853],"genre_scores_gemma":[0.9980135,0.00003134322,0.0007014334,0.0004152598,0.0000698332,0.000011706293,0.0000030079855,0.0000114766635,0.0007424645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986001,0.00008405914,0.00019250941,0.00038257756,0.00038678478,0.00035391535],"domain_scores_gemma":[0.9982544,0.00017837404,0.000088145986,0.0012350973,0.00013079178,0.000113145295],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029980732,0.00015508423,0.00012798513,0.00004258715,0.00050647405,0.0003615174,0.0015619427,0.00006419143,0.000009305301],"category_scores_gemma":[0.00005611172,0.00009563019,0.00005009249,0.00019049592,0.0001150288,0.000325919,0.00053093216,0.00014297469,0.0009390863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011237055,0.000060816634,0.00016162102,0.0000016345365,0.0000118970265,0.000011589053,0.00047912882,4.4010972e-7,0.00020970701,0.9470641,0.0378031,0.014184721],"study_design_scores_gemma":[0.0006556719,0.00050095585,0.0032641182,0.000041262185,0.0000050521776,0.000007932058,0.00001353002,0.007817766,0.013989518,0.68057895,0.29282367,0.00030158367],"about_ca_topic_score_codex":0.000022895612,"about_ca_topic_score_gemma":0.00000944818,"teacher_disagreement_score":0.26648518,"about_ca_system_score_codex":0.00003984011,"about_ca_system_score_gemma":0.000047147936,"threshold_uncertainty_score":0.99983877},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9868806,0.00022327946,0.000037738402,0.0000024408578,0.0020038811,0.000090332614,0.0000047376902,0.0000799481,0.010677039],"genre_scores_gemma":[0.99985456,0.000009585582,0.00005857457,0.0000047298086,0.0000071336513,0.0000072130306,0.0000021151238,0.000019632098,0.00003645864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993717,0.000032878037,0.00023833153,0.00009259753,0.00011809559,0.00014641558],"domain_scores_gemma":[0.9994957,0.000036157602,0.000048793947,0.00028263422,0.00009586082,0.000040888546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001820535,0.00009860146,0.0002056117,0.00008939404,0.000023509027,0.000003915048,0.00016238776,0.00006982468,0.00006023901],"category_scores_gemma":[0.000017774593,0.00009705965,0.00006211587,0.00039861642,0.00010668811,0.000059557427,0.000019252537,0.000064284584,0.000021605572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013205868,0.000050522038,0.0044472436,0.000119995086,0.000074753916,0.0000012310132,0.0005712162,0.000015254716,0.021425497,0.9721617,0.0008836314,0.00023573104],"study_design_scores_gemma":[0.0013099024,0.00041265847,0.009649917,0.00015742047,0.000042859,0.000006393033,0.0003006994,0.0006520986,0.08774379,0.89660984,0.0027925763,0.00032181919],"about_ca_topic_score_codex":0.000036204525,"about_ca_topic_score_gemma":0.0000085075335,"teacher_disagreement_score":0.07555185,"about_ca_system_score_codex":0.000007591441,"about_ca_system_score_gemma":0.000006000362,"threshold_uncertainty_score":0.39579776},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9726038,0.00053917145,0.013277928,0.000667037,0.0017992234,0.0009926807,0.000012115056,0.00014724606,0.009960772],"genre_scores_gemma":[0.9454863,0.00003187497,0.041880567,0.00003839527,0.000056808873,0.000054238586,0.0000025892953,0.00004090698,0.012408285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916005,0.000042974192,0.00037369595,0.00014011971,0.0001250136,0.0001581583],"domain_scores_gemma":[0.99785876,0.0015005162,0.00017777397,0.00027848617,0.00013961176,0.000044856763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003692172,0.00011323911,0.0002817608,0.000042594584,0.0002085053,0.00003029132,0.00012550985,0.000062542495,0.000047643578],"category_scores_gemma":[0.0015807806,0.00008029363,0.000072087816,0.00011962742,0.00030405982,0.000115268565,0.00008424898,0.00007476948,0.00000924526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003263199,0.000021643838,0.000028188979,0.000050191906,0.000049095008,1.1025528e-7,0.0011163052,6.7348515e-7,0.0006689118,0.98917204,0.008408784,0.0004514371],"study_design_scores_gemma":[0.0018086412,0.00007776191,0.000024619178,0.00004001735,0.0000800247,0.000003629031,0.00062753627,0.00058553263,0.003029892,0.9930738,0.00056078297,0.000087762186],"about_ca_topic_score_codex":0.000029349665,"about_ca_topic_score_gemma":0.000018094035,"teacher_disagreement_score":0.02860264,"about_ca_system_score_codex":0.000017866938,"about_ca_system_score_gemma":0.000037931786,"threshold_uncertainty_score":0.3274279},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920588,0.0005861346,0.0001531857,0.0000096081985,0.0013473593,0.00015929971,0.0000055549162,0.00025861716,0.0054214164],"genre_scores_gemma":[0.99981254,0.000026372909,0.000022244207,0.000027698607,0.000032728152,0.000011960199,0.000003980138,0.00003317684,0.000029298188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922,0.00005042876,0.00016906828,0.00017819228,0.00011731636,0.00026496185],"domain_scores_gemma":[0.9995304,0.00008449764,0.000022865152,0.00020337937,0.000044363886,0.00011451546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024449572,0.00016074495,0.000195371,0.00015773404,0.000112529175,0.000034853165,0.00011559544,0.00009179752,0.00002677055],"category_scores_gemma":[0.000017357654,0.00016379652,0.0000416363,0.00052092253,0.00010162165,0.00011661046,0.000015898318,0.000118197626,0.00007885329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029115407,0.000057321387,0.0042265286,0.0001105857,0.00014891666,0.000040123654,0.001697137,0.000029203413,0.0061825304,0.98249614,0.002699699,0.0022827098],"study_design_scores_gemma":[0.0020913137,0.00054587226,0.022259068,0.00008465273,0.00009555064,0.00009931659,0.0005986081,0.0047783763,0.026312442,0.93637955,0.00590286,0.00085240713],"about_ca_topic_score_codex":0.000014674314,"about_ca_topic_score_gemma":0.0000036533027,"teacher_disagreement_score":0.046116598,"about_ca_system_score_codex":0.00002726973,"about_ca_system_score_gemma":0.000006869249,"threshold_uncertainty_score":0.6679428},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99697113,0.0002927331,0.000099461344,0.00001257154,0.00060505327,0.000097760596,0.0000027908234,0.00008538143,0.0018331085],"genre_scores_gemma":[0.9995953,0.000014301157,0.00032556313,0.000007768501,0.000008375545,0.000012738196,0.0000016316205,0.000014610204,0.000019713465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995501,0.000025617343,0.00012457166,0.00010295594,0.00007560174,0.00012117634],"domain_scores_gemma":[0.99962884,0.00005755035,0.000026432324,0.00016579164,0.00006177181,0.000059600505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007762487,0.00009792477,0.00013798327,0.00007033736,0.00007765368,0.000015061916,0.00008942329,0.000045598146,0.000010386339],"category_scores_gemma":[0.0000070657666,0.00008662462,0.000024783414,0.00016892343,0.00013649132,0.00010563205,0.00001572531,0.000060716477,0.000010339437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017513621,0.00021985733,0.047325153,0.0006149399,0.00070771493,0.000024749252,0.014938222,0.00031214987,0.053553633,0.8756931,0.0025886,0.0038467639],"study_design_scores_gemma":[0.005744798,0.0019376804,0.08071594,0.0008463016,0.00027987277,0.00008470843,0.0027781203,0.011292989,0.17350547,0.7173761,0.0041694897,0.001268524],"about_ca_topic_score_codex":0.000045160563,"about_ca_topic_score_gemma":0.00004023113,"teacher_disagreement_score":0.15831698,"about_ca_system_score_codex":0.0000086295,"about_ca_system_score_gemma":0.0000055992787,"threshold_uncertainty_score":0.35324496},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9941575,0.0001437663,0.00029025352,0.00034797852,0.0026040408,0.00012679538,0.000002436878,0.00017760407,0.0021496348],"genre_scores_gemma":[0.9939982,0.0000052486907,0.005511181,0.00030910494,0.0000032587184,0.0000049641917,0.0000021003993,0.000015257834,0.000150677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983297,0.00008052613,0.00034912874,0.00044901326,0.00042811545,0.0003634993],"domain_scores_gemma":[0.9984456,0.00015432369,0.000115518254,0.0008080824,0.0003532083,0.00012328173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047524282,0.00018130062,0.0002562083,0.00018217514,0.00015375743,0.000075377146,0.0006344874,0.00007964767,0.000041460335],"category_scores_gemma":[0.00013439695,0.0001644619,0.00009281964,0.00062231405,0.00016737473,0.00026767806,0.00024681754,0.00016080233,0.0002465531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012870648,0.00018172612,0.0009035225,0.000010940915,0.000022663926,0.000006495631,0.00041417865,0.000013502625,0.013214271,0.9808684,0.0036222728,0.0007291524],"study_design_scores_gemma":[0.0012247324,0.00067026593,0.0010160445,0.00008530295,0.00001206439,0.000009912225,0.000013507634,0.0056765447,0.043379676,0.9475135,0.00013639734,0.00026200476],"about_ca_topic_score_codex":0.00006692896,"about_ca_topic_score_gemma":0.0000018926885,"teacher_disagreement_score":0.033354856,"about_ca_system_score_codex":0.00002168359,"about_ca_system_score_gemma":0.00007261309,"threshold_uncertainty_score":0.67065614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9271998,0.0012268388,0.0008281854,0.0092183985,0.017041331,0.00078320364,0.0000016767318,0.0015396577,0.0421609],"genre_scores_gemma":[0.994444,0.000037116315,0.00419805,0.0008230644,0.0000049880846,0.000025109779,7.732227e-7,0.000016691774,0.0004502147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826515,0.00010164193,0.00028623035,0.00045813652,0.0004120683,0.0004767841],"domain_scores_gemma":[0.99822366,0.00023211022,0.000113497525,0.0010240509,0.00027335493,0.00013330627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081302616,0.00018303319,0.00014033381,0.00010135507,0.0010045121,0.00031557234,0.0012060857,0.00007573465,0.0000050730755],"category_scores_gemma":[0.00008114496,0.00012421097,0.00007895176,0.00076566095,0.00021849958,0.00019756317,0.00025631054,0.00022276465,0.0004805028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000596136,0.00006168327,0.00017333853,0.0000026706866,0.00001547598,0.0000029509167,0.00020914186,0.0000040673826,0.00053179474,0.9818776,0.010539061,0.0065762396],"study_design_scores_gemma":[0.00048181938,0.00036018513,0.00014132618,0.000037661375,0.0000046160594,0.000005149418,0.000011685565,0.0018665758,0.004063075,0.9837997,0.009048398,0.00017980093],"about_ca_topic_score_codex":0.000020105868,"about_ca_topic_score_gemma":0.00000486563,"teacher_disagreement_score":0.06724418,"about_ca_system_score_codex":0.000023365676,"about_ca_system_score_gemma":0.000058681646,"threshold_uncertainty_score":0.77259964},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9941605,0.00030286235,0.0017354102,0.0007822308,0.0016067616,0.00008447208,4.2966562e-7,0.000022738031,0.0013046425],"genre_scores_gemma":[0.99832124,0.000013066244,0.0014935939,0.000011289723,0.0000055862156,0.000002801714,4.8036685e-7,0.0000023099108,0.00014966405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994579,0.000025604048,0.000108590284,0.00015681112,0.00014760514,0.00010351413],"domain_scores_gemma":[0.9992215,0.00007431215,0.00012945355,0.00045485378,0.0000888777,0.00003101725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031304735,0.000053310454,0.00006343824,0.000023430666,0.0011796072,0.0006152019,0.000447807,0.000014160457,5.165998e-7],"category_scores_gemma":[0.00011260482,0.000041361174,0.000022134851,0.00007518615,0.00016388673,0.0003853969,0.00017333032,0.000049544597,0.000001458847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021140647,0.000012153449,0.0036265766,0.000003901112,0.000007692746,6.3301275e-7,0.00016594726,0.000028539083,0.00039398717,0.96680367,0.0002489225,0.028705869],"study_design_scores_gemma":[0.00039380052,0.00004579693,0.117712945,0.000014686714,0.000004640607,0.000006807125,0.000016927248,0.0069581084,0.007117888,0.86563665,0.001988382,0.00010336352],"about_ca_topic_score_codex":0.000027080921,"about_ca_topic_score_gemma":0.0000064876226,"teacher_disagreement_score":0.11408637,"about_ca_system_score_codex":0.0000070113397,"about_ca_system_score_gemma":0.00005374832,"threshold_uncertainty_score":0.9072705},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9694037,0.00009150315,0.028277284,0.00020630834,0.0006675789,0.00055896275,0.0000047927524,0.00003713259,0.0007527274],"genre_scores_gemma":[0.9814192,0.000008168551,0.018469036,0.0000107646165,0.000006437558,0.000018271061,0.0000012025918,0.000008241407,0.00005868405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990991,0.00004340124,0.00019826544,0.00025246502,0.0002153092,0.00019151095],"domain_scores_gemma":[0.9986929,0.00019934724,0.00013462918,0.0004232227,0.0005038288,0.000046061523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005208005,0.00008035426,0.00016164876,0.00010722255,0.00006864345,0.000015721602,0.00040280537,0.00004231426,0.0000014343942],"category_scores_gemma":[0.0003048282,0.00007724014,0.000029882767,0.00038903308,0.000226324,0.0003349732,0.00016953849,0.00005103118,0.0000018463221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003785492,0.00007241214,0.0005220299,0.00006490492,0.00001264726,5.110053e-7,0.0007935249,0.0000010674531,0.008362094,0.9786941,0.00011901355,0.011319879],"study_design_scores_gemma":[0.0008507859,0.00041346104,0.0015306899,0.000019174628,0.000004146989,0.0000029406433,0.000020596946,0.0017176952,0.13476977,0.8603334,0.000259573,0.00007775828],"about_ca_topic_score_codex":0.000010643113,"about_ca_topic_score_gemma":0.0000029191758,"teacher_disagreement_score":0.12640767,"about_ca_system_score_codex":0.000020151168,"about_ca_system_score_gemma":0.000056346853,"threshold_uncertainty_score":0.31497613},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99402684,0.00027973592,0.00033795703,0.000011372589,0.0032781418,0.00019090778,0.0000045088677,0.00013343086,0.0017371251],"genre_scores_gemma":[0.99933064,0.000011628188,0.0003371195,0.0000152235925,0.000020448217,0.000015175556,0.0000058132655,0.000024735278,0.00023921813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994956,0.000016993921,0.00017085328,0.00009217512,0.000070103786,0.00015424204],"domain_scores_gemma":[0.99961853,0.000037511298,0.000031351254,0.00019506346,0.000079160185,0.00003836566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013830609,0.00008992599,0.00015714728,0.000038720846,0.000038250124,0.0000080724585,0.00013786796,0.00006072032,0.000013301097],"category_scores_gemma":[0.000028962093,0.00008938197,0.000045420693,0.00017571969,0.000038879556,0.000045948414,0.00001241475,0.00004198152,0.000035253255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008573244,0.000053695512,0.0009371392,0.00024574585,0.00015986443,9.306859e-7,0.0015427005,0.00018423404,0.034767684,0.9383271,0.022459002,0.0012361689],"study_design_scores_gemma":[0.003632983,0.0007341186,0.001000356,0.000105515086,0.00009962581,0.000005337354,0.0001627088,0.021782394,0.25999123,0.63196814,0.079869434,0.00064817077],"about_ca_topic_score_codex":0.0000045746847,"about_ca_topic_score_gemma":0.0000014342588,"teacher_disagreement_score":0.30635896,"about_ca_system_score_codex":0.000011750408,"about_ca_system_score_gemma":0.000007572188,"threshold_uncertainty_score":0.36448908},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99531907,0.00007718304,0.0000193295,0.00016513804,0.0007025439,0.00028707625,0.000019388692,0.00009758864,0.0033126876],"genre_scores_gemma":[0.99896604,0.000012737428,0.00077714794,0.00007417454,0.000017269678,0.000028903578,0.000007712748,0.000024277824,0.00009172939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988299,0.000099292185,0.00041063703,0.00021838925,0.00020229006,0.00023947493],"domain_scores_gemma":[0.99855536,0.00037992647,0.00022587444,0.00060447503,0.00014078338,0.00009357484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043272926,0.00016028101,0.0003256703,0.00014490892,0.00018770859,0.000017805985,0.00035557372,0.00008377917,0.00009879124],"category_scores_gemma":[0.000060317398,0.00015440652,0.00015124066,0.00035056318,0.00044561355,0.000100482204,0.000075078104,0.000107618194,0.00006597644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024146628,0.00037412954,0.0010511868,0.000028693641,0.000059681654,9.302007e-7,0.0002469957,4.9657864e-8,0.012171587,0.9809074,0.005062286,0.000072909424],"study_design_scores_gemma":[0.000619296,0.00011049552,0.0019770924,0.000028027194,0.000043215365,0.000004199228,0.000060178918,0.0000075039293,0.036728755,0.95887786,0.0013882807,0.00015506614],"about_ca_topic_score_codex":0.000025305751,"about_ca_topic_score_gemma":0.000004424609,"teacher_disagreement_score":0.024557168,"about_ca_system_score_codex":0.00001529053,"about_ca_system_score_gemma":0.000022346418,"threshold_uncertainty_score":0.6296515},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88200176,0.00016690009,0.04013717,0.00087305985,0.0057788924,0.0006284983,0.000011791259,0.001043497,0.06935844],"genre_scores_gemma":[0.984423,0.0000074714962,0.014542734,0.000119540266,0.000030032374,0.000015560801,0.000012075808,0.000017905699,0.000831673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847203,0.000031071475,0.00016788747,0.00050680654,0.0003777059,0.0004444756],"domain_scores_gemma":[0.99885404,0.000026250938,0.000052456024,0.00083988096,0.00010721266,0.000120147015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028507697,0.00018852048,0.00017108137,0.00012124852,0.00022145094,0.000373682,0.0012283772,0.00004224042,0.000031624473],"category_scores_gemma":[0.000010197534,0.00016215006,0.000038803242,0.0006549794,0.00012086187,0.0012477634,0.00035714608,0.00013066108,0.00016523818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008861191,0.00013059627,0.009270282,0.00001034168,0.000053171923,0.00007625135,0.0002838434,0.0000056120566,0.00005719633,0.95968664,0.011291511,0.01912572],"study_design_scores_gemma":[0.006776094,0.0069356123,0.10875318,0.00041884382,0.00020189557,0.000098625904,0.00062272634,0.07446705,0.010186906,0.5990628,0.18852513,0.003951149],"about_ca_topic_score_codex":0.000034400713,"about_ca_topic_score_gemma":0.000014829213,"teacher_disagreement_score":0.3606238,"about_ca_system_score_codex":0.00002541923,"about_ca_system_score_gemma":0.00003735048,"threshold_uncertainty_score":0.6612288},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39434338,0.0013566485,0.42692232,0.0064282687,0.006164282,0.00096128037,0.00000647986,0.0027906066,0.16102673],"genre_scores_gemma":[0.9928119,0.00000631974,0.006940906,0.00010456376,0.0000070945694,0.000015068616,3.0309891e-7,0.0000071146947,0.000106698135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989904,0.000054849068,0.0002248779,0.00025071864,0.00025815467,0.00022101108],"domain_scores_gemma":[0.998353,0.00031337095,0.00009703041,0.00088839384,0.0002760366,0.000072169256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049219246,0.00009942132,0.00012037665,0.000028378008,0.00016090184,0.00018320399,0.0015028444,0.000044754903,0.0000053941394],"category_scores_gemma":[0.00041610363,0.00007232123,0.000049110786,0.00035945664,0.0007769582,0.00062698656,0.0005847891,0.00009805218,0.00006413046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004950859,0.00011721554,0.00094181317,0.000010526129,0.000007561262,0.0000025563818,0.00014643387,8.823256e-8,0.00010410937,0.8473827,0.009804964,0.14147708],"study_design_scores_gemma":[0.00010642762,0.00018431192,0.0014053839,0.00002013871,0.0000020025857,0.0000036095646,0.000008905394,0.00140002,0.053996243,0.9358476,0.0069320216,0.00009334274],"about_ca_topic_score_codex":0.000020213869,"about_ca_topic_score_gemma":0.0000037245957,"teacher_disagreement_score":0.59846854,"about_ca_system_score_codex":0.000035952482,"about_ca_system_score_gemma":0.00010196414,"threshold_uncertainty_score":0.2949174},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9887934,0.00012824683,0.0019908666,0.0004386487,0.0014325095,0.000223388,0.0000011658008,0.0004582358,0.006533548],"genre_scores_gemma":[0.99590075,0.00001485579,0.003847106,0.00008082802,0.000006530835,0.000024476647,0.0000010691609,0.000013190106,0.000111211986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840057,0.0001676836,0.0002089418,0.0004329897,0.00032329612,0.00046649814],"domain_scores_gemma":[0.99876636,0.00016136534,0.000049501174,0.0007726273,0.00012768355,0.00012245045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000447011,0.00013746157,0.00017155889,0.00029874223,0.00012482284,0.00008086788,0.001106285,0.000058011305,0.000023156823],"category_scores_gemma":[0.00015672392,0.00013132868,0.000052817883,0.0015124112,0.00023624614,0.00046797554,0.00042047602,0.00020535002,0.00017231781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112527505,0.00009099683,0.008320535,0.00000339613,0.000006116514,0.000021336797,0.000330382,0.0000010723793,0.00086614763,0.9844443,0.00036137103,0.0055430527],"study_design_scores_gemma":[0.00050252205,0.00012095464,0.037962522,0.000019307596,8.1927334e-7,0.0000042454926,0.0000142207655,0.0018931304,0.0053395755,0.9534049,0.00057686877,0.00016090757],"about_ca_topic_score_codex":0.000033743647,"about_ca_topic_score_gemma":0.00003537538,"teacher_disagreement_score":0.031039417,"about_ca_system_score_codex":0.000055858665,"about_ca_system_score_gemma":0.000043289296,"threshold_uncertainty_score":0.5355428},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9440725,0.000035723162,0.00008496932,0.000056848392,0.0018459478,0.0001757902,0.000004856566,0.000035931476,0.05368743],"genre_scores_gemma":[0.9950968,0.000007489848,0.0022987633,0.000010027739,0.000017253522,0.000008005213,7.5229815e-7,0.000025071015,0.0025358053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988782,0.00012988047,0.00039850213,0.00012442058,0.00027770046,0.00019133877],"domain_scores_gemma":[0.9971838,0.0015122998,0.00031269464,0.00060311804,0.00033908463,0.00004898338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000801069,0.00013076463,0.0002884339,0.000025291443,0.0001714823,0.000009067081,0.00038189153,0.00008751602,0.00029863682],"category_scores_gemma":[0.0012373438,0.00009707681,0.00009213775,0.00018875304,0.00050246017,0.00006158131,0.00008020578,0.00011385716,0.0001167642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013916705,0.00018559674,0.000064789565,0.000081868784,0.000087165005,9.5151995e-7,0.0028583806,6.40848e-8,0.00017107665,0.9899155,0.006176191,0.00031927388],"study_design_scores_gemma":[0.001184928,0.00017307203,0.000023247514,0.000059932532,0.000054333108,0.000002766097,0.00044605165,0.000026034966,0.0049182326,0.9859949,0.0070087314,0.000107818494],"about_ca_topic_score_codex":0.0000088443885,"about_ca_topic_score_gemma":0.000010751715,"teacher_disagreement_score":0.051151626,"about_ca_system_score_codex":0.000029171217,"about_ca_system_score_gemma":0.00006121763,"threshold_uncertainty_score":0.39586774},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97275877,0.000009717917,0.010784536,0.0007349589,0.0010461626,0.00023764266,0.0000013013897,0.0000689996,0.0143579235],"genre_scores_gemma":[0.99864036,9.1106233e-7,0.0009361408,0.00007297278,0.000009379935,0.00001727878,5.486605e-7,0.000008487214,0.00031394942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987627,0.00019170712,0.00015708168,0.00023595334,0.00042627988,0.00022625111],"domain_scores_gemma":[0.9982273,0.00067970174,0.0000826709,0.00071239576,0.0002482334,0.000049716316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006136386,0.00009539937,0.00011000217,0.000060962946,0.0001591007,0.000043296,0.0008224629,0.00004371487,0.00010947952],"category_scores_gemma":[0.00028597366,0.000068617046,0.000054103635,0.0005921702,0.00022662907,0.00024977475,0.00021594891,0.00012474695,0.00032377223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023893248,0.00006933857,0.00010229375,0.0000028554612,0.0000111943655,0.000001571809,0.00032870928,0.0000025444108,0.0018747022,0.9949461,0.00076209597,0.001874696],"study_design_scores_gemma":[0.00036669444,0.00025347804,0.0009206315,0.000014055375,0.000001562325,0.000004225852,0.000023636245,0.0018605475,0.027929286,0.96846324,0.000080683414,0.00008193698],"about_ca_topic_score_codex":0.0000053294343,"about_ca_topic_score_gemma":5.045191e-7,"teacher_disagreement_score":0.026482841,"about_ca_system_score_codex":0.000034982113,"about_ca_system_score_gemma":0.000036184618,"threshold_uncertainty_score":0.4161545},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7124931,0.0006834646,0.01063989,0.014704823,0.06438992,0.0010630765,0.000008001923,0.001915099,0.19410263],"genre_scores_gemma":[0.9935302,0.000008501415,0.00050233974,0.0003627439,0.0000902989,0.000011119886,6.7462844e-7,0.00001223943,0.005481863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868476,0.00014237221,0.00018353258,0.0003183329,0.00031893112,0.00035206007],"domain_scores_gemma":[0.9985694,0.000254508,0.00008160188,0.00089027046,0.00010278319,0.00010140109],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004727627,0.00015331083,0.000120689205,0.000051839623,0.0005532006,0.00024678436,0.0013520021,0.00007436113,0.00008515688],"category_scores_gemma":[0.000025164083,0.000102270154,0.000060662056,0.00045812188,0.00014782355,0.00021354888,0.00024963677,0.00018551604,0.0009665108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013328295,0.00004533996,0.0001457771,0.0000015373838,0.000013183007,0.000007277732,0.00008107236,2.2704037e-7,0.000032738386,0.9860658,0.0073355087,0.006258176],"study_design_scores_gemma":[0.00048805354,0.00022855784,0.0018748224,0.000010914746,0.000003055557,0.00000415241,0.0000061182977,0.0034444917,0.0018609735,0.8775025,0.11440794,0.00016839984],"about_ca_topic_score_codex":0.000007899588,"about_ca_topic_score_gemma":0.0000010350007,"teacher_disagreement_score":0.28103712,"about_ca_system_score_codex":0.000036089637,"about_ca_system_score_gemma":0.000039223643,"threshold_uncertainty_score":0.99981135},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8036838,0.00008959723,0.18967605,0.00035674535,0.0029420175,0.00016546999,0.0000058332635,0.00011067483,0.002969824],"genre_scores_gemma":[0.9945888,0.0000065038494,0.005082612,0.00018730709,0.00002374481,0.0000071513,0.000010457049,0.0000065719482,0.00008688056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988987,0.000079085585,0.00023417364,0.00029411656,0.0002932122,0.00020074844],"domain_scores_gemma":[0.9990039,0.0001659065,0.00009859788,0.0003259211,0.00032819735,0.000077498196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025784934,0.00012065478,0.00015620972,0.00016179058,0.00013058944,0.00004791981,0.00042505507,0.000055554556,0.000020396375],"category_scores_gemma":[0.000052065574,0.00012308419,0.00007721331,0.0008015783,0.000107118845,0.00040767598,0.000095745345,0.00008270272,0.000051508847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000113277965,0.000086370084,0.00042506566,0.000008136287,0.000021103688,0.0000037124562,0.0008952034,0.0001383639,0.001969406,0.9919842,0.00047673294,0.003980372],"study_design_scores_gemma":[0.000795507,0.0004711565,0.013228971,0.0000234052,0.0000148981135,0.000007021927,0.000028436034,0.035065956,0.03454438,0.91500396,0.00058029674,0.00023599593],"about_ca_topic_score_codex":0.000026963606,"about_ca_topic_score_gemma":0.0000076746,"teacher_disagreement_score":0.19090497,"about_ca_system_score_codex":0.000020668938,"about_ca_system_score_gemma":0.00007550822,"threshold_uncertainty_score":0.5019227},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920146,0.000016687372,0.00004859841,0.00014972569,0.00019505635,0.00022370106,0.0000027782864,0.0001142472,0.0072345925],"genre_scores_gemma":[0.9980495,0.0000036031038,0.0016164426,0.00009449642,0.000007672052,0.000067145746,0.0000020217242,0.000026918633,0.00013219184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990751,0.00006765979,0.00021258065,0.0002296802,0.00014967467,0.00026528488],"domain_scores_gemma":[0.9991544,0.00019099862,0.00008304937,0.00044293824,0.000056612724,0.00007199754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033848654,0.00013947599,0.00017972941,0.0001296607,0.00016218964,0.00003328216,0.00021214537,0.00006232636,0.000042389504],"category_scores_gemma":[0.000042623775,0.00012098606,0.00004429393,0.0005602484,0.00014871401,0.00013940217,0.000044398013,0.00015978346,0.00008859583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023656181,0.00016998776,0.003540121,0.000014806507,0.000017814564,0.0000050452713,0.0012604119,0.000001073243,0.0005591957,0.9939618,0.00030469327,0.00014140196],"study_design_scores_gemma":[0.0005845077,0.0000852933,0.004862078,0.00007687502,0.000015897931,0.000006699405,0.00014427456,0.000031810887,0.0013137937,0.9921901,0.00052298635,0.00016565161],"about_ca_topic_score_codex":0.000038966646,"about_ca_topic_score_gemma":0.00016040025,"teacher_disagreement_score":0.0071024005,"about_ca_system_score_codex":0.000023114359,"about_ca_system_score_gemma":0.000026492116,"threshold_uncertainty_score":0.4933668},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90102684,0.000082848135,0.0068884725,0.0012295335,0.0044378443,0.0018026887,0.00019811462,0.0009244133,0.083409235],"genre_scores_gemma":[0.96298105,0.000006130759,0.030762905,0.0000877396,0.000077742196,0.00017173204,0.000018101884,0.000044911063,0.005849692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987282,0.000026099298,0.00042234306,0.00026730596,0.00021859807,0.0003374164],"domain_scores_gemma":[0.9978764,0.0010215512,0.00015479063,0.0005462169,0.00030198199,0.000099035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041816302,0.00015798138,0.00026698815,0.000046796977,0.00024191431,0.00004619824,0.0002305364,0.00009565267,0.00007566347],"category_scores_gemma":[0.0034104914,0.00014972097,0.00009915911,0.0001461709,0.00022618001,0.00019680698,0.00008992625,0.00010633554,0.0002178527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004209193,0.00015989976,0.000031873064,0.000084017185,0.000020735863,0.0000014875887,0.0002974704,1.1755873e-7,0.00008537428,0.90169066,0.097539224,0.000047055553],"study_design_scores_gemma":[0.0011337454,0.00017099633,0.00006224972,0.000062573876,0.000040732128,0.000003238503,0.0001082701,0.00012496082,0.0040055714,0.9868658,0.0072413697,0.00018048169],"about_ca_topic_score_codex":0.000004764243,"about_ca_topic_score_gemma":0.000024819847,"teacher_disagreement_score":0.090297855,"about_ca_system_score_codex":0.00005581588,"about_ca_system_score_gemma":0.000031295443,"threshold_uncertainty_score":0.6105444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99434406,0.00003103838,0.000040128078,0.00063232274,0.00017904745,0.00023939084,0.0000054102143,0.00003775419,0.004490841],"genre_scores_gemma":[0.9995055,0.000017125025,0.00020132185,0.00007617544,0.0000074152967,0.00003305497,0.000001013629,0.000013544521,0.00014484595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925333,0.00008558199,0.0001955999,0.00015889444,0.00014883981,0.00015772396],"domain_scores_gemma":[0.99873906,0.0005757543,0.000107036256,0.00048373686,0.000046175704,0.000048252525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003594777,0.000113852104,0.00016033226,0.00005558219,0.00017381074,0.000015720532,0.00021678349,0.00004564227,0.00007377486],"category_scores_gemma":[0.00007894424,0.000079321886,0.00006248029,0.00021775861,0.00030549805,0.000033567085,0.000045676665,0.00010502385,0.000024901527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011456188,0.00042317752,0.00038368622,0.000008856326,0.00003287513,3.1213364e-7,0.0005629713,2.2524567e-8,0.0006551108,0.99580526,0.0018346932,0.00028159012],"study_design_scores_gemma":[0.00029039884,0.0003667288,0.0014835675,0.000026065545,0.000025015885,0.000001648988,0.00019597553,0.000030394951,0.0071053198,0.9899571,0.000431046,0.00008673123],"about_ca_topic_score_codex":0.0000112420275,"about_ca_topic_score_gemma":0.00001376647,"teacher_disagreement_score":0.006450209,"about_ca_system_score_codex":0.000010240333,"about_ca_system_score_gemma":0.000009761333,"threshold_uncertainty_score":0.32346526},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98326445,0.000006834779,0.000009618936,0.00018173872,0.00018463653,0.00017680887,0.000013052703,0.00002003656,0.016142838],"genre_scores_gemma":[0.9996746,0.0000033151525,0.00008152471,0.000020691994,0.00000811445,0.000017493763,9.470872e-7,0.000010464956,0.00018285886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992602,0.00008613175,0.00024384182,0.00011337523,0.00018308262,0.00011338319],"domain_scores_gemma":[0.9982881,0.0008363507,0.00020073733,0.0005326196,0.00011382164,0.000028362003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005953458,0.00008012413,0.00016702918,0.000038289676,0.00008420359,0.0000051044144,0.00031973512,0.00006712165,0.00012250138],"category_scores_gemma":[0.0002923554,0.000056723413,0.000060823808,0.00019583815,0.00021881431,0.000030293942,0.000047075526,0.000097302494,0.000027482625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021391039,0.00020280827,0.0012563327,0.000009303609,0.000019567651,1.848147e-7,0.0002702586,1.0256377e-7,0.0045573814,0.9911279,0.0024750324,0.000059730886],"study_design_scores_gemma":[0.00022637147,0.00012734115,0.00473737,0.000028513012,0.000017327675,5.8486796e-7,0.000056873785,0.000004857621,0.076912984,0.91773075,0.00010561364,0.00005138298],"about_ca_topic_score_codex":0.000040744253,"about_ca_topic_score_gemma":0.000048456186,"teacher_disagreement_score":0.07339713,"about_ca_system_score_codex":0.0000087881745,"about_ca_system_score_gemma":0.000028315257,"threshold_uncertainty_score":0.23131137},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97229874,0.000048476082,0.00026944088,0.000025191302,0.0018305199,0.00011598824,0.000008354319,0.00005434379,0.025348939],"genre_scores_gemma":[0.9970767,0.000014670225,0.0023606755,0.000090770875,0.00003322281,0.000004198445,0.0000024682859,0.000020933549,0.00039639758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992093,0.000053299183,0.00023590589,0.00014347257,0.0002086208,0.00014944244],"domain_scores_gemma":[0.99897,0.000113193775,0.0001209905,0.00059135264,0.00016788,0.000036629244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020059347,0.000107111526,0.0001799306,0.000072335635,0.00011619103,0.000009351831,0.00030492005,0.00008789389,0.00021683855],"category_scores_gemma":[0.00035025843,0.00009064117,0.000065579836,0.00019416763,0.00017507187,0.00007212472,0.00015665656,0.00006249057,0.000011691046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015575128,0.000043258653,0.0012201647,0.000027844811,0.00003137047,7.2564194e-7,0.0009819408,4.2758506e-7,0.0006007225,0.98007125,0.016787525,0.00021922255],"study_design_scores_gemma":[0.0006042179,0.00009510664,0.00089535245,0.000016710646,0.000023130042,0.0000018151867,0.00003720732,0.00008606875,0.01188605,0.983967,0.0022822844,0.00010507613],"about_ca_topic_score_codex":0.000016215741,"about_ca_topic_score_gemma":0.0000035425487,"teacher_disagreement_score":0.024952542,"about_ca_system_score_codex":0.000017723554,"about_ca_system_score_gemma":0.000018728531,"threshold_uncertainty_score":0.36962396},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952797,0.000026677417,0.0000023557327,0.0004656525,0.00020022993,0.0001933942,0.000007894691,0.000009472985,0.0038145713],"genre_scores_gemma":[0.99984705,0.0000050202975,0.000022882277,0.00005168575,0.000002124476,0.000026421167,4.1989765e-7,0.0000064717133,0.00003790292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938136,0.00010077577,0.00020191901,0.00008598595,0.00013207585,0.000097882024],"domain_scores_gemma":[0.99869084,0.0006361628,0.00014002425,0.00046895896,0.000050844465,0.000013194427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036360367,0.00006516687,0.00011356156,0.00003027427,0.00006210833,0.0000048938095,0.00033234255,0.000029792689,0.000039241975],"category_scores_gemma":[0.00017459005,0.000035536203,0.00006532747,0.0003321052,0.00032265394,0.000023641469,0.000038160473,0.00007652082,0.000005045731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012491769,0.00016066004,0.002757947,0.000014892747,0.000012628041,6.088801e-8,0.000794089,1.6942157e-7,0.0013516314,0.9935481,0.001326001,0.000021356542],"study_design_scores_gemma":[0.00015114811,0.000048227153,0.003132654,0.00005148547,0.000010796079,1.2607119e-7,0.00016710306,0.0000082286615,0.04636804,0.9495976,0.0004263126,0.000038291135],"about_ca_topic_score_codex":0.000014759249,"about_ca_topic_score_gemma":0.00006259261,"teacher_disagreement_score":0.045016408,"about_ca_system_score_codex":0.00000545958,"about_ca_system_score_gemma":0.000010000845,"threshold_uncertainty_score":0.14491242},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98717666,0.000020061469,0.00007689101,0.0007402752,0.00076128927,0.00013020493,0.000005918955,0.000007331267,0.011081345],"genre_scores_gemma":[0.99928063,0.00000742357,0.000041710624,0.00005326771,0.0000067678743,0.0000105116915,2.2209514e-7,0.0000035068529,0.0005959492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983574,0.00022638172,0.0003980818,0.00014633828,0.0007514827,0.00012031844],"domain_scores_gemma":[0.99755836,0.0008081036,0.00036199606,0.00077247043,0.00046513494,0.00003396856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019131876,0.0000616931,0.00011867142,0.000029025083,0.00030758773,0.000044093234,0.0010165882,0.000039097395,0.00026379828],"category_scores_gemma":[0.00053865387,0.000031347998,0.000090772584,0.000787933,0.00070583244,0.00009667855,0.00015836472,0.000102126374,0.00017976934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012942769,0.00004999545,0.016682621,8.0381176e-7,0.0000072374205,6.027545e-8,0.00028347626,0.0000018400614,0.002294108,0.9786304,0.0012438251,0.00079267484],"study_design_scores_gemma":[0.00015935485,0.000029132736,0.028343745,0.000014503991,0.0000068236964,0.0000027164078,0.0002961776,0.000041026564,0.017201949,0.94889563,0.0049724225,0.000036497353],"about_ca_topic_score_codex":0.000018992516,"about_ca_topic_score_gemma":0.000022860931,"teacher_disagreement_score":0.029734764,"about_ca_system_score_codex":0.000008723761,"about_ca_system_score_gemma":0.00004012887,"threshold_uncertainty_score":0.28884062},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98119384,0.000425351,0.000083166604,0.00024224973,0.002718098,0.0002808401,0.0000032847338,0.0004016771,0.014651472],"genre_scores_gemma":[0.9902927,0.000050384766,0.005248028,0.00011876022,0.000091221504,0.000030173373,0.000001440226,0.000048117123,0.004119132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849826,0.000056720808,0.00037844098,0.0002845928,0.00036589883,0.0004160856],"domain_scores_gemma":[0.9984068,0.0006375772,0.00016383846,0.00048272117,0.0001874305,0.00012161174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032685816,0.0002046647,0.00032527244,0.000069816786,0.00021918643,0.00009011158,0.0003984065,0.00009523357,0.00032957332],"category_scores_gemma":[0.0011656081,0.00019210007,0.00008457483,0.00019713148,0.00040182946,0.0005873603,0.00018110042,0.00017992506,0.0007021412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046422365,0.00008430722,0.00021945282,0.0000772509,0.000031888812,0.000008698825,0.0006117108,4.2650424e-8,0.0005778228,0.9897795,0.008568893,0.00003584183],"study_design_scores_gemma":[0.0003997822,0.000081731334,0.00007594262,0.00009290242,0.00003171622,0.000008257932,0.00042515207,0.000061879575,0.009308951,0.9886869,0.0005920014,0.00023477807],"about_ca_topic_score_codex":0.000028203263,"about_ca_topic_score_gemma":0.000023593237,"teacher_disagreement_score":0.010532339,"about_ca_system_score_codex":0.00009341917,"about_ca_system_score_gemma":0.00005098265,"threshold_uncertainty_score":0.9024839},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98895556,0.000090753616,0.003938386,0.0006798403,0.0017628794,0.00040840768,0.0000027738524,0.00017372821,0.003987688],"genre_scores_gemma":[0.9926259,0.000008872513,0.006972715,0.0002731152,0.0000068363124,0.000029895247,0.0000047936282,0.000015841122,0.0000620102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773353,0.00020017974,0.0002992671,0.00055106456,0.00058649486,0.00062944676],"domain_scores_gemma":[0.9987096,0.00011587036,0.000073124764,0.0008505622,0.00009113242,0.00015966374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000755932,0.00017974529,0.00019996944,0.00036248253,0.00017010483,0.00009172465,0.0016091992,0.0000686061,0.000069666115],"category_scores_gemma":[0.000037095822,0.00018538127,0.00005962722,0.0010249306,0.00021217231,0.0005955068,0.0008579411,0.00033764055,0.00020786795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024181769,0.00015581427,0.019550912,0.000005052367,0.0000139127,0.000070319635,0.0005245148,9.31312e-7,0.00037573805,0.9701422,0.0008938581,0.008242585],"study_design_scores_gemma":[0.001203153,0.0002730794,0.035545297,0.000016181493,0.0000014797844,0.000014567483,0.000038160633,0.0014107032,0.0022410532,0.95743454,0.001611394,0.00021041099],"about_ca_topic_score_codex":0.00006831335,"about_ca_topic_score_gemma":0.000048508275,"teacher_disagreement_score":0.015994385,"about_ca_system_score_codex":0.00011088414,"about_ca_system_score_gemma":0.00006896944,"threshold_uncertainty_score":0.75596285},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95702493,0.00036360236,0.00022976307,0.0011286318,0.006124356,0.00019794576,0.000003246928,0.0005675392,0.03435999],"genre_scores_gemma":[0.985081,0.000017902534,0.012742093,0.0011505602,0.0000021340986,0.0000102503855,0.0000029473774,0.000015650978,0.0009774425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821407,0.00014073707,0.0003174915,0.0005501873,0.00036829442,0.00040922686],"domain_scores_gemma":[0.9986323,0.00009757357,0.00010717338,0.00085473724,0.00013561462,0.00017259472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006490125,0.00019102868,0.00018059988,0.00011936117,0.00021841418,0.00014972378,0.0005697695,0.00006914318,0.000005927816],"category_scores_gemma":[0.00020535545,0.00017413263,0.0000740634,0.00050886755,0.000041334428,0.00016700245,0.00009098062,0.0002226182,0.0003265859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008027713,0.00012480257,0.000099305,0.0000020289042,0.000010806258,0.000022963472,0.00013540433,0.00015233326,0.00091385125,0.9890409,0.008829397,0.0006601493],"study_design_scores_gemma":[0.0026828633,0.00022947257,0.00010620096,0.000023065884,0.0000052896085,0.0000141868095,0.0000049649807,0.0024526846,0.014872141,0.972689,0.006646215,0.00027397161],"about_ca_topic_score_codex":0.000051085593,"about_ca_topic_score_gemma":0.0000016877516,"teacher_disagreement_score":0.033382546,"about_ca_system_score_codex":0.000037321082,"about_ca_system_score_gemma":0.00007874649,"threshold_uncertainty_score":0.71009225},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9899989,0.00086645794,0.0064584846,0.00012454914,0.00029787296,0.00017392596,0.0000019151173,0.00011076167,0.0019671542],"genre_scores_gemma":[0.99706525,0.0001534352,0.0026908368,0.0000068926565,0.000004681458,0.000010969221,0.0000019991996,0.000023971197,0.000041955063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994066,0.000018183628,0.0001968385,0.00008746581,0.00015690936,0.00013403481],"domain_scores_gemma":[0.99953824,0.000060890437,0.00009466035,0.00020682657,0.00006709638,0.00003226341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001862234,0.00010495073,0.00015426987,0.000042136755,0.00005450027,0.000016924909,0.00016807337,0.000044356348,0.000021571977],"category_scores_gemma":[0.00001725863,0.00007393231,0.00003436875,0.00014053185,0.00005157874,0.00010333394,0.000020775846,0.00007527439,0.000003329973],"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.00014206908,0.00038564808,0.011224619,0.0013607326,0.00094397715,0.0000056839335,0.0064881616,0.59880656,0.0087099755,0.20079888,0.0033760155,0.1677577],"study_design_scores_gemma":[0.0016593244,0.00024129842,0.009476227,0.00016851827,0.00015135513,0.000003892579,0.00020185573,0.026132412,0.87864697,0.07634661,0.006478862,0.0004926876],"about_ca_topic_score_codex":0.00003638792,"about_ca_topic_score_gemma":0.000014913819,"teacher_disagreement_score":0.869937,"about_ca_system_score_codex":0.000028346387,"about_ca_system_score_gemma":0.000012608449,"threshold_uncertainty_score":0.3014872},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8966175,0.0012177385,0.06477053,0.0012545404,0.019247942,0.0002752631,0.0000023899693,0.00030998368,0.016304163],"genre_scores_gemma":[0.99848384,0.0000144920705,0.0012878046,0.000111557994,0.000019362184,0.000007737048,5.4923095e-7,0.000008481851,0.000066178545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879813,0.000055578326,0.00031696775,0.00027564156,0.00028667998,0.00026699682],"domain_scores_gemma":[0.9989696,0.0001724753,0.00005997191,0.0004926562,0.00020338669,0.00010191978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031821258,0.000115526826,0.00022764935,0.000280312,0.00008797043,0.0000688589,0.0006193571,0.00008810491,0.000016948316],"category_scores_gemma":[0.0001488632,0.00010816987,0.00011783627,0.0013565647,0.00007011801,0.00030930722,0.000117387084,0.000139841,0.00007065902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019891695,0.00012477889,0.00062530756,0.0000141854825,0.00001122893,0.000009218114,0.00018697459,0.000042739626,0.00021214575,0.99718094,0.0007448583,0.0008456304],"study_design_scores_gemma":[0.0011227061,0.00041821212,0.0027421683,0.00008421046,0.000009627896,0.00007484209,0.00006335602,0.0020497735,0.00472431,0.9862057,0.0022143614,0.00029075524],"about_ca_topic_score_codex":0.00008375756,"about_ca_topic_score_gemma":0.000003120401,"teacher_disagreement_score":0.10186639,"about_ca_system_score_codex":0.000055551947,"about_ca_system_score_gemma":0.000058693295,"threshold_uncertainty_score":0.44110394},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9945443,0.000062752166,0.0000034450966,0.0003079031,0.00058077276,0.00017648077,0.0000063282655,0.00005101827,0.0042669545],"genre_scores_gemma":[0.99916065,0.000021739166,0.0003223944,0.000220237,0.000011353582,0.000009500264,0.0000011784607,0.000028275894,0.00022470044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903333,0.00007282311,0.00023590052,0.00021773251,0.00022181126,0.00021838912],"domain_scores_gemma":[0.99893135,0.00030781198,0.00013613241,0.0004752066,0.00008664967,0.00006284411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035792871,0.00016079872,0.00023967281,0.00006493796,0.00015768081,0.000034821318,0.0002284196,0.00007290216,0.0000916043],"category_scores_gemma":[0.0002280846,0.00011218612,0.00006882557,0.00012780237,0.00027476877,0.00006149853,0.00008352414,0.00011840628,0.00002492356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020121557,0.000070710514,0.0019831937,0.000020212974,0.000043544824,0.0000019649663,0.0016385108,5.240945e-8,0.001177227,0.98712295,0.007847209,0.00007427966],"study_design_scores_gemma":[0.00062115595,0.0001510277,0.008273128,0.000056746965,0.000020976193,0.0000036923368,0.00011516237,0.000017017583,0.012959678,0.976963,0.000680918,0.00013750579],"about_ca_topic_score_codex":0.00006614287,"about_ca_topic_score_gemma":0.000019366818,"teacher_disagreement_score":0.0117824515,"about_ca_system_score_codex":0.000014320856,"about_ca_system_score_gemma":0.000016772747,"threshold_uncertainty_score":0.4574817},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95503324,0.00013931977,0.00007857004,0.0000043820555,0.0030778875,0.00007668948,0.0000023214945,0.00019026571,0.041397303],"genre_scores_gemma":[0.9998326,0.000008927767,0.000049475897,0.000012247064,0.0000056442827,0.0000046592336,0.0000026175476,0.00003104337,0.000052828243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917996,0.000017897264,0.00027819586,0.000114757764,0.00014273479,0.00026646387],"domain_scores_gemma":[0.9995128,0.00007080156,0.000035199686,0.00027093376,0.000032447315,0.000077810335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003359552,0.00013418513,0.00019509395,0.0000780162,0.000035989306,0.00001016225,0.00017579594,0.00008578339,0.00008921962],"category_scores_gemma":[0.000008953845,0.00014175537,0.00008803153,0.00029087457,0.000044517445,0.000093379495,0.000020924925,0.00012049122,0.000098352706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010851735,0.000033078868,0.02516102,0.00010213547,0.000065578846,0.000012369904,0.0003069333,0.00003581364,0.013270398,0.95924044,0.0006857168,0.001075648],"study_design_scores_gemma":[0.00097616145,0.000042052485,0.032220203,0.0001286454,0.000029478757,0.00003931677,0.00022315212,0.00026629024,0.07053303,0.89244586,0.0026518772,0.0004439321],"about_ca_topic_score_codex":0.000013141,"about_ca_topic_score_gemma":0.0000026805317,"teacher_disagreement_score":0.06679459,"about_ca_system_score_codex":0.000022168704,"about_ca_system_score_gemma":0.0000041246085,"threshold_uncertainty_score":0.57806164},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6662518,0.00064341014,0.27356017,0.0013139303,0.0028469153,0.00030790377,0.00000551664,0.0035037843,0.05156662],"genre_scores_gemma":[0.96412235,0.000029621064,0.035310898,0.00014251185,0.0000023849957,0.000019176952,0.0000034514844,0.000009034319,0.00036058988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992039,0.000024068915,0.00015601474,0.0002623241,0.00018577965,0.00016789607],"domain_scores_gemma":[0.99937534,0.000032020853,0.000070495225,0.0003377389,0.00012099888,0.00006342136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008531862,0.00009904032,0.00009627889,0.00009431008,0.0001867989,0.00014912142,0.0005182226,0.00004593551,0.0000045650568],"category_scores_gemma":[0.000050802806,0.00010486504,0.000040057075,0.00045533938,0.00011359281,0.0015335288,0.00010022917,0.00009440731,0.00004846656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021862547,0.00015753736,0.0025281343,0.000009827308,0.000013567739,0.000027987324,0.00040727944,7.072067e-7,0.0023281898,0.8587923,0.06520718,0.07052508],"study_design_scores_gemma":[0.0001909985,0.00005300706,0.0004910335,0.000013881651,0.0000018879332,0.00024679513,0.0000064972255,0.0006680943,0.022130048,0.974505,0.0015173893,0.0001753554],"about_ca_topic_score_codex":0.00000934953,"about_ca_topic_score_gemma":1.7792476e-7,"teacher_disagreement_score":0.29787058,"about_ca_system_score_codex":0.000034467717,"about_ca_system_score_gemma":0.00005470019,"threshold_uncertainty_score":0.4276272},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946231,0.00012337118,0.00039286067,0.00034679356,0.0026681202,0.00010261327,0.0000013101203,0.000169435,0.0015723419],"genre_scores_gemma":[0.9943501,0.000013348301,0.0050682253,0.00033475365,0.0000018490192,0.000005856762,0.0000015598995,0.0000114723925,0.00021283094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986514,0.00006648701,0.00028615922,0.00036961472,0.000349513,0.00027684018],"domain_scores_gemma":[0.9987213,0.00008581173,0.00013962663,0.00068856956,0.00025576752,0.00010891364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033897822,0.00015164673,0.00021419174,0.00017093337,0.00013627576,0.000047685404,0.0005539368,0.000078599376,0.00002271768],"category_scores_gemma":[0.000046134264,0.00013511488,0.000095675256,0.00067112077,0.00015230975,0.0001510266,0.00014320614,0.00011311541,0.00011889164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011461585,0.00012878099,0.00020786055,0.0000055024148,0.000017307257,0.0000037910409,0.00023250646,0.000011463424,0.0035726002,0.9909638,0.0041585825,0.00068633247],"study_design_scores_gemma":[0.00090294215,0.00050668826,0.0002234462,0.000030365096,0.0000059732174,0.000005757894,0.0000031548232,0.0021031736,0.042048067,0.9537876,0.00022607564,0.00015675288],"about_ca_topic_score_codex":0.000054555232,"about_ca_topic_score_gemma":0.0000012158903,"teacher_disagreement_score":0.038475465,"about_ca_system_score_codex":0.000011102691,"about_ca_system_score_gemma":0.000035359546,"threshold_uncertainty_score":0.55098253},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99191695,0.00026450117,0.00011994663,0.0030078585,0.0018656432,0.00014529446,0.0000013837206,0.00014459855,0.0025338207],"genre_scores_gemma":[0.9965821,0.0000127928915,0.0020262965,0.0010631875,0.0000015500514,0.000006105985,4.928213e-7,0.000009383076,0.0002981018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880207,0.000060811275,0.00025478308,0.00028578195,0.00035496743,0.00024161027],"domain_scores_gemma":[0.99875546,0.00011374479,0.0001334379,0.0008181205,0.00011204884,0.00006719582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000303014,0.00012761317,0.00016104564,0.000059260514,0.00013629047,0.00004358991,0.0009524358,0.00006049321,0.000013871375],"category_scores_gemma":[0.0000733232,0.000090725865,0.00009138394,0.00047283576,0.000062694664,0.00013005114,0.00019731185,0.00017186812,0.000099314966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004094347,0.0001373857,0.00036730422,0.000005222034,0.000009447137,7.9303436e-7,0.0002790427,0.0003105352,0.0036629601,0.987611,0.0052398765,0.0023723503],"study_design_scores_gemma":[0.0010499464,0.0001235664,0.0010678805,0.000060110695,0.0000068670356,0.0000035015073,0.000006810405,0.009999001,0.049939215,0.9359415,0.0016235864,0.00017798632],"about_ca_topic_score_codex":0.000031693784,"about_ca_topic_score_gemma":0.000002069075,"teacher_disagreement_score":0.05166946,"about_ca_system_score_codex":0.000024982939,"about_ca_system_score_gemma":0.00004762485,"threshold_uncertainty_score":0.36996934},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9949439,0.0001522331,0.00008640669,0.000007905705,0.0015333496,0.00013865471,0.0000061543656,0.00030973824,0.0028216431],"genre_scores_gemma":[0.9998211,0.000013057918,0.00006267852,0.000013960187,0.000011522743,0.000018781859,0.0000035857558,0.00003906223,0.00001624726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925935,0.00002037757,0.00015303055,0.0001752526,0.00012238526,0.00026962138],"domain_scores_gemma":[0.99949664,0.00006619444,0.000029992281,0.00026462373,0.000028161043,0.00011438338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016627449,0.00017223539,0.00018949092,0.000081097154,0.00011477688,0.000069037065,0.00011582493,0.00007443185,0.0000151632275],"category_scores_gemma":[0.000011120296,0.00015897269,0.00003304515,0.00019620982,0.00007934165,0.00016868966,0.0000216671,0.0002755266,0.000020471105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011806459,0.00003390542,0.06988427,0.00016308004,0.00012701147,0.000031725438,0.0010825421,0.00022475356,0.24276021,0.6838456,0.00012983724,0.0017052648],"study_design_scores_gemma":[0.014228954,0.0008615439,0.25788194,0.0010801767,0.00031176256,0.0007986842,0.0017132687,0.041335274,0.10260442,0.49854195,0.07518581,0.005456196],"about_ca_topic_score_codex":0.000018116905,"about_ca_topic_score_gemma":0.000038365353,"teacher_disagreement_score":0.18799767,"about_ca_system_score_codex":0.000007864909,"about_ca_system_score_gemma":0.0000053900426,"threshold_uncertainty_score":0.6482718},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98664665,0.000352018,0.0000023288148,0.000018573344,0.00208866,0.00016818751,0.0000033823299,0.00012720758,0.010593007],"genre_scores_gemma":[0.99981105,0.00004922889,0.000012627265,0.000016396174,0.0000068739237,0.000013597551,5.405708e-7,0.000024989044,0.00006467856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923384,0.000062734674,0.00019366547,0.00014994066,0.00014465716,0.00021513205],"domain_scores_gemma":[0.9994498,0.00005668245,0.000046247693,0.00034302723,0.000044891225,0.000059362777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022943002,0.00015060348,0.00018954164,0.00008872185,0.00012430894,0.000021388842,0.00022267259,0.00007822452,0.00001632964],"category_scores_gemma":[0.000019189409,0.00011603759,0.0000995469,0.00036031255,0.0002477323,0.00009188289,0.000051580773,0.00013177178,0.000012063996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023711369,0.00003230003,0.015172861,0.0001375797,0.000112885806,0.0000023501975,0.0012460381,0.000014350792,0.023499623,0.95789665,0.0013842146,0.00047745073],"study_design_scores_gemma":[0.0013554316,0.00040840762,0.08978393,0.00020346846,0.00008858058,0.00004024987,0.00033448217,0.00038037173,0.07683954,0.82094395,0.009109379,0.0005121983],"about_ca_topic_score_codex":0.000024736279,"about_ca_topic_score_gemma":0.000009569129,"teacher_disagreement_score":0.13695267,"about_ca_system_score_codex":0.000012925955,"about_ca_system_score_gemma":0.0000066271696,"threshold_uncertainty_score":0.47318757},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844597,0.00007659807,0.000002428186,0.0005244345,0.0003037595,0.00022319559,0.000009126656,0.00010646426,0.014294292],"genre_scores_gemma":[0.9989371,0.00001702299,0.00021683349,0.00018129806,0.00002006494,0.000042563057,0.0000029704738,0.000019605022,0.00056257186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992181,0.000060279024,0.00018530361,0.00023795723,0.00013188757,0.0001664764],"domain_scores_gemma":[0.9992683,0.00013068314,0.0000907484,0.00038923946,0.00005326096,0.00006775108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029358262,0.00012284405,0.00012844347,0.000074237556,0.00020010324,0.000035337023,0.0001651643,0.00007079099,0.000021442907],"category_scores_gemma":[0.000109831126,0.00009607633,0.000032948494,0.00020131555,0.00023900117,0.000096362455,0.000048591322,0.000109233224,0.000079931044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007913431,0.00016424121,0.00018847984,0.000014631216,0.00002271608,0.0000010857273,0.0013123307,3.6400213e-8,0.0007638596,0.99243176,0.0043806597,0.00064108276],"study_design_scores_gemma":[0.00069178065,0.00019140012,0.0008005135,0.000051488256,0.000016637416,0.0000025663564,0.00012019165,0.000008037151,0.008686461,0.98520166,0.0040974016,0.00013185422],"about_ca_topic_score_codex":0.000007631887,"about_ca_topic_score_gemma":0.000004255735,"teacher_disagreement_score":0.014477368,"about_ca_system_score_codex":0.000007282133,"about_ca_system_score_gemma":0.000013099016,"threshold_uncertainty_score":0.3917879},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.878094,0.00017631444,0.08326208,0.0012815646,0.004341658,0.00042979175,0.000003751476,0.00040701448,0.032003835],"genre_scores_gemma":[0.9770112,0.000014426752,0.022487037,0.00017269624,0.0000058483715,0.0000061743076,9.877496e-7,0.000006122005,0.00029549788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905866,0.00004955827,0.0001910225,0.0002237404,0.00026265514,0.00021438136],"domain_scores_gemma":[0.99907535,0.000036886137,0.0000737424,0.00044672936,0.00028497534,0.000082342725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021305883,0.000083629595,0.00012747385,0.000083100844,0.000088882094,0.00005082148,0.00069452304,0.000045229997,0.00004829003],"category_scores_gemma":[0.000035377518,0.000080011916,0.000045927227,0.0005456162,0.00013000266,0.00032259317,0.0001608248,0.00008067645,0.00008421001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042048932,0.00007033714,0.0005656146,0.0000066778643,0.0000073943156,0.0000016002442,0.00055063854,0.00018498913,0.0005707728,0.9937407,0.0026815033,0.0016156068],"study_design_scores_gemma":[0.0022898319,0.0010411226,0.0033820807,0.0000668346,0.000006476241,0.000011029241,0.000044386885,0.27811128,0.04292024,0.6584406,0.013187891,0.0004982303],"about_ca_topic_score_codex":0.000012947844,"about_ca_topic_score_gemma":0.0000013129348,"teacher_disagreement_score":0.33530006,"about_ca_system_score_codex":0.000011478476,"about_ca_system_score_gemma":0.000050389503,"threshold_uncertainty_score":0.32627913},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.993822,0.00017897441,0.0010642979,0.0006685814,0.00074391486,0.000094717034,0.0000035313312,0.000060408496,0.0033636028],"genre_scores_gemma":[0.99826014,0.000014269981,0.0014417085,0.00007150152,0.00000784936,0.0000042062215,0.0000015497765,0.0000024418289,0.00019632603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897194,0.000049594077,0.00023075803,0.00032786318,0.00021034898,0.00020949425],"domain_scores_gemma":[0.99907166,0.0000729184,0.00008132353,0.00060879684,0.00011157278,0.000053709817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029897134,0.00008435255,0.00020285665,0.00029488117,0.000035351877,0.000028214403,0.0008677995,0.000034943256,0.000044691005],"category_scores_gemma":[0.00024750817,0.00006492306,0.00005817725,0.0027165362,0.00012802347,0.0002360298,0.00025773246,0.000074660646,0.00007407445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004957712,0.00025741858,0.07152157,0.000005820939,0.00002139464,0.000010129858,0.0001670329,0.0000019554998,0.00026028336,0.91138643,0.0015660825,0.014796896],"study_design_scores_gemma":[0.0005297478,0.00032045218,0.2647584,0.00001347669,0.0000096429685,0.0000035635476,0.000018140832,0.0008932135,0.00786615,0.72101647,0.0043713744,0.00019937556],"about_ca_topic_score_codex":0.00015598844,"about_ca_topic_score_gemma":0.00001173473,"teacher_disagreement_score":0.19323683,"about_ca_system_score_codex":0.000011910912,"about_ca_system_score_gemma":0.000019741285,"threshold_uncertainty_score":0.26474854},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98103136,0.00017712354,0.00053318683,0.0004983923,0.004733967,0.00016288337,0.0000016374976,0.00040119074,0.012460238],"genre_scores_gemma":[0.9956301,0.000013580115,0.0035973326,0.0005246047,0.0000032407286,0.000011142918,0.000001775009,0.000011460965,0.00020675753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847996,0.000069521215,0.00023658146,0.00045024717,0.00035651572,0.00040714935],"domain_scores_gemma":[0.99871135,0.00006056683,0.00008610177,0.00067999813,0.00028720094,0.00017476817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003478404,0.00016717851,0.00016041164,0.00015254428,0.00026364363,0.000111926056,0.00073610025,0.000079291705,0.000026626647],"category_scores_gemma":[0.000046061912,0.0001541529,0.000080785634,0.0006211797,0.00018438914,0.00032657996,0.00026585895,0.0001576008,0.0003793937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004051565,0.000097537304,0.0022983046,0.000004128579,0.000017491873,0.000009849102,0.0004942712,0.0000010777009,0.0012356368,0.9903828,0.003607276,0.001847556],"study_design_scores_gemma":[0.0007459373,0.00040021626,0.010034071,0.000028545424,0.000008766856,0.000016976965,0.000020060546,0.0009835364,0.01813977,0.9677868,0.001561438,0.00027387083],"about_ca_topic_score_codex":0.00008054106,"about_ca_topic_score_gemma":0.0000053511826,"teacher_disagreement_score":0.02259601,"about_ca_system_score_codex":0.000025032137,"about_ca_system_score_gemma":0.00006801385,"threshold_uncertainty_score":0.6286173},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96963054,0.00007342259,0.00001551023,0.00022688854,0.004323682,0.00014931987,0.0000014523094,0.00003423306,0.025544964],"genre_scores_gemma":[0.9991337,0.0000041455346,0.000037732516,0.00020365842,0.00002539493,0.000010355198,4.1428262e-7,0.000010394725,0.0005742189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99916846,0.00011053806,0.00017997058,0.0002025345,0.00015481365,0.00018369524],"domain_scores_gemma":[0.99927604,0.00015335093,0.000098666234,0.00031625197,0.00009651165,0.000059168964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028978323,0.00008904357,0.00012954079,0.000029717758,0.0001625871,0.00002239867,0.00021553024,0.00007089622,0.00043763977],"category_scores_gemma":[0.00022882315,0.00007139893,0.00003819697,0.00017328007,0.00022060648,0.00004790883,0.00012537805,0.00013491306,0.000063268446],"study_design_candidate":"observational","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.00016466567,0.00022137901,0.24882081,0.00002141382,0.000054358043,0.000010208619,0.013457832,8.7545936e-7,0.003406983,0.70759493,0.017085943,0.009160585],"study_design_scores_gemma":[0.0010482025,0.00027613118,0.9440841,0.00007084912,0.000025878526,0.000016444379,0.0012724944,0.00010436477,0.0008904714,0.048789404,0.003259339,0.00016234121],"about_ca_topic_score_codex":0.0001772643,"about_ca_topic_score_gemma":0.00005342816,"teacher_disagreement_score":0.69526327,"about_ca_system_score_codex":0.000038886505,"about_ca_system_score_gemma":0.000027860699,"threshold_uncertainty_score":0.47918484},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9828154,0.000024037274,0.000022727274,0.0009769386,0.0004292141,0.00039262557,0.000013867111,0.000104103856,0.015221075],"genre_scores_gemma":[0.9948754,0.0000018663013,0.00030671887,0.0007462233,0.0000250675,0.00013932443,0.000003900741,0.000035040168,0.0038665156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989706,0.00007455173,0.00017223395,0.00027441184,0.00020792372,0.00030026265],"domain_scores_gemma":[0.9986715,0.00026995846,0.00010087227,0.00072071626,0.00011163077,0.00012532146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003655049,0.00017594369,0.00017613311,0.0001068416,0.00044163436,0.000058475238,0.0004670329,0.00007295911,0.00044039852],"category_scores_gemma":[0.000041949537,0.000109936605,0.000058037527,0.00076936814,0.00021744402,0.00009509932,0.00008124607,0.0001741457,0.0004047418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015419284,0.00009127195,0.0012895467,0.0000105905665,0.000037903526,9.2642205e-7,0.0012822343,3.7319584e-8,0.00057866407,0.9756619,0.020930931,0.00010060772],"study_design_scores_gemma":[0.0004648121,0.00015158283,0.0019189911,0.000016483504,0.000029800987,0.000007970461,0.00020651233,0.000002127235,0.0067685647,0.91658705,0.07366403,0.00018204948],"about_ca_topic_score_codex":0.000008518052,"about_ca_topic_score_gemma":0.000098361976,"teacher_disagreement_score":0.059074793,"about_ca_system_score_codex":0.000014496958,"about_ca_system_score_gemma":0.000026371508,"threshold_uncertainty_score":0.5202272},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9931821,0.00015646292,0.002165335,0.00029129625,0.0016263623,0.0001331956,0.0000030866727,0.00033193646,0.0021102114],"genre_scores_gemma":[0.9939251,0.0000038525486,0.0054913443,0.00024832983,0.0000027782412,0.000015052613,0.0000065262757,0.000013273117,0.00029373128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986585,0.000048953058,0.00019002116,0.0004435218,0.0003270705,0.00033193806],"domain_scores_gemma":[0.99890566,0.000055124092,0.00010582575,0.00057536754,0.00022962781,0.00012838114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022555518,0.00015974641,0.00015362998,0.00008953098,0.00038111236,0.000110558416,0.00036794486,0.00004600806,0.00001994618],"category_scores_gemma":[0.000018985815,0.00013416716,0.000042750224,0.00060773373,0.00018493738,0.00033749634,0.00016981241,0.000107660504,0.00017822851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016026679,0.000057023917,0.0018750103,0.0000053584454,0.000016453381,0.000013160106,0.00026921544,0.000011241149,0.0024567554,0.9933185,0.0016221196,0.0003391295],"study_design_scores_gemma":[0.0016603707,0.00042542128,0.0008478977,0.00007019388,0.000010978525,0.00004955948,0.000012196117,0.0043749674,0.008420556,0.9832421,0.00059535296,0.00029039624],"about_ca_topic_score_codex":0.000033246306,"about_ca_topic_score_gemma":0.000021672795,"teacher_disagreement_score":0.010076396,"about_ca_system_score_codex":0.00004234061,"about_ca_system_score_gemma":0.00003758125,"threshold_uncertainty_score":0.54711777},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925583,0.00020423743,0.00014090627,0.00017301153,0.0029116042,0.00021026375,0.000004765888,0.00015128957,0.0036456003],"genre_scores_gemma":[0.9863546,0.000057641206,0.012274918,0.000294282,0.00009208225,0.000016619026,0.0000028886957,0.00005099309,0.0008560089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985405,0.00007383306,0.00031777206,0.00037928423,0.0003144565,0.00037413425],"domain_scores_gemma":[0.99837106,0.00076636055,0.0001642823,0.0004691508,0.000094742005,0.00013439497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003442932,0.00022369281,0.00031785498,0.00021405764,0.00020019084,0.000058224225,0.00024875227,0.00013473166,0.00014494182],"category_scores_gemma":[0.0011836761,0.00021406099,0.000052600335,0.00042597388,0.00021196173,0.00020664764,0.00012503142,0.00022081635,0.0001152429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019781875,0.000060971768,0.00034991672,0.000022460274,0.000033671473,0.000008659922,0.00016945561,7.345398e-7,0.00038125244,0.99515617,0.0031135578,0.00068337657],"study_design_scores_gemma":[0.0011449305,0.00015114747,0.00022385811,0.00003956913,0.00002419722,0.000008304692,0.000026089321,0.00003830256,0.0049264827,0.9920398,0.0011230783,0.0002542537],"about_ca_topic_score_codex":0.00003476192,"about_ca_topic_score_gemma":0.0000057782104,"teacher_disagreement_score":0.012134012,"about_ca_system_score_codex":0.00012538958,"about_ca_system_score_gemma":0.000039647515,"threshold_uncertainty_score":0.8729154},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99232435,0.00011396664,0.00009582985,0.00021185745,0.0015574973,0.00013493127,0.0000031204922,0.00010639457,0.005452047],"genre_scores_gemma":[0.99833286,0.00001534293,0.0010334303,0.00015897464,0.00005072306,0.000011861103,0.0000019939225,0.000031473508,0.0003633543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897593,0.000039649327,0.00021520106,0.00026083487,0.00022058489,0.0002878019],"domain_scores_gemma":[0.9992277,0.00014356984,0.000076303,0.00035001864,0.00009362585,0.00010879006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030458975,0.00015839256,0.00022697676,0.000051981035,0.00017495148,0.000065709624,0.00016282592,0.00008591536,0.00009592695],"category_scores_gemma":[0.00013308736,0.00014390115,0.000040770952,0.00012153599,0.00019982834,0.00013281978,0.000093712704,0.00010205536,0.0001725074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015816046,0.00009890451,0.0029615322,0.000036607304,0.000026669772,0.000008873634,0.00059628516,2.3844867e-8,0.001100191,0.9832626,0.011452465,0.00044004206],"study_design_scores_gemma":[0.00082585966,0.0001241976,0.0029871948,0.000039666193,0.000019970155,0.000013277651,0.0000856124,0.00003622848,0.003693612,0.97810173,0.0138785085,0.00019412514],"about_ca_topic_score_codex":0.000025076211,"about_ca_topic_score_gemma":0.00001482159,"teacher_disagreement_score":0.0060084905,"about_ca_system_score_codex":0.000036952242,"about_ca_system_score_gemma":0.00003287435,"threshold_uncertainty_score":0.58681184},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99293673,0.0000060415405,0.000068570356,0.00008390278,0.00018795945,0.0003044928,0.000045335906,0.00009451285,0.0062724603],"genre_scores_gemma":[0.99846685,0.0000032922333,0.00078871974,0.00003768408,0.000016337874,0.00004844396,0.000034668923,0.00003389233,0.00057011336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990478,0.00006547237,0.00024540938,0.00023113159,0.00017415335,0.00023600971],"domain_scores_gemma":[0.9990008,0.000087982255,0.00016936284,0.0005112457,0.0001489283,0.00008170818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016048444,0.00016885686,0.00022678466,0.00009747981,0.00028480048,0.000021799906,0.0002317449,0.00005589724,0.00023424586],"category_scores_gemma":[0.000023319773,0.0001398227,0.00006345166,0.00045038218,0.0003120477,0.00010837719,0.000054031316,0.00008198199,0.000060125214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044073113,0.00015623853,0.028004184,0.000018436995,0.00005981934,0.0000017667068,0.00087660557,1.4980289e-7,0.0068659713,0.963563,0.00038203178,0.000027672131],"study_design_scores_gemma":[0.0006365755,0.00017649059,0.013920551,0.00004066682,0.000067897345,0.00000932053,0.00007971428,0.000013412875,0.06484237,0.9197755,0.00026200156,0.00017550701],"about_ca_topic_score_codex":0.000011662285,"about_ca_topic_score_gemma":0.00005550782,"teacher_disagreement_score":0.057976402,"about_ca_system_score_codex":0.000022549499,"about_ca_system_score_gemma":0.000025646501,"threshold_uncertainty_score":0.5701804},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925285,0.00007117016,0.0017175149,0.0005809117,0.00017800416,0.0010973929,0.0000046730947,0.000071432136,0.0037503974],"genre_scores_gemma":[0.9966403,0.000002942153,0.0026767117,0.000040280887,0.000022034264,0.00030971572,0.000002142431,0.000029641657,0.0002761936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887073,0.00007421953,0.0002497783,0.00023290818,0.0002719644,0.00030041722],"domain_scores_gemma":[0.9983687,0.00034067515,0.00016412884,0.00086628296,0.00018270288,0.000077505916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063786085,0.00016118509,0.0001750533,0.000042993448,0.00067327335,0.00003643439,0.0006268328,0.000061113074,0.0000057715083],"category_scores_gemma":[0.000090825684,0.00008490789,0.00008313726,0.0006364943,0.0004466456,0.000041181538,0.00016049416,0.00016601037,0.000032184005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008895383,0.00022869749,0.0017472865,0.000020792239,0.00007730789,2.539419e-7,0.0009582838,0.0000011213158,0.00009745032,0.99343485,0.0013190635,0.0020259647],"study_design_scores_gemma":[0.0005618765,0.00026333545,0.0018080246,0.000034974077,0.00007012479,0.000010785994,0.00057077484,0.0002512266,0.0015665542,0.98622376,0.008474181,0.00016436765],"about_ca_topic_score_codex":0.000013646738,"about_ca_topic_score_gemma":0.00013888346,"teacher_disagreement_score":0.007211051,"about_ca_system_score_codex":0.000020679465,"about_ca_system_score_gemma":0.00003473979,"threshold_uncertainty_score":0.5178342},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98299354,0.00036371642,0.011347408,0.0008158943,0.002492936,0.00070397736,0.000004635158,0.00018343033,0.0010944484],"genre_scores_gemma":[0.9971423,0.0001166754,0.0021932016,0.00014594036,0.000015247653,0.0000895512,0.0000019341724,0.000018385854,0.0002767326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984627,0.00011921933,0.00020384829,0.00041588678,0.00033944528,0.0004589227],"domain_scores_gemma":[0.9981923,0.00074099895,0.000099286364,0.00060641574,0.00024904366,0.00011193322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009997814,0.00015209887,0.00014402605,0.00010273391,0.00085769856,0.00028133768,0.00078741205,0.000057677684,0.000004433548],"category_scores_gemma":[0.00023190927,0.00011704242,0.000079148536,0.00056318205,0.0003816648,0.00080762035,0.00027759932,0.00015283075,0.00004689864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029556117,0.00002974984,0.0010991829,0.000007285937,0.000017358901,0.0000013487557,0.0002270733,5.509684e-7,0.0003910553,0.990075,0.00091995654,0.007201898],"study_design_scores_gemma":[0.00090721104,0.0001498432,0.001520303,0.0000125882825,0.0000049921755,0.000008242511,0.00002340723,0.0027813222,0.0022417116,0.987966,0.0042281984,0.00015615956],"about_ca_topic_score_codex":0.0000051376956,"about_ca_topic_score_gemma":0.000002304177,"teacher_disagreement_score":0.014148778,"about_ca_system_score_codex":0.000030992345,"about_ca_system_score_gemma":0.00003696013,"threshold_uncertainty_score":0.659681},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9898731,0.00003767885,0.00006531221,0.00022651753,0.00064497325,0.000076548065,0.000011914934,0.000021620317,0.009042301],"genre_scores_gemma":[0.9995217,0.0000038613853,0.00004674648,0.000016271468,0.00006307586,0.000005529456,0.000008655538,0.000011526238,0.0003226456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994762,0.000026109174,0.000092101014,0.00012793086,0.000087832304,0.00018982022],"domain_scores_gemma":[0.99951327,0.00014643096,0.000039902712,0.00019388784,0.000041553805,0.000064940374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011873787,0.00008865682,0.00009366383,0.000010570263,0.00035004344,0.00007954359,0.00012863966,0.000027105783,0.000023091325],"category_scores_gemma":[0.000006654014,0.000065640896,0.000031884676,0.000061438564,0.00014307063,0.000056809014,0.00007094275,0.000105314306,0.00006962249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030321648,0.000011436891,0.4534509,7.282707e-7,0.00002917903,2.252119e-7,0.00013376892,7.866544e-8,0.000017002967,0.5340461,0.0008039074,0.01150363],"study_design_scores_gemma":[0.00067236106,0.000095490184,0.21373843,0.000008039057,0.00003120878,5.190671e-7,0.00034582903,0.0006545781,0.00043337408,0.76555806,0.01827199,0.0001901247],"about_ca_topic_score_codex":0.000074192205,"about_ca_topic_score_gemma":0.000008051278,"teacher_disagreement_score":0.23971246,"about_ca_system_score_codex":0.000008623566,"about_ca_system_score_gemma":0.000019404086,"threshold_uncertainty_score":0.26922867},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9574125,0.0016112339,0.00022459937,0.0027562205,0.019508783,0.00037862096,0.000008264291,0.00018752011,0.017912252],"genre_scores_gemma":[0.9959494,0.00023078574,0.001216445,0.00027523012,0.000010155546,0.00000886334,0.000001238453,0.000029453211,0.0022784125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996961,0.0002456234,0.00072029163,0.0006321796,0.0007178831,0.0007230324],"domain_scores_gemma":[0.99637735,0.00037565897,0.00041297742,0.0017076209,0.0009030534,0.00022333484],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011955021,0.00033052775,0.00037601078,0.00008816204,0.0008396683,0.00027897724,0.0017459115,0.00020267858,0.00007360879],"category_scores_gemma":[0.0001404232,0.00024787712,0.00024138519,0.0013232761,0.0010989456,0.0003127516,0.00064359175,0.00033686176,0.0013353236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023247752,0.00020658388,0.0024899927,0.000018250403,0.00008292559,0.0000038632957,0.00077187025,0.000005608409,0.00030543614,0.96721226,0.02631531,0.0025646423],"study_design_scores_gemma":[0.001081608,0.00028427684,0.0011698245,0.00013749016,0.000040516774,0.000017730923,0.000067878194,0.0056085135,0.002573783,0.9811741,0.007524366,0.00031991248],"about_ca_topic_score_codex":0.00018734876,"about_ca_topic_score_gemma":0.000009101441,"teacher_disagreement_score":0.03853691,"about_ca_system_score_codex":0.000028251858,"about_ca_system_score_gemma":0.00019322662,"threshold_uncertainty_score":0.9999973},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9353138,0.000017792581,0.00214275,0.00035105614,0.00040016908,0.00017572843,0.000016621645,0.000046528425,0.061535534],"genre_scores_gemma":[0.99752504,0.0000015967452,0.001172213,0.00009784838,0.00003784275,0.000035709567,0.000009327052,0.000011164417,0.0011092325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995452,0.000011739223,0.00009984266,0.00014751687,0.00006059316,0.00013507089],"domain_scores_gemma":[0.99956214,0.00009367494,0.000035803158,0.00020506974,0.00003594866,0.000067380024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004466478,0.000086121065,0.00010500643,0.000013785819,0.00016847606,0.000024010234,0.00007308807,0.000017629016,0.00048223283],"category_scores_gemma":[0.000008508832,0.00007369147,0.000028583905,0.00008094948,0.00009310501,0.000041786483,0.000043161243,0.000058481914,0.00013527453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005352579,0.00006127505,0.00014496998,0.0000015751206,0.000010286759,9.1355105e-8,0.000045640656,4.887486e-7,0.00017358441,0.9957989,0.0017305077,0.0020273328],"study_design_scores_gemma":[0.00038053058,0.000053056137,0.00012163098,0.0000075319367,0.0000068483287,2.628379e-7,0.000033885746,0.00009940705,0.001851,0.9808218,0.016534623,0.00008944667],"about_ca_topic_score_codex":0.000008056705,"about_ca_topic_score_gemma":1.4779532e-7,"teacher_disagreement_score":0.062211245,"about_ca_system_score_codex":0.0000064911883,"about_ca_system_score_gemma":0.000008085646,"threshold_uncertainty_score":0.52801114},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98421115,0.000002247518,0.00017872106,0.00020559838,0.00013507628,0.00036838764,0.0000082571,0.000046940826,0.014843603],"genre_scores_gemma":[0.9995988,0.0000018812058,0.00011501703,0.00012994891,0.000004816568,0.000053200707,0.0000012592363,0.000015255105,0.00007980619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992181,0.000132666,0.00016950614,0.00016246332,0.00016370109,0.00015355794],"domain_scores_gemma":[0.9978385,0.0012919446,0.00016207802,0.00046623734,0.00019967456,0.000041567433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029772037,0.000116279116,0.00016483742,0.000034170633,0.00018343041,0.000011373156,0.00024482296,0.00006299286,0.00015543964],"category_scores_gemma":[0.00025605876,0.00007346123,0.00005711967,0.0004287061,0.00030369236,0.00003842356,0.00003465846,0.00015436453,0.00004322982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008181848,0.00026561847,0.0055984613,0.000008628698,0.00005480507,5.753756e-7,0.00039962897,3.6784266e-7,0.00006829551,0.9911254,0.0023666925,0.000029692832],"study_design_scores_gemma":[0.0005052635,0.00017960815,0.0022528667,0.000032713226,0.000025148014,0.0000025466697,0.00018499665,0.000023484105,0.012966982,0.9835988,0.00013348357,0.00009410759],"about_ca_topic_score_codex":0.000018271754,"about_ca_topic_score_gemma":0.000013183603,"teacher_disagreement_score":0.015387647,"about_ca_system_score_codex":0.000016620968,"about_ca_system_score_gemma":0.000027515267,"threshold_uncertainty_score":0.2995662},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5720261,0.0002613094,0.41959018,0.0003858621,0.0057889177,0.00067898975,0.00004770171,0.0003902381,0.0008307536],"genre_scores_gemma":[0.8011332,0.0000017158576,0.19869019,0.00011911972,0.000004959698,0.0000062719905,0.000008732352,0.000009811789,0.000025985519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850565,0.000087820095,0.00037532492,0.00043102851,0.00026750215,0.00033266985],"domain_scores_gemma":[0.99831086,0.00023741035,0.00021463716,0.0005574424,0.0005752483,0.00010436982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049985107,0.00017357226,0.00029362744,0.0001452811,0.00029072948,0.00008152857,0.00065439864,0.000074120435,0.000004093133],"category_scores_gemma":[0.00004737777,0.00016530184,0.00012293895,0.00055470027,0.00022739981,0.00020953019,0.00024114615,0.00010926175,0.000009740899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047410267,0.00013527309,0.00022431654,0.00001362835,0.000037682494,0.0000011472256,0.00059232686,0.00000398745,0.0010699088,0.9751561,0.0010605139,0.021700332],"study_design_scores_gemma":[0.0011128228,0.0004670605,0.0005405229,0.000050960967,0.000010235976,0.0000039252695,0.000020852296,0.16348386,0.008766845,0.8249216,0.0004309064,0.00019042504],"about_ca_topic_score_codex":0.000041654574,"about_ca_topic_score_gemma":0.000002940906,"teacher_disagreement_score":0.22910716,"about_ca_system_score_codex":0.0000159181,"about_ca_system_score_gemma":0.000049644677,"threshold_uncertainty_score":0.6740813},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87940025,0.000037120164,0.11264163,0.00088786986,0.0058514397,0.00041514696,0.0000036569036,0.00018192701,0.00058094825],"genre_scores_gemma":[0.99651915,0.0000012414987,0.0027337128,0.00019791439,0.00027644078,0.00004125541,0.000003879801,0.000012321047,0.00021406473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892247,0.00004669107,0.00019553458,0.00028936745,0.00023603585,0.00030988135],"domain_scores_gemma":[0.99896103,0.00029886205,0.000129293,0.0003492875,0.0001985966,0.00006295177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030310842,0.00015149945,0.00016659404,0.00006238217,0.0004536282,0.0003405904,0.0007705647,0.00003962337,0.0000069284793],"category_scores_gemma":[0.000027555052,0.00009773245,0.00006667851,0.00025880485,0.000101337704,0.0005388145,0.00015189275,0.00007646477,0.000036695154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003930611,0.00003149583,0.00008935376,0.0000065706577,0.000038876075,0.000001418542,0.0010818593,0.000007910203,0.0010424297,0.9872442,0.0038522193,0.0065643573],"study_design_scores_gemma":[0.0024662446,0.00056249317,0.0008483207,0.000023441939,0.000022696535,0.00000755398,0.000047409878,0.016338963,0.019871138,0.9523535,0.0071386155,0.00031962158],"about_ca_topic_score_codex":0.00004984133,"about_ca_topic_score_gemma":0.00003070452,"teacher_disagreement_score":0.11711891,"about_ca_system_score_codex":0.00004509328,"about_ca_system_score_gemma":0.000096743526,"threshold_uncertainty_score":0.39854136},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9086571,0.00091812783,0.00015552047,0.009446708,0.016388953,0.00045250778,0.000016687574,0.00043709844,0.06352731],"genre_scores_gemma":[0.9954382,0.000014074293,0.00041963035,0.00027215193,0.00008208177,0.00004825591,0.0000015791093,0.000019854288,0.0037041642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984499,0.00016769559,0.00026735914,0.00031593684,0.0003962091,0.0004028482],"domain_scores_gemma":[0.9985785,0.00037975484,0.00012229942,0.00068355276,0.00014741161,0.000088505345],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008507642,0.0001620954,0.00019894536,0.000041451927,0.0007173878,0.00026499984,0.0007435893,0.000050495863,0.005166453],"category_scores_gemma":[0.0002413225,0.00010980374,0.000091188806,0.00024929253,0.00041137493,0.00018114454,0.00021708131,0.000097307915,0.0027562326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014554933,0.000038411537,0.00008330212,0.0000036539732,0.0000359078,0.0000031742711,0.00009009803,6.3530337e-7,0.018061472,0.9352663,0.045874607,0.000527882],"study_design_scores_gemma":[0.00031532923,0.00018455843,0.0009733145,0.0000030084286,0.00007348013,0.000007778226,0.000025890562,0.00011273266,0.11354277,0.7018717,0.18271473,0.00017468054],"about_ca_topic_score_codex":0.00010191256,"about_ca_topic_score_gemma":0.000083548875,"teacher_disagreement_score":0.23339458,"about_ca_system_score_codex":0.000041261275,"about_ca_system_score_gemma":0.000052258623,"threshold_uncertainty_score":0.99802023},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9393188,0.000099534576,0.009362819,0.00076243747,0.004258951,0.00030560046,0.0000015840395,0.0005905406,0.04529974],"genre_scores_gemma":[0.99690753,0.000008393561,0.0021502106,0.00042737508,0.000011099734,0.000019830502,7.1509953e-7,0.000015904112,0.00045892058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998349,0.0001179524,0.00015826046,0.00046883253,0.0004339736,0.00047199035],"domain_scores_gemma":[0.99828446,0.00023349641,0.000052668194,0.0011243155,0.00014408048,0.00016096474],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035207937,0.00015057389,0.00014552976,0.00022136082,0.00025110977,0.00009037679,0.0014264556,0.00006182757,0.000049099104],"category_scores_gemma":[0.0001462528,0.00014019062,0.00007176998,0.0010001928,0.00022555089,0.00037099392,0.0003058497,0.00021906069,0.0011985534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013083953,0.000075072705,0.00032726294,0.0000021987676,0.000009475632,0.000011865081,0.0001247943,7.6495456e-7,0.0003967021,0.99074477,0.0023612452,0.0059327683],"study_design_scores_gemma":[0.0004512304,0.0004661632,0.0015589908,0.000013322815,0.000001219727,0.0000050998797,0.000004717871,0.00046934807,0.0066281343,0.98767513,0.0025624142,0.00016425217],"about_ca_topic_score_codex":0.0000045843017,"about_ca_topic_score_gemma":0.0000018084148,"teacher_disagreement_score":0.057588756,"about_ca_system_score_codex":0.000040694515,"about_ca_system_score_gemma":0.000038577917,"threshold_uncertainty_score":0.99957913},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98998475,0.000027182647,0.00015048275,0.000070701746,0.0002690586,0.00018798324,0.000004713567,0.00007872142,0.009226427],"genre_scores_gemma":[0.9985107,0.0000017531542,0.0011295236,0.000034608005,0.000015334672,0.000037763883,0.0000024199055,0.000021281901,0.00024661233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991092,0.00006793776,0.00028980803,0.00018109646,0.00015352845,0.00019842508],"domain_scores_gemma":[0.998836,0.00036876553,0.00016787332,0.00042095903,0.00014710709,0.000059296737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032594608,0.00011945904,0.00022365137,0.00007729567,0.00012209758,0.000015384443,0.00024212271,0.00007568051,0.00007455435],"category_scores_gemma":[0.00022772093,0.000112854206,0.000074516145,0.00025568108,0.00019329767,0.00009359528,0.00006702054,0.00009218352,0.000016235894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044218763,0.00014676497,0.00539774,0.00001596794,0.00003854924,8.3439045e-7,0.0011431355,2.3440309e-7,0.0035774254,0.9882687,0.0010437357,0.00032272827],"study_design_scores_gemma":[0.00072590355,0.00014279743,0.0028506357,0.000051472187,0.00003452949,0.0000020609846,0.0003959496,0.0001243063,0.015843986,0.97886336,0.00084111415,0.00012388911],"about_ca_topic_score_codex":0.000019610761,"about_ca_topic_score_gemma":0.00003437759,"teacher_disagreement_score":0.0122665595,"about_ca_system_score_codex":0.000013693105,"about_ca_system_score_gemma":0.000026820002,"threshold_uncertainty_score":0.4602061},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97530174,0.000013825746,0.000044207805,0.00009564253,0.0003104557,0.00013486567,0.000004874859,0.00006727002,0.02402713],"genre_scores_gemma":[0.99884546,0.000002742446,0.0009038186,0.00003277666,0.0000065986806,0.00001750178,0.0000014374343,0.000012242543,0.00017745224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941826,0.000033211116,0.0001800155,0.00011993322,0.00010796076,0.00014061981],"domain_scores_gemma":[0.9992748,0.0001433596,0.000089020905,0.000352669,0.00009477182,0.0000453658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001951275,0.00007730119,0.0001397435,0.000049797116,0.00008115595,0.000006809041,0.00018754466,0.00004974436,0.00011522607],"category_scores_gemma":[0.00006866589,0.000072695875,0.00007185222,0.00027797354,0.0002045548,0.00004003822,0.000029684816,0.000071429895,0.000053258034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000090604735,0.00015308688,0.00067208294,0.000012035334,0.000021684644,3.9656572e-7,0.00021164631,1.1310158e-8,0.0021011017,0.9921564,0.0045703272,0.00009220777],"study_design_scores_gemma":[0.0003160788,0.00009929887,0.0007125349,0.000012016049,0.00002092904,0.0000021400256,0.00004100405,0.000010084888,0.02303863,0.9742972,0.0013741531,0.0000759052],"about_ca_topic_score_codex":0.000004311978,"about_ca_topic_score_gemma":0.0000038813864,"teacher_disagreement_score":0.023849677,"about_ca_system_score_codex":0.000008567829,"about_ca_system_score_gemma":0.000014837432,"threshold_uncertainty_score":0.2964452},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97982854,0.00040038128,0.00043667894,0.0012165403,0.0070607224,0.00015372522,7.200955e-7,0.00019631746,0.010706373],"genre_scores_gemma":[0.9972723,0.000029025721,0.0023008166,0.00012887774,0.0000024041897,0.0000065029035,3.5421562e-7,0.000007791616,0.00025191423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887145,0.00007442579,0.0002700146,0.00024489273,0.00027790546,0.0002613186],"domain_scores_gemma":[0.998595,0.00010851578,0.00012361397,0.00082793593,0.00026301286,0.00008190371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005792399,0.00010719006,0.00014243809,0.000045015066,0.00029478254,0.000075659096,0.0007450844,0.000050872673,0.000011674167],"category_scores_gemma":[0.00006732208,0.00007362562,0.000086854634,0.00053248974,0.0002905558,0.00013601157,0.00021654615,0.00010439368,0.00017792905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025967427,0.000042453827,0.0011899727,0.0000030386725,0.000015792073,0.00000127627,0.00022008343,3.9636325e-7,0.00061827764,0.98531294,0.010683987,0.0019091842],"study_design_scores_gemma":[0.00036428118,0.00008681751,0.0013248201,0.000017210066,0.000004571939,0.000010672827,0.000010632367,0.0006895929,0.009260491,0.9849968,0.003133967,0.000100151134],"about_ca_topic_score_codex":0.000038704424,"about_ca_topic_score_gemma":0.000002296173,"teacher_disagreement_score":0.01744377,"about_ca_system_score_codex":0.000010469548,"about_ca_system_score_gemma":0.000049472823,"threshold_uncertainty_score":0.30023655},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9764188,0.00013852175,0.001225129,0.00009735074,0.0069842706,0.00018186927,0.0000019727863,0.00007145636,0.014880623],"genre_scores_gemma":[0.9995386,0.000004596293,0.0002267778,0.000024667392,0.000032420707,0.000007746868,4.881199e-7,0.0000075249336,0.0001572036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988314,0.00014467639,0.0003122319,0.0003069885,0.00021440981,0.00019029723],"domain_scores_gemma":[0.99855834,0.00014051594,0.00016041321,0.0006647196,0.00042814348,0.00004784228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006063977,0.0001106047,0.00029654702,0.00010257663,0.000069460664,0.000022609316,0.0005084628,0.00005061305,0.000020319843],"category_scores_gemma":[0.00011540985,0.00009743078,0.00010042317,0.00052836037,0.00013844518,0.00025596606,0.00013434392,0.00007643737,0.000015273994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011598577,0.0001589995,0.009311656,0.000030760013,0.000042550928,0.0000012382629,0.0008985057,0.0000029660364,0.0035197565,0.9791837,0.0053903568,0.0014479433],"study_design_scores_gemma":[0.0020433462,0.0021924146,0.037487436,0.0002867515,0.000033383523,0.00004138108,0.00014010297,0.009481677,0.4623656,0.47287798,0.012295738,0.0007542131],"about_ca_topic_score_codex":0.00015036135,"about_ca_topic_score_gemma":0.000020011994,"teacher_disagreement_score":0.5063057,"about_ca_system_score_codex":0.0000188478,"about_ca_system_score_gemma":0.00004591344,"threshold_uncertainty_score":0.39731118},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9493594,0.00008449697,0.007829705,0.00057677727,0.003979499,0.0002999889,0.0000015491783,0.000519875,0.037348684],"genre_scores_gemma":[0.99755514,0.000006527999,0.001645342,0.00035736704,0.000011570676,0.000018397082,7.213144e-7,0.000016116295,0.0003888027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832463,0.00014887184,0.00014609368,0.00047648742,0.00043697402,0.00046695396],"domain_scores_gemma":[0.998252,0.000285132,0.00004703174,0.0011001686,0.00015881493,0.00015686457],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047127396,0.00015499479,0.00014865311,0.00021704074,0.0002638598,0.00010215682,0.0014001175,0.00006210166,0.000058155914],"category_scores_gemma":[0.00017061133,0.00014124953,0.00007704609,0.00096477376,0.00022023496,0.00036194976,0.00031702837,0.0002305641,0.001088898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001759453,0.00007482258,0.0003689739,0.0000025752947,0.000010809398,0.000013860733,0.00013241117,0.0000013552745,0.0005182211,0.99092716,0.0028163106,0.0051159],"study_design_scores_gemma":[0.00048170294,0.00068885676,0.0009906979,0.000013380033,0.0000013925581,0.0000060727207,0.000004685347,0.00072913436,0.0096242875,0.98528165,0.0020092232,0.00016890251],"about_ca_topic_score_codex":0.000005547236,"about_ca_topic_score_gemma":0.0000017586384,"teacher_disagreement_score":0.04819573,"about_ca_system_score_codex":0.000044889235,"about_ca_system_score_gemma":0.00004379952,"threshold_uncertainty_score":0.99968886},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98872864,0.000023487353,0.000017611099,0.0007968403,0.0012085766,0.00010373561,4.0509772e-7,0.000054230273,0.0090664895],"genre_scores_gemma":[0.9989115,0.000004094167,0.0004694606,0.00047921162,7.786685e-7,0.000009684059,2.2712672e-7,0.0000063288417,0.00011870675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901277,0.000080051344,0.0002151294,0.0002405159,0.00023550961,0.00021602835],"domain_scores_gemma":[0.99895054,0.00021504506,0.00008848314,0.00058130216,0.0001177462,0.000046894693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005284443,0.00009955818,0.00013387686,0.00008553679,0.000094156014,0.000034058827,0.0006835591,0.000054255033,0.000031665157],"category_scores_gemma":[0.00008480283,0.000070855596,0.000050326402,0.00070825615,0.00016019716,0.00009930178,0.00016170832,0.0001368302,0.00017069269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005335951,0.00010388356,0.005113745,0.000003141794,0.000005663753,0.0000025348331,0.00038293382,0.0000016923179,0.0002976783,0.99009496,0.0037938775,0.0001945453],"study_design_scores_gemma":[0.00044395158,0.00011249951,0.004192741,0.00004061005,0.0000017798844,0.0000027258423,0.000010050967,0.0006056798,0.0054114433,0.988838,0.00025288027,0.000087619475],"about_ca_topic_score_codex":0.00008508279,"about_ca_topic_score_gemma":0.0000053327717,"teacher_disagreement_score":0.0101828845,"about_ca_system_score_codex":0.000013278562,"about_ca_system_score_gemma":0.000031149542,"threshold_uncertainty_score":0.28894073},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99502873,0.00013017432,0.000660575,0.00010914041,0.001418932,0.00007008081,8.023716e-7,0.0000740802,0.002507501],"genre_scores_gemma":[0.9881955,0.000009797945,0.011671063,0.00006540657,0.000001087118,0.0000027934457,5.8470806e-7,0.000008203606,0.000045601264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988185,0.0000565528,0.0003556426,0.00025763476,0.00030319171,0.00020844422],"domain_scores_gemma":[0.9986338,0.000079074794,0.00019807657,0.0006646567,0.00034931497,0.00007508928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039836994,0.00010781249,0.00022646057,0.0001035128,0.00006718344,0.00001820699,0.00059746887,0.00007271982,0.000014752419],"category_scores_gemma":[0.00005239252,0.000100234996,0.00009773547,0.00067842717,0.00021378341,0.00015751798,0.00018797435,0.00007688965,0.00003591061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004756337,0.000095773095,0.0056498246,0.000016610858,0.000021778469,0.0000014089821,0.00025290062,0.0000019397348,0.007865433,0.9844409,0.0004801446,0.0011684938],"study_design_scores_gemma":[0.0005180606,0.0001093922,0.00095154427,0.000054180022,0.000008311469,0.0000049475243,0.000010474674,0.0012021672,0.06763871,0.929083,0.00031599216,0.00010325462],"about_ca_topic_score_codex":0.000052780742,"about_ca_topic_score_gemma":0.0000016535029,"teacher_disagreement_score":0.059773277,"about_ca_system_score_codex":0.00000706688,"about_ca_system_score_gemma":0.000039217386,"threshold_uncertainty_score":0.40874645},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99109316,0.000043743432,0.00045861464,0.0006293033,0.002832809,0.00012165996,0.0000014000851,0.00016498008,0.0046543106],"genre_scores_gemma":[0.996604,0.0000050343733,0.0027878566,0.00045832983,0.0000014360968,0.0000060589155,6.2224143e-7,0.000007278054,0.00012933926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989786,0.000046351062,0.00020253974,0.0002842914,0.00026691292,0.00022127625],"domain_scores_gemma":[0.9989195,0.00008477503,0.0001022246,0.0006142266,0.00019285142,0.00008644335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002884628,0.00010880061,0.00015820329,0.00014845522,0.00011087982,0.000028765391,0.00055403094,0.00006331193,0.000008166735],"category_scores_gemma":[0.00005854581,0.00009569471,0.00006576931,0.0005937984,0.0001404661,0.000101089565,0.00013233346,0.0000900454,0.00011653461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083577015,0.00012162968,0.0002308769,0.000004599464,0.000008298622,0.0000027547305,0.0003443071,0.0000028491897,0.002759551,0.99326843,0.002074168,0.0011741808],"study_design_scores_gemma":[0.00068559725,0.00081587624,0.00091065175,0.00003640373,0.0000041299363,0.000002383054,0.000004607896,0.0042965086,0.026736556,0.9656048,0.0007739666,0.00012852768],"about_ca_topic_score_codex":0.000029492938,"about_ca_topic_score_gemma":0.000003277261,"teacher_disagreement_score":0.027663635,"about_ca_system_score_codex":0.000012222712,"about_ca_system_score_gemma":0.000044149932,"threshold_uncertainty_score":0.3902317},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99018043,0.00003574311,0.007610474,0.0005963503,0.0009895794,0.0001893982,6.4733905e-7,0.000097315424,0.0003000885],"genre_scores_gemma":[0.994675,0.0000010728803,0.0049858512,0.0002931329,0.0000016310031,0.000013734531,3.0676284e-7,0.0000047145804,0.000024552326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991274,0.000051641782,0.00017190751,0.00025393025,0.00024976573,0.00014539225],"domain_scores_gemma":[0.99853617,0.0000301982,0.00008781604,0.0010513718,0.00021251019,0.00008194386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030734378,0.00007330265,0.000086070264,0.00006637898,0.00013667697,0.00004048285,0.0011535033,0.00003736639,0.0000018370882],"category_scores_gemma":[0.00003450346,0.00005378703,0.000036832393,0.0008991296,0.000085140615,0.0001839297,0.00020294411,0.000057206056,0.000053383483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019237802,0.000049211256,0.0056727557,0.0000025935028,0.0000025054485,1.2731883e-7,0.00036774305,0.00001428829,0.01659881,0.9748493,0.0005037812,0.001936989],"study_design_scores_gemma":[0.00015024061,0.00017484695,0.013278117,0.000015473397,0.0000033171061,0.000002098631,0.000008859439,0.0053769643,0.032987192,0.9474103,0.0004999678,0.000092653856],"about_ca_topic_score_codex":0.00012379189,"about_ca_topic_score_gemma":0.000011851812,"teacher_disagreement_score":0.027439004,"about_ca_system_score_codex":0.000009732155,"about_ca_system_score_gemma":0.000032614822,"threshold_uncertainty_score":0.21933714},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920803,0.00010900657,0.0004541059,0.00047308032,0.002352747,0.000081684826,2.3631192e-7,0.00021012542,0.004238745],"genre_scores_gemma":[0.9945019,0.000005619097,0.004958529,0.00043664806,0.0000012803421,0.000007074625,5.718574e-7,0.0000078388,0.0000805643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988926,0.000054178556,0.00021085647,0.00033998745,0.00020426392,0.00029809505],"domain_scores_gemma":[0.99918705,0.00005141523,0.00005108761,0.0005506434,0.00007793802,0.000081857695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004181877,0.000109684224,0.00013095021,0.00017832089,0.000115358256,0.00009549509,0.000598274,0.000056430177,0.000010543268],"category_scores_gemma":[0.000019055382,0.00010458563,0.000041725267,0.0007436434,0.000067436464,0.00028949027,0.00020627583,0.00013211771,0.00018514408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001821034,0.00005334658,0.0017331156,0.000003021162,0.0000033458477,0.000007833911,0.0006831681,0.0000031506488,0.0007486486,0.9946602,0.00071525614,0.001387075],"study_design_scores_gemma":[0.0004476308,0.00008029275,0.0024046449,0.000028043352,0.0000011723635,0.000004840093,0.000017884515,0.0008640305,0.0015283091,0.9941335,0.0003549982,0.00013470493],"about_ca_topic_score_codex":0.0001757464,"about_ca_topic_score_gemma":0.000019730503,"teacher_disagreement_score":0.004504423,"about_ca_system_score_codex":0.000019000516,"about_ca_system_score_gemma":0.000031777952,"threshold_uncertainty_score":0.42648783},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927383,0.000033278633,0.000053368236,0.0002768763,0.0014599952,0.0006991118,0.000007811555,0.000062159095,0.0046690814],"genre_scores_gemma":[0.9983495,0.0000038281296,0.00072121836,0.0006796593,0.000028638091,0.00006636813,0.0000020797056,0.0000442384,0.00010448415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872595,0.00011057536,0.00024658215,0.00029695133,0.000249289,0.00037063393],"domain_scores_gemma":[0.99778277,0.0013162668,0.00013217285,0.000581265,0.00012773224,0.000059823287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005830251,0.00023279493,0.00026331004,0.00008689093,0.00036112452,0.000051642626,0.00037920184,0.00012572513,0.00007766712],"category_scores_gemma":[0.0006663658,0.00013418781,0.000093860974,0.00023498342,0.00027447476,0.00007939369,0.0000670187,0.0002709221,0.000010057406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016822717,0.000067355584,0.0013718157,0.00004386749,0.00005149572,0.0000055063774,0.0018029502,0.0000011319661,0.000059892212,0.9909812,0.0053067245,0.00013982461],"study_design_scores_gemma":[0.0013445102,0.00058064464,0.00096770865,0.00012923167,0.000037955444,0.000004103779,0.00022370133,0.00013005604,0.0008969346,0.99467677,0.00079419644,0.00021416336],"about_ca_topic_score_codex":0.00001779808,"about_ca_topic_score_gemma":0.000038073904,"teacher_disagreement_score":0.0056111678,"about_ca_system_score_codex":0.00004151612,"about_ca_system_score_gemma":0.00003464112,"threshold_uncertainty_score":0.547202},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930392,0.000012982857,0.00030240673,0.00006315671,0.00012496022,0.0002617238,0.000017927727,0.000044583514,0.0061330455],"genre_scores_gemma":[0.9928736,0.0000057804905,0.0070057986,0.000012355298,0.000003556957,0.000042374846,0.0000038740272,0.0000104872925,0.000042153293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992403,0.000054758184,0.00030104205,0.00013752189,0.0001364681,0.00012990656],"domain_scores_gemma":[0.9990222,0.0001409489,0.00022946003,0.00036186608,0.00020745407,0.000038070713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033079862,0.00008433444,0.00018563819,0.00006448988,0.000059157526,0.000004452028,0.0001870896,0.000055973993,0.000056067707],"category_scores_gemma":[0.000066574525,0.00007811232,0.000062173014,0.00039226655,0.00022986885,0.0000674332,0.000032620203,0.000058113863,0.000012611792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015384961,0.00019229761,0.00049156783,0.000068067144,0.000023446813,5.6463165e-7,0.0003150289,1.6699256e-7,0.031561125,0.9666817,0.00041758304,0.00023306657],"study_design_scores_gemma":[0.00034115868,0.00013692371,0.00069028686,0.00006801612,0.000028629369,0.000003645209,0.00003185051,0.000033477714,0.0654763,0.9330064,0.00011091431,0.00007236791],"about_ca_topic_score_codex":0.000014890304,"about_ca_topic_score_gemma":0.000005405024,"teacher_disagreement_score":0.03391517,"about_ca_system_score_codex":0.000009292959,"about_ca_system_score_gemma":0.000028839302,"threshold_uncertainty_score":0.31853282},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99585766,0.00002059718,0.0000073488563,0.00014463026,0.00009620068,0.0001896615,0.000010323615,0.000016780574,0.0036567918],"genre_scores_gemma":[0.99967766,0.000008222226,0.00011809517,0.000016872544,0.0000031772222,0.00001258737,9.795156e-7,0.000010158437,0.00015224595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939793,0.000066973,0.00019218652,0.00010878841,0.00012342306,0.000110669236],"domain_scores_gemma":[0.9990148,0.0004283083,0.00013610261,0.0003443045,0.000045251487,0.000031214302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025521856,0.00008608204,0.00015774554,0.00005921325,0.00008596099,0.0000067242,0.00019480762,0.000041377705,0.000039814757],"category_scores_gemma":[0.00005667343,0.00006151425,0.000050386167,0.00022794052,0.0002784086,0.000028079872,0.000034638557,0.000068308545,0.000005912668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001610317,0.00017693666,0.0008404619,0.000015049958,0.00003492178,1.9737583e-7,0.00038795543,6.900274e-8,0.003271107,0.9946387,0.0005390734,0.00007944241],"study_design_scores_gemma":[0.0003306299,0.00015902013,0.002177579,0.000030084564,0.000026713593,7.6205185e-7,0.00015910313,0.000015870059,0.032825876,0.96415603,0.00006106818,0.00005728563],"about_ca_topic_score_codex":0.000006597266,"about_ca_topic_score_gemma":0.00000966353,"teacher_disagreement_score":0.030482674,"about_ca_system_score_codex":0.0000055574646,"about_ca_system_score_gemma":0.000008137833,"threshold_uncertainty_score":0.25084782},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95048773,0.00010704597,0.04169379,0.0003018345,0.003124156,0.0003394551,0.00003216519,0.00022619443,0.0036876292],"genre_scores_gemma":[0.99308246,0.0000069310454,0.0062867287,0.00012136706,0.00010827647,0.00002204617,0.0000021697588,0.000041623498,0.00032842098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960861,0.00015153018,0.00066736387,0.0008165698,0.0016000278,0.0006783743],"domain_scores_gemma":[0.99114174,0.0064576245,0.00032906712,0.00076388224,0.0009921746,0.00031549504],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001274309,0.00030420723,0.0004701372,0.00015928253,0.00073479046,0.0002629838,0.0009571026,0.00010816428,0.000098470584],"category_scores_gemma":[0.012645539,0.00022853527,0.000044674212,0.0022070482,0.00027874747,0.0004403484,0.00022262776,0.0004600944,0.00035277262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013763568,0.0005353647,0.24743243,0.00007036931,0.00021781087,0.00019031929,0.0036935336,0.001374761,0.007443205,0.66602266,0.006261807,0.06538138],"study_design_scores_gemma":[0.0022031318,0.0005975395,0.033809077,0.00013951892,0.000032637752,0.000022499435,0.0007379852,0.0018150661,0.004471975,0.9481244,0.0074313446,0.0006148277],"about_ca_topic_score_codex":0.00002755196,"about_ca_topic_score_gemma":0.000054987235,"teacher_disagreement_score":0.28210172,"about_ca_system_score_codex":0.00013262215,"about_ca_system_score_gemma":0.00013600272,"threshold_uncertainty_score":0.9956714},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99783266,0.00011079987,0.0007151899,0.00017666403,0.00037855777,0.00024639492,0.000006022802,0.000032611842,0.00050108985],"genre_scores_gemma":[0.99663574,0.000014925136,0.0032691276,0.000016926324,0.0000063059783,0.000011110412,0.000001623712,0.000011572812,0.000032666685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982678,0.00019908538,0.00039885723,0.00041478543,0.00036418278,0.00035528038],"domain_scores_gemma":[0.9985927,0.00023315361,0.00017780495,0.0006654653,0.00024626302,0.00008461976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000446313,0.0001657291,0.0004125061,0.00022977337,0.000069162015,0.000025129026,0.0006783754,0.000043595974,0.000010024152],"category_scores_gemma":[0.00010986052,0.00014642067,0.00004720329,0.000951698,0.0005523242,0.00028079448,0.00043185006,0.000155961,0.000007309034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052139374,0.0001680948,0.058176804,0.00004746972,0.000021679112,0.000004782445,0.0010820315,0.0000026308312,0.02814566,0.910981,0.00006728523,0.0012504127],"study_design_scores_gemma":[0.0015136849,0.00032248077,0.1543778,0.000111915564,0.0000050505337,0.0000081722355,0.000046043137,0.002493052,0.022746323,0.8179491,0.00023725201,0.00018913481],"about_ca_topic_score_codex":0.000045714358,"about_ca_topic_score_gemma":0.000019471598,"teacher_disagreement_score":0.096200995,"about_ca_system_score_codex":0.000020015992,"about_ca_system_score_gemma":0.00002872146,"threshold_uncertainty_score":0.59708613},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96800673,0.0000065705576,0.000026888698,0.0010162056,0.0006583255,0.00028502743,0.000006636885,0.00008968516,0.029903928],"genre_scores_gemma":[0.99841523,0.0000012361689,0.00005975937,0.0005123121,0.000035348286,0.00005847037,0.0000019142174,0.000025831223,0.00088988827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911475,0.00007834221,0.00017219975,0.00020967014,0.00019649098,0.00022853969],"domain_scores_gemma":[0.9986346,0.0005041417,0.0000769614,0.0006440487,0.0000751042,0.00006517946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036178075,0.00014474135,0.00013175402,0.00003705949,0.00038984336,0.00006931583,0.00038145616,0.000083962994,0.00044984976],"category_scores_gemma":[0.00012758694,0.000101836595,0.00007154006,0.00025213955,0.00022842332,0.000060457456,0.00004928376,0.00020329647,0.0004578961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020884567,0.00022626111,0.00018509624,0.0000052177666,0.000024725265,0.0000020604032,0.0004206378,8.084672e-8,0.00021253446,0.9847692,0.014022003,0.000111246736],"study_design_scores_gemma":[0.0002762063,0.00010791777,0.000456243,0.000025087204,0.000016680018,0.0000026133152,0.00015211108,0.0000270514,0.0020273454,0.9868366,0.009938322,0.00013383795],"about_ca_topic_score_codex":0.0000073393862,"about_ca_topic_score_gemma":0.000012044394,"teacher_disagreement_score":0.03040851,"about_ca_system_score_codex":0.00002381294,"about_ca_system_score_gemma":0.000029540808,"threshold_uncertainty_score":0.58854806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9966492,0.00032396175,0.0010518242,0.00040139162,0.0009373756,0.00013998916,0.0000034728619,0.00007247238,0.00042030544],"genre_scores_gemma":[0.99678856,0.0000153249,0.003028261,0.00008659884,0.000002411286,0.0000075587564,0.0000013334375,0.000011000284,0.000058934125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862486,0.0000827506,0.00036791808,0.00035022802,0.00032231765,0.00025192328],"domain_scores_gemma":[0.99853164,0.00009382454,0.00022306129,0.00065743615,0.00038275894,0.000111275374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005266391,0.00013491648,0.00030738628,0.00015095406,0.000101449376,0.000029903737,0.00052968704,0.00008789596,0.000007744768],"category_scores_gemma":[0.0000986892,0.00013413838,0.00005492011,0.00049296214,0.00032813865,0.00019233098,0.00030302926,0.00009986674,0.000008540425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015180277,0.00021267163,0.0029936878,0.00005671446,0.00003624936,0.000001675082,0.0009787898,0.0000058798696,0.014937652,0.9749071,0.00044515607,0.0054092277],"study_design_scores_gemma":[0.0010868427,0.0003109235,0.010252627,0.000093912786,0.000013571362,0.000003421746,0.000031282263,0.0031363894,0.09762289,0.8871964,0.000076673256,0.00017507367],"about_ca_topic_score_codex":0.00013567689,"about_ca_topic_score_gemma":0.000007227125,"teacher_disagreement_score":0.08771072,"about_ca_system_score_codex":0.000010643671,"about_ca_system_score_gemma":0.000050230974,"threshold_uncertainty_score":0.5470004},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939155,0.00006249885,0.000058808946,0.0000043394493,0.00064554217,0.00012801168,0.0000027616763,0.00012474418,0.00505782],"genre_scores_gemma":[0.99955034,0.000010053966,0.00021781579,0.000009760582,0.000016091313,0.000013902206,7.84797e-7,0.000030664258,0.0001506106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935794,0.00003667743,0.00015997242,0.00013538719,0.00011755466,0.00019249353],"domain_scores_gemma":[0.9994973,0.00013222138,0.000033248634,0.00022363411,0.000041811556,0.00007179276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016360368,0.00013600585,0.00020120948,0.000027268223,0.000058541696,0.000019749585,0.00011127766,0.00006559571,0.000086716966],"category_scores_gemma":[0.00001731336,0.00010424342,0.000023810651,0.00023295092,0.0001137591,0.00010502284,0.000024228784,0.000075671414,0.000029988805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020845265,0.00012348677,0.04392139,0.00029689595,0.00022942902,0.000023240062,0.0014840257,0.000012817134,0.011238798,0.9408055,0.0013396052,0.00031635762],"study_design_scores_gemma":[0.00862826,0.0028193835,0.06552251,0.0007628965,0.00023899367,0.0004232588,0.0012169919,0.001211612,0.05671271,0.85549235,0.0052508144,0.0017202032],"about_ca_topic_score_codex":0.000013209539,"about_ca_topic_score_gemma":0.000012402796,"teacher_disagreement_score":0.085313134,"about_ca_system_score_codex":0.000011047253,"about_ca_system_score_gemma":0.0000067094666,"threshold_uncertainty_score":0.42509234},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9982408,0.00023387537,0.00024349197,0.00022218554,0.00071432756,0.0001683039,0.000010296867,0.00003248832,0.0001342019],"genre_scores_gemma":[0.99875605,0.000052701947,0.0011365005,0.0000331044,0.0000010433762,0.0000024117019,0.0000025346985,0.000007831336,0.00000781521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839836,0.00022441686,0.00041229173,0.0003169592,0.00044879786,0.00019917819],"domain_scores_gemma":[0.99812406,0.00028004113,0.00031191588,0.0008574455,0.00034890044,0.0000776632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010398205,0.0001543244,0.00028479903,0.0001914192,0.00012181136,0.000020227764,0.0005346098,0.00007646006,0.000006890278],"category_scores_gemma":[0.00009888937,0.00010810254,0.00009232944,0.00069550955,0.00047464634,0.00013739713,0.00027647585,0.00013550295,0.0000015706258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020616724,0.00027995522,0.0013929227,0.000037801114,0.000026548309,5.302761e-7,0.00054525916,0.0000025719814,0.004416748,0.99194074,0.0004880722,0.0008482592],"study_design_scores_gemma":[0.0006556959,0.00097122183,0.011109723,0.00014107797,0.000014266241,7.7190094e-7,0.00005024534,0.0018653104,0.0524117,0.9326353,0.000030562624,0.00011410017],"about_ca_topic_score_codex":0.00020627383,"about_ca_topic_score_gemma":0.000010960246,"teacher_disagreement_score":0.059305392,"about_ca_system_score_codex":0.000008035253,"about_ca_system_score_gemma":0.000040659357,"threshold_uncertainty_score":0.44082937},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9548693,0.00027771704,0.017045155,0.0020008744,0.0027634096,0.0005936491,0.00000574129,0.00069089694,0.021753259],"genre_scores_gemma":[0.9957504,0.000059439597,0.0032280972,0.000379648,0.000022923032,0.000055338674,0.0000057963075,0.00002133261,0.00047700954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978385,0.0001855421,0.00028583632,0.000643294,0.0004520744,0.00059475406],"domain_scores_gemma":[0.9982741,0.00017981946,0.000100673686,0.0009010241,0.0002717284,0.00027266884],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005097673,0.00021948824,0.00024420358,0.0002216093,0.0005097233,0.00019081595,0.0008063434,0.000097352095,0.00015623463],"category_scores_gemma":[0.00008563588,0.00022169731,0.000068662135,0.0009769832,0.00050318084,0.0008480711,0.00039345224,0.00022038411,0.0007822886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032412932,0.000090839356,0.0022241187,0.000010467047,0.0000226922,0.000014039568,0.00020873225,0.0000034279733,0.0021281643,0.991601,0.0030792784,0.00058482506],"study_design_scores_gemma":[0.0011913514,0.00033292305,0.0053779157,0.000024552017,0.0000060006555,0.00001718076,0.000025238161,0.0025254101,0.01472933,0.9705498,0.004941126,0.0002791694],"about_ca_topic_score_codex":0.000010105026,"about_ca_topic_score_gemma":0.0000073992455,"teacher_disagreement_score":0.040881116,"about_ca_system_score_codex":0.00004228835,"about_ca_system_score_gemma":0.000050273986,"threshold_uncertainty_score":0.9999957},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96491784,0.0000139905715,0.00005728863,0.00025778508,0.0003386218,0.0002593239,0.0000056121476,0.00018661856,0.033962898],"genre_scores_gemma":[0.99795157,0.0000044947055,0.0012188419,0.00019550964,0.000016187847,0.000041194562,0.0000054475827,0.00003511906,0.00053163595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990538,0.000060008642,0.00016953336,0.00026447896,0.00017990974,0.0002723035],"domain_scores_gemma":[0.99889547,0.00023443572,0.000085223364,0.0006300435,0.000052554464,0.000102292244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001817451,0.00017211601,0.000179289,0.00009518799,0.00023218957,0.000030880037,0.00028871367,0.00006954699,0.00017585576],"category_scores_gemma":[0.000036084126,0.0001408458,0.000068327594,0.00040652373,0.0002376992,0.00008370807,0.000030112551,0.00018201901,0.00026703958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042844407,0.00026597263,0.00030821917,0.000007711227,0.000040233524,0.000005860942,0.00016408054,8.8734545e-8,0.00019761213,0.9919421,0.006690582,0.00033466303],"study_design_scores_gemma":[0.00076649175,0.0003915603,0.0010215988,0.00003233362,0.000032286916,0.0000118384,0.00003726728,0.000013720045,0.0049017146,0.99108297,0.0015182303,0.00019001774],"about_ca_topic_score_codex":0.000004769848,"about_ca_topic_score_gemma":0.000005671808,"teacher_disagreement_score":0.03343126,"about_ca_system_score_codex":0.000022074159,"about_ca_system_score_gemma":0.000024802479,"threshold_uncertainty_score":0.5743525},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9816878,0.000012208673,0.000030856696,0.00048199733,0.00039901098,0.00025711226,0.000009011132,0.00006028992,0.017061748],"genre_scores_gemma":[0.99946296,0.000003308498,0.00016900706,0.000116108895,0.000012377021,0.00003459595,0.0000017224509,0.000018668496,0.00018125256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991422,0.000096713935,0.0002183215,0.00016412958,0.00017133987,0.00020728953],"domain_scores_gemma":[0.99863833,0.0005346344,0.00012463606,0.00057960086,0.00006937715,0.000053396794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003995083,0.00012371237,0.0001657933,0.00006377315,0.00019429506,0.000017967284,0.0003384989,0.000058343398,0.00020448113],"category_scores_gemma":[0.0001183115,0.0000884409,0.00010020668,0.00037396955,0.0003031392,0.000039662387,0.000033798548,0.00013458732,0.00011765529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024175835,0.0001977792,0.00020662749,0.000010098973,0.00003220155,8.817018e-7,0.00037310258,1.4919513e-7,0.0014684616,0.992171,0.005397291,0.000118229065],"study_design_scores_gemma":[0.00028811136,0.00014984218,0.00042534203,0.000023942892,0.000025141208,0.0000018859607,0.000085434585,0.000014563502,0.033503737,0.9642164,0.001166559,0.00009904751],"about_ca_topic_score_codex":0.0000065420163,"about_ca_topic_score_gemma":0.000007782549,"teacher_disagreement_score":0.032035276,"about_ca_system_score_codex":0.000011839317,"about_ca_system_score_gemma":0.000016277998,"threshold_uncertainty_score":0.36065152},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98087275,0.00007750808,0.0076915612,0.00042096293,0.0006098519,0.0008045653,0.000043620414,0.00021153489,0.009267623],"genre_scores_gemma":[0.9886756,0.000005488198,0.0087505905,0.000029598043,0.00003001338,0.00019218115,0.0000061170663,0.000033530137,0.002276859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990171,0.000026696911,0.00024207971,0.00024373301,0.00018783154,0.00028253644],"domain_scores_gemma":[0.9985647,0.00070580724,0.00011771949,0.00029940467,0.0002072778,0.00010506359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001862381,0.00016397235,0.00026964955,0.000041557665,0.00025912852,0.00007096283,0.00014032795,0.00005369124,0.000078210636],"category_scores_gemma":[0.00064092944,0.00013041976,0.00003874042,0.00011299656,0.00046169793,0.00024106482,0.000062968895,0.00007151361,0.00002269819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020346437,0.00010583416,0.0005785712,0.00012957644,0.000038545935,0.0000016889034,0.0003286873,2.1562124e-7,0.000029699315,0.9937636,0.004931419,0.00007178359],"study_design_scores_gemma":[0.00069280004,0.0003133826,0.000267914,0.000103560684,0.00007108985,0.000009370105,0.00026831418,0.00015163686,0.0013176752,0.9947679,0.0018447685,0.00019160463],"about_ca_topic_score_codex":0.000014226237,"about_ca_topic_score_gemma":0.00015865713,"teacher_disagreement_score":0.0078028496,"about_ca_system_score_codex":0.000038633687,"about_ca_system_score_gemma":0.000031330357,"threshold_uncertainty_score":0.53183633},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946428,0.000022293068,0.000009269118,0.0025367239,0.000074610114,0.00024406004,0.000017818835,0.000037557722,0.0024148782],"genre_scores_gemma":[0.9995001,0.000020330976,0.00012830582,0.0001376557,0.000024941208,0.000032752785,0.00006614287,9.955539e-7,0.000088794266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991337,0.000051636267,0.00012288423,0.00022853455,0.00024140785,0.0002218377],"domain_scores_gemma":[0.99942034,0.00021499742,0.000051030802,0.000056372355,0.00012562577,0.00013160256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001964905,0.00009125609,0.00009616668,0.000009788041,0.0003105407,0.00006302032,0.00014244282,0.000044598444,0.00028957712],"category_scores_gemma":[0.000035647707,0.00003695589,0.000023368486,0.00030231604,0.000190518,0.00014292868,0.000057103625,0.00008475604,0.000040727522],"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.00017918342,0.00028873316,0.012501483,0.000006371685,0.000033740092,0.0000035662001,0.00014911288,6.324705e-8,0.06817268,0.67147315,0.004850522,0.24234138],"study_design_scores_gemma":[0.0015578544,0.0019245164,0.50292593,0.000024148252,0.000026238893,0.000010212296,0.00041993032,0.0002054764,0.009224423,0.46480763,0.018535635,0.00033802036],"about_ca_topic_score_codex":0.00040073215,"about_ca_topic_score_gemma":0.0020365964,"teacher_disagreement_score":0.49042445,"about_ca_system_score_codex":0.000026043559,"about_ca_system_score_gemma":0.0000067435567,"threshold_uncertainty_score":0.31706664},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7936323,0.000015176442,0.00010958505,0.000052061052,0.0025614863,0.0001276811,0.0000024639633,0.0001814213,0.20331782],"genre_scores_gemma":[0.9869284,0.0000018214206,0.00090465107,0.000173561,0.000040535644,0.000011035514,0.0000012402173,0.000036462312,0.011902294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990005,0.000075506716,0.0002346154,0.00018380437,0.0002757051,0.00022987254],"domain_scores_gemma":[0.9987237,0.00048093157,0.000105660096,0.0005177162,0.00008964231,0.00008238765],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004998129,0.00015215273,0.00021070839,0.00007601508,0.00026226486,0.000029982972,0.0002820338,0.00008429267,0.0011379021],"category_scores_gemma":[0.0005810266,0.00014421518,0.000078952406,0.00011409841,0.00019952441,0.000097746604,0.000050293653,0.00014046133,0.0021223908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016521983,0.00017591687,0.000008438506,0.000033312266,0.000021477847,0.000009169401,0.0009734904,3.9502194e-8,0.000049142607,0.92528605,0.07329047,0.00013594412],"study_design_scores_gemma":[0.00045967408,0.00021380285,0.000011673507,0.00005336565,0.000020654761,0.000008123568,0.000073849296,0.000016903869,0.0016896573,0.98860747,0.008678292,0.00016654533],"about_ca_topic_score_codex":0.0000013066916,"about_ca_topic_score_gemma":0.000002058724,"teacher_disagreement_score":0.19329609,"about_ca_system_score_codex":0.00006959455,"about_ca_system_score_gemma":0.000026419706,"threshold_uncertainty_score":0.9997752},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9801018,0.00009587546,0.010732115,0.00019890518,0.0007801997,0.00043459635,0.000005313499,0.000267667,0.0073834965],"genre_scores_gemma":[0.98594856,0.000019228653,0.0136010805,0.00007321289,0.000008997035,0.00003038946,0.0000030500967,0.00003299633,0.00028248373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974478,0.00015385139,0.0003524581,0.000638297,0.0007459883,0.0006616441],"domain_scores_gemma":[0.99742347,0.00022191001,0.00020642519,0.0013120722,0.00059912686,0.00023700381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006283884,0.00027490134,0.0003724002,0.00038469612,0.0003084815,0.000103818165,0.0017584702,0.00010994111,0.000038144815],"category_scores_gemma":[0.00009617748,0.00024305738,0.0001181344,0.0021389928,0.0009524289,0.0006578212,0.0004546862,0.00032549657,0.000052170115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015480242,0.00016948748,0.0071417834,0.000024875679,0.000058127494,0.0000389015,0.0003539464,0.0000072633525,0.0015829261,0.9896658,0.00016462413,0.0006374726],"study_design_scores_gemma":[0.0017392169,0.0013781681,0.0030121885,0.000052380175,0.0000096180875,0.0000219367,0.000027476912,0.0012877979,0.027435495,0.9627562,0.0019355214,0.00034400146],"about_ca_topic_score_codex":0.00007961275,"about_ca_topic_score_gemma":0.000046756435,"teacher_disagreement_score":0.02690959,"about_ca_system_score_codex":0.000056259272,"about_ca_system_score_gemma":0.00015030293,"threshold_uncertainty_score":0.99115926},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99112296,0.000109583096,0.00035924464,0.00015827475,0.0025638642,0.000100074656,0.000001426418,0.00015658834,0.005427983],"genre_scores_gemma":[0.99596786,0.000005923704,0.0038354092,0.00011839095,0.0000016217368,0.0000057642724,7.7916127e-7,0.0000070306005,0.000057194233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990018,0.00004919288,0.00021487365,0.0002832781,0.00023081184,0.00022003762],"domain_scores_gemma":[0.99899626,0.00008128375,0.00011343627,0.0004772016,0.00025078905,0.00008100797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002977231,0.00010665228,0.00016542237,0.00014939548,0.00013714674,0.00003839892,0.00054900796,0.000058109028,0.000007069389],"category_scores_gemma":[0.000054947806,0.000100873534,0.000055405886,0.00068279204,0.00016535925,0.00020351623,0.00013480855,0.00009743652,0.000036857742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006379241,0.00006372399,0.0032060705,0.000005912149,0.000017939894,0.0000031753352,0.0005747495,7.8553853e-7,0.0027697661,0.9912499,0.001674813,0.00042674618],"study_design_scores_gemma":[0.00044806086,0.00037965595,0.0025924987,0.00003146756,0.00000522742,0.0000046654964,0.00002402464,0.0004586007,0.019376365,0.97618246,0.0003730024,0.00012396199],"about_ca_topic_score_codex":0.00014167103,"about_ca_topic_score_gemma":0.000007953293,"teacher_disagreement_score":0.0166066,"about_ca_system_score_codex":0.000016234178,"about_ca_system_score_gemma":0.000045874553,"threshold_uncertainty_score":0.41135034},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9840135,0.00047673172,0.00044335192,0.00071040064,0.003415149,0.00015280623,0.0000021315716,0.00027393163,0.010511984],"genre_scores_gemma":[0.99612427,0.00002760334,0.0024439376,0.00086812564,0.00000232321,0.000007944025,0.000002200745,0.000014141175,0.000509478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843466,0.000089774505,0.00022348105,0.0005775383,0.00030744335,0.00036710253],"domain_scores_gemma":[0.9986307,0.00013967033,0.00009776467,0.00071811373,0.00021580132,0.00019793156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032844348,0.00019351089,0.0002096566,0.00010398703,0.00028936402,0.00017744968,0.00049272925,0.000100733996,0.00001899528],"category_scores_gemma":[0.00008000074,0.00018566546,0.000059169975,0.0006197327,0.00023945262,0.00021030339,0.00017956825,0.00017043678,0.00013089429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010748055,0.000099163815,0.0010260752,0.0000070688993,0.000013265984,0.000015883792,0.00035152578,0.0000011014861,0.00045640048,0.9827867,0.014627983,0.0006040783],"study_design_scores_gemma":[0.0009742085,0.0003267245,0.0012820322,0.000049790873,0.0000069591806,0.000013223521,0.000020368445,0.0010075538,0.002742843,0.99002445,0.0032955962,0.00025623836],"about_ca_topic_score_codex":0.00004089947,"about_ca_topic_score_gemma":0.000019896592,"teacher_disagreement_score":0.012110733,"about_ca_system_score_codex":0.000022761753,"about_ca_system_score_gemma":0.000053409356,"threshold_uncertainty_score":0.7571218},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9846051,0.00029184629,0.0034991084,0.00055524136,0.003878703,0.00017257179,0.0000022433917,0.00024008576,0.006755119],"genre_scores_gemma":[0.99407446,0.000010292502,0.0054994184,0.00028286065,0.0000018318839,0.0000058428914,0.0000014018823,0.00001042736,0.00011343601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874777,0.00007103821,0.00026238032,0.00035379903,0.00028610043,0.0002789363],"domain_scores_gemma":[0.9985422,0.00007821469,0.00010336403,0.00061355723,0.0005602287,0.0001024668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000321273,0.0001410813,0.00020352485,0.0001598036,0.00013358757,0.000039113565,0.00059208024,0.00007788151,0.000022209602],"category_scores_gemma":[0.00004852228,0.00012928905,0.00007566235,0.0010645286,0.00023545962,0.00023533775,0.00013690036,0.000113504575,0.00010947989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005435811,0.00010487956,0.00073535193,0.000008373031,0.00002316841,0.000003524166,0.0006318202,0.0000019512274,0.0046408777,0.99080247,0.0020563535,0.0009857847],"study_design_scores_gemma":[0.00065777503,0.00029113397,0.0010148681,0.000035975027,0.0000098231085,0.0000052849728,0.000019773765,0.0013802272,0.028112268,0.9678637,0.00044268178,0.00016650558],"about_ca_topic_score_codex":0.000052627394,"about_ca_topic_score_gemma":0.000004895633,"teacher_disagreement_score":0.023471389,"about_ca_system_score_codex":0.000009907668,"about_ca_system_score_gemma":0.00007259015,"threshold_uncertainty_score":0.52722543},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9975299,0.0001087119,0.000004052004,0.00007021597,0.00018925602,0.00014664086,0.0000036789395,0.000035424477,0.0019121],"genre_scores_gemma":[0.999457,0.000007858911,0.00040771754,0.000017101054,0.000007100897,0.000018948193,6.4120195e-7,0.000007662992,0.00007596262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931276,0.000055245127,0.00026178133,0.00011764933,0.0001321918,0.00012037831],"domain_scores_gemma":[0.9993163,0.00010245226,0.00016632075,0.00027894558,0.000103551014,0.000032480002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024038616,0.00008190622,0.0002027053,0.000064018976,0.0000676112,0.000004480897,0.00022525218,0.00007072196,0.00007218321],"category_scores_gemma":[0.00012453704,0.00006149553,0.00007075944,0.00018305391,0.0005449465,0.0000732756,0.000058499478,0.000065801185,0.000009816831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021978776,0.00026944204,0.0015340745,0.000055015335,0.00002491876,2.575142e-7,0.0005389495,1.7390477e-8,0.020611003,0.97668016,0.00017865097,0.00008551338],"study_design_scores_gemma":[0.00020379528,0.00014288604,0.0008474955,0.000032905256,0.00001971175,0.0000011679934,0.00016215896,0.0000030223575,0.16172384,0.83672905,0.00007575027,0.000058247704],"about_ca_topic_score_codex":0.000008459196,"about_ca_topic_score_gemma":0.0000016586616,"teacher_disagreement_score":0.14111283,"about_ca_system_score_codex":0.000004188017,"about_ca_system_score_gemma":0.000015916545,"threshold_uncertainty_score":0.2507715},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9232371,0.00033073116,0.0031216482,0.0048764995,0.015835369,0.0002018969,0.0000011745587,0.0011510205,0.051244594],"genre_scores_gemma":[0.99111027,0.0000034873383,0.007994766,0.00055274484,0.0000045766055,0.000008512953,4.4819225e-7,0.000008540637,0.00031668748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988307,0.000045710967,0.00017876142,0.00035613903,0.00024995397,0.00033875232],"domain_scores_gemma":[0.99888724,0.000110486966,0.000032339758,0.00056814356,0.00023983723,0.00016193307],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002982814,0.00011354367,0.00012780441,0.00007629271,0.00023548062,0.00013279673,0.0006401103,0.00006894166,0.000038199974],"category_scores_gemma":[0.00018198253,0.0001064052,0.00004749281,0.00043539956,0.00021640067,0.0002792155,0.00027176255,0.00012363264,0.00079231587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002201777,0.00006421146,0.0003032361,0.0000035598516,0.0000049888376,0.0000075009293,0.00013056377,2.0524304e-7,0.00065919844,0.9891477,0.008852296,0.0008243027],"study_design_scores_gemma":[0.00032510117,0.00024149098,0.0004226113,0.000016889624,0.0000038373328,0.000010996123,0.0000068258228,0.0015026814,0.006049601,0.98372394,0.0075433813,0.0001526278],"about_ca_topic_score_codex":0.000015398311,"about_ca_topic_score_gemma":9.833662e-7,"teacher_disagreement_score":0.067873165,"about_ca_system_score_codex":0.000019118539,"about_ca_system_score_gemma":0.000049285918,"threshold_uncertainty_score":0.9999857},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98971725,0.00002255373,0.00013529166,0.00040542663,0.00019295613,0.00044073994,0.000008801611,0.000024684841,0.009052305],"genre_scores_gemma":[0.99754554,0.000003924214,0.002096801,0.000057172652,0.000025411153,0.00007107938,0.0000031075654,0.000014124487,0.00018283835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989369,0.00009343175,0.00036793377,0.00015411706,0.0002655483,0.00018205443],"domain_scores_gemma":[0.99849796,0.00057786965,0.00017910522,0.00061131374,0.00009733434,0.00003643071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010103666,0.000109948065,0.00023393528,0.000046023586,0.00007624203,0.000018340252,0.00041583512,0.000074482195,0.00008480781],"category_scores_gemma":[0.0003844955,0.00007919781,0.000073460535,0.0002680472,0.00016095127,0.000040430496,0.00007443957,0.00012892675,0.000033590382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070459105,0.0003933662,0.00080492615,0.000043896525,0.000012181461,0.0000016117864,0.0012711533,9.357737e-8,0.00028215328,0.9877729,0.009246947,0.00016374877],"study_design_scores_gemma":[0.0007610704,0.00006760519,0.0017202026,0.000031250853,0.000022066963,0.0000036686808,0.0001578088,0.00015597287,0.0022714504,0.9896218,0.005091921,0.000095145],"about_ca_topic_score_codex":0.00002118833,"about_ca_topic_score_gemma":0.00003388591,"teacher_disagreement_score":0.008869466,"about_ca_system_score_codex":0.000025748024,"about_ca_system_score_gemma":0.00004363282,"threshold_uncertainty_score":0.3229593},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9870947,0.00005041693,0.00040514756,0.00020212853,0.0021230837,0.00008633502,0.0000010322136,0.00014685783,0.009890314],"genre_scores_gemma":[0.99885184,0.0000039451334,0.0007036972,0.0003417095,0.0000010018217,0.0000036150366,8.428853e-7,0.000007189146,0.00008614893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894655,0.000048072226,0.00020792284,0.00027713142,0.0003103478,0.00020999953],"domain_scores_gemma":[0.9989028,0.0000877534,0.00010102326,0.00065051595,0.00017203802,0.00008585897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028832562,0.000107847896,0.0001504985,0.00016561907,0.0001026343,0.00003394235,0.00058770354,0.00006570473,0.00001985594],"category_scores_gemma":[0.000047928606,0.00009591773,0.00006014144,0.0005235682,0.00015111493,0.00012304957,0.00009433896,0.00010194505,0.0001482032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006722272,0.00010464487,0.0020614122,0.0000041912253,0.000010637961,0.0000021841122,0.00015912845,0.00000265802,0.00083196594,0.9890318,0.0067884526,0.0009962367],"study_design_scores_gemma":[0.0005700444,0.00043040092,0.002090429,0.000027057335,0.0000024005842,0.0000021274354,0.000004046053,0.0010759053,0.015966412,0.9793094,0.0004108305,0.0001109626],"about_ca_topic_score_codex":0.000030851672,"about_ca_topic_score_gemma":0.0000011601211,"teacher_disagreement_score":0.015134445,"about_ca_system_score_codex":0.000009264567,"about_ca_system_score_gemma":0.00003711845,"threshold_uncertainty_score":0.39114115},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98866624,0.00036961344,0.0010798872,0.0007581966,0.005225235,0.00015360191,0.0000011777415,0.00020890943,0.0035371238],"genre_scores_gemma":[0.998878,0.000012208655,0.0008794132,0.00011455757,0.0000038329927,0.0000073369915,7.9452917e-7,0.000009649569,0.00009418185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986118,0.00009310629,0.0003283814,0.00029832995,0.00035118885,0.00031715704],"domain_scores_gemma":[0.9983045,0.00028162196,0.000189867,0.00079570356,0.00033679287,0.000091552065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075213483,0.00013033797,0.00016308183,0.00007494595,0.00044185726,0.00018105526,0.0010289836,0.00006497104,0.0000037878615],"category_scores_gemma":[0.00029917763,0.000092453134,0.00007845783,0.00062291726,0.00026194673,0.00019685557,0.0002994754,0.0001431671,0.000018285022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000643873,0.000044169086,0.00757005,0.0000044754815,0.000015383946,0.000001998158,0.00039094497,0.0000014778849,0.0006751711,0.98689765,0.0018069057,0.0025853543],"study_design_scores_gemma":[0.0004962832,0.00012499701,0.0034028082,0.000035308254,0.000004911999,0.0000033112165,0.00003092118,0.0038439638,0.0054882006,0.98563766,0.00080433243,0.0001273006],"about_ca_topic_score_codex":0.00014598599,"about_ca_topic_score_gemma":0.00001916501,"teacher_disagreement_score":0.0102117695,"about_ca_system_score_codex":0.000011909576,"about_ca_system_score_gemma":0.00005717698,"threshold_uncertainty_score":0.37701294},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99369055,0.0000804529,0.000043266107,0.00069288834,0.002572447,0.00019245762,0.0000038532667,0.00004883309,0.002675244],"genre_scores_gemma":[0.99845415,0.0000017902989,0.001302262,0.00018902913,0.0000012697756,0.0000034946083,6.686533e-7,0.000007317699,0.000040031948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987232,0.000116598116,0.00028601705,0.00030055412,0.00037055198,0.00020304328],"domain_scores_gemma":[0.9982576,0.000084220315,0.00020166876,0.00113026,0.00027142867,0.00005481741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003775696,0.00011967957,0.00019922918,0.00009323228,0.00013019539,0.000017639168,0.0008928348,0.00002857605,0.000007346293],"category_scores_gemma":[0.000067977395,0.00008386919,0.00009486462,0.000718543,0.00027475329,0.00008304975,0.00020800029,0.00010580823,0.000020800713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047822364,0.00009882965,0.001782336,0.0000110522615,0.000015136976,5.49699e-7,0.0003269983,0.000009737465,0.0066152383,0.9883119,0.0021714878,0.00065196207],"study_design_scores_gemma":[0.0005881019,0.00026165915,0.0046112323,0.00006389675,0.000007611695,0.0000031143386,0.0000041274957,0.00077716046,0.043325968,0.9500962,0.0001649067,0.00009603432],"about_ca_topic_score_codex":0.000098198856,"about_ca_topic_score_gemma":0.000007819009,"teacher_disagreement_score":0.0382157,"about_ca_system_score_codex":0.000009180272,"about_ca_system_score_gemma":0.000055685472,"threshold_uncertainty_score":0.34200865},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99681413,0.000551309,0.0000351739,0.00018654203,0.0015043013,0.00008717418,0.00000215442,0.000014065716,0.0008051414],"genre_scores_gemma":[0.9991903,0.00002994498,0.0007107751,0.000014168086,6.9617425e-7,0.0000019378879,1.4993556e-7,0.000004559,0.000047494315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988606,0.00009148578,0.00039965575,0.00014098988,0.00036022352,0.00014703479],"domain_scores_gemma":[0.9980379,0.00021128605,0.00036315448,0.0008901111,0.00046999878,0.000027564538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058747514,0.00008359578,0.00019883951,0.000062657804,0.000114218165,0.000011985406,0.0011549073,0.000046118144,0.0000022078816],"category_scores_gemma":[0.000104509374,0.0000472863,0.00012325398,0.0006587544,0.0007693275,0.000077811404,0.00029282592,0.00006690076,0.0000010918344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063711223,0.000084773535,0.010930741,0.000020808835,0.000028293993,7.5906826e-8,0.0004887048,0.000009348446,0.009204246,0.97800124,0.0007370492,0.0004883762],"study_design_scores_gemma":[0.0003469022,0.00025899982,0.013918428,0.00007626086,0.000012759255,0.0000010161139,0.000043537926,0.0011718632,0.14482509,0.83912575,0.00016198453,0.000057414254],"about_ca_topic_score_codex":0.00019789815,"about_ca_topic_score_gemma":0.00002089207,"teacher_disagreement_score":0.13887545,"about_ca_system_score_codex":0.000003818471,"about_ca_system_score_gemma":0.00007298763,"threshold_uncertainty_score":0.28346193},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9915629,0.00030803183,0.00085121527,0.00018618478,0.005769968,0.00016974712,0.000001412559,0.00023783356,0.0009127017],"genre_scores_gemma":[0.99171406,0.000004685795,0.00812762,0.00010008651,0.000010507418,0.0000024631415,0.0000024007275,0.000013953573,0.00002425057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822235,0.00008718443,0.0004154437,0.00051115063,0.00037304146,0.00039084043],"domain_scores_gemma":[0.99844533,0.00008417375,0.00020292119,0.00073464913,0.0004148025,0.00011811993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065261865,0.00017765093,0.00028101954,0.00017373051,0.00023386352,0.00007307731,0.0006336399,0.000060778388,0.0000063574953],"category_scores_gemma":[0.00010721151,0.00016951845,0.00010027338,0.0008395243,0.00019278818,0.00020165053,0.00035314605,0.00016039566,0.000049674945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067198957,0.00014459887,0.0038204382,0.000023571738,0.000033000175,0.0000067377873,0.0006535221,0.000026491904,0.021691242,0.96817964,0.0011021902,0.004311872],"study_design_scores_gemma":[0.0013814833,0.00046656965,0.0043167653,0.00013956623,0.000021877713,0.000055108594,0.000028061488,0.014915949,0.050589383,0.9274887,0.00015262651,0.00044394447],"about_ca_topic_score_codex":0.00008246908,"about_ca_topic_score_gemma":0.0000014559158,"teacher_disagreement_score":0.04069095,"about_ca_system_score_codex":0.000017506982,"about_ca_system_score_gemma":0.000092545044,"threshold_uncertainty_score":0.69127613},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9701425,0.00002794798,0.015960677,0.0002867494,0.006859067,0.00017117779,4.227366e-7,0.00023693319,0.006314554],"genre_scores_gemma":[0.94744784,0.000005383522,0.052274194,0.00018506055,0.00001189681,0.000016929209,6.184279e-7,0.000008346591,0.000049759856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886954,0.0001323563,0.00022701947,0.00033215372,0.00019162537,0.00024731137],"domain_scores_gemma":[0.99902505,0.000049744314,0.00007873822,0.0006524871,0.00012702047,0.00006698367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005304093,0.00010512671,0.00011705797,0.00020617817,0.00012796203,0.00006186634,0.0005710945,0.000075738804,0.000010563472],"category_scores_gemma":[0.00015185148,0.00010898674,0.000043623597,0.00084048795,0.000090556285,0.0005039245,0.00017240275,0.00015563589,0.00016765181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005922863,0.00008164594,0.0009458339,0.0000026549646,0.0000037481996,0.0000038456724,0.00055561325,0.000006062546,0.0017039989,0.9915654,0.0007722915,0.0043529933],"study_design_scores_gemma":[0.0005744223,0.00026741653,0.041245352,0.000030054985,0.0000037070147,0.000027347824,0.000045827426,0.03858133,0.015575237,0.9013301,0.0020875863,0.00023162203],"about_ca_topic_score_codex":0.00007695545,"about_ca_topic_score_gemma":0.000021532198,"teacher_disagreement_score":0.09023529,"about_ca_system_score_codex":0.00008055604,"about_ca_system_score_gemma":0.000030156481,"threshold_uncertainty_score":0.444435},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9934915,0.00006785095,0.000059480324,0.00032619198,0.0018040049,0.0001208804,6.490153e-7,0.000091530026,0.004037926],"genre_scores_gemma":[0.99871755,0.000005773749,0.0009420307,0.00023939669,0.0000011520974,0.000008251086,6.857824e-7,0.0000094802,0.00007571103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986709,0.000090766625,0.00030672678,0.0003543,0.00027167096,0.00030567145],"domain_scores_gemma":[0.9989163,0.00015618009,0.00011310762,0.0005963534,0.00013234602,0.00008569691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004843583,0.00013403328,0.00020889739,0.00029026365,0.000085938096,0.000036133388,0.00062718935,0.000086745604,0.000009152889],"category_scores_gemma":[0.00008434629,0.00012796833,0.00006077353,0.00085789384,0.00012237739,0.0001448886,0.00017323719,0.00015919014,0.00006185544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000111834315,0.0001638756,0.0031403664,0.000009190561,0.0000073694578,0.000007680207,0.00037501552,0.000025711433,0.0014727773,0.9926376,0.0015041472,0.000645086],"study_design_scores_gemma":[0.00097329245,0.00043394224,0.0036122396,0.000081795544,0.000002540896,0.0000020175505,0.000013097357,0.0040032677,0.012544582,0.97800213,0.00018090331,0.00015020145],"about_ca_topic_score_codex":0.00010362419,"about_ca_topic_score_gemma":0.000020700703,"teacher_disagreement_score":0.014635476,"about_ca_system_score_codex":0.000029904648,"about_ca_system_score_gemma":0.000049848844,"threshold_uncertainty_score":0.5218397},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9806069,0.00004606624,0.006970962,0.0010452475,0.00050630205,0.00049300445,0.0000036852202,0.00014433835,0.010183497],"genre_scores_gemma":[0.99680847,0.0000067755104,0.0028755853,0.00016381612,0.000008560187,0.000041195755,5.3680645e-7,0.000020167883,0.00007486599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982569,0.000117599324,0.00019389647,0.00041699773,0.0005951538,0.0004194236],"domain_scores_gemma":[0.99791175,0.00045836842,0.00013685305,0.0011570222,0.0002302219,0.00010579395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006014271,0.00018990696,0.00023378688,0.00015761079,0.00027752187,0.00006483237,0.0017079124,0.00005947274,0.0000106626185],"category_scores_gemma":[0.00010132679,0.00012001497,0.00006003277,0.0009311852,0.0006932532,0.00027657274,0.00022204136,0.0002782832,0.000059409726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013528005,0.00008159167,0.007046685,0.0000070436654,0.000030022244,0.000006921963,0.00035855273,0.000002151836,0.00061275304,0.99022317,0.00024637618,0.001249436],"study_design_scores_gemma":[0.0006927524,0.0012076471,0.011809723,0.00006481456,0.0000060052957,0.0000069822977,0.000027306533,0.00047119922,0.0146280425,0.96998525,0.00092299364,0.00017729492],"about_ca_topic_score_codex":0.00003250454,"about_ca_topic_score_gemma":0.000053808915,"teacher_disagreement_score":0.020237947,"about_ca_system_score_codex":0.000035266406,"about_ca_system_score_gemma":0.00008501949,"threshold_uncertainty_score":0.48940685},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954335,0.00009485486,0.002938689,0.00008285315,0.0005817455,0.00041962965,0.000008397309,0.00006574198,0.00037458402],"genre_scores_gemma":[0.986172,0.00000479047,0.013453659,0.000055657925,0.00007094074,0.000038150123,0.0000091606535,0.000033777436,0.00016186645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913853,0.000018346902,0.00024109424,0.00019285096,0.0001893938,0.00021979286],"domain_scores_gemma":[0.99899364,0.00024165268,0.00017301303,0.0003080635,0.00023154187,0.000052116233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019101369,0.00013630233,0.00024602158,0.00007736604,0.0000929545,0.000013272159,0.0001334201,0.000059645135,0.00003526157],"category_scores_gemma":[0.00022969459,0.00011318517,0.000059167687,0.00021190758,0.00007623706,0.00023856216,0.00002869645,0.000069250484,0.000013439428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009185818,0.000118034135,0.0003529961,0.00007957749,0.00004898209,0.0000011721847,0.00038499592,0.0000010656737,0.0024883905,0.9944939,0.00056852284,0.0013704743],"study_design_scores_gemma":[0.0015640281,0.00062271353,0.00009567678,0.000050907838,0.0000429804,0.0000035376324,0.000072256116,0.00046280498,0.057197366,0.93932986,0.000411864,0.0001460022],"about_ca_topic_score_codex":0.0000017700045,"about_ca_topic_score_gemma":0.0000054798793,"teacher_disagreement_score":0.055164065,"about_ca_system_score_codex":0.000032597934,"about_ca_system_score_gemma":0.000034359553,"threshold_uncertainty_score":0.46155572},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9970016,0.000014116198,0.0000091332495,0.00032722906,0.00008826971,0.0002082667,0.0000081324415,0.000008496683,0.0023347957],"genre_scores_gemma":[0.9997703,0.000002041174,0.00008371971,0.000033286327,0.0000022511608,0.000030313939,4.5483756e-7,0.0000073766537,0.000070247675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944925,0.00009350038,0.00015740225,0.00008543699,0.00012829012,0.00008612377],"domain_scores_gemma":[0.99849623,0.00087535894,0.0001340174,0.00043926545,0.00004367787,0.000011432423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021162265,0.000068157475,0.00012175811,0.00002141097,0.000051055602,0.000005257752,0.00029571133,0.000024404228,0.00002284665],"category_scores_gemma":[0.0001380083,0.00003272516,0.00004079249,0.00022269003,0.00031537577,0.000023033077,0.00002820104,0.00006643773,0.0000020074815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030206265,0.00017332689,0.004340297,0.000012952559,0.000017126438,8.700856e-8,0.0008639581,4.5020704e-7,0.0007447088,0.9931269,0.0006520192,0.000037925925],"study_design_scores_gemma":[0.00024276045,0.00012867423,0.008828814,0.00007453954,0.000014475445,1.8540742e-7,0.000295465,0.0000077288905,0.02537304,0.9648246,0.00016729337,0.000042399326],"about_ca_topic_score_codex":0.000018528697,"about_ca_topic_score_gemma":0.00022372654,"teacher_disagreement_score":0.028302317,"about_ca_system_score_codex":0.000006462579,"about_ca_system_score_gemma":0.000011266375,"threshold_uncertainty_score":0.13344932},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84381264,0.00020952855,0.111280195,0.0012269246,0.0062203975,0.0006070366,0.000025720228,0.0009499857,0.035667557],"genre_scores_gemma":[0.9907175,0.000008410191,0.007939161,0.0002984756,0.000018367497,0.000015314567,0.000023662149,0.000010791099,0.0009683596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886465,0.000030152803,0.00013476484,0.00039166518,0.00029436572,0.000284405],"domain_scores_gemma":[0.99908817,0.000034950197,0.000085459615,0.00061748875,0.0000981762,0.000075759366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019191002,0.00013366662,0.00011840372,0.00007345107,0.00027644797,0.00020248906,0.00073294877,0.000023796123,0.000029545798],"category_scores_gemma":[0.000010938637,0.00011516004,0.000027750282,0.00053850136,0.000116438154,0.00087484723,0.0003440111,0.00007274952,0.00025058084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007882225,0.000045968667,0.0014954585,0.00000632157,0.000019067405,0.000020747393,0.00013562209,0.0000013096568,0.00012669819,0.99025375,0.00539375,0.0024934052],"study_design_scores_gemma":[0.0032972058,0.00065324,0.0038691252,0.000106477106,0.00003057074,0.000018811765,0.000039919003,0.015519816,0.004695561,0.9233748,0.047716085,0.0006784345],"about_ca_topic_score_codex":0.000016743084,"about_ca_topic_score_gemma":0.000026135725,"teacher_disagreement_score":0.14690481,"about_ca_system_score_codex":0.000045537443,"about_ca_system_score_gemma":0.000016486472,"threshold_uncertainty_score":0.469609},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76742,0.000092758535,0.22974844,0.00029390716,0.0014043493,0.00042105233,0.000006839314,0.00037781172,0.00023483786],"genre_scores_gemma":[0.97919935,0.0000051561296,0.020371398,0.00016131332,0.000037783033,0.00013649084,0.000013759478,0.000020707552,0.000054017677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868345,0.000031851738,0.00018514442,0.0005032129,0.0002234206,0.00037291448],"domain_scores_gemma":[0.99865913,0.00007281329,0.000094404284,0.0009267025,0.00007671746,0.00017022195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028272686,0.00015869594,0.00015524279,0.000079401434,0.00047976014,0.0003674085,0.0009948681,0.00006461165,0.000012583211],"category_scores_gemma":[0.000016553557,0.00016640635,0.00007410016,0.0002827673,0.000063997526,0.00062880846,0.0002004672,0.00007796401,0.00004633009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005693986,0.00014364962,0.0002502305,0.000011989072,0.000015468244,0.0000029489038,0.0005290207,0.0000015707661,0.031577077,0.9602614,0.0008505564,0.006350368],"study_design_scores_gemma":[0.0016392826,0.0006366947,0.0068463353,0.00005139329,0.000024911275,0.000023414606,0.00009958741,0.08311568,0.07957922,0.7867751,0.040580418,0.0006279595],"about_ca_topic_score_codex":0.000044610995,"about_ca_topic_score_gemma":0.000010962355,"teacher_disagreement_score":0.21177937,"about_ca_system_score_codex":0.00007059674,"about_ca_system_score_gemma":0.000045717214,"threshold_uncertainty_score":0.6785854},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9918948,0.0000691127,0.00000926933,0.000029963418,0.00096655113,0.00012914289,0.000022200296,0.00007843842,0.006800526],"genre_scores_gemma":[0.99984896,0.000015303527,0.00000441907,0.000043784155,0.000011368226,0.000011973887,0.000011929094,0.000019402045,0.000032832595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945486,0.000070909926,0.00014935863,0.00009327565,0.00009256366,0.00013906317],"domain_scores_gemma":[0.9994903,0.00012005389,0.00003210409,0.00026137245,0.000049831353,0.00004633735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017911148,0.00010795793,0.0001232572,0.000077618104,0.00012348447,0.000015272375,0.0001386676,0.000042512336,0.000047800466],"category_scores_gemma":[0.000020289077,0.00008617881,0.00003004612,0.00025142005,0.00014968283,0.000062073756,0.000016561184,0.000105411935,0.000027211154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010313785,0.000023532668,0.002897528,0.000018695742,0.000047753252,0.000001941808,0.000547424,0.000010677509,0.0039264397,0.9918696,0.0004289422,0.00021714786],"study_design_scores_gemma":[0.0015900871,0.00049969024,0.04963028,0.00017026423,0.00006880916,0.00002746227,0.00058870617,0.0020064095,0.04357275,0.89541835,0.005885613,0.0005416074],"about_ca_topic_score_codex":0.000018510314,"about_ca_topic_score_gemma":0.0000046558694,"teacher_disagreement_score":0.09645128,"about_ca_system_score_codex":0.000006240075,"about_ca_system_score_gemma":0.000007163931,"threshold_uncertainty_score":0.35142696},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99616367,0.00026534253,0.00047159556,0.0003019839,0.0012297673,0.00012739995,0.000001057131,0.00018003711,0.0012591329],"genre_scores_gemma":[0.9873811,0.000009481679,0.012202342,0.00027707632,0.0000014200318,0.0000089693485,8.1348736e-7,0.000013670011,0.000105122446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863946,0.00004480337,0.0002760158,0.00038176868,0.0003529706,0.0003049549],"domain_scores_gemma":[0.9985599,0.000057388643,0.00015178649,0.0007396511,0.00036928852,0.00012197791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030769123,0.00015741846,0.00022006013,0.00014264112,0.00014091011,0.00006952747,0.00071224716,0.0000648117,0.000019703786],"category_scores_gemma":[0.000034311928,0.00012568694,0.000052599546,0.0008773702,0.00023652901,0.00030779876,0.00018002378,0.00010262466,0.000073168725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021815755,0.00011976596,0.0025150047,0.000019138412,0.000032277763,0.000007479889,0.00055648584,0.000001375986,0.009243526,0.98525715,0.0008534378,0.0013725386],"study_design_scores_gemma":[0.00160551,0.00095207966,0.0019701764,0.0001204633,0.000026200318,0.000014684947,0.000022344257,0.0012743314,0.0478258,0.94523,0.000678172,0.00028024384],"about_ca_topic_score_codex":0.00009076257,"about_ca_topic_score_gemma":0.000007666584,"teacher_disagreement_score":0.040027156,"about_ca_system_score_codex":0.000011090198,"about_ca_system_score_gemma":0.00006677436,"threshold_uncertainty_score":0.51253647},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98751634,0.000057815745,0.0017355108,0.0010786675,0.005919342,0.00015898207,0.000002949286,0.0006549412,0.0028754417],"genre_scores_gemma":[0.99443597,0.0000063453663,0.0039827987,0.0014421052,0.000010683511,0.000008551837,0.000010883567,0.00001557717,0.00008711278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810153,0.00012675526,0.00027114013,0.0006434191,0.0005169003,0.0003402428],"domain_scores_gemma":[0.99808705,0.00010159987,0.00011661437,0.001094775,0.0003916012,0.00020836678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048404883,0.0001831774,0.00016157134,0.00022715502,0.00041838243,0.00014221027,0.0006593145,0.000119467564,0.000028881726],"category_scores_gemma":[0.00007970049,0.00016490076,0.000062274245,0.00067897525,0.00012418281,0.00046573835,0.00010288471,0.00022226005,0.00046436707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030392419,0.00026888473,0.00016890478,0.0000018723572,0.000011146816,0.00001120791,0.00013100244,0.000037861337,0.0083983075,0.977148,0.011887191,0.0019052508],"study_design_scores_gemma":[0.0008874524,0.0010211394,0.0034784474,0.00003152088,0.000005321549,0.000010855423,0.000010133849,0.012648296,0.006468571,0.97262263,0.002559966,0.00025567645],"about_ca_topic_score_codex":0.000061858475,"about_ca_topic_score_gemma":0.000003462451,"teacher_disagreement_score":0.012610435,"about_ca_system_score_codex":0.000026517457,"about_ca_system_score_gemma":0.00005500041,"threshold_uncertainty_score":0.6724458},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98345405,0.000007827706,0.00018990478,0.00032803413,0.00029336062,0.0004082268,0.000004755062,0.00019250126,0.015121367],"genre_scores_gemma":[0.99679893,0.0000017370742,0.0024117613,0.00012178531,0.000020928825,0.00008979413,0.0000025505396,0.00004085669,0.00051166036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988524,0.00005330533,0.0002066819,0.000316114,0.0002142945,0.0003572395],"domain_scores_gemma":[0.99898446,0.00013129275,0.00007593542,0.0005656231,0.00008458573,0.00015813598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025438773,0.00018477421,0.00020943553,0.00013872568,0.00028142886,0.000053039726,0.00032084325,0.000056499346,0.00010570613],"category_scores_gemma":[0.00005708024,0.00016365947,0.00005420778,0.0007102972,0.00012051632,0.00009127883,0.00006359738,0.00013803355,0.00018149713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057020578,0.00015728278,0.0011442768,0.000012402116,0.000043253644,0.000005265275,0.00073466584,5.616683e-7,0.0023989002,0.99344975,0.0018715806,0.00012501575],"study_design_scores_gemma":[0.00056267134,0.0003133536,0.0013487082,0.00004216956,0.000028480774,0.000007321932,0.00018650308,0.0000054422585,0.014501759,0.9798868,0.0028849796,0.00023181243],"about_ca_topic_score_codex":0.000012935588,"about_ca_topic_score_gemma":0.000053665244,"teacher_disagreement_score":0.014609707,"about_ca_system_score_codex":0.000039532875,"about_ca_system_score_gemma":0.00002405917,"threshold_uncertainty_score":0.6673839},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98359174,0.000045233955,0.00044401208,0.00015578941,0.00040225932,0.0004738889,0.000017448081,0.000104459396,0.014765158],"genre_scores_gemma":[0.9975559,0.0000068258555,0.0020580206,0.00006642799,0.000007109759,0.000045501503,0.0000044545204,0.000029564377,0.00022616253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881154,0.00010500818,0.00033591577,0.000263168,0.00023238292,0.00025199246],"domain_scores_gemma":[0.99846625,0.0002933036,0.00018208854,0.0005920398,0.00037749717,0.00008879046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003879256,0.0001736838,0.00026879454,0.00009470222,0.00014045076,0.000012602467,0.00028733528,0.000097485485,0.00015983192],"category_scores_gemma":[0.00014386544,0.00016541146,0.00011899103,0.0005490565,0.00032135498,0.00008301436,0.00005516604,0.00015008525,0.000084772415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004432679,0.00048090197,0.0003481916,0.000026477053,0.000080796366,0.0000011456366,0.001974647,3.5810203e-8,0.009169054,0.98682237,0.00093307067,0.00011898315],"study_design_scores_gemma":[0.0006366803,0.00025741715,0.0014500008,0.00005021337,0.00006545339,0.0000039988727,0.00019169266,0.000008234744,0.06954415,0.92667633,0.0009474911,0.00016831698],"about_ca_topic_score_codex":0.000012930806,"about_ca_topic_score_gemma":0.0000037438042,"teacher_disagreement_score":0.0603751,"about_ca_system_score_codex":0.000018904324,"about_ca_system_score_gemma":0.000060052484,"threshold_uncertainty_score":0.67452836},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937085,0.00007248197,0.000027687836,0.00014814649,0.00023685148,0.00024883286,0.0000067854144,0.00011231686,0.005438435],"genre_scores_gemma":[0.9991681,0.000024291483,0.00017378831,0.00019311722,0.000011595167,0.000042364747,0.0000034963264,0.000025333547,0.00035788986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991172,0.000059894308,0.00018349756,0.00029382363,0.00013010077,0.00021547945],"domain_scores_gemma":[0.9990843,0.00029318844,0.00007873347,0.00036635122,0.00006655838,0.00011084603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022786132,0.00016408526,0.00019429986,0.0001143747,0.0002734492,0.000049003265,0.00012756526,0.00012217193,0.000047536458],"category_scores_gemma":[0.00007222844,0.00015055703,0.000032417254,0.0002891773,0.00027522302,0.00012988553,0.000044665612,0.00016848119,0.000018991033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040420236,0.00015364485,0.0060029323,0.000019442987,0.000030237734,0.0000018562698,0.00047939355,8.118191e-8,0.00040983883,0.9902466,0.0021905673,0.0004249632],"study_design_scores_gemma":[0.0009429376,0.00014250028,0.016446361,0.000033535183,0.000021952526,0.00000841195,0.00008099073,0.00015304245,0.0020140768,0.97811973,0.0018554163,0.00018106496],"about_ca_topic_score_codex":0.000012621809,"about_ca_topic_score_gemma":0.0000093830195,"teacher_disagreement_score":0.012126912,"about_ca_system_score_codex":0.000009208194,"about_ca_system_score_gemma":0.000013709003,"threshold_uncertainty_score":0.6139537},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946048,0.0001667153,0.0030292778,0.0004036848,0.00114352,0.00012628765,8.896104e-7,0.000027576367,0.0004972439],"genre_scores_gemma":[0.9957375,0.0000037843517,0.004134885,0.00003071064,0.000016561049,0.000003573714,0.0000013306733,0.0000043204914,0.000067350345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918246,0.000046723337,0.00017879615,0.00018248628,0.00027233118,0.00013719429],"domain_scores_gemma":[0.99897975,0.00008020795,0.00015162103,0.00035909654,0.00039666952,0.000032671804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002950115,0.000073429685,0.00010121156,0.00004966529,0.0002702506,0.000082753075,0.0003507117,0.000022107019,9.1975147e-7],"category_scores_gemma":[0.000047502028,0.000051282634,0.000025583211,0.00066794467,0.00026914733,0.00028197872,0.000063808664,0.000047575395,0.000002744156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011341184,0.000048213908,0.00097290927,0.000012212756,0.000017197175,8.966697e-7,0.0008102909,0.00003871543,0.0025811477,0.99075985,0.00041535878,0.0043318784],"study_design_scores_gemma":[0.0009233118,0.0008200294,0.02394431,0.00006854648,0.000015569107,0.00001548368,0.00007405793,0.0053770193,0.16693155,0.7995094,0.0020928993,0.00022782535],"about_ca_topic_score_codex":0.000023620554,"about_ca_topic_score_gemma":0.000005763776,"teacher_disagreement_score":0.19125044,"about_ca_system_score_codex":0.000011798604,"about_ca_system_score_gemma":0.00018080483,"threshold_uncertainty_score":0.2091245},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9929738,0.000036789243,0.00022894682,0.0017940142,0.00026351534,0.00044925287,0.0000058757882,0.000015970862,0.0042318297],"genre_scores_gemma":[0.99969184,0.0000034387,0.000031337815,0.000042133775,0.000052150608,0.000073422176,0.0000065433123,0.000007621933,0.000091479524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906325,0.00013684896,0.00025952418,0.00015615502,0.00020464632,0.00017958942],"domain_scores_gemma":[0.9983175,0.0008046845,0.00020261935,0.0005449003,0.00008401797,0.000046315876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000645114,0.000104499166,0.00014787636,0.000020429781,0.00090647885,0.00010911688,0.00040004004,0.000028559612,0.000021674177],"category_scores_gemma":[0.000020826694,0.000051071605,0.00006150105,0.00034890693,0.0009775509,0.00013885697,0.000086646396,0.000129538,0.00002777515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006741232,0.000037668407,0.010791064,0.0000030896645,0.000039696242,3.5421877e-8,0.000901514,0.0000048133284,0.00008458655,0.9812391,0.00064429274,0.0062474404],"study_design_scores_gemma":[0.0007892148,0.00010031705,0.06219939,0.000016118656,0.00008046798,6.2992456e-7,0.0011083396,0.009682247,0.00044719802,0.92379546,0.0016841949,0.00009642091],"about_ca_topic_score_codex":0.000120127654,"about_ca_topic_score_gemma":0.000016997628,"teacher_disagreement_score":0.057443596,"about_ca_system_score_codex":0.000009837285,"about_ca_system_score_gemma":0.000043324213,"threshold_uncertainty_score":0.6971994},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98505515,0.0000035395622,0.0000068163504,0.000559893,0.00009660426,0.00030778698,0.0000065491868,0.00005933503,0.013904318],"genre_scores_gemma":[0.99955726,0.0000032208193,0.00016122249,0.00012239833,0.0000045024917,0.000023019316,0.0000024112985,0.000018590752,0.000107381165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927974,0.000053989865,0.00019740705,0.00015179114,0.00016452758,0.00015253405],"domain_scores_gemma":[0.9986041,0.00051836466,0.00019657437,0.0005232751,0.00012041853,0.000037264617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031267214,0.00012114605,0.00015833232,0.000041422336,0.00024044569,0.000014165429,0.0003100469,0.00007107124,0.00013371943],"category_scores_gemma":[0.00008365665,0.000070770795,0.00005490995,0.00042549404,0.00026328088,0.00005243536,0.000038078946,0.00014179481,0.00007236668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058423197,0.00018886654,0.0012731251,0.000019166751,0.000057992132,7.640331e-7,0.0011924012,1.586873e-7,0.00007307043,0.9950274,0.0020817022,0.000026886166],"study_design_scores_gemma":[0.0004000839,0.0002523131,0.0011659331,0.00008555442,0.000029871677,0.0000037778716,0.00014525237,0.0000116409565,0.006949623,0.9900455,0.00081282115,0.00009762899],"about_ca_topic_score_codex":0.000020497777,"about_ca_topic_score_gemma":0.000035125206,"teacher_disagreement_score":0.014502096,"about_ca_system_score_codex":0.000013212619,"about_ca_system_score_gemma":0.000019110139,"threshold_uncertainty_score":0.2885949},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96667254,0.00026304784,0.0000057642055,0.000005739551,0.0023472935,0.000059870465,0.0000053811086,0.000112884656,0.030527502],"genre_scores_gemma":[0.99979633,0.00000686481,0.000013557279,0.000016847129,0.000014308369,0.0000049552877,0.0000016393745,0.000015542737,0.00012992774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995271,0.000019382183,0.00013234,0.00008514326,0.000102104415,0.00013392327],"domain_scores_gemma":[0.99962777,0.00006345834,0.000023849601,0.00022330969,0.000025883615,0.00003572565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110677705,0.00008342532,0.00012521759,0.000041480147,0.000028632981,0.0000061465485,0.00013477214,0.000051722418,0.00007163396],"category_scores_gemma":[0.000014195376,0.00008075465,0.000029258905,0.00013053369,0.00005408724,0.000041446943,0.000009617244,0.000068386646,0.00019289157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016443682,0.000027099157,0.0005573125,0.00003866235,0.000019302883,0.0000028046102,0.00023156738,0.00003135429,0.0020950974,0.9924292,0.0038095585,0.0007416032],"study_design_scores_gemma":[0.0013413044,0.0005312967,0.007914627,0.00024472296,0.000019366109,0.000007107209,0.00007101107,0.0014057887,0.109765306,0.8512044,0.027099714,0.00039533857],"about_ca_topic_score_codex":0.0000053327008,"about_ca_topic_score_gemma":0.0000021533335,"teacher_disagreement_score":0.14122477,"about_ca_system_score_codex":0.000010769709,"about_ca_system_score_gemma":0.0000037209948,"threshold_uncertainty_score":0.32930794},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98144394,0.00007640048,0.00018467063,0.001472284,0.0022160565,0.00009933959,4.4925892e-7,0.00009604043,0.014410823],"genre_scores_gemma":[0.9985086,0.0000028288832,0.0007578378,0.0005124432,0.0000020684217,0.0000031100167,1.7366347e-7,0.000004972655,0.00020801845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920744,0.000053546595,0.00014740715,0.00019020757,0.00022280392,0.0001786168],"domain_scores_gemma":[0.99902433,0.00014348309,0.000069140915,0.0006272333,0.00008813847,0.000047675454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032136278,0.00008142805,0.00009809763,0.000051368126,0.00012265623,0.000037724007,0.00064051175,0.00003118092,0.00002529766],"category_scores_gemma":[0.000057998106,0.000053395757,0.000050285715,0.00026921876,0.00014577195,0.00006993939,0.000099478275,0.00009288001,0.00013508736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033865222,0.00004657762,0.00008837204,0.0000013650674,0.000007888739,0.0000015163098,0.00019755078,0.0000013231191,0.0010836363,0.9873656,0.0108713675,0.00033143398],"study_design_scores_gemma":[0.0002573333,0.00029485364,0.00041805944,0.000016041246,0.0000024271953,0.000002653109,0.000004910859,0.0011188297,0.02974511,0.9675384,0.0005337435,0.000067630994],"about_ca_topic_score_codex":0.000022939037,"about_ca_topic_score_gemma":0.0000010625994,"teacher_disagreement_score":0.028661473,"about_ca_system_score_codex":0.000009604902,"about_ca_system_score_gemma":0.00003167384,"threshold_uncertainty_score":0.21774158},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97510403,0.00025054347,0.006685135,0.00094159273,0.0023765704,0.00034574477,0.0000022142192,0.00041710286,0.0138770435],"genre_scores_gemma":[0.9950185,0.000012865113,0.00456053,0.00013255734,0.00001451021,0.00002892398,0.0000011935186,0.000020046045,0.00021091421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766076,0.00022589097,0.0002967875,0.00060096075,0.0005205977,0.0006949942],"domain_scores_gemma":[0.99772865,0.00026089494,0.000084121275,0.0015965095,0.00016307952,0.00016677505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079995487,0.00020548707,0.00025760106,0.00045819161,0.00020282557,0.00013466494,0.0026391644,0.00009754216,0.000022676017],"category_scores_gemma":[0.00033823703,0.00020738904,0.000082365026,0.0017850354,0.00031472658,0.00078491995,0.0008873194,0.0003478519,0.0001487327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021529251,0.00014672818,0.00603056,0.0000041243,0.00001076306,0.000060161678,0.0006665477,0.000005338868,0.00094223383,0.98767495,0.0010100903,0.0034269544],"study_design_scores_gemma":[0.0012751258,0.00035206802,0.008832761,0.000032888394,0.0000016645782,0.000011686884,0.000052011997,0.0035042737,0.0030623185,0.98182327,0.0008115109,0.00024042642],"about_ca_topic_score_codex":0.000047855876,"about_ca_topic_score_gemma":0.000094746785,"teacher_disagreement_score":0.019914405,"about_ca_system_score_codex":0.000079398495,"about_ca_system_score_gemma":0.00007757212,"threshold_uncertainty_score":0.84570795},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9978393,0.0001020543,0.000050638406,0.00022295996,0.0002492118,0.0001925646,0.0000020747088,0.000025711484,0.0013155258],"genre_scores_gemma":[0.99934286,0.000018571289,0.00039600572,0.00002311371,0.000008052786,0.000031298685,5.115963e-7,0.000011443372,0.00016816247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994328,0.000051056362,0.00015128322,0.00013983187,0.000103128594,0.000121895486],"domain_scores_gemma":[0.9991216,0.00021430464,0.00007962516,0.0004560166,0.0000960488,0.00003241499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003695312,0.000075313554,0.000103521525,0.00003090616,0.00018618758,0.00001625885,0.00015982581,0.000029947001,0.000008663636],"category_scores_gemma":[0.0001486599,0.0000505681,0.000035624056,0.00018968298,0.00037127413,0.000048663853,0.000039667048,0.0000654339,0.000005218158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072297457,0.0000572209,0.00218464,0.00001020977,0.0000240731,1.181568e-7,0.00022237719,3.5407503e-8,0.0019050856,0.9938311,0.0009903243,0.0007676028],"study_design_scores_gemma":[0.0001871037,0.00004282165,0.0038220303,0.0000087204,0.000017195414,0.0000015161133,0.000037145364,0.000022258171,0.013856024,0.98015916,0.0017837393,0.00006226074],"about_ca_topic_score_codex":0.000004847048,"about_ca_topic_score_gemma":0.0000035882204,"teacher_disagreement_score":0.013671898,"about_ca_system_score_codex":0.00000340961,"about_ca_system_score_gemma":0.000008397183,"threshold_uncertainty_score":0.20621072},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99674076,0.00084291014,0.00066937174,0.00030024874,0.0008149322,0.00027914857,0.000003349872,0.00004968701,0.00029960054],"genre_scores_gemma":[0.99558616,0.000034074215,0.0042773415,0.00004741716,0.0000013191574,0.00000941003,6.5403054e-7,0.000012624427,0.00003097675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819595,0.00013299032,0.00045554742,0.00040650708,0.00055032864,0.00025868622],"domain_scores_gemma":[0.9975262,0.00003693041,0.00049092545,0.0014865254,0.00040080657,0.000058564336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004628477,0.00017709074,0.00036404215,0.00021855942,0.00010252417,0.000015844666,0.0010701531,0.00004787737,0.0000017728082],"category_scores_gemma":[0.000030273864,0.00011505091,0.00017135603,0.0026359125,0.00090478454,0.0001397364,0.00017820837,0.000108492044,6.765175e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040989707,0.00018583352,0.01264734,0.000048337664,0.00006417114,9.0422634e-7,0.00033250448,0.000011180893,0.030778928,0.95542675,0.00033368633,0.00012937139],"study_design_scores_gemma":[0.00094147195,0.00043740403,0.014797177,0.00015113501,0.000025425867,0.000003944176,0.000013217705,0.00018158503,0.1581243,0.82512206,0.0000691881,0.00013307383],"about_ca_topic_score_codex":0.00019086595,"about_ca_topic_score_gemma":0.000022046524,"teacher_disagreement_score":0.13030466,"about_ca_system_score_codex":0.000006004982,"about_ca_system_score_gemma":0.00008402835,"threshold_uncertainty_score":0.469164},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928469,0.0005477902,0.0009064858,0.0009219237,0.0026289974,0.00014412658,7.614153e-7,0.00029754557,0.0017054867],"genre_scores_gemma":[0.9942555,0.000019767838,0.0050354577,0.00047646163,0.0000024077626,0.000014689801,0.0000014231298,0.000013153063,0.00018117702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983368,0.00007938346,0.0003215158,0.00051603036,0.0003110316,0.000435241],"domain_scores_gemma":[0.9987134,0.000054715343,0.000096504955,0.0008316177,0.00017576023,0.00012799831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005881996,0.00016661403,0.00019828194,0.00020252909,0.00015541256,0.00012002003,0.00077002577,0.000063359585,0.00000958626],"category_scores_gemma":[0.00006262511,0.00016104835,0.000057446134,0.0013516431,0.00017111134,0.00037070154,0.00021067263,0.0001634576,0.00017949127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051276616,0.00008041526,0.006002153,0.0000049692544,0.000005975557,0.000013724889,0.0003228184,0.0000071058357,0.0015406868,0.9893161,0.0017018559,0.0009990354],"study_design_scores_gemma":[0.001027381,0.00010953676,0.0011792649,0.000060651793,0.0000030737922,0.0000045043125,0.000007498825,0.0049752994,0.0047420515,0.9847111,0.0029618572,0.00021777581],"about_ca_topic_score_codex":0.00012935247,"about_ca_topic_score_gemma":0.000046847188,"teacher_disagreement_score":0.004968194,"about_ca_system_score_codex":0.00002923524,"about_ca_system_score_gemma":0.00004366267,"threshold_uncertainty_score":0.6567361},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99069035,0.000051908362,0.00016680626,0.00042720052,0.00058794755,0.0003433047,0.000011324671,0.0001602242,0.007560922],"genre_scores_gemma":[0.9988705,0.000006893258,0.00023278147,0.00015551418,0.000017788978,0.0000950855,0.0000072136945,0.000031858806,0.0005823935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989854,0.00008216973,0.00023707596,0.00023320758,0.00016936018,0.00029276247],"domain_scores_gemma":[0.99870867,0.0003391339,0.00010980587,0.00063452026,0.00012906108,0.00007879461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039337805,0.0001607313,0.00016610484,0.000040530103,0.00053112424,0.000052744363,0.00039822192,0.000072908835,0.00017207165],"category_scores_gemma":[0.00015155014,0.00012276843,0.000080053964,0.0004809157,0.00027400538,0.000079306024,0.000078199075,0.00016722461,0.00024774246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009241009,0.00011129215,0.00039150944,0.00000926818,0.000039598446,4.83514e-7,0.0005036471,1.4832999e-7,0.0050267223,0.96563375,0.028060297,0.00021401588],"study_design_scores_gemma":[0.0004215402,0.000060194394,0.00033360513,0.000018482033,0.000036946225,0.0000048513434,0.00018302293,0.00011790579,0.013166675,0.9759294,0.009565361,0.00016202586],"about_ca_topic_score_codex":0.00001908263,"about_ca_topic_score_gemma":0.000012105149,"teacher_disagreement_score":0.018494936,"about_ca_system_score_codex":0.000014915038,"about_ca_system_score_gemma":0.000019942645,"threshold_uncertainty_score":0.5006351},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9529224,0.000018696535,0.014029257,0.0014026244,0.0019656867,0.00027983673,8.438623e-7,0.000072192335,0.02930848],"genre_scores_gemma":[0.9957754,0.000001591837,0.0018675886,0.000083521336,0.000021522521,0.000009865883,3.4393534e-7,0.000009373302,0.0022307655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879754,0.0001224068,0.00015482942,0.00025174418,0.00043033407,0.00024312586],"domain_scores_gemma":[0.99858254,0.00036093913,0.00007846578,0.0007270897,0.00017302172,0.00007796236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044369686,0.00010341066,0.000116838986,0.000060826962,0.00013799888,0.00007087985,0.0008088671,0.000045469034,0.00012417487],"category_scores_gemma":[0.00017025988,0.000074698095,0.00006409777,0.00060244475,0.00017742395,0.0002826515,0.00021842688,0.00014204446,0.0002826721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003819549,0.00006914144,0.00011365365,0.0000017915063,0.000011354014,0.0000028936645,0.00036587237,0.0000011657892,0.0008062717,0.9880754,0.0025781407,0.00793617],"study_design_scores_gemma":[0.00054119516,0.00031201146,0.0019083588,0.000018271325,0.0000022694976,0.000008036605,0.000016394832,0.0011278836,0.010750233,0.9844219,0.0007992512,0.00009416561],"about_ca_topic_score_codex":0.000015163584,"about_ca_topic_score_gemma":0.0000030420872,"teacher_disagreement_score":0.042853046,"about_ca_system_score_codex":0.00004185613,"about_ca_system_score_gemma":0.000085847845,"threshold_uncertainty_score":0.3633272},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.987568,0.0002225113,0.008721953,0.00082853046,0.0011900357,0.00028529132,0.0000018195548,0.0002676448,0.00091417774],"genre_scores_gemma":[0.99720615,0.00004224241,0.0022956596,0.00019069023,0.000014935019,0.0000073415313,0.0000015906194,0.000012645091,0.00022873493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987159,0.000065474844,0.00018085289,0.00040002025,0.00028348266,0.00035431044],"domain_scores_gemma":[0.9988369,0.000077468365,0.00003219336,0.0006939753,0.00020428434,0.00015522848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003102181,0.00013841978,0.00014138955,0.00020600516,0.00048346972,0.00017608024,0.0007416068,0.00007834855,0.000017073138],"category_scores_gemma":[0.00008224442,0.00012385118,0.000032488166,0.00076140394,0.0002677161,0.0011234507,0.00045703782,0.0001823068,0.00009549624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010825179,0.000039192466,0.0009835366,0.000005027062,0.000013710587,0.000007303324,0.00042149716,0.00002076312,0.0003478026,0.99676096,0.00020477787,0.0011845973],"study_design_scores_gemma":[0.00072525756,0.00022052579,0.004538652,0.000015613045,0.0000019626152,0.0000132869945,0.000016024926,0.020717453,0.002140252,0.9705222,0.0009061663,0.00018259892],"about_ca_topic_score_codex":0.0000318366,"about_ca_topic_score_gemma":0.000027944427,"teacher_disagreement_score":0.02623876,"about_ca_system_score_codex":0.00003992893,"about_ca_system_score_gemma":0.000044548422,"threshold_uncertainty_score":0.5050504},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98485583,0.00007245651,0.00003404727,0.000037468682,0.0018044583,0.00017603065,0.0000028636346,0.00008293947,0.012933889],"genre_scores_gemma":[0.99977326,0.000008238073,0.00001971076,0.000009968247,0.000012716452,0.000023454057,3.7548708e-7,0.00002368971,0.00012855776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921775,0.00008832485,0.00017640153,0.00010042224,0.00020235886,0.00021472297],"domain_scores_gemma":[0.99915385,0.000119380624,0.00006197474,0.000560854,0.000065823,0.000038095503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027357883,0.00012960653,0.00013679353,0.000016097778,0.00021715766,0.000029027913,0.0004624846,0.0000499526,0.000008151616],"category_scores_gemma":[0.000017291264,0.00006832308,0.000064837266,0.0003402746,0.00030596546,0.00007099409,0.00003439876,0.00012283654,0.000030067753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018435214,0.000019962616,0.036406312,0.00008014571,0.00013562501,0.000003528698,0.000934491,0.000058168796,0.0016907268,0.95911187,0.0007833898,0.00075733877],"study_design_scores_gemma":[0.0008110818,0.00011688874,0.04306362,0.00035689573,0.0000639431,0.00008532319,0.00087854866,0.00091467483,0.014837296,0.93698967,0.0015166437,0.00036540077],"about_ca_topic_score_codex":0.000033567576,"about_ca_topic_score_gemma":0.00008698816,"teacher_disagreement_score":0.02212219,"about_ca_system_score_codex":0.000017255239,"about_ca_system_score_gemma":0.000014589749,"threshold_uncertainty_score":0.27861345},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906334,0.0014674121,0.0000012822785,0.00003089781,0.0032656942,0.000095743635,0.0000011237403,0.00010314184,0.0044012726],"genre_scores_gemma":[0.9997158,0.000015901986,0.0000058309424,0.000014759252,0.000021754176,0.000014639052,5.819447e-7,0.00001679506,0.0001939039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994032,0.000042849748,0.00017917361,0.00007870836,0.00013114625,0.00016495529],"domain_scores_gemma":[0.99957544,0.00004338343,0.000026505744,0.00025523605,0.000056480992,0.00004295199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020285067,0.00008998082,0.000112447386,0.000025241938,0.00013348364,0.000013165948,0.00017267796,0.00004541216,0.000016634902],"category_scores_gemma":[0.000026646107,0.000059535498,0.00004661612,0.000121874444,0.00015788978,0.00005901738,0.000027742039,0.00007784205,0.000080162274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047678917,0.0000511903,0.0011365304,0.000095859665,0.00014726966,0.0000026299103,0.0008478699,0.00006762241,0.0937781,0.8935676,0.008803233,0.0014543748],"study_design_scores_gemma":[0.0009797649,0.00026415478,0.0038851954,0.0002914782,0.00003609282,0.000022048187,0.00036597476,0.0037075707,0.4146424,0.54461694,0.03073268,0.00045568586],"about_ca_topic_score_codex":0.000007029331,"about_ca_topic_score_gemma":0.0000030747951,"teacher_disagreement_score":0.34895068,"about_ca_system_score_codex":0.000011134831,"about_ca_system_score_gemma":0.000011921722,"threshold_uncertainty_score":0.24277872},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99506974,0.000019224823,0.0000085171205,0.000092956,0.00026023533,0.00012305491,0.000006703013,0.00003582996,0.0043837153],"genre_scores_gemma":[0.9995522,0.0000043510017,0.00027542686,0.000027865526,0.000016952145,0.000004271924,0.0000020184773,0.000009720363,0.00010721294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994482,0.00003559909,0.00015230685,0.00013426617,0.00010320935,0.00012641729],"domain_scores_gemma":[0.99934906,0.00023551575,0.00009460977,0.00023879636,0.000030751627,0.000051261926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017427857,0.00008226349,0.00013524084,0.000046522975,0.00008907696,0.000011082427,0.00011428566,0.000048943235,0.000071416995],"category_scores_gemma":[0.00008054052,0.00007288061,0.000033359287,0.0001259948,0.00020502273,0.0000417063,0.000027233702,0.00007366917,0.00003435122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023090593,0.00014320933,0.00081682333,0.000010499349,0.000019414361,7.258416e-7,0.0005786475,4.4728594e-8,0.00075038127,0.9959608,0.001523689,0.00017272048],"study_design_scores_gemma":[0.00043117403,0.00021961213,0.0026797105,0.000018173072,0.00002263954,0.0000022255624,0.00005990065,0.000016781121,0.021783933,0.97429883,0.00039113703,0.00007586387],"about_ca_topic_score_codex":0.0000057838442,"about_ca_topic_score_gemma":0.00000465713,"teacher_disagreement_score":0.021661904,"about_ca_system_score_codex":0.0000066154143,"about_ca_system_score_gemma":0.0000111037025,"threshold_uncertainty_score":0.2971985},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9884588,0.0004498839,0.0045412066,0.00029656925,0.0032916337,0.00037512,0.000006856612,0.00011892388,0.002460988],"genre_scores_gemma":[0.99139905,0.00000959849,0.008369834,0.00002283166,0.00002236179,0.000011814493,0.0000011716139,0.000011191131,0.00015212271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838525,0.000101736536,0.00037394403,0.00050908927,0.00034070504,0.00028927362],"domain_scores_gemma":[0.9980464,0.000059215585,0.00023886838,0.0011245387,0.00045556668,0.00007544126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000589455,0.00016574416,0.00030010377,0.00012519486,0.00009789399,0.000020931906,0.0011079493,0.000038629394,0.000009251986],"category_scores_gemma":[0.00018557908,0.0001436773,0.000099855126,0.0010501241,0.00047002902,0.00033228428,0.00019288837,0.00012519705,0.00001525511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030452085,0.00023309316,0.0036649893,0.00004557062,0.00002756347,0.0000034359882,0.00046704643,6.598248e-7,0.0037639788,0.97043765,0.00054279465,0.020782763],"study_design_scores_gemma":[0.00047277712,0.00052542315,0.01122091,0.000063282285,0.000010881575,0.000009430389,0.000016276554,0.00023242147,0.18152164,0.8047258,0.0009997478,0.00020140928],"about_ca_topic_score_codex":0.000010870573,"about_ca_topic_score_gemma":0.0000021445012,"teacher_disagreement_score":0.17775765,"about_ca_system_score_codex":0.0000123405525,"about_ca_system_score_gemma":0.00006543903,"threshold_uncertainty_score":0.58589906},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98954314,0.00006538832,0.00017020904,0.00023251091,0.002792334,0.00008081593,7.088136e-7,0.00013899969,0.006975876],"genre_scores_gemma":[0.9974358,0.000005795205,0.0022181175,0.00021243423,0.000001344212,0.0000045807037,6.2211785e-7,0.000007714651,0.00011355635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896467,0.00004193349,0.00022035533,0.00028590742,0.00026760582,0.00021950234],"domain_scores_gemma":[0.99891716,0.000103084305,0.000102258346,0.0006016521,0.00018979481,0.00008604014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031097358,0.00010835333,0.00016017325,0.00014051616,0.000121679965,0.00003990895,0.00053320563,0.000054226206,0.000017968528],"category_scores_gemma":[0.00006306701,0.00009984564,0.00005979905,0.0006089086,0.00013759402,0.00013715471,0.00015589963,0.00009563927,0.00009820884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069728803,0.00010172473,0.00059618277,0.0000059078807,0.000010302877,0.0000026756602,0.00016095434,0.0000032127855,0.002588011,0.99308884,0.0028571733,0.00057801197],"study_design_scores_gemma":[0.0005252805,0.0005075146,0.000757993,0.000045112407,0.0000035919547,0.0000022245883,0.0000050677204,0.0009912184,0.026933262,0.9697507,0.00036161777,0.00011643185],"about_ca_topic_score_codex":0.000046000285,"about_ca_topic_score_gemma":0.0000027506323,"teacher_disagreement_score":0.02434525,"about_ca_system_score_codex":0.000012521338,"about_ca_system_score_gemma":0.000029618832,"threshold_uncertainty_score":0.4071587},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9769001,0.000013620351,0.00016989016,0.000108819026,0.0003071003,0.00020310929,0.000005551609,0.00017479478,0.022117008],"genre_scores_gemma":[0.9974479,0.0000014156532,0.0019195469,0.000049943013,0.0000132354735,0.000051985786,0.000005466295,0.000026075344,0.00048440025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920446,0.000049113252,0.00016121531,0.00021258277,0.00015423226,0.00021838711],"domain_scores_gemma":[0.9990827,0.0001600569,0.0000784434,0.0004771448,0.000117443305,0.00008423249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022789817,0.00014243352,0.00015546095,0.000055321154,0.00023158606,0.000029018154,0.00024802666,0.00005360393,0.00015447063],"category_scores_gemma":[0.00007847614,0.00010735219,0.000058098693,0.00034938595,0.00031295491,0.0000719442,0.000041701172,0.00013052231,0.00014958496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022363776,0.00013785012,0.0027604797,0.000008989223,0.000029924575,0.0000019900333,0.00028588323,1.32456535e-8,0.000097998156,0.99303424,0.003287154,0.00033313019],"study_design_scores_gemma":[0.0004091943,0.00018179858,0.0018982734,0.000024928715,0.000038220176,0.000008561418,0.00009587454,0.0000108552,0.0024308695,0.9923534,0.0023916364,0.00015641833],"about_ca_topic_score_codex":0.000011785734,"about_ca_topic_score_gemma":0.000021430364,"teacher_disagreement_score":0.021632608,"about_ca_system_score_codex":0.000016682294,"about_ca_system_score_gemma":0.00002321405,"threshold_uncertainty_score":0.43776953},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91367346,0.00014155041,0.057809163,0.0007666782,0.0014037391,0.0005860609,0.000013573481,0.00024829415,0.02535749],"genre_scores_gemma":[0.9945299,0.000016053846,0.005221107,0.00010957936,0.0000075474745,0.000017495186,0.0000015898736,0.000015005867,0.00008174608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824226,0.00020964221,0.00024952483,0.0004393682,0.0004362958,0.00042289495],"domain_scores_gemma":[0.9981949,0.00027747537,0.00010472427,0.00072707847,0.0005561721,0.0001396574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048331646,0.00014737925,0.00026181617,0.00022897247,0.00013978568,0.00003305289,0.0010813233,0.00007906784,0.00002256267],"category_scores_gemma":[0.00009739541,0.00015797764,0.00010363696,0.0011014416,0.00065637333,0.00048736332,0.00023487567,0.00022247554,0.00006615044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004198108,0.00017067946,0.00023967751,0.000010389109,0.0000449834,0.000006179302,0.0012904482,6.206577e-7,0.010742756,0.9814058,0.00009526961,0.005951248],"study_design_scores_gemma":[0.0007253951,0.0005859309,0.004834593,0.00003369372,0.000006031117,0.000002840444,0.000055728455,0.00047090993,0.10418016,0.8887459,0.00020032276,0.00015846468],"about_ca_topic_score_codex":0.000012546007,"about_ca_topic_score_gemma":0.0000056579493,"teacher_disagreement_score":0.0934374,"about_ca_system_score_codex":0.000044081087,"about_ca_system_score_gemma":0.00009442773,"threshold_uncertainty_score":0.64421415},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9778398,0.00038237372,0.000007469196,0.000009980758,0.0029604617,0.00010965716,0.0000024534002,0.0002751252,0.018412655],"genre_scores_gemma":[0.9997139,0.0000352705,0.000022066559,0.000023150074,0.00001536588,0.000024203222,0.0000029355708,0.00002966578,0.00013345646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991595,0.00004280163,0.00021182247,0.00015998857,0.0001109466,0.000314931],"domain_scores_gemma":[0.9995638,0.000030983683,0.000020503174,0.00028765382,0.000027649026,0.00006938717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024193771,0.00014038922,0.00017341803,0.00015997382,0.000061651226,0.000030255715,0.0001774275,0.00008504671,0.000059226913],"category_scores_gemma":[0.000009968152,0.00014397211,0.000050925653,0.000452311,0.000076597215,0.00015142481,0.000016513659,0.00012573876,0.00031025062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000168416,0.000067182336,0.020307483,0.00006095605,0.000039018872,0.000018989826,0.001181644,0.00019766756,0.0063454555,0.9667765,0.0040606735,0.0009276174],"study_design_scores_gemma":[0.0010244913,0.00012215298,0.027884567,0.00012497818,0.000011185598,0.000010033606,0.00016466819,0.0033685237,0.02156075,0.9234935,0.021788975,0.00044615899],"about_ca_topic_score_codex":0.000036667567,"about_ca_topic_score_gemma":0.00004893065,"teacher_disagreement_score":0.043282956,"about_ca_system_score_codex":0.000029548879,"about_ca_system_score_gemma":0.0000056932286,"threshold_uncertainty_score":0.5871012},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9756857,0.00014819995,0.00000414556,0.00007290211,0.0010392879,0.00005149661,0.000012339369,0.00010808047,0.022877831],"genre_scores_gemma":[0.9962007,0.00002295248,0.00078780495,0.00003663154,0.00012790268,0.0000047572344,0.000015065614,0.000029515257,0.0027746772],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989712,0.000011766538,0.000283068,0.0002633311,0.00019399496,0.00027660295],"domain_scores_gemma":[0.9990301,0.00007389644,0.00024292208,0.00044170785,0.00010318627,0.00010817849],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011797163,0.0001821987,0.00027419094,0.000018039267,0.00008912235,0.000040158688,0.00033688935,0.00015402639,0.0026558836],"category_scores_gemma":[0.00014565756,0.00018017579,0.000064784545,0.000084856125,0.00008604887,0.00010198633,0.00014098173,0.00009863078,0.000075135715],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053647076,0.00008121983,0.0010413812,0.00023452197,0.00005233494,0.000005873697,0.00032716233,7.063541e-8,0.9792389,0.014346977,0.0041781147,0.00043976583],"study_design_scores_gemma":[0.0008878223,0.000034059383,0.000072670024,0.000109843575,0.00004007351,0.000014135112,0.00007149402,0.0000022542317,0.9477209,0.04601107,0.0048467824,0.00018891625],"about_ca_topic_score_codex":0.0001007023,"about_ca_topic_score_gemma":0.0000046550704,"teacher_disagreement_score":0.031664092,"about_ca_system_score_codex":0.00003905746,"about_ca_system_score_gemma":0.00012929423,"threshold_uncertainty_score":0.99825585},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9649594,0.00020617724,0.01755603,0.0009800036,0.0031653729,0.00037106316,0.0000044692865,0.00071821024,0.012039291],"genre_scores_gemma":[0.98684305,0.000014560628,0.012327275,0.00016552136,0.000026203556,0.00002429707,0.0000036771921,0.000027005814,0.0005684225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975854,0.00015748569,0.00026812227,0.00068640127,0.00060224836,0.00070033],"domain_scores_gemma":[0.9979395,0.00020378164,0.00010176367,0.0012237852,0.00025902587,0.00027209835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006748231,0.00022978523,0.00027864065,0.00030425336,0.00036594336,0.00021328969,0.0018227616,0.00010178978,0.000056760655],"category_scores_gemma":[0.00016299699,0.00021780819,0.000083663304,0.0012486223,0.000451922,0.00066875963,0.0005315327,0.00033776142,0.00038836323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033035725,0.0000912883,0.0063577266,0.000005761843,0.000027158998,0.00002535854,0.00038172162,0.0000040576397,0.0032866702,0.984532,0.0013797462,0.0038754512],"study_design_scores_gemma":[0.00083024264,0.00050269725,0.006314359,0.000036684043,0.0000049479722,0.000029739656,0.000030798343,0.0015344035,0.009290726,0.9782966,0.0028160731,0.00031276591],"about_ca_topic_score_codex":0.000020979378,"about_ca_topic_score_gemma":0.000010604364,"teacher_disagreement_score":0.021883653,"about_ca_system_score_codex":0.00004489694,"about_ca_system_score_gemma":0.000102532,"threshold_uncertainty_score":0.888196},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9867877,0.00004664632,0.0036233412,0.00027468253,0.0016540732,0.00031857335,0.0000011576495,0.0003573958,0.0069364263],"genre_scores_gemma":[0.99593586,0.0000034818925,0.003671755,0.000058250553,0.000008656499,0.000033111843,0.00000269241,0.000014961677,0.00027123233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998168,0.00024654443,0.00024000315,0.00046745568,0.00041561582,0.0004623899],"domain_scores_gemma":[0.99875724,0.0002344102,0.00007130657,0.00061241514,0.00020598351,0.00011863359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006263768,0.00015432405,0.00018167173,0.00035963586,0.0001369714,0.000092120055,0.00082317466,0.00008447695,0.000031057374],"category_scores_gemma":[0.00022447127,0.0001608196,0.00005821778,0.0019556738,0.00020056572,0.0007125133,0.00027041932,0.00020077992,0.0001515025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033916065,0.000118668424,0.0022706795,0.0000044177086,0.00000919635,0.000021297194,0.0007281597,0.0000034017705,0.0032883512,0.9875812,0.00045728177,0.005483407],"study_design_scores_gemma":[0.0012559947,0.00020427052,0.013333646,0.000019520143,0.000001661267,0.000007821468,0.00003111123,0.0049074288,0.009319293,0.9705196,0.00017910002,0.00022054267],"about_ca_topic_score_codex":0.000049286802,"about_ca_topic_score_gemma":0.00002903731,"teacher_disagreement_score":0.017061614,"about_ca_system_score_codex":0.0001082984,"about_ca_system_score_gemma":0.00005899216,"threshold_uncertainty_score":0.6558033},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9945896,0.0001789576,0.0017916014,0.00027589276,0.0006450862,0.00019407671,0.0000012837135,0.000105239815,0.0022182423],"genre_scores_gemma":[0.9946387,0.000026376425,0.0051074964,0.00013220105,0.000006063326,0.000016281014,7.210868e-7,0.000011418387,0.000060755527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834573,0.00018784526,0.0002191367,0.00047985069,0.00029325698,0.00047419264],"domain_scores_gemma":[0.9988061,0.0002860044,0.00006256625,0.0005973288,0.0001203932,0.00012758035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009462344,0.00014478262,0.00019272938,0.00024325296,0.00020172262,0.00010812386,0.00078231166,0.00007746534,0.0000080673135],"category_scores_gemma":[0.00019550443,0.00014554107,0.00003437061,0.000992574,0.00033990105,0.0005708889,0.00058037427,0.0002891026,0.000032166685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001597507,0.00004156885,0.009309658,0.000007856091,0.0000051682237,0.00001737788,0.00089207647,8.936496e-7,0.00054931536,0.9826523,0.00013974217,0.0063680336],"study_design_scores_gemma":[0.00084781734,0.00018458118,0.013734697,0.000033068005,0.0000011388588,0.000011440904,0.000051860912,0.004187145,0.004422176,0.97608775,0.00026580453,0.00017249331],"about_ca_topic_score_codex":0.000044214656,"about_ca_topic_score_gemma":0.000035156078,"teacher_disagreement_score":0.0065645585,"about_ca_system_score_codex":0.000053599724,"about_ca_system_score_gemma":0.00004718951,"threshold_uncertainty_score":0.59349924},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9932688,0.00003677974,0.00003681762,0.00006164176,0.00017918638,0.00011478119,0.000004151851,0.00004070459,0.006257122],"genre_scores_gemma":[0.99926716,0.000009927683,0.0005356918,0.000041718875,0.000004457324,0.00001351111,9.300163e-7,0.000010998663,0.00011557956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994378,0.000034769655,0.00016582187,0.00014053531,0.000099480596,0.00012160527],"domain_scores_gemma":[0.9993053,0.00015385196,0.00008100335,0.00031736286,0.000092803355,0.000049666785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002176567,0.0000825798,0.00014605468,0.000061021477,0.00010130966,0.0000086395075,0.00013031118,0.000061355946,0.00003955346],"category_scores_gemma":[0.000080048776,0.000074829295,0.00003924552,0.00023623007,0.00028016645,0.000054598375,0.000057893274,0.0000719787,0.000009695345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008077082,0.000107805216,0.0068723825,0.000016110187,0.000015547195,1.7225034e-7,0.00020852189,2.3044828e-8,0.0012959028,0.99038535,0.00079108623,0.0002990371],"study_design_scores_gemma":[0.00036556038,0.000060332128,0.0066985586,0.00001328735,0.000018745674,0.000002552931,0.00004294276,0.000026582113,0.009392844,0.98234105,0.00095664174,0.000080879574],"about_ca_topic_score_codex":0.000013195871,"about_ca_topic_score_gemma":0.000005875211,"teacher_disagreement_score":0.008096941,"about_ca_system_score_codex":0.0000051684074,"about_ca_system_score_gemma":0.0000121393405,"threshold_uncertainty_score":0.305145},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9850334,0.0001536479,0.0029769768,0.00025185212,0.0017512522,0.0001695706,0.0000022951513,0.00012821531,0.009532825],"genre_scores_gemma":[0.99563855,0.000009458278,0.003990249,0.0000884581,0.0000064360893,0.000007357683,8.3666697e-7,0.0000117346935,0.00024694452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985902,0.000104125094,0.00020324595,0.0003309421,0.0004046249,0.00036689284],"domain_scores_gemma":[0.9984477,0.00013929706,0.00008005641,0.000923308,0.0002929668,0.00011665778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041960817,0.000118739736,0.00016954876,0.00019816542,0.00014514118,0.000053413256,0.0012829776,0.000058143116,0.0000417459],"category_scores_gemma":[0.00009881075,0.000112563255,0.00007811116,0.00088134396,0.00040127672,0.0004412431,0.0003977539,0.00013667805,0.00014820384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001147638,0.000071531365,0.002665299,0.000006212455,0.00001529776,0.000005277156,0.00027459214,2.5115614e-7,0.0032445733,0.9903019,0.0007535154,0.0026500833],"study_design_scores_gemma":[0.0004040096,0.00029702255,0.004477505,0.00001322387,0.0000020486,0.000006679506,0.000012602337,0.0002634309,0.027481353,0.96549976,0.0014200034,0.00012237985],"about_ca_topic_score_codex":0.000012239466,"about_ca_topic_score_gemma":0.0000023437708,"teacher_disagreement_score":0.02480215,"about_ca_system_score_codex":0.00002373152,"about_ca_system_score_gemma":0.00006495227,"threshold_uncertainty_score":0.45901963},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97608596,0.0003496783,0.000028624429,0.000081135055,0.0006569422,0.00009790818,0.0000016652997,0.0003858745,0.022312228],"genre_scores_gemma":[0.9994852,0.000007095064,0.000083423736,0.00004153672,0.000018493325,0.000021401425,0.0000025840714,0.00003016403,0.00031013275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946153,0.000014945226,0.00010922204,0.00010484468,0.00011315221,0.00019628102],"domain_scores_gemma":[0.9996479,0.000018656894,0.000013949862,0.0002306191,0.000018319897,0.00007051627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008304635,0.00012030534,0.00012640674,0.00004487163,0.0000451544,0.000022735956,0.0001264227,0.00005292788,0.00006131424],"category_scores_gemma":[0.0000029788214,0.00010378282,0.000033248194,0.00017364442,0.000027834283,0.00011341668,0.000009936418,0.00011038141,0.0001571046],"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.000024259969,0.00007377135,0.0028272218,0.000081189464,0.00012814657,0.000028763148,0.0014304825,0.0033781829,0.0016331467,0.97640246,0.009223604,0.0047687436],"study_design_scores_gemma":[0.011074761,0.00082741195,0.026351774,0.000690909,0.00022977071,0.00040204602,0.0020380525,0.025872814,0.063117266,0.35266787,0.5129869,0.003740433],"about_ca_topic_score_codex":0.0000033263912,"about_ca_topic_score_gemma":0.0000035540977,"teacher_disagreement_score":0.62373465,"about_ca_system_score_codex":0.000029652407,"about_ca_system_score_gemma":0.0000064220367,"threshold_uncertainty_score":0.42321405},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5291457,0.000056987694,0.316086,0.00052170374,0.0021884604,0.0011837508,0.00013598356,0.00019219954,0.1504892],"genre_scores_gemma":[0.99552184,7.104668e-7,0.0019349288,0.00002799072,0.00008437495,0.00014320882,0.000024922392,0.000011524792,0.0022505198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995371,0.000006687166,0.00012656709,0.00012032455,0.000056932447,0.00015239869],"domain_scores_gemma":[0.9995474,0.00009440654,0.000054310745,0.00016039258,0.00010271973,0.00004075167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006647397,0.00007248481,0.00010310436,0.000011865387,0.00019295393,0.000026131216,0.00009666338,0.000018541517,0.0003190618],"category_scores_gemma":[0.000011749054,0.00006967902,0.000059476184,0.000077439545,0.00009645298,0.00009766361,0.000027534601,0.000035805948,0.00012485225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005954533,0.000048555718,0.00020521689,0.000004839866,0.0000145701215,1.8029672e-8,0.00006328333,2.7162173e-7,0.00013488928,0.99386233,0.0047818297,0.000878228],"study_design_scores_gemma":[0.00043514272,0.00003782598,0.00004884513,0.000005865629,0.000013309173,1.4641543e-7,0.00020772821,0.000116604235,0.00335679,0.97491634,0.020776216,0.000085212174],"about_ca_topic_score_codex":0.000008013181,"about_ca_topic_score_gemma":3.0828636e-7,"teacher_disagreement_score":0.4663761,"about_ca_system_score_codex":0.000012854055,"about_ca_system_score_gemma":0.000013416931,"threshold_uncertainty_score":0.34935027},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9936086,0.00001753697,0.0006543136,0.0006310827,0.00038079754,0.00038288662,0.000023260078,0.000050870127,0.004250662],"genre_scores_gemma":[0.9996384,0.000009240916,0.00009535471,0.000031705724,0.0000138180485,0.000046724337,0.000012931359,0.000010635555,0.0001412071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992217,0.000056888937,0.00023699742,0.00013281775,0.00019918605,0.00015242229],"domain_scores_gemma":[0.9986275,0.0006620539,0.000147705,0.00039174067,0.0001354086,0.000035629917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032273546,0.00009730311,0.00017045814,0.000025188525,0.00017769975,0.000015129338,0.00019055573,0.000046703048,0.00008940073],"category_scores_gemma":[0.00027835998,0.00006272842,0.00009912205,0.00035657128,0.00013268326,0.000034215704,0.000025907355,0.00009626726,0.000046890353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095210075,0.00015506368,0.000119587436,0.000007670567,0.000023969405,2.1943981e-7,0.000121900615,8.9612925e-8,0.000170792,0.9743635,0.024888234,0.000053783522],"study_design_scores_gemma":[0.0022450266,0.00012368127,0.00086643186,0.000017670023,0.000034624427,0.0000010218267,0.000033853525,0.00007041698,0.0052374,0.988662,0.0026358096,0.00007204572],"about_ca_topic_score_codex":0.00001724416,"about_ca_topic_score_gemma":0.0000032999546,"teacher_disagreement_score":0.022252424,"about_ca_system_score_codex":0.00002089769,"about_ca_system_score_gemma":0.000016127797,"threshold_uncertainty_score":0.25579906},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97293806,0.000029284112,0.0007566539,0.00014702535,0.002457335,0.00031848295,0.000007772609,0.00016341764,0.023181958],"genre_scores_gemma":[0.99436074,0.0000014697318,0.0030487187,0.000042294436,0.0000637603,0.000043812888,0.000012756859,0.000031031806,0.0023953954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990888,0.00005095336,0.00026200307,0.00021601604,0.00013026704,0.00025193338],"domain_scores_gemma":[0.9989657,0.0005189518,0.0001222023,0.0002712745,0.0000781786,0.00004370532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034290372,0.00014993164,0.00021692095,0.00004144995,0.00014387496,0.00002949438,0.00012708279,0.00013598375,0.00031280573],"category_scores_gemma":[0.00018323273,0.00014491547,0.00011571496,0.00016280489,0.00006631418,0.0001133727,0.000024369527,0.00011438452,0.00009726559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025231422,0.00008936826,0.0027775536,0.00004141628,0.000026161639,0.0000018538324,0.00003680613,5.582346e-7,0.0001297831,0.98305595,0.012961862,0.0008534322],"study_design_scores_gemma":[0.0010289346,0.000037337228,0.0005183484,0.000018962939,0.000037921727,0.00006825335,0.000054409462,0.000016741484,0.006156905,0.98809844,0.0037816989,0.00018203359],"about_ca_topic_score_codex":0.000016288588,"about_ca_topic_score_gemma":0.0000040849463,"teacher_disagreement_score":0.02142269,"about_ca_system_score_codex":0.000045229062,"about_ca_system_score_gemma":0.000024340297,"threshold_uncertainty_score":0.5909481},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99454695,0.0000687449,0.00008229352,0.0009815462,0.00026604623,0.0003467201,0.000028339988,0.00029351286,0.0033858342],"genre_scores_gemma":[0.9985802,0.00005350379,0.0005884006,0.0000984284,0.0000088509105,0.00008692082,0.0000063009156,0.00003916363,0.0005382042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987293,0.00011102678,0.00029875457,0.00036681135,0.00016433315,0.00032981107],"domain_scores_gemma":[0.99799937,0.001048931,0.00009739199,0.0005612263,0.00013645267,0.00015665074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029334138,0.00021742028,0.00027319905,0.00013659697,0.00019058722,0.000041706226,0.0002456007,0.00012573623,0.00022894148],"category_scores_gemma":[0.00045778358,0.00015745468,0.00008402128,0.00037295878,0.0002074931,0.00015663412,0.000085767075,0.00011888352,0.00009191222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002861014,0.00016480465,0.003350614,0.000020686104,0.000058220045,0.0000042861875,0.00019633243,9.028089e-9,0.014254277,0.97893775,0.0022596396,0.0007247994],"study_design_scores_gemma":[0.0015471221,0.00007432032,0.0062823,0.0000576157,0.00004741911,0.000014642604,0.00006121269,0.0000040766754,0.0070622675,0.981565,0.0030220242,0.00026197513],"about_ca_topic_score_codex":0.000014120174,"about_ca_topic_score_gemma":0.00001408225,"teacher_disagreement_score":0.007192009,"about_ca_system_score_codex":0.000019097402,"about_ca_system_score_gemma":0.000026470349,"threshold_uncertainty_score":0.64208156},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9915227,0.0036632859,0.000035470068,0.0011322264,0.002815098,0.00037605007,0.0000019336796,0.00013739632,0.00031583008],"genre_scores_gemma":[0.9986865,0.000120557386,0.00086771545,0.00024211154,0.0000029545267,0.000027404596,0.0000031792113,0.000015537524,0.00003404976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786943,0.00020752581,0.00034274205,0.0005122931,0.00064968126,0.00041831785],"domain_scores_gemma":[0.99799925,0.0004493269,0.0002393945,0.0009196663,0.0002355051,0.00015687128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013233447,0.00023620836,0.0002520566,0.0005460245,0.0003321866,0.000059493752,0.0004828754,0.00005908167,0.000009247491],"category_scores_gemma":[0.0002817448,0.00016203942,0.00011595197,0.0023043235,0.00022946377,0.00046052507,0.00020382932,0.00030023235,0.0000169472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013354099,0.00037331556,0.019737538,0.000016065014,0.00004663898,8.332845e-7,0.00017251179,0.000011436682,0.002424468,0.9734552,0.0024412984,0.0013073764],"study_design_scores_gemma":[0.00045033434,0.00020926486,0.039725933,0.00003887382,0.000025536796,0.000020390067,0.000017713905,0.00026295867,0.009511598,0.9492897,0.00022941426,0.00021830821],"about_ca_topic_score_codex":0.000045642068,"about_ca_topic_score_gemma":6.9412727e-7,"teacher_disagreement_score":0.02416549,"about_ca_system_score_codex":0.000013294969,"about_ca_system_score_gemma":0.00003939329,"threshold_uncertainty_score":0.66077757},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9715207,0.000089809764,0.00007461783,0.00040037528,0.00087116606,0.00020857317,0.0000042866864,0.00011241339,0.026718056],"genre_scores_gemma":[0.9971335,0.00001303876,0.0013609341,0.00018372305,0.000031077925,0.00001867021,0.000002484955,0.000026830541,0.0012297755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998983,0.000116103845,0.00020611903,0.00016939527,0.00020160738,0.00032377595],"domain_scores_gemma":[0.99895865,0.0004437644,0.00012048356,0.00028655463,0.000028309332,0.00016226448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000600033,0.00016936279,0.00021924361,0.000054502725,0.00014279575,0.000036790756,0.0001266304,0.000113263864,0.000114959585],"category_scores_gemma":[0.00029409816,0.00015121565,0.000049439826,0.0001081971,0.00010090033,0.00035221654,0.000048934595,0.00016422529,0.00017567177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028876957,0.00012519039,0.0011423453,0.000029099481,0.00001653054,0.0000017136185,0.0022686294,2.0544937e-7,0.00039579964,0.9936988,0.0016507861,0.0006420187],"study_design_scores_gemma":[0.00057105755,0.000068716916,0.00034170845,0.00004017172,0.000023987302,0.000011677114,0.00030811204,0.000021775842,0.0061429515,0.989733,0.0025252842,0.00021158477],"about_ca_topic_score_codex":0.000019424842,"about_ca_topic_score_gemma":0.0000031182112,"teacher_disagreement_score":0.025612764,"about_ca_system_score_codex":0.00005396617,"about_ca_system_score_gemma":0.000018277504,"threshold_uncertainty_score":0.6166395},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9811924,0.000076702454,0.0028910073,0.0005498268,0.012540966,0.00017449062,0.0000018776434,0.00009652757,0.002476169],"genre_scores_gemma":[0.9993388,0.000009450341,0.00038583673,0.00007959222,0.000018113518,0.000019629655,7.108645e-7,0.000007208412,0.00014068112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884397,0.00015845153,0.000296753,0.0002302,0.00022305627,0.00024754854],"domain_scores_gemma":[0.9984403,0.00036063555,0.0001736187,0.00076475635,0.00019064474,0.00007003805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078893633,0.00011227462,0.00019527438,0.00004882871,0.0003076987,0.00013233892,0.00081639236,0.00006764025,0.000011027285],"category_scores_gemma":[0.000076313125,0.0000788247,0.00011695725,0.00034545088,0.00011162115,0.00018747876,0.00015043908,0.00022503058,0.000023154473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053294502,0.000029564204,0.0015964285,0.0000031004324,0.000020422976,0.0000012936331,0.00012293362,0.000009665198,0.0067747505,0.9880568,0.0024431003,0.00093662005],"study_design_scores_gemma":[0.000981179,0.00014106461,0.006853165,0.00001552916,0.000006972952,0.000026889515,0.000022890832,0.04403117,0.0056362306,0.8900211,0.052022453,0.00024135406],"about_ca_topic_score_codex":0.00013311602,"about_ca_topic_score_gemma":0.00015276027,"teacher_disagreement_score":0.09803569,"about_ca_system_score_codex":0.000009859631,"about_ca_system_score_gemma":0.000031874733,"threshold_uncertainty_score":0.32143778},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99465674,0.000014478118,0.000018747787,0.000373602,0.00019229163,0.00023077516,0.0000118508715,0.000012493987,0.004489004],"genre_scores_gemma":[0.999827,0.000003923153,0.00007158258,0.000037271126,0.0000019195995,0.000013533307,7.3876896e-7,0.000011557964,0.000032460535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913937,0.00018960291,0.00026766956,0.00009723602,0.00020332981,0.000102818354],"domain_scores_gemma":[0.9972026,0.0017311875,0.0002900258,0.00066508196,0.00009091695,0.00002020405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063070917,0.00009474856,0.00020579083,0.000039390754,0.00008483052,0.0000037223158,0.00044167376,0.00005202335,0.000021540214],"category_scores_gemma":[0.0004395186,0.00005326982,0.0001500345,0.00027605245,0.00028549944,0.000019421082,0.000049121943,0.000097229626,0.0000027283454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010811213,0.00018719374,0.0021252765,0.0000418979,0.000033686047,2.2018787e-8,0.0005936802,0.0000024852384,0.0057841046,0.9908629,0.0002821367,0.00007578871],"study_design_scores_gemma":[0.00016477039,0.000060590242,0.0019172791,0.00005242088,0.000031823576,1.684866e-7,0.00019321048,0.000012956017,0.1542808,0.8431412,0.00009845727,0.000046348858],"about_ca_topic_score_codex":0.00001454618,"about_ca_topic_score_gemma":0.0000044382023,"teacher_disagreement_score":0.14849669,"about_ca_system_score_codex":0.000004452816,"about_ca_system_score_gemma":0.000014829347,"threshold_uncertainty_score":0.21722804},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96725774,0.00037794863,0.006988775,0.00012046054,0.0013198768,0.000344589,0.000003230944,0.00009616662,0.023491215],"genre_scores_gemma":[0.99151796,0.000035707013,0.008089669,0.00001440603,0.0000012166228,0.000011563169,3.5914732e-7,0.000012096405,0.00031699447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856734,0.00015873385,0.00029597673,0.0002371456,0.00042532498,0.00031548232],"domain_scores_gemma":[0.9979962,0.0002586584,0.00016273362,0.0011490909,0.00035831713,0.000074979434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006979882,0.0001170595,0.00019111575,0.00007127151,0.00012724598,0.000017154718,0.0016670212,0.00005426199,0.000033796838],"category_scores_gemma":[0.00012580006,0.00008563873,0.00009575698,0.0009951177,0.00042019013,0.00027233653,0.00041000868,0.00015620377,0.00002727715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001911695,0.00009566226,0.004915414,0.000010355327,0.000029131681,0.0000041653466,0.000564458,5.834255e-7,0.0009236178,0.9908567,0.00021505984,0.0023657354],"study_design_scores_gemma":[0.00035688217,0.000079366146,0.0036858504,0.000011934394,0.0000037272655,0.0000045362426,0.000050465795,0.00012350993,0.034567174,0.96041685,0.00060884556,0.0000908756],"about_ca_topic_score_codex":0.000032728127,"about_ca_topic_score_gemma":0.0000025180348,"teacher_disagreement_score":0.03364356,"about_ca_system_score_codex":0.0000115830835,"about_ca_system_score_gemma":0.000055799872,"threshold_uncertainty_score":0.3492246},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99503905,0.00032609003,0.0005112433,0.0007199364,0.0005758632,0.00040018192,0.0000014905085,0.00009391576,0.0023322552],"genre_scores_gemma":[0.997667,0.00011356961,0.0014762288,0.00038525296,0.000006102851,0.00004133609,0.0000012945426,0.000020484757,0.00028870424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814683,0.00015231036,0.00025577683,0.00052807265,0.00034219195,0.0005747961],"domain_scores_gemma":[0.99852604,0.0002891971,0.00010411118,0.00061500084,0.00011079165,0.00035488978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040672184,0.00025091803,0.0002668257,0.00020877154,0.00031867082,0.00052312866,0.00078330503,0.000086796616,0.000045969005],"category_scores_gemma":[0.00005753583,0.00020694982,0.000036958692,0.0003647935,0.00013271798,0.0013145397,0.000648071,0.00036582476,0.00012350889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054712604,0.00055859657,0.057638384,0.00004802612,0.00014793914,0.000028571296,0.0014165827,0.00003344067,0.005293949,0.88275474,0.003059641,0.04896543],"study_design_scores_gemma":[0.001636235,0.0004156672,0.019518135,0.00005744102,0.0000030097053,0.000024847837,0.00009204621,0.0070124627,0.004713493,0.9653414,0.00088290224,0.00030235297],"about_ca_topic_score_codex":0.000045245848,"about_ca_topic_score_gemma":0.0000018807121,"teacher_disagreement_score":0.08258668,"about_ca_system_score_codex":0.00008013948,"about_ca_system_score_gemma":0.00003719528,"threshold_uncertainty_score":0.84391683},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9884016,0.0012073786,0.00014331627,0.00024607423,0.0060311323,0.00048483966,0.000009763822,0.00042402092,0.0030518628],"genre_scores_gemma":[0.9935513,0.00006383594,0.0045918734,0.0000866954,0.00011564359,0.000054518285,0.0000030508618,0.00009579135,0.0014372608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794275,0.00012160573,0.0005431554,0.00036870156,0.0005545295,0.00046925715],"domain_scores_gemma":[0.9974883,0.0010684343,0.00026377616,0.0006383778,0.00021153923,0.00032953324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006343061,0.00034379825,0.00058302906,0.00014123169,0.00014531605,0.00013621387,0.00037779572,0.00017009494,0.000017721644],"category_scores_gemma":[0.0033180055,0.00033963646,0.00007905587,0.00021228018,0.00019735492,0.00059935526,0.000313487,0.00026335366,0.0001067471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022966464,0.00014070881,0.00019038573,0.000121394994,0.000044111315,0.00002248036,0.0010449569,0.0000012849689,0.00025317672,0.98902726,0.009028391,0.00010290909],"study_design_scores_gemma":[0.0015028837,0.00017215512,0.000053679072,0.000093714116,0.00007444251,0.00003602761,0.0005857502,0.00007733162,0.0017599539,0.9947851,0.0004735596,0.00038540259],"about_ca_topic_score_codex":0.00001509142,"about_ca_topic_score_gemma":0.0000020947432,"teacher_disagreement_score":0.008554831,"about_ca_system_score_codex":0.00016477359,"about_ca_system_score_gemma":0.000113931346,"threshold_uncertainty_score":0.9999056},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99598384,0.0000029157336,0.00050601363,0.000058098707,0.00035101728,0.00038471288,0.000037105485,0.000033862714,0.0026424478],"genre_scores_gemma":[0.99882114,0.000005654017,0.00083452224,0.000012388204,0.000004170102,0.00010028562,0.0000015563817,0.000027147653,0.000193131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902445,0.00005674887,0.00038882912,0.00019831107,0.0001229896,0.00020869043],"domain_scores_gemma":[0.99769866,0.001583492,0.00023018943,0.000385284,0.000059239163,0.000043148844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005080677,0.0001363528,0.0003427842,0.000052156767,0.000058844034,0.000008743208,0.00020840112,0.000088966044,0.00012508835],"category_scores_gemma":[0.00029145545,0.00010013013,0.00012915689,0.00025095243,0.000117170755,0.00014958586,0.000059342416,0.00007230667,0.00000981466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010694808,0.00040320412,0.01961084,0.00015026965,0.00003661524,9.506808e-7,0.00031058595,1.7683823e-7,0.007989457,0.97082233,0.0002584252,0.0003101826],"study_design_scores_gemma":[0.0014573627,0.00005226586,0.0033983416,0.00019311995,0.00002295684,0.0000042046563,0.000045756715,0.0000037678997,0.01572308,0.9787857,0.0001764688,0.00013699465],"about_ca_topic_score_codex":0.000019105273,"about_ca_topic_score_gemma":0.000027575272,"teacher_disagreement_score":0.0162125,"about_ca_system_score_codex":0.000030347659,"about_ca_system_score_gemma":0.000025960424,"threshold_uncertainty_score":0.40831882},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9893233,0.00006777488,0.00017121814,0.0030170267,0.0006633102,0.00013376409,0.000010609913,0.000045695033,0.006567271],"genre_scores_gemma":[0.9980162,0.000030044359,0.00020828388,0.0001709755,0.000011046058,0.000004952621,3.627251e-7,0.000011925821,0.0015462408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990858,0.000099324345,0.00028491006,0.00012997733,0.00020328196,0.00019670493],"domain_scores_gemma":[0.9968758,0.002460877,0.0001484086,0.00038378258,0.000070379574,0.000060725877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036148704,0.000116863775,0.0002581254,0.00010045387,0.000050734234,0.000005614298,0.00023963803,0.00007170636,0.00041293615],"category_scores_gemma":[0.0013489949,0.000057697744,0.00007940041,0.00029208153,0.00015830259,0.000030294383,0.00006311292,0.00008786665,0.00004065756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001531414,0.00007350069,0.0010769207,0.000010017505,0.000032576885,0.000001423059,0.00019235558,2.3651822e-8,0.00029452713,0.98750263,0.009274188,0.0015264953],"study_design_scores_gemma":[0.00069595384,0.00018937714,0.00049307075,0.00003992395,0.000015736387,0.0000027545018,0.00015471983,6.325722e-7,0.0070430166,0.9902881,0.000992796,0.000083946645],"about_ca_topic_score_codex":0.00007320983,"about_ca_topic_score_gemma":0.000005017513,"teacher_disagreement_score":0.008692838,"about_ca_system_score_codex":0.000016903527,"about_ca_system_score_gemma":0.00005944472,"threshold_uncertainty_score":0.45213613},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9971008,0.0002232504,0.00011251182,0.0007031048,0.00016940283,0.00038984438,0.000050396266,0.00007006475,0.0011806297],"genre_scores_gemma":[0.9991333,0.00009647295,0.00037058853,0.000022780085,0.000006309554,0.00018613794,0.000003340643,0.000017138933,0.00016397044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991851,0.000074834905,0.00025558047,0.0001997795,0.00012069097,0.00016402995],"domain_scores_gemma":[0.9980286,0.001076069,0.00015884744,0.00059858727,0.00006509403,0.000072827606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023064236,0.00011756075,0.00016326144,0.00004511467,0.00030966962,0.000019998006,0.00028080546,0.00007351636,0.000015081367],"category_scores_gemma":[0.0000608986,0.00007304453,0.00007940089,0.00020168975,0.00036168567,0.00006114571,0.00006320455,0.00006691253,0.0000100349325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016766331,0.000063097395,0.000994429,0.0000053157746,0.000048282633,1.6200934e-7,0.00007488707,6.9928205e-9,0.021303048,0.9740094,0.0010062156,0.0024783695],"study_design_scores_gemma":[0.00056984526,0.000021307998,0.003547135,0.00001879217,0.000044032196,7.4454454e-7,0.0000721983,6.309586e-7,0.014612553,0.9765929,0.004420331,0.00009954017],"about_ca_topic_score_codex":0.00001444968,"about_ca_topic_score_gemma":0.0000122821675,"teacher_disagreement_score":0.006690496,"about_ca_system_score_codex":0.000009015757,"about_ca_system_score_gemma":0.000017078819,"threshold_uncertainty_score":0.29786694},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99526256,0.00021560464,0.00047516034,0.0012559969,0.0016048002,0.00016697258,0.000008064957,0.00014395431,0.0008668966],"genre_scores_gemma":[0.9981371,0.000033357683,0.0015088,0.00022987544,0.00000132214,0.000008430396,7.5396423e-7,0.000011671189,0.00006864617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986713,0.00007474216,0.0002701123,0.0004177293,0.0002745121,0.0002916032],"domain_scores_gemma":[0.99868375,0.00035127092,0.00014114303,0.00057542697,0.000110967194,0.00013742331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030189034,0.00017816655,0.00026964472,0.00015999963,0.00012289581,0.000042673906,0.0004425002,0.00009015268,0.0000060972275],"category_scores_gemma":[0.00007419929,0.00012411099,0.00006837851,0.00035554369,0.0001483211,0.00016890754,0.00021498658,0.00011895195,0.00002757885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001289912,0.000059095142,0.0016147897,0.000015337351,0.000016912905,0.0000071246304,0.00019621917,0.0000019450367,0.014841124,0.9792762,0.0007501929,0.0032081835],"study_design_scores_gemma":[0.001753254,0.00044697602,0.003087836,0.00016333562,0.00000933025,0.000010839353,0.000004367373,0.00028332134,0.013470366,0.9792828,0.0012752578,0.00021229686],"about_ca_topic_score_codex":0.000024381725,"about_ca_topic_score_gemma":0.0000032067562,"teacher_disagreement_score":0.0029958866,"about_ca_system_score_codex":0.000019734112,"about_ca_system_score_gemma":0.000040215746,"threshold_uncertainty_score":0.5061099},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9829264,0.00007474606,0.000043152326,0.000027114564,0.0012222376,0.0003030861,0.000009635352,0.00005571447,0.015337898],"genre_scores_gemma":[0.9998348,0.0000071815143,0.000016571603,0.000030055826,0.000022026987,0.000042061172,0.000004379103,0.000015899184,0.000027046593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918747,0.00011853115,0.00020959394,0.0001250264,0.0001505602,0.00020881812],"domain_scores_gemma":[0.9993189,0.00024525516,0.00004433427,0.00029788222,0.000071506896,0.000022123355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004941224,0.00013589676,0.00018938092,0.00009295201,0.0000513021,0.000016819415,0.0002970537,0.00008093111,0.000029268724],"category_scores_gemma":[0.000052021853,0.000099160134,0.000040863786,0.0004997159,0.00012150428,0.00007634577,0.000019413807,0.00016475457,0.0000576752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009019828,0.00013521645,0.008851358,0.00015561271,0.00010839105,0.00003536329,0.014541521,0.0003133554,0.0017521012,0.9713068,0.002111047,0.0005990573],"study_design_scores_gemma":[0.0024702759,0.0006689064,0.020118145,0.0002660771,0.00004211313,0.000051130195,0.003586414,0.007225975,0.011559797,0.9501237,0.0032780592,0.000609398],"about_ca_topic_score_codex":0.00004214072,"about_ca_topic_score_gemma":0.000026896987,"teacher_disagreement_score":0.02118307,"about_ca_system_score_codex":0.000015472178,"about_ca_system_score_gemma":0.000016950955,"threshold_uncertainty_score":0.40436327},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9956224,0.000101511694,0.000026415682,0.0001111886,0.000060421244,0.00026703405,0.000009747043,0.00002226261,0.0037790004],"genre_scores_gemma":[0.99949926,0.000043009833,0.00026346213,0.0000041840135,0.0000023484465,0.000068225614,0.000002080157,0.000015018224,0.00010241899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993386,0.00003930088,0.00021860006,0.00013470378,0.00014448244,0.00012430767],"domain_scores_gemma":[0.9981939,0.0005221275,0.00044570703,0.00069240236,0.00011100395,0.000034849145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038251712,0.0000962966,0.00018765294,0.000023780101,0.00049210934,0.000040297007,0.00032339175,0.00005150421,0.000008191736],"category_scores_gemma":[0.00009776849,0.0000677309,0.00004787541,0.00009764171,0.0004452515,0.00010504344,0.00006043921,0.00009264075,0.0000026293399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012547641,0.00013446233,0.018157074,0.000009315472,0.00006134952,2.3229852e-7,0.00020250665,7.049069e-8,0.00037279323,0.980656,0.00020110223,0.00019252049],"study_design_scores_gemma":[0.00044364174,0.000024337662,0.054985564,0.00003846866,0.000030975007,0.0000014402477,0.0001768386,0.0000027172582,0.001114666,0.94283575,0.00027074094,0.00007488712],"about_ca_topic_score_codex":0.0000047292847,"about_ca_topic_score_gemma":0.0000041886487,"teacher_disagreement_score":0.037820302,"about_ca_system_score_codex":0.0000070633496,"about_ca_system_score_gemma":0.000010813477,"threshold_uncertainty_score":0.3784957},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98418343,0.00025669625,0.005784718,0.00086763257,0.004101281,0.00025912156,0.0000011202037,0.00010325204,0.00444272],"genre_scores_gemma":[0.99871236,0.000005026742,0.0008052823,0.000060122315,0.000022720396,0.000028113307,3.1433348e-7,0.000009277654,0.00035680868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986703,0.00024491767,0.00025003776,0.0002600503,0.0003219225,0.000252805],"domain_scores_gemma":[0.9983688,0.00042487634,0.00017916094,0.0005943925,0.00032001678,0.00011278226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008157972,0.00013257442,0.00022901935,0.000036051253,0.00015772617,0.000116473966,0.0006883951,0.000057937,0.0000026326152],"category_scores_gemma":[0.00013006617,0.000083230254,0.00007921163,0.00041645957,0.00009318824,0.00023561849,0.00013386688,0.00011744831,0.000010289938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087795546,0.00008203863,0.0027143776,0.0000064367264,0.00006705373,0.000009387813,0.0010557286,0.00009202271,0.0001470317,0.98345965,0.011397123,0.00088133186],"study_design_scores_gemma":[0.008462918,0.0027653687,0.009352755,0.00013321039,0.00004246012,0.00016885405,0.00082790985,0.03622658,0.0056261243,0.90033466,0.03519148,0.0008676607],"about_ca_topic_score_codex":0.0001632394,"about_ca_topic_score_gemma":0.000059511312,"teacher_disagreement_score":0.083124995,"about_ca_system_score_codex":0.000041323314,"about_ca_system_score_gemma":0.000104691746,"threshold_uncertainty_score":0.33940312},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9967366,0.000012287437,0.0002817613,0.000207939,0.00048269972,0.00026680974,0.0000071109544,0.00004447764,0.0019603302],"genre_scores_gemma":[0.99865365,0.0000056129434,0.0009030509,0.0000130523,0.000025566413,0.00001970641,0.0000011052332,0.000033395416,0.00034483068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980682,0.000320752,0.00039057038,0.00026567202,0.00048447706,0.00047032794],"domain_scores_gemma":[0.99787486,0.0012983306,0.00006554865,0.0005337185,0.00012404821,0.000103505365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012696019,0.00014345629,0.0003243453,0.00019777479,0.000030308034,0.000015787255,0.00041272814,0.0001123888,0.00023296014],"category_scores_gemma":[0.0002969241,0.00010587093,0.00007892948,0.0003102487,0.00019495212,0.00010099336,0.00028668338,0.0001946183,0.00016322441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018199331,0.00039860432,0.021709431,0.00007887518,0.000026265327,0.00003704637,0.0004405052,4.557577e-7,0.003018678,0.9659172,0.0012668661,0.0069240727],"study_design_scores_gemma":[0.003268922,0.0004204931,0.006455579,0.00014719818,0.0000067673623,0.0000067795004,0.000025677593,0.00020998868,0.018604115,0.9704896,0.00019494933,0.00016990233],"about_ca_topic_score_codex":0.000032411852,"about_ca_topic_score_gemma":0.000009465123,"teacher_disagreement_score":0.0155854365,"about_ca_system_score_codex":0.00008800668,"about_ca_system_score_gemma":0.00008398948,"threshold_uncertainty_score":0.43172914},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9485091,0.0001902551,0.044697523,0.0011885014,0.0016316655,0.00031887944,0.000008469683,0.00037825247,0.0030773745],"genre_scores_gemma":[0.997952,0.000011359871,0.0015640903,0.00016501217,0.000012705422,0.000030717314,0.0000047153344,0.00001804546,0.00024134383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998416,0.00026581527,0.00020766315,0.00042202332,0.00029975083,0.00038873532],"domain_scores_gemma":[0.9983821,0.00043689585,0.00013440604,0.0007914506,0.00011476376,0.00014038481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066177023,0.00017217925,0.0002114876,0.00013326421,0.00019396235,0.00014738385,0.0012230884,0.00007904536,0.000009291043],"category_scores_gemma":[0.0002461926,0.00015559503,0.000070147944,0.00039619554,0.00009578976,0.00057020126,0.00030577896,0.00016613897,0.000067018744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016015305,0.00009107565,0.0013433963,0.000009450489,0.000011749317,0.000003301621,0.0001945503,0.0000049961404,0.008902789,0.9430843,0.0034667766,0.042871602],"study_design_scores_gemma":[0.00095004606,0.00011874638,0.0030042075,0.000018576842,0.0000023227917,0.0000054448833,0.000024398363,0.0058431947,0.047512364,0.93686885,0.0053985254,0.00025332114],"about_ca_topic_score_codex":0.000007289437,"about_ca_topic_score_gemma":0.0000026849723,"teacher_disagreement_score":0.049442932,"about_ca_system_score_codex":0.00005909236,"about_ca_system_score_gemma":0.000029517794,"threshold_uncertainty_score":0.6344981},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8875575,0.00018664477,0.109511785,0.00038443948,0.00043757347,0.00019736783,0.000005228158,0.00020674607,0.0015127185],"genre_scores_gemma":[0.99334365,0.000009839935,0.0064974506,0.000064071864,0.00001010328,0.0000042491565,8.145435e-7,0.00000992946,0.000059880203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979038,0.00014843541,0.000278998,0.0005626175,0.00047479884,0.0006313014],"domain_scores_gemma":[0.99739075,0.0012213839,0.000041548563,0.000848787,0.00015166141,0.0003458506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015711299,0.00015680294,0.0002131252,0.00011098009,0.00018855801,0.0001048657,0.0009351987,0.00008512637,0.000015648115],"category_scores_gemma":[0.0004888203,0.00015233393,0.000049179216,0.0005168745,0.00036433284,0.0006238883,0.0006642688,0.0003170078,0.000033701563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058892015,0.000041100782,0.06569966,0.000018794097,0.000006938463,0.000016506465,0.00013155931,9.1161915e-8,0.0004878349,0.89931345,0.000014457877,0.034263708],"study_design_scores_gemma":[0.00024907832,0.00008847596,0.18400064,0.000009651775,0.0000019832617,0.0000047303324,0.000015898535,0.00007760268,0.0038909898,0.81114167,0.0003658617,0.0001534],"about_ca_topic_score_codex":0.000013332795,"about_ca_topic_score_gemma":0.000001668346,"teacher_disagreement_score":0.11830098,"about_ca_system_score_codex":0.00006704509,"about_ca_system_score_gemma":0.000040132145,"threshold_uncertainty_score":0.6211998},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98434323,0.0004901825,0.00045302152,0.000011925475,0.0012063435,0.00016835766,0.0000043385735,0.0002040815,0.013118516],"genre_scores_gemma":[0.99918497,0.0000041687736,0.00058301556,0.000034293822,0.00004206868,0.000040915944,0.000006487403,0.00003071055,0.000073368086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992658,0.0000337704,0.00015178342,0.0001239505,0.0001191082,0.00030560954],"domain_scores_gemma":[0.9995381,0.000044627308,0.00001565872,0.00018700142,0.000016119124,0.0001984442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025065322,0.00014335287,0.0001636729,0.00009402535,0.00006330083,0.000021813566,0.00009859638,0.000074817086,0.000014817463],"category_scores_gemma":[0.000019528989,0.00013941935,0.00003780524,0.00024836793,0.000021800399,0.00012724394,0.000029590497,0.00012438191,0.00007926728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068532463,0.000057842233,0.010979348,0.00007185176,0.000035332378,7.2418305e-7,0.0015410021,0.00024231295,0.00096975977,0.98456717,0.001215777,0.0003120534],"study_design_scores_gemma":[0.004279543,0.00044655715,0.13769299,0.00026903706,0.0001610643,0.00018375565,0.002750292,0.019080635,0.012805903,0.767837,0.051371712,0.0031215115],"about_ca_topic_score_codex":0.0000029072621,"about_ca_topic_score_gemma":4.4001777e-7,"teacher_disagreement_score":0.21673015,"about_ca_system_score_codex":0.000014142743,"about_ca_system_score_gemma":0.0000041064222,"threshold_uncertainty_score":0.5685356},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9876827,0.0013168827,0.0060221567,0.0001296078,0.0016405149,0.00093018287,0.0001212511,0.00012532968,0.0020313498],"genre_scores_gemma":[0.99039716,0.00019702099,0.0058142664,0.000015382668,0.000033797893,0.00008240891,0.0000029615794,0.00007487904,0.0033821368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977314,0.00007336333,0.0009894941,0.00025370167,0.00053471973,0.00041733205],"domain_scores_gemma":[0.9931677,0.00510211,0.00067953765,0.00062872306,0.0003217396,0.00010020715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056541327,0.000264555,0.0008343344,0.00068038236,0.00006834492,0.000021679783,0.00050343917,0.00014141976,0.000051819054],"category_scores_gemma":[0.0035049259,0.00020106028,0.00029035582,0.0007434356,0.0002843582,0.00051882013,0.00018922173,0.00007915086,0.000023165263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029292092,0.00033544592,0.000364975,0.0007976211,0.00013945918,9.676489e-7,0.00009141413,3.2742068e-7,0.0023706586,0.99362105,0.0018313054,0.0004174781],"study_design_scores_gemma":[0.0016829537,0.0002445077,0.00089466333,0.00022457278,0.00014499394,0.0000033759702,0.00019261689,0.000006686821,0.022526046,0.9737987,0.000045599907,0.00023529658],"about_ca_topic_score_codex":0.000015673244,"about_ca_topic_score_gemma":0.000006341583,"teacher_disagreement_score":0.020155387,"about_ca_system_score_codex":0.00013643489,"about_ca_system_score_gemma":0.000050309747,"threshold_uncertainty_score":0.81990004},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.942078,0.000042779546,0.0020940974,0.00029852433,0.00084252073,0.00020634464,0.0000014197693,0.00010210969,0.054334212],"genre_scores_gemma":[0.9978311,0.000011889189,0.0019109597,0.00013809043,0.0000017278019,0.000017629913,4.561885e-7,0.0000088058705,0.000079364356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890935,0.00015545421,0.00015301991,0.00022898248,0.0003273439,0.00022587352],"domain_scores_gemma":[0.99863803,0.00032195827,0.00006743531,0.0008108039,0.00010200861,0.000059781443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042717886,0.00010099535,0.0001179728,0.000102953316,0.00011294201,0.000017712706,0.0011461315,0.000039515595,0.000074247364],"category_scores_gemma":[0.00009953929,0.0000718292,0.00007786855,0.0005802913,0.00017507716,0.00022568893,0.00016773674,0.00017182092,0.000100792386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013319756,0.000104721235,0.00052992423,0.0000033478016,0.000011765462,0.0000041846115,0.00040897698,0.0000019101442,0.000724893,0.9972666,0.00025801655,0.00067236327],"study_design_scores_gemma":[0.00021217317,0.00016463199,0.002111477,0.000015150143,0.0000019673357,0.000003793888,0.000046350273,0.00019048186,0.013020288,0.9839936,0.00015704973,0.00008304218],"about_ca_topic_score_codex":0.000022970073,"about_ca_topic_score_gemma":0.0000015844034,"teacher_disagreement_score":0.055753086,"about_ca_system_score_codex":0.000018407896,"about_ca_system_score_gemma":0.000025883524,"threshold_uncertainty_score":0.292911},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9733255,0.0005864485,0.0022352745,0.0010094086,0.0019917572,0.0006567916,0.0000039704296,0.00031953512,0.019871298],"genre_scores_gemma":[0.9913587,0.000008025614,0.008319685,0.000028944973,0.0000047929943,0.000019812453,0.0000015543169,0.000015543,0.00024294837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983324,0.00012161668,0.00017024958,0.0004049284,0.000617331,0.00035349783],"domain_scores_gemma":[0.99814343,0.00010506124,0.000094220406,0.0009917943,0.00043815927,0.00022731858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063879794,0.00013950508,0.00022123472,0.00018583544,0.000051690276,0.000036803332,0.0010517895,0.000041650714,0.0000024073674],"category_scores_gemma":[0.0002400594,0.000112927846,0.00003179356,0.0014686942,0.00021933441,0.0004889254,0.00024389474,0.00015991202,0.000031800188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003965226,0.0001415328,0.0058158697,0.000018516743,0.000024571336,0.000032992844,0.0006824266,0.000020941108,0.00047237249,0.98970366,0.00095230114,0.0020951559],"study_design_scores_gemma":[0.0011840339,0.0006505503,0.0016027293,0.000030939304,0.000005286035,0.000016023265,0.000053717766,0.00024468199,0.031986542,0.962486,0.001512328,0.00022715697],"about_ca_topic_score_codex":0.000019535448,"about_ca_topic_score_gemma":0.000004471589,"teacher_disagreement_score":0.031514168,"about_ca_system_score_codex":0.000035814475,"about_ca_system_score_gemma":0.00021433254,"threshold_uncertainty_score":0.46050638},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97992265,0.00013306821,0.00001509224,0.00009202653,0.002861642,0.00041766244,0.000008862487,0.00075092324,0.015798083],"genre_scores_gemma":[0.9993921,0.000018592802,0.00016942521,0.00013260319,0.000021362339,0.000105263454,0.000022806278,0.000054018907,0.000083835395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881893,0.000047001166,0.00027580126,0.00021498853,0.00023324759,0.0004100124],"domain_scores_gemma":[0.99923176,0.00006011436,0.000034657438,0.00048737077,0.00003958477,0.00014650902],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016720322,0.00025486306,0.00024020861,0.00013952437,0.00012238185,0.000058674133,0.00030280417,0.00009820385,0.00030749897],"category_scores_gemma":[0.0000051378393,0.00024672394,0.00012008892,0.00027913522,0.000029570308,0.00021513629,0.000032848362,0.0002058671,0.0010323488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012357842,0.00019353657,0.0018982271,0.00013093353,0.0002450857,0.000019380457,0.0008713061,0.00034626503,0.005212375,0.9599154,0.02858617,0.0025689867],"study_design_scores_gemma":[0.002618114,0.00037761367,0.007506823,0.00012894087,0.000069242786,0.000027395854,0.00043662582,0.0070456127,0.013918609,0.9099704,0.056811627,0.0010889636],"about_ca_topic_score_codex":0.000059217968,"about_ca_topic_score_gemma":0.000005161261,"teacher_disagreement_score":0.049944945,"about_ca_system_score_codex":0.00007125032,"about_ca_system_score_gemma":0.000008062168,"threshold_uncertainty_score":0.9999985},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9874796,0.000042967327,0.00019318514,0.00045138723,0.0002158706,0.0003360665,0.000007900615,0.00005915953,0.01121382],"genre_scores_gemma":[0.99902225,0.000006048109,0.0003520014,0.00007279868,0.0000039710535,0.00008582747,0.0000018302136,0.000019265477,0.00043600102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991249,0.000083619,0.00019683283,0.00017146576,0.00025887974,0.00016432801],"domain_scores_gemma":[0.99824005,0.0008304606,0.00013817269,0.0005753894,0.00013412177,0.00008179083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038697914,0.00013079667,0.0001812826,0.00003399414,0.00011028995,0.000018358687,0.00034980814,0.000050534458,0.00002663634],"category_scores_gemma":[0.00036673676,0.00007119602,0.000046551402,0.00036586166,0.00020674233,0.000068856425,0.00003574517,0.000146846,0.000024922467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021688215,0.00025133096,0.0004105128,0.000022149678,0.000035275545,0.0000020817192,0.00051764195,9.0700274e-7,0.000025726882,0.991216,0.0070981123,0.00020337384],"study_design_scores_gemma":[0.00059177435,0.00026269574,0.0001403502,0.00007251072,0.000043626,0.0000032057255,0.0003801226,0.000020293906,0.0045197937,0.9923191,0.0015361918,0.000110333596],"about_ca_topic_score_codex":0.0000065065656,"about_ca_topic_score_gemma":0.000044216493,"teacher_disagreement_score":0.011542615,"about_ca_system_score_codex":0.000019371771,"about_ca_system_score_gemma":0.00005696987,"threshold_uncertainty_score":0.29032895},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97222805,0.00001814155,0.0005370052,0.0008437104,0.0029396936,0.00019021824,0.0000025526092,0.00014741647,0.023093184],"genre_scores_gemma":[0.9950302,0.0000013543115,0.0025709865,0.0003939771,0.000035818164,0.000012901782,0.000001050094,0.00002966442,0.0019240411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990806,0.00008249176,0.00013872179,0.00021604421,0.0002223044,0.00025984066],"domain_scores_gemma":[0.9988172,0.00039396397,0.00005680411,0.00054095016,0.00005710116,0.00013400003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034716324,0.0001479742,0.00020982855,0.00006900868,0.00018832422,0.00007065786,0.00032586715,0.000089315516,0.000041166022],"category_scores_gemma":[0.0007379319,0.00012155775,0.00007506341,0.00014382826,0.00004191151,0.000074474956,0.00015060099,0.00013649973,0.000028212407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008225717,0.000025956348,0.00045593135,0.000015632613,0.000019175328,0.0000017908782,0.00047052727,3.7869683e-7,0.00014200847,0.98335993,0.014454717,0.0010457027],"study_design_scores_gemma":[0.00037189046,0.00009230756,0.00081812945,0.00001356923,0.000014269977,0.0000041642056,0.000041669955,0.000016408623,0.0012690205,0.96891814,0.028270127,0.00017029997],"about_ca_topic_score_codex":0.0000026617379,"about_ca_topic_score_gemma":0.0000026152331,"teacher_disagreement_score":0.02280213,"about_ca_system_score_codex":0.000022682363,"about_ca_system_score_gemma":0.000008243792,"threshold_uncertainty_score":0.49569812},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9922091,0.00052312406,0.00063272053,0.00019479105,0.0027712353,0.00070402445,0.0000031464733,0.00024873842,0.0027131191],"genre_scores_gemma":[0.9734125,0.00020207361,0.025514612,0.00021944381,0.00008071644,0.00010240798,0.0000036060244,0.00009688377,0.0003677311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981843,0.0001608307,0.00054893835,0.00035001585,0.00036417245,0.00039169524],"domain_scores_gemma":[0.9981432,0.0005092539,0.0002857116,0.0007532987,0.0001796446,0.00012888465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064894644,0.0003065552,0.0004034361,0.00006132579,0.00034749965,0.00008352825,0.0004214877,0.00016268878,0.00004989115],"category_scores_gemma":[0.0009752884,0.00023521887,0.000080566235,0.00023529504,0.00015002058,0.00041030868,0.00021848884,0.0002974344,0.00002853092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002545667,0.00012406765,0.0002965688,0.00006709076,0.00005255826,0.0000069331763,0.0025418627,7.007329e-7,0.000650521,0.9951974,0.000806917,0.00022992118],"study_design_scores_gemma":[0.0012491824,0.00006689916,0.0003187217,0.000088054636,0.000069769645,0.000014552927,0.00028430004,0.00024204052,0.0044314573,0.9924228,0.0005105019,0.00030170468],"about_ca_topic_score_codex":0.00003765406,"about_ca_topic_score_gemma":0.000005404397,"teacher_disagreement_score":0.024881892,"about_ca_system_score_codex":0.00008157708,"about_ca_system_score_gemma":0.000051393035,"threshold_uncertainty_score":0.9591947},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9923328,0.00064811157,0.00029856636,0.0031765953,0.0027925712,0.00017230463,9.760353e-7,0.00014232517,0.00043573172],"genre_scores_gemma":[0.9992087,0.00009810586,0.0004825728,0.000052166728,7.5830695e-7,0.000011574608,4.6678076e-7,0.000005856087,0.00013980211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891734,0.00008727899,0.00023678415,0.00026315657,0.00028033898,0.00021509486],"domain_scores_gemma":[0.9987274,0.00018897616,0.00012963446,0.00071075483,0.00018447005,0.000058773665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005205446,0.000092773866,0.00010758388,0.00004779964,0.00019685774,0.00003237838,0.00044496325,0.000029726807,0.000003196989],"category_scores_gemma":[0.00010107149,0.000047759127,0.000057246914,0.00030914825,0.00013017173,0.00021265828,0.0001417075,0.000050191367,0.00004026187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005570945,0.000046646823,0.0013590094,0.0000030270257,0.00000855264,9.618225e-7,0.000049647264,0.00000103358,0.021655569,0.963325,0.0026764397,0.010868534],"study_design_scores_gemma":[0.00042374985,0.00010585013,0.0027750044,0.000041219493,0.0000040817345,0.0000032172202,0.0000032665416,0.00010542144,0.04621124,0.94921106,0.0010320821,0.00008380274],"about_ca_topic_score_codex":0.00001278934,"about_ca_topic_score_gemma":0.0000018599142,"teacher_disagreement_score":0.02455567,"about_ca_system_score_codex":0.000012385537,"about_ca_system_score_gemma":0.000033952743,"threshold_uncertainty_score":0.19475608},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9966542,0.0002928466,0.0004998395,0.0004631037,0.0011384309,0.00025061352,0.00003235444,0.00007254741,0.0005960635],"genre_scores_gemma":[0.99820995,0.000017367283,0.0006104613,0.00009818972,0.000031075888,0.00007119461,0.000004119809,0.000020659962,0.0009369652],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861723,0.00005639639,0.00031043967,0.00035031588,0.000290543,0.00037506703],"domain_scores_gemma":[0.9990591,0.00019738342,0.00018154872,0.00034866153,0.00008344458,0.00012988545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059921306,0.00017259034,0.00029137664,0.00010869689,0.00014391239,0.000054687665,0.00039862725,0.00009273518,0.0006500948],"category_scores_gemma":[0.00015370063,0.000111348236,0.00016379857,0.0001828686,0.00011487401,0.00017211917,0.000094528834,0.00004107011,0.00023135982],"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.00019079773,0.00015310677,0.0045002173,0.000026634476,0.00005833496,0.000019939014,0.00033110383,8.026894e-7,0.5530026,0.42952535,0.003171019,0.009020143],"study_design_scores_gemma":[0.004690566,0.0003982825,0.016835213,0.00008600562,0.00017805841,0.000010228783,0.00016711169,0.000029581925,0.28812447,0.68200535,0.0069281543,0.0005469474],"about_ca_topic_score_codex":0.000084157036,"about_ca_topic_score_gemma":0.00003089183,"teacher_disagreement_score":0.2648781,"about_ca_system_score_codex":0.000042335712,"about_ca_system_score_gemma":0.000037916554,"threshold_uncertainty_score":0.71180826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94611835,0.00016756296,0.014432015,0.0008221138,0.0006464268,0.00027528452,0.0000015867313,0.0005112123,0.037025418],"genre_scores_gemma":[0.9500166,0.000006969251,0.04972138,0.00014014958,0.0000031515576,0.000008000362,0.0000023885577,0.00001338444,0.00008796866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981391,0.00011247857,0.00021630734,0.0005094837,0.0004625246,0.000560131],"domain_scores_gemma":[0.9985099,0.00019895448,0.00011158662,0.00084003806,0.00016205448,0.00017749945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043664526,0.00019992076,0.00022836847,0.00012390973,0.00028140255,0.00017167647,0.0010607841,0.0000680983,0.0000153793],"category_scores_gemma":[0.000084044535,0.00018297278,0.00006134666,0.0010807674,0.0001708379,0.00046813404,0.00016297393,0.0003301285,0.000070621616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015097309,0.000033974582,0.013959635,0.000003310043,0.000013554798,0.00007418993,0.00012621556,0.00000953969,0.00012993932,0.97282994,0.00008942206,0.0127151925],"study_design_scores_gemma":[0.00080924854,0.00021140806,0.0018905309,0.000046148496,0.000004113414,0.00016294845,0.0001228404,0.00041709866,0.0021109595,0.99383265,0.0001314766,0.00026057148],"about_ca_topic_score_codex":0.000006490026,"about_ca_topic_score_gemma":0.00000345813,"teacher_disagreement_score":0.03693745,"about_ca_system_score_codex":0.000060191578,"about_ca_system_score_gemma":0.00008385662,"threshold_uncertainty_score":0.7461414},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9874173,0.00024146248,0.0067001604,0.00017811055,0.0022527673,0.00015433693,0.0000018695323,0.00009828629,0.0029557259],"genre_scores_gemma":[0.9983708,0.000019088753,0.0012475419,0.00013013871,0.000035658664,0.000011773845,8.31736e-7,0.000009921662,0.00017420406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988168,0.00006865531,0.00025748913,0.00036304485,0.0002440032,0.00025004626],"domain_scores_gemma":[0.99893904,0.00008520719,0.00012823688,0.00046784015,0.00029432436,0.000085378764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021856373,0.00015483978,0.00027431428,0.000053341162,0.00014875155,0.0000974431,0.0004506705,0.00007491585,0.00000823579],"category_scores_gemma":[0.000025563952,0.00011948696,0.000035034853,0.0003114102,0.00017353465,0.00042630592,0.000112933274,0.00010561926,0.00001789413],"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.0001655117,0.00029039333,0.037242483,0.00014715263,0.00015579269,0.000023143857,0.0060164127,0.00015360783,0.0063364785,0.9281673,0.0070046578,0.014297095],"study_design_scores_gemma":[0.014517845,0.008028018,0.14981042,0.0019360133,0.00012186592,0.0004987408,0.0016765479,0.4852249,0.10965837,0.14547375,0.07978379,0.0032697506],"about_ca_topic_score_codex":0.00008843176,"about_ca_topic_score_gemma":0.000031310385,"teacher_disagreement_score":0.7826935,"about_ca_system_score_codex":0.000021815527,"about_ca_system_score_gemma":0.000033770586,"threshold_uncertainty_score":0.4872537},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.870219,0.0005234683,0.024128284,0.011243108,0.003938377,0.0022475757,0.0010459616,0.0001322348,0.08652203],"genre_scores_gemma":[0.99788266,0.00003214091,0.00060897454,0.00000840624,0.00006330712,0.000044487533,0.000008941781,0.000028749047,0.0013223046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988148,0.000023152468,0.00041681412,0.00028731916,0.00015513822,0.00030275527],"domain_scores_gemma":[0.99883616,0.00025544447,0.00017308998,0.0004912477,0.00014361132,0.00010042255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012284856,0.00019853404,0.00034995284,0.000029582683,0.00009279222,0.0000138022615,0.00025036524,0.000059182465,0.00038333028],"category_scores_gemma":[0.00003392878,0.00013828419,0.00013784092,0.00022583583,0.00023889008,0.00014035417,0.00005345433,0.00009216915,0.00021983788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027766808,0.000359117,0.00007723719,0.000054518507,0.00005345541,2.1429734e-7,0.00019272133,3.9130973e-7,0.00599091,0.9570686,0.00051993545,0.035655137],"study_design_scores_gemma":[0.0010601636,0.00007547039,0.000068126705,0.00010904529,0.00005164598,2.837331e-7,0.00012113173,0.0000036289803,0.06378691,0.9148058,0.019733131,0.00018466239],"about_ca_topic_score_codex":0.0000071907953,"about_ca_topic_score_gemma":1.7617916e-7,"teacher_disagreement_score":0.12766372,"about_ca_system_score_codex":0.000032598826,"about_ca_system_score_gemma":0.00008697411,"threshold_uncertainty_score":0.56390655},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99183494,0.000027413264,0.0038481026,0.00017206106,0.0011779902,0.00017370966,0.0000011251907,0.00011907319,0.0026455752],"genre_scores_gemma":[0.99802816,0.0000028649047,0.0017971318,0.000053463333,0.0000069341445,0.000013063795,8.579616e-7,0.000010187562,0.0000873297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880815,0.00009261414,0.00019177311,0.00029291873,0.00035967675,0.00025487473],"domain_scores_gemma":[0.9987549,0.00017983223,0.0000913687,0.00070664333,0.00018385121,0.000083366096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028882906,0.00011411534,0.00016342298,0.00020519308,0.00012018943,0.000030872754,0.00060186203,0.000052341962,0.000021294942],"category_scores_gemma":[0.00012258416,0.00010756224,0.00006598604,0.00076073274,0.000238646,0.00029545385,0.00016678337,0.00012534337,0.00009067184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001927771,0.00009668958,0.0003171437,0.000010614567,0.000015647971,0.000003929823,0.00039399395,0.000009005505,0.0029864325,0.99330044,0.0002634985,0.0025833107],"study_design_scores_gemma":[0.000501517,0.00081007736,0.0044658836,0.00003117686,0.0000025746272,0.00000979409,0.00004014612,0.0045025605,0.044193223,0.9452783,0.000044792054,0.00011998734],"about_ca_topic_score_codex":0.000010194298,"about_ca_topic_score_gemma":8.719301e-7,"teacher_disagreement_score":0.04802219,"about_ca_system_score_codex":0.000034733566,"about_ca_system_score_gemma":0.000032957076,"threshold_uncertainty_score":0.4386261},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9856237,0.00031877335,0.005200516,0.000006193393,0.003656401,0.00019027112,0.00001249572,0.0003270199,0.0046645864],"genre_scores_gemma":[0.9997703,0.000017276738,0.00010504225,0.000008262271,0.0000100203915,0.000011845192,0.000014365035,0.00002974147,0.000033154523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991175,0.000080029706,0.00029756522,0.00013744594,0.00015993995,0.00020750785],"domain_scores_gemma":[0.99938756,0.000104122315,0.000066801214,0.0003026973,0.000062891035,0.000075944416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025985236,0.00014631564,0.0002465386,0.00024760253,0.000048549788,0.000018016266,0.00017863915,0.0000848853,0.000017792732],"category_scores_gemma":[0.00005679031,0.00014987242,0.00008504431,0.000752644,0.00003865535,0.000107971835,0.000018146307,0.000100243255,0.000051495197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046948717,0.000054722637,0.012768846,0.00012952978,0.00005423267,6.0136904e-7,0.00019956834,0.0007387425,0.013811859,0.97123516,0.00026263052,0.00073942647],"study_design_scores_gemma":[0.0052485415,0.00044448994,0.1073405,0.00029022418,0.0001311244,0.000010559516,0.00015659285,0.11298047,0.05880637,0.68400824,0.029187541,0.0013953192],"about_ca_topic_score_codex":0.0000154052,"about_ca_topic_score_gemma":0.00000268485,"teacher_disagreement_score":0.2872269,"about_ca_system_score_codex":0.000018592902,"about_ca_system_score_gemma":0.0000041363,"threshold_uncertainty_score":0.611162},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9958538,0.00015683564,0.000016190874,0.000009644721,0.0024127506,0.00014118208,0.000009040222,0.000026912148,0.0013736772],"genre_scores_gemma":[0.9998481,9.921467e-7,0.00005549033,0.0000061807523,0.0000071803543,0.0000060243815,6.3926694e-7,0.000013948654,0.00006143931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993866,0.000045905,0.00023395958,0.00005282121,0.00013962325,0.00014108242],"domain_scores_gemma":[0.9994975,0.000052886302,0.000063821244,0.00029736187,0.000049236754,0.000039219125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014403998,0.000084840685,0.00018728552,0.00005564737,0.000019021696,0.0000024031192,0.00019696122,0.00005537522,0.00003659535],"category_scores_gemma":[0.000038962975,0.000063419255,0.00006115616,0.00031388673,0.00003845687,0.0000485472,0.000037446534,0.000056004064,0.000002334496],"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.000007683916,0.000023235358,0.03421476,0.00016503545,0.000038848637,6.498793e-8,0.0029737642,0.0012648688,0.019611534,0.9411009,0.00045397802,0.00014534377],"study_design_scores_gemma":[0.000758327,0.000092205206,0.21993865,0.00012841771,0.000041011088,0.000001993978,0.0007317339,0.00032179628,0.44673842,0.32891935,0.002082849,0.00024523673],"about_ca_topic_score_codex":0.000049347393,"about_ca_topic_score_gemma":0.0000044729563,"teacher_disagreement_score":0.61218154,"about_ca_system_score_codex":0.000007961433,"about_ca_system_score_gemma":0.0000066928105,"threshold_uncertainty_score":0.2586162},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99818605,0.0003692889,0.000052632757,0.000096285585,0.00044933538,0.00046564892,0.000011329366,0.000021570195,0.0003478326],"genre_scores_gemma":[0.996756,0.000037087328,0.002439493,0.000021148762,0.00004969644,0.00004451583,0.000005947552,0.00003152328,0.0006145642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988762,0.00006539397,0.00032212166,0.00014250823,0.0002224699,0.00037132058],"domain_scores_gemma":[0.9987817,0.0006659535,0.00010373679,0.00025482848,0.000083767605,0.00011003552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010777193,0.00012483899,0.00031053938,0.00010481381,0.000036878704,0.000009542239,0.00014543791,0.000088867724,0.000019181096],"category_scores_gemma":[0.0007283178,0.0001147124,0.00006126354,0.00017527417,0.000072524315,0.00021304096,0.00009820417,0.00011478536,0.000006428995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103821745,0.0004194899,0.025638247,0.00030849004,0.00007343009,0.0000019508861,0.000975895,3.9473747e-7,0.0007912208,0.9699267,0.0014278514,0.00033249948],"study_design_scores_gemma":[0.0017464719,0.00010198865,0.0005030146,0.000073890784,0.000033301865,0.0000041012877,0.00021609222,0.0002902831,0.005468822,0.9911009,0.00033544487,0.00012567666],"about_ca_topic_score_codex":0.00002902166,"about_ca_topic_score_gemma":0.000008874444,"teacher_disagreement_score":0.025135234,"about_ca_system_score_codex":0.00005855618,"about_ca_system_score_gemma":0.000027649035,"threshold_uncertainty_score":0.46778357},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9869007,0.00023968842,0.000008704554,0.000033839966,0.00050047867,0.000103218576,0.000008940898,0.000011063102,0.0121933995],"genre_scores_gemma":[0.99941194,0.0000057819193,0.0000868085,0.0000043765854,0.0000052631594,0.0000044777885,0.0000054363195,0.000006601279,0.00046929566],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995182,0.000021107351,0.0001461499,0.00012164656,0.000069978254,0.00012289472],"domain_scores_gemma":[0.9996755,0.00006674737,0.00006652635,0.00012399378,0.00002683697,0.000040361934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004839847,0.00008697624,0.00020047814,0.000022893206,0.000055617696,0.000005170409,0.000065870336,0.000027757598,0.00008423122],"category_scores_gemma":[0.0000016049892,0.00007420344,0.000045827997,0.00006406743,0.000050789327,0.00004786886,0.00005724702,0.00010815958,0.00003654699],"study_design_candidate":"observational","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.000011673783,0.00012576603,0.6382426,0.0000136880335,0.00009176207,3.4299427e-7,0.0005607943,0.000009760482,0.000501488,0.35441297,0.00048222425,0.0055469167],"study_design_scores_gemma":[0.010897826,0.0012863592,0.31223837,0.0002997278,0.00024714126,0.0000012897067,0.0060903537,0.00094023766,0.01409658,0.54122955,0.11116433,0.0015082285],"about_ca_topic_score_codex":0.00011664968,"about_ca_topic_score_gemma":6.5701175e-7,"teacher_disagreement_score":0.32600424,"about_ca_system_score_codex":0.00001030134,"about_ca_system_score_gemma":0.0000107689,"threshold_uncertainty_score":0.30259284},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98721004,0.00052394153,0.0000068240697,0.000036805683,0.00053483574,0.00014357701,0.0000028460895,0.00024960155,0.011291552],"genre_scores_gemma":[0.999356,0.000037876536,0.000023880915,0.000031327912,0.000012254725,0.000019155972,7.5099587e-7,0.000036643785,0.00048211153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992494,0.000028350385,0.00014278412,0.00017353044,0.00015204561,0.0002539096],"domain_scores_gemma":[0.9995084,0.00009594094,0.000029171226,0.0002353339,0.00002975718,0.00010138966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009561375,0.00016810583,0.000201318,0.00004384578,0.000076404336,0.000047231475,0.00011483439,0.00009271667,0.00007380204],"category_scores_gemma":[0.000017293214,0.00015849838,0.000029152598,0.00019194752,0.000055428718,0.00012865235,0.00002371651,0.00017334167,0.000049389335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009199727,0.00037624958,0.04476408,0.00056308444,0.0007581637,0.00016474495,0.008878649,0.0013293673,0.0042264485,0.92356527,0.012285356,0.002996584],"study_design_scores_gemma":[0.015669337,0.0016292194,0.07538775,0.0011453282,0.00033832897,0.00046156993,0.002233475,0.035140496,0.012448027,0.8267388,0.02479064,0.004017064],"about_ca_topic_score_codex":0.000012810816,"about_ca_topic_score_gemma":0.000004496906,"teacher_disagreement_score":0.09682651,"about_ca_system_score_codex":0.000024104358,"about_ca_system_score_gemma":0.0000028289126,"threshold_uncertainty_score":0.6463377},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93420154,0.022313247,0.015645439,0.011316065,0.0054407967,0.00042061912,0.000046015168,0.0007224211,0.009893884],"genre_scores_gemma":[0.9801129,0.0017721228,0.015232917,0.0006701953,0.00017916536,0.00005407429,0.000009204219,0.00008015329,0.0018892478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936892,0.0016221129,0.0011971067,0.0010764577,0.0007395635,0.0016755518],"domain_scores_gemma":[0.99555093,0.0017054264,0.0003965404,0.0012886621,0.00064733723,0.00041112237],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024329633,0.0007167994,0.0007077261,0.00029606346,0.000859924,0.001233261,0.0019537904,0.0006202766,0.00026057262],"category_scores_gemma":[0.00078362296,0.0008036971,0.00047598637,0.0012278333,0.0021405225,0.0017453162,0.00073831424,0.0009282247,0.00017836761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021225154,0.0010990845,0.017100012,0.00011002551,0.00008736427,0.00037527664,0.0046988116,0.00016501888,0.00032281192,0.86240655,0.007575857,0.10603794],"study_design_scores_gemma":[0.00030765226,0.00029235956,0.02180755,0.00031889701,0.00006933866,0.0001412941,0.0006693456,0.0037037183,0.06813523,0.88565814,0.018082544,0.00081393094],"about_ca_topic_score_codex":0.010220927,"about_ca_topic_score_gemma":0.00093689177,"teacher_disagreement_score":0.105224006,"about_ca_system_score_codex":0.00035828596,"about_ca_system_score_gemma":0.00040903743,"threshold_uncertainty_score":0.99980354},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9975858,0.00011231412,0.00013437241,0.000011839457,0.0003235287,0.000033675635,0.0000054948564,0.00003659327,0.0017564223],"genre_scores_gemma":[0.9996442,0.00013935879,0.00017205116,0.0000032708813,0.0000018478356,0.0000015619908,0.000008000206,0.000006491553,0.000023173632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964464,0.0000065017557,0.00016659351,0.000047616308,0.000075709315,0.00005892721],"domain_scores_gemma":[0.99976605,0.0000121523035,0.000043033968,0.00010693008,0.000053050902,0.000018757582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000018836376,0.000051790197,0.00012416419,0.00006461272,0.000014214686,0.0000030805934,0.000061604514,0.000029298122,0.00017862783],"category_scores_gemma":[0.000010648408,0.000048944723,0.000046168774,0.00034683998,0.000016520273,0.000060502465,0.0000068899017,0.0000314256,0.0000027987317],"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.0000047855087,0.0001708584,0.04938291,0.00019968633,0.00031603212,0.0000015368713,0.0009209824,0.041578993,0.08511505,0.8148834,0.0015319225,0.0058938074],"study_design_scores_gemma":[0.0010826988,0.00010402155,0.24478553,0.000060388884,0.00017039951,0.0000021335122,0.000044090044,0.53031766,0.12075896,0.10173521,0.00047171192,0.0004671888],"about_ca_topic_score_codex":0.0000058516484,"about_ca_topic_score_gemma":4.843962e-7,"teacher_disagreement_score":0.71314824,"about_ca_system_score_codex":0.000007089855,"about_ca_system_score_gemma":9.4657327e-7,"threshold_uncertainty_score":0.19959079},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98319906,0.00021191422,0.00014279288,0.0028210157,0.00029841653,0.00062555604,0.0000035820462,0.00012289934,0.012574774],"genre_scores_gemma":[0.99888074,0.000032187585,0.00038517162,0.00028924638,0.000013851716,0.000020668365,0.0000013305757,0.00002158803,0.00035522948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984387,0.0004163784,0.00022413739,0.00023686145,0.00033387507,0.0003500336],"domain_scores_gemma":[0.99732333,0.001990722,0.00006056043,0.00043010045,0.00009731045,0.00009794569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015354868,0.00016979879,0.00027549284,0.00006594548,0.00022967183,0.00007543284,0.00030119988,0.00008878892,0.00003501743],"category_scores_gemma":[0.00058386364,0.00011542012,0.00007593506,0.0002481654,0.00031908264,0.00010582389,0.000056010103,0.00033399934,0.00004331462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002010241,0.00010434367,0.000051566545,0.000012688856,0.000032247077,0.00001786842,0.0019125696,1.9208558e-7,0.00050625036,0.99507964,0.0013777362,0.0007038536],"study_design_scores_gemma":[0.0028007224,0.00018676503,0.00070598244,0.000024141196,0.0000360536,0.000028894297,0.00030331427,0.00015929443,0.0009884865,0.9944887,0.00013291983,0.0001446875],"about_ca_topic_score_codex":0.0000066530793,"about_ca_topic_score_gemma":0.0000024457427,"teacher_disagreement_score":0.015681677,"about_ca_system_score_codex":0.000034544926,"about_ca_system_score_gemma":0.000028851928,"threshold_uncertainty_score":0.47066963},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9921293,0.00020115661,0.000025042384,0.000040299095,0.0020147946,0.00018320796,0.000042289208,0.00018523446,0.005178624],"genre_scores_gemma":[0.99969894,0.000017568564,0.0001395982,0.000036075762,0.000020474758,0.00001889623,0.000007394258,0.000024087643,0.00003695788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991727,0.000060971553,0.00025004966,0.00013746852,0.00013409203,0.00024470428],"domain_scores_gemma":[0.99946475,0.00008893543,0.000055142056,0.00027526016,0.00004358124,0.00007234961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015356917,0.00014580751,0.00023319887,0.00010086032,0.000075846365,0.000010142014,0.000150284,0.00008679096,0.000039528673],"category_scores_gemma":[0.000019109635,0.00015491887,0.00007561821,0.00018580059,0.00004797755,0.00010890791,0.000016454513,0.00015727922,0.00009613333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015054009,0.000065999026,0.00052860286,0.000036348494,0.00007353425,0.0000029311075,0.0003074372,0.0012444282,0.0040550814,0.9911274,0.0022240803,0.00031914088],"study_design_scores_gemma":[0.004230048,0.0003506219,0.003822734,0.00030910806,0.00006761549,0.000054321008,0.0004868835,0.004030417,0.073196694,0.89485085,0.017807811,0.0007928871],"about_ca_topic_score_codex":0.0000022676209,"about_ca_topic_score_gemma":0.0000019912995,"teacher_disagreement_score":0.09627651,"about_ca_system_score_codex":0.000049876202,"about_ca_system_score_gemma":0.000011466967,"threshold_uncertainty_score":0.63174087},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9880079,0.000078447716,0.0030418646,0.0005617631,0.0014021461,0.00046445514,0.000007591369,0.00041447917,0.006021321],"genre_scores_gemma":[0.9968105,0.00008006245,0.0022709093,0.0004208203,0.000011236957,0.00007493193,0.000003846088,0.00005799732,0.00026967688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963376,0.00018422832,0.00044351406,0.00090973714,0.0011360733,0.0009888762],"domain_scores_gemma":[0.9974142,0.00035240146,0.00017979497,0.0014973267,0.00017689637,0.00037938613],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00051218853,0.00042326213,0.00045686358,0.00024008524,0.00044128738,0.00029034796,0.002092248,0.00016701569,0.00008616206],"category_scores_gemma":[0.00014286414,0.00044648323,0.00024719266,0.001859618,0.0001811436,0.0011164694,0.0005879773,0.0006204873,0.0014290129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033951965,0.0004576774,0.0037379048,0.00004389769,0.00006826623,0.00006665834,0.00080656545,0.00009875501,0.001100302,0.9922997,0.00017430981,0.0011120175],"study_design_scores_gemma":[0.0020251917,0.00015176019,0.0043442254,0.00017469638,0.000009932037,0.000039240735,0.000045461315,0.00024502756,0.02083041,0.9715254,0.00011039989,0.0004982891],"about_ca_topic_score_codex":0.00006848611,"about_ca_topic_score_gemma":0.000010899858,"teacher_disagreement_score":0.020774327,"about_ca_system_score_codex":0.00019240304,"about_ca_system_score_gemma":0.000112556096,"threshold_uncertainty_score":0.9997987},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9854518,0.00094209175,0.000019292953,0.00001654553,0.0007816905,0.00017395351,0.000018526898,0.0002791021,0.012316984],"genre_scores_gemma":[0.998819,0.000025289572,0.000013478725,0.000029895975,0.000019618725,0.00002083091,0.000017274162,0.00005008506,0.0010045036],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900734,0.000033735298,0.00019454594,0.00024215307,0.00019575635,0.00032643814],"domain_scores_gemma":[0.9995097,0.00003716922,0.000040628893,0.00029055442,0.000029190767,0.0000927526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001228641,0.00023872773,0.0002599531,0.00009436224,0.00014599723,0.000050665414,0.00012173173,0.00010209023,0.000037612244],"category_scores_gemma":[0.0000026050325,0.00021543686,0.000040394898,0.00023203682,0.00007435745,0.00015801031,0.000024413648,0.00014894613,0.00006626394],"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.00012041563,0.00015585535,0.55467874,0.0005058144,0.0003602844,0.00012468516,0.00093754125,0.0009029469,0.010489925,0.39839682,0.03270569,0.00062129204],"study_design_scores_gemma":[0.011851812,0.00078121043,0.27374345,0.00084184407,0.00031960933,0.0010256394,0.00062880473,0.0016507435,0.046317838,0.62342656,0.035839878,0.0035726163],"about_ca_topic_score_codex":0.000058341786,"about_ca_topic_score_gemma":0.000045888835,"teacher_disagreement_score":0.28093526,"about_ca_system_score_codex":0.000037769532,"about_ca_system_score_gemma":0.000008223597,"threshold_uncertainty_score":0.878526},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96626234,0.000010040464,0.00961594,0.0013230774,0.00081325934,0.00022969196,0.0000010126553,0.000081552935,0.021663072],"genre_scores_gemma":[0.9988961,0.0000013430936,0.0007649473,0.00009802239,0.000007705679,0.000017500439,9.044811e-7,0.000009265359,0.00020416339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986904,0.0002525479,0.00016019825,0.0002358428,0.00043880547,0.00022219736],"domain_scores_gemma":[0.9981529,0.00082780834,0.00009174176,0.00073397637,0.0001427285,0.00005081792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078355824,0.000099067096,0.00012379127,0.000059434555,0.00012475159,0.000048265603,0.00078715343,0.000043378812,0.000025700447],"category_scores_gemma":[0.00040476554,0.00007234057,0.00006299646,0.00042829168,0.0000958619,0.00022367162,0.00020990892,0.00017543268,0.00013222612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009541764,0.000053256357,0.0005900339,0.000005621097,0.000006004249,0.0000012093342,0.00019465025,0.000038072092,0.0006569609,0.99166524,0.00026530583,0.006514076],"study_design_scores_gemma":[0.0003699987,0.00013060296,0.0052268906,0.000020145042,0.0000016834267,0.0000039673155,0.000022889952,0.004240704,0.014706626,0.97460777,0.00057545194,0.00009329692],"about_ca_topic_score_codex":0.000009490278,"about_ca_topic_score_gemma":0.0000011673648,"teacher_disagreement_score":0.032633796,"about_ca_system_score_codex":0.000032637497,"about_ca_system_score_gemma":0.000021095779,"threshold_uncertainty_score":0.29499626},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.917574,0.00091244397,0.000010840427,0.000018718143,0.0025256665,0.00009447264,0.0000019466797,0.0004481681,0.078413755],"genre_scores_gemma":[0.99916697,0.00002203569,0.000012156123,0.000016335174,0.000013152985,0.000016811115,0.0000016090216,0.000028624656,0.00072228373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993952,0.000035125828,0.00014064531,0.000110757464,0.00010824182,0.00021002028],"domain_scores_gemma":[0.99961346,0.000045302117,0.0000140925695,0.00024579398,0.0000144594105,0.000066881774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010306337,0.00012001509,0.00013282751,0.00007679168,0.000060700393,0.000026694772,0.0001340777,0.00006776615,0.0004894903],"category_scores_gemma":[0.000013416337,0.00012214326,0.00006199288,0.00024600737,0.000020309684,0.00008021962,0.000012199616,0.0001279069,0.0007642052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031197935,0.00006195835,0.0037889024,0.00008468191,0.00006107271,0.000024480325,0.0010842109,0.00057676854,0.0022432122,0.95899695,0.029720303,0.003354313],"study_design_scores_gemma":[0.004122771,0.0004187237,0.009706992,0.00023345536,0.00008373735,0.00006856162,0.0005442948,0.08978439,0.017350182,0.7170059,0.15865278,0.0020282187],"about_ca_topic_score_codex":0.0000032976243,"about_ca_topic_score_gemma":7.617633e-7,"teacher_disagreement_score":0.24199109,"about_ca_system_score_codex":0.000024513745,"about_ca_system_score_gemma":0.000001194634,"threshold_uncertainty_score":0.98225665},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933675,0.00048516307,0.0002729432,0.00054564636,0.002374277,0.00012519625,8.813206e-7,0.0001579046,0.0026704746],"genre_scores_gemma":[0.99776626,0.000031013467,0.0019132522,0.00004209736,6.063786e-7,0.00001081322,0.0000013462188,0.000009169391,0.00022543562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987487,0.00006777765,0.00032337394,0.00026003018,0.00030571554,0.00029438973],"domain_scores_gemma":[0.99885887,0.00019629234,0.00015205269,0.00061517523,0.00012610694,0.00005150343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004859898,0.00012354732,0.00015055061,0.00007467066,0.000271939,0.000085947795,0.00076273107,0.000056216948,0.0000017625513],"category_scores_gemma":[0.000028766377,0.000093762144,0.000093592535,0.00061320217,0.00012959703,0.0001471794,0.00016055086,0.0001267998,0.000019791727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029283492,0.000054075033,0.0017071709,0.0000053092695,0.0000108323,0.000003363016,0.000053897966,0.00010033239,0.0016767072,0.9945438,0.0012534782,0.00058809435],"study_design_scores_gemma":[0.00043105008,0.000052325355,0.0023674387,0.000018347586,0.0000059537224,0.000005463268,0.000015349067,0.0064339465,0.0024771525,0.9876223,0.00045176776,0.00011891303],"about_ca_topic_score_codex":0.00029786918,"about_ca_topic_score_gemma":0.000033247317,"teacher_disagreement_score":0.0069215186,"about_ca_system_score_codex":0.000022822602,"about_ca_system_score_gemma":0.000042491945,"threshold_uncertainty_score":0.38235092},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9891099,0.00016015969,0.0034473478,0.000121353216,0.0007317617,0.00018139306,0.0000013411599,0.00015156175,0.006095207],"genre_scores_gemma":[0.99415934,0.000035211324,0.0055373637,0.000044243883,0.0000020874486,0.000011815104,9.544385e-7,0.000012706225,0.00019626171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985143,0.00011027254,0.00025725627,0.0002973369,0.0004779842,0.00034283623],"domain_scores_gemma":[0.99859643,0.00019732528,0.00010594823,0.00084457884,0.00012718317,0.00012852292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027040963,0.00013149383,0.0002276862,0.0001842045,0.00015175166,0.000017827639,0.0011810599,0.00005182177,0.000024141384],"category_scores_gemma":[0.00009192481,0.00012968083,0.00010045916,0.0010772857,0.00028327171,0.00046229735,0.00027556345,0.0001628785,0.00008492772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053615713,0.00010348707,0.0041917423,0.000018319975,0.000018972041,0.000043026008,0.0005249781,0.00000831518,0.001254085,0.99234325,0.00072566204,0.00076282275],"study_design_scores_gemma":[0.00061009976,0.00013417349,0.006883877,0.000021040214,0.0000023201653,0.00007100368,0.000019955343,0.00068893214,0.008728703,0.98245686,0.0002251615,0.00015789089],"about_ca_topic_score_codex":0.000018696264,"about_ca_topic_score_gemma":0.0000011990388,"teacher_disagreement_score":0.009886384,"about_ca_system_score_codex":0.00003068449,"about_ca_system_score_gemma":0.00007943057,"threshold_uncertainty_score":0.52882314},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98470193,0.000083113104,0.005824257,0.0009325474,0.0009803445,0.00044951367,0.000002830065,0.00020138649,0.0068240603],"genre_scores_gemma":[0.9930912,0.000008004831,0.0061591812,0.000104060746,0.000012747529,0.00005313293,0.0000025657407,0.000026194066,0.00054286164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757946,0.00023031581,0.00026867972,0.0006367309,0.00065823336,0.00062656484],"domain_scores_gemma":[0.9977032,0.00026759392,0.00011601798,0.0014547665,0.00028766386,0.00017075155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074462197,0.0002272446,0.00024079136,0.00038809047,0.00025813066,0.000093192,0.0018870804,0.00010160815,0.000024814664],"category_scores_gemma":[0.00020009922,0.00020548308,0.000060952403,0.0015722977,0.00042510492,0.0007677916,0.0008207951,0.00025317978,0.00014009436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015126275,0.000131765,0.017196633,0.000011840901,0.000016874656,0.00007794566,0.0005304562,0.000004283653,0.00075657666,0.9722551,0.0014943647,0.007372899],"study_design_scores_gemma":[0.0029233247,0.0007092251,0.026637318,0.0000529783,0.000004055426,0.00003851574,0.000040458483,0.0027736,0.0039478964,0.9618202,0.0007339101,0.00031853572],"about_ca_topic_score_codex":0.000024708832,"about_ca_topic_score_gemma":0.00032835102,"teacher_disagreement_score":0.010434915,"about_ca_system_score_codex":0.00019502926,"about_ca_system_score_gemma":0.000086819484,"threshold_uncertainty_score":0.8379357},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99553293,0.00024128059,0.00016700277,0.00034433717,0.0014499286,0.00011865974,0.0000015478752,0.0001975213,0.0019467922],"genre_scores_gemma":[0.991953,0.000069969894,0.0072510904,0.00052243087,6.8659574e-7,0.0000067419433,0.0000027802128,0.000014044456,0.00017925615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842656,0.00008186584,0.00035233272,0.00040589678,0.0004300476,0.0003032999],"domain_scores_gemma":[0.998647,0.00010936375,0.00016285286,0.00075743214,0.00020183163,0.00012154781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026523523,0.00018095147,0.00028324506,0.00022913984,0.00016900609,0.000026519627,0.00067385193,0.000071292496,0.000015049035],"category_scores_gemma":[0.000065321576,0.00016360638,0.00013647799,0.0006684352,0.00013301121,0.0001899448,0.00014418967,0.0001522368,0.00009551064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009550619,0.00016329756,0.00087312376,0.000007663359,0.000021165668,0.000028737124,0.00027509013,0.00005539896,0.004901944,0.98866075,0.0048194244,0.00018385456],"study_design_scores_gemma":[0.0014494768,0.00023670874,0.0008975013,0.000032109274,0.0000076226524,0.000029920986,0.0000034999166,0.0024348053,0.011391055,0.9831144,0.00019118568,0.00021171686],"about_ca_topic_score_codex":0.000071295464,"about_ca_topic_score_gemma":4.8437676e-7,"teacher_disagreement_score":0.007084088,"about_ca_system_score_codex":0.000013154762,"about_ca_system_score_gemma":0.000057046847,"threshold_uncertainty_score":0.6671675},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9953099,0.001484064,0.0003313902,0.000018152197,0.0008953874,0.00032126784,0.000009286948,0.00026517737,0.0013653701],"genre_scores_gemma":[0.99934196,0.000110050634,0.00022458096,0.000019655263,0.000010625831,0.000085578235,0.000012212877,0.000042752123,0.00015260333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922484,0.00002643115,0.00017195131,0.0001864859,0.00011469552,0.00027561266],"domain_scores_gemma":[0.9994895,0.000112691174,0.00003092013,0.00021331271,0.000042580774,0.00011103637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013657926,0.00019216226,0.00023436053,0.00010683488,0.00016724282,0.000021229795,0.00012237491,0.00007561475,0.000016841524],"category_scores_gemma":[0.000011950482,0.0001663537,0.00004393582,0.00025049644,0.00010777847,0.00015248709,0.000012323322,0.00009791939,0.0000064086066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002834067,0.00018982864,0.036438733,0.0004964582,0.0005546549,0.000072223746,0.0017830466,0.0007132246,0.010936737,0.9275104,0.019989545,0.0010317704],"study_design_scores_gemma":[0.021314597,0.004130811,0.050938316,0.0005500392,0.0005796961,0.0007358905,0.0010584551,0.0051958016,0.06672047,0.79489166,0.05009917,0.003785099],"about_ca_topic_score_codex":0.000011297616,"about_ca_topic_score_gemma":0.000006257385,"teacher_disagreement_score":0.13261871,"about_ca_system_score_codex":0.000010773294,"about_ca_system_score_gemma":0.000009545079,"threshold_uncertainty_score":0.67837065},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46987322,0.0017833733,0.4703427,0.0006763548,0.0016965071,0.0026946578,0.000016603719,0.0005984587,0.052318133],"genre_scores_gemma":[0.97664726,0.00000955342,0.022940507,0.00003307206,0.0000011308833,0.000088106244,9.3274656e-7,0.0000150408505,0.0002643899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985328,0.0001328718,0.00020884928,0.00036015018,0.00044511395,0.00032025442],"domain_scores_gemma":[0.99801433,0.000145834,0.000111166686,0.0014150371,0.00018948625,0.00012414718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004142165,0.00013674158,0.00018625215,0.00019831018,0.0001008203,0.000039455037,0.0014024428,0.000047560345,0.00001154503],"category_scores_gemma":[0.00008242817,0.000120819685,0.000056606023,0.0012772308,0.00018757873,0.00034168686,0.00015917525,0.0001677942,0.000019302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016214444,0.00010414775,0.0017540295,0.000010476394,0.00001948073,0.0000038115875,0.00010293277,0.000009353904,0.0005054251,0.99615544,0.00020837063,0.0011103048],"study_design_scores_gemma":[0.0013368035,0.00024375442,0.0004521998,0.000009409219,0.0000037782868,0.0000130432345,0.000044798428,0.000057289428,0.00710183,0.9880316,0.0025587508,0.00014668758],"about_ca_topic_score_codex":0.0000036036913,"about_ca_topic_score_gemma":0.0000017565296,"teacher_disagreement_score":0.50677407,"about_ca_system_score_codex":0.0000281921,"about_ca_system_score_gemma":0.00009226772,"threshold_uncertainty_score":0.4926884},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9735552,0.000008613049,0.0049261004,0.00008636916,0.0019171059,0.0002597138,0.0000059217546,0.00016206448,0.019078875],"genre_scores_gemma":[0.99779266,0.0000013221794,0.0009849288,0.0000897385,0.000036744772,0.00002135915,0.000005186861,0.000030485038,0.0010375498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987668,0.00006147704,0.00029172274,0.00026094014,0.0003543167,0.0002647511],"domain_scores_gemma":[0.99895376,0.00026062079,0.000113159265,0.000437869,0.00011440578,0.000120200944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016865385,0.00016033155,0.00021495746,0.00006594001,0.00017312003,0.00004333495,0.0002130416,0.000107005224,0.000202312],"category_scores_gemma":[0.00029582775,0.00013772486,0.00007307097,0.00015229432,0.000081817954,0.00007692815,0.00006898813,0.00014672762,0.0004753261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019120876,0.00021015437,0.00018080397,0.000010623307,0.000020272244,0.0000036644726,0.00016807558,0.0000016082961,0.00026541727,0.9969486,0.00093836733,0.0012332733],"study_design_scores_gemma":[0.00074282684,0.00024838612,0.0015588446,0.0000440296,0.000012881408,0.0000023845373,0.000039746552,0.0007237218,0.00038342952,0.9955143,0.0005544721,0.00017499691],"about_ca_topic_score_codex":0.000026612604,"about_ca_topic_score_gemma":0.000050763534,"teacher_disagreement_score":0.024237448,"about_ca_system_score_codex":0.00009937923,"about_ca_system_score_gemma":0.000026270976,"threshold_uncertainty_score":0.61095136},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938416,0.00025450788,0.00022167013,0.0012037893,0.0012425015,0.000134722,0.0000012741538,0.00022930844,0.00287063],"genre_scores_gemma":[0.9911086,0.000027968405,0.0074800244,0.0012701886,6.826859e-7,0.000002817348,0.0000026128964,0.000008508301,0.00009861813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984902,0.000073952426,0.0003445906,0.00039852597,0.0003868966,0.0003058328],"domain_scores_gemma":[0.99873376,0.00007819134,0.0001595135,0.0007419353,0.0001693645,0.000117265605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003357745,0.00018023518,0.0002718678,0.00022677865,0.00009832691,0.00005958127,0.0006854565,0.000071135124,0.000010780282],"category_scores_gemma":[0.00005760093,0.00016181624,0.00013132834,0.00064024416,0.00005504977,0.00019392418,0.00007324016,0.00014786764,0.000059271144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010217766,0.0001796504,0.00012372337,0.000004494974,0.0000125328115,0.000009824027,0.00013658724,0.000052592026,0.009381982,0.98574054,0.002915918,0.0014319427],"study_design_scores_gemma":[0.0011980954,0.00040561598,0.0007596246,0.000038875223,0.000008690889,0.000005792744,0.000002894177,0.002574026,0.0101936385,0.9845051,0.00012122815,0.00018641348],"about_ca_topic_score_codex":0.000026198823,"about_ca_topic_score_gemma":2.9817645e-7,"teacher_disagreement_score":0.007258354,"about_ca_system_score_codex":0.000012983937,"about_ca_system_score_gemma":0.0000355292,"threshold_uncertainty_score":0.65986747},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82873297,0.00037645674,0.0047043907,0.0037407423,0.00076768274,0.0005230785,0.000018516963,0.00015278977,0.16098338],"genre_scores_gemma":[0.99821025,0.000004111684,0.0002777382,0.0001495562,0.000040573264,0.000023118377,0.0000051971188,0.0000068541153,0.0012825979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949867,0.000014601287,0.00013818791,0.00010651584,0.00008363037,0.00015839188],"domain_scores_gemma":[0.9995036,0.000114826784,0.000055387583,0.00025874857,0.000028901139,0.000038508057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008204283,0.00008536643,0.000102968996,0.000010958801,0.00024571773,0.00006251018,0.00020048511,0.00001455841,0.00022895414],"category_scores_gemma":[0.000010020483,0.000060655246,0.00006080277,0.000105962274,0.000047679132,0.00010743506,0.000036665173,0.00009229126,0.0000753696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012344942,0.00004160236,0.00013272814,0.0000011178491,0.0000076179244,1.1128001e-7,0.000111776855,0.0000039871497,0.00021711666,0.9948602,0.0021912153,0.002431297],"study_design_scores_gemma":[0.00013961758,0.000013960705,0.00040567742,0.000006846814,0.000008918971,2.670612e-7,0.00035039487,0.000040139003,0.0011865677,0.9941691,0.003599366,0.00007913738],"about_ca_topic_score_codex":0.000007883249,"about_ca_topic_score_gemma":1.2317984e-7,"teacher_disagreement_score":0.1694773,"about_ca_system_score_codex":0.000010004171,"about_ca_system_score_gemma":0.000012057278,"threshold_uncertainty_score":0.25068873},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9822316,0.000119176344,0.00800942,0.00012028193,0.0011184345,0.00015485032,0.0000016242825,0.000400203,0.007844364],"genre_scores_gemma":[0.99600846,0.000015512025,0.0036989702,0.00015151259,0.0000069549546,0.000019784631,0.0000027220567,0.000017065957,0.00007905132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985924,0.00015670898,0.00020143806,0.00041497906,0.0002811884,0.00035328476],"domain_scores_gemma":[0.99879587,0.0000935437,0.00010609061,0.00080172013,0.000060781276,0.00014202017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003183276,0.00020661432,0.00022221051,0.00013161938,0.00018888112,0.00007643686,0.0012322582,0.000061830884,0.00003286467],"category_scores_gemma":[0.000009858916,0.00017458425,0.00008474216,0.00042258704,0.00011472761,0.00046272136,0.00023826337,0.00018055803,0.00011790566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056557572,0.00039934093,0.023438409,0.000007891449,0.000057148492,0.000049410348,0.0015044754,5.428174e-7,0.00028726194,0.97139233,0.00021581983,0.0025907797],"study_design_scores_gemma":[0.001149489,0.0008973392,0.037290376,0.00006447433,0.000021431599,0.000043019383,0.00006665659,0.00083856494,0.0033656573,0.95400536,0.0018023035,0.00045531898],"about_ca_topic_score_codex":0.00011953677,"about_ca_topic_score_gemma":0.0000066502057,"teacher_disagreement_score":0.017386993,"about_ca_system_score_codex":0.000021656071,"about_ca_system_score_gemma":0.000029334215,"threshold_uncertainty_score":0.71193385},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914397,0.00015668845,0.0006329073,0.0006709699,0.00025421882,0.00017377916,0.0000035434814,0.000046538124,0.0066216844],"genre_scores_gemma":[0.99796844,0.0000051332045,0.001283954,0.00008441211,0.0000021608714,0.000013814873,7.2050966e-7,0.000010273841,0.00063107844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987301,0.0001405054,0.00012746465,0.0002678326,0.00047355084,0.00026053443],"domain_scores_gemma":[0.9988146,0.0001713561,0.00008088065,0.00061834726,0.00017369603,0.0001411511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006824776,0.00012064947,0.00016120191,0.00004790738,0.00008642989,0.00007254292,0.0007856385,0.000048651324,0.000016049591],"category_scores_gemma":[0.00003478927,0.00007682264,0.000024616682,0.00036527257,0.00021065709,0.00037514564,0.00040857977,0.00022210737,0.000024527777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034789377,0.00006890053,0.023151282,0.000010285796,0.000028809249,0.000020568064,0.0013126864,0.0000050019703,0.000110402034,0.972917,0.0014042428,0.00093601935],"study_design_scores_gemma":[0.0011391063,0.00018508552,0.010088993,0.000011240831,0.0000040178866,0.000057137528,0.00028071494,0.00023303549,0.0017855335,0.98364085,0.0024413904,0.00013290868],"about_ca_topic_score_codex":0.000013900346,"about_ca_topic_score_gemma":0.000054866734,"teacher_disagreement_score":0.013062288,"about_ca_system_score_codex":0.000023699951,"about_ca_system_score_gemma":0.000086086926,"threshold_uncertainty_score":0.31327364},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9670735,0.00069278356,0.023181366,0.0004446104,0.0013578224,0.00042565606,0.0000034572429,0.0002895584,0.006531275],"genre_scores_gemma":[0.996655,0.00018291696,0.0028460629,0.00012099806,0.0000033399003,0.000026051805,0.0000028161842,0.000022120006,0.00014073083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976726,0.00024544963,0.00036754165,0.00052784465,0.0006205403,0.0005660356],"domain_scores_gemma":[0.99782187,0.00022782867,0.00014373596,0.0013150742,0.00027377985,0.00021772356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007780805,0.00020810816,0.00031108852,0.00041445252,0.00014069874,0.000056769197,0.0017878674,0.00011131842,0.00002682257],"category_scores_gemma":[0.00012256284,0.00021114587,0.00020166181,0.001979772,0.00024737703,0.0005182594,0.00037753378,0.00032918018,0.000053087922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018093224,0.000159225,0.008470819,0.000019490748,0.000032986452,0.00007657882,0.00017954528,0.000020587004,0.0033045395,0.9848485,0.00019331116,0.002676318],"study_design_scores_gemma":[0.0006796885,0.0001969929,0.0039071986,0.000025210495,0.0000047091244,0.00003534147,0.000019774394,0.0005726935,0.008045267,0.98496395,0.0013283237,0.00022084589],"about_ca_topic_score_codex":0.000025393649,"about_ca_topic_score_gemma":0.0000028643558,"teacher_disagreement_score":0.02958149,"about_ca_system_score_codex":0.000036429075,"about_ca_system_score_gemma":0.00008674965,"threshold_uncertainty_score":0.8610279},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94528407,0.000023222872,0.00012560119,0.00012220637,0.00020288353,0.00014804267,0.0000022918573,0.000108408945,0.05398326],"genre_scores_gemma":[0.9958449,0.0000068711206,0.0012747966,0.00012427707,0.0000033893518,0.00002188544,0.0000043564287,0.000019390824,0.0027001104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929637,0.000081943705,0.00012369781,0.00016512681,0.00015024423,0.00018261312],"domain_scores_gemma":[0.9991925,0.00037471528,0.000040421408,0.00031297162,0.000032413453,0.000046984896],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017447412,0.00011342605,0.00013975837,0.000042684187,0.00014789414,0.000007851278,0.00011873574,0.0000641306,0.0014119181],"category_scores_gemma":[0.00007105459,0.00009153158,0.000033993954,0.00012451965,0.00010500325,0.000076623845,0.000008062946,0.00016429216,0.00020515909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000897847,0.00013566538,0.00015544488,0.0000042939696,0.000026228485,0.000007885551,0.00016252213,0.00003584683,0.000004563936,0.99664193,0.0011338015,0.0016019994],"study_design_scores_gemma":[0.0008686639,0.000226783,0.00030418162,0.000018632196,0.00002265863,0.000006571338,0.000052395277,0.000034438297,0.00019251733,0.9977233,0.00043331386,0.0001165899],"about_ca_topic_score_codex":0.0000015833775,"about_ca_topic_score_gemma":0.0000030354076,"teacher_disagreement_score":0.05128315,"about_ca_system_score_codex":0.000022546585,"about_ca_system_score_gemma":0.000021258833,"threshold_uncertainty_score":0.99950093},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7837053,0.012811746,0.000024787629,0.0018118379,0.0050231605,0.00031022413,0.000023891916,0.0013448687,0.19494416],"genre_scores_gemma":[0.99628794,0.0010725321,0.00056913757,0.00011207659,0.000070914575,0.00002873058,0.000018008466,0.00007852542,0.0017621353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784744,0.00006300851,0.00053569535,0.0004752896,0.00026351024,0.0008150331],"domain_scores_gemma":[0.9986972,0.00011487998,0.00006205676,0.0008724222,0.00007343648,0.00017995713],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000267908,0.00048977224,0.00051901554,0.00021055853,0.00022009929,0.000065026805,0.00064741896,0.0007012113,0.0011087018],"category_scores_gemma":[0.000058490863,0.00056129467,0.00017732667,0.0005135224,0.00017336935,0.00045674166,0.00012594594,0.0009330453,0.0028851954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018318498,0.0001720877,0.0011069058,0.000103075385,0.00018812229,0.00003443425,0.0009567914,0.000990824,0.00044914137,0.96994305,0.020007344,0.006029906],"study_design_scores_gemma":[0.0025788394,0.0003596627,0.009221342,0.00017781992,0.00017400611,0.00006618558,0.0010879266,0.012583991,0.00294927,0.88421035,0.08506241,0.0015282289],"about_ca_topic_score_codex":0.00006592335,"about_ca_topic_score_gemma":0.00010095479,"teacher_disagreement_score":0.21258262,"about_ca_system_score_codex":0.00019154069,"about_ca_system_score_gemma":0.00005533834,"threshold_uncertainty_score":0.99980444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8545537,0.0014871954,0.10573481,0.006459657,0.015310326,0.0005869524,0.000029625693,0.0010469796,0.014790727],"genre_scores_gemma":[0.98544073,0.00001778506,0.013566974,0.00040977792,0.000012430327,0.000040153893,0.0000074967998,0.0000126775985,0.00049198454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990232,0.000067367786,0.00013658567,0.0003454705,0.00016013811,0.0002672104],"domain_scores_gemma":[0.9985026,0.00027662268,0.000047895133,0.0009525606,0.0001372205,0.0000830784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027441813,0.000115583585,0.000145176,0.000054171975,0.00025241976,0.000106718304,0.000941701,0.000053796397,0.000028570174],"category_scores_gemma":[0.000174093,0.000118890384,0.00013810866,0.00047248902,0.00004898671,0.00017753511,0.00049678073,0.00007110982,0.000024856156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009434188,0.00006354985,0.0006643064,0.000012436998,0.000024295092,0.00000750501,0.00015975634,0.0000023358966,0.00068771135,0.9814947,0.014892112,0.001981803],"study_design_scores_gemma":[0.00082480157,0.000077579214,0.00042578633,0.000012313833,0.00000845614,0.000009393339,0.000018269615,0.00035331154,0.0077361865,0.94224006,0.048132636,0.00016120105],"about_ca_topic_score_codex":0.0000039209085,"about_ca_topic_score_gemma":0.000010397112,"teacher_disagreement_score":0.13088699,"about_ca_system_score_codex":0.000027365415,"about_ca_system_score_gemma":0.000057018842,"threshold_uncertainty_score":0.4848209},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9285731,0.0001503853,0.003594574,0.0008969451,0.0018918469,0.00016720471,0.0000010088629,0.00012102877,0.064603925],"genre_scores_gemma":[0.99909294,0.000004850888,0.00011996377,0.0004006286,0.000003686897,0.000010435808,3.1744165e-7,0.000004360985,0.00036280334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902207,0.00012598654,0.00019243252,0.00026126183,0.0002003291,0.0001979058],"domain_scores_gemma":[0.9982542,0.0006659964,0.000080908896,0.00091997004,0.000050766346,0.000028176579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006505321,0.00009791194,0.00013551957,0.00010789597,0.00017027807,0.00007801,0.0009833104,0.000041002462,0.000029077764],"category_scores_gemma":[0.0001436183,0.000075531316,0.00010304903,0.00084068964,0.00006160776,0.00013562519,0.0002977929,0.00015002777,0.000013323562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004387934,0.000063868356,0.0024607875,0.00000949748,0.000024548135,0.0000017680892,0.00014588905,0.0000070182396,0.000749938,0.99038684,0.0036290276,0.0025164438],"study_design_scores_gemma":[0.00025438814,0.000049191054,0.0038534945,0.00006354725,0.000006319728,7.5016357e-7,0.000026785456,0.0006491296,0.00736345,0.9864682,0.0011903885,0.00007435255],"about_ca_topic_score_codex":0.000017389724,"about_ca_topic_score_gemma":4.402596e-7,"teacher_disagreement_score":0.070519865,"about_ca_system_score_codex":0.000017975006,"about_ca_system_score_gemma":0.000035271838,"threshold_uncertainty_score":0.30800778},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9684636,0.00020778099,0.000044352706,0.000014337901,0.001271971,0.000110931316,0.0000013682054,0.0003464719,0.029539177],"genre_scores_gemma":[0.99956346,0.00001800291,0.000051084273,0.000018839826,0.000008085583,0.000020454101,0.000003384658,0.000032619213,0.00028406325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941564,0.000019343835,0.000112453425,0.00011794236,0.00011303678,0.00022160116],"domain_scores_gemma":[0.9996092,0.000028361048,0.0000148337285,0.00025002306,0.000021096948,0.00007649079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090892274,0.00012777305,0.00013032819,0.000046959995,0.000052869884,0.000023014894,0.00012396301,0.000058570804,0.00006962897],"category_scores_gemma":[0.0000046390214,0.000110596804,0.000032429412,0.00020104244,0.000025760566,0.00009517224,0.0000108433915,0.00011142993,0.00020939749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009720375,0.00016199249,0.07352844,0.00011048532,0.00025216627,0.00026878843,0.0011535073,0.0028274604,0.0033978138,0.90362877,0.009398102,0.0051752864],"study_design_scores_gemma":[0.009289486,0.00057678664,0.07512613,0.0003755011,0.000121097706,0.0005126132,0.0009238873,0.013407841,0.013557746,0.65518653,0.22840862,0.0025137463],"about_ca_topic_score_codex":0.0000070744704,"about_ca_topic_score_gemma":0.000005270155,"teacher_disagreement_score":0.2484422,"about_ca_system_score_codex":0.000021637685,"about_ca_system_score_gemma":0.00000470913,"threshold_uncertainty_score":0.45100066},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9750779,0.00008495132,0.0001448716,0.0000128174415,0.00083077746,0.00010455181,0.000010549084,0.00016169074,0.02357189],"genre_scores_gemma":[0.9995401,0.000008042637,0.000088682806,0.000011248587,0.000012369404,0.000013610324,0.000007298303,0.000022795584,0.00029588505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936485,0.000025188838,0.00020545193,0.00010449642,0.00013240278,0.00016758728],"domain_scores_gemma":[0.9996329,0.000039270606,0.0000168153,0.00019882063,0.000028910928,0.00008331177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008813803,0.00010215933,0.00016408188,0.000075624936,0.000048226197,0.000013887905,0.00013681628,0.00005441129,0.00045210627],"category_scores_gemma":[0.000011175187,0.0001133222,0.000052858333,0.00032784432,0.000016777989,0.00008430607,0.0000093825565,0.00007552053,0.00011037869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018388193,0.000096017495,0.009873749,0.000056320885,0.00010562528,0.000003803646,0.0015641951,0.015873108,0.012108965,0.9537441,0.0010996304,0.0054560946],"study_design_scores_gemma":[0.002996399,0.00057175214,0.15490966,0.0006803914,0.0001502562,0.000019661229,0.0006633068,0.0058046165,0.060665082,0.71558684,0.056137156,0.0018148699],"about_ca_topic_score_codex":0.0000072103894,"about_ca_topic_score_gemma":0.0000050443364,"teacher_disagreement_score":0.23815724,"about_ca_system_score_codex":0.00001810409,"about_ca_system_score_gemma":0.000009109706,"threshold_uncertainty_score":0.49502465},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928115,0.00010087027,0.0035295764,0.0025548316,0.000068413436,0.000098178745,0.000020945903,0.00001664945,0.0007990314],"genre_scores_gemma":[0.99762106,0.000023365475,0.0020640264,0.00025627483,0.0000017454252,0.0000061653272,0.000008201258,0.0000015970179,0.000017582599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921745,0.000103554004,0.000250823,0.00014622422,0.00016944976,0.000112488444],"domain_scores_gemma":[0.99913967,0.00034224795,0.00009348387,0.00034708504,0.000043888816,0.000033617325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025016043,0.00006907334,0.00016314026,0.00018391067,0.000051024246,0.000022174932,0.0002723065,0.00003306324,0.000026574964],"category_scores_gemma":[0.0001405339,0.00004785235,0.000048109905,0.0011303776,0.000116025556,0.0001273211,0.000070173824,0.000058057216,0.0000052745163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011142193,0.00021222085,0.0005060475,0.000005596835,0.000016599459,0.0000037611167,0.0003252651,0.0005947447,0.000103239574,0.9960138,0.0007491285,0.0014684731],"study_design_scores_gemma":[0.0009596899,0.0002511884,0.020782562,0.00003201087,0.000045938497,0.000018596416,0.00013898361,0.04526752,0.0010127366,0.930877,0.00044422978,0.00016958406],"about_ca_topic_score_codex":0.00005020646,"about_ca_topic_score_gemma":0.000016792384,"teacher_disagreement_score":0.06513685,"about_ca_system_score_codex":0.0000091647935,"about_ca_system_score_gemma":0.000018324456,"threshold_uncertainty_score":0.19513622},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06583411,0.015962265,0.015284086,0.048510954,0.78455913,0.00703816,0.0001547644,0.0016015846,0.06105497],"genre_scores_gemma":[0.37509432,0.0021330323,0.046939787,0.019418223,0.00052394206,0.0006011615,0.00068186875,0.00068828475,0.5539194],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964924,0.00034283186,0.0007572957,0.00076402625,0.0010501473,0.00059333513],"domain_scores_gemma":[0.9963561,0.00015015085,0.0006094411,0.0022156143,0.00050557085,0.00016309608],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015761805,0.0004389501,0.00049911725,0.0003374986,0.00048604314,0.00023688929,0.0028683532,0.0003749632,0.000017766903],"category_scores_gemma":[0.00015213495,0.00028042347,0.00034515682,0.0015287934,0.00012715651,0.00018036466,0.0008328037,0.0009511158,0.00006045157],"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.0000066120556,0.00006350771,0.000032065323,0.000033968594,0.0000619088,0.0000029176808,0.00103739,0.00006025699,0.00019150732,0.28683603,0.7109649,0.00070890033],"study_design_scores_gemma":[0.0005726642,0.00011747206,0.00012658117,0.00029198872,0.000064779066,0.000007465167,0.000036841375,0.0014489023,0.00055305957,0.748299,0.24807723,0.00040400994],"about_ca_topic_score_codex":0.00041788383,"about_ca_topic_score_gemma":0.00011850895,"teacher_disagreement_score":0.78403515,"about_ca_system_score_codex":0.00006365459,"about_ca_system_score_gemma":0.00026457102,"threshold_uncertainty_score":0.9999648},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98693293,0.00045817348,0.0032583026,0.00018886164,0.0006556217,0.0001085898,9.4868307e-7,0.00016261725,0.008233935],"genre_scores_gemma":[0.9953177,0.00007603911,0.0036666798,0.0001998782,0.000006626936,0.0000054085303,0.000001139689,0.000007325864,0.00071920577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990771,0.00004263523,0.00021079241,0.00023996986,0.0002116751,0.00021782628],"domain_scores_gemma":[0.99928164,0.000039328974,0.00007406017,0.00048998644,0.000041989326,0.00007297695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010407859,0.00010860737,0.00017683621,0.000060280425,0.00005924201,0.000029256102,0.0007179205,0.00005329936,0.00018956445],"category_scores_gemma":[0.00001005375,0.00009906564,0.00006247628,0.0004261991,0.0000389529,0.00030131967,0.00008477765,0.000090655936,0.00010724714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071541663,0.0000705423,0.0011424592,0.0000063048974,0.0000090796475,0.00001086005,0.00012829245,0.00019585731,0.00018597534,0.96187377,0.00074373855,0.03562598],"study_design_scores_gemma":[0.0009573549,0.00008686058,0.004134673,0.000010301053,0.000004224592,0.000008011515,0.000005116022,0.0047510583,0.0018576896,0.9807341,0.007268927,0.00018166531],"about_ca_topic_score_codex":0.000022322243,"about_ca_topic_score_gemma":8.396531e-7,"teacher_disagreement_score":0.03544431,"about_ca_system_score_codex":0.000018801187,"about_ca_system_score_gemma":0.000030390771,"threshold_uncertainty_score":0.40397796},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9779608,0.00051144283,0.016631167,0.0008932594,0.0014444704,0.0010437863,0.0000379239,0.00056111225,0.00091600994],"genre_scores_gemma":[0.98891634,0.000112683156,0.010013165,0.00024737432,0.0000063391135,0.00010641206,0.000021433414,0.000035360434,0.0005408853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748284,0.0001314064,0.00036127164,0.00078566535,0.00045922975,0.0007796041],"domain_scores_gemma":[0.997536,0.0005739476,0.00012365976,0.0009488711,0.00029720855,0.00052031525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003541008,0.00030478401,0.000351613,0.00048387254,0.00089046493,0.00012244444,0.0010452283,0.00012630521,0.000021796417],"category_scores_gemma":[0.00019152054,0.00031416267,0.00016227976,0.0014387384,0.00039679228,0.0005525517,0.00030261665,0.0002861213,0.000029683331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000224488,0.00012434163,0.002195555,0.000013194917,0.00004059921,0.0000341332,0.0007245645,0.000012829548,0.0016174273,0.9903419,0.0041976585,0.0006753166],"study_design_scores_gemma":[0.00218015,0.00044193794,0.020429904,0.000022130762,0.000010897946,0.00010419105,0.00005483597,0.0012457088,0.002176211,0.9704745,0.0024588108,0.00040074566],"about_ca_topic_score_codex":0.00004625439,"about_ca_topic_score_gemma":0.000020356252,"teacher_disagreement_score":0.019867456,"about_ca_system_score_codex":0.000059060927,"about_ca_system_score_gemma":0.00024156155,"threshold_uncertainty_score":0.99993104},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98220026,0.0012312878,0.0051781586,0.007659615,0.0017273722,0.0008568948,0.000032791,0.00025365932,0.000859937],"genre_scores_gemma":[0.99637884,0.000015087981,0.0022910389,0.0010094012,0.00003339585,0.00006380142,0.000008177876,0.00003066153,0.00016959589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982088,0.00018975836,0.00041121914,0.0004512288,0.00034891826,0.00039004194],"domain_scores_gemma":[0.99743885,0.00055158505,0.00036345588,0.0013666359,0.00017809068,0.0001014131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091364526,0.00027168452,0.00037929323,0.00009321943,0.00017861523,0.00010240801,0.0022307385,0.000116351126,0.000012308297],"category_scores_gemma":[0.00018615632,0.00019724818,0.00020614798,0.00036859192,0.00017396269,0.0004661783,0.00045488926,0.0002563086,0.000014970219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007888143,0.00025114257,0.0003968107,0.000029123259,0.00016417803,0.000018403292,0.003801394,0.000113352195,0.0011517471,0.98571,0.0040780418,0.0042069172],"study_design_scores_gemma":[0.004204641,0.00060817547,0.0060326667,0.0003071884,0.000091140166,0.000034609486,0.0030474383,0.050984915,0.0134316,0.9178559,0.0027037447,0.0006979774],"about_ca_topic_score_codex":0.000051873296,"about_ca_topic_score_gemma":0.000017476286,"teacher_disagreement_score":0.06785411,"about_ca_system_score_codex":0.00010237553,"about_ca_system_score_gemma":0.000095025316,"threshold_uncertainty_score":0.8043547},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927636,0.00082205515,0.0008345408,0.0005061738,0.0014696935,0.0001312103,0.0000038814956,0.00027317845,0.003195678],"genre_scores_gemma":[0.9944156,0.000016801063,0.005223992,0.00011713665,8.8067856e-7,0.0000036801398,0.000007083165,0.000010675645,0.00020414473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861526,0.000046349112,0.0003471296,0.0003518733,0.00034086415,0.00029854508],"domain_scores_gemma":[0.9989472,0.0000793457,0.00015967741,0.00059120107,0.00015294405,0.00006960004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030114438,0.0001561333,0.00023094924,0.00016534075,0.00009649836,0.000058531776,0.00065519573,0.00007436225,0.0000072698253],"category_scores_gemma":[0.000022850138,0.00014658381,0.000080847145,0.0006911553,0.00008792508,0.00022131375,0.00015387793,0.00013197899,0.00005822512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027533517,0.00013936398,0.0028699988,0.000013935009,0.000009527139,0.000009238708,0.00007435361,0.00010077377,0.0067258584,0.985039,0.0047025853,0.0003125921],"study_design_scores_gemma":[0.00074506237,0.00009169798,0.0017643615,0.000031182673,0.000007806907,0.000010194031,0.0000069090593,0.0024943368,0.017697243,0.9764563,0.00051151984,0.00018338826],"about_ca_topic_score_codex":0.0002888923,"about_ca_topic_score_gemma":0.0000026879684,"teacher_disagreement_score":0.010971385,"about_ca_system_score_codex":0.000009807188,"about_ca_system_score_gemma":0.000037154266,"threshold_uncertainty_score":0.59775144},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9622906,0.0009256473,0.012304047,0.002791155,0.008752038,0.0006243298,0.0000123342015,0.0012761538,0.011023681],"genre_scores_gemma":[0.9967645,0.0000035847127,0.0019200897,0.0007472159,0.00003025386,0.000022823187,0.000009858357,0.000020136467,0.00048158455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977302,0.0001453309,0.0003339158,0.00073505635,0.0005354936,0.0005200012],"domain_scores_gemma":[0.9981954,0.000406863,0.00011108685,0.0010602478,0.000100726145,0.00012565262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003267299,0.0002925376,0.00030371457,0.00010980061,0.00018847422,0.00024237995,0.0013670898,0.00012950125,0.000031159165],"category_scores_gemma":[0.00007589287,0.00027074828,0.00012145561,0.0004230886,0.00010235224,0.0003751008,0.00037492212,0.00027417968,0.00022998145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046626383,0.0003243244,0.00042279818,0.000005967394,0.000008937754,0.000017053017,0.00004824552,0.00014316814,0.0003972133,0.94025713,0.05589093,0.0024795877],"study_design_scores_gemma":[0.0008624609,0.00026261594,0.0031055743,0.000008345197,0.0000043499635,0.00000926875,0.000002593949,0.005686763,0.0045633377,0.979902,0.0052519366,0.0003406996],"about_ca_topic_score_codex":0.00017659676,"about_ca_topic_score_gemma":0.0000046216446,"teacher_disagreement_score":0.050638992,"about_ca_system_score_codex":0.00014733373,"about_ca_system_score_gemma":0.00006796926,"threshold_uncertainty_score":0.9999745},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9851761,0.00014232729,0.0010232875,0.00036106276,0.003245143,0.0001154933,0.000022000992,0.00005768928,0.009856914],"genre_scores_gemma":[0.99595267,0.000011271133,0.0034707487,0.00010460942,0.000020037525,0.0000023040548,0.000004586541,0.000011413397,0.00042236238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968685,0.00009437454,0.00096864015,0.00039525444,0.0012108734,0.00046238655],"domain_scores_gemma":[0.9961182,0.0019560347,0.00047171852,0.0006606277,0.000615548,0.00017791255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046210843,0.00017344263,0.00042908275,0.00046642244,0.00026354956,0.00010582268,0.00070541195,0.00012533422,0.000113328715],"category_scores_gemma":[0.0034759617,0.00014829634,0.00017227365,0.0012519246,0.00029664687,0.00022990124,0.0001445806,0.00026198677,0.00023322075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108981505,0.0004937586,0.32735318,0.000019431338,0.00020421535,0.00007266048,0.0015321365,0.0002368782,0.010877458,0.6254759,0.008486568,0.02513888],"study_design_scores_gemma":[0.0031582885,0.00030331616,0.028178578,0.00011444725,0.00010655985,0.00006414163,0.016193211,0.0016962748,0.07576853,0.86891097,0.004841515,0.0006641677],"about_ca_topic_score_codex":0.000101314625,"about_ca_topic_score_gemma":0.000015863845,"teacher_disagreement_score":0.2991746,"about_ca_system_score_codex":0.00006533903,"about_ca_system_score_gemma":0.00012829917,"threshold_uncertainty_score":0.60473496},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950058,0.0017017173,0.00061247684,0.000018036393,0.0011114305,0.00036731362,0.000012159429,0.00017976672,0.0009912932],"genre_scores_gemma":[0.999432,0.00015131515,0.00014648044,0.00001963593,0.000012736787,0.00008786933,0.000009431824,0.000048747665,0.00009174639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990541,0.000038317175,0.00019529503,0.00023261258,0.00014802543,0.0003316988],"domain_scores_gemma":[0.9993703,0.00015077676,0.000037395424,0.00025653548,0.000054796048,0.00013023982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014025743,0.0002328748,0.00026438272,0.00013963699,0.00023801024,0.000033972843,0.0001623409,0.00010547355,0.000010193232],"category_scores_gemma":[0.000010617461,0.00019636625,0.00007237248,0.00028042088,0.00013369894,0.00021122117,0.000014201817,0.000116215066,0.000007721947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028663976,0.00019193787,0.07628963,0.0005411221,0.0006190581,0.000078722944,0.0028775781,0.0004385695,0.004832469,0.90417784,0.008846079,0.0008203372],"study_design_scores_gemma":[0.006978992,0.0010950033,0.036497947,0.00027401512,0.0002175858,0.00025114222,0.00060463377,0.002506995,0.032849513,0.9027194,0.014330014,0.0016747541],"about_ca_topic_score_codex":0.000008668122,"about_ca_topic_score_gemma":0.000008468649,"teacher_disagreement_score":0.039791685,"about_ca_system_score_codex":0.000014401127,"about_ca_system_score_gemma":0.000013141512,"threshold_uncertainty_score":0.80075836},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93745613,0.00073801714,0.05574688,0.0009780142,0.0010051682,0.00039865848,0.0000029662808,0.0006649146,0.0030092434],"genre_scores_gemma":[0.9944931,0.000095571995,0.0051118187,0.00019392381,0.0000022660322,0.000027990978,0.000002302451,0.000021532189,0.00005149073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808085,0.00009284052,0.00023544765,0.00061347755,0.00040651392,0.0005708493],"domain_scores_gemma":[0.9984934,0.0001680057,0.00006973887,0.0008307976,0.00016221878,0.0002758516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003572472,0.00022700823,0.00023624607,0.00034479442,0.00024937472,0.00016227002,0.0010562342,0.00009802011,0.000007721575],"category_scores_gemma":[0.00009717138,0.0002216187,0.00008289603,0.0014653647,0.00037815463,0.0006934495,0.00045484913,0.0003080675,0.00005980805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000152018965,0.00009332823,0.00079452497,0.000011466335,0.000022545297,0.00006295184,0.00025542494,0.000028738325,0.00069960195,0.98979974,0.000068993744,0.0081475],"study_design_scores_gemma":[0.0015209815,0.0002253567,0.0048864577,0.00002512519,0.0000043347054,0.00003984012,0.000032753094,0.00025312076,0.0046962714,0.98761284,0.0004330975,0.00026981227],"about_ca_topic_score_codex":0.000039157476,"about_ca_topic_score_gemma":0.000012818369,"teacher_disagreement_score":0.057036962,"about_ca_system_score_codex":0.00005850769,"about_ca_system_score_gemma":0.00009086098,"threshold_uncertainty_score":0.9037348},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98330754,0.0001840651,0.0038756535,0.00031389302,0.0004198299,0.00029046857,9.126055e-7,0.00020970085,0.011397908],"genre_scores_gemma":[0.98944944,0.000004330148,0.009990064,0.000052942425,0.0000041220906,0.000035885754,0.0000011844011,0.000017635086,0.0004444215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812686,0.00013475602,0.00021916209,0.0004802533,0.00047808661,0.0005608777],"domain_scores_gemma":[0.9986602,0.00034330992,0.00006476841,0.00074321724,0.00009532213,0.0000931675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003940558,0.00018004957,0.00020295696,0.00020641927,0.00012364011,0.00013467492,0.0010122362,0.000065454646,0.000014860408],"category_scores_gemma":[0.000057212746,0.00015898241,0.00004956509,0.0014768688,0.00016648741,0.0005895904,0.00020913221,0.00027314664,0.000038258713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003168939,0.00014309467,0.021004783,0.0000055195974,0.000005444747,0.0001319378,0.00005941498,0.000024144203,0.00041340047,0.97681344,0.00016516875,0.0012019839],"study_design_scores_gemma":[0.0013293066,0.0001454883,0.044637553,0.000020242665,0.0000015464375,0.000019424226,0.000012907759,0.00053012546,0.0012494506,0.95148724,0.00035600137,0.00021070665],"about_ca_topic_score_codex":0.00012818558,"about_ca_topic_score_gemma":0.00017274015,"teacher_disagreement_score":0.025326172,"about_ca_system_score_codex":0.0000783872,"about_ca_system_score_gemma":0.00009185417,"threshold_uncertainty_score":0.64831144},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99717903,0.00016827266,0.00002408225,0.00016064069,0.00015086123,0.00025924708,0.0000075393477,0.00007815801,0.001972145],"genre_scores_gemma":[0.99924296,0.0002012406,0.00039733486,0.00005729904,0.000002835705,0.00002860867,0.0000031274324,0.000010639118,0.000055947035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990168,0.000092542316,0.00024132215,0.00024033544,0.00015780263,0.00025116286],"domain_scores_gemma":[0.9991713,0.0003560032,0.00008541444,0.00025433968,0.000040466133,0.000092486844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026137588,0.00013455709,0.00020860975,0.00012157748,0.00020211736,0.000016628928,0.00017447736,0.00007921496,0.000026965761],"category_scores_gemma":[0.00015741619,0.00012741386,0.000047764224,0.00056509266,0.0001644765,0.00012731439,0.00005786595,0.00017047966,0.000012559754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072408243,0.00021399677,0.08703338,0.00001693223,0.000009371935,0.00002054338,0.00043446003,0.000002311344,0.00003218822,0.9113411,0.00072727335,0.00016123876],"study_design_scores_gemma":[0.00055382797,0.000022352839,0.019227367,0.00001499226,0.000010328089,0.000026803116,0.000060380804,0.00012290757,0.00086527783,0.9786258,0.00032617702,0.00014380949],"about_ca_topic_score_codex":0.00005889143,"about_ca_topic_score_gemma":0.000016567436,"teacher_disagreement_score":0.06780601,"about_ca_system_score_codex":0.000029141569,"about_ca_system_score_gemma":0.000026529337,"threshold_uncertainty_score":0.5195787},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9797627,0.00046282847,0.000019969628,0.00001370392,0.0014911218,0.0003170831,0.000008504126,0.000080611964,0.017843492],"genre_scores_gemma":[0.9996888,0.000020762465,0.000016943544,0.000008058253,0.0000056478584,0.000049860253,0.0000010753027,0.000024820942,0.00018404027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987579,0.00012313957,0.000472291,0.00014121314,0.00028655192,0.00021892933],"domain_scores_gemma":[0.99910885,0.00017471469,0.00012755331,0.00048426905,0.000057631252,0.00004695831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039825123,0.00015099323,0.00026807078,0.0000423148,0.00005340355,0.000016255128,0.00030301543,0.00006311965,0.00011331169],"category_scores_gemma":[0.00005427638,0.00011765584,0.000097152,0.00020510994,0.0000559443,0.00007453537,0.00003079843,0.00013129895,0.00004411983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010111609,0.0001249688,0.0011904417,0.00020355126,0.00010350827,0.0000038506237,0.00066066725,0.00088179595,0.0034099263,0.9918812,0.0013611102,0.00016886236],"study_design_scores_gemma":[0.0039158743,0.0005283251,0.0075094798,0.0024377906,0.00019447067,0.00005900159,0.0031864333,0.12782516,0.039619237,0.81155074,0.0019325481,0.0012409285],"about_ca_topic_score_codex":0.000034291304,"about_ca_topic_score_gemma":7.30185e-7,"teacher_disagreement_score":0.18033046,"about_ca_system_score_codex":0.000030500525,"about_ca_system_score_gemma":0.0000031806676,"threshold_uncertainty_score":0.4797866},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99620026,0.00034985945,0.0011107785,0.0003623121,0.0011138428,0.00014258419,0.000001943331,0.000074884185,0.00064353],"genre_scores_gemma":[0.9994454,0.00016343308,0.0003320622,0.000031166026,3.24364e-7,0.0000070167607,0.0000019862537,0.000005564098,0.000013063201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879974,0.00010767569,0.0003852835,0.00017558852,0.000313295,0.00021838698],"domain_scores_gemma":[0.9988732,0.000264946,0.00020899632,0.0004611593,0.00013483928,0.00005688237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076524727,0.00011134101,0.00019206482,0.0001332753,0.00019428473,0.00003952645,0.0004841865,0.000053529802,0.0000022887875],"category_scores_gemma":[0.000028761891,0.00008310006,0.000100545854,0.000741072,0.00010735551,0.00032835524,0.00005174355,0.00011912408,0.0000047271083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001215083,0.00008001652,0.0026088045,0.00001764187,0.00002193224,0.0000012637342,0.0008450654,0.00008298264,0.0048488784,0.9895636,0.00010607163,0.0018116211],"study_design_scores_gemma":[0.00056461553,0.000120034856,0.0030593448,0.0000399689,0.000009164984,0.000009219463,0.00005065941,0.0014027049,0.015678648,0.97879255,0.0001759546,0.00009712493],"about_ca_topic_score_codex":0.00015696937,"about_ca_topic_score_gemma":0.00002066859,"teacher_disagreement_score":0.010829768,"about_ca_system_score_codex":0.0000074575055,"about_ca_system_score_gemma":0.000029315495,"threshold_uncertainty_score":0.3388722},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9890531,0.0001273769,0.0003412911,0.000533413,0.001203886,0.00027263502,0.0000028949426,0.00028680614,0.0081786495],"genre_scores_gemma":[0.99892694,0.000023784209,0.0005793581,0.00016824117,0.000002360124,0.000022730364,0.0000017334021,0.000020258329,0.00025461556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783975,0.00022896145,0.00026095143,0.00055239233,0.00052105135,0.00059687864],"domain_scores_gemma":[0.99744177,0.00072876335,0.00006869642,0.0015040684,0.00008198322,0.00017472846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032246296,0.00021803411,0.00024679504,0.00047211608,0.00012857717,0.00009082832,0.0021033424,0.000107319516,0.000114345465],"category_scores_gemma":[0.0005474984,0.00020723004,0.00008635514,0.0017482638,0.00011917588,0.00047050853,0.00039817338,0.0004625542,0.0001815964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009384362,0.0002197811,0.0048979213,0.00000432265,0.000008900278,0.00004918613,0.00033375173,0.000021434362,0.00017620783,0.99140376,0.0021344256,0.00074094464],"study_design_scores_gemma":[0.0014433954,0.00024173805,0.0070971027,0.000021976877,0.0000011720425,0.0000030319266,0.000018417044,0.0025069749,0.0017918613,0.98627555,0.0003590702,0.0002397106],"about_ca_topic_score_codex":0.000020053547,"about_ca_topic_score_gemma":0.000014086895,"teacher_disagreement_score":0.009873872,"about_ca_system_score_codex":0.000094713614,"about_ca_system_score_gemma":0.000016863502,"threshold_uncertainty_score":0.8450596},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91655374,0.005969535,0.04892724,0.0015349691,0.007733531,0.00077758793,0.0000022867137,0.00045000607,0.0180511],"genre_scores_gemma":[0.997777,0.00006309,0.001494894,0.00010859414,0.000029830815,0.000018104913,8.25951e-7,0.000009958893,0.0004977259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989484,0.000031329604,0.00017909918,0.0002904296,0.00014886481,0.0004018845],"domain_scores_gemma":[0.9985147,0.0007262451,0.00007517746,0.00045188726,0.00010670906,0.00012529596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085230736,0.00013121813,0.00013108982,0.00003733515,0.0003437785,0.0002148006,0.0006666885,0.00007072832,0.0000014621413],"category_scores_gemma":[0.00022666974,0.00009041584,0.000060718656,0.00017130475,0.00009121514,0.00018275704,0.00021556085,0.000100845056,0.000020663529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007980504,0.000036734244,0.0019496931,0.000005210543,0.000009881713,0.000005111545,0.0007723299,1.4202124e-7,0.00010089159,0.95020765,0.0018875841,0.045016773],"study_design_scores_gemma":[0.00071674323,0.00013850312,0.016497076,0.0000105430145,0.000006233825,0.000012365275,0.00004910092,0.0012520566,0.0014713168,0.9351223,0.044544008,0.00017974616],"about_ca_topic_score_codex":0.0000071448503,"about_ca_topic_score_gemma":0.000025205922,"teacher_disagreement_score":0.081223235,"about_ca_system_score_codex":0.000024832101,"about_ca_system_score_gemma":0.000039603605,"threshold_uncertainty_score":0.36870506},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919525,0.00014548478,0.004009485,0.0005417945,0.0005966676,0.0001850879,0.0000010183904,0.00008853216,0.0024794233],"genre_scores_gemma":[0.9915242,0.00006435749,0.008185773,0.00008744924,0.000003797644,0.00003310453,0.0000010448855,0.000013048105,0.00008720232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983139,0.0002035848,0.0002345579,0.0004559588,0.00036008836,0.00043189048],"domain_scores_gemma":[0.9984963,0.0007185121,0.000035886012,0.0004966095,0.00009459445,0.00015813208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041753918,0.00014968119,0.00020101764,0.00023292124,0.00015591658,0.000057768288,0.0005784339,0.000087930435,0.000013579859],"category_scores_gemma":[0.0004183466,0.00015416107,0.00004756847,0.00083775056,0.0003387926,0.0007653138,0.00029387054,0.00026767555,0.0000600367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000144696505,0.00013132552,0.025518285,0.000009649598,0.000004786781,0.000119808145,0.00044331496,5.2638e-7,0.0005059936,0.9657646,0.00019301879,0.007294229],"study_design_scores_gemma":[0.0009934411,0.00008028244,0.05982802,0.000017535142,0.0000016761613,0.000100380756,0.000019729763,0.0011399394,0.0013167674,0.93618214,0.00013501014,0.00018505099],"about_ca_topic_score_codex":0.0000150773485,"about_ca_topic_score_gemma":0.000005070305,"teacher_disagreement_score":0.034309734,"about_ca_system_score_codex":0.000047201815,"about_ca_system_score_gemma":0.00004182608,"threshold_uncertainty_score":0.6286506},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9768123,0.00019277749,0.009114092,0.0036095714,0.00063526817,0.001419378,0.00004706493,0.0004130343,0.0077565284],"genre_scores_gemma":[0.8624048,0.000026629687,0.12977803,0.0005862087,0.00021361941,0.0005771685,0.000024690438,0.00007520713,0.0063136057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989304,0.000019654322,0.0003913585,0.00018959616,0.00016711808,0.0003018763],"domain_scores_gemma":[0.9987028,0.00063129235,0.000113580434,0.0003696598,0.000083831976,0.000098789365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003038156,0.00014599678,0.00026158747,0.000030440948,0.00016021264,0.000045409477,0.00020273526,0.00008187884,0.00014447325],"category_scores_gemma":[0.00025641115,0.00013211083,0.00013359173,0.00008013265,0.000028566614,0.0001465934,0.00004808998,0.000083559906,0.00007921433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062041076,0.00016120826,0.000004776895,0.00011001357,0.000023183395,1.7355586e-7,0.00028873264,0.0000032014116,0.00021580223,0.9799695,0.018857893,0.00035928944],"study_design_scores_gemma":[0.0009384262,0.000026164667,0.000002456132,0.000021322609,0.000042836473,0.0000016437015,0.00008454375,0.0033335218,0.0021474091,0.9652262,0.028003337,0.00017214914],"about_ca_topic_score_codex":0.00000863767,"about_ca_topic_score_gemma":0.0000043399523,"teacher_disagreement_score":0.12066393,"about_ca_system_score_codex":0.00005346864,"about_ca_system_score_gemma":0.000021085825,"threshold_uncertainty_score":0.5387323},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9977236,0.00025739806,0.00018510896,0.00018236085,0.0004694667,0.00023650686,0.0000014234092,0.000072691226,0.00087145774],"genre_scores_gemma":[0.99688137,0.000039291775,0.0028417653,0.000016995431,0.0000029334237,0.000019145153,9.4900105e-7,0.000010935469,0.000186636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984489,0.00016050506,0.00023843731,0.00040015677,0.00038996388,0.0003620478],"domain_scores_gemma":[0.9987794,0.0001752247,0.000070149086,0.0007132151,0.00018828483,0.00007369238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042214844,0.00013021278,0.0002442894,0.00028811087,0.00008794765,0.000014315146,0.0007619973,0.000049777624,0.0000055852965],"category_scores_gemma":[0.0002773437,0.0001234535,0.000057109854,0.0014425642,0.00023602201,0.00039591562,0.00024729682,0.00021628199,0.00002144853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024066412,0.00022563848,0.033398207,0.00002404291,0.000010677006,0.000077973986,0.00068320497,0.0000394425,0.006059492,0.95838493,0.00023090656,0.00084143784],"study_design_scores_gemma":[0.0011986094,0.00037952777,0.102168955,0.000035168356,0.000002062073,0.00010342768,0.000031200216,0.00095809915,0.04885723,0.845886,0.00011296942,0.0002667855],"about_ca_topic_score_codex":0.000027014621,"about_ca_topic_score_gemma":0.000002109087,"teacher_disagreement_score":0.11249895,"about_ca_system_score_codex":0.000034353023,"about_ca_system_score_gemma":0.00010156926,"threshold_uncertainty_score":0.50342876},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9873352,0.0070522237,0.0000119201995,0.000022894934,0.0013486302,0.00015282526,0.0000075950697,0.00046073954,0.0036079541],"genre_scores_gemma":[0.99931407,0.0003965757,0.00007273063,0.000019706356,0.000013128963,0.000029378642,0.0000021546773,0.000046418612,0.000105850544],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893373,0.00005983403,0.0002445692,0.00024819793,0.0001616728,0.000351974],"domain_scores_gemma":[0.99931645,0.0001095982,0.00005179923,0.00033879347,0.000034662167,0.00014871504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016338243,0.00025520514,0.00027694393,0.00016686085,0.00015989832,0.0000932734,0.00018893408,0.00009801727,0.00005029219],"category_scores_gemma":[0.000027205275,0.0002570984,0.0000931897,0.00030159848,0.00008274066,0.0002599496,0.000033204476,0.0001996969,0.00004762578],"study_design_candidate":"observational","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.000024414647,0.0003281954,0.52008265,0.00067804044,0.0004437363,0.00018381725,0.005757369,0.0010882702,0.010352457,0.441744,0.00507202,0.014245033],"study_design_scores_gemma":[0.01377897,0.00041281953,0.41205785,0.0020270927,0.00038600963,0.00030473722,0.00550345,0.104500934,0.0154048,0.4133787,0.026770458,0.005474182],"about_ca_topic_score_codex":0.000034533117,"about_ca_topic_score_gemma":0.000024365969,"teacher_disagreement_score":0.10802478,"about_ca_system_score_codex":0.0000172567,"about_ca_system_score_gemma":0.0000015543942,"threshold_uncertainty_score":0.99998814},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9965272,0.00027698273,0.0008806344,0.00007439804,0.00048025357,0.00010663375,0.0000018315477,0.00006781416,0.0015842465],"genre_scores_gemma":[0.9954977,0.00004782204,0.004352782,0.000053101227,0.0000028221266,0.00000716974,0.00000132853,0.0000075608973,0.000029695353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988004,0.00011426915,0.00026326638,0.00026778638,0.00034917542,0.00020509821],"domain_scores_gemma":[0.9989842,0.00009814578,0.00021495171,0.00050497055,0.00012377511,0.000073928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030560407,0.00013393142,0.0002712743,0.00017123079,0.000100388,0.000012194665,0.00077522954,0.00006276546,0.000020918189],"category_scores_gemma":[0.000017707,0.00010746421,0.000085056745,0.00088182674,0.0003262568,0.00029223642,0.00013648476,0.000111837864,0.0000036687911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008292517,0.00016383984,0.025603669,0.00001835292,0.00005009324,0.000040852115,0.0020422435,0.000014214162,0.00288127,0.96838033,0.00028965613,0.00043254736],"study_design_scores_gemma":[0.0036442971,0.0036706286,0.044837683,0.0002130317,0.000035772788,0.00014342423,0.0002022618,0.0005198871,0.088271216,0.85659194,0.0011794626,0.0006903815],"about_ca_topic_score_codex":0.00004521043,"about_ca_topic_score_gemma":0.0000017772087,"teacher_disagreement_score":0.111788385,"about_ca_system_score_codex":0.000012292129,"about_ca_system_score_gemma":0.0001230478,"threshold_uncertainty_score":0.43822634},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93790185,0.0001432262,0.00003603513,0.0007555674,0.0058161765,0.0002172165,0.0000023416007,0.00038844853,0.054739125],"genre_scores_gemma":[0.9932825,0.00001309396,0.00052378175,0.0007820688,0.000023568298,0.00008391263,0.000006505302,0.000022762097,0.0052618296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986503,0.0001573712,0.0002508646,0.00039664606,0.00016809383,0.00037673622],"domain_scores_gemma":[0.99906003,0.00019915946,0.000064630534,0.00044060624,0.000035957833,0.00019961168],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002245239,0.00015288367,0.00018849113,0.00008944716,0.00023083496,0.000013524564,0.0002411427,0.00014490251,0.00056771684],"category_scores_gemma":[0.000083114144,0.00014197151,0.00007317847,0.00039916858,0.0000637167,0.00007570495,0.000044991135,0.00028926926,0.0027180328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034526853,0.0007929834,0.012586436,0.0000017216197,0.00006432281,0.00018331673,0.00062441867,0.0000041028347,0.0014936866,0.9068935,0.07548392,0.0018370851],"study_design_scores_gemma":[0.0020214377,0.000992354,0.41008994,0.000024839434,0.000020558151,0.00020937796,0.00018186725,0.0000083052455,0.00015323784,0.5561145,0.029730601,0.00045297018],"about_ca_topic_score_codex":0.00003222858,"about_ca_topic_score_gemma":2.623149e-7,"teacher_disagreement_score":0.3975035,"about_ca_system_score_codex":0.000060390994,"about_ca_system_score_gemma":0.000014912851,"threshold_uncertainty_score":0.99805844},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902866,0.000048420105,0.00015549317,0.00018005133,0.0004931874,0.0005562825,0.000019839503,0.000034865196,0.008225245],"genre_scores_gemma":[0.99821717,0.0000038131511,0.0012526824,0.00003249511,0.0000016812004,0.000094871124,0.0000013923429,0.000015010239,0.00038090235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938536,0.00007652708,0.00018444036,0.00011609338,0.00010097026,0.0001366191],"domain_scores_gemma":[0.99904954,0.00031265046,0.000113677444,0.0004365832,0.000057106554,0.000030461144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033451378,0.00008537697,0.00013216473,0.00002571202,0.00016701008,0.00000836362,0.00022027711,0.000046290566,0.000018682309],"category_scores_gemma":[0.00026957333,0.00006028341,0.00015111001,0.00021158264,0.000098771314,0.000034225446,0.000019497156,0.00006172611,0.0000032561438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041159974,0.00007111548,0.00086788356,0.000026448917,0.000022303639,3.9969763e-8,0.00020954161,2.8355876e-7,0.00057246914,0.9966717,0.0015108327,0.000043260185],"study_design_scores_gemma":[0.00032239148,0.000025280766,0.00043611022,0.000014569935,0.000038694645,9.176739e-7,0.00010310363,0.0000046562945,0.02372898,0.9720381,0.0032140266,0.00007316212],"about_ca_topic_score_codex":0.0000014720025,"about_ca_topic_score_gemma":0.0000021222456,"teacher_disagreement_score":0.0246336,"about_ca_system_score_codex":0.0000071934523,"about_ca_system_score_gemma":0.000019942638,"threshold_uncertainty_score":0.24582861},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99501085,0.00021219112,0.0006559201,0.00046814446,0.0018762044,0.00010783567,7.633189e-7,0.000185318,0.0014827932],"genre_scores_gemma":[0.9856515,0.000015884232,0.01417576,0.000059749404,5.793138e-7,0.000008819251,9.795668e-7,0.00000792243,0.00007881189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893963,0.000024780888,0.0002552219,0.00027154371,0.00026052722,0.00024827127],"domain_scores_gemma":[0.9991776,0.000026925625,0.00010005887,0.00048551403,0.000113874055,0.000096056145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020816554,0.00012175686,0.00018524883,0.00011197144,0.00010034481,0.000041405532,0.00046266956,0.000059607777,0.000003889863],"category_scores_gemma":[0.000027644497,0.00011791822,0.00008362518,0.00056219695,0.00007481712,0.00036652884,0.00018570632,0.00010997006,0.000027240714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006044889,0.00009371556,0.0004647481,0.000009708685,0.000014573981,0.00000986419,0.0002489081,0.00070010766,0.002430279,0.99569106,0.00012836157,0.0002026555],"study_design_scores_gemma":[0.0010196929,0.00022644925,0.0013954821,0.000031827723,0.00000455199,0.000023492517,0.000014763981,0.00014938967,0.009776444,0.98714554,0.00007200357,0.00014038065],"about_ca_topic_score_codex":0.00007739325,"about_ca_topic_score_gemma":0.0000020927657,"teacher_disagreement_score":0.013519839,"about_ca_system_score_codex":0.000022160635,"about_ca_system_score_gemma":0.0000725347,"threshold_uncertainty_score":0.48085657},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9774744,0.000061799656,0.00016767195,0.00035028852,0.0014301846,0.00027405765,0.0000019072936,0.00003070966,0.02020896],"genre_scores_gemma":[0.9994679,0.0000075528606,0.00009018342,0.0003022685,0.000014460359,0.00000612421,4.988953e-7,0.000016931126,0.000094056486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901265,0.00018906465,0.00025743703,0.00014205533,0.00022086714,0.00017793724],"domain_scores_gemma":[0.99618024,0.003109761,0.00015828671,0.00046018985,0.000058513357,0.000033019336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002132869,0.00013498889,0.00019384957,0.00004375336,0.00025595605,0.000021159723,0.00026466505,0.000060830313,0.00005251826],"category_scores_gemma":[0.0005055331,0.000064227,0.000094057876,0.00014150856,0.0005046442,0.00003970097,0.000115947885,0.00024918048,0.0000020892426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019216373,0.00003520235,0.0001777023,0.000012316427,0.000053648695,0.0000016305908,0.00244553,5.1516093e-7,0.00006316514,0.9948282,0.0010992187,0.0010906637],"study_design_scores_gemma":[0.001310919,0.0000707999,0.00052456744,0.000032271117,0.00003613697,0.0000098110795,0.00052036357,0.00006302592,0.00207408,0.9951421,0.0001365764,0.00007931787],"about_ca_topic_score_codex":0.000017680897,"about_ca_topic_score_gemma":0.000008658699,"teacher_disagreement_score":0.021993505,"about_ca_system_score_codex":0.00002314413,"about_ca_system_score_gemma":0.000008527579,"threshold_uncertainty_score":0.2619101},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76340854,0.0046924613,0.157722,0.0052246866,0.0056321123,0.0015444446,0.000014869522,0.0023416514,0.05941922],"genre_scores_gemma":[0.98386204,0.00011039567,0.015256452,0.0002566583,0.000007743038,0.000053111627,0.0000020476386,0.000022306947,0.00042926616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809545,0.00017578085,0.00025829748,0.00052712637,0.00036941198,0.000573908],"domain_scores_gemma":[0.9983423,0.00022104684,0.00007904782,0.00104176,0.00014927304,0.00016661368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019811216,0.00020703016,0.00021937853,0.00014091603,0.00039421458,0.00021899659,0.0014894126,0.00007978401,0.00010624147],"category_scores_gemma":[0.000067916386,0.00020280281,0.000110380475,0.0009841237,0.00016947972,0.001583516,0.00037497864,0.0003013137,0.0003808407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008271263,0.00022442096,0.0010986569,0.00000877355,0.000036691355,0.000015413681,0.0008456447,0.000034443445,0.0012518156,0.9931067,0.0021768794,0.0011922539],"study_design_scores_gemma":[0.0008123932,0.00017258483,0.0005102298,0.000024799918,0.00000920116,0.000020137526,0.000022013877,0.012082075,0.003994584,0.97906935,0.003002192,0.00028044812],"about_ca_topic_score_codex":0.000018983732,"about_ca_topic_score_gemma":0.0000036660697,"teacher_disagreement_score":0.22045347,"about_ca_system_score_codex":0.000048371337,"about_ca_system_score_gemma":0.000018152601,"threshold_uncertainty_score":0.82700586},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9894199,0.0014681716,0.000042652777,0.00017242135,0.0023282208,0.0001047344,0.000006408979,0.000014800254,0.0064427336],"genre_scores_gemma":[0.9970096,0.00017336817,0.00043798296,0.00009835872,0.00017469178,0.000005250473,0.000021429705,0.000018734712,0.0020606287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916375,0.00002602776,0.000233741,0.00021911589,0.00015737207,0.00019997366],"domain_scores_gemma":[0.99943733,0.000015640066,0.00009803173,0.00028355105,0.00009385548,0.00007160769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000079689926,0.00014088079,0.00018695687,0.000035293957,0.000063851694,0.000021502281,0.00021182482,0.00008663417,0.000067261106],"category_scores_gemma":[0.000045218174,0.00013956077,0.000100896264,0.00008478327,0.000053800853,0.000009146326,0.00017160429,0.00005643983,0.00002270878],"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.00035123958,0.00053950626,0.038552042,0.000085263004,0.00052069145,0.0000073504384,0.0005639395,0.000043219436,0.28417632,0.45273945,0.20092142,0.021499548],"study_design_scores_gemma":[0.005571648,0.001026751,0.009632379,0.00005736299,0.000086704014,0.000014844783,0.0003546974,0.000018606474,0.5746243,0.08062935,0.32728934,0.00069401815],"about_ca_topic_score_codex":0.000027610999,"about_ca_topic_score_gemma":0.000008950729,"teacher_disagreement_score":0.3721101,"about_ca_system_score_codex":0.000012052031,"about_ca_system_score_gemma":0.00007168857,"threshold_uncertainty_score":0.5691123},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9582044,0.0003017747,0.000032932618,0.000010297085,0.0022896628,0.000060600607,0.0000016080006,0.00009266611,0.03900605],"genre_scores_gemma":[0.99930984,0.0000048032375,0.00001830451,0.000015943746,0.000011393284,0.000002507287,5.1572994e-7,0.00001920642,0.0006174966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932206,0.00001886794,0.00022715729,0.000076207376,0.00013037333,0.0002253201],"domain_scores_gemma":[0.99946254,0.00015687547,0.000036081474,0.00025845921,0.000041374693,0.000044678865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053662085,0.0000911921,0.00011267192,0.00001979818,0.00017496842,0.000050524,0.00016919548,0.00006330254,0.000077251585],"category_scores_gemma":[0.000019250401,0.00007218048,0.0000646837,0.00018263984,0.00009669601,0.00006220182,0.000017650545,0.00009649321,0.00012130951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023849381,0.000027547378,0.011273851,0.000058972553,0.00007758788,0.000006763011,0.0013211592,0.000031229047,0.0038466328,0.97253704,0.008064315,0.0027310539],"study_design_scores_gemma":[0.001120322,0.000044548106,0.011820602,0.00011217947,0.000029984069,0.000029519932,0.0007946365,0.0006374841,0.107741386,0.6947107,0.18250914,0.00044955115],"about_ca_topic_score_codex":0.00000891291,"about_ca_topic_score_gemma":0.00000303762,"teacher_disagreement_score":0.2778264,"about_ca_system_score_codex":0.000019499055,"about_ca_system_score_gemma":0.000007646735,"threshold_uncertainty_score":0.29434347},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97435755,0.00009967692,0.005624549,0.00056835957,0.0023875656,0.00028409663,0.000004692847,0.0002900513,0.016383452],"genre_scores_gemma":[0.9905423,0.000014771001,0.008961667,0.00026597915,0.0000044664957,0.000008890787,0.000003053368,0.000009667087,0.00018921199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987487,0.000024715117,0.00021718776,0.0003700782,0.00036630564,0.0002730119],"domain_scores_gemma":[0.9988479,0.00003887457,0.00010589995,0.0008646423,0.000060336217,0.00008235281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017590253,0.00015209704,0.00016976678,0.0000714502,0.00009700697,0.00015488415,0.0013728073,0.000043247182,0.00002005449],"category_scores_gemma":[0.000032357137,0.00014405535,0.00007153053,0.00063110027,0.00007669638,0.00069951045,0.00031676647,0.00011795264,0.0002326447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035064695,0.00015033883,0.00042337747,0.00001142686,0.000016087535,0.00002594542,0.0001014063,0.00014363936,0.00010545443,0.98983246,0.0006593124,0.008527048],"study_design_scores_gemma":[0.0011059442,0.00028026116,0.0053936983,0.000065421205,0.0000070112137,0.0000022595914,0.000018805846,0.00031465938,0.003648451,0.98524195,0.0036945723,0.00022698005],"about_ca_topic_score_codex":0.00010528203,"about_ca_topic_score_gemma":0.000006295839,"teacher_disagreement_score":0.01619424,"about_ca_system_score_codex":0.000033725795,"about_ca_system_score_gemma":0.00006255337,"threshold_uncertainty_score":0.58744067},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.951589,0.00018871843,0.0000068529735,0.000050837272,0.0012039888,0.0000912439,0.0000024096676,0.00009513357,0.046771854],"genre_scores_gemma":[0.99981946,0.000010824127,0.0000012682425,0.000022946162,0.000003849225,0.000011263754,2.7541049e-7,0.000012814871,0.00011727318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995528,0.0000557172,0.000107788095,0.00006999527,0.00009865397,0.00011503436],"domain_scores_gemma":[0.9993947,0.00027352056,0.000021286585,0.00026984932,0.00001538834,0.000025235448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001808189,0.00008056821,0.00011369304,0.000028458177,0.000043344622,0.000008162465,0.00013949376,0.00004197227,0.00022293036],"category_scores_gemma":[0.0000447834,0.000059233214,0.00005171716,0.00014201399,0.000036826514,0.000035482473,0.000009898903,0.000111059104,0.000117390984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019014134,0.000033987904,0.00023470925,0.000016399255,0.000025984567,0.0000015734555,0.00022928246,0.0001590895,0.0009463677,0.99170285,0.0063758036,0.0002720454],"study_design_scores_gemma":[0.000577574,0.000119571385,0.0022765936,0.000061927436,0.000014705829,0.0000047044837,0.00013191503,0.0061263973,0.024437774,0.9628271,0.0031982125,0.0002235423],"about_ca_topic_score_codex":0.0000036156318,"about_ca_topic_score_gemma":7.507997e-7,"teacher_disagreement_score":0.048230525,"about_ca_system_score_codex":0.00001259899,"about_ca_system_score_gemma":9.790929e-7,"threshold_uncertainty_score":0.24409312},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919934,0.000031048636,0.00062911265,0.0003427012,0.00017242985,0.00017802251,0.000001320005,0.000012594445,0.0066393265],"genre_scores_gemma":[0.99873877,0.000007970717,0.0010799712,0.000026517664,0.0000020768196,0.000016721851,8.104483e-7,0.0000068396675,0.000120299126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893767,0.0001365655,0.00022543097,0.00020954806,0.00030299567,0.00018781771],"domain_scores_gemma":[0.99894613,0.00041509478,0.00009804336,0.00042294685,0.000093485876,0.000024308292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051591505,0.00009373913,0.00015113551,0.00015389248,0.000050377803,0.00002570589,0.00045621744,0.000048365448,0.000009646949],"category_scores_gemma":[0.00008898339,0.00006886352,0.000035959365,0.00084467337,0.00021498067,0.00020070205,0.00013995172,0.00012633784,0.0000040046048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020850752,0.00012577462,0.04239977,0.000010126117,0.0000048911697,0.000002430461,0.00018407617,0.0000060189172,0.0011374791,0.95463145,0.00010915249,0.0013680016],"study_design_scores_gemma":[0.0006448603,0.00007413474,0.061654933,0.000029484336,0.0000015582975,0.0000031974716,0.00001961406,0.0006177621,0.005909868,0.93091685,0.00005668573,0.00007105099],"about_ca_topic_score_codex":0.000049322218,"about_ca_topic_score_gemma":0.000014957347,"teacher_disagreement_score":0.023714574,"about_ca_system_score_codex":0.000019180807,"about_ca_system_score_gemma":0.000020429597,"threshold_uncertainty_score":0.2808173},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97970426,0.000021969407,0.018747548,0.00010796502,0.00064296846,0.00008092222,0.0000010847899,0.00012496518,0.0005683122],"genre_scores_gemma":[0.997962,0.000019977626,0.0018118697,0.000089381065,0.000003782326,0.0000055975697,0.000005976832,0.000005059359,0.00009636687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936926,0.00003052697,0.00015882883,0.00016717103,0.00013872268,0.00013550564],"domain_scores_gemma":[0.9994402,0.000033537137,0.00009908874,0.00030198548,0.00008240664,0.000042810636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004689353,0.00007511176,0.00013138866,0.00005229516,0.00007052371,0.000008922976,0.00035299486,0.000036244783,0.000011384492],"category_scores_gemma":[0.000028167973,0.000071268434,0.00003406337,0.00033572136,0.00004188931,0.00031179318,0.0000835121,0.00005595156,0.000031038322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030636413,0.000057865524,0.0014461846,0.000004701238,0.000005106399,0.000012219463,0.00028170247,0.0000023947664,0.077706926,0.91980755,0.000041427258,0.0006308693],"study_design_scores_gemma":[0.0015071813,0.00031650095,0.1325167,0.000024819974,0.0000059921385,0.00008877287,0.000012061117,0.003986023,0.1321988,0.7276939,0.0012813767,0.00036784392],"about_ca_topic_score_codex":0.0000028706188,"about_ca_topic_score_gemma":1.6870122e-7,"teacher_disagreement_score":0.19211361,"about_ca_system_score_codex":0.000013340125,"about_ca_system_score_gemma":0.00003246068,"threshold_uncertainty_score":0.29062423},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857781,0.000038121958,0.006924105,0.0046663145,0.0021486897,0.00013251981,0.0000013543033,0.00017291111,0.00013789031],"genre_scores_gemma":[0.9856993,0.000002532631,0.014078349,0.00018358347,0.0000027302347,0.00001014059,0.0000045874363,0.0000073332917,0.000011463733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902064,0.0000355553,0.00021160801,0.0003265288,0.00022494217,0.0001807087],"domain_scores_gemma":[0.9989564,0.000014589639,0.00006328727,0.000628413,0.0002058685,0.00013143878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023571988,0.000093415976,0.000121448786,0.00021399838,0.00011046196,0.00005049653,0.00042250092,0.000042483076,0.000005471782],"category_scores_gemma":[0.00003801304,0.000093581366,0.000045600693,0.000842296,0.00004022803,0.0003401612,0.00006275599,0.00007815005,0.000032687916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026045238,0.00017224485,0.00034171398,0.0000042638194,0.0000065517943,0.000001551932,0.0005687191,0.0016801218,0.009396894,0.9865925,0.00056258996,0.00067027356],"study_design_scores_gemma":[0.00043174898,0.0002705502,0.0014176406,0.000007700918,0.000004937401,0.000006052028,0.000031697215,0.00023269079,0.014204306,0.9830706,0.00021204207,0.000110044326],"about_ca_topic_score_codex":0.00007719821,"about_ca_topic_score_gemma":0.0000051476327,"teacher_disagreement_score":0.007154244,"about_ca_system_score_codex":0.00002399989,"about_ca_system_score_gemma":0.000055271652,"threshold_uncertainty_score":0.38161373},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9761181,0.000022800556,0.00024418213,0.0008997058,0.00035696808,0.0002703591,0.0000029033154,0.000071611335,0.022013359],"genre_scores_gemma":[0.99774885,0.000024346744,0.00080416625,0.00026566864,0.0000050376366,0.000026380596,7.6038907e-7,0.00001863479,0.0011061296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827933,0.00030892968,0.00025552118,0.0003843287,0.0004190154,0.0003528437],"domain_scores_gemma":[0.9985599,0.0003452338,0.00006680059,0.00082340516,0.00009743823,0.000107235224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059381133,0.00018523147,0.00022396477,0.000058378682,0.00014038534,0.000090899346,0.0011501603,0.00006673152,0.00047105324],"category_scores_gemma":[0.000077346,0.00012542562,0.000095850926,0.0006203796,0.00034851977,0.000355401,0.00035612175,0.00038592378,0.000320565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007334074,0.00013593366,0.0044502295,0.000012259464,0.000027386674,0.000012840228,0.0008329102,0.0000027348722,0.00014920934,0.97774,0.00048155335,0.0160816],"study_design_scores_gemma":[0.00069912086,0.00019472736,0.0036137963,0.0000889584,0.0000058739006,0.00004254666,0.00004152535,0.00091403734,0.0032170883,0.9873735,0.0036094068,0.00019944858],"about_ca_topic_score_codex":0.000029852552,"about_ca_topic_score_gemma":0.000003189196,"teacher_disagreement_score":0.021630764,"about_ca_system_score_codex":0.000022066162,"about_ca_system_score_gemma":0.00003722114,"threshold_uncertainty_score":0.51577026},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8922356,0.000020802128,0.00066531874,0.000088139284,0.0011209107,0.00027223275,0.000009701291,0.00013885327,0.10544844],"genre_scores_gemma":[0.99560386,0.000005409356,0.0025456091,0.00012870312,0.000017707049,0.0000070737524,0.000009985408,0.000046258992,0.0016353814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982723,0.000027147455,0.0004734145,0.00027339972,0.00043908064,0.0005146426],"domain_scores_gemma":[0.998095,0.0010104382,0.0001871252,0.00046983274,0.000100827165,0.00013681359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014501652,0.00021376422,0.00033124426,0.00007586861,0.00015949587,0.00007518011,0.00025217567,0.00013356644,0.00014377588],"category_scores_gemma":[0.00049366045,0.00019165086,0.0000932244,0.00023966121,0.000048822792,0.00011619951,0.00008122537,0.0002582027,0.00025678411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014922674,0.0003380029,0.0012588134,0.000077671335,0.000025054074,0.000017511009,0.00018338776,7.9257563e-7,0.00026244504,0.99404085,0.003246647,0.0005338974],"study_design_scores_gemma":[0.00055323646,0.00008637417,0.0007208878,0.00007308869,0.000021213275,0.0000045569136,0.00013316152,0.00058544584,0.0013800644,0.9930011,0.003193579,0.0002472622],"about_ca_topic_score_codex":0.000030241865,"about_ca_topic_score_gemma":0.000017417222,"teacher_disagreement_score":0.10381306,"about_ca_system_score_codex":0.00009997666,"about_ca_system_score_gemma":0.00002368937,"threshold_uncertainty_score":0.78152955},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9851512,0.00062925933,0.000043962908,0.000051911305,0.0018225545,0.00009692354,0.0000044987355,0.00050415035,0.011695578],"genre_scores_gemma":[0.9991633,0.000023960489,0.00034309697,0.000031592608,0.000042600805,0.00001618116,0.0000070210035,0.00003483295,0.0003373851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993087,0.000027073078,0.00017800344,0.0001270319,0.00011545783,0.00024371219],"domain_scores_gemma":[0.99958646,0.00003328222,0.000017211785,0.00025289546,0.000022067296,0.0000881093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001590699,0.0001395434,0.00015818459,0.00006196508,0.00006160585,0.00001854964,0.000175585,0.000088718756,0.00010766335],"category_scores_gemma":[0.0000075205785,0.00014507445,0.00006557824,0.00016660999,0.00002942251,0.00013799359,0.000023490698,0.0001557377,0.00058936153],"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.000034128378,0.00018524515,0.0012974106,0.000113565264,0.00016905092,0.000051050043,0.0010262994,0.09742449,0.010860004,0.851439,0.034403004,0.0029967723],"study_design_scores_gemma":[0.005417506,0.00052001636,0.004781843,0.0002405862,0.0001179702,0.00013575958,0.00059182,0.34796056,0.06820234,0.09649362,0.4730652,0.0024727874],"about_ca_topic_score_codex":0.0000026885739,"about_ca_topic_score_gemma":8.899974e-7,"teacher_disagreement_score":0.75494534,"about_ca_system_score_codex":0.000038518232,"about_ca_system_score_gemma":0.0000074201453,"threshold_uncertainty_score":0.75752467},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99538875,0.00089520315,0.00031787984,0.000004407775,0.0023431801,0.00017411228,0.000009552482,0.00010476108,0.00076215016],"genre_scores_gemma":[0.9996776,0.000012991724,0.00021474424,0.0000021828937,0.000012220401,0.0000052980713,0.0000026624073,0.000036530604,0.00003575916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990397,0.000033821656,0.0004002432,0.0001294784,0.00019222878,0.00020451313],"domain_scores_gemma":[0.9993224,0.000045593835,0.00010953973,0.00033272736,0.00011927837,0.00007045186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024243857,0.00015085569,0.00036640008,0.00012567836,0.000047236714,0.000010269669,0.0001559542,0.00010399889,0.000007501338],"category_scores_gemma":[0.000029066989,0.00014842127,0.00009920643,0.00034149532,0.000057351863,0.00010679078,0.000027348015,0.000112884525,0.000009332199],"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.0000126674195,0.000094635994,0.00077211537,0.0006129887,0.00011893498,0.0000100832185,0.0011417414,0.17045383,0.13267866,0.6939959,0.0000825178,0.00002592045],"study_design_scores_gemma":[0.01082808,0.0008227304,0.0020337899,0.006674082,0.0005212542,0.000220138,0.009504171,0.2078569,0.46594128,0.2903204,0.0027723818,0.002504787],"about_ca_topic_score_codex":0.00024127714,"about_ca_topic_score_gemma":0.0000022984043,"teacher_disagreement_score":0.4036755,"about_ca_system_score_codex":0.000043686592,"about_ca_system_score_gemma":0.00002382517,"threshold_uncertainty_score":0.60524434},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037388172,0.00006918214,0.9492392,0.0004385224,0.0023020203,0.00029082413,0.0000025680256,0.0002994245,0.009970071],"genre_scores_gemma":[0.94304585,0.0000032800622,0.056432586,0.0002987283,0.000016177404,0.000022438253,0.0000030486315,0.000012461096,0.00016543694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875313,0.000011152773,0.00036946783,0.000220275,0.00031959816,0.00032638377],"domain_scores_gemma":[0.9989883,0.000057147445,0.00020768918,0.0004010451,0.00025272224,0.00009311732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004577235,0.0001443647,0.00019655583,0.000103665654,0.00031798446,0.0003806033,0.00070682866,0.00006670757,0.000009175495],"category_scores_gemma":[0.0001253859,0.0001399508,0.000066309505,0.0002974714,0.000030666324,0.0010276149,0.00016565125,0.00010646891,0.000036705736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042136267,0.00003288481,0.00019652465,0.00007811275,0.000009943566,0.0000010618458,0.0016208768,0.00015256675,0.000014275787,0.99382085,0.0011868292,0.0028818739],"study_design_scores_gemma":[0.0016247736,0.00008753528,0.000111899026,0.00006197684,0.0000046621662,0.000012511801,0.00006830954,0.0228787,0.0021553428,0.9695837,0.003205904,0.00020468686],"about_ca_topic_score_codex":0.0000118592025,"about_ca_topic_score_gemma":0.000001716959,"teacher_disagreement_score":0.90565765,"about_ca_system_score_codex":0.00011336409,"about_ca_system_score_gemma":0.00019731192,"threshold_uncertainty_score":0.57070285},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99185055,0.00005503279,5.7135887e-9,0.003401999,0.00044589446,0.00012860906,0.000009295594,0.000007080735,0.0041015493],"genre_scores_gemma":[0.9995723,0.000037061396,8.2139445e-7,0.00014596988,0.000008454682,0.0000053974913,9.716045e-7,3.3337946e-7,0.00022869692],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993995,0.00009295175,0.00012169613,0.00011333579,0.00015162607,0.00012090247],"domain_scores_gemma":[0.9994124,0.00033778054,0.00009284896,0.000084882,0.00005840076,0.000013692574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021938962,0.00006781416,0.0001131138,0.000001783703,0.00015813031,0.00000449819,0.00029266407,0.000046022116,0.00015452168],"category_scores_gemma":[0.000102261336,0.000016879452,0.0000497327,0.00020999195,0.00013496654,0.000022568984,0.00006353547,0.00010534485,0.000014113469],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024731069,0.000109000735,0.8300097,0.0000033393842,0.000028036495,0.000002231101,0.00014989942,7.089146e-7,0.009664444,0.15616058,0.0026815785,0.0011657578],"study_design_scores_gemma":[0.00006569671,0.000082015045,0.8969561,0.000017210368,0.000009769095,0.000011178035,0.00014480004,0.0000014690273,0.007852497,0.09308168,0.0017171698,0.000060447677],"about_ca_topic_score_codex":0.00017582264,"about_ca_topic_score_gemma":0.00032098885,"teacher_disagreement_score":0.066946365,"about_ca_system_score_codex":0.0000058236105,"about_ca_system_score_gemma":0.0000055149235,"threshold_uncertainty_score":0.16919039},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99187106,0.00027414653,0.00020064699,0.0006250008,0.0018822033,0.00010370631,0.0000010491319,0.00024916563,0.004793018],"genre_scores_gemma":[0.99805564,0.000009877484,0.0013713698,0.00036046436,0.00000147826,0.000007502323,0.0000023362825,0.000009049468,0.00018229616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988935,0.000048030626,0.00018068333,0.00037126703,0.00024692388,0.00025961886],"domain_scores_gemma":[0.9992512,0.00010850351,0.00006327722,0.00042681984,0.000060572496,0.000089618734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021446488,0.00014137938,0.00014478264,0.00013148025,0.00017175559,0.0001326264,0.0003103376,0.00006602271,0.000004822735],"category_scores_gemma":[0.000022173514,0.00012911395,0.000049872782,0.00036763502,0.000069986025,0.00015876081,0.000121716024,0.00013079139,0.000056755223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004326229,0.000089061024,0.0016796846,0.0000031216591,0.0000046901782,0.000010815585,0.00002521319,0.000015193324,0.0003325436,0.9865558,0.010221916,0.0010576415],"study_design_scores_gemma":[0.00075517193,0.00016618222,0.0046870657,0.000015023892,0.0000040341615,0.000007692362,0.0000022367408,0.00096256816,0.0008651934,0.99147505,0.0008955386,0.00016426906],"about_ca_topic_score_codex":0.00012494241,"about_ca_topic_score_gemma":0.0000048044753,"teacher_disagreement_score":0.009326378,"about_ca_system_score_codex":0.000010644643,"about_ca_system_score_gemma":0.000020911222,"threshold_uncertainty_score":0.5265114},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96220106,0.00005990743,0.025190985,0.003488236,0.0016478933,0.00018471731,0.000001981062,0.000060096274,0.007165154],"genre_scores_gemma":[0.99768716,0.000008106306,0.0015824887,0.00020662352,0.00002293254,0.000012209239,0.000004876856,0.000004087016,0.00047151372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991573,0.00008387623,0.00018464665,0.00016856533,0.0002854227,0.00012017495],"domain_scores_gemma":[0.99901813,0.0004077634,0.000083268525,0.00034070163,0.000108979686,0.000041164418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002695649,0.0000786367,0.00009094976,0.000062011604,0.00014262063,0.00004759532,0.0004016761,0.000032847358,0.00008286753],"category_scores_gemma":[0.000086545995,0.000059945094,0.000060806906,0.00064827246,0.000027842236,0.00015744312,0.00006622558,0.00008123001,0.00006493782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062347194,0.000089551395,0.00033421675,0.0000011941266,0.000010330991,0.0000019709053,0.00012102955,0.0013531515,0.00023028323,0.98669034,0.0026270952,0.008534589],"study_design_scores_gemma":[0.00062083185,0.0001454562,0.019903522,0.0000134287375,0.0000065675426,0.00001549244,0.000021604112,0.039770864,0.002797286,0.93033636,0.006233562,0.0001350166],"about_ca_topic_score_codex":0.0000073453625,"about_ca_topic_score_gemma":0.0000026237792,"teacher_disagreement_score":0.056353983,"about_ca_system_score_codex":0.000021078113,"about_ca_system_score_gemma":0.0000651807,"threshold_uncertainty_score":0.24444899},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8389005,0.013263807,0.014359494,0.009653893,0.0067306543,0.0053878073,0.0000919533,0.0011649367,0.11044693],"genre_scores_gemma":[0.97940123,0.00028961315,0.0059140637,0.00010861084,0.000064538675,0.00028532706,0.000018697503,0.00005596142,0.013861962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987248,0.00004422425,0.0003766624,0.00020426148,0.0002674627,0.00038255472],"domain_scores_gemma":[0.9970607,0.0020218685,0.00016269246,0.00039556585,0.000293874,0.00006527164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008613161,0.00015784979,0.00021416985,0.0001813498,0.00055766763,0.00012108608,0.00034368635,0.00009026304,0.000022582946],"category_scores_gemma":[0.001629613,0.00011129943,0.000095693715,0.0012506394,0.000056102283,0.00016053664,0.00004015222,0.00012066624,0.000030386944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022479246,0.000089864676,0.00035704413,0.000070311646,0.000040926592,0.0000016938365,0.0001915297,8.693361e-7,0.000012725106,0.9709864,0.026254343,0.0019717936],"study_design_scores_gemma":[0.0005841424,0.000115013456,0.00010490944,0.000019934592,0.000030308576,0.000009753119,0.00028192432,0.000090649504,0.00033169976,0.86806357,0.13021882,0.00014930205],"about_ca_topic_score_codex":0.00001568194,"about_ca_topic_score_gemma":0.0000047116346,"teacher_disagreement_score":0.1405007,"about_ca_system_score_codex":0.000054331176,"about_ca_system_score_gemma":0.00006859252,"threshold_uncertainty_score":0.45386592},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99044234,0.0033998953,0.0024968577,0.0013872467,0.0010631596,0.000204567,4.981613e-7,0.0003028473,0.0007025873],"genre_scores_gemma":[0.9974442,0.000052577598,0.0019208306,0.00023560695,0.00000811996,0.000014410111,5.2960434e-7,0.0000099501995,0.0003137381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990302,0.000024128181,0.00014635439,0.00033626673,0.00018091567,0.0002821661],"domain_scores_gemma":[0.99944663,0.000020540048,0.00004884625,0.00031706042,0.00005205033,0.00011485523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010146888,0.00013930368,0.00014552359,0.00005399422,0.00014372409,0.00009227132,0.0004776285,0.00005768245,0.000005436834],"category_scores_gemma":[0.00004092939,0.00011557501,0.000031652242,0.00027187399,0.000037141323,0.00056043314,0.0002550714,0.00012887026,0.00014029656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022201045,0.000043057036,0.00006747363,0.0000109126495,0.0000056365648,0.00002124768,0.00025965297,0.000048440153,0.0016644945,0.99661094,0.000045779474,0.0012201711],"study_design_scores_gemma":[0.0009268636,0.00012573668,0.0006646096,0.000025357238,0.0000036975105,0.000038181402,0.000013784011,0.000632145,0.008010733,0.9883373,0.0010051373,0.00021647717],"about_ca_topic_score_codex":0.0000063264506,"about_ca_topic_score_gemma":0.0000011842752,"teacher_disagreement_score":0.008273637,"about_ca_system_score_codex":0.00004222987,"about_ca_system_score_gemma":0.00005705907,"threshold_uncertainty_score":0.4713012},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94164747,0.00015544578,0.0003122784,0.000007190056,0.0016683196,0.00011298899,0.0000020851976,0.00032960126,0.055764616],"genre_scores_gemma":[0.9997631,0.000004765146,0.000047442034,0.000040851977,0.000010742808,0.000008501868,0.0000029328087,0.000032257434,0.000089416484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991292,0.000021647105,0.00016591762,0.00015448839,0.00020686294,0.00032191636],"domain_scores_gemma":[0.99945825,0.00011295429,0.000024254547,0.00026984458,0.00002807809,0.00010662168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033939275,0.0001657615,0.00015650924,0.000110170055,0.0000692037,0.000023421562,0.00017332181,0.00008500434,0.000030327692],"category_scores_gemma":[0.00001044237,0.00013854424,0.000046923848,0.00032903944,0.00005262783,0.00008702724,0.000008972254,0.0001801096,0.00010359076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033556888,0.000028489228,0.0016077898,0.000022639117,0.0000466895,0.000057580335,0.00016542611,0.00035256022,0.0010724334,0.99507684,0.0005402519,0.0009957644],"study_design_scores_gemma":[0.0018803069,0.0006205074,0.0067839725,0.00016941705,0.00003302156,0.000061797706,0.00035009306,0.0003518838,0.019596966,0.96611536,0.0032756792,0.0007609873],"about_ca_topic_score_codex":0.000012829474,"about_ca_topic_score_gemma":0.000018769133,"teacher_disagreement_score":0.058115616,"about_ca_system_score_codex":0.000039358718,"about_ca_system_score_gemma":0.000008914526,"threshold_uncertainty_score":0.56496704},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54411864,0.0004392557,0.44584295,0.00029570897,0.00058535533,0.0010256906,0.00016721364,0.00007816572,0.0074470537],"genre_scores_gemma":[0.819651,0.000019045932,0.1786718,0.000018491288,0.000017582863,0.00011549315,0.000067542074,0.000020555013,0.0014184585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993464,0.000022415687,0.0002338992,0.00014845969,0.000076196906,0.00017266607],"domain_scores_gemma":[0.9992156,0.0002603017,0.00012081823,0.00020222951,0.0001473766,0.00005364251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000108191,0.00010855623,0.0002373743,0.000015035769,0.00013471383,0.0000071664786,0.00015375478,0.000030356356,0.00013565058],"category_scores_gemma":[0.000029202642,0.0000936127,0.00007874804,0.0001938127,0.00007561753,0.00007443942,0.00003373358,0.000051186125,0.0000088493925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001279483,0.00006599698,0.00014734574,0.000013286076,0.0000299828,5.381069e-8,0.0000632604,0.000010688568,0.0063805333,0.9896864,0.0025204886,0.0010691307],"study_design_scores_gemma":[0.00051600323,0.000053936616,0.000006022663,0.0000058192636,0.000016778216,4.1041338e-7,0.00006045788,0.0003194497,0.04999799,0.9285467,0.020368755,0.00010767781],"about_ca_topic_score_codex":0.00002755847,"about_ca_topic_score_gemma":1.0799692e-7,"teacher_disagreement_score":0.2755324,"about_ca_system_score_codex":0.000009423294,"about_ca_system_score_gemma":0.000037246416,"threshold_uncertainty_score":0.38174152},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9924631,0.0038200885,9.017939e-7,0.000009224467,0.0012564189,0.00010154944,0.000002781012,0.00009134137,0.0022545946],"genre_scores_gemma":[0.99979717,0.000083730636,0.000006415772,0.000004372512,0.000006954396,0.0000110423925,6.7206696e-7,0.000019876856,0.00006978123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993606,0.000031326465,0.0002572887,0.000080718164,0.00012602568,0.00014401198],"domain_scores_gemma":[0.99963254,0.000018032191,0.000045799443,0.00024009876,0.00002710191,0.000036401776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010082013,0.000101555226,0.00022256207,0.000070025475,0.000019663654,0.0000048571487,0.00015599153,0.0000619418,0.00003127727],"category_scores_gemma":[0.000013529767,0.00009258759,0.00006716589,0.0001467902,0.000057461813,0.00011815858,0.000017433778,0.00007412126,0.000033643257],"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.0000091120255,0.00014401662,0.0017550439,0.0006014883,0.00011273111,0.000003555708,0.001785662,0.00021114851,0.12536311,0.8681887,0.0011402114,0.0006852687],"study_design_scores_gemma":[0.0017108415,0.0002422153,0.0031551558,0.000471724,0.0000546624,0.000013681131,0.00047989073,0.005124362,0.5749585,0.41222858,0.0010173252,0.0005430767],"about_ca_topic_score_codex":0.000007933866,"about_ca_topic_score_gemma":5.1325407e-7,"teacher_disagreement_score":0.45596007,"about_ca_system_score_codex":0.000011211061,"about_ca_system_score_gemma":0.0000018477771,"threshold_uncertainty_score":0.3775612},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92066205,0.00056436326,0.0613833,0.0029845731,0.0013825778,0.00046009524,0.000002935958,0.0003663159,0.012193795],"genre_scores_gemma":[0.9948646,0.000026138856,0.004430025,0.00021179071,0.0000074821296,0.000023299934,0.000001257553,0.000012088651,0.00042331635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843544,0.00012721732,0.00023633441,0.00038654974,0.0003489782,0.00046549903],"domain_scores_gemma":[0.99891925,0.00015742541,0.00005924377,0.0006778539,0.00006464638,0.00012155605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003998172,0.00013557114,0.00016764137,0.00017538521,0.00009161578,0.00009265681,0.001126522,0.000051039802,0.000038409755],"category_scores_gemma":[0.000108187836,0.00013902875,0.000046589797,0.00086960825,0.000053478932,0.00080695,0.000273834,0.00029067442,0.00016210192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011454923,0.000119100245,0.0027183993,0.00000337976,0.0000056613517,0.000042373635,0.00029369563,0.00025931653,0.00036184452,0.9848086,0.0003412518,0.011034888],"study_design_scores_gemma":[0.0013382528,0.00006295619,0.0048286146,0.00002644067,6.981667e-7,0.000007782268,0.000013340982,0.011840679,0.0027393054,0.96768856,0.011217769,0.00023559417],"about_ca_topic_score_codex":0.000007434679,"about_ca_topic_score_gemma":0.000021925667,"teacher_disagreement_score":0.07420256,"about_ca_system_score_codex":0.00018568635,"about_ca_system_score_gemma":0.00004425363,"threshold_uncertainty_score":0.5669428},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.575923,0.0000746747,0.42180002,0.00033853552,0.0007771416,0.00024444607,0.000023171453,0.00038480706,0.00043415496],"genre_scores_gemma":[0.7659937,0.000009755431,0.23370512,0.00012631212,0.000015651009,0.00005688833,0.000019265834,0.00001370823,0.000059558126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998783,0.000051931966,0.00023522439,0.0004242942,0.00022922506,0.00027632134],"domain_scores_gemma":[0.9988406,0.00013446459,0.00011014205,0.000739029,0.00006848474,0.000107318396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014176339,0.00015288977,0.0001733096,0.00008095513,0.00036536693,0.00013118377,0.0007101107,0.00006605397,0.000013946159],"category_scores_gemma":[0.000044402557,0.00015625807,0.00006631607,0.00043193466,0.0000749115,0.00060081895,0.00023405446,0.00013520666,0.000049126127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021291515,0.0011337536,0.05169876,0.000027124863,0.00029452416,0.0004996369,0.005368998,0.000360701,0.04580347,0.7994613,0.023986263,0.07134417],"study_design_scores_gemma":[0.0020945682,0.0002496857,0.046176977,0.00019869255,0.000063419226,0.00019951543,0.00014419657,0.23961072,0.033139553,0.66291136,0.013684979,0.0015263194],"about_ca_topic_score_codex":0.0002591276,"about_ca_topic_score_gemma":0.000004998229,"teacher_disagreement_score":0.23925002,"about_ca_system_score_codex":0.00006084676,"about_ca_system_score_gemma":0.000057051187,"threshold_uncertainty_score":0.6372019},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92463416,0.0021904523,0.0035142184,0.002055506,0.006064106,0.00026708082,0.0000011055736,0.00035586182,0.060917515],"genre_scores_gemma":[0.9970861,0.00014213537,0.0020513728,0.00005001115,0.0000027365772,0.0000059672657,2.0148858e-7,0.000006283819,0.0006551701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912155,0.000046159807,0.00018984436,0.00018054605,0.00019857149,0.00026332916],"domain_scores_gemma":[0.9989857,0.0002836711,0.000095888005,0.0005083294,0.00007078955,0.000055617078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014714246,0.00008892468,0.00010588092,0.000013285917,0.00032237393,0.000075513795,0.0007463313,0.000036817437,0.00001567721],"category_scores_gemma":[0.00008761117,0.00006393983,0.000047469,0.00028506017,0.00006943523,0.00022436013,0.00017636277,0.00009765556,0.00013101425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012641589,0.000026562602,0.00047273558,0.0000020162631,0.0000072754106,0.000004456741,0.00015643434,0.000005061591,0.00004145674,0.97388786,0.0011668392,0.024228023],"study_design_scores_gemma":[0.00032441027,0.00003260371,0.0004891508,0.0000070526767,0.0000016870727,0.000007759659,0.000025708132,0.0057867947,0.00053125917,0.98061407,0.012078566,0.0001009445],"about_ca_topic_score_codex":0.0000033649726,"about_ca_topic_score_gemma":0.0000016451507,"teacher_disagreement_score":0.072451964,"about_ca_system_score_codex":0.00001911827,"about_ca_system_score_gemma":0.000010828189,"threshold_uncertainty_score":0.26073906},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9957724,0.00010743743,0.002222276,0.000017581322,0.00019349957,0.00015252209,0.000003673026,0.000041752985,0.001488813],"genre_scores_gemma":[0.99778914,0.0000068061163,0.0021325778,0.0000171468,0.000002644228,0.000008373629,0.0000025703619,0.000005896942,0.000034831144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892825,0.00010146869,0.00028817658,0.00026862565,0.00021991064,0.00019358748],"domain_scores_gemma":[0.9992907,0.000096216274,0.00013995329,0.00035381806,0.00007122645,0.00004807749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019717506,0.00011101272,0.00026494553,0.00010595386,0.000037082747,0.000016958627,0.0006213093,0.00005750961,0.000039715273],"category_scores_gemma":[0.000048677946,0.00010553717,0.000043470674,0.00057478825,0.00008492841,0.0008510906,0.00008179683,0.00012116654,0.0000050007393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013299265,0.0008283369,0.02526886,0.0000543194,0.000040917505,0.00007038031,0.0043353844,0.0014346458,0.0057237893,0.8562925,0.00001869677,0.10579918],"study_design_scores_gemma":[0.0023454758,0.0005432565,0.15966074,0.00012930561,0.000008228194,0.000011142642,0.00013286897,0.017514681,0.044596255,0.7747598,0.00002749649,0.00027069016],"about_ca_topic_score_codex":0.00017096553,"about_ca_topic_score_gemma":0.00012603698,"teacher_disagreement_score":0.13439189,"about_ca_system_score_codex":0.000035650944,"about_ca_system_score_gemma":0.00005560832,"threshold_uncertainty_score":0.4303681},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99674237,0.0005048422,0.00008107581,0.000084512656,0.0016296363,0.0001299303,0.0000039440515,0.00015725064,0.00066646875],"genre_scores_gemma":[0.99786276,0.00008514731,0.0019454837,0.000018393272,9.827581e-7,0.000009046856,0.0000022968186,0.0000126771365,0.000063224164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981697,0.00006810301,0.0006186185,0.00031579845,0.00042798198,0.0003997534],"domain_scores_gemma":[0.9982707,0.0003204979,0.00039431913,0.0006390583,0.00029598625,0.00007945789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010284537,0.0001439747,0.00040469968,0.00047868895,0.0000923422,0.00002076515,0.00075191766,0.0000822709,0.0000029195703],"category_scores_gemma":[0.00013736932,0.00014254337,0.00015505248,0.002128608,0.0001413276,0.00036202144,0.00050790637,0.00011935628,0.000008092352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051850784,0.000106640015,0.0067652967,0.00016268213,0.00003750063,0.00000293694,0.0003436662,0.0001365146,0.053246826,0.93816644,0.00062665425,0.00039966515],"study_design_scores_gemma":[0.00059072144,0.0001903933,0.0020441874,0.00016276124,0.000013693054,0.0000011397105,0.00009554257,0.0015421711,0.114976004,0.8802259,0.000032688575,0.00012478912],"about_ca_topic_score_codex":0.000095782016,"about_ca_topic_score_gemma":0.000001292637,"teacher_disagreement_score":0.061729174,"about_ca_system_score_codex":0.000009971925,"about_ca_system_score_gemma":0.000083617386,"threshold_uncertainty_score":0.581275},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008046184,0.0038502736,2.9417203e-7,0.0006500519,0.11953272,0.0005243616,0.0003526087,0.00047928523,0.8665642],"genre_scores_gemma":[0.11372848,0.0006064352,0.0000061992682,0.00052461005,0.0004142787,0.00017397902,0.00052389846,0.0002805697,0.88374156],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968697,0.00014988221,0.0006654411,0.00083667587,0.00063380133,0.0008445331],"domain_scores_gemma":[0.9980039,0.00032313028,0.0003853899,0.00082763855,0.0002659921,0.00019394634],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00022053858,0.0008375776,0.001119611,0.00041429445,0.001614326,0.00024586136,0.0008073376,0.0003284976,0.0094867265],"category_scores_gemma":[0.00007033365,0.00078045484,0.00044864332,0.00014897334,0.00078270404,0.00016148781,0.000446932,0.0010711033,0.09011897],"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.000012150085,0.00006983089,0.0000023548714,0.00010511589,0.00020553137,0.00003230968,0.009011068,0.000001712214,0.0000023582513,0.426974,0.5633443,0.00023927695],"study_design_scores_gemma":[0.0005439023,0.00016862355,0.0000083777595,0.00016691479,0.000099439974,0.000002597534,0.0007313669,0.0000019250347,0.000016942215,0.22247142,0.7750744,0.00071407866],"about_ca_topic_score_codex":0.00030820104,"about_ca_topic_score_gemma":0.00039913668,"teacher_disagreement_score":0.21173012,"about_ca_system_score_codex":0.0002125902,"about_ca_system_score_gemma":0.00014187921,"threshold_uncertainty_score":0.99968547},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9958408,0.0005530396,0.000031189156,0.00048378346,0.0024708398,0.00010936331,0.0000030797619,0.0003146667,0.00019326259],"genre_scores_gemma":[0.9975767,0.00018563136,0.002090515,0.000057564823,0.0000017600704,0.0000065530257,0.000003512088,0.000011602589,0.000066160326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987102,0.000051610637,0.000279205,0.00035203862,0.000294548,0.00031235442],"domain_scores_gemma":[0.9991045,0.00009101848,0.00009746639,0.0004699394,0.000105069645,0.0001319806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004533822,0.00013727754,0.00021982414,0.00024318203,0.00013701078,0.00006365405,0.0004178827,0.0000668574,0.0000019057959],"category_scores_gemma":[0.000048260015,0.00012780477,0.00006331214,0.0010389007,0.00008295869,0.00019490274,0.00027330345,0.000118328266,0.000025820184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035920682,0.00005213784,0.008661333,0.000027614336,0.000025485188,0.000018645942,0.00048133728,0.000042744607,0.006572565,0.97984606,0.0024120288,0.0018564567],"study_design_scores_gemma":[0.0009867672,0.00016214368,0.0080512,0.000067839785,0.000012201605,0.000013240849,0.000055814508,0.007654271,0.0069268197,0.97547084,0.00036763956,0.00023120515],"about_ca_topic_score_codex":0.00009264878,"about_ca_topic_score_gemma":0.0000016901816,"teacher_disagreement_score":0.0076115266,"about_ca_system_score_codex":0.000009205368,"about_ca_system_score_gemma":0.00003319519,"threshold_uncertainty_score":0.52117276},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917745,0.000045104192,0.000012968928,0.0005577147,0.0021082903,0.00010634782,0.000007215232,0.00019387474,0.005194004],"genre_scores_gemma":[0.99892735,0.000023731465,0.00056677026,0.00004793615,7.3682077e-7,0.0000049624423,0.0000043789887,0.000010971723,0.0004131647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986696,0.000076228935,0.00036928488,0.00029991628,0.00035451257,0.00023045485],"domain_scores_gemma":[0.998674,0.00019893622,0.00017215408,0.0007389353,0.0001433618,0.00007266158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005724492,0.00011753215,0.00022169139,0.000180699,0.00004623738,0.000016117521,0.00054883305,0.000071854025,0.000007185105],"category_scores_gemma":[0.00008615399,0.000104917664,0.00010349346,0.0012880426,0.00007975269,0.000098516764,0.0001409939,0.0001059302,0.00020077896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022135799,0.00011808163,0.0020244725,0.000016807884,0.000022296797,0.0000063821153,0.0006403264,0.00003443345,0.0013817764,0.9831486,0.012021057,0.0005636801],"study_design_scores_gemma":[0.0014277617,0.00014410741,0.0042448286,0.000072133436,0.000005936853,0.0000025109173,0.000023452534,0.00096682936,0.012761215,0.97978586,0.00043127386,0.00013410249],"about_ca_topic_score_codex":0.00005190158,"about_ca_topic_score_gemma":9.88667e-7,"teacher_disagreement_score":0.011589783,"about_ca_system_score_codex":0.000008068226,"about_ca_system_score_gemma":0.000037102436,"threshold_uncertainty_score":0.42784184},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938204,0.000020327576,0.000024479928,0.0006874261,0.00102786,0.00034472722,0.000016427146,0.00006817517,0.0039901426],"genre_scores_gemma":[0.99930155,0.00000938841,0.00014149667,0.0000103237135,0.000009571833,0.000036903424,0.0000069192697,0.000018182098,0.00046566033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987525,0.00013559053,0.00042153252,0.00014783799,0.00038550262,0.00015706544],"domain_scores_gemma":[0.9979668,0.00069626217,0.0003340809,0.0006669554,0.00030324134,0.00003262751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000665224,0.00010687077,0.0002482684,0.00008718961,0.00013203609,0.000011130503,0.0004212233,0.00008341289,0.000038203314],"category_scores_gemma":[0.00086960936,0.00008548822,0.00012975202,0.0009866246,0.00015989601,0.000078802164,0.00020183584,0.00012842468,0.000013098377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008189295,0.00013245779,0.0010658285,0.00006388386,0.00003045216,1.9387434e-7,0.00061866106,6.6827283e-7,0.004476798,0.98517406,0.00812878,0.0003000032],"study_design_scores_gemma":[0.0005248555,0.000050597082,0.033952765,0.00003495061,0.00004028172,6.3767715e-7,0.00012472244,0.00006833045,0.032943133,0.9315993,0.00058345345,0.000076925106],"about_ca_topic_score_codex":0.000026733653,"about_ca_topic_score_gemma":0.000007218735,"teacher_disagreement_score":0.053574737,"about_ca_system_score_codex":0.000039198814,"about_ca_system_score_gemma":0.00007470276,"threshold_uncertainty_score":0.34861082},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9913554,0.00037995065,0.0008049236,0.001757568,0.0036650316,0.00018723521,0.0000045936386,0.00078712846,0.0010581276],"genre_scores_gemma":[0.996582,0.00004211078,0.0030114332,0.00014035511,7.1720285e-7,0.000009713398,0.0000031965078,0.000012284524,0.0001981984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864596,0.000054330667,0.00025757396,0.00035440316,0.00039747168,0.0002902878],"domain_scores_gemma":[0.9988352,0.00013465591,0.00010374437,0.0007286885,0.000115529685,0.000082169296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046402824,0.000130376,0.00019130652,0.00021617096,0.000117680356,0.00004203259,0.00061377336,0.00006104168,0.0000024608764],"category_scores_gemma":[0.00008011185,0.000121976555,0.00008624032,0.0015682869,0.000059861504,0.0001357264,0.00016168435,0.00012632304,0.0001266046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044013073,0.000057326062,0.0003729731,0.000015934593,0.000009305647,0.000012305445,0.00022527363,0.00018772439,0.0038956276,0.9915057,0.002284131,0.0014293437],"study_design_scores_gemma":[0.0004908204,0.00011391822,0.00060675346,0.000082121485,0.000003929576,0.0000011948556,0.000007814537,0.008074173,0.008147453,0.9815965,0.00073190435,0.00014338805],"about_ca_topic_score_codex":0.000019790557,"about_ca_topic_score_gemma":0.0000012753185,"teacher_disagreement_score":0.009909124,"about_ca_system_score_codex":0.000013169844,"about_ca_system_score_gemma":0.00003257099,"threshold_uncertainty_score":0.49740595},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99182934,0.000067259585,0.000030158099,0.00034836656,0.00143785,0.00007494248,8.072054e-7,0.0004452664,0.005766024],"genre_scores_gemma":[0.9986254,0.00001168272,0.0007930662,0.00006333323,2.3834475e-7,0.000009082528,0.0000015338433,0.0000069069124,0.0004887425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990477,0.00003176928,0.00019811385,0.00023650296,0.0002553257,0.00023058956],"domain_scores_gemma":[0.99923503,0.00008864624,0.000073311334,0.00043247888,0.00009497269,0.0000755561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000346649,0.00008636149,0.0001419181,0.0001779231,0.00007675436,0.000031062482,0.0005293551,0.000048649108,0.0000061456303],"category_scores_gemma":[0.00004227922,0.00008240624,0.00006732081,0.0011369672,0.000052368217,0.00009929979,0.00022699563,0.000082015555,0.00014457341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016642468,0.00003356818,0.0019376869,0.000009042913,0.000009885284,0.000007498793,0.00012512712,0.000047685568,0.00089940015,0.9909856,0.005524517,0.00041834253],"study_design_scores_gemma":[0.00038500456,0.00009497502,0.0035929668,0.000016688988,0.0000032620542,0.000001207786,0.000011024981,0.0028350332,0.0045367577,0.98754823,0.00087649043,0.00009836821],"about_ca_topic_score_codex":0.000042801275,"about_ca_topic_score_gemma":6.712306e-7,"teacher_disagreement_score":0.006796088,"about_ca_system_score_codex":0.0000068554755,"about_ca_system_score_gemma":0.000031301395,"threshold_uncertainty_score":0.33604288},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907372,0.00018077824,0.000005791466,0.00018843188,0.00069497514,0.0002095035,0.000006013193,0.000052644453,0.007924642],"genre_scores_gemma":[0.99889356,0.0000023545554,0.0005199473,0.000011128291,0.000012333806,0.000005434844,0.0000014765624,0.000014469861,0.0005392946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894816,0.00010040587,0.00035987535,0.00016848059,0.00022787957,0.00019523063],"domain_scores_gemma":[0.99879426,0.00026474797,0.00025586475,0.00053153,0.00012954911,0.000024071065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024415067,0.0001144073,0.00031783117,0.000079223304,0.00005283692,0.0000034242228,0.00029803306,0.000051377912,0.000041249623],"category_scores_gemma":[0.00042625878,0.0000819056,0.00011237609,0.0006696045,0.00019507727,0.00003009226,0.000092322916,0.00012019578,0.000003382502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004452465,0.0002981361,0.04583869,0.000046566478,0.00002633191,9.925828e-7,0.00009040817,0.0000024987382,0.0021648912,0.949001,0.0022972077,0.00022879115],"study_design_scores_gemma":[0.0006354887,0.000028710492,0.088813365,0.000017411854,0.00004254144,0.000004959334,0.000023430563,0.00001769409,0.043421388,0.8667585,0.00015409241,0.000082416074],"about_ca_topic_score_codex":0.0005740178,"about_ca_topic_score_gemma":0.00004332781,"teacher_disagreement_score":0.082242526,"about_ca_system_score_codex":0.000025318019,"about_ca_system_score_gemma":0.000062009785,"threshold_uncertainty_score":0.33400133},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9932544,0.000033819655,0.00258071,0.0002389132,0.0011027904,0.0002451463,0.000004283878,0.00043928245,0.0021006071],"genre_scores_gemma":[0.99844027,0.000020241907,0.0010698923,0.000034554803,0.0000029549053,0.000035597248,0.000004928976,0.00001745858,0.0003741149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998057,0.00018259905,0.0002774187,0.0004034229,0.0006082123,0.00047132667],"domain_scores_gemma":[0.9982357,0.0004298573,0.00010051692,0.0008800296,0.00021749217,0.00013638465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058747095,0.00014581069,0.00023787122,0.00026963273,0.00010484704,0.000046368707,0.0012493456,0.00008188313,0.000059427337],"category_scores_gemma":[0.00022028983,0.000145539,0.00010007969,0.002579186,0.00012654874,0.00029227565,0.00058764446,0.00022907418,0.0004847822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013250379,0.00007119983,0.007435694,0.000018115605,0.00002915536,0.00004406696,0.00030602884,0.000028360097,0.0019121456,0.9884721,0.0006476636,0.0010222141],"study_design_scores_gemma":[0.000840995,0.00006995323,0.013881239,0.000021080192,0.000003591174,0.000011746278,0.00004517918,0.0021140326,0.0057778237,0.97688025,0.00019025237,0.0001638644],"about_ca_topic_score_codex":0.000021560845,"about_ca_topic_score_gemma":0.000002839556,"teacher_disagreement_score":0.011591863,"about_ca_system_score_codex":0.0000311583,"about_ca_system_score_gemma":0.000072633586,"threshold_uncertainty_score":0.62310565},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99752414,0.00009200861,0.00005293936,0.00037936124,0.0013614864,0.00007729668,0.0000020659743,0.00016141793,0.0003493113],"genre_scores_gemma":[0.9994484,0.000036201443,0.00038801125,0.00004736158,3.4383638e-7,0.0000042720553,0.0000027179433,0.0000068101726,0.00006586954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989829,0.00006883248,0.00025675667,0.0002158779,0.00030203583,0.00017357133],"domain_scores_gemma":[0.9990667,0.00014870198,0.00012832487,0.00051076885,0.000089552865,0.00005591829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004477527,0.00009116273,0.00017978178,0.00027036914,0.00004757017,0.000013633377,0.00034645188,0.000048083853,0.0000027906667],"category_scores_gemma":[0.000062527615,0.000079690035,0.00008107761,0.0009893851,0.00006946507,0.00013865362,0.00015899261,0.00007850336,0.000035119578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030958465,0.00009056019,0.00042895463,0.000021695978,0.000011070182,0.0000030923843,0.00017263935,0.0001287702,0.005682805,0.99123573,0.0015441515,0.00067740894],"study_design_scores_gemma":[0.00039935738,0.00023191502,0.002647485,0.00006446401,0.0000033285228,6.778389e-7,0.000012391718,0.0016854845,0.024898192,0.9699427,0.00003405621,0.00007995982],"about_ca_topic_score_codex":0.00003268373,"about_ca_topic_score_gemma":3.8722527e-7,"teacher_disagreement_score":0.021293068,"about_ca_system_score_codex":0.0000068136083,"about_ca_system_score_gemma":0.000026363492,"threshold_uncertainty_score":0.32496652},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99675596,0.0002092649,0.00001186373,0.0003765158,0.0011638569,0.000119737124,0.0000017440316,0.00027555897,0.0010855249],"genre_scores_gemma":[0.9986383,0.000045984034,0.000965763,0.000039688137,4.3994228e-7,0.000015432994,0.0000016781054,0.0000100911575,0.0002826492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880004,0.000040127965,0.00024610726,0.00036863523,0.00026158366,0.00028351028],"domain_scores_gemma":[0.9990896,0.0001294264,0.000094727664,0.0004611385,0.00010064216,0.00012448295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045737185,0.00012667669,0.00021123338,0.0002585353,0.00011667277,0.000056514626,0.00035106545,0.000066512875,0.0000042504635],"category_scores_gemma":[0.000062240026,0.00012154749,0.00005957783,0.0012119742,0.00010573265,0.00023421536,0.00033161588,0.00007853744,0.000043963653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046201835,0.00004655811,0.002029811,0.000023898045,0.000016012977,0.000009036402,0.00028129655,0.0000074655363,0.0066123544,0.9886344,0.001664885,0.00066964794],"study_design_scores_gemma":[0.00078741607,0.00018016582,0.006050533,0.000034194083,0.000007780107,0.0000117659165,0.000045923713,0.001633356,0.013388653,0.97746694,0.00023355104,0.00015973419],"about_ca_topic_score_codex":0.00005331325,"about_ca_topic_score_gemma":5.768918e-7,"teacher_disagreement_score":0.011167487,"about_ca_system_score_codex":0.000008883052,"about_ca_system_score_gemma":0.000044248747,"threshold_uncertainty_score":0.49565628},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99514365,0.000032267406,0.000019729656,0.0003089439,0.0014548437,0.00012965887,0.000006533868,0.00023180677,0.0026725363],"genre_scores_gemma":[0.99866647,0.000026203608,0.0010962905,0.000057411675,5.120855e-7,0.000008078757,0.000006259132,0.000011409006,0.00012736674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982779,0.000097962526,0.000535551,0.00033800644,0.0004854276,0.00026512117],"domain_scores_gemma":[0.99835485,0.00026771758,0.00026309703,0.00087459164,0.00015376449,0.0000859603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069967814,0.00014486397,0.00029366798,0.0003126696,0.00007144591,0.000022266082,0.000621892,0.000075662465,0.000005395895],"category_scores_gemma":[0.0001389633,0.00013039971,0.00013614976,0.0021267973,0.000102701226,0.00012803513,0.00016561846,0.000116710646,0.00014221402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013058748,0.00016223849,0.0009483147,0.000046171564,0.000028228196,0.000007968694,0.00042482896,0.00007404896,0.002290101,0.98918986,0.0064522764,0.00036288265],"study_design_scores_gemma":[0.0011403101,0.00021216774,0.0045630266,0.0001402985,0.000007965383,0.000003321734,0.000019199224,0.0015315363,0.010763499,0.98143274,0.000051284285,0.00013462773],"about_ca_topic_score_codex":0.00006816532,"about_ca_topic_score_gemma":0.0000013607485,"teacher_disagreement_score":0.008473398,"about_ca_system_score_codex":0.000008546174,"about_ca_system_score_gemma":0.000041720265,"threshold_uncertainty_score":0.53175455},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9929303,0.00020159784,0.000051120263,0.00050954614,0.0039965697,0.00013305001,0.0000023384207,0.0007039555,0.0014715353],"genre_scores_gemma":[0.99848264,0.00004662612,0.0011228719,0.00006289399,7.1135713e-7,0.000008973495,0.000007867604,0.000016084969,0.00025130596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836797,0.00008411939,0.00040680743,0.00038181373,0.00038852828,0.00037076205],"domain_scores_gemma":[0.99871635,0.00019507397,0.00015289237,0.0006550064,0.00016684564,0.000113824666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006275018,0.00015251823,0.0002497323,0.00031857073,0.00014797342,0.000051812418,0.0007138878,0.00010443661,0.000008304682],"category_scores_gemma":[0.00012419857,0.00014755745,0.00012000685,0.0021887629,0.00008147823,0.00021168237,0.00034881986,0.00018075606,0.00019462536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038738754,0.00006829924,0.0055295476,0.000014587199,0.000031280713,0.000015498923,0.00032001126,0.000071469156,0.006437856,0.98199207,0.0034052117,0.002110312],"study_design_scores_gemma":[0.0009223106,0.00012349275,0.0038208347,0.000047712892,0.000010621674,0.0000032443345,0.000018803436,0.006672892,0.0035862683,0.9844417,0.00016867854,0.00018342477],"about_ca_topic_score_codex":0.000069413836,"about_ca_topic_score_gemma":0.0000035267171,"teacher_disagreement_score":0.0066014226,"about_ca_system_score_codex":0.000011171736,"about_ca_system_score_gemma":0.000053347947,"threshold_uncertainty_score":0.6017218},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9958276,0.000087361725,0.00038976668,0.00090485025,0.001050875,0.0004150332,0.000018646026,0.00030092153,0.0010049444],"genre_scores_gemma":[0.9882044,0.00027092168,0.010474229,0.000194121,0.00002280663,0.00006168941,0.0000661746,0.00007085299,0.0006347894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983006,0.0000926995,0.00051124615,0.00034510027,0.00037547937,0.00037487145],"domain_scores_gemma":[0.99802524,0.0008839223,0.00025151513,0.0005904272,0.00012885178,0.00012005043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025200067,0.00024020634,0.000356814,0.00022157808,0.00021222212,0.000037032944,0.00024699006,0.00015137174,0.000097612],"category_scores_gemma":[0.0012182796,0.00025164997,0.000085385385,0.0006785054,0.0001310484,0.00016833206,0.00014201066,0.00020990703,0.00005188788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015932039,0.00013991573,0.0012491703,0.00007906616,0.000059804654,0.0000057874618,0.00038950366,0.000011963579,0.0015896916,0.9887542,0.0072738356,0.00043110768],"study_design_scores_gemma":[0.0012605478,0.00008838741,0.0028345431,0.00008470689,0.000038234975,0.0000027614074,0.00009202585,0.00011501921,0.0094825635,0.9841352,0.0016277704,0.00023825408],"about_ca_topic_score_codex":0.000009972129,"about_ca_topic_score_gemma":0.0000047116355,"teacher_disagreement_score":0.010084462,"about_ca_system_score_codex":0.00009189479,"about_ca_system_score_gemma":0.000061684324,"threshold_uncertainty_score":0.99999356},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9116455,0.00013437672,0.026425086,0.00040694207,0.00036475732,0.0015095265,0.000049942588,0.0015433229,0.057920594],"genre_scores_gemma":[0.99638593,0.000005478434,0.003129488,0.00001581387,0.00007426289,0.00018351233,0.00005453042,0.000027581676,0.00012337227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990419,0.000035396148,0.00023473206,0.00023281491,0.00017291663,0.00028224965],"domain_scores_gemma":[0.99917835,0.00007169882,0.00013670562,0.00046140616,0.000088183646,0.00006367927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016027203,0.00014360575,0.0002604278,0.0000745713,0.00012443574,0.00002159843,0.00026583616,0.00003214539,0.000045426652],"category_scores_gemma":[4.908551e-7,0.0001364498,0.00010249,0.0009674291,0.000042467065,0.00009089499,0.00010885217,0.00011824852,0.000027208685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009136771,0.00009578574,0.0151728345,0.0000060130046,0.00018306996,5.7319784e-7,0.000074641815,0.0067195436,0.000037580154,0.95229006,0.024451036,0.0009597123],"study_design_scores_gemma":[0.00047057637,0.000060498063,0.0013296047,0.000021708689,0.000118648575,2.600191e-7,0.000046692363,0.026136307,0.0004390922,0.96260375,0.0085375225,0.00023532732],"about_ca_topic_score_codex":0.000072499875,"about_ca_topic_score_gemma":0.0000032639387,"teacher_disagreement_score":0.084740505,"about_ca_system_score_codex":0.000018837463,"about_ca_system_score_gemma":0.000050784554,"threshold_uncertainty_score":0.5564261},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98907906,0.0004361499,0.00019988407,0.004546384,0.004028405,0.0005780549,0.0000035016826,0.00066806556,0.00046048503],"genre_scores_gemma":[0.9989389,0.000113800554,0.00036055985,0.0002943853,7.343549e-7,0.00007085749,0.000004094061,0.000014780683,0.00020185807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985035,0.000098190154,0.00026491433,0.00051374245,0.00026697814,0.00035266567],"domain_scores_gemma":[0.9976947,0.0011531411,0.00007940608,0.00088044844,0.000084789,0.00010752406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012002755,0.00016354554,0.00017269801,0.00017631633,0.00048113675,0.00011689295,0.00060058525,0.00010986551,0.0000020850025],"category_scores_gemma":[0.00027200757,0.000116605,0.000110119065,0.0012576706,0.00014714096,0.00013864289,0.00021194619,0.00021774911,0.000047139416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011496117,0.000052678064,0.00044732774,0.000011013349,0.000027153943,0.0000024429266,0.00028543404,0.000021437461,0.0002438994,0.97776747,0.019042417,0.0020872497],"study_design_scores_gemma":[0.0010381499,0.00019954338,0.0036816082,0.000025394853,0.000012441599,0.0000021752828,0.000014768485,0.018829025,0.00024340818,0.9747199,0.0010835718,0.00015003174],"about_ca_topic_score_codex":0.00001875603,"about_ca_topic_score_gemma":0.0000021572243,"teacher_disagreement_score":0.018807588,"about_ca_system_score_codex":0.000013405187,"about_ca_system_score_gemma":0.000043047043,"threshold_uncertainty_score":0.4755014},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99521875,0.00014805795,0.0006349416,0.00073561975,0.0016840311,0.00015925527,0.000007662023,0.00054065045,0.00087103085],"genre_scores_gemma":[0.9970932,0.000026574728,0.0026725323,0.00011006427,8.279734e-7,0.000013599964,0.000020115112,0.000012954669,0.000050126848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845713,0.0000896393,0.00035769277,0.00037588787,0.00035968845,0.000359941],"domain_scores_gemma":[0.99883103,0.00012981638,0.00011996772,0.0006455082,0.0001578623,0.0001157939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040746023,0.00015456916,0.00024497788,0.00033933768,0.0001534003,0.0000706296,0.0006211272,0.000058730064,0.000011268065],"category_scores_gemma":[0.000031249445,0.0001510862,0.00012782612,0.0016099453,0.00010053681,0.00030596176,0.0002494332,0.0001238183,0.00029765512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042067863,0.00007871328,0.0025389711,0.000018237026,0.00002249146,0.000011348428,0.00018716695,0.00011622729,0.015543127,0.9776445,0.0032977103,0.0005373021],"study_design_scores_gemma":[0.00076177565,0.00015316781,0.0045369435,0.000051235987,0.000011975089,0.000009026486,0.000016036483,0.029910445,0.0054416596,0.95854104,0.0003703472,0.00019638009],"about_ca_topic_score_codex":0.000047432055,"about_ca_topic_score_gemma":0.0000015204763,"teacher_disagreement_score":0.029794218,"about_ca_system_score_codex":0.00001282434,"about_ca_system_score_gemma":0.000036038953,"threshold_uncertainty_score":0.6161117},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9964194,0.00008756628,0.0013264363,0.00032848393,0.00061198615,0.00017963648,0.0000019542947,0.00015134604,0.00089316815],"genre_scores_gemma":[0.99884653,0.00004800603,0.000864094,0.000012515494,0.0000019233667,0.000020206284,0.0000037400812,0.000008619058,0.00019436014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878997,0.000115550094,0.00023023825,0.00025819824,0.0003335346,0.00027249937],"domain_scores_gemma":[0.9990324,0.00027971886,0.00006743872,0.00046634965,0.00010063386,0.000053498366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006836874,0.00008898417,0.00016002479,0.0006017042,0.000042655804,0.000023935609,0.00073772244,0.000048174035,0.0000053855642],"category_scores_gemma":[0.00016786275,0.00008983454,0.000050962284,0.0029292125,0.000078361394,0.00036331118,0.0002642405,0.00013673342,0.000052073035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000117027075,0.000071196555,0.0036789677,0.00001060467,0.0000048725083,0.000018922074,0.0003821431,0.00013012026,0.0032481598,0.97507846,0.00015550114,0.017209347],"study_design_scores_gemma":[0.0007526994,0.000112382215,0.022540264,0.000022979784,8.6657207e-7,0.00000146976,0.000040419105,0.008692209,0.008844893,0.9587508,0.00015025021,0.00009078358],"about_ca_topic_score_codex":0.000016029915,"about_ca_topic_score_gemma":0.000016651458,"teacher_disagreement_score":0.018861296,"about_ca_system_score_codex":0.000028461867,"about_ca_system_score_gemma":0.00003368869,"threshold_uncertainty_score":0.36633462},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99241185,0.000066649365,0.0018371592,0.00041981848,0.0009772355,0.00025539636,0.0000026785858,0.00043013296,0.0035991005],"genre_scores_gemma":[0.99660945,0.000019325807,0.0026637458,0.000019838544,0.0000032222192,0.0000255399,0.0000030483252,0.000018008965,0.00063781074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998261,0.00015889933,0.000261511,0.00034894314,0.0005477722,0.00042189096],"domain_scores_gemma":[0.9984046,0.0002771213,0.00009793261,0.00097787,0.00012791072,0.0001145708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006212243,0.00013577082,0.00023478,0.00022016866,0.00010574564,0.000039614846,0.0012478005,0.000062876,0.000041919808],"category_scores_gemma":[0.00012659465,0.00013378898,0.00011085847,0.002201207,0.00015800113,0.00039627202,0.0004951443,0.00015150369,0.00047129366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000538104,0.00005207831,0.0024462265,0.000037259997,0.000023913268,0.000041598883,0.00034101377,0.000015194569,0.00312573,0.99041444,0.0018737242,0.0016234472],"study_design_scores_gemma":[0.00045389385,0.00006741082,0.0056705177,0.000035580546,0.0000033491021,0.000008945634,0.000035260724,0.0026678208,0.0067904647,0.98368776,0.0004392303,0.0001397648],"about_ca_topic_score_codex":0.0000075733724,"about_ca_topic_score_gemma":7.1781426e-7,"teacher_disagreement_score":0.006726671,"about_ca_system_score_codex":0.00002780998,"about_ca_system_score_gemma":0.00005144708,"threshold_uncertainty_score":0.6057684},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9949666,0.00019291915,0.000047115966,0.00039802454,0.0032285873,0.00021626159,0.0000041553835,0.0003440793,0.00060221023],"genre_scores_gemma":[0.9991498,0.00006696175,0.00039688242,0.000074758944,0.0000021983358,0.000015912652,0.0000097848215,0.000017507604,0.00026618005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834883,0.000112050766,0.00033097193,0.0005413359,0.00031681737,0.00034999326],"domain_scores_gemma":[0.99889505,0.00027023142,0.00015229976,0.00036649307,0.0001388463,0.00017706385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005781484,0.00021009044,0.00029495807,0.00027281037,0.00026811176,0.00011137196,0.00017237327,0.00013899757,0.000008186709],"category_scores_gemma":[0.00013640148,0.00021754403,0.00008345646,0.0010807109,0.00018511528,0.000410819,0.0002059029,0.00017101863,0.000019857702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033677396,0.00010052999,0.006764776,0.00007747756,0.00008368099,0.000016061545,0.002034846,0.00008627462,0.005697102,0.9790055,0.003639928,0.0024601582],"study_design_scores_gemma":[0.0031564261,0.00046287937,0.013825908,0.00011918569,0.000035356577,0.00016283285,0.00061500556,0.01829222,0.0035148708,0.95918983,0.00015415307,0.0004713442],"about_ca_topic_score_codex":0.00039604437,"about_ca_topic_score_gemma":0.000012795726,"teacher_disagreement_score":0.01981567,"about_ca_system_score_codex":0.000025019677,"about_ca_system_score_gemma":0.00004178825,"threshold_uncertainty_score":0.8871188},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903677,0.0000042124793,0.0000064702067,0.00012251495,0.00024762755,0.00012269903,0.000007275483,0.00015897318,0.008962535],"genre_scores_gemma":[0.9994634,0.000005008041,0.000044010347,0.000032586275,0.0000016621997,0.000030697396,0.0000051644906,0.000013961371,0.00040353963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994547,0.000033138556,0.0001472285,0.00010952551,0.00013353453,0.000121895144],"domain_scores_gemma":[0.99908006,0.0004551164,0.00006534784,0.0003302652,0.000034200802,0.000035027082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023515217,0.00007005656,0.00012212057,0.00011293142,0.000058043108,0.000005174517,0.00015859718,0.00004896416,0.000044138666],"category_scores_gemma":[0.00012340407,0.000064995205,0.00006341444,0.00056985376,0.000044596934,0.000023042274,0.000031538155,0.00008436544,0.00015106758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007464424,0.00010389165,0.0010403554,0.000019629611,0.000016100714,0.0000012490591,0.00012785736,0.0000015364669,0.00029547754,0.9882694,0.009982333,0.00013473352],"study_design_scores_gemma":[0.00029304303,0.000040269068,0.0025882726,0.000018496075,0.000008793865,4.3777223e-7,0.000052745276,0.000026952206,0.0021309906,0.99431974,0.00045540364,0.00006485517],"about_ca_topic_score_codex":0.0000033376766,"about_ca_topic_score_gemma":9.723093e-7,"teacher_disagreement_score":0.009526929,"about_ca_system_score_codex":0.000005391902,"about_ca_system_score_gemma":0.0000089078585,"threshold_uncertainty_score":0.26504275},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9979025,0.000020965666,0.0000063582415,0.00017991371,0.00007911665,0.0006352365,0.00003522901,0.000026609649,0.0011140752],"genre_scores_gemma":[0.99977535,0.0000070064034,0.00002117898,0.000015516967,0.000001348161,0.0000436043,0.000003310099,0.00001937795,0.000113296825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990036,0.00009038864,0.0003009272,0.00018591453,0.00028076573,0.00013841043],"domain_scores_gemma":[0.9984856,0.0006183992,0.00022137952,0.0005417579,0.000095827796,0.00003699175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000341756,0.00013981144,0.00030767274,0.00012996243,0.000068096946,0.0000049205614,0.00025102627,0.00010177837,0.000005763909],"category_scores_gemma":[0.0001453857,0.00008985362,0.00008297509,0.0006576465,0.00025766323,0.000024633075,0.00006027615,0.00019461138,6.8842957e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051257765,0.00029303107,0.005918084,0.00016261575,0.00011117496,0.0000012519575,0.0010591563,0.00001449046,0.0010178293,0.9897132,0.00099144,0.00020513011],"study_design_scores_gemma":[0.0015166029,0.0004866847,0.018628364,0.00023671995,0.000057162288,0.0000018559409,0.00019896864,0.00006395978,0.032129552,0.9465635,0.00002517237,0.000091471324],"about_ca_topic_score_codex":0.000009971409,"about_ca_topic_score_gemma":0.000012947101,"teacher_disagreement_score":0.043149736,"about_ca_system_score_codex":0.000008452831,"about_ca_system_score_gemma":0.000042554115,"threshold_uncertainty_score":0.3664124},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9958408,0.0005530396,0.000031189156,0.00048378346,0.0024708398,0.00010936331,0.0000030797619,0.0003146667,0.00019326259],"genre_scores_gemma":[0.9975767,0.00018563136,0.002090515,0.000057564823,0.0000017600704,0.0000065530257,0.000003512088,0.000011602589,0.000066160326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987102,0.000051610637,0.000279205,0.00035203862,0.000294548,0.00031235442],"domain_scores_gemma":[0.9991045,0.00009101848,0.00009746639,0.0004699394,0.000105069645,0.0001319806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004533822,0.00013727754,0.00021982414,0.00024318203,0.00013701078,0.00006365405,0.0004178827,0.0000668574,0.0000019057959],"category_scores_gemma":[0.000048260015,0.00012780477,0.00006331214,0.0010389007,0.00008295869,0.00019490274,0.00027330345,0.000118328266,0.000025820184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035920682,0.00005213784,0.008661333,0.000027614336,0.000025485188,0.000018645942,0.00048133728,0.000042744607,0.006572565,0.97984606,0.0024120288,0.0018564567],"study_design_scores_gemma":[0.0009867672,0.00016214368,0.0080512,0.000067839785,0.000012201605,0.000013240849,0.000055814508,0.007654271,0.0069268197,0.97547084,0.00036763956,0.00023120515],"about_ca_topic_score_codex":0.00009264878,"about_ca_topic_score_gemma":0.0000016901816,"teacher_disagreement_score":0.0076115266,"about_ca_system_score_codex":0.000009205368,"about_ca_system_score_gemma":0.00003319519,"threshold_uncertainty_score":0.52117276},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917745,0.000045104192,0.000012968928,0.0005577147,0.0021082903,0.00010634782,0.000007215232,0.00019387474,0.005194004],"genre_scores_gemma":[0.99892735,0.000023731465,0.00056677026,0.00004793615,7.3682077e-7,0.0000049624423,0.0000043789887,0.000010971723,0.0004131647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986696,0.000076228935,0.00036928488,0.00029991628,0.00035451257,0.00023045485],"domain_scores_gemma":[0.998674,0.00019893622,0.00017215408,0.0007389353,0.0001433618,0.00007266158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005724492,0.00011753215,0.00022169139,0.000180699,0.00004623738,0.000016117521,0.00054883305,0.000071854025,0.000007185105],"category_scores_gemma":[0.00008615399,0.000104917664,0.00010349346,0.0012880426,0.00007975269,0.000098516764,0.0001409939,0.0001059302,0.00020077896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022135799,0.00011808163,0.0020244725,0.000016807884,0.000022296797,0.0000063821153,0.0006403264,0.00003443345,0.0013817764,0.9831486,0.012021057,0.0005636801],"study_design_scores_gemma":[0.0014277617,0.00014410741,0.0042448286,0.000072133436,0.000005936853,0.0000025109173,0.000023452534,0.00096682936,0.012761215,0.97978586,0.00043127386,0.00013410249],"about_ca_topic_score_codex":0.00005190158,"about_ca_topic_score_gemma":9.88667e-7,"teacher_disagreement_score":0.011589783,"about_ca_system_score_codex":0.000008068226,"about_ca_system_score_gemma":0.000037102436,"threshold_uncertainty_score":0.42784184},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99182934,0.000067259585,0.000030158099,0.00034836656,0.00143785,0.00007494248,8.072054e-7,0.0004452664,0.005766024],"genre_scores_gemma":[0.9986254,0.00001168272,0.0007930662,0.00006333323,2.3834475e-7,0.000009082528,0.0000015338433,0.0000069069124,0.0004887425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990477,0.00003176928,0.00019811385,0.00023650296,0.0002553257,0.00023058956],"domain_scores_gemma":[0.99923503,0.00008864624,0.000073311334,0.00043247888,0.00009497269,0.0000755561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000346649,0.00008636149,0.0001419181,0.0001779231,0.00007675436,0.000031062482,0.0005293551,0.000048649108,0.0000061456303],"category_scores_gemma":[0.00004227922,0.00008240624,0.00006732081,0.0011369672,0.000052368217,0.00009929979,0.00022699563,0.000082015555,0.00014457341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016642468,0.00003356818,0.0019376869,0.000009042913,0.000009885284,0.000007498793,0.00012512712,0.000047685568,0.00089940015,0.9909856,0.005524517,0.00041834253],"study_design_scores_gemma":[0.00038500456,0.00009497502,0.0035929668,0.000016688988,0.0000032620542,0.000001207786,0.000011024981,0.0028350332,0.0045367577,0.98754823,0.00087649043,0.00009836821],"about_ca_topic_score_codex":0.000042801275,"about_ca_topic_score_gemma":6.712306e-7,"teacher_disagreement_score":0.006796088,"about_ca_system_score_codex":0.0000068554755,"about_ca_system_score_gemma":0.000031301395,"threshold_uncertainty_score":0.33604288},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9913554,0.00037995065,0.0008049236,0.001757568,0.0036650316,0.00018723521,0.0000045936386,0.00078712846,0.0010581276],"genre_scores_gemma":[0.996582,0.00004211078,0.0030114332,0.00014035511,7.1720285e-7,0.000009713398,0.0000031965078,0.000012284524,0.0001981984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864596,0.000054330667,0.00025757396,0.00035440316,0.00039747168,0.0002902878],"domain_scores_gemma":[0.9988352,0.00013465591,0.00010374437,0.0007286885,0.000115529685,0.000082169296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046402824,0.000130376,0.00019130652,0.00021617096,0.000117680356,0.00004203259,0.00061377336,0.00006104168,0.0000024608764],"category_scores_gemma":[0.00008011185,0.000121976555,0.00008624032,0.0015682869,0.000059861504,0.0001357264,0.00016168435,0.00012632304,0.0001266046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044013073,0.000057326062,0.0003729731,0.000015934593,0.000009305647,0.000012305445,0.00022527363,0.00018772439,0.0038956276,0.9915057,0.002284131,0.0014293437],"study_design_scores_gemma":[0.0004908204,0.00011391822,0.00060675346,0.000082121485,0.000003929576,0.0000011948556,0.000007814537,0.008074173,0.008147453,0.9815965,0.00073190435,0.00014338805],"about_ca_topic_score_codex":0.000019790557,"about_ca_topic_score_gemma":0.0000012753185,"teacher_disagreement_score":0.009909124,"about_ca_system_score_codex":0.000013169844,"about_ca_system_score_gemma":0.00003257099,"threshold_uncertainty_score":0.49740595},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99674237,0.0005048422,0.00008107581,0.000084512656,0.0016296363,0.0001299303,0.0000039440515,0.00015725064,0.00066646875],"genre_scores_gemma":[0.99786276,0.00008514731,0.0019454837,0.000018393272,9.827581e-7,0.000009046856,0.0000022968186,0.0000126771365,0.000063224164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981697,0.00006810301,0.0006186185,0.00031579845,0.00042798198,0.0003997534],"domain_scores_gemma":[0.9982707,0.0003204979,0.00039431913,0.0006390583,0.00029598625,0.00007945789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010284537,0.0001439747,0.00040469968,0.00047868895,0.0000923422,0.00002076515,0.00075191766,0.0000822709,0.0000029195703],"category_scores_gemma":[0.00013736932,0.00014254337,0.00015505248,0.002128608,0.0001413276,0.00036202144,0.00050790637,0.00011935628,0.000008092352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051850784,0.000106640015,0.0067652967,0.00016268213,0.00003750063,0.00000293694,0.0003436662,0.0001365146,0.053246826,0.93816644,0.00062665425,0.00039966515],"study_design_scores_gemma":[0.00059072144,0.0001903933,0.0020441874,0.00016276124,0.000013693054,0.0000011397105,0.00009554257,0.0015421711,0.114976004,0.8802259,0.000032688575,0.00012478912],"about_ca_topic_score_codex":0.000095782016,"about_ca_topic_score_gemma":0.000001292637,"teacher_disagreement_score":0.061729174,"about_ca_system_score_codex":0.000009971925,"about_ca_system_score_gemma":0.000083617386,"threshold_uncertainty_score":0.581275},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9918219,0.000020736687,0.000025164927,0.0007406344,0.0010572487,0.00037390843,0.000018834464,0.000072593946,0.0058689862],"genre_scores_gemma":[0.99951506,0.000009385792,0.00011198606,0.000011794008,0.000008333125,0.000036880712,0.0000083006835,0.000018907114,0.00027937136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986898,0.00015168922,0.0004452454,0.0001501433,0.00040046344,0.00016268357],"domain_scores_gemma":[0.9978107,0.0007863875,0.0003553936,0.00069424993,0.00031860248,0.00003464306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068773073,0.000112629685,0.00026901215,0.00008961748,0.00014341593,0.0000116493375,0.00044990118,0.0000859672,0.000037911974],"category_scores_gemma":[0.000808359,0.000090525755,0.00013400125,0.0010077951,0.00018342491,0.000078255274,0.00021772107,0.00013848377,0.000012926438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009068414,0.0001576926,0.0013397328,0.000067885754,0.000032869477,2.074561e-7,0.00060142507,7.2553064e-7,0.0034732565,0.9878707,0.0061881733,0.00025826847],"study_design_scores_gemma":[0.0006125082,0.00005674808,0.036496915,0.00003780784,0.00004209432,6.857987e-7,0.00013080264,0.0000814066,0.02716373,0.9347471,0.0005490275,0.00008115176],"about_ca_topic_score_codex":0.000028512164,"about_ca_topic_score_gemma":0.00000641847,"teacher_disagreement_score":0.05312357,"about_ca_system_score_codex":0.00003921565,"about_ca_system_score_gemma":0.00007397992,"threshold_uncertainty_score":0.3691533},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9708074,0.0044666673,0.00039376417,0.0000524362,0.018514838,0.00030485052,0.00017557867,0.0011889101,0.0040956],"genre_scores_gemma":[0.9988563,0.00007721336,0.000006842032,0.000023211553,0.000050790233,0.00016973799,0.0003322334,0.00012668566,0.00035700056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863374,0.0001236943,0.00036429087,0.00038215242,0.00019046197,0.00030563536],"domain_scores_gemma":[0.9992891,0.00006769948,0.00004607171,0.00044362695,0.000047908223,0.00010558631],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028171449,0.00036377812,0.0003360933,0.00014933085,0.00011897441,0.00021459132,0.0003140127,0.000352295,0.0000647483],"category_scores_gemma":[0.000015070694,0.00039911378,0.00016345966,0.0002209929,0.000027276268,0.00004615803,0.00024141668,0.0012386102,0.00038207104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006172584,0.00013479925,0.0007185344,0.0036496646,0.0014816589,0.00017147808,0.0064017256,0.0204441,0.02458811,0.75272614,0.1869218,0.002755782],"study_design_scores_gemma":[0.0003043309,0.000021367261,0.000066246255,0.00049950153,0.00013554974,0.000014057419,0.00028302852,0.041216433,0.0052497457,0.94855434,0.0028411706,0.0008142181],"about_ca_topic_score_codex":0.00003366933,"about_ca_topic_score_gemma":0.000004367948,"teacher_disagreement_score":0.19582818,"about_ca_system_score_codex":0.00012587289,"about_ca_system_score_gemma":0.000025819812,"threshold_uncertainty_score":0.9998461},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937267,0.00055232114,0.0021931997,0.0008981987,0.0006005866,0.00015503472,0.0000034476284,0.00031417538,0.0015563401],"genre_scores_gemma":[0.9966289,0.000094798976,0.0022620927,0.0002193219,0.000011628341,0.000011468233,0.000004997675,0.000015798008,0.00075099996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865615,0.000075381016,0.00016481758,0.00043269113,0.0002975753,0.00037340692],"domain_scores_gemma":[0.9985776,0.000637921,0.00016046311,0.0003856774,0.000097691714,0.00014065046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001485691,0.00022125259,0.00027261334,0.00008813259,0.00029213066,0.00013279596,0.0004392966,0.000083839375,0.000016224314],"category_scores_gemma":[0.00023849467,0.00017788437,0.000035442852,0.00058294344,0.00015615216,0.00063100224,0.00019419355,0.00019589749,0.00003216353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004191991,0.0004020568,0.06953499,0.000026965985,0.0001474757,0.0005338116,0.0033624645,0.0007672384,0.00019172086,0.9217784,0.0011429816,0.0020700207],"study_design_scores_gemma":[0.008817222,0.0027416663,0.40333933,0.00031411016,0.00009193756,0.00015093472,0.00020934992,0.039112277,0.0022438825,0.5274219,0.013171929,0.0023854792],"about_ca_topic_score_codex":0.00001671122,"about_ca_topic_score_gemma":0.000024352988,"teacher_disagreement_score":0.39435646,"about_ca_system_score_codex":0.00003286549,"about_ca_system_score_gemma":0.000058914593,"threshold_uncertainty_score":0.7253914},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9582196,0.0011470669,0.011353773,0.00061790715,0.0012981602,0.0005071934,0.000028976416,0.00042149672,0.026405867],"genre_scores_gemma":[0.9877335,0.00006831897,0.010415901,0.000008141909,0.000008114322,0.000032612872,0.0000018782384,0.000033147204,0.0016983825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904436,0.00003260415,0.00039157557,0.00014887401,0.00020676112,0.0001758478],"domain_scores_gemma":[0.99886626,0.0007394726,0.00006967247,0.00019340926,0.000080726444,0.000050456143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021189154,0.00014497401,0.00027031943,0.00010021834,0.00008245756,0.00007112128,0.000113263915,0.000064312975,0.00004482794],"category_scores_gemma":[0.00029855556,0.00012992052,0.00007336714,0.00017076281,0.00014078384,0.0006686041,0.00005418163,0.00013720375,0.000012828667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034137165,0.000042563843,0.000031290983,0.0012175973,0.00003978554,0.000010993996,0.0016908951,3.052981e-7,0.0012300682,0.9941947,0.0005904469,0.00094794575],"study_design_scores_gemma":[0.00017753856,0.000061090104,0.000072459356,0.0003252949,0.00006300646,0.000050978648,0.0005878268,0.00062405807,0.0063797873,0.99096483,0.0005604029,0.00013271211],"about_ca_topic_score_codex":0.000003874296,"about_ca_topic_score_gemma":0.00000908788,"teacher_disagreement_score":0.029513944,"about_ca_system_score_codex":0.000027264807,"about_ca_system_score_gemma":0.000024834748,"threshold_uncertainty_score":0.52980053},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98551816,0.0013297953,0.0018858729,0.00087217946,0.009428178,0.00011503139,0.0000032967428,0.0003886161,0.00045886575],"genre_scores_gemma":[0.99829,0.00001311931,0.001524354,0.00006641866,0.0000019612162,0.000007101394,0.0000042687057,0.0000099297595,0.00008285131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988427,0.00006135455,0.00025424658,0.00034116107,0.00031458502,0.00018591646],"domain_scores_gemma":[0.9992042,0.00021209226,0.000060573115,0.00034462358,0.00009941584,0.00007908576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029171715,0.00013112575,0.00016447381,0.00025859152,0.0000748668,0.00011059607,0.00031405187,0.000057699108,0.000015439433],"category_scores_gemma":[0.000028485794,0.00011429949,0.00011492244,0.00066118356,0.00007058623,0.00025095377,0.00017032614,0.00015493802,0.0000666312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055901805,0.00008412902,0.00016970934,0.000037066002,0.000039509614,0.0000142949375,0.0003333008,0.00022760103,0.009211703,0.9866456,0.0025057914,0.00072572246],"study_design_scores_gemma":[0.00032066533,0.000208205,0.0006921294,0.00020986651,0.000013459714,0.000013758332,0.000016201264,0.04057276,0.010651241,0.94629014,0.00083692704,0.00017463708],"about_ca_topic_score_codex":0.00006972852,"about_ca_topic_score_gemma":0.0000020432346,"teacher_disagreement_score":0.040355433,"about_ca_system_score_codex":0.000024093084,"about_ca_system_score_gemma":0.000048632824,"threshold_uncertainty_score":0.4660998},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9817111,0.00049081986,0.0016362633,0.0011011336,0.0005616498,0.0002693987,0.000060046015,0.000036409296,0.014133202],"genre_scores_gemma":[0.99886924,0.0000045406737,0.00035838512,0.00002114567,0.000018651319,0.000025314623,0.0000039515585,0.000009277138,0.00068949914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995797,0.000017257378,0.00014093137,0.000110915185,0.000060284234,0.000090870475],"domain_scores_gemma":[0.9996006,0.00012266834,0.000034831537,0.00019328052,0.000017699518,0.000030915406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006891514,0.0000692476,0.0001215746,0.000011131017,0.000067286666,0.000024399664,0.00010064022,0.000016063308,0.00012879768],"category_scores_gemma":[0.0000068266163,0.000045266814,0.000066820736,0.00012565136,0.000072053066,0.000041019128,0.00007042704,0.0000647778,0.000010156018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011371202,0.000020336736,0.0002197517,0.000013318292,0.00002819767,8.560481e-8,0.00007030732,0.0000027415226,0.000969029,0.99628806,0.00074154924,0.001645485],"study_design_scores_gemma":[0.00012370734,0.0000064574697,0.00016980841,0.000021336293,0.000024910265,4.108501e-7,0.000054060543,0.00015918072,0.0051145833,0.9858872,0.008384386,0.000053938886],"about_ca_topic_score_codex":0.000023341418,"about_ca_topic_score_gemma":2.5031503e-7,"teacher_disagreement_score":0.017158158,"about_ca_system_score_codex":0.0000054909324,"about_ca_system_score_gemma":0.000019220317,"threshold_uncertainty_score":0.18459271},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98265576,0.00046655393,0.0106598,0.00019736346,0.0030694276,0.00022343069,5.554143e-7,0.00020167445,0.002525409],"genre_scores_gemma":[0.99938035,0.000012333101,0.00044962871,0.000018594366,0.000007667921,0.00001670175,5.9838214e-7,0.000011920228,0.000102227394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989223,0.0001243375,0.0001574916,0.000347313,0.00022281364,0.00022576968],"domain_scores_gemma":[0.99908626,0.0005614947,0.000025836316,0.00023703696,0.000035769408,0.000053596257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007554751,0.00009649789,0.00011134214,0.00030472624,0.000065337976,0.00023160927,0.00028994287,0.000046579255,0.0000016223355],"category_scores_gemma":[0.00016079885,0.00009378353,0.000023673754,0.00066276366,0.000036783375,0.0004924101,0.00016144844,0.00028193518,0.000030451087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063803564,0.000015385653,0.00035337164,0.000046373243,0.0000063940433,0.000058089216,0.0010983334,0.00015990406,0.00027024825,0.99284816,0.000045352877,0.0050920304],"study_design_scores_gemma":[0.00040088533,0.000113355345,0.00026079497,0.00043156548,0.0000015350798,0.000023259836,0.00025832924,0.22826034,0.00067172997,0.76918006,0.00024287523,0.0001552708],"about_ca_topic_score_codex":0.000032963846,"about_ca_topic_score_gemma":0.000005021474,"teacher_disagreement_score":0.22810043,"about_ca_system_score_codex":0.00012106775,"about_ca_system_score_gemma":0.000025049938,"threshold_uncertainty_score":0.38243812},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9883404,0.0028686277,0.0012157232,0.00040161156,0.005198511,0.00012567044,0.0000029109076,0.0005196148,0.0013269779],"genre_scores_gemma":[0.9915773,0.000060900817,0.008009535,0.000073668096,0.0000016372726,0.000008904005,0.00000312069,0.000017276612,0.00024761716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985381,0.00006926316,0.00034062337,0.00042497733,0.00033694837,0.0002901004],"domain_scores_gemma":[0.9990718,0.000113547474,0.00006329984,0.0005403396,0.000103477585,0.00010753018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039409523,0.00016406924,0.00022427287,0.00025415653,0.00008367687,0.00014760581,0.00048535925,0.00007617551,0.000015211034],"category_scores_gemma":[0.000022969221,0.00014795775,0.00015634691,0.00090246915,0.00006905335,0.00029646137,0.00017737303,0.00016479682,0.00007470329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025411816,0.00004540073,0.00011672415,0.00004352949,0.00004199405,0.000029249877,0.0003546691,0.00007862076,0.011584597,0.98498404,0.0011491741,0.0015694877],"study_design_scores_gemma":[0.00041180657,0.00009167383,0.00010081138,0.00010240984,0.000015560343,0.000023649967,0.0000095624255,0.028158493,0.009373994,0.96103466,0.00048903236,0.0001883402],"about_ca_topic_score_codex":0.00005415681,"about_ca_topic_score_gemma":7.262193e-7,"teacher_disagreement_score":0.028079873,"about_ca_system_score_codex":0.000015949812,"about_ca_system_score_gemma":0.000069490416,"threshold_uncertainty_score":0.60335416},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9897013,0.0027208426,0.0019293006,0.0018541499,0.0019808419,0.0004644865,0.00017047906,0.00033396756,0.00084467616],"genre_scores_gemma":[0.99845624,0.000107770335,0.00095351966,0.00015327462,0.000018641102,0.000020028661,0.000018428089,0.000027263754,0.00024481968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981585,0.00010059695,0.0002716509,0.0005633518,0.00054719864,0.0003586968],"domain_scores_gemma":[0.99845624,0.00025751474,0.00008315191,0.00093151134,0.00010813118,0.00016346748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503867,0.0002475435,0.00029558508,0.0001225689,0.00017791949,0.00030763738,0.0008904784,0.000080695594,0.000011468414],"category_scores_gemma":[0.000049069517,0.0001596266,0.000061867,0.0006366215,0.00011596937,0.00044831246,0.00049522135,0.00023097292,0.000034440138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010046582,0.00008276468,0.0011253936,0.00020366836,0.00009750503,0.00016030224,0.01252275,0.000009912148,0.0016598771,0.95397204,0.017116034,0.012949297],"study_design_scores_gemma":[0.0037633514,0.0056298836,0.011314775,0.0030544004,0.00023868411,0.00040507602,0.0033728518,0.008474256,0.05621215,0.7073978,0.19783275,0.0023040227],"about_ca_topic_score_codex":0.00011215045,"about_ca_topic_score_gemma":0.00004960767,"teacher_disagreement_score":0.24657422,"about_ca_system_score_codex":0.000085246895,"about_ca_system_score_gemma":0.00015757614,"threshold_uncertainty_score":0.65093833},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9722613,0.0039340267,0.008263067,0.00085010467,0.0066904547,0.0006959623,0.000006407326,0.00044513273,0.0068535074],"genre_scores_gemma":[0.998729,0.000062217616,0.0010587922,0.000020653993,0.0000041066774,0.000027357693,0.0000019646134,0.000014571514,0.00008137168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851316,0.00012582277,0.00025340586,0.00040036562,0.00039291327,0.00031431852],"domain_scores_gemma":[0.998989,0.00032505812,0.000040114577,0.0004957933,0.00007865086,0.000071395996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006132272,0.0001278801,0.00018865694,0.00062785164,0.00004259862,0.00007771166,0.00081212615,0.00006845887,0.000008575125],"category_scores_gemma":[0.00009060585,0.00012811471,0.00007699631,0.0016729173,0.00009698318,0.0009517627,0.00022954431,0.000263603,0.00006289567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053129847,0.00007051213,0.00012480115,0.00004413696,0.000011807874,0.00007117544,0.00035435412,0.000009549861,0.0023612361,0.9785344,0.00010623208,0.018306484],"study_design_scores_gemma":[0.0004514252,0.0001046854,0.001640444,0.000082317776,0.000002254096,0.0000069969838,0.000015548025,0.015849423,0.010453635,0.97108686,0.00018059218,0.00012583782],"about_ca_topic_score_codex":0.000015543781,"about_ca_topic_score_gemma":0.000003570082,"teacher_disagreement_score":0.026467627,"about_ca_system_score_codex":0.00010010518,"about_ca_system_score_gemma":0.000114362054,"threshold_uncertainty_score":0.5224367},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98907745,0.00036985156,0.00082749315,0.00501014,0.0032177789,0.000627725,0.000009883913,0.0000987012,0.0007609592],"genre_scores_gemma":[0.99904174,0.00003090343,0.00026017998,0.00017439206,0.000034589124,0.00010259981,0.0000025711083,0.000020868187,0.00033214714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988227,0.00019918449,0.00031763612,0.0002810951,0.0001725418,0.00020682396],"domain_scores_gemma":[0.99893606,0.0003318784,0.00010231897,0.0005044237,0.00007225638,0.00005306233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005644654,0.00014914837,0.00020022625,0.00008442333,0.00019886004,0.000038281298,0.0002917002,0.00016581356,0.000031510917],"category_scores_gemma":[0.00021653857,0.00009564042,0.00007285736,0.0004084312,0.0002666527,0.00009099905,0.00012933348,0.00026956573,0.000037616697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012766985,0.00004105884,0.0019616608,0.000060424733,0.00005366714,0.0000018749719,0.0008639996,0.0000021621368,0.0030176565,0.98223794,0.0018480023,0.0098987855],"study_design_scores_gemma":[0.00021240268,0.00008859973,0.005158316,0.00006480888,0.00007766063,0.00019356264,0.0001953059,0.00058811187,0.0029175566,0.98821765,0.0021712543,0.000114745395],"about_ca_topic_score_codex":0.000052057287,"about_ca_topic_score_gemma":0.000072919654,"teacher_disagreement_score":0.009964282,"about_ca_system_score_codex":0.000053744923,"about_ca_system_score_gemma":0.000060305054,"threshold_uncertainty_score":0.3900103},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9834278,0.002200565,0.000108858076,0.000026570466,0.0060130386,0.000097376804,0.00000677648,0.00045768978,0.007661319],"genre_scores_gemma":[0.9996163,0.000018045313,0.000057359226,0.000008166518,0.0000150652995,0.000015040058,0.000003078582,0.000040084156,0.00022681306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993089,0.000032965127,0.00020997407,0.00013436904,0.000120916746,0.00019289169],"domain_scores_gemma":[0.9995785,0.00007816957,0.000013847605,0.0002424959,0.000031425458,0.000055607634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001911739,0.0001254112,0.00017395055,0.00008546822,0.00004510897,0.000057475678,0.00013989369,0.00007659703,0.00004929751],"category_scores_gemma":[0.000019807774,0.00012366357,0.000075698365,0.00047769514,0.000043265794,0.00008276315,0.000022819439,0.00015443847,0.00011977962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046947835,0.00003729757,0.0013872691,0.0005325686,0.000155137,0.00003289853,0.0017108034,0.0009019013,0.008603825,0.9799606,0.0038088446,0.0028641492],"study_design_scores_gemma":[0.001392121,0.00027225417,0.0038054215,0.0015160021,0.0001907126,0.00008288756,0.0011392968,0.053761575,0.031309903,0.77786547,0.12729724,0.001367109],"about_ca_topic_score_codex":0.000036795474,"about_ca_topic_score_gemma":0.0000057962284,"teacher_disagreement_score":0.20209512,"about_ca_system_score_codex":0.000023769002,"about_ca_system_score_gemma":0.000025757858,"threshold_uncertainty_score":0.50428545},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8193421,0.060952663,0.08537814,0.0046015275,0.0127599705,0.0007920397,0.0000068525446,0.008691359,0.007475357],"genre_scores_gemma":[0.9710976,0.000019104304,0.028624877,0.00008232019,0.000012460401,0.00001902926,0.0000022213933,0.000014593577,0.00012783326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987986,0.000041383028,0.00020973104,0.00039089334,0.00026698242,0.0002923877],"domain_scores_gemma":[0.9993869,0.00013563735,0.000036544414,0.00035225833,0.000040075247,0.00004860437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043269838,0.00014037064,0.00014141417,0.00017161586,0.000059321934,0.00043990882,0.0007934943,0.00007014467,0.000010066004],"category_scores_gemma":[0.000108662214,0.00012482342,0.000043161526,0.0008457253,0.00003187153,0.00056662393,0.0003323036,0.00030398846,0.00004078932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010039402,0.000028620358,0.0017602852,0.00005746209,0.0000046853197,0.0001519925,0.00051779306,6.160774e-7,0.00033522613,0.96458244,0.0010992973,0.031460583],"study_design_scores_gemma":[0.00014335787,0.000032470078,0.00093775603,0.00037915653,0.0000035643766,0.000018798273,0.00001724021,0.015129626,0.0034386104,0.97546935,0.004221287,0.00020876517],"about_ca_topic_score_codex":0.00007011557,"about_ca_topic_score_gemma":0.000018102623,"teacher_disagreement_score":0.15175547,"about_ca_system_score_codex":0.00014108595,"about_ca_system_score_gemma":0.000085711836,"threshold_uncertainty_score":0.50901514},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9710485,0.00200841,0.0018730517,0.0044488087,0.009995175,0.00031475312,0.000015135214,0.00020634687,0.010089866],"genre_scores_gemma":[0.994577,0.0000074597497,0.0030065023,0.00005982059,0.000020951346,0.000012848691,8.500384e-7,0.000015839436,0.0022987195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975005,0.00021195588,0.0005823476,0.00042010893,0.0009973034,0.00028780897],"domain_scores_gemma":[0.9975262,0.0011906341,0.00013286508,0.0008062214,0.0002657278,0.00007832702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003414805,0.00013129489,0.00023634266,0.00020049668,0.00025175975,0.00039078106,0.0009623541,0.000090836285,0.00012665517],"category_scores_gemma":[0.0018766767,0.00007842829,0.00023962566,0.002220478,0.00013792847,0.00024100678,0.00022156425,0.00030823634,0.00039575293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039584547,0.000064008345,0.0008127855,0.000010331924,0.000040604675,0.000006404715,0.00045983426,0.00092621974,0.0010722919,0.9927171,0.0022794295,0.0016070337],"study_design_scores_gemma":[0.00020703021,0.00003180978,0.0009075236,0.00012927521,0.000038010403,0.000023659788,0.00015821276,0.014636017,0.0015277725,0.9732109,0.009014355,0.00011545495],"about_ca_topic_score_codex":0.0000797238,"about_ca_topic_score_gemma":0.00000658446,"teacher_disagreement_score":0.023528554,"about_ca_system_score_codex":0.000049060764,"about_ca_system_score_gemma":0.0003281565,"threshold_uncertainty_score":0.5086735},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.995607,0.0013331051,0.0010485984,0.00017618258,0.0013771256,0.0001200166,0.0000070767132,0.000048236954,0.0002826367],"genre_scores_gemma":[0.98986447,0.00001749545,0.010043365,0.000035607423,0.0000095024425,0.0000068568697,0.0000047233066,0.000010518938,0.0000074346954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838835,0.00010356011,0.00046301694,0.0003441553,0.000512712,0.0001881934],"domain_scores_gemma":[0.9987701,0.00062447524,0.00012869191,0.0003444331,0.00007327133,0.00005901629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005487715,0.00014402017,0.000283988,0.00038013852,0.00001625271,0.000054432305,0.00079454994,0.000077635064,0.0000060835864],"category_scores_gemma":[0.00011320517,0.00013662837,0.00010273198,0.00094707607,0.0001010442,0.00048271575,0.00042573435,0.00021359838,0.0000034798713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009588737,0.000071823,0.0008909629,0.000110412395,0.000023270568,0.00001700807,0.0012629845,0.00043859205,0.002919337,0.9853137,0.00015830195,0.008783983],"study_design_scores_gemma":[0.00033362868,0.000054233562,0.009736648,0.00009223888,0.0000075555627,0.000005523484,0.0000288469,0.014051493,0.058924176,0.9166068,0.000035585268,0.00012327755],"about_ca_topic_score_codex":0.00009829819,"about_ca_topic_score_gemma":0.0000036850722,"teacher_disagreement_score":0.068706945,"about_ca_system_score_codex":0.000056524957,"about_ca_system_score_gemma":0.00019029995,"threshold_uncertainty_score":0.5571543},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.977568,0.00036462545,0.0098979445,0.0007282073,0.004005757,0.0004308494,0.000006004354,0.0003846252,0.006613999],"genre_scores_gemma":[0.9986549,0.000036874786,0.0010831038,0.00005023993,0.0000039768656,0.00002373977,0.0000031122818,0.000016181939,0.00012787746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983365,0.00014852101,0.00026473406,0.00043951342,0.000513969,0.00029677976],"domain_scores_gemma":[0.9987468,0.00040330505,0.000064227715,0.00060290965,0.00008807314,0.00009466358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006387194,0.00014285537,0.00017081172,0.00039327654,0.0000943652,0.0001456967,0.0007617795,0.00008023889,0.000018331895],"category_scores_gemma":[0.00010822924,0.0001355726,0.00009849367,0.0009502858,0.000039173217,0.00061395403,0.00017459108,0.00031971195,0.00010397198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000136584,0.00004553445,0.000080122074,0.000031952448,0.00001984544,0.000031626714,0.0008063272,0.000028637329,0.007590896,0.96700686,0.00022510457,0.024119439],"study_design_scores_gemma":[0.00027736148,0.00021455511,0.0006024967,0.000115644034,0.0000040561868,0.000009574655,0.00002526327,0.009736921,0.0360937,0.95221925,0.0005536672,0.00014749057],"about_ca_topic_score_codex":0.000008229319,"about_ca_topic_score_gemma":0.0000025308254,"teacher_disagreement_score":0.028502807,"about_ca_system_score_codex":0.000083894454,"about_ca_system_score_gemma":0.000080458005,"threshold_uncertainty_score":0.55284905},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9884554,0.0036733944,0.00008389014,0.0005048752,0.005383174,0.00010646639,0.0000039933016,0.00039828973,0.0013905014],"genre_scores_gemma":[0.9984345,0.00006424105,0.0010156889,0.00008562234,0.000002370013,0.000005675397,0.0000036532524,0.000015760512,0.0003725062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985453,0.000064140135,0.0003131759,0.00043766072,0.0003345506,0.00030517983],"domain_scores_gemma":[0.9989215,0.00016746222,0.000044935245,0.0006574579,0.000085445965,0.00012318132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029525484,0.00017008276,0.00021502287,0.0002695388,0.00006861555,0.00013253729,0.00058215327,0.00008385851,0.000019461897],"category_scores_gemma":[0.00003268133,0.00015004724,0.0001455576,0.0009045672,0.00009603795,0.00050033163,0.00024243051,0.00020945806,0.00013670062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000112199,0.000095190364,0.00019198953,0.000031068364,0.000033769345,0.000020281688,0.00026745358,0.000010629832,0.0020166133,0.99094194,0.0025876318,0.0038022976],"study_design_scores_gemma":[0.00034291518,0.0001276288,0.00029843085,0.000084601255,0.00001386935,0.000015127555,0.000017499377,0.009517333,0.004962446,0.98381877,0.0006146426,0.00018674553],"about_ca_topic_score_codex":0.000042639764,"about_ca_topic_score_gemma":7.6672586e-7,"teacher_disagreement_score":0.009979066,"about_ca_system_score_codex":0.000018600096,"about_ca_system_score_gemma":0.00009261818,"threshold_uncertainty_score":0.61187494},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.995986,0.00006223034,0.0005769483,0.00033564123,0.0002647432,0.00044511905,0.000033931552,0.00008309054,0.0022123237],"genre_scores_gemma":[0.9977132,0.0000029320547,0.00076018315,0.000008779068,0.000010194115,0.00019695608,0.000015096755,0.000028572915,0.0012641067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934226,0.000023216504,0.00018536721,0.0001809989,0.00013135411,0.00013678783],"domain_scores_gemma":[0.999192,0.00040531973,0.00006192457,0.00022087843,0.00008468485,0.000035185614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021312761,0.00010830067,0.00015672424,0.000055200086,0.00007878312,0.000044726105,0.00011344014,0.00006309274,0.00010032493],"category_scores_gemma":[0.000043944165,0.00009008326,0.00008639545,0.00022114006,0.00007058277,0.00012995648,0.000022892196,0.00008681981,0.000024379213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038233462,0.00013562164,0.0006253655,0.00012671124,0.000077183686,9.703589e-7,0.00046138713,9.185965e-7,0.00074824493,0.9940283,0.0032252537,0.00053183455],"study_design_scores_gemma":[0.00060618715,0.00007426454,0.0015001189,0.00008811522,0.000075567405,0.000008227763,0.00011634026,0.0003931123,0.0050230618,0.99024844,0.0017515535,0.00011500005],"about_ca_topic_score_codex":0.0000051137063,"about_ca_topic_score_gemma":0.0000060192524,"teacher_disagreement_score":0.0042748167,"about_ca_system_score_codex":0.00002818386,"about_ca_system_score_gemma":0.000040921845,"threshold_uncertainty_score":0.36734888},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7308608,0.004617489,0.20297442,0.019536367,0.0061410135,0.002004569,0.00003457708,0.0014086193,0.0324221],"genre_scores_gemma":[0.9983449,0.000012997207,0.0006550961,0.00046178568,0.0000090918975,0.00008482401,0.0000023647492,0.000008505367,0.0004204138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991848,0.00004289129,0.0001489465,0.000268339,0.00019214023,0.00016287278],"domain_scores_gemma":[0.9988917,0.00038879664,0.000036023797,0.0005960058,0.000045246048,0.00004224504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015953086,0.00010064782,0.00009849885,0.000061995706,0.00008796778,0.00007573431,0.00074101164,0.00003737377,0.000043697735],"category_scores_gemma":[0.00003572192,0.000066233246,0.000065267996,0.00054217415,0.000041307623,0.00017204958,0.00014480758,0.00015240343,0.00060063525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.4527473e-7,0.000039493116,0.00000829776,0.000012466165,0.000011334239,0.0000020453813,0.00017782286,0.000013081136,0.0006008826,0.99408144,0.002822783,0.0022294049],"study_design_scores_gemma":[0.00007168814,0.00004377854,0.0001582335,0.000023758052,0.0000041852572,0.000004526691,0.000004723655,0.0010680021,0.0012697661,0.98170614,0.0155613525,0.000083830986],"about_ca_topic_score_codex":0.0000012518494,"about_ca_topic_score_gemma":7.213568e-7,"teacher_disagreement_score":0.26748407,"about_ca_system_score_codex":0.000020822334,"about_ca_system_score_gemma":0.000038202757,"threshold_uncertainty_score":0.7720151},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9488386,0.0034024443,0.006991381,0.0013557546,0.024549596,0.00023829813,8.7417027e-7,0.00068054197,0.013942494],"genre_scores_gemma":[0.99918866,0.000020986166,0.0001799811,0.00009048431,0.000020101656,0.00001731101,7.440675e-7,0.00000929461,0.00047243532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990279,0.00007121304,0.00020253021,0.00031355838,0.00016299961,0.00022179147],"domain_scores_gemma":[0.99947613,0.000084007566,0.000015023673,0.0003444349,0.000031385483,0.00004899696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037128394,0.000101190744,0.00013313489,0.00018940736,0.00004606042,0.0002760957,0.00043043707,0.000066952416,0.000015877971],"category_scores_gemma":[0.000011833807,0.00009079847,0.000072828865,0.00071718614,0.000018561512,0.00037787508,0.00008510895,0.00015410976,0.00016032287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.9749907e-7,0.000020391859,0.0007090955,0.000014315407,0.0000090478525,0.000069527836,0.00039586125,0.000027062017,0.00014287334,0.9908782,0.004831524,0.0029013043],"study_design_scores_gemma":[0.00030295385,0.00009244825,0.0016936782,0.00020537998,0.0000034047087,0.00007167087,0.00006697894,0.124861695,0.0006088996,0.8298427,0.041973084,0.00027714734],"about_ca_topic_score_codex":0.000078893885,"about_ca_topic_score_gemma":0.000020994337,"teacher_disagreement_score":0.16103554,"about_ca_system_score_codex":0.000050932023,"about_ca_system_score_gemma":0.000034135443,"threshold_uncertainty_score":0.37026542},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9881692,0.00016238732,0.000031229894,0.0006938619,0.0004242166,0.00017232235,0.000007171423,0.00009018185,0.010249428],"genre_scores_gemma":[0.99952734,0.000013664612,0.00004109853,0.000035834302,0.0000035192054,0.000031314572,0.0000011184958,0.000011519277,0.00033459056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995076,0.000048506005,0.00013113921,0.0001051402,0.00011474015,0.0000928831],"domain_scores_gemma":[0.9984033,0.0012129975,0.00003146374,0.00030885608,0.000021806642,0.000021546426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002524628,0.00006906114,0.00008660099,0.00006596981,0.00006735731,0.00001912902,0.00018095097,0.000030853666,0.00011005213],"category_scores_gemma":[0.000106520325,0.00004355024,0.000086943335,0.0004459135,0.000058545924,0.000025286756,0.000021008102,0.00010363644,0.00006420315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030065894,0.000093584385,0.000032740623,0.00002272945,0.00002890259,0.0000011702767,0.00017655204,5.9433614e-7,0.00021892242,0.98571473,0.013480851,0.00022618778],"study_design_scores_gemma":[0.00007588258,0.000030432164,0.00012373916,0.000042696363,0.000025796411,0.0000010457528,0.000058000256,0.000041242212,0.0035140219,0.99464977,0.0013896703,0.00004770218],"about_ca_topic_score_codex":0.0000017090342,"about_ca_topic_score_gemma":0.0000010768509,"teacher_disagreement_score":0.012091181,"about_ca_system_score_codex":0.0000072813255,"about_ca_system_score_gemma":0.000011665973,"threshold_uncertainty_score":0.17759272},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.980537,0.004429527,0.0050614947,0.00034293524,0.007880465,0.00015590126,0.000003230885,0.00044050452,0.0011489589],"genre_scores_gemma":[0.9650483,0.000066756016,0.03455224,0.000109202396,0.000002569019,0.000002088993,0.0000019016204,0.000015534555,0.00020139714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851686,0.00006491084,0.00033518922,0.00042939573,0.000349322,0.00030429568],"domain_scores_gemma":[0.9989605,0.00015158455,0.00008507328,0.00048614843,0.00022019891,0.00009647868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062971667,0.00015969563,0.00022416623,0.00018895212,0.000115778406,0.00016761315,0.0005978046,0.00009633066,0.000019823505],"category_scores_gemma":[0.000046799993,0.00014343899,0.000065044784,0.0015585442,0.000088768546,0.00043921353,0.00017808065,0.00018242998,0.000050425253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020660307,0.00004408831,0.00031368804,0.00006178852,0.000033442713,0.00001791965,0.00030261607,0.0003789787,0.0183701,0.979093,0.0007708891,0.0006114288],"study_design_scores_gemma":[0.00016830701,0.00011336297,0.000016599271,0.00023434828,0.000019534446,0.000017919858,0.0000128827205,0.044722825,0.019466234,0.93339896,0.0016501574,0.00017887294],"about_ca_topic_score_codex":0.00021826699,"about_ca_topic_score_gemma":6.0710227e-7,"teacher_disagreement_score":0.04569404,"about_ca_system_score_codex":0.000030652987,"about_ca_system_score_gemma":0.00022963766,"threshold_uncertainty_score":0.5849272},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99356353,0.0045056324,0.00001807272,0.000056178338,0.0010824911,0.0000915586,0.0000031491495,0.000038227157,0.00064114924],"genre_scores_gemma":[0.9995376,0.00012157616,0.000040247985,0.00007314456,0.00010163246,0.000005816529,0.000006579872,0.000013465265,0.00009995016],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999264,0.000043435775,0.00015699278,0.00026663096,0.00008935728,0.00017959149],"domain_scores_gemma":[0.99971455,0.000019922016,0.00003361827,0.00016611749,0.00003297885,0.00003278097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017427327,0.00011570684,0.00012442865,0.000034022767,0.000062679246,0.000029030176,0.00014165767,0.000100741294,0.0000023945565],"category_scores_gemma":[0.000050024715,0.00008349408,0.00008195403,0.00008568868,0.00006743255,0.0000029598052,0.000098980185,0.00009852962,0.000014325065],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003997367,0.000048282567,0.00008765653,0.000044830213,0.00003254353,0.0000058314345,0.000043618424,0.00001149757,0.9659744,0.03190084,0.00025471998,0.0015558074],"study_design_scores_gemma":[0.00019207704,0.00056896405,0.00015199832,0.00011947729,0.0000059673343,0.0000064217975,0.000058930356,0.00012884161,0.9733738,0.02045162,0.004792973,0.0001489805],"about_ca_topic_score_codex":0.0000035436992,"about_ca_topic_score_gemma":5.5048963e-7,"teacher_disagreement_score":0.0114492215,"about_ca_system_score_codex":0.000010368027,"about_ca_system_score_gemma":0.000018295148,"threshold_uncertainty_score":0.340479},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9515203,0.0002658489,0.03338712,0.002073433,0.008477354,0.000154766,0.000007066149,0.00043928405,0.0036747959],"genre_scores_gemma":[0.99826276,0.0000047568988,0.0013202179,0.0002659311,0.000014180252,0.000004531607,0.0000022039337,0.000009026153,0.00011640095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990563,0.00006011734,0.00016603821,0.00029257082,0.00026496398,0.00016000112],"domain_scores_gemma":[0.9989101,0.00053968106,0.000050032802,0.00040218435,0.000045425644,0.0000525383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020143525,0.000118288845,0.00014493226,0.00014032806,0.00006902121,0.00012175029,0.00029799246,0.00006814651,0.000020438025],"category_scores_gemma":[0.00011531552,0.00011464867,0.00009976427,0.00030888917,0.000026568236,0.00021849545,0.00007224612,0.00024399442,0.000027349959],"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.00002076819,0.000051582603,0.0010494763,0.000047270838,0.000025424477,0.000028401919,0.00012999302,0.00033203003,0.004547974,0.98938525,0.001590633,0.002791204],"study_design_scores_gemma":[0.00074286736,0.000348944,0.000638279,0.00037523397,0.000015776435,0.00000699985,0.000018649578,0.93673754,0.013882625,0.045408294,0.0015572023,0.00026761292],"about_ca_topic_score_codex":0.000124192,"about_ca_topic_score_gemma":0.000002360891,"teacher_disagreement_score":0.94397694,"about_ca_system_score_codex":0.00004550699,"about_ca_system_score_gemma":0.000081705744,"threshold_uncertainty_score":0.4675237},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6423628,0.0036778268,0.20860125,0.0136358775,0.058933936,0.0015265926,0.00018298779,0.00571754,0.065361194],"genre_scores_gemma":[0.99823916,0.000018413068,0.0010812416,0.00026402078,0.000015513042,0.000028410377,0.000004988928,0.000024259216,0.000324003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977815,0.00014840075,0.00020438565,0.00062235416,0.00076409266,0.0004792454],"domain_scores_gemma":[0.99710095,0.0019029488,0.000020021045,0.00065595564,0.00010566994,0.00021445092],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030145133,0.00019336025,0.0001682579,0.00031239155,0.0002026169,0.00037027622,0.00086791435,0.000101585676,0.00019506486],"category_scores_gemma":[0.00036653437,0.00018225027,0.00012284316,0.00092139153,0.00016301074,0.0008580203,0.00023256357,0.0005777726,0.0010022871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017932354,0.00010201944,0.000082621445,0.000020526326,0.000026347956,0.00012433535,0.00006962939,0.00001410671,0.00046806136,0.9924454,0.0039071613,0.002721844],"study_design_scores_gemma":[0.00024209368,0.00020733014,0.00056090206,0.00004513605,0.0000029257947,0.000023328526,0.0000060163334,0.0045680194,0.0010760524,0.98679805,0.0062646777,0.00020544734],"about_ca_topic_score_codex":0.000004950676,"about_ca_topic_score_gemma":4.972497e-7,"teacher_disagreement_score":0.35587636,"about_ca_system_score_codex":0.00011416246,"about_ca_system_score_gemma":0.00013701864,"threshold_uncertainty_score":0.9997755},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99462116,0.0001799364,0.00039870886,0.00021551157,0.0003706728,0.00018362635,0.000023643997,0.00008516931,0.003921556],"genre_scores_gemma":[0.9990116,0.000015554067,0.0008217832,0.00000558134,0.0000045644274,0.000018472674,0.000006510373,0.000019355199,0.00009658788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919707,0.00006837236,0.0003028108,0.0001505689,0.000162288,0.00011891653],"domain_scores_gemma":[0.9990833,0.00033436096,0.000097507975,0.0003647747,0.00007810842,0.000041966323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041965916,0.000095937234,0.00020280134,0.000104426144,0.000036594818,0.000010467818,0.00017628486,0.000073540985,0.000064252934],"category_scores_gemma":[0.000073205454,0.000092793474,0.00008979887,0.00034708736,0.00009705687,0.00007325878,0.0000614868,0.00012029979,0.000020114048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015828911,0.0002667331,0.00010393056,0.00026019194,0.00005323023,0.0000011465594,0.00042540772,9.863982e-7,0.0065490445,0.990229,0.0012625366,0.0008319759],"study_design_scores_gemma":[0.00022802816,0.00012282802,0.00040767476,0.00016080748,0.000044002296,0.0000027443423,0.0001473026,0.00010493589,0.022047084,0.97616374,0.00048596878,0.000084900596],"about_ca_topic_score_codex":0.000010706591,"about_ca_topic_score_gemma":0.0000028606241,"teacher_disagreement_score":0.015498039,"about_ca_system_score_codex":0.000015596475,"about_ca_system_score_gemma":0.000033068216,"threshold_uncertainty_score":0.3784008},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9868588,0.002548511,0.00052383926,0.001575882,0.0042056073,0.0015817403,0.000046622914,0.00019809822,0.0024609123],"genre_scores_gemma":[0.996514,0.00003393741,0.00041654613,0.000027053093,0.000062441555,0.00018298709,0.000007959414,0.00005881155,0.0026962294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985515,0.000103577964,0.0003088614,0.0002877121,0.0004048861,0.00034348626],"domain_scores_gemma":[0.99719226,0.0018874797,0.000059838283,0.0006169269,0.00019246028,0.00005104992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016582375,0.00015569905,0.00024705238,0.00016218377,0.00013922446,0.00010479823,0.00048439315,0.00008888832,0.0000794404],"category_scores_gemma":[0.00091322773,0.00010637616,0.00014750769,0.0006595407,0.00019476595,0.000108699045,0.000119212586,0.00025957968,0.000025716545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009999876,0.00009478494,0.00020170369,0.0005637018,0.00015815134,0.000004932223,0.0005923054,0.000001525791,0.0011981162,0.9665771,0.029539783,0.0009678715],"study_design_scores_gemma":[0.00082783937,0.0001412373,0.00021279226,0.000072135,0.000058018974,0.000006454966,0.000059408572,0.0016602906,0.0037852412,0.98507166,0.007981642,0.00012327377],"about_ca_topic_score_codex":0.000014310441,"about_ca_topic_score_gemma":0.0000034257926,"teacher_disagreement_score":0.021558141,"about_ca_system_score_codex":0.000044432134,"about_ca_system_score_gemma":0.00014210476,"threshold_uncertainty_score":0.4337894},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98855656,0.0029591715,0.00044863106,0.00035851263,0.006667517,0.00013792467,0.0000029280036,0.0005081922,0.0003605383],"genre_scores_gemma":[0.99548095,0.000042754757,0.0042709326,0.00008424491,0.000002885497,0.000008920718,0.000003039189,0.000017391874,0.00008885209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985102,0.000062523904,0.00034042614,0.00043020133,0.0003482676,0.00030840136],"domain_scores_gemma":[0.99905217,0.0001433912,0.000070719645,0.0005079761,0.00011174781,0.00011397937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037059977,0.00016737804,0.00023276193,0.00023437108,0.000097338365,0.00014099982,0.00050368963,0.0000893492,0.000009204677],"category_scores_gemma":[0.000044194625,0.0001560622,0.00014061817,0.00074629195,0.00008698569,0.00044847387,0.0002472095,0.0001997574,0.00007955855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036100766,0.000062979976,0.00019995745,0.000033100518,0.000040622497,0.000021918253,0.0003026306,0.000023160841,0.053107567,0.9432955,0.00043117808,0.0024777867],"study_design_scores_gemma":[0.00043364023,0.00013720158,0.00029081508,0.00011104295,0.000015900207,0.000015720456,0.000009048246,0.008462461,0.03397459,0.9562351,0.000118448545,0.00019599304],"about_ca_topic_score_codex":0.000061597704,"about_ca_topic_score_gemma":6.793519e-7,"teacher_disagreement_score":0.019132975,"about_ca_system_score_codex":0.000019002835,"about_ca_system_score_gemma":0.00012236937,"threshold_uncertainty_score":0.6364032},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9843537,0.0032642644,0.01024606,0.00009011653,0.0014133239,0.00013669014,0.0000038495577,0.00023774107,0.00025424655],"genre_scores_gemma":[0.9444449,0.000016535027,0.055483032,0.000018529241,0.0000028249824,0.0000012072331,0.0000028850184,0.000012460249,0.000017612218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860525,0.000085241074,0.00029825643,0.00047411624,0.00027200117,0.00026512946],"domain_scores_gemma":[0.9992227,0.00011391567,0.00007284309,0.00040770817,0.0000815779,0.00010126459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005216977,0.0001655895,0.0002476882,0.00018851926,0.00014037317,0.00017149874,0.00036692678,0.00007883737,0.0000013970225],"category_scores_gemma":[0.000021266562,0.00015344292,0.00006677411,0.00063908444,0.00010932956,0.00026673533,0.00030619118,0.00018765013,0.0000020227676],"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.0000014168081,0.00009782215,0.0003797406,0.00011037873,0.00004433038,0.000010860885,0.000673786,0.00013172798,0.0013421362,0.9850867,0.00018134396,0.011939793],"study_design_scores_gemma":[0.00028172313,0.000054025375,0.0005505798,0.00010550843,0.000018270808,0.000017467883,0.00004124106,0.6784064,0.0009920446,0.31930202,0.00007482352,0.00015588177],"about_ca_topic_score_codex":0.00015972256,"about_ca_topic_score_gemma":0.0000015749923,"teacher_disagreement_score":0.6782747,"about_ca_system_score_codex":0.000026610824,"about_ca_system_score_gemma":0.000085377214,"threshold_uncertainty_score":0.62572205},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98140275,0.0014467523,0.0000727947,0.000016760407,0.0067680716,0.000080597456,0.000007408136,0.00033007498,0.00987478],"genre_scores_gemma":[0.99977696,0.000027421636,0.000008774494,0.0000053508156,0.000010859824,0.0000087233075,0.0000038126395,0.000023932518,0.00013417224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994541,0.000020682763,0.00016243047,0.00010071199,0.00011714045,0.00014494496],"domain_scores_gemma":[0.9997208,0.000046970363,0.000010178793,0.00016398,0.000012899524,0.00004515993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013282434,0.00009718438,0.00013499153,0.00006873398,0.0000191218,0.00002355073,0.000110632456,0.000055549215,0.00004257755],"category_scores_gemma":[0.0000058661412,0.00009339051,0.0000854292,0.00020730765,0.00002845396,0.00009697123,0.000015627753,0.00010451396,0.0000847983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037670018,0.000013442406,0.00026883997,0.00021154693,0.00007220116,0.000017996574,0.00033968076,0.0004975754,0.0057333126,0.989579,0.0027761534,0.00048648173],"study_design_scores_gemma":[0.00062463654,0.00013345086,0.0016283751,0.0003225599,0.000076304816,0.000025518746,0.00037090637,0.01115694,0.0243296,0.9449501,0.015962321,0.00041929944],"about_ca_topic_score_codex":0.0000062479,"about_ca_topic_score_gemma":6.1542283e-7,"teacher_disagreement_score":0.04462892,"about_ca_system_score_codex":0.000029917615,"about_ca_system_score_gemma":0.0000077596005,"threshold_uncertainty_score":0.38083547},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73648596,0.0002200297,0.0022461452,0.0011776637,0.0021255305,0.0005073819,0.000017823302,0.00080836035,0.2564111],"genre_scores_gemma":[0.9869091,0.000014011689,0.004708809,0.000049100243,0.000023694649,0.000056242545,0.000004276633,0.000041381307,0.008193385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992237,0.0000148750905,0.00021374143,0.00018691696,0.0001890319,0.00017174167],"domain_scores_gemma":[0.999186,0.00033934353,0.000035143712,0.00033633964,0.000043348493,0.00005982719],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00023348365,0.00011283406,0.00014118174,0.000033819557,0.00008240604,0.00012427839,0.0001558615,0.000060237777,0.00096161466],"category_scores_gemma":[0.00009340878,0.00010033583,0.00007802538,0.00022844475,0.000023292421,0.000078310884,0.00005785212,0.00014349863,0.0021526914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.8633984e-7,0.00006297217,0.00004356085,0.00016184077,0.000017589438,0.0000036084637,0.00023797582,3.2011883e-7,0.0001025087,0.8446574,0.15456375,0.00014796811],"study_design_scores_gemma":[0.000110551126,0.0000062034023,0.000010105987,0.000082432976,0.000030407144,0.000010094637,0.00003064386,0.0012699241,0.00042648177,0.93212235,0.06578108,0.00011972253],"about_ca_topic_score_codex":0.000003717529,"about_ca_topic_score_gemma":4.8995867e-7,"teacher_disagreement_score":0.25042316,"about_ca_system_score_codex":0.0000334734,"about_ca_system_score_gemma":0.000034435256,"threshold_uncertainty_score":0.99995166},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9854046,0.0014870927,0.0027639284,0.0004868533,0.0014660723,0.0006119176,0.000019024388,0.0001934846,0.0075670374],"genre_scores_gemma":[0.99820405,0.000013053971,0.0012163919,0.00004240675,0.000010559454,0.00009934479,0.0000030396711,0.00002197145,0.0003892047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99719673,0.00013822928,0.00062572665,0.00051776035,0.0013209146,0.00020065244],"domain_scores_gemma":[0.99797404,0.0005323511,0.00014844665,0.00077870133,0.00048085654,0.000085584135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011631942,0.00015787622,0.00029373044,0.0004932469,0.00013433293,0.00037518892,0.0006751881,0.00006623832,0.00016508778],"category_scores_gemma":[0.00025442275,0.00010289149,0.0001036561,0.001706962,0.00020893304,0.00040361207,0.00013113896,0.0001534631,0.000470481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027598388,0.00008006761,0.00082841696,0.00003112929,0.00002095511,0.000006686601,0.00035380886,0.000024071267,0.010669521,0.97848666,0.0012304899,0.008240582],"study_design_scores_gemma":[0.0003633249,0.00009331227,0.0016127808,0.00023794067,0.000021161739,0.00001892136,0.0003981149,0.0014292352,0.006757465,0.9724717,0.01640886,0.00018719844],"about_ca_topic_score_codex":0.00001916982,"about_ca_topic_score_gemma":0.000009368475,"teacher_disagreement_score":0.01517837,"about_ca_system_score_codex":0.000034243105,"about_ca_system_score_gemma":0.00010011895,"threshold_uncertainty_score":0.6047238},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844847,0.0005924471,0.00024013239,0.0003391198,0.0005317796,0.00019679505,0.00002682236,0.00018656995,0.0134016685],"genre_scores_gemma":[0.99643636,0.00001645324,0.0019416115,0.00000766251,0.0000072174944,0.000021076807,0.000004384693,0.000018762199,0.0015464907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940944,0.00000824465,0.00021074127,0.00011432265,0.00015455215,0.00010267347],"domain_scores_gemma":[0.9991096,0.00050271803,0.00004355598,0.00026443237,0.000047040365,0.00003260167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001807375,0.000081190025,0.00016209866,0.00008975394,0.00003623384,0.000031582098,0.00013577343,0.000044737433,0.00014265765],"category_scores_gemma":[0.00013231453,0.000067294575,0.000057078683,0.00033732544,0.00003838476,0.000042278392,0.000039294253,0.00007292429,0.000072386065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.2769e-7,0.000064946886,0.000031522904,0.00022260295,0.000028829987,0.0000017347221,0.0002581162,3.598344e-7,0.00032085693,0.9618486,0.036633097,0.00058856513],"study_design_scores_gemma":[0.00007640478,0.00001738209,0.000027685355,0.00008522888,0.000029590523,0.0000066480056,0.00007837237,0.00028132924,0.0025326153,0.9851968,0.0115907,0.00007719461],"about_ca_topic_score_codex":0.0000054935444,"about_ca_topic_score_gemma":9.3262776e-7,"teacher_disagreement_score":0.025042398,"about_ca_system_score_codex":0.000010672593,"about_ca_system_score_gemma":0.000026560883,"threshold_uncertainty_score":0.2744193},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9948012,0.00056655495,0.0005049125,0.00015440043,0.002408749,0.00010367172,0.0000027761103,0.00020235773,0.0012553337],"genre_scores_gemma":[0.99921846,0.000018464389,0.0006049382,0.000069735266,5.250078e-7,0.0000051947895,0.0000014449753,0.00001125779,0.00006995194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875087,0.00006365552,0.0003362639,0.00031908925,0.00033832694,0.0001918214],"domain_scores_gemma":[0.9988956,0.00024954672,0.00009022378,0.00055439817,0.00014012826,0.000070103815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003289929,0.00012990134,0.0002265254,0.00034161823,0.00003947822,0.000040089817,0.0004870283,0.00008142322,0.000010568265],"category_scores_gemma":[0.000061408464,0.00011382239,0.00011569298,0.0010987169,0.00006900073,0.0001387246,0.000093038136,0.00016038166,0.00002480756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060998946,0.00010323271,0.00043040485,0.00005340634,0.000034879755,0.0000112883745,0.0003493142,0.000047517184,0.0056821774,0.99032664,0.0019127836,0.0010422566],"study_design_scores_gemma":[0.00039038737,0.00023800641,0.0008672307,0.00019250464,0.000007878823,0.0000037751468,0.000008541661,0.009613378,0.03078292,0.95767856,0.000100301935,0.0001165242],"about_ca_topic_score_codex":0.000057968085,"about_ca_topic_score_gemma":0.0000020068394,"teacher_disagreement_score":0.032648087,"about_ca_system_score_codex":0.000012139335,"about_ca_system_score_gemma":0.00007085698,"threshold_uncertainty_score":0.4641542},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930815,0.0015167281,0.000104787425,0.000033037508,0.0030626478,0.00017994302,0.000016639413,0.00013442207,0.001870299],"genre_scores_gemma":[0.99982566,0.000036896963,0.000039421408,0.000010193104,0.0000049607274,0.000016799944,0.0000068319578,0.000026134952,0.000033092052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991155,0.0000891902,0.00032563633,0.00013521874,0.00017254829,0.00016187351],"domain_scores_gemma":[0.99939024,0.00011149331,0.000047683836,0.0003511233,0.000059845417,0.000039616127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020847346,0.00013826152,0.00022005074,0.0001394603,0.000053051263,0.000018471179,0.00026528997,0.000073871975,0.000020659594],"category_scores_gemma":[0.000009578964,0.00011101212,0.00016627173,0.0009007386,0.00011018233,0.000103403276,0.000048279104,0.00014958186,0.000013366618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006288268,0.000028869246,0.00062593864,0.00033871716,0.00016003607,0.0000023594387,0.0009261705,0.00084320945,0.044343103,0.95167977,0.0007026762,0.00034287246],"study_design_scores_gemma":[0.0003575099,0.00007268243,0.0019056777,0.0004548333,0.00007074313,0.0000065337767,0.00014771392,0.006898973,0.030510534,0.9582453,0.0011383558,0.00019115723],"about_ca_topic_score_codex":0.00005271964,"about_ca_topic_score_gemma":0.0000137324105,"teacher_disagreement_score":0.013832569,"about_ca_system_score_codex":0.000020559863,"about_ca_system_score_gemma":0.000012484597,"threshold_uncertainty_score":0.4526943},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6401024,0.007861335,0.25656217,0.004499461,0.01752873,0.0009122466,0.0000070517067,0.0053198035,0.06720682],"genre_scores_gemma":[0.99359804,0.000020023535,0.005628305,0.000065893706,0.00000792985,0.000026179494,8.722661e-7,0.000017109647,0.0006356338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986204,0.00008449715,0.00014974656,0.00042374985,0.0003520359,0.00036955375],"domain_scores_gemma":[0.99894965,0.000301332,0.000019352237,0.0005531551,0.00006868438,0.00010783177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051920506,0.000119671786,0.000110855035,0.00025641295,0.0001355275,0.00028656772,0.00094341213,0.000045887693,0.000019954356],"category_scores_gemma":[0.0000987632,0.00011224362,0.000083386876,0.0013969066,0.000087848784,0.0006869056,0.00034806246,0.00027113612,0.00028296537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010564668,0.00001936525,0.000062514184,0.000020899794,0.000012986747,0.00009852818,0.00036407937,0.000004056072,0.0007340833,0.9713731,0.0007760586,0.026533296],"study_design_scores_gemma":[0.00012408661,0.000058109697,0.00011024932,0.000044073367,0.000001917437,0.000021500278,0.000025410482,0.008800213,0.0024017962,0.9844175,0.0038547213,0.00014042296],"about_ca_topic_score_codex":0.0000044859466,"about_ca_topic_score_gemma":6.236602e-7,"teacher_disagreement_score":0.35349566,"about_ca_system_score_codex":0.000045108183,"about_ca_system_score_gemma":0.000060411567,"threshold_uncertainty_score":0.4577162},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98083866,0.0023415966,0.011690798,0.0006483611,0.0016266031,0.00041916565,0.0000054110765,0.00014462789,0.0022848088],"genre_scores_gemma":[0.99848664,0.000107492255,0.0011779289,0.000014574573,0.0000071723416,0.000029842175,0.000003696963,0.000012644567,0.0001599906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859345,0.00015418725,0.00026160222,0.00040757543,0.00033428913,0.0002488699],"domain_scores_gemma":[0.9989838,0.00042080897,0.000056449204,0.00035559287,0.00011486412,0.000068489964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008195027,0.00013657694,0.00018988027,0.0006163514,0.000060387076,0.00011029628,0.0004755283,0.000090016074,0.0000069942566],"category_scores_gemma":[0.00012499907,0.00013255177,0.00005511942,0.001478368,0.00013358254,0.0008682308,0.00021855548,0.00023195603,0.000009550337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001336082,0.00006783823,0.0007580445,0.00006927611,0.000010484305,0.000020725916,0.0013197457,0.000010349964,0.003373045,0.9685189,0.0002207783,0.025617424],"study_design_scores_gemma":[0.00069941167,0.00013150883,0.0083505465,0.00010954728,0.0000044782078,0.000008582958,0.000070997616,0.009092587,0.009318744,0.9715958,0.00047166782,0.0001460776],"about_ca_topic_score_codex":0.000010610104,"about_ca_topic_score_gemma":0.000023799796,"teacher_disagreement_score":0.025471348,"about_ca_system_score_codex":0.00006232432,"about_ca_system_score_gemma":0.000059898037,"threshold_uncertainty_score":0.54053044},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9665825,0.0001602647,0.011917001,0.00024366066,0.01623432,0.0016702919,0.000036072153,0.000812176,0.0023437268],"genre_scores_gemma":[0.9776427,0.000016249089,0.021465508,0.0000332952,0.00023286552,0.00020655437,0.000033054188,0.00016245489,0.00020729953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646336,0.00015953508,0.0011125025,0.00072511303,0.00088851864,0.0006509997],"domain_scores_gemma":[0.9975315,0.00036112586,0.00031543276,0.0010553122,0.0004160919,0.00032057034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093424116,0.0004991659,0.0007213731,0.00035622148,0.00017993958,0.00018565847,0.0006928727,0.000268759,0.000049947655],"category_scores_gemma":[0.00037042043,0.00050322834,0.00020860475,0.00078665104,0.000083722814,0.0008368459,0.00021551091,0.00039081287,0.000110251334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005281138,0.0005485926,0.000036900128,0.00044629612,0.0001051817,0.000018903276,0.0027042965,0.000037087284,0.029448017,0.96241724,0.0028541293,0.0013305132],"study_design_scores_gemma":[0.0011251165,0.0009999217,0.000010274322,0.0002768741,0.00011502997,0.00002819977,0.00010212131,0.007407285,0.03139158,0.95698327,0.0010441927,0.00051614095],"about_ca_topic_score_codex":0.00005786829,"about_ca_topic_score_gemma":0.000018430912,"teacher_disagreement_score":0.016001454,"about_ca_system_score_codex":0.00042918473,"about_ca_system_score_gemma":0.0001934137,"threshold_uncertainty_score":0.9997419},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98811126,0.0007862982,0.00808063,0.00016459732,0.00074506155,0.00012298068,0.000014146038,0.00012187892,0.001853136],"genre_scores_gemma":[0.9996026,0.000025911988,0.00032023346,0.000018286133,0.0000034607783,0.000005595129,0.0000024788199,0.000008918854,0.000012520385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989511,0.000101615806,0.00027858533,0.00034316716,0.0001740094,0.0001515412],"domain_scores_gemma":[0.99881244,0.0004849059,0.00012577612,0.00047405166,0.000057432742,0.000045384775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039536573,0.00014063375,0.00022128223,0.00016097922,0.00007669757,0.00008252566,0.0003653064,0.000051180104,0.000005146456],"category_scores_gemma":[0.00003968713,0.0001150362,0.0000870311,0.00046807673,0.00018472906,0.00024410326,0.00010190381,0.00012827753,0.0000024175374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024230567,0.000065038155,0.0026382003,0.00004499693,0.000037493654,0.000002361014,0.0015432247,8.3768043e-7,0.01698522,0.971041,0.000051004718,0.007566395],"study_design_scores_gemma":[0.00054083916,0.00045341352,0.032224208,0.00053268956,0.00002139644,0.0000064546107,0.00013630402,0.005715406,0.03356099,0.922154,0.00435629,0.00029798292],"about_ca_topic_score_codex":0.000008323097,"about_ca_topic_score_gemma":0.000004879452,"teacher_disagreement_score":0.048886973,"about_ca_system_score_codex":0.000015440934,"about_ca_system_score_gemma":0.00003573826,"threshold_uncertainty_score":0.469104},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98140275,0.0014467523,0.0000727947,0.000016760407,0.0067680716,0.000080597456,0.000007408136,0.00033007498,0.00987478],"genre_scores_gemma":[0.99977696,0.000027421636,0.000008774494,0.0000053508156,0.000010859824,0.0000087233075,0.0000038126395,0.000023932518,0.00013417224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994541,0.000020682763,0.00016243047,0.00010071199,0.00011714045,0.00014494496],"domain_scores_gemma":[0.9997208,0.000046970363,0.000010178793,0.00016398,0.000012899524,0.00004515993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013282434,0.00009718438,0.00013499153,0.00006873398,0.0000191218,0.00002355073,0.000110632456,0.000055549215,0.00004257755],"category_scores_gemma":[0.0000058661412,0.00009339051,0.0000854292,0.00020730765,0.00002845396,0.00009697123,0.000015627753,0.00010451396,0.0000847983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037670018,0.000013442406,0.00026883997,0.00021154693,0.00007220116,0.000017996574,0.00033968076,0.0004975754,0.0057333126,0.989579,0.0027761534,0.00048648173],"study_design_scores_gemma":[0.00062463654,0.00013345086,0.0016283751,0.0003225599,0.000076304816,0.000025518746,0.00037090637,0.01115694,0.0243296,0.9449501,0.015962321,0.00041929944],"about_ca_topic_score_codex":0.0000062479,"about_ca_topic_score_gemma":6.1542283e-7,"teacher_disagreement_score":0.04462892,"about_ca_system_score_codex":0.000029917615,"about_ca_system_score_gemma":0.0000077596005,"threshold_uncertainty_score":0.38083547},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98695445,0.0003562129,0.005288108,0.0006087072,0.002435545,0.00042752727,0.0000018384613,0.00031013502,0.003617486],"genre_scores_gemma":[0.9988772,0.000012607218,0.0008493035,0.000029458275,0.0000041710314,0.00006760725,0.0000029498926,0.000014215685,0.00014248618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980517,0.00015952734,0.0002689637,0.00060393213,0.00051816966,0.00039771642],"domain_scores_gemma":[0.9988677,0.00020332352,0.00003027856,0.0007128604,0.00008203997,0.000103828745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012516074,0.00015064413,0.0001631164,0.0004105027,0.000074890464,0.00028189362,0.00089978846,0.00008615537,0.00003771634],"category_scores_gemma":[0.000037831036,0.00014455922,0.00007874487,0.001330668,0.000076197444,0.0011129766,0.0003921711,0.0003957615,0.00011466498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002100628,0.0001017762,0.0027928336,0.00003070049,0.000009659492,0.000091027,0.0007858132,0.000008914086,0.0006811087,0.99073416,0.00011570918,0.0046273144],"study_design_scores_gemma":[0.0008065219,0.00007361626,0.005615048,0.000032938162,0.0000018555753,0.000007652735,0.000033930795,0.004499438,0.005742475,0.9824222,0.000597884,0.00016647321],"about_ca_topic_score_codex":0.000039266786,"about_ca_topic_score_gemma":0.000041002582,"teacher_disagreement_score":0.011922761,"about_ca_system_score_codex":0.00020452312,"about_ca_system_score_gemma":0.00008765672,"threshold_uncertainty_score":0.5894954},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9665382,0.001168638,0.0022988503,0.007018676,0.0038435755,0.0019012911,0.0002021014,0.0012109929,0.01581768],"genre_scores_gemma":[0.99069464,0.000015133562,0.0009856105,0.00005250113,0.000049903134,0.00019915107,0.000018450737,0.00005034076,0.007934258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986759,0.00008947192,0.000265572,0.0002997697,0.0002952001,0.00037410317],"domain_scores_gemma":[0.9980266,0.0012411707,0.000030560175,0.0004746686,0.00010253304,0.00012447593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010312812,0.00013293601,0.00021184824,0.0000890393,0.00015974822,0.0001220306,0.00024440666,0.00007737603,0.00015164616],"category_scores_gemma":[0.00084333326,0.00012194032,0.00016186178,0.000262704,0.0001054474,0.00018813211,0.00008560878,0.00021455949,0.00028729305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017830776,0.000112633636,0.000041003903,0.00018931869,0.00009498447,0.000020967698,0.00015347806,4.317289e-7,0.00011517188,0.9076738,0.09134412,0.000236261],"study_design_scores_gemma":[0.0004265413,0.00006304107,0.000020707084,0.00008209183,0.00006850805,0.0000073458477,0.000070312846,0.0011989967,0.0012535107,0.9731357,0.023533355,0.00013990494],"about_ca_topic_score_codex":0.000011419658,"about_ca_topic_score_gemma":0.000005232396,"teacher_disagreement_score":0.06781076,"about_ca_system_score_codex":0.000098976154,"about_ca_system_score_gemma":0.0001132137,"threshold_uncertainty_score":0.4972582},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892559,0.00032044042,0.0011433784,0.0022478548,0.0023411831,0.0003790512,0.0000055444584,0.00025521862,0.0040513985],"genre_scores_gemma":[0.9994203,0.000020490967,0.00023615343,0.00015133456,0.000005455582,0.00003914027,9.531831e-7,0.000018363864,0.00010784983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777514,0.00031244542,0.00026603296,0.00056946924,0.0006823518,0.00039455868],"domain_scores_gemma":[0.9968515,0.0015633497,0.000057083937,0.0013247516,0.00009883712,0.00010445475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013342717,0.0001869216,0.00019326853,0.00023268063,0.00018498834,0.000118787175,0.0013962095,0.00006499416,0.000021225336],"category_scores_gemma":[0.00027751448,0.00012928965,0.00015316144,0.0012985951,0.00022199724,0.0002400003,0.00030798084,0.0005207873,0.00011711295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018765419,0.00011820201,0.00036501425,0.000035527377,0.000028316945,0.00002003141,0.0005646966,0.0000743664,0.000607931,0.9940595,0.00085395685,0.0032536641],"study_design_scores_gemma":[0.00017285939,0.00035778322,0.00187336,0.00013271395,0.0000038326552,0.0000025017048,0.000040252766,0.002673726,0.0079358285,0.986286,0.00038595442,0.00013523243],"about_ca_topic_score_codex":0.00001642043,"about_ca_topic_score_gemma":0.000001818636,"teacher_disagreement_score":0.010164328,"about_ca_system_score_codex":0.00008897851,"about_ca_system_score_gemma":0.00006872503,"threshold_uncertainty_score":0.5272279},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9916586,0.00011993832,0.0027982704,0.0006173318,0.000938879,0.00043472153,0.00004554616,0.000058486276,0.003328216],"genre_scores_gemma":[0.998184,0.000010936482,0.00094794313,0.000020594269,0.000009475384,0.000026032412,0.0000058688074,0.000015172815,0.0007799219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951017,0.000011986474,0.00018429167,0.00010114165,0.00010143455,0.00009095371],"domain_scores_gemma":[0.99922234,0.0005112148,0.000043119784,0.00014294537,0.000053522177,0.000026831816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021657224,0.0000726328,0.00012650478,0.000029949873,0.00007107759,0.00003501958,0.00007129759,0.00005188482,0.00001645251],"category_scores_gemma":[0.00025696075,0.00004827158,0.000056021723,0.00010737462,0.000038152823,0.000058504826,0.000032049757,0.0000744194,0.0000040687637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032102166,0.0000393091,0.00008038898,0.00033928207,0.000023972838,2.1458582e-7,0.0002483409,1.7173068e-7,0.0005470732,0.9974139,0.0010102796,0.0002938538],"study_design_scores_gemma":[0.00015758401,0.000040772535,0.00013614476,0.00007297763,0.000051909752,0.0000048847883,0.00003248919,0.00868632,0.0008420128,0.98898077,0.0009381201,0.000055999324],"about_ca_topic_score_codex":0.0000066873163,"about_ca_topic_score_gemma":0.0000032397993,"teacher_disagreement_score":0.008686148,"about_ca_system_score_codex":0.000013098004,"about_ca_system_score_gemma":0.000020905918,"threshold_uncertainty_score":0.19684578},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94409007,0.0017562035,0.048263565,0.00050477555,0.0025004128,0.00034577044,0.000007948134,0.0005092808,0.0020219926],"genre_scores_gemma":[0.9934779,0.000046819212,0.0063537727,0.000031934247,0.0000051401635,0.00002485494,0.000006709519,0.000016320335,0.00003658973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842256,0.00014352635,0.0002980469,0.000415105,0.0004176066,0.00030316555],"domain_scores_gemma":[0.9988343,0.00029635592,0.00003277447,0.0006070413,0.00011412826,0.00011537484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004979286,0.00014578768,0.00021334316,0.00034633884,0.00011495098,0.00012757027,0.000877103,0.000057088168,0.000012618714],"category_scores_gemma":[0.000024280636,0.00014143878,0.0001312903,0.0011592135,0.00015901444,0.0006347285,0.0002943875,0.00021214668,0.00006591882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011387854,0.000059776467,0.00045280842,0.000055097273,0.000035185316,0.000028723627,0.000401727,0.00002233154,0.017424384,0.96942556,0.00034384272,0.011739191],"study_design_scores_gemma":[0.00018026841,0.00013989994,0.0010750325,0.00007747333,0.000006737313,0.000010793946,0.000017206203,0.011194755,0.01642394,0.9695911,0.0011335403,0.00014927513],"about_ca_topic_score_codex":0.00001833416,"about_ca_topic_score_gemma":0.000004274415,"teacher_disagreement_score":0.049387805,"about_ca_system_score_codex":0.000051068408,"about_ca_system_score_gemma":0.000053741365,"threshold_uncertainty_score":0.5767706},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5112771,0.00080537813,0.041622423,0.0066589247,0.009557863,0.0014625973,0.000022501219,0.002106074,0.42648712],"genre_scores_gemma":[0.9631587,0.000009541264,0.007543085,0.00015613217,0.00005961023,0.000021281045,0.0000024490614,0.000077863355,0.02897131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855506,0.00003909096,0.0002178363,0.00033655623,0.00044328,0.00040819764],"domain_scores_gemma":[0.9985194,0.00057975866,0.000019635536,0.0005080956,0.00005523562,0.00031787413],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00053649617,0.00015780279,0.00021956152,0.00010351064,0.000063688174,0.0001294959,0.0004031263,0.00007402473,0.0011118],"category_scores_gemma":[0.00039415306,0.00014598883,0.00009477884,0.00059878145,0.00003026413,0.00011912459,0.00015922468,0.00026405058,0.0040117786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008944642,0.000021567126,0.000162176,0.00005331549,0.000044957837,0.000049448146,0.0003973614,4.2570838e-7,0.00013247135,0.74299014,0.25500378,0.0011353848],"study_design_scores_gemma":[0.00021952417,0.00004508738,0.00003131066,0.000105423824,0.000022013124,0.000012020325,0.000061590305,0.00026372337,0.00067520374,0.9634273,0.03496983,0.00016698972],"about_ca_topic_score_codex":0.000063287334,"about_ca_topic_score_gemma":0.000008284164,"teacher_disagreement_score":0.45188162,"about_ca_system_score_codex":0.00014770236,"about_ca_system_score_gemma":0.0001648795,"threshold_uncertainty_score":0.99980134},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9549187,0.008606331,0.0064947098,0.0026492176,0.013681239,0.00029336257,0.000004681459,0.0007861038,0.012565668],"genre_scores_gemma":[0.9987742,0.00009047463,0.0006838328,0.00006651211,0.000008888573,0.000011928262,5.654419e-7,0.000010334821,0.00035329096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909467,0.000065651286,0.00019090161,0.0002253471,0.00021686192,0.00020656416],"domain_scores_gemma":[0.99890023,0.00033871512,0.00004019815,0.00063658226,0.000038193404,0.000046072942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004916559,0.00009726583,0.000114453345,0.00003951065,0.00011066528,0.0001997157,0.00090905884,0.000044273685,0.000015690972],"category_scores_gemma":[0.00003274735,0.00006573507,0.00011013263,0.0005688859,0.00007112084,0.0002245506,0.00020509002,0.00011862521,0.00015489712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017310196,0.000019079507,0.00008927867,0.000011255497,0.00002824138,0.00001765975,0.0002633596,9.884156e-7,0.00034340302,0.98477054,0.0042874683,0.010167011],"study_design_scores_gemma":[0.00014785164,0.00002268519,0.00031164126,0.000036174588,0.000006173813,0.000017248116,0.00002702594,0.005209456,0.0029130972,0.97413856,0.0170781,0.000091999216],"about_ca_topic_score_codex":0.000022493901,"about_ca_topic_score_gemma":6.8836897e-7,"teacher_disagreement_score":0.04385549,"about_ca_system_score_codex":0.000013186568,"about_ca_system_score_gemma":0.000057693484,"threshold_uncertainty_score":0.26805982},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8711174,0.0042820955,0.042707715,0.0014999537,0.050317973,0.00049009174,0.00000839552,0.0010371013,0.028539265],"genre_scores_gemma":[0.9986007,0.000029076362,0.00034802489,0.00011281819,0.000065507964,0.000018954128,0.0000016941791,0.000016420046,0.0008067643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998383,0.00010891853,0.00044543654,0.00043163123,0.00032476423,0.00030626162],"domain_scores_gemma":[0.9989027,0.00018565835,0.00007981221,0.00060512306,0.00013404919,0.00009267339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004503435,0.00017782293,0.00030498448,0.00014138047,0.000099306635,0.0002132843,0.0007302573,0.00010956254,0.000029619672],"category_scores_gemma":[0.000030276433,0.00015493689,0.00017233007,0.00060711184,0.0000485897,0.00042322208,0.0001821772,0.00022498924,0.00014647409],"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.0000038848407,0.000068098125,0.00027713517,0.00007477009,0.00005017061,0.00003349607,0.00084429875,0.000106426276,0.0004901395,0.9754847,0.017929016,0.004637855],"study_design_scores_gemma":[0.00078776927,0.00038924292,0.0012299112,0.000687939,0.000029896528,0.00011921236,0.00011133331,0.46751025,0.008927081,0.41523248,0.10433552,0.0006393683],"about_ca_topic_score_codex":0.00012944898,"about_ca_topic_score_gemma":0.000010328231,"teacher_disagreement_score":0.56025225,"about_ca_system_score_codex":0.000059046513,"about_ca_system_score_gemma":0.000073678486,"threshold_uncertainty_score":0.6318143},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9850366,0.0040901364,0.0024197525,0.0009196842,0.00350467,0.000613963,0.000015327849,0.001298422,0.002101434],"genre_scores_gemma":[0.99770856,0.000106735475,0.00154554,0.00005901477,0.000011381321,0.000069819456,0.0000045620422,0.00005038029,0.0004439788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969812,0.00028046998,0.00049312273,0.0007955122,0.0007672932,0.0006823809],"domain_scores_gemma":[0.99703085,0.00041995794,0.00010069716,0.0018507777,0.00039916328,0.00019856819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006650708,0.00032580385,0.00042469375,0.0005862119,0.00017849475,0.00025593353,0.0027189392,0.00015284948,0.000032626605],"category_scores_gemma":[0.00047440708,0.000283813,0.00020611165,0.00261783,0.00037758306,0.0008860967,0.0007209492,0.0004885387,0.00009705106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035269157,0.00011709959,0.000183883,0.00015098267,0.00011271266,0.0000768,0.0008349528,0.000013868953,0.025725974,0.9690889,0.0018814428,0.0017781242],"study_design_scores_gemma":[0.00079448154,0.00025407216,0.00043539214,0.00027011495,0.000015414682,0.000029103432,0.000055046807,0.005339697,0.08232197,0.9081107,0.0020094304,0.00036460243],"about_ca_topic_score_codex":0.00004505731,"about_ca_topic_score_gemma":0.000010218296,"teacher_disagreement_score":0.060978215,"about_ca_system_score_codex":0.00008400502,"about_ca_system_score_gemma":0.00022834085,"threshold_uncertainty_score":0.9999614},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9913836,0.0016158777,0.00017834525,0.000012598607,0.002813755,0.00012227701,0.000003070737,0.00012989,0.003740594],"genre_scores_gemma":[0.9998419,0.00003275395,0.000013154096,0.0000019125941,0.0000037679488,0.000013705546,0.000001268409,0.000025049887,0.000066454435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992627,0.00004222018,0.00028030478,0.00009591,0.00014503731,0.00017384496],"domain_scores_gemma":[0.9994492,0.00017832774,0.000029353647,0.00026627444,0.000044714063,0.000032150012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032458483,0.000101231286,0.00016617059,0.00004301186,0.000045115707,0.000022182763,0.00015234346,0.000052489275,0.000016255522],"category_scores_gemma":[0.00002053522,0.000075652584,0.000095778814,0.00039740247,0.000055919594,0.00006497941,0.000016427259,0.00010819088,0.000027920452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004262615,0.000013929606,0.0016977257,0.00024428067,0.00013137516,0.0000037958403,0.00062158646,0.00014840065,0.008539323,0.98756796,0.0004219788,0.0006053506],"study_design_scores_gemma":[0.0002537119,0.000032891487,0.0008591983,0.00025257198,0.00004659367,0.000016734948,0.00021315,0.0050607203,0.023778947,0.96803194,0.0012981755,0.00015536805],"about_ca_topic_score_codex":0.000019994506,"about_ca_topic_score_gemma":0.0000017691173,"teacher_disagreement_score":0.019536054,"about_ca_system_score_codex":0.00001422393,"about_ca_system_score_gemma":0.000015408425,"threshold_uncertainty_score":0.3085023},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98640496,0.0019389198,0.000061289764,0.000022785247,0.003707194,0.00013444002,0.000030441503,0.00045871804,0.0072412323],"genre_scores_gemma":[0.99970746,0.000089706125,0.000057867397,0.0000045790484,0.000009245243,0.00003367046,0.00003425414,0.000035715224,0.000027525235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921703,0.000037862137,0.00026748038,0.0001731081,0.0001388606,0.00016566979],"domain_scores_gemma":[0.999496,0.000084654275,0.000026088825,0.0002998116,0.000029588702,0.000063897125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014521155,0.00014693475,0.00019308343,0.00016422522,0.000037984057,0.00003949903,0.00017107549,0.00010504509,0.000059995276],"category_scores_gemma":[0.000008455728,0.00014492225,0.00011509402,0.0004422713,0.000047191254,0.00015054885,0.000013670645,0.00013359831,0.000055948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070035408,0.000021893962,0.000760279,0.00011418703,0.00015269748,0.00000592476,0.00074684195,0.000023271576,0.1525986,0.8434072,0.0004996706,0.001662441],"study_design_scores_gemma":[0.00041242494,0.00005477279,0.014356496,0.00020912377,0.000063553205,0.0000039953943,0.0005023817,0.0069082384,0.028044103,0.945281,0.0038561376,0.00030772583],"about_ca_topic_score_codex":0.000029790603,"about_ca_topic_score_gemma":0.000008523511,"teacher_disagreement_score":0.12455449,"about_ca_system_score_codex":0.00002524993,"about_ca_system_score_gemma":0.000012850748,"threshold_uncertainty_score":0.5909758},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99094653,0.0003503371,0.001297426,0.000679294,0.0034451932,0.000312145,0.000015289332,0.00030605664,0.0026477012],"genre_scores_gemma":[0.9872632,0.000075014184,0.009738467,0.00015833539,0.00011512154,0.00003502731,0.000018257906,0.000076507145,0.0025200683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987058,0.000041815176,0.00034162356,0.0004065611,0.00021467917,0.00028949726],"domain_scores_gemma":[0.99867237,0.0006575965,0.0000611825,0.00044311368,0.000050677107,0.00011508951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021952073,0.00024576363,0.00033095686,0.00011113693,0.000093334595,0.00008259539,0.00018185789,0.0001412623,0.00012937764],"category_scores_gemma":[0.00020197147,0.0002200544,0.00007728784,0.0002092653,0.000078080804,0.00012168712,0.00012377893,0.00032435215,0.000109518915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003397975,0.00009201928,0.000021742084,0.00009311422,0.0000618972,0.00005440909,0.00014517966,0.0000055628034,0.00024391455,0.9917674,0.005957708,0.0015230471],"study_design_scores_gemma":[0.0012809947,0.00018650081,0.000020189987,0.00010573135,0.000040461586,0.000010264124,0.000008210292,0.005844884,0.0042517195,0.984,0.004005062,0.0002459821],"about_ca_topic_score_codex":0.00000656468,"about_ca_topic_score_gemma":0.0000042299716,"teacher_disagreement_score":0.008441041,"about_ca_system_score_codex":0.00008910481,"about_ca_system_score_gemma":0.00004848737,"threshold_uncertainty_score":0.8973558},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93681294,0.0015809399,0.0008269064,0.0011075138,0.017317403,0.0015121277,0.00040473143,0.0013796341,0.0390578],"genre_scores_gemma":[0.99430126,0.000019461086,0.003833959,0.00008427612,0.00004992514,0.00007956128,0.000021081105,0.00006519806,0.001545272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834335,0.00006979814,0.0004354963,0.00045921767,0.00028294834,0.00040917867],"domain_scores_gemma":[0.9973087,0.0015281964,0.00008142443,0.0008759959,0.0001025552,0.00010312857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066484173,0.00025657934,0.0003195093,0.00015446128,0.00026091174,0.00010272847,0.0005590683,0.0001750713,0.00003055881],"category_scores_gemma":[0.0010520868,0.0002101671,0.00026481762,0.0003425521,0.0001122186,0.00014128759,0.00017500811,0.00020942856,0.000010266943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017074164,0.000045606226,0.000022782815,0.0001873806,0.00010282807,0.000018123226,0.00071851996,4.6154534e-7,0.00040918784,0.92535377,0.07209911,0.00087147154],"study_design_scores_gemma":[0.0018958062,0.00017690094,0.00007353796,0.00010631521,0.00007447195,0.0000096387075,0.0000622348,0.00027456426,0.0014559191,0.98776954,0.007820714,0.00028033467],"about_ca_topic_score_codex":0.0000036724305,"about_ca_topic_score_gemma":0.0000033776373,"teacher_disagreement_score":0.064278394,"about_ca_system_score_codex":0.000043092692,"about_ca_system_score_gemma":0.000045451256,"threshold_uncertainty_score":0.85703653},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.963827,0.00060696824,0.00078562956,0.0011360524,0.004575944,0.00012841097,9.84853e-7,0.0005837684,0.028355215],"genre_scores_gemma":[0.99940175,0.000012857808,0.00012838331,0.00026964193,0.0000067057886,0.000013170956,7.043991e-7,0.000008741308,0.00015806152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991044,0.00007584762,0.00013212259,0.00032116595,0.00015237901,0.00021409498],"domain_scores_gemma":[0.999287,0.0002494064,0.000014192946,0.00037804028,0.000014541962,0.000056818473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030157538,0.00011015604,0.00010843025,0.00022616408,0.000052106974,0.0001869048,0.00051201996,0.000050076258,0.000034589408],"category_scores_gemma":[0.000023305845,0.000104365776,0.00006945215,0.00075366703,0.000035567165,0.00024523903,0.00009840587,0.00018557474,0.00024440364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004568219,0.000052268144,0.00025481556,0.000010343708,0.000007596534,0.00010981162,0.00034399112,0.0000042037523,0.000049719263,0.98350614,0.0016342046,0.014022314],"study_design_scores_gemma":[0.00025957852,0.00014470935,0.0012808305,0.000095694006,0.0000018830701,0.000006727401,0.000009977951,0.0016629027,0.0004892936,0.9910048,0.0049068313,0.00013673631],"about_ca_topic_score_codex":0.000008403829,"about_ca_topic_score_gemma":0.0000036812226,"teacher_disagreement_score":0.035574708,"about_ca_system_score_codex":0.000027104894,"about_ca_system_score_gemma":0.00003321727,"threshold_uncertainty_score":0.4255913},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9941011,0.00004850993,0.0010179332,0.00014189932,0.0003820653,0.0005189144,0.000025975152,0.0000965215,0.0036670475],"genre_scores_gemma":[0.9975557,0.0000023886876,0.0007037506,0.000011206128,0.000010171871,0.00019355278,0.000016381224,0.000028740838,0.0014781267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993237,0.000026089936,0.00020291601,0.00017964243,0.00013694102,0.0001306706],"domain_scores_gemma":[0.9990548,0.0005072991,0.00006960018,0.0002488465,0.000083506064,0.00003597756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023245186,0.00011250715,0.00017716375,0.000056821427,0.00008415491,0.000045903864,0.00012826317,0.000068034286,0.000107443244],"category_scores_gemma":[0.000056723577,0.00009144465,0.00008610446,0.00024363284,0.000070446964,0.000117247095,0.000017985047,0.00007814217,0.000018370407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009925876,0.00018144047,0.000510337,0.00013313994,0.00007603585,0.0000014885312,0.00033789067,7.4914294e-7,0.00054211565,0.9915851,0.006278411,0.000254059],"study_design_scores_gemma":[0.0011398084,0.00008929079,0.0007200859,0.000101638005,0.0000826429,0.000004127127,0.00007151841,0.00024311045,0.002795207,0.9905578,0.004076881,0.00011791824],"about_ca_topic_score_codex":0.0000044430453,"about_ca_topic_score_gemma":0.000018475863,"teacher_disagreement_score":0.0034545474,"about_ca_system_score_codex":0.00002113683,"about_ca_system_score_gemma":0.000030327034,"threshold_uncertainty_score":0.37290046},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98791903,0.009855901,0.000005996235,0.0003330852,0.00023809538,0.00011056322,0.0000141900655,0.000025240479,0.0014978675],"genre_scores_gemma":[0.99755514,0.0016248645,0.00008603763,0.00013949246,0.000038139024,0.000018402572,0.000038975133,0.000016899616,0.00048206418],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993669,0.000013726669,0.00008157846,0.00029643622,0.00007583666,0.00016554429],"domain_scores_gemma":[0.99972683,0.000021794742,0.000012425224,0.00013044021,0.00003992192,0.0000685737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050254414,0.00013759248,0.0001165133,0.000020403548,0.00008567021,0.00006098259,0.00005195438,0.00008751767,0.000008968667],"category_scores_gemma":[0.000015103939,0.00010592394,0.000022873437,0.00010322711,0.0001457489,0.0000074385607,0.00011116808,0.000094372444,0.0000026513662],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026258986,0.00016954912,0.009103422,0.00026223066,0.0005669498,0.000036562265,0.00023528113,9.50938e-7,0.9338869,0.026460433,0.024988266,0.004026897],"study_design_scores_gemma":[0.0034417978,0.0044801594,0.012021447,0.00070785184,0.00038605483,0.0005409536,0.000726422,0.00027100637,0.6309247,0.041533973,0.30321577,0.0017498434],"about_ca_topic_score_codex":0.000018811352,"about_ca_topic_score_gemma":0.000007136316,"teacher_disagreement_score":0.30296215,"about_ca_system_score_codex":0.00000982181,"about_ca_system_score_gemma":0.000021327742,"threshold_uncertainty_score":0.43194526},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9888506,0.00032314964,0.002213853,0.000035854642,0.0021967238,0.0006228306,0.000011353858,0.00024325945,0.005502355],"genre_scores_gemma":[0.99946624,0.000011829347,0.000037417092,0.000010705454,0.000013039436,0.00034700718,0.0000064729866,0.000033971737,0.00007334026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919516,0.000018982144,0.0001802299,0.0002526473,0.00013448297,0.00021849072],"domain_scores_gemma":[0.99956256,0.000092789676,0.000010777998,0.00017813202,0.000039552287,0.00011616725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002064349,0.00015990883,0.00016055294,0.00018916574,0.000095442614,0.000081173974,0.00008725668,0.00007813898,0.000006487053],"category_scores_gemma":[0.000005104087,0.00017003075,0.00005439862,0.00052770943,0.000030980482,0.00007476304,0.000024023902,0.00014597148,0.0000724684],"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.000027456088,0.000081275466,0.00028397987,0.00045833096,0.00019256979,0.000025194498,0.0057992856,0.006743983,0.04335359,0.9363816,0.00051183155,0.006140929],"study_design_scores_gemma":[0.0038399426,0.0006222057,0.0336073,0.0015871151,0.00039622848,0.00014558189,0.0031611254,0.5211527,0.08214273,0.34340075,0.0072116028,0.0027327708],"about_ca_topic_score_codex":0.000010878504,"about_ca_topic_score_gemma":0.0000022237464,"teacher_disagreement_score":0.59298086,"about_ca_system_score_codex":0.000061013277,"about_ca_system_score_gemma":0.000011351831,"threshold_uncertainty_score":0.6933653},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9822452,0.00087429653,0.00029749476,0.00028487365,0.0010484542,0.00024477678,0.000009960879,0.00023127615,0.014763688],"genre_scores_gemma":[0.9954019,0.00006257986,0.0037961584,0.000046299254,0.000011495382,0.000016851554,0.0000029634878,0.000027507314,0.00063421164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998854,0.000061918814,0.00028483325,0.00030054632,0.0002310228,0.00026769502],"domain_scores_gemma":[0.99832445,0.0011420294,0.000046761612,0.0003170707,0.000039468454,0.00013023402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006421769,0.00018495119,0.00027846926,0.00006619802,0.000090126254,0.00021077134,0.00015637284,0.00011804853,0.00010168002],"category_scores_gemma":[0.00047866354,0.000154992,0.0000873129,0.00016583467,0.00010767919,0.00014442194,0.00012192818,0.00025861012,0.0000412026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034101201,0.00007662279,0.0004036907,0.00039024852,0.000049653798,0.000026060112,0.00039374235,7.22343e-8,0.00016576871,0.9957929,0.0013059236,0.0013919098],"study_design_scores_gemma":[0.00016488002,0.000039882627,0.0002375591,0.00012067118,0.000049587394,0.000012257762,0.00005428512,0.010185811,0.00011529325,0.98830014,0.0005283806,0.00019122055],"about_ca_topic_score_codex":0.000029365374,"about_ca_topic_score_gemma":0.0000071418694,"teacher_disagreement_score":0.014129476,"about_ca_system_score_codex":0.00004445418,"about_ca_system_score_gemma":0.000023762896,"threshold_uncertainty_score":0.632039},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5026567,0.000216259,0.015508507,0.001401505,0.0018159716,0.00039108138,0.000055628792,0.00041789713,0.47753647],"genre_scores_gemma":[0.9976899,0.00000126799,0.00027340162,0.00003459533,0.000025454656,0.000050723076,0.0000098929295,0.0000148267,0.0018999445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995563,0.0000066552643,0.00009331617,0.00014707244,0.000072594725,0.00012403955],"domain_scores_gemma":[0.99955004,0.0002009683,0.000011682615,0.00017821878,0.000013448219,0.000045640834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000040755334,0.00008131185,0.00008209909,0.00001790432,0.00007103948,0.000049724924,0.00008805701,0.000014579693,0.00071403605],"category_scores_gemma":[0.0000051669012,0.00006676264,0.0000571335,0.00012667902,0.00002579712,0.000056409328,0.000026424339,0.00009796485,0.0007326706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013710422,0.00005204156,0.000017469558,0.00000751109,0.000015495749,6.1740405e-7,0.00003747576,0.00001000689,0.00006600169,0.9905815,0.0036078424,0.0056026303],"study_design_scores_gemma":[0.00007725394,0.000021660691,0.000012427213,0.000029214882,0.000007098264,1.7485785e-7,0.000043078908,0.0004404596,0.0010332192,0.9706805,0.027575638,0.00007932101],"about_ca_topic_score_codex":0.0000028119214,"about_ca_topic_score_gemma":2.7579521e-8,"teacher_disagreement_score":0.4950332,"about_ca_system_score_codex":0.000010342314,"about_ca_system_score_gemma":0.000011914723,"threshold_uncertainty_score":0.94172424},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9859798,0.003259201,0.00013800533,0.000008656444,0.0047849477,0.00006489989,0.000005719205,0.00036895293,0.005389795],"genre_scores_gemma":[0.9997602,0.000034030683,0.0000591257,0.0000070050255,0.00001729193,0.000012581163,0.000004325869,0.000028792583,0.000076665136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994261,0.000027366928,0.00019586018,0.00010888835,0.000098274686,0.00014346732],"domain_scores_gemma":[0.9996638,0.00009898309,0.000011819993,0.00017025026,0.000016987593,0.000038184327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017361043,0.00010313088,0.00013834029,0.00009926014,0.00003096614,0.000030986834,0.00010548984,0.000058792244,0.000030352827],"category_scores_gemma":[0.000012597221,0.00010069299,0.00008202428,0.00031807888,0.000022745291,0.00009034269,0.000014219464,0.000114500675,0.00004593969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014931895,0.000010505759,0.00033649418,0.00024995813,0.000073201016,0.000014414391,0.00045857296,0.0031334818,0.022065753,0.97143036,0.0009657814,0.0012599617],"study_design_scores_gemma":[0.00050833565,0.000116512914,0.0003673508,0.00046656877,0.00006148299,0.000024109226,0.00034544192,0.17250596,0.03361678,0.782544,0.008898053,0.0005454116],"about_ca_topic_score_codex":0.0000040594,"about_ca_topic_score_gemma":9.061658e-7,"teacher_disagreement_score":0.18888639,"about_ca_system_score_codex":0.0000117312275,"about_ca_system_score_gemma":0.000006575419,"threshold_uncertainty_score":0.4106141},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6131693,0.0042373734,0.33080414,0.0043779206,0.007066734,0.0008222465,0.0000070444826,0.0033684557,0.03614678],"genre_scores_gemma":[0.99034274,0.0000135743285,0.008561873,0.00007407267,0.0000066560187,0.000027107157,8.168698e-7,0.000018108003,0.0009550592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988296,0.000059568967,0.000094905015,0.00038552718,0.00032396655,0.00030645163],"domain_scores_gemma":[0.99900603,0.00023808217,0.000013304593,0.0005919671,0.000052385556,0.00009825337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023054272,0.000115850315,0.000104920466,0.00015327243,0.000075045195,0.00027414286,0.0007528616,0.000033453653,0.00002356969],"category_scores_gemma":[0.000025224761,0.000086216154,0.000043293603,0.000831213,0.00008914261,0.0006364394,0.00021462483,0.00020300178,0.0002812824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004668288,0.00002195936,0.0003810938,0.000010970394,0.000021512862,0.00012247254,0.0001843345,0.0000083616505,0.00028499152,0.987034,0.0008799496,0.011045678],"study_design_scores_gemma":[0.0001848783,0.00017610462,0.00063529646,0.000043877968,0.0000030439257,0.000023759481,0.000010156086,0.0032951874,0.0022777717,0.9841492,0.009047025,0.00015370148],"about_ca_topic_score_codex":0.000004145121,"about_ca_topic_score_gemma":0.0000029737703,"teacher_disagreement_score":0.37717342,"about_ca_system_score_codex":0.000035545192,"about_ca_system_score_gemma":0.00006116552,"threshold_uncertainty_score":0.36154103},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8760946,0.013362794,0.006187685,0.0028624453,0.007157894,0.0012584343,0.000021926717,0.0004919186,0.09256234],"genre_scores_gemma":[0.9164737,0.000029198944,0.07244518,0.000044812332,0.000016765056,0.000025305413,0.0000017328668,0.000031683718,0.010931619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996874,0.00039696816,0.00083271455,0.00068376824,0.0008824817,0.00033011293],"domain_scores_gemma":[0.9970282,0.0017124435,0.00012329253,0.000873097,0.00011783612,0.00014513922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036310265,0.00019693247,0.00045308095,0.00048562384,0.000048945938,0.00026600165,0.00083168864,0.00007204421,0.0008285141],"category_scores_gemma":[0.0016677191,0.00016110044,0.00012455221,0.0025383641,0.0001158807,0.0006791099,0.00025527863,0.00020257749,0.00030231968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016492514,0.00011222395,0.0026037237,0.000016975735,0.00002277603,0.00006968828,0.0011840956,0.00009273309,0.15176542,0.79220885,0.033858337,0.017900236],"study_design_scores_gemma":[0.00049375166,0.00023492414,0.0007677526,0.00007235551,0.000007067956,0.000014870208,0.00029939722,0.0008956891,0.20502113,0.7812281,0.010794943,0.00017001537],"about_ca_topic_score_codex":0.00044003993,"about_ca_topic_score_gemma":0.00002700941,"teacher_disagreement_score":0.08163072,"about_ca_system_score_codex":0.000088606605,"about_ca_system_score_gemma":0.00022563935,"threshold_uncertainty_score":0.9071648},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85863507,0.0075896834,0.06572562,0.0034349551,0.012317896,0.0006634476,0.0000043792033,0.0011497083,0.050479263],"genre_scores_gemma":[0.99790496,0.00006604114,0.0013838093,0.000017611952,0.000004690139,0.000015976122,2.7513147e-7,0.000010618881,0.0005960412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988937,0.00010586571,0.00016262513,0.00023252658,0.00033429408,0.00027099313],"domain_scores_gemma":[0.99857044,0.0006833666,0.000030836167,0.000575684,0.00008227616,0.000057366215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006796178,0.00008364756,0.000094436844,0.00006878713,0.00017130534,0.00016556284,0.0010365439,0.000031013573,0.000010768692],"category_scores_gemma":[0.00009383545,0.00005818061,0.00008342164,0.0010096431,0.00014554903,0.00031244959,0.00030353418,0.00022525301,0.000111153524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029908474,0.000012016399,0.000426651,0.000012522542,0.000021060658,0.000016108936,0.0002450389,0.00000431828,0.00030028724,0.9863131,0.0007290147,0.011916871],"study_design_scores_gemma":[0.00009714566,0.000027122356,0.00021176814,0.00003321096,0.0000020643822,0.000014307856,0.000024162911,0.0024296949,0.0017132203,0.98784715,0.007531324,0.000068857706],"about_ca_topic_score_codex":0.0000052409528,"about_ca_topic_score_gemma":7.2436086e-7,"teacher_disagreement_score":0.13926989,"about_ca_system_score_codex":0.000020542564,"about_ca_system_score_gemma":0.000058038157,"threshold_uncertainty_score":0.23725364},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6815328,0.0021607585,0.07548838,0.011404636,0.025765128,0.00084455893,0.000003811485,0.0019106854,0.20088926],"genre_scores_gemma":[0.9930934,0.000039570317,0.0035096216,0.0006614236,0.000009335842,0.000034523313,5.057865e-7,0.000008355281,0.00264327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986799,0.000056654488,0.00028549624,0.00039624964,0.00023807214,0.00034366414],"domain_scores_gemma":[0.9981745,0.00029007238,0.00006837387,0.0012515293,0.00014033244,0.00007519666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028662776,0.00014967028,0.00019079543,0.0001483189,0.00016865258,0.00021573843,0.0022832756,0.000084232925,0.000022387241],"category_scores_gemma":[0.00038101146,0.00015514824,0.0000704004,0.00066846045,0.000102362275,0.00039639542,0.0008947786,0.00018042828,0.00019097532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031918958,0.00004361123,0.0014960042,0.0000069365246,0.000017391838,0.000010105834,0.00036836392,0.000017299371,0.0003657229,0.9733765,0.010112129,0.014182716],"study_design_scores_gemma":[0.00018298865,0.00004983781,0.0012826691,0.00004036423,0.000006106848,0.0000020985428,0.00007652459,0.0051282994,0.04110768,0.89418626,0.057756197,0.00018096116],"about_ca_topic_score_codex":0.00006448024,"about_ca_topic_score_gemma":0.000009303064,"teacher_disagreement_score":0.3115606,"about_ca_system_score_codex":0.00007937678,"about_ca_system_score_gemma":0.000114450166,"threshold_uncertainty_score":0.6326762},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63835037,0.0003074663,0.35181326,0.0014560482,0.002738494,0.00032991177,0.0000064861565,0.00014432508,0.0048536505],"genre_scores_gemma":[0.98830503,0.0000046839336,0.01083549,0.000105613166,0.000005754816,0.000014802215,0.000031723855,0.0000034239422,0.00069346133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991095,0.00007589383,0.00027060002,0.0002225066,0.00019316579,0.00012834885],"domain_scores_gemma":[0.9991547,0.0001707872,0.00009514513,0.0003290928,0.00021357804,0.000036722293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023111672,0.00008896901,0.00013871487,0.00018244605,0.00020604554,0.00010112303,0.0003091072,0.00005847493,0.000011281559],"category_scores_gemma":[0.000086602544,0.00009596902,0.00004959017,0.0012371318,0.000027531787,0.00031444765,0.000057947338,0.00007048797,0.00001783116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072104544,0.00009263163,0.001053086,0.000011429825,0.000021707696,0.0000010483664,0.0001509673,0.0052334084,0.0022055646,0.98479456,0.0021287247,0.0042996844],"study_design_scores_gemma":[0.0012158776,0.00009178367,0.033819012,0.000047160494,0.00002187113,0.0000032964358,0.000014643955,0.23030603,0.019518815,0.7091038,0.005651946,0.0002057274],"about_ca_topic_score_codex":0.00004173594,"about_ca_topic_score_gemma":0.000008212846,"teacher_disagreement_score":0.3499547,"about_ca_system_score_codex":0.00003666873,"about_ca_system_score_gemma":0.00025075846,"threshold_uncertainty_score":0.39135033},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90329903,0.000042927542,0.0000011807433,0.0002429463,0.0008941022,0.00016900999,3.0025305e-7,0.00004042077,0.09531008],"genre_scores_gemma":[0.99876475,0.0000113152055,0.000007529853,0.0006013423,0.000011959248,0.000016638196,0.000016675012,0.000010601797,0.0005591683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992721,8.973587e-7,0.00023392682,0.00022318805,0.00007134934,0.00019850537],"domain_scores_gemma":[0.9997005,0.000019462863,0.00008171115,0.00016170577,0.00002670776,0.000009911692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020029715,0.00012321364,0.00016251623,0.0004183822,0.00007182079,0.0005701921,0.00015022009,0.00007392891,0.000022273442],"category_scores_gemma":[0.000015961163,0.0001234076,0.000036240843,0.00036028822,0.000028536586,0.002551967,0.00018722437,0.00010056975,0.000084857435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003019706,0.00006912907,0.056537896,0.000040187657,0.00001242449,0.0000047184417,0.000017259963,0.0000045817796,0.000019767529,0.93950444,0.00084384397,0.0029155675],"study_design_scores_gemma":[0.0023436793,0.0000061308424,0.07717417,0.000039632705,0.000012587841,5.696144e-7,0.00011697827,0.00062945543,0.000036993402,0.91254526,0.006932849,0.00016167437],"about_ca_topic_score_codex":0.00043917453,"about_ca_topic_score_gemma":0.00031171128,"teacher_disagreement_score":0.095465735,"about_ca_system_score_codex":0.000041354982,"about_ca_system_score_gemma":0.000009741326,"threshold_uncertainty_score":0.5498375},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.976796,0.0007615426,0.00021678905,0.002705105,0.009610001,0.0002902324,0.0000064882356,0.00036829972,0.009245579],"genre_scores_gemma":[0.99635583,0.000033486926,0.0026056266,0.0006820819,0.0000014604793,0.0000061970713,0.0000027137728,0.0000068457553,0.00030578385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985132,0.00008710504,0.00041260236,0.00041479338,0.00030819557,0.00026409622],"domain_scores_gemma":[0.99856764,0.0002556799,0.00013867588,0.0007993035,0.00017006317,0.00006861715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060842186,0.00014390018,0.00023069397,0.0003048729,0.00013532957,0.00005045568,0.0006302425,0.00009596633,0.0000011350859],"category_scores_gemma":[0.00019471218,0.0001340458,0.0000949263,0.0008762801,0.00006862602,0.00017039277,0.00019825666,0.00018609744,0.000021634385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034715365,0.00013131282,0.00023900841,0.000013702079,0.00002555213,0.0000048449515,0.000109471795,0.00008052329,0.002028852,0.9912153,0.0051337765,0.0009829649],"study_design_scores_gemma":[0.0016284043,0.00016083907,0.00046150023,0.00012788062,0.000008298074,7.5824875e-7,0.000009482336,0.0010127632,0.010930865,0.98516667,0.00036483456,0.00012770806],"about_ca_topic_score_codex":0.00004210478,"about_ca_topic_score_gemma":0.0000013531233,"teacher_disagreement_score":0.01955984,"about_ca_system_score_codex":0.000020664706,"about_ca_system_score_gemma":0.000095494004,"threshold_uncertainty_score":0.54662293},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.959681,0.00046896955,0.028485013,0.00063333195,0.0014795364,0.00022296599,8.5354543e-7,0.00026287412,0.008765495],"genre_scores_gemma":[0.98802966,0.00002002749,0.011306433,0.00018520432,3.3748853e-7,0.0000052842875,0.0000011135578,0.0000066997504,0.00044525674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886155,0.00005038713,0.00028968332,0.00029942166,0.00026324022,0.00023572092],"domain_scores_gemma":[0.99900293,0.000086375476,0.00010068007,0.000596811,0.00012703688,0.00008615085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018293422,0.00014858127,0.00026417637,0.00015890389,0.0000805019,0.000054822813,0.00050935533,0.00005327085,0.0000129569835],"category_scores_gemma":[0.00001547678,0.00011933304,0.00006677472,0.001311893,0.00012747911,0.00022327338,0.00013398768,0.000109034554,0.000042111235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008705043,0.000087462184,0.005566323,0.000041208525,0.000041057363,0.000005840622,0.00020755053,0.000051688847,0.00032519348,0.98515,0.005434035,0.00308093],"study_design_scores_gemma":[0.0014527645,0.00010559615,0.002572162,0.00018041194,0.000023003406,0.0000065234062,0.00003769663,0.00352473,0.0066708294,0.9849586,0.00031672537,0.00015099545],"about_ca_topic_score_codex":0.0002220171,"about_ca_topic_score_gemma":0.0000067483397,"teacher_disagreement_score":0.028348682,"about_ca_system_score_codex":0.00001385279,"about_ca_system_score_gemma":0.00017748329,"threshold_uncertainty_score":0.486626},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9926322,0.0002731542,0.0016168135,0.00029781336,0.0013492214,0.00013534514,0.0000012532423,0.0001640744,0.0035301147],"genre_scores_gemma":[0.99759084,0.000008726103,0.00198453,0.00012474213,2.9148177e-7,0.00001256403,0.0000010377531,0.00000583622,0.00027145882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989451,0.00004125396,0.00022153564,0.00029852512,0.0002224671,0.00027111828],"domain_scores_gemma":[0.999085,0.000088238994,0.00008746433,0.0005453814,0.00013207829,0.000061810795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002662133,0.00012225984,0.00019993352,0.00019301589,0.00012389098,0.00004675163,0.0004649695,0.000054679906,0.0000037541372],"category_scores_gemma":[0.000029811006,0.00010386322,0.000058518704,0.0010354895,0.00005583642,0.00019337732,0.00022778324,0.0001254085,0.000008610772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000883376,0.00013147839,0.007868348,0.000020293428,0.00003313575,0.0000056025137,0.00013412384,0.000042080435,0.0011065148,0.9896938,0.00054624566,0.00040950437],"study_design_scores_gemma":[0.001591603,0.000197558,0.0055915043,0.00011451581,0.000014733852,0.000004946406,0.00003139873,0.0018850527,0.009662091,0.98035944,0.00038497386,0.00016220968],"about_ca_topic_score_codex":0.000031047744,"about_ca_topic_score_gemma":0.000003266879,"teacher_disagreement_score":0.009334425,"about_ca_system_score_codex":0.000013669311,"about_ca_system_score_gemma":0.00007779929,"threshold_uncertainty_score":0.42354193},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9813945,0.00011639024,0.0058350083,0.00021958296,0.0012888749,0.00021860085,0.0000022168588,0.00013771554,0.010787091],"genre_scores_gemma":[0.9971984,0.00000933814,0.0023296196,0.00006428503,0.000001433394,0.000019164238,8.16622e-7,0.000007634946,0.00036927674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987208,0.000106129824,0.00020978453,0.00033698883,0.00032592926,0.00030035785],"domain_scores_gemma":[0.9986855,0.00038991502,0.00006891023,0.0006830082,0.000103416,0.00006927206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034581622,0.00012933649,0.00022236168,0.00032302432,0.00012089145,0.000040580708,0.000897348,0.000056178946,0.000004939163],"category_scores_gemma":[0.00013659202,0.00012568387,0.00007462473,0.00093347026,0.00012181288,0.00022822898,0.00021129397,0.00020130137,0.000018461027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037683436,0.00009302616,0.0043769307,0.000018857305,0.000028582468,0.000007788408,0.00009063863,0.000042960186,0.0014061446,0.9914233,0.0002670192,0.0022070778],"study_design_scores_gemma":[0.0005996317,0.00016942754,0.007240637,0.00006537457,0.0000034770483,0.0000020038578,0.000020435991,0.00065507105,0.013773989,0.9772626,0.000098327815,0.00010898234],"about_ca_topic_score_codex":0.0000134347165,"about_ca_topic_score_gemma":0.0000018653723,"teacher_disagreement_score":0.015803913,"about_ca_system_score_codex":0.000042024254,"about_ca_system_score_gemma":0.00006944129,"threshold_uncertainty_score":0.51252395},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9301136,0.0002005824,0.0017059013,0.001217237,0.022726044,0.0003107381,0.000004341645,0.00016485881,0.043556668],"genre_scores_gemma":[0.9950798,0.000030502524,0.00011602313,0.00015318858,0.000008321339,0.000016410873,0.0000011268014,0.0000065661025,0.0045880335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987091,0.00017373332,0.00039805367,0.00026474893,0.0002123191,0.00024208507],"domain_scores_gemma":[0.99855274,0.0003061781,0.00023744484,0.0005375001,0.00032486935,0.000041263585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005735978,0.00012708768,0.00020741328,0.000071409675,0.00040566013,0.00010775868,0.00060617056,0.00012313917,0.000020647552],"category_scores_gemma":[0.00010973557,0.00009860489,0.00012386848,0.0009227699,0.0000739142,0.00018292463,0.00020642945,0.00014719831,0.000039401995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010436155,0.00003212177,0.030977102,0.000007924037,0.00011342556,0.0000018209596,0.00017977017,0.0000035500943,0.000109463384,0.91284627,0.04263986,0.013078255],"study_design_scores_gemma":[0.0018408854,0.00010414035,0.028507108,0.00027709658,0.0000358608,0.00006970337,0.00015220468,0.02992137,0.0031790691,0.921807,0.013729848,0.0003757058],"about_ca_topic_score_codex":0.00016192075,"about_ca_topic_score_gemma":0.00011686007,"teacher_disagreement_score":0.0649662,"about_ca_system_score_codex":0.00013503425,"about_ca_system_score_gemma":0.00006504069,"threshold_uncertainty_score":0.40209907},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97024494,0.00019408797,0.000079354446,0.000583975,0.0008545584,0.00054023333,0.000018889034,0.00021843208,0.027265532],"genre_scores_gemma":[0.9972838,0.00008083032,0.00024680287,0.0003798779,0.0000066097487,0.00006492962,0.000008830727,0.000033545035,0.0018947665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998456,0.00008851513,0.00036665853,0.00047884614,0.00022239266,0.0003875827],"domain_scores_gemma":[0.9979384,0.0009043571,0.00012331866,0.0008141086,0.000088072054,0.0001317753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004144015,0.00029837483,0.00036121937,0.00023866876,0.0006666891,0.000094288545,0.00036666187,0.00019588124,0.00007080401],"category_scores_gemma":[0.00027326014,0.00029236733,0.00012607049,0.0006907937,0.00016461404,0.00013130548,0.00013525745,0.0003609613,0.00006676931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038354647,0.00034967196,0.0025709274,0.000105332336,0.00006976942,0.0000047544495,0.00036311202,0.0000023404539,0.00010778771,0.98004705,0.015961716,0.00037917466],"study_design_scores_gemma":[0.0013609391,0.00009013256,0.005446936,0.00015985756,0.000063870866,0.0000036349925,0.00014920418,0.00006935971,0.0009075622,0.98497343,0.0064990837,0.00027600222],"about_ca_topic_score_codex":0.000028483777,"about_ca_topic_score_gemma":0.000031015254,"teacher_disagreement_score":0.027038869,"about_ca_system_score_codex":0.000055515637,"about_ca_system_score_gemma":0.000046234556,"threshold_uncertainty_score":0.99995285},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98642546,0.00009366631,0.0007955363,0.00026141692,0.0018614504,0.00015068958,0.000029595958,0.00013354089,0.0102486545],"genre_scores_gemma":[0.9980143,0.000018859577,0.0006958095,0.0000698834,0.00000668406,0.000011454341,0.00005974448,0.000008676976,0.0011146016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928856,0.00013648758,0.00022179827,0.00014514018,0.00006934636,0.0001386611],"domain_scores_gemma":[0.99900377,0.000363725,0.00007656167,0.00033660932,0.00017940681,0.000039919185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013979553,0.00008715945,0.00017837588,0.000116792595,0.00012759483,0.0000046452747,0.00013376288,0.000106302745,0.00007389866],"category_scores_gemma":[0.00063876685,0.00008643501,0.000038655147,0.00051100936,0.00011513517,0.00009828466,0.000036632766,0.00014688884,0.00002023719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042433516,0.00019030488,0.0024747308,0.000025185493,0.000046043122,0.000002915213,0.000091452675,0.0000031171292,0.00027300042,0.98404336,0.012766001,0.00004143237],"study_design_scores_gemma":[0.00040067357,0.00011336195,0.002523278,0.000019810499,0.000054728218,0.0000016587312,0.00021125862,0.000013633784,0.0012506938,0.99439615,0.00094168796,0.00007303553],"about_ca_topic_score_codex":0.000013916869,"about_ca_topic_score_gemma":0.00001604392,"teacher_disagreement_score":0.011824313,"about_ca_system_score_codex":0.000024178582,"about_ca_system_score_gemma":0.000065695356,"threshold_uncertainty_score":0.35247174},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97599435,0.0011271018,0.0052077477,0.001220977,0.0024409764,0.00039015242,0.00000391743,0.00030618306,0.013308592],"genre_scores_gemma":[0.99859715,0.00001709679,0.0010811497,0.00014189036,6.8369525e-7,0.000011678522,0.0000015747042,0.000007695108,0.00014108581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986025,0.00010510803,0.0003034641,0.00033137185,0.00033708138,0.00032046187],"domain_scores_gemma":[0.9980337,0.0006079364,0.0001802652,0.0007949144,0.00031614024,0.00006705081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059797644,0.00015655048,0.00019823437,0.00014182505,0.00040463975,0.00018909345,0.0010457536,0.0000639507,0.0000014643292],"category_scores_gemma":[0.00026739156,0.000104379185,0.00006768809,0.0013746499,0.00013147123,0.00017775758,0.00031354144,0.00021546938,0.0000028892762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016820873,0.000048860064,0.014144375,0.000012756109,0.00004295041,0.0000059247386,0.0001606309,0.00006832001,0.000051618543,0.9762877,0.002452767,0.006707251],"study_design_scores_gemma":[0.0007380824,0.000114801114,0.010282059,0.000061676394,0.0000125706365,0.0000021973242,0.000071020106,0.0040071406,0.0006570278,0.9832651,0.00066121755,0.0001271269],"about_ca_topic_score_codex":0.0003713959,"about_ca_topic_score_gemma":0.000038181115,"teacher_disagreement_score":0.022602793,"about_ca_system_score_codex":0.000022039143,"about_ca_system_score_gemma":0.0001460342,"threshold_uncertainty_score":0.42564598},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99369425,0.00049420446,0.0006063575,0.00015572931,0.0016834718,0.00010465429,0.0000010803225,0.00007575569,0.0031845197],"genre_scores_gemma":[0.9952234,0.000012220587,0.004522011,0.00003250421,2.3113365e-7,0.0000054354696,6.6102234e-7,0.00000422204,0.00019933023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989709,0.000048065034,0.00033167755,0.00024201837,0.00022936547,0.00017794444],"domain_scores_gemma":[0.9989111,0.0000981559,0.00013674733,0.0006077453,0.00020015654,0.0000461025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003260333,0.00010141636,0.00023561208,0.00022177359,0.000059577156,0.000017284672,0.0005260241,0.00006295539,0.0000027664867],"category_scores_gemma":[0.00005857269,0.000098346994,0.00009580396,0.0009502866,0.00009089002,0.00013144544,0.00025198323,0.0000894608,0.0000027726696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057827656,0.00009095829,0.0032668582,0.000040215393,0.000030943345,0.0000021006924,0.00010256504,0.000039742492,0.008133289,0.98585355,0.00059834705,0.0018356243],"study_design_scores_gemma":[0.0006366197,0.00011235641,0.0059499964,0.000102174934,0.000011169005,0.0000016321549,0.000015600846,0.001109018,0.062446836,0.92945176,0.000074898,0.00008790601],"about_ca_topic_score_codex":0.000058508165,"about_ca_topic_score_gemma":0.000001400206,"teacher_disagreement_score":0.05640178,"about_ca_system_score_codex":0.000011223187,"about_ca_system_score_gemma":0.000067867346,"threshold_uncertainty_score":0.4010474},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7523694,0.00077217916,0.040333893,0.0061927694,0.018071128,0.0006600387,0.0000055999785,0.0008934689,0.18070152],"genre_scores_gemma":[0.9952261,0.000016763774,0.0029472804,0.0004748893,0.0000053152253,0.000012848268,0.000004949016,0.000004431911,0.0013074126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911946,0.000029462444,0.00017159211,0.00028606888,0.00015702515,0.00023640548],"domain_scores_gemma":[0.99938476,0.00006115762,0.000036005764,0.000464874,0.000029574852,0.000023632863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035874144,0.00009412795,0.00011835219,0.00018367094,0.00007211949,0.00023866165,0.0009940634,0.000032681768,0.000005839597],"category_scores_gemma":[0.00004110096,0.0000968848,0.000027190232,0.00081461394,0.000022039489,0.0006588972,0.0005709318,0.00010937382,0.00005266655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.27317e-7,0.00004921886,0.009981236,0.000011809683,0.0000070939222,0.000015813406,0.000044402328,0.000004757826,0.000023968187,0.9702601,0.0042978968,0.015302913],"study_design_scores_gemma":[0.0011428364,0.000024278319,0.0383897,0.000093542214,0.000006205251,8.004449e-7,0.000041725252,0.03361725,0.00062589097,0.8991376,0.026664328,0.0002558442],"about_ca_topic_score_codex":0.00007301914,"about_ca_topic_score_gemma":0.000006679602,"teacher_disagreement_score":0.24285671,"about_ca_system_score_codex":0.000041766583,"about_ca_system_score_gemma":0.000033053908,"threshold_uncertainty_score":0.39508477},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99760914,0.0001778219,0.000042363492,0.00008595883,0.00003365908,0.00019387837,0.000012073585,0.000019029718,0.0018261023],"genre_scores_gemma":[0.9995899,0.000017654813,0.0003239288,0.000012490763,9.150868e-7,0.00003341745,0.0000015278566,0.000004446234,0.00001571577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947184,0.000031272895,0.000216277,0.00014768903,0.000052689247,0.0000802551],"domain_scores_gemma":[0.9990649,0.0004956751,0.000095756266,0.00026777695,0.000044774963,0.000031098967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028266732,0.00008250731,0.00022454052,0.00005387597,0.000044699907,0.0000069627163,0.000111205074,0.000068449845,0.000004488018],"category_scores_gemma":[0.00008520018,0.000069005655,0.000040404906,0.00024107483,0.00034229262,0.000029327115,0.000082528946,0.00007896242,1.5792894e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000139108215,0.00018715845,0.0065762564,0.00020864788,0.000035476158,3.745964e-8,0.00042277042,9.07862e-9,0.014818518,0.9771085,0.000088258086,0.0005405018],"study_design_scores_gemma":[0.0003389343,0.000017863375,0.0019104168,0.000030454199,0.000026444084,6.4579774e-7,0.0002303999,0.0000075578305,0.059520382,0.93773997,0.00012777778,0.000049175593],"about_ca_topic_score_codex":0.000007029534,"about_ca_topic_score_gemma":0.0000010366664,"teacher_disagreement_score":0.044701863,"about_ca_system_score_codex":0.000004303944,"about_ca_system_score_gemma":0.000015445317,"threshold_uncertainty_score":0.2813969},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.992376,0.00008015706,0.0006104361,0.00091602077,0.0019440141,0.0008153535,0.00014783944,0.000010162581,0.0030999908],"genre_scores_gemma":[0.99890524,5.682074e-7,0.00002958308,0.00004244788,0.00003319456,0.00004724995,0.0000106412845,0.000008366112,0.0009227261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992952,0.000043616703,0.00020656572,0.00015245265,0.00011864829,0.00018354866],"domain_scores_gemma":[0.99918866,0.00018493802,0.000062852196,0.0004439818,0.000094189694,0.000025358251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021034868,0.00010307467,0.00016099226,0.000015843216,0.0001904322,0.000027015663,0.00035946464,0.000033911245,0.000016702423],"category_scores_gemma":[0.000021912638,0.000060755152,0.00018259839,0.00020980074,0.00008414873,0.000024358798,0.00012063517,0.00011784346,0.0000011084204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031610645,0.0004166518,0.07817928,0.000029746954,0.00019974221,4.5236803e-8,0.00031429707,0.00003476254,0.00035734693,0.905645,0.0032734906,0.011518009],"study_design_scores_gemma":[0.0035189074,0.00015545951,0.16500847,0.00017626517,0.00046185916,2.2128626e-7,0.0017722482,0.008271528,0.07757153,0.6972798,0.045302182,0.00048150955],"about_ca_topic_score_codex":0.00009635401,"about_ca_topic_score_gemma":0.0000026913126,"teacher_disagreement_score":0.20836519,"about_ca_system_score_codex":0.000019640807,"about_ca_system_score_gemma":0.00010892732,"threshold_uncertainty_score":0.24775232},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9910806,0.0026121382,0.00035276383,0.00035547646,0.0025437078,0.0002085879,0.0000018907232,0.00014836875,0.0026964636],"genre_scores_gemma":[0.9983534,0.0001440564,0.0010101489,0.00013202586,0.0000029755167,0.000015395684,0.0000014229871,0.000008556036,0.0003320078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988008,0.00006951024,0.0002653294,0.00044124428,0.00016018616,0.0002629119],"domain_scores_gemma":[0.99884725,0.00013277086,0.00010399891,0.00078267686,0.000068406145,0.00006491367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003244555,0.00016130449,0.00025687972,0.00014317909,0.00009827359,0.00006301675,0.00073834654,0.000056518198,0.000007179046],"category_scores_gemma":[0.000046536174,0.00015676876,0.00006615617,0.0006936354,0.00012345257,0.0003558434,0.0003725937,0.00013394041,0.000012539694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076030424,0.00009060199,0.0032487442,0.000044741693,0.00003747637,0.0000045332567,0.00028267127,0.0000025641293,0.0027310671,0.9794376,0.0017394157,0.012372999],"study_design_scores_gemma":[0.0007503487,0.0000743996,0.017803427,0.00006400237,0.00001433054,0.0000060070724,0.00004404492,0.0017663277,0.016714865,0.9616896,0.00088713126,0.00018554612],"about_ca_topic_score_codex":0.0000810199,"about_ca_topic_score_gemma":0.0000029694606,"teacher_disagreement_score":0.017748013,"about_ca_system_score_codex":0.000036134854,"about_ca_system_score_gemma":0.00011538549,"threshold_uncertainty_score":0.63928443},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.994007,0.0003735657,0.00021462231,0.00001825843,0.0014693012,0.00011865471,0.000004952656,0.000108450506,0.0036852255],"genre_scores_gemma":[0.9997886,0.00002148235,0.00012409069,0.000008616253,0.0000034101868,0.000008101031,0.0000017826827,0.000007884213,0.000036046535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949074,0.000044633463,0.00018995831,0.00009707121,0.00006103604,0.000116591924],"domain_scores_gemma":[0.99970216,0.00006267137,0.000028337263,0.00014614375,0.000031080668,0.000029583214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011396054,0.000090934824,0.0001716727,0.00007585452,0.000036549034,0.000014031872,0.00007374675,0.000054130396,0.000008310299],"category_scores_gemma":[0.000013899724,0.000095403564,0.00002963285,0.00018025887,0.00006900841,0.00005113217,0.000017517943,0.000068384135,0.0000039939296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017143295,0.000014678486,0.010354504,0.00018802666,0.00006813303,0.0000018424705,0.00013377388,0.00032816845,0.03225011,0.9554932,0.00044795548,0.0007024405],"study_design_scores_gemma":[0.0013740491,0.00008703234,0.019709935,0.00020448078,0.00005100757,0.000013227206,0.00025374605,0.00416057,0.050079126,0.9224926,0.0013275,0.0002466937],"about_ca_topic_score_codex":0.000007881204,"about_ca_topic_score_gemma":0.000002467915,"teacher_disagreement_score":0.033000592,"about_ca_system_score_codex":0.000012956943,"about_ca_system_score_gemma":0.000010367838,"threshold_uncertainty_score":0.38904443},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9229165,0.00032668567,0.05729332,0.0005979032,0.0015624941,0.00088616804,0.0000091507645,0.00027249995,0.016135287],"genre_scores_gemma":[0.99541366,0.000017832896,0.0036685395,0.0000823232,0.000001757621,0.00010246867,0.0000030596066,0.000010530893,0.0006998222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851996,0.00012627839,0.00021726039,0.0003942776,0.00036440042,0.00037784842],"domain_scores_gemma":[0.99818754,0.00037816397,0.00008610667,0.00082468905,0.00032968292,0.00019384208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038375726,0.00015793914,0.0002233674,0.00038730804,0.00021382773,0.00006624857,0.0009124639,0.00005381366,0.000015328864],"category_scores_gemma":[0.00018234263,0.00014546147,0.00006591432,0.0019847741,0.00021778504,0.00043908705,0.00032456018,0.0002468363,0.000016969676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011203299,0.00016526112,0.012641764,0.00002011577,0.00004941603,0.000023900182,0.000051967378,0.000041934058,0.0004422094,0.98106986,0.0005200574,0.0048614605],"study_design_scores_gemma":[0.0023903935,0.0004298638,0.013917178,0.0001796677,0.000024417914,0.0000147669625,0.000112674854,0.0014740069,0.007795414,0.97037435,0.0030183087,0.0002689827],"about_ca_topic_score_codex":0.0000424732,"about_ca_topic_score_gemma":0.000016924361,"teacher_disagreement_score":0.072497174,"about_ca_system_score_codex":0.000115778246,"about_ca_system_score_gemma":0.0002954471,"threshold_uncertainty_score":0.5931747},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98698896,0.00009994355,0.0015167678,0.0011542679,0.003153303,0.00015949142,0.0000018454316,0.0001552073,0.0067701847],"genre_scores_gemma":[0.99778277,0.000010655775,0.0009984412,0.0007552036,4.7415816e-7,0.000009897093,0.000002438543,0.0000047625,0.0004353882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897844,0.000063918924,0.0002573193,0.00028446995,0.00023120666,0.0001846524],"domain_scores_gemma":[0.99900305,0.00007330483,0.000047853675,0.0006439186,0.00016830994,0.00006356789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002666921,0.00011552835,0.0001621602,0.0003420851,0.00017282966,0.00008170161,0.00055676623,0.00008373632,0.000005981628],"category_scores_gemma":[0.00006455731,0.00010972728,0.00006933108,0.0011076475,0.000085535896,0.00018618528,0.00017599517,0.00016124765,0.000023315135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039898923,0.00015264907,0.004148241,0.00000879685,0.000021710117,0.0000018931408,0.00015245534,0.00048721745,0.0005681431,0.9888101,0.005254762,0.00039000902],"study_design_scores_gemma":[0.00080063666,0.00011088048,0.003076137,0.000058489564,0.0000069292932,6.9486134e-7,0.00001983992,0.008288915,0.0040560034,0.98291713,0.0005465147,0.00011785463],"about_ca_topic_score_codex":0.00013142262,"about_ca_topic_score_gemma":0.00002392168,"teacher_disagreement_score":0.01079375,"about_ca_system_score_codex":0.000021862494,"about_ca_system_score_gemma":0.00014347993,"threshold_uncertainty_score":0.44745487},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9577033,0.0038727138,0.0018359339,0.0022184572,0.010208533,0.00094783143,0.000020706919,0.0011444503,0.022048095],"genre_scores_gemma":[0.9942008,0.0005471323,0.0015478008,0.0017110201,0.000102244405,0.00006705775,0.000015392978,0.00008376806,0.0017247361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948955,0.00051196857,0.00093597936,0.0014849077,0.00088166044,0.0012899699],"domain_scores_gemma":[0.9951551,0.0010026558,0.00040102116,0.0025544795,0.0005271864,0.0003595762],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0018983741,0.00088532164,0.0009204373,0.0005565499,0.0018086529,0.00093132484,0.003029808,0.00042867556,0.00013756801],"category_scores_gemma":[0.0004682245,0.0007505654,0.00033279933,0.003522944,0.00053368433,0.0010376353,0.0024263542,0.0010098994,0.00020490693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119377786,0.00033678603,0.0029054424,0.000118290845,0.0002458185,0.000049465965,0.0018780263,0.000023822144,0.0013329115,0.9721035,0.014883591,0.0060029873],"study_design_scores_gemma":[0.0028408312,0.00078561687,0.01670592,0.00059825013,0.000250886,0.00009114638,0.00040169974,0.0067027793,0.0030955332,0.8658115,0.10111876,0.0015970425],"about_ca_topic_score_codex":0.000091392416,"about_ca_topic_score_gemma":0.00003594525,"teacher_disagreement_score":0.10629194,"about_ca_system_score_codex":0.00015689159,"about_ca_system_score_gemma":0.00036454684,"threshold_uncertainty_score":0.99949455},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7934035,0.0004965461,0.17903754,0.0017778211,0.0026767228,0.00040089275,0.000001722196,0.0002108878,0.021994345],"genre_scores_gemma":[0.9971575,0.000016634182,0.0018022672,0.000073851385,0.0000020432765,0.000029977855,8.8762505e-7,0.0000043003274,0.0009125294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989365,0.00011065621,0.00017567002,0.0002915235,0.0002275978,0.00025805522],"domain_scores_gemma":[0.99920607,0.0002029221,0.000036788497,0.00044976582,0.000063503176,0.000040954867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039133817,0.000090871545,0.0001238336,0.0002792411,0.000072000104,0.00008243912,0.0008736041,0.000043540003,0.0000055880137],"category_scores_gemma":[0.00011249933,0.00009164681,0.000037667633,0.0010378299,0.00005907295,0.00045067136,0.00023145735,0.00017934784,0.000020719835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014037185,0.00005963517,0.00926889,0.0000059361296,0.0000043389236,0.0000146021,0.00011583756,0.000021224787,0.00034433117,0.97283524,0.0001705488,0.017145392],"study_design_scores_gemma":[0.0007746807,0.00002988603,0.027113613,0.000037206726,8.216353e-7,8.7557635e-7,0.000015082733,0.0044668224,0.0021329655,0.9640459,0.0012958497,0.000086336004],"about_ca_topic_score_codex":0.000013737972,"about_ca_topic_score_gemma":0.00003751505,"teacher_disagreement_score":0.20375398,"about_ca_system_score_codex":0.00011658172,"about_ca_system_score_gemma":0.000056319575,"threshold_uncertainty_score":0.37372485},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93056434,0.00008766817,0.00037316815,0.0003999452,0.00060514995,0.0005369716,0.000011946316,0.00017886484,0.067241944],"genre_scores_gemma":[0.9925931,0.000008853785,0.0007397372,0.00016258004,0.000009386985,0.00008286984,0.0000068330137,0.000031249747,0.0063654054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834603,0.00020740282,0.0002736846,0.0003240212,0.00040328482,0.00044560313],"domain_scores_gemma":[0.9969425,0.0021646605,0.00008200596,0.0005546335,0.00016755694,0.00008860299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055355387,0.00021888563,0.00030078666,0.00017107098,0.00015886642,0.00008159841,0.00040756384,0.00016545782,0.00028522787],"category_scores_gemma":[0.00075351895,0.00018376914,0.000080351485,0.000482921,0.00015599401,0.0002191366,0.00017410185,0.00046209252,0.000040348998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030566493,0.00029935368,0.00476881,0.00015141781,0.00015013016,0.000039003968,0.001153965,0.000006298366,0.000088739354,0.98207444,0.010438739,0.0005234355],"study_design_scores_gemma":[0.0022545117,0.0003782665,0.006358291,0.00018423826,0.00006541821,0.000002805293,0.0003203576,0.0004221765,0.003847682,0.9835845,0.0023034029,0.00027831033],"about_ca_topic_score_codex":0.000029890309,"about_ca_topic_score_gemma":0.00003564136,"teacher_disagreement_score":0.062028747,"about_ca_system_score_codex":0.000069870424,"about_ca_system_score_gemma":0.00014083505,"threshold_uncertainty_score":0.7493888},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9455303,0.00013435252,0.041154794,0.008091411,0.0012583507,0.00064618286,0.0018035889,0.000021947017,0.0013590585],"genre_scores_gemma":[0.999469,0.000011560022,0.000236656,0.000072534844,0.00000246733,0.000021124823,0.000018994928,0.0000018673219,0.00016582492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889225,0.00013688524,0.00034614356,0.00022689138,0.00028837164,0.0001094725],"domain_scores_gemma":[0.9943094,0.0048835073,0.00011277133,0.0004077019,0.0002568436,0.000029730842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015536655,0.00006814604,0.00015087535,0.00003897037,0.00026130595,0.000055211498,0.00025662265,0.000047941026,0.000004270067],"category_scores_gemma":[0.0021233463,0.000040673163,0.00005027062,0.00027458675,0.00023586725,0.000069870635,0.0000538037,0.000084428684,0.0000054897314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000147229,0.00010013992,0.00038152444,0.000006451923,0.000014568645,1.1525092e-7,0.00028581131,0.00014610164,0.00006946047,0.98642045,0.00968258,0.00274556],"study_design_scores_gemma":[0.0007231647,0.000105570914,0.021869512,0.000021098274,0.00001843414,2.900097e-7,0.00010430361,0.0058029713,0.0006378177,0.96843606,0.0022371458,0.000043633678],"about_ca_topic_score_codex":0.000063626365,"about_ca_topic_score_gemma":0.000033928634,"teacher_disagreement_score":0.053938653,"about_ca_system_score_codex":0.000030769617,"about_ca_system_score_gemma":0.000042050844,"threshold_uncertainty_score":0.25419974},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97807866,0.000599782,0.005424083,0.0024845947,0.0043050656,0.00052904256,0.000011057619,0.00038191362,0.008185817],"genre_scores_gemma":[0.997668,0.000035562283,0.0002778922,0.0006845308,0.0000063259536,0.000068002366,0.000008221159,0.000008620694,0.0012428432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853104,0.00017437409,0.00027794993,0.00047020515,0.00020611752,0.0003402919],"domain_scores_gemma":[0.99895704,0.00021099704,0.00003449764,0.00066650566,0.00005107198,0.000079906145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003892992,0.0001982647,0.00023035695,0.00031492044,0.00021608466,0.00020780478,0.0009661307,0.0000936024,0.000012108472],"category_scores_gemma":[0.00007082116,0.0001895188,0.00008523563,0.0012760385,0.00006091869,0.000518809,0.00017220576,0.0002467446,0.000041152598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008463493,0.00027632667,0.000726971,0.000010785315,0.000015458201,0.000010916051,0.00018486807,0.00010513049,0.00044058522,0.9940728,0.00196783,0.0021798455],"study_design_scores_gemma":[0.0014050225,0.00012830207,0.0017547616,0.000072179326,0.000006226308,0.00000152209,0.0000349949,0.011014292,0.0073224306,0.9756238,0.0023393973,0.0002970627],"about_ca_topic_score_codex":0.000057317357,"about_ca_topic_score_gemma":0.0000075099965,"teacher_disagreement_score":0.019589357,"about_ca_system_score_codex":0.00005297189,"about_ca_system_score_gemma":0.00008079491,"threshold_uncertainty_score":0.77283525},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91465706,0.00009813047,0.0003527294,0.0014437042,0.0015139239,0.0003217243,0.000009338455,0.00027955475,0.08132384],"genre_scores_gemma":[0.9970713,0.000005678693,0.0013691963,0.00020854255,0.0000039494407,0.00007299434,0.0000044537887,0.000014064203,0.0012497732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906975,0.000085243664,0.00025133937,0.00023185025,0.00013451233,0.00022731225],"domain_scores_gemma":[0.9985954,0.00068260427,0.000037692225,0.000505188,0.00010991393,0.00006917971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002863187,0.00012686313,0.0001858515,0.00010033689,0.00022140484,0.000042699114,0.00028140275,0.00009460136,0.000087980094],"category_scores_gemma":[0.00046577246,0.00012762273,0.00012517144,0.00040625202,0.00014187675,0.00006312775,0.00006943251,0.00016752056,0.00006150835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010791107,0.00026310506,0.00027643234,0.000049364906,0.00003470353,0.0000035444027,0.000072961455,6.447881e-8,0.00075547444,0.9904474,0.007835887,0.00025025176],"study_design_scores_gemma":[0.00043901248,0.000021774427,0.00059943274,0.000037887352,0.00006580659,0.0000017943931,0.00006790969,0.000011776095,0.0022024387,0.9934619,0.002969373,0.000120912104],"about_ca_topic_score_codex":0.000005876061,"about_ca_topic_score_gemma":0.0000034625978,"teacher_disagreement_score":0.08241429,"about_ca_system_score_codex":0.000018285506,"about_ca_system_score_gemma":0.00004376165,"threshold_uncertainty_score":0.5204304},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9691213,0.0004648853,0.01985927,0.0024874017,0.0032455525,0.0007922808,0.0000052123473,0.00069868576,0.003325406],"genre_scores_gemma":[0.98377186,0.0000054109214,0.014969445,0.00055785326,6.773826e-7,0.00010074089,0.000004590072,0.000011248014,0.00057819876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988617,0.000038135302,0.0002017603,0.00042170263,0.00016399352,0.00031275972],"domain_scores_gemma":[0.99877006,0.00028443328,0.000067732064,0.0006104461,0.00019323285,0.00007410347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022033647,0.00016154679,0.00020540397,0.00021779106,0.0001825124,0.0001364011,0.0005891602,0.00007124617,0.0000031988375],"category_scores_gemma":[0.00007063605,0.00012780885,0.00008881182,0.00080937566,0.000057856116,0.00021874785,0.000114252754,0.00009253377,0.0000093850895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017992888,0.00007954468,0.0018718846,0.000015544647,0.000052121166,0.000002487792,0.000097367534,0.0000110470355,0.0006601894,0.98940283,0.005752911,0.0020360635],"study_design_scores_gemma":[0.0017211534,0.0002548439,0.0014078915,0.00006133399,0.000022087606,0.0000019904148,0.000013873752,0.002554437,0.00505782,0.98728734,0.0014314031,0.00018579706],"about_ca_topic_score_codex":0.00003137108,"about_ca_topic_score_gemma":0.00002485246,"teacher_disagreement_score":0.01465053,"about_ca_system_score_codex":0.00001611966,"about_ca_system_score_gemma":0.00007369942,"threshold_uncertainty_score":0.52118933},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9640466,0.00022800096,0.01160533,0.0009069049,0.0015473972,0.0006018622,0.0000032776777,0.00051250315,0.020548135],"genre_scores_gemma":[0.9932011,0.000014906715,0.0057263556,0.00025635737,0.0000034786624,0.00008958333,0.0000031135203,0.000022016035,0.0006831385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974398,0.00017536065,0.0002938579,0.00080384384,0.00053972646,0.00074741355],"domain_scores_gemma":[0.9975867,0.0002841834,0.000088513974,0.001561137,0.0002756338,0.000203798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005627842,0.0002998004,0.00032398108,0.0006349234,0.0003382844,0.00022368372,0.002058975,0.0001285201,0.00001731784],"category_scores_gemma":[0.00007619892,0.0002672979,0.00012037056,0.0034019342,0.00022231822,0.0006706594,0.0005947212,0.00052041427,0.0000784018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000637426,0.0001465871,0.006112171,0.000023892646,0.00006131832,0.000052812436,0.00012298794,0.0000029121234,0.0012108529,0.98634,0.00042606928,0.005436646],"study_design_scores_gemma":[0.0013201357,0.0002717377,0.014239137,0.00006197292,0.000011124172,0.000011963615,0.0000339557,0.00034560706,0.0054180454,0.9768201,0.0011507946,0.00031540132],"about_ca_topic_score_codex":0.000029196524,"about_ca_topic_score_gemma":0.000010002922,"teacher_disagreement_score":0.02915446,"about_ca_system_score_codex":0.00007998908,"about_ca_system_score_gemma":0.00024356469,"threshold_uncertainty_score":0.99997795},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99050516,0.000103537095,0.0004216119,0.0015513555,0.0025444783,0.00013017197,4.48649e-7,0.00009639978,0.004646821],"genre_scores_gemma":[0.9988976,0.0000067814753,0.0004495261,0.000495367,2.09523e-7,0.000012179333,2.2899063e-7,0.0000033424633,0.00013475688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991755,0.00006307926,0.00020319327,0.00021363283,0.00018637876,0.00015823361],"domain_scores_gemma":[0.9989333,0.00025521178,0.00007179494,0.0005988375,0.00011091017,0.000029901523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004674204,0.00009059065,0.00012817238,0.00009423257,0.0001233638,0.000045200602,0.0007386039,0.00004522702,0.000004384881],"category_scores_gemma":[0.00010215722,0.000061264676,0.00008439278,0.00064816873,0.00007333167,0.00007619288,0.00026044584,0.00016113282,0.00001140353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050639687,0.00006224713,0.000605822,0.000008692126,0.00002045694,9.221007e-7,0.0001282564,0.000010202073,0.0013076284,0.9943036,0.0025749006,0.0009722158],"study_design_scores_gemma":[0.00029244085,0.00010585106,0.00084834645,0.00006509,0.000004692776,4.7678694e-7,0.0000173118,0.0017438702,0.016073212,0.98064655,0.00014209769,0.00006005486],"about_ca_topic_score_codex":0.000028615817,"about_ca_topic_score_gemma":8.99906e-7,"teacher_disagreement_score":0.014765584,"about_ca_system_score_codex":0.000013646867,"about_ca_system_score_gemma":0.00004597637,"threshold_uncertainty_score":0.2498301},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98956066,0.000006343471,0.00119296,0.0003068571,0.00038024833,0.000463261,0.0000073190727,0.00012991946,0.007952427],"genre_scores_gemma":[0.99757904,0.0000014891782,0.001342129,0.00012480145,0.0000053819685,0.00010287516,0.000010345769,0.000016884758,0.00081703695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993462,0.000038036687,0.00015490496,0.00019295607,0.00009236119,0.00017553984],"domain_scores_gemma":[0.9986508,0.0009080987,0.000092236194,0.00025987392,0.000054039516,0.0000349867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021620897,0.00012093498,0.00016323187,0.00006441084,0.00024805954,0.000039551778,0.00013483636,0.0000679197,0.000037355785],"category_scores_gemma":[0.000096548916,0.00010110238,0.00005723884,0.00023093613,0.000037666643,0.000069941816,0.000019120544,0.000105267565,0.000023511171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008276877,0.00018562916,0.00069298706,0.00004948446,0.00006039195,4.4865652e-7,0.00031508703,0.0000037239463,0.0001723516,0.99543667,0.0026505738,0.00034987569],"study_design_scores_gemma":[0.0009851896,0.00007847344,0.0008562116,0.00009128871,0.00005672542,0.0000016958974,0.0004138484,0.00001938164,0.0022347425,0.9940664,0.0010805886,0.000115409646],"about_ca_topic_score_codex":0.000011558237,"about_ca_topic_score_gemma":0.000024802037,"teacher_disagreement_score":0.008018391,"about_ca_system_score_codex":0.000040746534,"about_ca_system_score_gemma":0.000024529792,"threshold_uncertainty_score":0.41228354},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96382636,0.00036909065,0.00009043221,0.000014987613,0.0016471006,0.00011829743,0.000010645827,0.00014151384,0.033781577],"genre_scores_gemma":[0.99979675,0.00001666117,0.00006623857,0.00001338158,0.0000011667515,0.000018119024,0.0000053392596,0.0000088286815,0.00007351399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954134,0.000031991665,0.00016722866,0.00008006041,0.000062045896,0.000117328695],"domain_scores_gemma":[0.9996606,0.00006844225,0.000018581664,0.00018220788,0.000042000378,0.000028184379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008777221,0.000082366,0.00014199689,0.00012290246,0.000044688863,0.000007903595,0.00011566908,0.000049783604,0.000016439353],"category_scores_gemma":[0.000007726185,0.00008884119,0.00006696615,0.00032559698,0.000038222406,0.000054294134,0.000015680622,0.00008054248,0.000010465088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004658498,0.000034101296,0.0010302907,0.00007279681,0.00008190831,0.0000014107234,0.00014723625,0.000093693394,0.007139047,0.99022734,0.0010366228,0.00013091131],"study_design_scores_gemma":[0.00048057866,0.000034090404,0.009239093,0.00012733614,0.000028943803,0.0000012626144,0.00017975732,0.00038037077,0.03875415,0.94962347,0.0010258986,0.00012502933],"about_ca_topic_score_codex":0.0000061846295,"about_ca_topic_score_gemma":0.0000018023826,"teacher_disagreement_score":0.040603835,"about_ca_system_score_codex":0.00001972364,"about_ca_system_score_gemma":0.000010827431,"threshold_uncertainty_score":0.36228386},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8445446,0.0046560136,0.13345653,0.0020828159,0.006270062,0.00036385452,0.000005573211,0.00055167987,0.008068865],"genre_scores_gemma":[0.9865988,0.000053959244,0.012623824,0.00040026856,3.4013175e-7,0.000007143905,0.0000024477667,0.0000074386503,0.00030581668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858254,0.00007914462,0.0003828432,0.00039855987,0.0002621965,0.00029470684],"domain_scores_gemma":[0.99878925,0.000087261484,0.00012044999,0.0007191797,0.0002066037,0.0000772787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036302977,0.0001581436,0.00027524043,0.00021026385,0.0001384327,0.00006257478,0.0007699062,0.00007367897,0.000005629119],"category_scores_gemma":[0.00004335387,0.00014986517,0.00010900837,0.0012854657,0.00015118784,0.00019814965,0.00022091722,0.00014575657,0.000011796917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059655094,0.000100444384,0.0015213372,0.000029691486,0.000025215419,0.0000058955006,0.00008185171,0.00013643099,0.0034959656,0.99068016,0.0015519168,0.0023651],"study_design_scores_gemma":[0.0010048475,0.000042218566,0.0003833851,0.000100274374,0.000011815435,0.0000018372745,0.000012036848,0.01683326,0.016319945,0.96466285,0.00047315063,0.00015438309],"about_ca_topic_score_codex":0.00006524331,"about_ca_topic_score_gemma":0.0000034088177,"teacher_disagreement_score":0.14205414,"about_ca_system_score_codex":0.000021544123,"about_ca_system_score_gemma":0.00009061909,"threshold_uncertainty_score":0.6111324},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97450006,0.0036153586,0.015357388,0.0014757164,0.00069071434,0.00030063302,0.0000012429103,0.0008905066,0.00316839],"genre_scores_gemma":[0.9480363,0.000016024274,0.050815225,0.0004523486,0.0000026816228,0.000027400034,0.00000195606,0.000008132444,0.00063994207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876153,0.000047611396,0.00019869755,0.0003956744,0.00028219156,0.00031429512],"domain_scores_gemma":[0.9991098,0.00014102606,0.00008506673,0.00051127473,0.00010294951,0.000049856957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023904651,0.00016297046,0.00021136465,0.0001870435,0.00016883662,0.00020858456,0.0010102129,0.00008346526,0.0000054560887],"category_scores_gemma":[0.00013564671,0.00014105902,0.000019558625,0.0012479989,0.00009327917,0.00034976692,0.0006369874,0.00027360825,0.000005736273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002155771,0.000108333676,0.03029913,0.00006617653,0.000012713233,0.000042851145,0.00072153396,0.0000014659348,0.003281899,0.9523452,0.0004692425,0.012629923],"study_design_scores_gemma":[0.0009838769,0.00011645855,0.020609885,0.00091017864,0.0000103628945,0.000010460391,0.000051535175,0.0029630624,0.045765456,0.92773235,0.00038752644,0.00045884887],"about_ca_topic_score_codex":0.00013726747,"about_ca_topic_score_gemma":0.00010163676,"teacher_disagreement_score":0.042483557,"about_ca_system_score_codex":0.0002025517,"about_ca_system_score_gemma":0.00019404592,"threshold_uncertainty_score":0.575222},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7243642,0.000052203653,0.025964575,0.0010591864,0.008656585,0.0014208215,0.000026213442,0.0000868044,0.23836939],"genre_scores_gemma":[0.99881905,4.0658546e-7,0.00026947068,0.000017653336,0.000026212445,0.00005342265,0.0000034013751,0.000009018466,0.00080137036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992988,0.00002408714,0.00024836735,0.00014271606,0.00013654315,0.00014945646],"domain_scores_gemma":[0.99920756,0.00014660128,0.00013732944,0.00038789382,0.00009306993,0.000027522638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012821754,0.00010110322,0.00016695644,0.000022024169,0.00019286037,0.000019095054,0.00023723781,0.00005413595,0.00004638201],"category_scores_gemma":[0.00003763668,0.000076771335,0.00010497125,0.00032612262,0.00007790155,0.00009776992,0.00011626309,0.00022472074,0.0000046440355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008167086,0.00017624669,0.0012010458,0.000024472482,0.00002988635,2.8939736e-8,0.00004417956,0.000025661615,0.0004525147,0.995678,0.00040157657,0.001958202],"study_design_scores_gemma":[0.0005053051,0.0000134925085,0.00045144797,0.000047727706,0.000032675365,7.5417596e-8,0.0001071874,0.00018298761,0.038266167,0.956126,0.0041954666,0.00007146824],"about_ca_topic_score_codex":0.000015653313,"about_ca_topic_score_gemma":2.2256911e-7,"teacher_disagreement_score":0.27445483,"about_ca_system_score_codex":0.000026433587,"about_ca_system_score_gemma":0.00004551003,"threshold_uncertainty_score":0.31306443},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8389727,0.00068181613,0.0006848606,0.0040976154,0.0072282804,0.00033526382,0.0000022185318,0.0011741174,0.14682315],"genre_scores_gemma":[0.9939752,0.000029312921,0.004421804,0.00047122856,0.0000015880071,0.000014436254,0.0000014296767,0.000015772794,0.0010691959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835926,0.00008199772,0.00026387942,0.00049047655,0.00038264852,0.00042171765],"domain_scores_gemma":[0.99854624,0.00008098366,0.00008672604,0.00087873143,0.00021942832,0.00018791258],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002881038,0.0001890283,0.00019344782,0.000097481265,0.00020423571,0.0001786853,0.0007921214,0.00007999141,0.00014684106],"category_scores_gemma":[0.00005040281,0.0001794214,0.000087212335,0.0007280024,0.000047816287,0.00035731692,0.00022355102,0.0002203973,0.0012678884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.6627716e-7,0.00014030572,0.005535684,0.000004036536,0.00001545025,0.000011325242,0.00029532766,0.000016001411,0.00017306839,0.97512984,0.017701486,0.0009765838],"study_design_scores_gemma":[0.0009710472,0.00004851113,0.00052330823,0.000019109857,0.0000068167355,0.000026723335,0.000008024505,0.017542934,0.00063099276,0.97856516,0.0014075817,0.00024981878],"about_ca_topic_score_codex":0.000118138145,"about_ca_topic_score_gemma":0.000023073078,"teacher_disagreement_score":0.15500255,"about_ca_system_score_codex":0.000019683686,"about_ca_system_score_gemma":0.000015856382,"threshold_uncertainty_score":0.99950975},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6427252,0.0038378802,0.0038574403,0.0036346281,0.014490245,0.0035070227,0.000115003444,0.011155699,0.31667686],"genre_scores_gemma":[0.99315834,0.0005044315,0.002447371,0.00015813099,0.000016629665,0.000031292173,0.00002632694,0.00006028126,0.0035971922],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929756,0.000029213657,0.00018390191,0.00016791269,0.00012583591,0.00019559261],"domain_scores_gemma":[0.99959743,0.00005637874,0.00002796749,0.00018585104,0.000045835153,0.000086550324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056164834,0.00015280119,0.0001423355,0.000087744316,0.000090692265,0.000060922805,0.00008868345,0.0000965541,0.0003259687],"category_scores_gemma":[0.000033655186,0.0001412982,0.00002209267,0.00031815405,0.000021709617,0.000095258685,0.000018660583,0.000110186025,0.00009004821],"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.00006300456,0.00063909945,0.0045417757,0.00054917805,0.0002599217,0.00005235975,0.005941541,0.19142213,0.0022656051,0.33436882,0.44080982,0.019086758],"study_design_scores_gemma":[0.0032071332,0.00029189844,0.0010385017,0.00020497902,0.000053177377,0.00002286334,0.000022697222,0.8681905,0.0021532776,0.021911912,0.10192125,0.000981802],"about_ca_topic_score_codex":0.0000048848415,"about_ca_topic_score_gemma":0.0000076066613,"teacher_disagreement_score":0.67676836,"about_ca_system_score_codex":0.000037223726,"about_ca_system_score_gemma":0.0000064487704,"threshold_uncertainty_score":0.57619727},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9899546,0.000106787404,0.000025008705,0.00000555223,0.0012263012,0.00016231347,0.0000013151529,0.000205341,0.008312797],"genre_scores_gemma":[0.999888,0.0000055046867,0.000010658484,0.00002207878,0.000007225393,0.000009353225,0.0000037016648,0.000033885637,0.000019611814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998948,0.00004033869,0.0002753604,0.00017940097,0.00017109029,0.0003858239],"domain_scores_gemma":[0.9994049,0.0002086957,0.000037842434,0.00023109493,0.00001886856,0.00009861588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041254816,0.00019524053,0.0002419028,0.00023065326,0.00004918192,0.000037988448,0.0001378812,0.00008360136,0.00003196928],"category_scores_gemma":[0.000014964594,0.00016465291,0.000046029058,0.00042988392,0.000033884095,0.00014629791,0.000009147842,0.00019659895,0.00003191409],"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.00045212696,0.00010275624,0.12993331,0.00006207382,0.000098608434,0.00014205043,0.003968266,0.0011013901,0.0048247706,0.8590253,0.00014055765,0.00014882277],"study_design_scores_gemma":[0.008000814,0.0018193643,0.40475798,0.001131398,0.0000627917,0.000024118619,0.004718606,0.0010191948,0.17022122,0.40396366,0.0022632787,0.0020175576],"about_ca_topic_score_codex":0.000034885306,"about_ca_topic_score_gemma":0.00010148498,"teacher_disagreement_score":0.4550616,"about_ca_system_score_codex":0.000051239153,"about_ca_system_score_gemma":0.0000056443896,"threshold_uncertainty_score":0.67143506},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99533343,0.00009902383,0.0010788896,0.00041914723,0.00037645406,0.00015914744,7.198403e-7,0.000083588406,0.0024495907],"genre_scores_gemma":[0.9992022,0.00008622095,0.0003579054,0.00023473441,0.0000019966876,0.000018346102,6.1856673e-7,0.000009593306,0.00008841195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998698,0.00012625953,0.00016110676,0.0003761428,0.00025549703,0.00038302667],"domain_scores_gemma":[0.9990817,0.00024771784,0.000038822585,0.0004749133,0.000032451564,0.00012441451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003834783,0.00012407101,0.0001544026,0.00027295307,0.00008388817,0.00009251695,0.00046753316,0.000050092152,0.000014459265],"category_scores_gemma":[0.00007121176,0.00012105989,0.000033727883,0.00087993,0.00008371031,0.00046564697,0.00017673131,0.00018723417,0.000059498747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035194695,0.00007983377,0.01094735,0.0000030362646,0.000005445147,0.000087190354,0.00030002097,0.000056467936,0.0010605776,0.98583955,0.00012220077,0.001463109],"study_design_scores_gemma":[0.00088777835,0.00016335303,0.00719269,0.00002416127,7.8472243e-7,0.000011442386,0.000012933859,0.0023342052,0.0014916896,0.98733026,0.00040512712,0.00014559552],"about_ca_topic_score_codex":0.000028701976,"about_ca_topic_score_gemma":0.000012222815,"teacher_disagreement_score":0.0038687338,"about_ca_system_score_codex":0.00003860686,"about_ca_system_score_gemma":0.00001933301,"threshold_uncertainty_score":0.49366793},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9911885,0.002061892,0.00019836244,0.0010817023,0.002194853,0.000105140716,2.4340645e-7,0.00013628694,0.0030330094],"genre_scores_gemma":[0.99888664,0.00023240849,0.00044916858,0.00015105873,5.204988e-7,0.0000072995686,3.283181e-7,0.0000064738406,0.00026609135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895066,0.00007990856,0.000247632,0.00021485916,0.0002590843,0.00024788242],"domain_scores_gemma":[0.9987257,0.00019336016,0.000110393645,0.0007444829,0.00015072583,0.00007530873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005415004,0.00009880095,0.00012448756,0.00006630929,0.00022490557,0.00006189347,0.00079945335,0.000049743703,0.000003116506],"category_scores_gemma":[0.00006621188,0.00006845816,0.00007996048,0.00059175026,0.000114361865,0.00012242454,0.00016486945,0.00012019004,0.000033888922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041759617,0.000048938924,0.0034453636,0.0000025234567,0.000012148972,0.000007578958,0.00013008194,0.0000057078023,0.0006721182,0.99004096,0.002982335,0.0026480558],"study_design_scores_gemma":[0.00034516392,0.000067204965,0.0027480046,0.000009552984,0.0000048608113,0.000014892021,0.000017580513,0.00081842236,0.002052409,0.9917924,0.002039184,0.00009035073],"about_ca_topic_score_codex":0.00007313352,"about_ca_topic_score_gemma":0.0000066156076,"teacher_disagreement_score":0.0076981406,"about_ca_system_score_codex":0.000008747371,"about_ca_system_score_gemma":0.00004760736,"threshold_uncertainty_score":0.27916428},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99509007,0.00024245518,0.000192598,0.00018064794,0.0013886807,0.0001470214,0.0000055558853,0.00043804102,0.0023149492],"genre_scores_gemma":[0.9994022,0.00001905982,0.00028204313,0.000035780817,0.000033490487,0.000020388396,0.0000068865984,0.00004954346,0.00015061155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992236,0.000021295573,0.00015915562,0.00016583748,0.00016609584,0.00026402483],"domain_scores_gemma":[0.99947345,0.000047664504,0.00003237615,0.00030305135,0.000047458892,0.00009599233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012592497,0.0001983233,0.000202931,0.00007880993,0.00007406391,0.00003828348,0.00018208181,0.00008776746,0.000016143533],"category_scores_gemma":[0.000021216822,0.00016638843,0.0000598737,0.0002751373,0.0000495534,0.00014282682,0.000019722002,0.00017010521,0.00011557775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113689275,0.00019412374,0.018848822,0.00043641683,0.00041345294,0.00029722464,0.003925494,0.07056117,0.0017230214,0.90215176,0.00087082025,0.00046399343],"study_design_scores_gemma":[0.008676837,0.0008587754,0.009785609,0.0012556938,0.00015378548,0.00018703897,0.0024529528,0.008834651,0.038812418,0.9141545,0.012703096,0.002124645],"about_ca_topic_score_codex":0.000027205295,"about_ca_topic_score_gemma":0.000015239829,"teacher_disagreement_score":0.06172652,"about_ca_system_score_codex":0.000023320963,"about_ca_system_score_gemma":0.000016283806,"threshold_uncertainty_score":0.67851233},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55183905,0.00012773776,0.00001948078,0.00048756902,0.003343911,0.00016175126,9.900186e-7,0.0001294793,0.44389004],"genre_scores_gemma":[0.9940041,0.00006599374,0.000056652243,0.00012539484,0.000018091569,0.000008604823,9.26959e-7,0.000008363586,0.005711885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992064,0.000091160684,0.00011435255,0.00014628841,0.00019650665,0.00024525943],"domain_scores_gemma":[0.9995882,0.00004409834,0.0000476481,0.00014046571,0.00006896274,0.000110609784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043638615,0.000070643524,0.00009372218,0.000029356454,0.00040516673,0.0000722524,0.00011721201,0.00008069208,0.00048290862],"category_scores_gemma":[0.00016062726,0.000074132244,0.000051094135,0.00019054984,0.00008212562,0.00015907973,0.00001351748,0.00008968504,0.00007789893],"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.0000030201354,0.000037891583,0.0012462039,0.0000016244347,0.0000069994067,0.0000016227992,0.0018398844,1.5899506e-7,0.00034140708,0.99410236,0.001401322,0.0010175161],"study_design_scores_gemma":[0.00037448236,0.000038997823,0.00094723614,0.0000043764703,0.0000068656136,4.956784e-7,0.00034164882,0.0000088239985,0.000763229,0.10419624,0.8932025,0.000115107745],"about_ca_topic_score_codex":0.0007501184,"about_ca_topic_score_gemma":0.00014483553,"teacher_disagreement_score":0.8918012,"about_ca_system_score_codex":0.0000803505,"about_ca_system_score_gemma":0.00011159979,"threshold_uncertainty_score":0.5287511},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9840194,0.000013439964,0.009841632,0.003158725,0.0014674846,0.00038841978,0.0000012120962,0.00007394109,0.0010357344],"genre_scores_gemma":[0.9984777,0.0000040315776,0.0007471631,0.0006766312,0.000022829972,0.000049313647,0.0000047704116,0.0000051614375,0.000012379363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913263,0.0000599968,0.00018180898,0.00022579363,0.00017341036,0.00022638538],"domain_scores_gemma":[0.99908835,0.00048898073,0.000070662456,0.00029228677,0.00002401787,0.00003570491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003398626,0.000102169506,0.000115457064,0.00004726477,0.00012970198,0.00012018249,0.0005544773,0.00005121485,7.386082e-7],"category_scores_gemma":[0.00009481588,0.000076090924,0.000055654855,0.00025238885,0.000015902908,0.00017394136,0.00005248266,0.00014035068,0.000014494818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000095785335,0.0001385335,0.00013084983,0.0000072729977,0.0000039643055,0.000009757006,0.0027172174,0.00024351633,0.00004254815,0.9609448,0.000293495,0.035458505],"study_design_scores_gemma":[0.001398993,0.00034865233,0.005805708,0.0000323587,0.0000029085697,0.0000020082512,0.0000984583,0.0053454004,0.0007390566,0.9858485,0.00024217671,0.00013580777],"about_ca_topic_score_codex":0.00015260988,"about_ca_topic_score_gemma":0.00007759443,"teacher_disagreement_score":0.035322696,"about_ca_system_score_codex":0.00005802912,"about_ca_system_score_gemma":0.00006372866,"threshold_uncertainty_score":0.31028977},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7514677,0.00012132386,0.24067533,0.0011571799,0.005784145,0.00029726882,0.00000421542,0.00018754732,0.00030531434],"genre_scores_gemma":[0.9458192,0.000006909191,0.053847395,0.00017555735,0.000014303374,0.000017610233,0.00002082938,0.000008152182,0.0000900194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902743,0.000023149854,0.00019059838,0.00032808524,0.0002199457,0.00021076886],"domain_scores_gemma":[0.9993249,0.000061192644,0.00008011255,0.0002936928,0.00015971149,0.00008037023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018185793,0.00012035626,0.00012171096,0.000084800035,0.00020585481,0.00011955296,0.00034850507,0.000060966086,0.0000027945994],"category_scores_gemma":[0.000034660785,0.00012796528,0.000082058155,0.0004929974,0.000019700037,0.00047589547,0.00006327484,0.000068813366,0.000027919505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004588601,0.000056119927,0.000074619835,0.000008297705,0.000013934776,0.0000025312481,0.00017041138,0.009231292,0.00067187374,0.981802,0.00071828294,0.0072460705],"study_design_scores_gemma":[0.0010626107,0.00013398362,0.001648144,0.000009312072,0.000006355585,0.000015074764,0.000011541484,0.006806023,0.008147521,0.9793099,0.0026769005,0.00017259954],"about_ca_topic_score_codex":0.000015861113,"about_ca_topic_score_gemma":0.0000035263463,"teacher_disagreement_score":0.19435155,"about_ca_system_score_codex":0.000077860255,"about_ca_system_score_gemma":0.000086663276,"threshold_uncertainty_score":0.5218273},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9645196,0.0012904158,0.015667815,0.0005930914,0.0026368592,0.0006574313,0.000007472503,0.0005470888,0.014080209],"genre_scores_gemma":[0.9955615,0.0000656936,0.003948176,0.00006591967,0.0000020815073,0.0000234495,0.0000012331838,0.00001812597,0.00031385018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978524,0.00018841762,0.0003396588,0.00047677069,0.0006332764,0.00050949876],"domain_scores_gemma":[0.9980043,0.0002692141,0.00013965461,0.0011381464,0.00025962215,0.00018904134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040052642,0.00019274982,0.00028076235,0.0003995759,0.00014536186,0.00004017314,0.0014277754,0.000080947655,0.00009645512],"category_scores_gemma":[0.00015107288,0.00018854895,0.00015446941,0.002204633,0.00025151527,0.00050233037,0.00034543916,0.00023786495,0.00008992947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010346721,0.000223853,0.001538701,0.000013454176,0.000027804936,0.000020134077,0.00034822995,0.000004997952,0.0027826843,0.98994184,0.0008068185,0.0042811227],"study_design_scores_gemma":[0.0009267864,0.00027595044,0.00074612984,0.000023599383,0.000004550986,0.000007129504,0.000022863529,0.002223869,0.010092866,0.98480374,0.0006667985,0.00020570823],"about_ca_topic_score_codex":0.000009803072,"about_ca_topic_score_gemma":0.0000012061311,"teacher_disagreement_score":0.031041853,"about_ca_system_score_codex":0.000028850149,"about_ca_system_score_gemma":0.000020587395,"threshold_uncertainty_score":0.7688803},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9898179,0.0013048005,0.0001502157,0.0007283554,0.001880513,0.00012784777,0.0000022280049,0.0002903504,0.00569775],"genre_scores_gemma":[0.996502,0.000083928004,0.0027943803,0.00033313982,5.9967033e-7,0.0000042681977,0.0000012849264,0.000010875496,0.00026951378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986273,0.00005897576,0.00034877827,0.00033059088,0.00034215846,0.00029217164],"domain_scores_gemma":[0.9987273,0.00010603872,0.00015420961,0.0007018085,0.00019233882,0.000118255535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030671872,0.00015214586,0.0002220108,0.00020973089,0.00008925409,0.000056467434,0.0007126323,0.00007986421,0.000049651022],"category_scores_gemma":[0.000065722066,0.00014378972,0.00009566069,0.00095898286,0.00008889477,0.00027252617,0.00019243658,0.00016081972,0.00021056895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011159595,0.00008459406,0.0015761836,0.000013727072,0.00001608516,0.0000066870143,0.00069990556,0.000016498829,0.001076156,0.9903452,0.0049039423,0.0012599388],"study_design_scores_gemma":[0.0007312124,0.0001341797,0.0002811541,0.00003627381,0.000008353956,0.000007939148,0.000013835357,0.007749297,0.0029417474,0.98657376,0.0013318491,0.00019043151],"about_ca_topic_score_codex":0.000039937895,"about_ca_topic_score_gemma":7.750699e-7,"teacher_disagreement_score":0.0077327983,"about_ca_system_score_codex":0.000009615172,"about_ca_system_score_gemma":0.000014651706,"threshold_uncertainty_score":0.5863574},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938357,0.00023195453,0.00014533913,0.0000838433,0.0024381594,0.00007133111,6.3707523e-7,0.00019076274,0.0030022727],"genre_scores_gemma":[0.9959149,0.000013856914,0.003921763,0.000051985546,7.336604e-7,0.0000050329177,9.675306e-7,0.000008683957,0.0000821202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988072,0.000042065865,0.00028270026,0.0002906099,0.00031641236,0.00026103962],"domain_scores_gemma":[0.9990281,0.00011739783,0.00012382632,0.0004706796,0.00015989924,0.00010008674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002611829,0.00012076186,0.00020305472,0.00012105071,0.00021231311,0.0000307557,0.00050870056,0.000057045818,0.0000042556767],"category_scores_gemma":[0.0001537409,0.00012063289,0.00008607742,0.0005725386,0.00009218779,0.00024560044,0.0002193175,0.00013746801,0.000017835002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027713377,0.00007668768,0.0069907345,0.0000102102495,0.000013422697,0.000028243383,0.00053216703,0.000037045203,0.001890186,0.98908246,0.000906097,0.00042998078],"study_design_scores_gemma":[0.00079323025,0.00015530226,0.008929724,0.000054953012,0.0000061731776,0.00007228927,0.000017216147,0.0035730682,0.008603927,0.9774676,0.00010783811,0.00021869047],"about_ca_topic_score_codex":0.00009072082,"about_ca_topic_score_gemma":7.536452e-7,"teacher_disagreement_score":0.011614866,"about_ca_system_score_codex":0.000016156298,"about_ca_system_score_gemma":0.00005848459,"threshold_uncertainty_score":0.49192664},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96761006,0.00034647793,8.6333154e-7,0.000013864306,0.0007270813,0.00011343541,0.0000062456033,0.00006233398,0.031119667],"genre_scores_gemma":[0.99982566,0.000039775354,0.000003278032,0.000016822902,0.000004001662,0.000010556043,0.0000016983669,0.000020336673,0.0000778958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930525,0.00007683066,0.00022069261,0.00009418084,0.00015668264,0.0001463636],"domain_scores_gemma":[0.99933773,0.0002121602,0.000032257718,0.0003652425,0.000020635454,0.000031959542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026506043,0.00011839601,0.00020559008,0.00006678641,0.000039032017,0.000005420499,0.0002244449,0.000056582714,0.0002501307],"category_scores_gemma":[0.000017674236,0.00008679744,0.000119868964,0.00031209897,0.00006609756,0.000039068902,0.000008298201,0.00012742492,0.00004430881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001979643,0.00005882112,0.0007566697,0.00006732375,0.000070868766,0.0000014776035,0.00027863018,0.0003895557,0.0030925698,0.9933049,0.0010810621,0.0008783446],"study_design_scores_gemma":[0.0009994954,0.0003978105,0.005759225,0.00022455855,0.00005475386,0.000011143358,0.00027760424,0.0014258376,0.05258518,0.93612164,0.0017960741,0.00034669915],"about_ca_topic_score_codex":0.000011882495,"about_ca_topic_score_gemma":6.4828384e-7,"teacher_disagreement_score":0.057183266,"about_ca_system_score_codex":0.000010523609,"about_ca_system_score_gemma":0.000004297985,"threshold_uncertainty_score":0.3539497},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9877422,0.00038440534,0.0007900453,0.0000022166626,0.002170822,0.00012135927,0.000006824615,0.0001674163,0.008614704],"genre_scores_gemma":[0.999693,0.000031434465,0.00022254474,0.0000028315235,0.000006224714,0.000004384834,0.0000015755706,0.000022485163,0.000015553576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99932784,0.000054309192,0.00019897798,0.00011282082,0.00012925235,0.00017677672],"domain_scores_gemma":[0.9996789,0.000052208932,0.000036789468,0.00016045252,0.000020147201,0.00005150676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013001513,0.000120700075,0.00020272794,0.000088250345,0.000052852865,0.000014092969,0.00009343759,0.00007625893,0.00009037653],"category_scores_gemma":[0.0000074225068,0.00013343814,0.00008231613,0.00026634667,0.000064062246,0.00015440305,0.0000061105543,0.00008061371,0.000012328029],"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.000040289757,0.00016258513,0.0059368336,0.00032561072,0.0003568439,0.000019948211,0.0019808214,0.0085990485,0.1972735,0.7821785,0.00091908814,0.002206906],"study_design_scores_gemma":[0.011270336,0.0009192895,0.0030078427,0.00088389363,0.0005799866,0.00021223925,0.0021812944,0.2324836,0.4213855,0.3190002,0.0053823455,0.002693452],"about_ca_topic_score_codex":0.000020943096,"about_ca_topic_score_gemma":0.0000011072656,"teacher_disagreement_score":0.4631783,"about_ca_system_score_codex":0.00004085062,"about_ca_system_score_gemma":0.0000030099873,"threshold_uncertainty_score":0.5441449},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9852616,0.0019307043,0.0030278852,0.0008022909,0.0037017895,0.00040106254,0.0000025897732,0.00049107464,0.004380968],"genre_scores_gemma":[0.9688646,0.000026583897,0.03001273,0.00060673594,4.168724e-7,0.000018337407,5.842359e-7,0.000012088292,0.00045790832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987833,0.0000621266,0.00018405015,0.00042213322,0.00021466846,0.00033373537],"domain_scores_gemma":[0.999108,0.000060734375,0.000042758275,0.00041544187,0.000116961775,0.00025608428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035969805,0.00014778589,0.00016365977,0.00015225404,0.00016922252,0.00011622822,0.0003374401,0.00005502726,0.000008926097],"category_scores_gemma":[0.00008555693,0.00013879637,0.00003758552,0.00062127854,0.000020794874,0.00024380643,0.00013840898,0.000098050834,0.00008909425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.1671817e-7,0.00004764808,0.00017149175,0.0000040950804,0.000006815386,0.000013396385,0.00010604234,0.0000035443693,0.0009779693,0.988967,0.0011329061,0.008568278],"study_design_scores_gemma":[0.0005944338,0.00016413625,0.0002449125,0.000021392945,0.000005051672,0.000034454788,0.0000066346474,0.0039217486,0.00908828,0.9831544,0.002540237,0.00022431201],"about_ca_topic_score_codex":0.000011692168,"about_ca_topic_score_gemma":8.791639e-7,"teacher_disagreement_score":0.026984844,"about_ca_system_score_codex":0.000010932371,"about_ca_system_score_gemma":0.00003422035,"threshold_uncertainty_score":0.5659952},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94087905,0.000050824856,0.054437064,0.00018830823,0.002582375,0.00012873788,0.0000017643106,0.00011017719,0.0016216987],"genre_scores_gemma":[0.9963682,0.0000069120924,0.0034155096,0.00014443426,0.0000193762,0.0000025055263,0.0000027641445,0.000008988206,0.00003127127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866927,0.00003732905,0.0003959921,0.00026525333,0.00035263578,0.0002795113],"domain_scores_gemma":[0.9989742,0.00010993023,0.00020526639,0.0004929381,0.00014386294,0.000073779214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056462165,0.0001258042,0.00018131713,0.00013770843,0.00006478243,0.00006375387,0.00068864744,0.00008556506,0.000028514502],"category_scores_gemma":[0.00011073586,0.0001266186,0.00006446413,0.00038844324,0.00006853814,0.0004784204,0.00019405007,0.00013152268,0.000028561777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010496394,0.000036531677,0.0034481438,0.00001561832,0.000016150461,0.000012329471,0.0026579155,0.000010588009,0.014611636,0.91259027,0.00018014152,0.066410184],"study_design_scores_gemma":[0.00013365639,0.000101247446,0.08144175,0.000031581072,0.0000054167513,0.000010630847,0.00015201126,0.0022751074,0.19408406,0.72051543,0.0010186905,0.0002304417],"about_ca_topic_score_codex":0.000087993176,"about_ca_topic_score_gemma":0.0000054375582,"teacher_disagreement_score":0.19207487,"about_ca_system_score_codex":0.000066110864,"about_ca_system_score_gemma":0.00006252806,"threshold_uncertainty_score":0.51633567},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9964664,0.00033008787,0.00011259892,0.00038956234,0.00047276454,0.0003706035,0.000005909048,0.0001675985,0.0016845033],"genre_scores_gemma":[0.9975086,0.00002888235,0.0020605184,0.000023469118,0.000014555386,0.000034860135,0.0000060808275,0.00006064263,0.00026241204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978443,0.00018137779,0.0003636546,0.00042853254,0.0005854424,0.0005967425],"domain_scores_gemma":[0.9984535,0.0003247309,0.0001124796,0.0007455022,0.00013226699,0.00023153027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092645374,0.00025449006,0.00034434666,0.00014632876,0.00022083444,0.00012562709,0.0004043193,0.00014995234,0.000058919006],"category_scores_gemma":[0.00046776378,0.00024820853,0.00009195109,0.000319319,0.00028850668,0.00031375515,0.00021313065,0.00032418105,0.000041660245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006725915,0.00019219065,0.0012993695,0.000083087594,0.00008138266,0.000045188648,0.0004185207,0.000012908754,0.0012715339,0.995826,0.0004095215,0.00029305898],"study_design_scores_gemma":[0.0021157772,0.0003049149,0.0013901202,0.000078759746,0.000053516716,0.000013345462,0.00027157742,0.00005968925,0.0046461415,0.9902542,0.00054875656,0.0002631523],"about_ca_topic_score_codex":0.000029864248,"about_ca_topic_score_gemma":0.000022272765,"teacher_disagreement_score":0.0055717295,"about_ca_system_score_codex":0.0000974444,"about_ca_system_score_gemma":0.00009703671,"threshold_uncertainty_score":0.999997},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99243975,0.000046337216,0.0002613156,0.0005614455,0.0007510944,0.00012027078,6.684936e-7,0.000099938625,0.0057191704],"genre_scores_gemma":[0.9988221,7.445232e-7,0.0008592629,0.00014404852,8.3765514e-7,0.0000113222695,8.715017e-7,0.0000068161644,0.00015399668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998996,0.00007803083,0.00022956087,0.00020291396,0.00030524045,0.00018820829],"domain_scores_gemma":[0.9989465,0.00026521934,0.0001059511,0.0005746332,0.000072704635,0.000034992674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028933716,0.000109110464,0.0001393538,0.000051432708,0.0001115711,0.000048485268,0.00045432054,0.00004272315,0.00002716622],"category_scores_gemma":[0.000036666286,0.00007351275,0.000083915445,0.0005009547,0.0000717764,0.00009158501,0.000090401554,0.00008805777,0.00010635574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019494246,0.00013245507,0.00028203666,0.000005782812,0.000008526842,0.0000028171035,0.00007454814,0.000036902824,0.0015136097,0.99314415,0.004721983,0.00007524458],"study_design_scores_gemma":[0.00036543867,0.0000752768,0.001069529,0.000030391091,0.0000046152823,0.000007637616,0.000005525905,0.0016707499,0.004306076,0.992356,0.000015718058,0.000093049275],"about_ca_topic_score_codex":0.00010150243,"about_ca_topic_score_gemma":0.0000010346674,"teacher_disagreement_score":0.006382341,"about_ca_system_score_codex":0.00000959668,"about_ca_system_score_gemma":0.00002515578,"threshold_uncertainty_score":0.2997763},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99397796,0.00026279048,0.00013950068,0.0010616797,0.0012205638,0.000119653974,6.0188574e-7,0.00012235649,0.0030948755],"genre_scores_gemma":[0.99879646,0.0000060358066,0.0007542155,0.0003377671,0.0000011763541,0.0000060347234,0.0000014715264,0.000008737165,0.0000880956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873143,0.000097676624,0.00028701455,0.00030761125,0.00033624997,0.00023998649],"domain_scores_gemma":[0.9985796,0.00032867913,0.00011255413,0.0007806022,0.00015664235,0.00004191497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058613374,0.00012928848,0.00015300006,0.00010627413,0.00019147072,0.000055199504,0.0005909687,0.000052567968,0.000007923323],"category_scores_gemma":[0.0000772348,0.000087380446,0.00009475532,0.00057717913,0.0000888374,0.00012376196,0.00014998043,0.00015229675,0.000041387437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023809857,0.000102225655,0.00056316744,0.0000050282233,0.000004331067,0.000003827691,0.00006778685,0.000055591536,0.0056670876,0.9883296,0.004775685,0.00042331868],"study_design_scores_gemma":[0.00031532103,0.00008291752,0.002498472,0.000044386823,0.000004355134,0.0000042464117,0.000010472566,0.003138271,0.01091494,0.982745,0.00013482064,0.00010681582],"about_ca_topic_score_codex":0.00009386126,"about_ca_topic_score_gemma":0.0000011033325,"teacher_disagreement_score":0.005584589,"about_ca_system_score_codex":0.000010319427,"about_ca_system_score_gemma":0.000025268886,"threshold_uncertainty_score":0.35632712},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9943209,0.00044366534,0.0007306142,0.0007692918,0.001575671,0.00016090894,3.78545e-7,0.00024642132,0.0017521167],"genre_scores_gemma":[0.9825901,0.000011717783,0.01708999,0.00025929537,4.728104e-7,0.000017310065,0.0000012903204,0.000011706707,0.00001813641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840313,0.00006570138,0.00035082296,0.00044030655,0.00034361452,0.00039642045],"domain_scores_gemma":[0.9989914,0.0001272025,0.00011589826,0.000544219,0.00010658607,0.00011470913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007237707,0.00016276365,0.00020675192,0.0004791788,0.00013745137,0.00011233712,0.00070580933,0.00008063671,0.0000027779156],"category_scores_gemma":[0.00017231391,0.00016119036,0.000066305205,0.0023685654,0.000043667784,0.00034596454,0.0002231826,0.00023371342,0.000060605453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012886649,0.00013245035,0.0024320413,0.000008685207,0.0000071738914,0.00002755171,0.00047986707,0.0004481508,0.00042271102,0.99273074,0.00008051911,0.0032288001],"study_design_scores_gemma":[0.0015744471,0.00008442632,0.0027507131,0.00006899278,0.000003438352,0.000010893803,0.000028733491,0.0020084665,0.0035822184,0.9896613,0.00002412002,0.00020228355],"about_ca_topic_score_codex":0.00024346891,"about_ca_topic_score_gemma":0.000013449526,"teacher_disagreement_score":0.016359376,"about_ca_system_score_codex":0.00007236142,"about_ca_system_score_gemma":0.000082928505,"threshold_uncertainty_score":0.6573152},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9800293,0.00033527816,0.00034787873,0.010471155,0.0021846257,0.00041309907,0.0000019049926,0.0005967286,0.0056200344],"genre_scores_gemma":[0.9938796,0.000019451618,0.004426247,0.0015500396,0.0000013036894,0.000030498144,0.0000019366125,0.000013313814,0.00007760269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985307,0.00006753502,0.00023861465,0.00039828944,0.00039599536,0.0003689084],"domain_scores_gemma":[0.9987765,0.00015773583,0.000092567454,0.00077854644,0.00008855005,0.00010610338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005456082,0.00017871469,0.00014984819,0.00010541365,0.0003525396,0.00016859878,0.00089286565,0.0000714699,0.0000069087737],"category_scores_gemma":[0.0000489612,0.000120096964,0.00007646148,0.00065870443,0.000065510605,0.00016007232,0.00016127908,0.00027727857,0.00024433096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033834203,0.00011576502,0.000107387794,0.0000048226416,0.00001532922,0.0000139467165,0.00036083825,0.00026860664,0.00076358014,0.99658656,0.0012660384,0.00049376464],"study_design_scores_gemma":[0.00075706845,0.00018708571,0.000098703706,0.00007358954,0.0000049427344,0.0000112195885,0.000017079541,0.00024512317,0.0035821956,0.9942663,0.0005855446,0.00017115878],"about_ca_topic_score_codex":0.00007837206,"about_ca_topic_score_gemma":0.000004040798,"teacher_disagreement_score":0.013850311,"about_ca_system_score_codex":0.000030372961,"about_ca_system_score_gemma":0.00006840992,"threshold_uncertainty_score":0.48974118},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9247367,0.0012048003,0.019670626,0.0077855373,0.02142538,0.0012682918,0.000008224441,0.0017963847,0.022104064],"genre_scores_gemma":[0.99234957,0.00007724685,0.006411448,0.00039955354,0.000046381763,0.000039257437,0.0000035727096,0.000023767745,0.000649185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732953,0.00023033039,0.00040815087,0.0006662219,0.0006791593,0.0006865932],"domain_scores_gemma":[0.99706006,0.00072483014,0.00019867317,0.0016122207,0.00017839692,0.00022581719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000675057,0.0002832875,0.00028356188,0.000065614666,0.0009200123,0.00022210779,0.002545647,0.000121455734,0.000013373918],"category_scores_gemma":[0.00024810643,0.00021960709,0.00015645388,0.000734335,0.00029349356,0.00041302163,0.0005549325,0.00037425323,0.00029792724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000136225135,0.00026413306,0.011880547,0.000009405564,0.000053549433,0.00015542317,0.0012432822,0.00004834879,0.000036727288,0.9409729,0.033881746,0.011440297],"study_design_scores_gemma":[0.0013831651,0.0003021066,0.04476326,0.000015220749,0.000011155014,0.0003013703,0.000058567464,0.016678965,0.00050529075,0.87967116,0.055634957,0.00067476113],"about_ca_topic_score_codex":0.00021925126,"about_ca_topic_score_gemma":0.000032083768,"teacher_disagreement_score":0.067612894,"about_ca_system_score_codex":0.0001535025,"about_ca_system_score_gemma":0.00020175833,"threshold_uncertainty_score":0.89553165},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99481976,0.00023417357,0.000041907937,0.00000579611,0.0013602634,0.00014322701,0.00000268147,0.000114601375,0.0032775595],"genre_scores_gemma":[0.999862,0.0000101003125,0.000041908337,0.00001160947,0.000010903041,0.0000063037787,0.0000039929937,0.00003199234,0.000021195992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990038,0.000044071876,0.00040227882,0.0001169944,0.00015831122,0.0002744873],"domain_scores_gemma":[0.9992939,0.00026251818,0.000057327346,0.00030324148,0.000021338656,0.00006166829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061477814,0.00015963451,0.0003058375,0.00022088978,0.00003960947,0.0000104483515,0.00021621659,0.00008419112,0.0000107683745],"category_scores_gemma":[0.000018990739,0.00016214688,0.00005699103,0.00031380448,0.0000471885,0.00013446414,0.000026539383,0.00018138433,0.000029807848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016605503,0.000105882915,0.008966164,0.0002216934,0.000029463774,0.000026476037,0.00061489025,0.004748641,0.003668827,0.980658,0.000040530136,0.0009028382],"study_design_scores_gemma":[0.0017525152,0.000119746364,0.020455427,0.0006461327,0.000017611736,0.000008192802,0.00058786134,0.004977118,0.07527371,0.8956988,0.000075054304,0.00038786404],"about_ca_topic_score_codex":0.00003737604,"about_ca_topic_score_gemma":0.000039857776,"teacher_disagreement_score":0.08495922,"about_ca_system_score_codex":0.0000655436,"about_ca_system_score_gemma":0.000008527709,"threshold_uncertainty_score":0.6612158},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96599275,0.000017789327,0.015584059,0.00008099838,0.0001373822,0.00026645578,0.000014858782,0.000017618555,0.017888105],"genre_scores_gemma":[0.9951088,0.0000010387565,0.0045520384,0.000012711336,0.000003583419,0.000015844787,0.000013812204,0.000009990721,0.00028218827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991977,0.000014399372,0.0003964825,0.00012296351,0.00012576116,0.00014269563],"domain_scores_gemma":[0.99928504,0.00012751247,0.00017123029,0.00023456891,0.00011595434,0.000065700035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025522077,0.000083494444,0.00020930501,0.00003658244,0.000037752594,0.0000043418936,0.00012476236,0.000032275162,0.00025782952],"category_scores_gemma":[0.000024266532,0.00007573646,0.00006189522,0.0003063881,0.000046855384,0.000059528265,0.000036577956,0.000057063204,0.000018352133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001199332,0.00009078897,0.00069495046,0.000008240429,0.000020074665,9.8327554e-8,0.0002616921,0.00003748244,0.00829704,0.98851585,0.000116252784,0.0019455565],"study_design_scores_gemma":[0.00030056277,0.000041873183,0.0003923931,0.000024749022,0.000008812964,1.1850977e-7,0.00021976786,0.000022769531,0.082257666,0.9158774,0.0007772176,0.0000766768],"about_ca_topic_score_codex":0.000024661684,"about_ca_topic_score_gemma":3.1857823e-7,"teacher_disagreement_score":0.073960625,"about_ca_system_score_codex":0.000013155337,"about_ca_system_score_gemma":0.000017011385,"threshold_uncertainty_score":0.30884433},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98795974,0.00010973436,0.000493291,0.00007891483,0.0013521895,0.00056359713,0.000028321985,0.00019878552,0.0092154015],"genre_scores_gemma":[0.99421024,0.000007148283,0.0052557886,0.000032144348,0.000040858282,0.000034304336,0.000014921198,0.00006547905,0.00033912546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745435,0.00014773844,0.0009254217,0.00045120894,0.00054271705,0.00047855498],"domain_scores_gemma":[0.99794096,0.00042330814,0.0005325262,0.0008451777,0.00013114675,0.00012685635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006311219,0.00039019954,0.00076351064,0.00010943539,0.00013305071,0.000044495147,0.000375272,0.0002262214,0.000027329079],"category_scores_gemma":[0.00033744887,0.00037619568,0.000157662,0.00032346824,0.0002803228,0.00028121742,0.00028343961,0.0003325998,0.000010336669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004268833,0.0005957251,0.014117706,0.00030257148,0.000038755818,0.0000065939585,0.00012640236,0.0000011374773,0.0004264897,0.9831114,0.0010536584,0.00017689647],"study_design_scores_gemma":[0.0021576146,0.00016683144,0.0127807595,0.00007581197,0.000057513655,0.000011265498,0.000032380714,0.0000799036,0.0020665252,0.98178536,0.00040757997,0.00037845847],"about_ca_topic_score_codex":0.00008477177,"about_ca_topic_score_gemma":0.00002119466,"teacher_disagreement_score":0.008876276,"about_ca_system_score_codex":0.00008663868,"about_ca_system_score_gemma":0.000032172647,"threshold_uncertainty_score":0.999869},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937095,0.00013419983,0.0007437866,0.0043400256,0.00051354524,0.00017538652,0.0000018349241,0.000049131035,0.00033257727],"genre_scores_gemma":[0.99902195,0.000023280843,0.0004940733,0.0004152189,0.0000012470847,0.000012807971,3.9121994e-7,0.0000065032755,0.00002451132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883336,0.00008114367,0.00020495395,0.00028691653,0.00037702025,0.00021662535],"domain_scores_gemma":[0.99875927,0.00032286343,0.00011696456,0.00066821836,0.000066683344,0.00006601778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004173884,0.00013528511,0.00015490517,0.0000553077,0.00023681023,0.000084657935,0.0007853228,0.00005530116,0.0000015345037],"category_scores_gemma":[0.000058935402,0.00007419888,0.0000612285,0.00042174765,0.00020828443,0.00008437529,0.00021884883,0.00024028153,0.000010982731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031797867,0.000046502,0.008866415,0.000004677006,0.000015890351,0.0000014540457,0.00093097845,0.000015668094,0.00038510692,0.98835206,0.00006313336,0.001314914],"study_design_scores_gemma":[0.0004921396,0.00010929331,0.06342764,0.00006225554,0.00000834822,0.0000036040587,0.000023617922,0.00006838784,0.0040112,0.9316561,0.00003920463,0.00009819554],"about_ca_topic_score_codex":0.00019891633,"about_ca_topic_score_gemma":0.000007846993,"teacher_disagreement_score":0.056695968,"about_ca_system_score_codex":0.000016868564,"about_ca_system_score_gemma":0.000050737683,"threshold_uncertainty_score":0.30257425},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99094653,0.00019526824,0.0036911482,0.00012602677,0.0005815122,0.00007009694,0.0000311521,0.000037992584,0.004320257],"genre_scores_gemma":[0.99938387,0.000021881711,0.00055280584,0.000009359844,0.0000015785241,0.0000023092725,0.0000025605957,0.0000027071544,0.000022905842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934876,0.000053219537,0.00020408977,0.00012435,0.00016519359,0.00010440427],"domain_scores_gemma":[0.99910134,0.00023541135,0.00012976985,0.00039431234,0.0001087149,0.00003045015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013159018,0.00007162952,0.00017119553,0.00008566652,0.000038888546,0.000005413593,0.00044489125,0.00003733009,0.000058728252],"category_scores_gemma":[0.000053335112,0.00006484773,0.000067022134,0.00054263824,0.000111216825,0.00007695819,0.000068835616,0.000056687113,0.0000054398583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072721496,0.00028478977,0.0013719175,0.00001608926,0.000020721227,0.0000010091246,0.0001969343,0.000006466069,0.00074172305,0.9956464,0.0007690158,0.00093762996],"study_design_scores_gemma":[0.00044326804,0.00032874348,0.0024755916,0.000056228047,0.000010816465,0.0000019316612,0.000010671434,0.0007231836,0.038318906,0.95694894,0.0005919996,0.00008972949],"about_ca_topic_score_codex":0.000007468714,"about_ca_topic_score_gemma":7.008974e-7,"teacher_disagreement_score":0.0386975,"about_ca_system_score_codex":0.0000049606924,"about_ca_system_score_gemma":0.0000090961985,"threshold_uncertainty_score":0.26444137},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85427225,0.0005891623,0.0070079947,0.0024007761,0.003558824,0.00025866352,0.000002067656,0.0005668621,0.1313434],"genre_scores_gemma":[0.99798524,0.000008959113,0.0012878635,0.00039745253,0.0000055770856,0.0000040982504,0.0000032335515,0.0000031100733,0.00030448608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940234,0.000020036445,0.00013883122,0.00013088253,0.0001492199,0.00015871096],"domain_scores_gemma":[0.99958664,0.000022566179,0.000044788205,0.00024761018,0.000049444858,0.000048945945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013380926,0.00007623307,0.00007955114,0.00004105218,0.000104921986,0.0001447916,0.00027307475,0.000041037736,0.00001156078],"category_scores_gemma":[0.0000072327166,0.00007379003,0.000021322283,0.00016376728,0.000026921214,0.00052654056,0.000129065,0.0000768705,0.00008860298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.6345493e-7,0.00002375593,0.001085176,0.0000027522758,0.000001875357,0.0000026129926,0.00016872189,0.0000013265097,0.000016320646,0.9877255,0.00945374,0.001517687],"study_design_scores_gemma":[0.0008737295,0.000042029704,0.02299008,0.0000072540315,0.0000029631603,0.000023065548,0.000016693082,0.0062301,0.0013691379,0.897086,0.071137644,0.00022125937],"about_ca_topic_score_codex":0.000075584416,"about_ca_topic_score_gemma":0.0000080145655,"teacher_disagreement_score":0.14371297,"about_ca_system_score_codex":0.000017014227,"about_ca_system_score_gemma":0.000022508842,"threshold_uncertainty_score":0.300907},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9841592,0.000015269552,0.013607013,0.0008194041,0.00082479784,0.0001411503,9.758281e-7,0.00004474811,0.00038745892],"genre_scores_gemma":[0.9986879,0.000006787287,0.00085209287,0.00017130087,0.000010191367,0.0000057478287,0.000001871215,0.0000039839074,0.00026010702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945456,0.00002136278,0.00015356175,0.00011876261,0.00013044453,0.000121309364],"domain_scores_gemma":[0.9993929,0.000029582554,0.000100198115,0.00039801237,0.000048895534,0.000030391908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016133722,0.00005275538,0.000069258356,0.000020616442,0.00008071425,0.000025266801,0.00052607636,0.000028422855,0.0000039947276],"category_scores_gemma":[0.000005744261,0.000037946043,0.00004218631,0.00043961342,0.000022198828,0.000106254374,0.0001266643,0.000054765595,0.0000077877085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011433989,0.000026717851,0.0007824483,0.0000017602333,0.00000243279,3.489798e-7,0.000044943015,0.0000033683048,0.092967875,0.9045519,0.00016613453,0.0014509099],"study_design_scores_gemma":[0.0011004832,0.00005987853,0.17505823,0.00003283306,0.000014029776,0.000012137053,0.000006811657,0.009315088,0.30682555,0.48343042,0.023840915,0.0003036322],"about_ca_topic_score_codex":0.000008120922,"about_ca_topic_score_gemma":0.0000017938293,"teacher_disagreement_score":0.4211215,"about_ca_system_score_codex":0.000010755193,"about_ca_system_score_gemma":0.0000145999065,"threshold_uncertainty_score":0.15473948},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97615546,0.0009360183,0.0026549238,0.002556891,0.0016707989,0.0005932108,0.000006011407,0.000677074,0.014749587],"genre_scores_gemma":[0.99532986,0.000080356054,0.003997498,0.00025162016,0.000004515339,0.000041918604,0.00000161383,0.000024799681,0.00026784412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750644,0.0002644587,0.00034705,0.00061971456,0.0005376333,0.0007247284],"domain_scores_gemma":[0.9975832,0.00035489284,0.00008023675,0.001639412,0.0001298447,0.00021239732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004696632,0.00023155294,0.0002857604,0.0004385207,0.00016171255,0.00013962417,0.0027074977,0.00012668561,0.000073978226],"category_scores_gemma":[0.0003473638,0.00023947693,0.00009321406,0.0018667805,0.0002070162,0.0006641131,0.00068182766,0.00045666387,0.0002005082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009469153,0.00019234752,0.004879609,0.000008010385,0.0000126097,0.00011726389,0.00036485714,0.000022921551,0.0004195704,0.98680055,0.0015421686,0.0056306426],"study_design_scores_gemma":[0.0018362525,0.00014293152,0.012613704,0.000031082545,0.0000017949619,0.0000146550565,0.000022790084,0.00830496,0.0008143225,0.9749252,0.0009993725,0.0002929236],"about_ca_topic_score_codex":0.00003609571,"about_ca_topic_score_gemma":0.00006515079,"teacher_disagreement_score":0.019174349,"about_ca_system_score_codex":0.00008919997,"about_ca_system_score_gemma":0.000032452102,"threshold_uncertainty_score":0.97655857},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95660794,0.0013977514,0.00053250685,0.00002526846,0.0071571055,0.00024160599,0.000029214301,0.00013807032,0.033870514],"genre_scores_gemma":[0.9995052,0.000045944016,0.000119541146,0.000015518484,0.00002634571,0.000005983159,0.0000131999695,0.000047736583,0.00022052487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841416,0.00007712266,0.00060376094,0.00021110788,0.00024322834,0.0004505948],"domain_scores_gemma":[0.9988919,0.00022389821,0.00012354617,0.00048407188,0.00010230233,0.00017431137],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079518434,0.00024315141,0.0003730545,0.0001751009,0.00011243585,0.00002456159,0.00027970964,0.0002128806,0.00013198605],"category_scores_gemma":[0.000026929009,0.00027917585,0.00019406795,0.0004850321,0.00008221199,0.00011822577,0.000045521567,0.0002692618,0.00017572046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027976817,0.00020864469,0.003688152,0.00024672854,0.00016394448,0.000036264548,0.00087975786,0.00012784492,0.011493487,0.9814403,0.0012289783,0.0004579439],"study_design_scores_gemma":[0.0035314134,0.000641037,0.042129856,0.0012577054,0.00033198527,0.000080147984,0.0017141962,0.0013401669,0.080909304,0.8558071,0.010930784,0.0013262776],"about_ca_topic_score_codex":0.00003843115,"about_ca_topic_score_gemma":0.0000048712113,"teacher_disagreement_score":0.12563315,"about_ca_system_score_codex":0.00007112113,"about_ca_system_score_gemma":0.000024241326,"threshold_uncertainty_score":0.999966},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77157825,0.00018947946,0.02131042,0.0016365272,0.0005853543,0.0019383921,0.000033702527,0.0002249127,0.20250295],"genre_scores_gemma":[0.962081,0.00001607574,0.03534046,0.000048505855,0.000011142591,0.00017964313,0.0000037783063,0.000022235781,0.0022971702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912786,0.000032174677,0.0002775301,0.00015365334,0.0002539265,0.00015482359],"domain_scores_gemma":[0.99877626,0.00022728529,0.00011526268,0.00069862074,0.00011951068,0.000063047395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030911097,0.00009636322,0.00018803682,0.00014149483,0.0002299278,0.000010048944,0.00032494403,0.000047805166,0.000018023324],"category_scores_gemma":[0.00029695462,0.000069877686,0.000078489065,0.0013075392,0.00005129961,0.000026637528,0.00007733282,0.00010469635,0.000044925157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013705796,0.00036041488,0.00002887947,0.000031698208,0.000021056949,2.7509915e-7,0.00066459744,0.000005096073,0.0001350838,0.8631151,0.13557687,0.00005957394],"study_design_scores_gemma":[0.0002305441,0.00004410899,0.00023862388,0.000012158939,0.000031486623,0.000027685595,0.00016410404,0.00011392112,0.0015214592,0.9615152,0.03598564,0.00011509268],"about_ca_topic_score_codex":0.000013474198,"about_ca_topic_score_gemma":0.0000013264812,"teacher_disagreement_score":0.20020579,"about_ca_system_score_codex":0.000025727753,"about_ca_system_score_gemma":0.000026946775,"threshold_uncertainty_score":0.28495294},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98066956,0.00039723946,0.0000014194154,0.0000033103079,0.00023620184,0.000049060334,0.0000010301895,0.00006437108,0.018577816],"genre_scores_gemma":[0.9996312,0.000047916034,0.000042883847,0.0000045396346,0.0000021987678,0.0000030228405,8.7407903e-7,0.000011024823,0.0002563103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968606,0.000011990687,0.00008322959,0.00006718561,0.000061423074,0.000090126996],"domain_scores_gemma":[0.99978364,0.000017821725,0.000010072674,0.00013254926,0.000021860886,0.000034053504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005414097,0.00006496349,0.0001018533,0.000018397322,0.00001876688,0.000006348828,0.000060515755,0.000030255916,0.000072647046],"category_scores_gemma":[0.000002833773,0.000055447308,0.000009184231,0.00016692086,0.00003934316,0.00005324552,0.0000039418414,0.00004728556,0.000018529034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009642344,0.000054007203,0.012123917,0.00022143725,0.0001059987,0.000017546954,0.0011112426,0.00043358558,0.0038004236,0.9745334,0.00065084395,0.00685119],"study_design_scores_gemma":[0.004468817,0.00159821,0.057785362,0.0006873498,0.00011601151,0.00018019702,0.0006827251,0.0038383906,0.03854066,0.86748123,0.02324067,0.00138035],"about_ca_topic_score_codex":0.0000071199256,"about_ca_topic_score_gemma":0.0000012679561,"teacher_disagreement_score":0.10705213,"about_ca_system_score_codex":0.0000043924956,"about_ca_system_score_gemma":0.00000394005,"threshold_uncertainty_score":0.22610755},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920548,0.0011871757,0.000008188379,0.0023570077,0.00072976487,0.00016995797,0.0000014613362,0.000037365786,0.0034542475],"genre_scores_gemma":[0.9989713,0.00008870589,0.0006921717,0.00006261097,0.0000011591288,0.000007693153,9.72147e-8,0.000005261495,0.00017100447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903303,0.00011662429,0.00022570633,0.00021312667,0.00025491373,0.00015660985],"domain_scores_gemma":[0.99874526,0.00016132559,0.0001479649,0.00078811916,0.00012201332,0.00003529269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006020209,0.0000909906,0.0001401588,0.000024686147,0.00016820969,0.000033551467,0.00060092023,0.000026247257,0.0000020075718],"category_scores_gemma":[0.00009032682,0.000047787402,0.00007766747,0.0004689998,0.00017784028,0.000102722894,0.00024647993,0.00008671292,0.0000032948362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000366096,0.00008032388,0.009182726,0.000009470003,0.00002373502,2.2849643e-7,0.00051291223,0.0000064464234,0.0009466378,0.98201317,0.0012624917,0.0059582037],"study_design_scores_gemma":[0.00041080161,0.000037091755,0.0071417624,0.00004666133,0.000015415519,0.000008853382,0.000018794144,0.00067949266,0.023859866,0.96615547,0.0015270818,0.00009869124],"about_ca_topic_score_codex":0.000050166316,"about_ca_topic_score_gemma":0.0000049400905,"teacher_disagreement_score":0.022913229,"about_ca_system_score_codex":0.000004968256,"about_ca_system_score_gemma":0.000035770347,"threshold_uncertainty_score":0.19487137},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9879811,0.0016897218,0.0014007495,0.00030206228,0.0009191312,0.00024819066,0.0000017761918,0.00011363542,0.0073436718],"genre_scores_gemma":[0.9985308,0.00010794592,0.001110002,0.000040166986,0.0000023209784,0.000015222164,3.533359e-7,0.000008182737,0.00018500318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986004,0.00013916337,0.00025603408,0.00027555655,0.000359,0.00036981842],"domain_scores_gemma":[0.99891895,0.00027318313,0.00007509206,0.0005611659,0.00009268932,0.00007891612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028934356,0.00011387512,0.00020287554,0.00037172018,0.00005402439,0.00003991667,0.0010359441,0.000049872513,0.00005592821],"category_scores_gemma":[0.00013936883,0.00011269929,0.00006137786,0.0014204561,0.00013569556,0.00052015006,0.00024270947,0.00016901139,0.000040903917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083253335,0.00018376531,0.005155701,0.000018682853,0.000009761733,0.0000227706,0.0009606995,0.000029670713,0.00034494925,0.98906314,0.0004294642,0.0037730439],"study_design_scores_gemma":[0.0009369107,0.00013355442,0.0025940393,0.00003182773,0.0000020982563,0.0000033552008,0.00007646082,0.0062903916,0.0067544333,0.98265004,0.00037606477,0.00015081525],"about_ca_topic_score_codex":0.000020770738,"about_ca_topic_score_gemma":0.0000050698536,"teacher_disagreement_score":0.010549742,"about_ca_system_score_codex":0.00003555326,"about_ca_system_score_gemma":0.000017048373,"threshold_uncertainty_score":0.45957434},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9861285,0.00006210113,0.006189317,0.0011810967,0.0005232587,0.00019116959,9.362422e-7,0.00007527932,0.005648346],"genre_scores_gemma":[0.9990495,0.000023105711,0.000510335,0.00020455483,0.0000033234367,0.000018607418,3.3698848e-7,0.000008350847,0.00018187924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986895,0.00027700383,0.00014746682,0.0002569643,0.0003633658,0.00026574437],"domain_scores_gemma":[0.9979407,0.00089788524,0.00007660352,0.00092046865,0.00010180089,0.0000625316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006711922,0.00010441713,0.00015421088,0.00007799974,0.00013586425,0.000035526376,0.0011176596,0.000039332022,0.000041363524],"category_scores_gemma":[0.0002890335,0.00007352374,0.00007301067,0.0006398194,0.00013893278,0.0001852254,0.00024052818,0.00017992248,0.000048047725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023557232,0.000093830975,0.0008773014,0.0000019491524,0.000012095565,0.000009408092,0.000094283016,0.000035564048,0.0011226463,0.9951157,0.00055893674,0.0020547237],"study_design_scores_gemma":[0.0004940017,0.00011279447,0.0026552652,0.000008509049,0.0000013704683,0.0000052568757,0.000009002015,0.001900132,0.008711034,0.98537886,0.00063708343,0.00008667481],"about_ca_topic_score_codex":0.000019207773,"about_ca_topic_score_gemma":0.000002572544,"teacher_disagreement_score":0.012921011,"about_ca_system_score_codex":0.000032691914,"about_ca_system_score_gemma":0.000036786136,"threshold_uncertainty_score":0.2998211},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9934412,0.00004112368,0.000049347258,0.0024755995,0.0006920027,0.00010375009,0.0000010573278,0.000029240027,0.0031666416],"genre_scores_gemma":[0.9989289,0.000004182797,0.0005825129,0.0004353612,5.6905543e-7,0.000003889611,3.5059688e-7,0.000004002027,0.00004023343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916774,0.000098521996,0.00020120376,0.00013505721,0.0002847246,0.000112741414],"domain_scores_gemma":[0.99893457,0.00017067377,0.00014157839,0.0006259027,0.00010297741,0.000024301418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002974131,0.000074417316,0.00010316756,0.000029333412,0.00010312725,0.00001614259,0.000659821,0.00003554193,0.000014440581],"category_scores_gemma":[0.000021342234,0.00004152741,0.00009054046,0.00039897204,0.000100624915,0.00007656327,0.00012360091,0.00010688342,0.000025880694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027774317,0.000116488955,0.0009409343,0.0000034536743,0.000009216831,1.3303635e-7,0.00017882565,0.000066247565,0.0023678194,0.99353796,0.0024540124,0.00032213362],"study_design_scores_gemma":[0.0002783252,0.000037823644,0.0019247343,0.00004147674,0.0000052719984,0.0000027307078,0.0000055071487,0.0012879747,0.037603185,0.95863205,0.00012786164,0.000053042924],"about_ca_topic_score_codex":0.000020876238,"about_ca_topic_score_gemma":9.0067556e-7,"teacher_disagreement_score":0.035235364,"about_ca_system_score_codex":0.000008313887,"about_ca_system_score_gemma":0.000019382416,"threshold_uncertainty_score":0.16934386},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95815045,0.00044195572,0.000021321172,0.000050687704,0.00162842,0.00018437853,0.0000046146565,0.00012519679,0.03939297],"genre_scores_gemma":[0.9993458,0.00007391052,0.00001227438,0.0000350085,0.000009424921,0.00002616572,8.251157e-7,0.000023794817,0.00047280514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990565,0.000051955474,0.00025397353,0.0001548338,0.00023935681,0.00024336546],"domain_scores_gemma":[0.9990877,0.0002458337,0.000062589104,0.00050835003,0.00003825287,0.000057302903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020431417,0.00017354771,0.00021518856,0.000067063855,0.00008245381,0.000024874405,0.00043416335,0.00008232406,0.00017768546],"category_scores_gemma":[0.000035470926,0.00012929499,0.000088724424,0.00035392563,0.000071937866,0.00005845245,0.00002935641,0.0002060382,0.0002249094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060083185,0.000067743335,0.0005981321,0.000090348636,0.000041774576,0.0000068240456,0.0006453926,0.00016314992,0.002308841,0.9911845,0.0042554904,0.00063182914],"study_design_scores_gemma":[0.0013526522,0.00039650418,0.009437024,0.0004796896,0.00006050639,0.000021803822,0.0004847295,0.028136568,0.025319668,0.93132097,0.0021648158,0.0008250873],"about_ca_topic_score_codex":0.000008712638,"about_ca_topic_score_gemma":9.347593e-7,"teacher_disagreement_score":0.059863515,"about_ca_system_score_codex":0.000025310557,"about_ca_system_score_gemma":0.000003543904,"threshold_uncertainty_score":0.5272497},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9935737,0.00047442951,0.0016959886,0.00019353036,0.00015264396,0.0001914666,0.0000012641134,0.00034967175,0.003367299],"genre_scores_gemma":[0.99330854,0.00012948405,0.0064842342,0.000010028322,0.0000014944496,0.000021261563,8.655764e-7,0.00001919222,0.000024909235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993071,0.0000106463085,0.00025689113,0.00010349024,0.00013083132,0.00019102241],"domain_scores_gemma":[0.9996496,0.000052831987,0.000040880528,0.00019642935,0.000028812932,0.00003148474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013085367,0.000101550664,0.00017176311,0.00004829982,0.000030062127,0.000011633383,0.00021940345,0.00004671914,0.0000031621648],"category_scores_gemma":[0.000014080857,0.000078592246,0.000049245653,0.00039130126,0.000052585412,0.00009959676,0.000036954858,0.0001470166,0.0000092417895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019558422,0.00021035048,0.0058311676,0.00011145267,0.00011769332,0.000024107854,0.00092098996,0.08031761,0.02247055,0.86874163,0.00079343707,0.020441484],"study_design_scores_gemma":[0.0004332454,0.000045816963,0.0008258383,0.000048442904,0.0000079372985,0.000001442846,0.000038668382,0.0009384789,0.05855355,0.9359277,0.0030245367,0.00015434764],"about_ca_topic_score_codex":0.000042120584,"about_ca_topic_score_gemma":0.000016521872,"teacher_disagreement_score":0.07937913,"about_ca_system_score_codex":0.00009904706,"about_ca_system_score_gemma":0.000007860095,"threshold_uncertainty_score":0.32048985},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99177885,0.00006386894,0.0011380331,0.00027332775,0.00032385386,0.00014251813,0.0000056501203,0.000015122712,0.006258799],"genre_scores_gemma":[0.9990524,0.000008471949,0.0005741868,0.00005251859,0.000004918818,0.00000827344,0.0000034939742,0.0000049661708,0.00029073682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985031,0.00007090555,0.00045044348,0.00021884435,0.00062338624,0.0001333556],"domain_scores_gemma":[0.99827373,0.0008556465,0.00023392128,0.0002675197,0.0002856535,0.00008352587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002752644,0.00007708922,0.00014403442,0.00020629347,0.000119021075,0.000047547368,0.000270762,0.000048464306,0.00013694119],"category_scores_gemma":[0.00060013053,0.000065265966,0.000048291677,0.00055899227,0.00014977963,0.00021756336,0.00005333965,0.00007620261,0.00003354673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027286707,0.00010385629,0.0056926585,0.0000013448274,0.00000774285,8.316751e-7,0.0002726998,0.0000032755827,0.0025457577,0.9574472,0.0003570166,0.03354037],"study_design_scores_gemma":[0.00046197543,0.00003387671,0.19921859,0.0000051602087,0.0000055643613,0.0000031918696,0.00034490813,0.000046301422,0.0037777962,0.795421,0.0006264534,0.000055208657],"about_ca_topic_score_codex":0.0000059131003,"about_ca_topic_score_gemma":0.0000046199634,"teacher_disagreement_score":0.19352593,"about_ca_system_score_codex":0.000018110304,"about_ca_system_score_gemma":0.000022230084,"threshold_uncertainty_score":0.26614687},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92894804,0.003296056,0.0000049499954,0.00008749294,0.0067937705,0.0003509594,0.000042542466,0.0004899331,0.05998627],"genre_scores_gemma":[0.9968078,0.00029258186,0.000037786976,0.000088176435,0.00004160596,0.000034818342,0.00002338347,0.00011512439,0.0025587338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973029,0.00024967725,0.0006746006,0.0004995336,0.00037473507,0.0008985822],"domain_scores_gemma":[0.9985174,0.0001598824,0.00008630129,0.0008672097,0.00005937036,0.0003098277],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00050741766,0.0005180096,0.0006015506,0.00017875995,0.00035437365,0.00019202918,0.00054773974,0.0002755317,0.0034698946],"category_scores_gemma":[0.000021493217,0.0005969203,0.00033623443,0.0007352831,0.000140864,0.00032021027,0.00004765135,0.0005255566,0.004021727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047362653,0.00015125182,0.003019557,0.00027201226,0.00032709623,0.00009126234,0.001405276,0.0011922388,0.0029344151,0.9797814,0.006053998,0.0047241542],"study_design_scores_gemma":[0.002848917,0.00026266853,0.010581181,0.0007821697,0.00021684801,0.00008112277,0.00032264352,0.008335842,0.0013632,0.82408625,0.14942794,0.0016912208],"about_ca_topic_score_codex":0.00009727814,"about_ca_topic_score_gemma":0.000008911877,"teacher_disagreement_score":0.15569513,"about_ca_system_score_codex":0.00008262042,"about_ca_system_score_gemma":0.000024082867,"threshold_uncertainty_score":0.9996482},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9899381,0.0037919807,0.000006796619,0.0000065273734,0.0022107845,0.00019293689,0.000008879726,0.00009969779,0.003744329],"genre_scores_gemma":[0.99950856,0.00028506285,0.000008319981,0.0000030316173,0.000011948416,0.000014399816,0.0000034515574,0.000023803535,0.00014141844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905705,0.00006711394,0.00039883796,0.0001252212,0.00016305022,0.00018872281],"domain_scores_gemma":[0.99940306,0.00009801113,0.00009462015,0.0002878908,0.000044963574,0.000071434966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002488953,0.00014703594,0.00041495293,0.0000980053,0.000033306245,0.000013277141,0.00015037341,0.00010582612,0.000009375512],"category_scores_gemma":[0.000014396535,0.00014734741,0.00006453362,0.0002240387,0.00007280525,0.00013083368,0.000024332927,0.00010293404,0.0000029305022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004840198,0.00016320428,0.012181441,0.00061079673,0.00021230371,0.000016608763,0.0005994405,0.00063821394,0.009397473,0.9741642,0.00159485,0.00037306547],"study_design_scores_gemma":[0.008755886,0.0008835978,0.018912459,0.0012576337,0.00032327673,0.00025324372,0.004492532,0.016964113,0.06185025,0.8736975,0.011062161,0.0015473135],"about_ca_topic_score_codex":0.00010382524,"about_ca_topic_score_gemma":0.000006501787,"teacher_disagreement_score":0.10046667,"about_ca_system_score_codex":0.000020472973,"about_ca_system_score_gemma":0.00000866778,"threshold_uncertainty_score":0.6008653},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9461014,0.00003111074,0.00005914566,0.000052908144,0.0011147257,0.00024041772,0.0000034347202,0.00018106494,0.05221575],"genre_scores_gemma":[0.998071,0.000004748411,0.000574577,0.00011365964,0.0000099866875,0.000009657765,0.0000033809465,0.00005224589,0.0011607149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982708,0.00009437633,0.0002814175,0.00027451103,0.00053110044,0.0005478088],"domain_scores_gemma":[0.99677783,0.0022592067,0.00006873782,0.0006180115,0.00010199258,0.00017423098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015978044,0.00017759672,0.00021066263,0.00021390585,0.0001348892,0.000032730455,0.00038582104,0.00012578306,0.00024442445],"category_scores_gemma":[0.0009922099,0.0001658242,0.00010497601,0.0004267093,0.000099036515,0.000053076197,0.000067606656,0.00032962507,0.0005024862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010538604,0.00029893185,0.00056874915,0.000023101804,0.000029847182,0.00012524807,0.00020345765,3.6294435e-7,0.00092044356,0.9911725,0.0053129266,0.0012390295],"study_design_scores_gemma":[0.0007091652,0.00025237392,0.00066753104,0.000022194463,0.000009465476,0.000020524632,0.000058782294,0.000008104546,0.0087158065,0.9887158,0.00063704886,0.00018317738],"about_ca_topic_score_codex":0.0000068792615,"about_ca_topic_score_gemma":0.0000073711267,"teacher_disagreement_score":0.051969588,"about_ca_system_score_codex":0.000082220875,"about_ca_system_score_gemma":0.000027438526,"threshold_uncertainty_score":0.6762115},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99060684,0.0024005973,0.0005606044,0.0011730959,0.0013207925,0.00015927182,0.0000023451066,0.00024459875,0.003531858],"genre_scores_gemma":[0.9931573,0.00024134653,0.0061051585,0.00025649782,8.949982e-7,0.000005911972,8.787028e-7,0.000012317208,0.00021966815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986611,0.00005318562,0.0003071146,0.00038904918,0.00029625013,0.00029332386],"domain_scores_gemma":[0.99893767,0.00009457798,0.00013364975,0.0005539647,0.00014004025,0.00014012463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028470717,0.0001652835,0.00023751272,0.0001559149,0.00012625262,0.00006818914,0.000464334,0.00008798654,0.000026268306],"category_scores_gemma":[0.000027250524,0.00015464015,0.0000670479,0.0005802007,0.00012014582,0.0002482978,0.00016666802,0.00015276499,0.00004011891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013847475,0.00012337626,0.0016354385,0.000018670486,0.000020794863,0.0000059425133,0.0006290194,0.0000093087365,0.0016429374,0.9891148,0.004594564,0.0022037583],"study_design_scores_gemma":[0.00084449875,0.00014643365,0.00037797357,0.0000433576,0.000011788689,0.000011634187,0.00001863985,0.0070867743,0.005761794,0.9842231,0.0012579574,0.00021603514],"about_ca_topic_score_codex":0.00003087369,"about_ca_topic_score_gemma":0.0000010860073,"teacher_disagreement_score":0.0070774653,"about_ca_system_score_codex":0.000006880373,"about_ca_system_score_gemma":0.000010715148,"threshold_uncertainty_score":0.63060427},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97776383,0.00017013402,0.014309478,0.00013520134,0.0032524406,0.0002643244,0.0000027066344,0.00012212766,0.0039797355],"genre_scores_gemma":[0.9860095,0.000009536691,0.0138974935,0.000025960218,0.000004125093,0.0000068293293,0.0000017340957,0.000010356634,0.000034505454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982206,0.00017120526,0.00046784276,0.00040421414,0.0004423969,0.0002937166],"domain_scores_gemma":[0.998326,0.0001772785,0.00024411517,0.00089407706,0.0002515801,0.00010696334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066550385,0.00017108217,0.00033104903,0.00012737993,0.00005471788,0.00002737771,0.0008097926,0.000100830606,0.000030610558],"category_scores_gemma":[0.00017661047,0.0001758316,0.00011761215,0.0008453646,0.00012468331,0.00030487464,0.00018200779,0.00013685312,0.000023470666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003849022,0.00032941232,0.012930358,0.000043288714,0.00001951908,0.0000052175114,0.00045253398,0.00006724073,0.0009153274,0.981843,0.00033621216,0.0030540305],"study_design_scores_gemma":[0.0012408004,0.00030304334,0.02976414,0.00003945021,0.0000161473,0.000019462834,0.00006479266,0.004429075,0.027702788,0.9355105,0.00058485207,0.00032492026],"about_ca_topic_score_codex":0.000090443944,"about_ca_topic_score_gemma":0.000006248615,"teacher_disagreement_score":0.046332482,"about_ca_system_score_codex":0.0000719331,"about_ca_system_score_gemma":0.00009751712,"threshold_uncertainty_score":0.7170205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025435062,0.0019960597,0.9174635,0.0087089185,0.03317845,0.0031182664,0.00000823755,0.0014113843,0.008680122],"genre_scores_gemma":[0.93125004,0.000011569422,0.06548152,0.00013906589,0.000120809535,0.00032609387,0.0000042734573,0.00002544822,0.0026411866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881613,0.00008741302,0.00027563996,0.00028220777,0.00021124334,0.00032735147],"domain_scores_gemma":[0.9988047,0.00036613282,0.00013735282,0.0005022144,0.00011847586,0.00007115977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083023706,0.000122014164,0.00015156475,0.000055638982,0.00034798568,0.0003222169,0.0007938874,0.00006182544,5.123931e-7],"category_scores_gemma":[0.00009962815,0.000091213806,0.00007338062,0.0002423377,0.00002890426,0.0003533828,0.000106521875,0.00011879953,0.00006610384],"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.000011737177,0.000056856614,0.00008626483,0.00001585653,0.00003290463,0.0000025596696,0.00058429094,0.0016799278,0.0000816154,0.9520639,0.019318003,0.026066069],"study_design_scores_gemma":[0.0022328012,0.00040023305,0.0003929533,0.000092928865,0.00001754851,0.000054779986,0.00011854064,0.7477433,0.00061466685,0.12491477,0.123056784,0.00036067615],"about_ca_topic_score_codex":0.000019670993,"about_ca_topic_score_gemma":0.000001645256,"teacher_disagreement_score":0.90581495,"about_ca_system_score_codex":0.000136342,"about_ca_system_score_gemma":0.00005684409,"threshold_uncertainty_score":0.3719591},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98888874,0.0004741012,0.0055711763,0.00042107346,0.0006836083,0.00018974868,0.000002528941,0.00006220737,0.0037068275],"genre_scores_gemma":[0.99761796,0.000049946917,0.0022057313,0.000010941272,0.0000025289444,0.0000048193347,4.277686e-7,0.0000058613314,0.00010178073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877006,0.00015806576,0.00025013735,0.00017327264,0.0004195645,0.00022889233],"domain_scores_gemma":[0.9983949,0.0004803971,0.00014039122,0.0007463827,0.00019022137,0.000047717094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005150542,0.00008237936,0.00018093614,0.000064995875,0.00027532605,0.00001461054,0.0013759162,0.000028436356,0.0000046423183],"category_scores_gemma":[0.00015305546,0.00006154423,0.00008014681,0.000557829,0.0011687486,0.00019134738,0.00033634796,0.00013108306,0.0000041226667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016366337,0.00005643848,0.0037343716,0.0000063563807,0.0000131886045,0.0000044299554,0.00037169072,0.000008683258,0.0015521764,0.9928128,0.00015608715,0.0012673797],"study_design_scores_gemma":[0.00041972744,0.00009191568,0.013378213,0.000012848629,0.0000013984868,0.000008172758,0.000023269733,0.0011276782,0.01839701,0.96607786,0.0003957778,0.00006613477],"about_ca_topic_score_codex":0.000033003715,"about_ca_topic_score_gemma":0.000015491407,"teacher_disagreement_score":0.026734978,"about_ca_system_score_codex":0.00001769731,"about_ca_system_score_gemma":0.000057478697,"threshold_uncertainty_score":0.43063027},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97207683,0.000042551248,0.000641422,0.00013431012,0.0005410464,0.0002830002,0.000004549552,0.00018121791,0.02609506],"genre_scores_gemma":[0.9930198,0.000029768627,0.0054284595,0.00003955579,0.0000065618015,0.00002119611,0.0000016103379,0.00003408473,0.0014189283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985118,0.00008000429,0.00046323615,0.00023331463,0.00040377054,0.00030790997],"domain_scores_gemma":[0.9949667,0.003990059,0.00023856286,0.0005688462,0.00014171554,0.000094131894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002565291,0.00020115738,0.0004344896,0.00006217286,0.00007594525,0.00001565456,0.0003292591,0.00010643279,0.00020990046],"category_scores_gemma":[0.004427721,0.00017053288,0.00009204017,0.00045351533,0.00019732445,0.00012927783,0.0000688859,0.00018194134,0.00004618458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007987998,0.00028924548,0.00011434788,0.000055377506,0.000028370145,0.000022316943,0.00020987696,0.000002567462,0.0008248375,0.9968021,0.0014444444,0.00012666658],"study_design_scores_gemma":[0.0008348913,0.00019964304,0.00011693575,0.00010704884,0.000025700747,0.000008273588,0.00009656431,0.000016172506,0.007292829,0.99087083,0.00025608193,0.00017501859],"about_ca_topic_score_codex":0.000008122587,"about_ca_topic_score_gemma":0.0000019754846,"teacher_disagreement_score":0.024676133,"about_ca_system_score_codex":0.000054812146,"about_ca_system_score_gemma":0.00003550159,"threshold_uncertainty_score":0.69541293},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95553106,0.00077862927,0.020510938,0.0063523925,0.0057989215,0.00020508525,5.003279e-7,0.0020382728,0.00878417],"genre_scores_gemma":[0.98996526,0.000014531925,0.008763921,0.0003955185,0.000021670709,0.00000627386,0.0000017343734,0.000014421099,0.00081666873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99873644,0.00012084408,0.00015894132,0.00035815043,0.00024311128,0.00038253114],"domain_scores_gemma":[0.9990538,0.000097303455,0.00010045406,0.00057262025,0.0000478552,0.00012799649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000381438,0.00014293312,0.0001523547,0.000079385056,0.00017366519,0.00025319873,0.00086920714,0.00006808152,0.000012443648],"category_scores_gemma":[0.00010249018,0.00013914303,0.00006972557,0.000290007,0.000033997305,0.00030885715,0.0002081256,0.00032256558,0.00032491513],"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.000005487544,0.00022599501,0.05628581,0.000010783207,0.0000337115,0.00016607178,0.0017767728,0.000059928956,0.000043468197,0.70760226,0.008362366,0.22542734],"study_design_scores_gemma":[0.00073243846,0.00010228738,0.044398338,0.00005174787,0.000010168983,0.00007413521,0.00011277974,0.0022440366,0.00009232636,0.10907096,0.84268796,0.0004227942],"about_ca_topic_score_codex":0.000080101345,"about_ca_topic_score_gemma":0.0000037261473,"teacher_disagreement_score":0.8343256,"about_ca_system_score_codex":0.000039724164,"about_ca_system_score_gemma":0.000023643493,"threshold_uncertainty_score":0.5674088},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99576586,0.00007756505,0.0015174099,0.00015394301,0.0011847632,0.00015432463,0.0000039687307,0.00006749362,0.0010746665],"genre_scores_gemma":[0.985619,0.0000033587573,0.014261875,0.00006261945,5.9049444e-7,0.0000029340745,0.000002949198,0.0000068291106,0.00003985853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998754,0.0000359656,0.00037679987,0.00027705473,0.00034200007,0.00021416128],"domain_scores_gemma":[0.99867326,0.00017573801,0.00019334759,0.0005759336,0.0003068134,0.00007493111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053455494,0.000105894746,0.00019405296,0.000232194,0.00007432511,0.000012904397,0.00043119126,0.00003327659,0.0000056911],"category_scores_gemma":[0.0000954619,0.00009608793,0.00007670727,0.0008095052,0.00011461512,0.00011565736,0.000084235515,0.00009647159,0.000011761693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013480282,0.00022667581,0.0014491394,0.000013838574,0.000016691827,0.0000036351032,0.0003035451,0.00014576621,0.0073139663,0.98935854,0.00062327855,0.00053144735],"study_design_scores_gemma":[0.00087963924,0.00044734436,0.008047962,0.00004493638,0.000010685769,0.000005683476,0.000031557025,0.0007368592,0.051010966,0.9385137,0.00012304062,0.00014764952],"about_ca_topic_score_codex":0.00003580767,"about_ca_topic_score_gemma":0.0000012102803,"teacher_disagreement_score":0.050844856,"about_ca_system_score_codex":0.000009621508,"about_ca_system_score_gemma":0.000036181773,"threshold_uncertainty_score":0.3918352},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8640985,0.00028328632,0.12958556,0.0013950239,0.0013494992,0.00034132504,0.00006771067,0.00028897403,0.002590146],"genre_scores_gemma":[0.97281766,0.0000046831824,0.026717499,0.0000793642,0.000007810884,0.00002651536,0.00003643233,0.00001210278,0.00029792485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988264,0.00003835411,0.00029843114,0.00033415243,0.00025452414,0.00024812948],"domain_scores_gemma":[0.99890435,0.00013207983,0.00015250135,0.00067618594,0.00006700492,0.00006789164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017977165,0.00013751164,0.00019386523,0.00006870576,0.00009520871,0.000092045084,0.0008186375,0.000046479232,0.000005701449],"category_scores_gemma":[0.000017629247,0.0001355669,0.00006744571,0.00035014396,0.000057621564,0.00029347008,0.00022253013,0.00008945189,0.000024269264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004436433,0.00060898246,0.004145891,0.000021451855,0.00004137984,0.00001150923,0.00024556206,0.000058895057,0.014672869,0.87680966,0.06400097,0.039378412],"study_design_scores_gemma":[0.005161593,0.0005111467,0.07355709,0.00016157197,0.00007520689,0.000034415905,0.00014118891,0.21309817,0.04073729,0.5964138,0.06840475,0.0017038045],"about_ca_topic_score_codex":0.00035523402,"about_ca_topic_score_gemma":0.000006304011,"teacher_disagreement_score":0.28039587,"about_ca_system_score_codex":0.00004070715,"about_ca_system_score_gemma":0.000025383995,"threshold_uncertainty_score":0.55282575},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97446275,0.00012804448,0.00007969924,0.000037681148,0.0012215276,0.00013664256,0.0000012066995,0.00008803468,0.023844402],"genre_scores_gemma":[0.9972914,0.000012504218,0.0022064475,0.000032645432,0.000023741764,0.0000037910777,9.2437324e-7,0.000028761146,0.00039979673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988117,0.000021092716,0.00039417198,0.0001868401,0.00027922855,0.0003069374],"domain_scores_gemma":[0.9988001,0.00046258981,0.00019166888,0.0003590464,0.000096381955,0.00009021847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000797048,0.00013578736,0.00027476376,0.000088388595,0.00006645451,0.000014437566,0.0002420146,0.00009168336,0.00004782912],"category_scores_gemma":[0.0003060131,0.000133796,0.0000826567,0.00019874261,0.00006669762,0.00011280174,0.00007579291,0.00011761091,0.000023655473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014886281,0.00014607969,0.005569604,0.00009332707,0.000034763696,0.000011528295,0.00047888953,3.1022995e-7,0.002391814,0.988882,0.0019184311,0.00045836932],"study_design_scores_gemma":[0.0005979978,0.00006210631,0.004699764,0.00006607863,0.0000316187,0.0000040015834,0.00016874065,0.000014038329,0.045616433,0.9471807,0.0014022851,0.00015627485],"about_ca_topic_score_codex":0.000022107153,"about_ca_topic_score_gemma":0.000015684187,"teacher_disagreement_score":0.043224618,"about_ca_system_score_codex":0.00004784031,"about_ca_system_score_gemma":0.000026687076,"threshold_uncertainty_score":0.5456042},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9534427,0.00046066896,0.033817977,0.0022584768,0.0017898717,0.00020532962,0.0000022385807,0.00037694242,0.0076458096],"genre_scores_gemma":[0.9948819,0.000080623555,0.004164869,0.0006944509,0.000009732704,0.0000047177527,0.00000277711,0.000008238298,0.00015267135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903035,0.000052101215,0.00015148676,0.00032518315,0.00015683843,0.00028405632],"domain_scores_gemma":[0.9992312,0.00014118654,0.000058702168,0.00038261505,0.000053207317,0.00013304099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007696003,0.0001483701,0.00015731019,0.00006512411,0.00018383407,0.0001057775,0.00039839942,0.00007472872,0.000025126448],"category_scores_gemma":[0.000034033754,0.00013161644,0.00003374532,0.0003407851,0.00013662365,0.0003441782,0.0001617855,0.00015244237,0.0000132016785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026361581,0.000025200878,0.0009443715,0.000002005473,0.00001018197,0.000026129253,0.00006836312,0.00003300609,0.00032388826,0.99320656,0.00024581893,0.005111829],"study_design_scores_gemma":[0.0007483745,0.000071272516,0.015675995,0.000005402274,0.0000039164943,0.00006606163,0.00005537406,0.001004391,0.0001946021,0.97819155,0.0038063133,0.00017672921],"about_ca_topic_score_codex":0.000008393344,"about_ca_topic_score_gemma":0.000004752654,"teacher_disagreement_score":0.04143923,"about_ca_system_score_codex":0.000025025707,"about_ca_system_score_gemma":0.000058519887,"threshold_uncertainty_score":0.5367163},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9691614,0.0004980127,0.0042125485,0.000401508,0.0024643864,0.00013781215,1.2126684e-7,0.0002539989,0.02287021],"genre_scores_gemma":[0.9967543,0.00001131913,0.002860123,0.00018860244,0.000008727725,0.000005186813,7.235737e-7,0.000008181392,0.00016283394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99867237,0.000051842602,0.0002510322,0.00034592315,0.00023061367,0.00044820787],"domain_scores_gemma":[0.9990669,0.00028281478,0.00006287726,0.00047688562,0.00003315169,0.00007737451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009535266,0.00014240813,0.00019851822,0.00020988051,0.00008527669,0.00007734503,0.00074766146,0.000100505575,0.000010368836],"category_scores_gemma":[0.00009372188,0.00013378945,0.000057722544,0.0004784747,0.000047531936,0.00036597997,0.00023515853,0.00021332919,0.000054958764],"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.00001826839,0.00018682801,0.14895338,0.0000115828825,0.000014071878,0.0005670237,0.0010499263,0.000019100973,0.0018902185,0.8208037,0.002470596,0.024015285],"study_design_scores_gemma":[0.001583848,0.00030489016,0.75630486,0.000072628965,0.0000060748444,0.000034789024,0.00024048692,0.0060750567,0.006134861,0.22682421,0.0019545667,0.00046371281],"about_ca_topic_score_codex":0.000107454885,"about_ca_topic_score_gemma":0.000064574655,"teacher_disagreement_score":0.6073515,"about_ca_system_score_codex":0.00009213193,"about_ca_system_score_gemma":0.000054573615,"threshold_uncertainty_score":0.5455776},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98059,0.0015148617,0.000079151214,0.000009296161,0.005144828,0.0001973003,0.000007996612,0.00029104017,0.012165524],"genre_scores_gemma":[0.99977565,0.000022130254,0.00001890825,0.0000057035504,0.000017978507,0.000024660878,0.0000041683684,0.000037972204,0.000092807895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990439,0.000038960527,0.00032552503,0.00014585571,0.00018777572,0.00025802714],"domain_scores_gemma":[0.99939334,0.000038788694,0.00005413195,0.00037962748,0.000045329893,0.00008874859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022299269,0.00016371817,0.00028583783,0.00008814607,0.000049288763,0.000024014213,0.00022836616,0.000113328846,0.000016141046],"category_scores_gemma":[0.000014452137,0.00016750945,0.00009048958,0.0002669555,0.00004262556,0.00011883659,0.000023052093,0.00013219682,0.000117506024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000666496,0.00006058167,0.0006297128,0.00024094098,0.000075432006,0.0000115245175,0.00038665347,0.016405255,0.0053846044,0.9762119,0.0004997134,0.00008703013],"study_design_scores_gemma":[0.0053257807,0.00034539244,0.0033639127,0.0008391213,0.00009979503,0.00008191122,0.001176679,0.0031021463,0.055421256,0.91958606,0.009483436,0.0011745245],"about_ca_topic_score_codex":0.000095830954,"about_ca_topic_score_gemma":0.0000034658474,"teacher_disagreement_score":0.056625843,"about_ca_system_score_codex":0.000061785395,"about_ca_system_score_gemma":0.000016145734,"threshold_uncertainty_score":0.6830838},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.986498,0.00007094111,0.0018179234,0.0088963825,0.0017357656,0.00040313386,0.0000048065444,0.00025201179,0.00032102395],"genre_scores_gemma":[0.9764498,0.000013057811,0.020606687,0.0020198491,0.0000059504687,0.000056940902,0.000002161348,0.000023365039,0.0008222218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979389,0.00007737027,0.00025876288,0.0006277645,0.00056452537,0.0005327351],"domain_scores_gemma":[0.9982488,0.000050732946,0.00008868493,0.0009104837,0.00019820716,0.00050310313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029022509,0.00024446662,0.0002764472,0.00012091961,0.00030331023,0.00022550259,0.00071681413,0.000087062916,0.000009797196],"category_scores_gemma":[0.00010589517,0.00023742094,0.000106841435,0.00074611,0.00003289522,0.00035438457,0.0005230426,0.0001899592,0.00016877064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040722913,0.00048933364,0.005036102,0.00003256712,0.00007723231,0.00051228073,0.01149736,0.000661372,0.012241388,0.86616355,0.101397656,0.0018504459],"study_design_scores_gemma":[0.006950121,0.0016640808,0.008493191,0.0006445835,0.000054907465,0.00047963983,0.00044507813,0.009766462,0.029581608,0.68260336,0.25655603,0.0027609065],"about_ca_topic_score_codex":0.00008110057,"about_ca_topic_score_gemma":0.000007827526,"teacher_disagreement_score":0.18356015,"about_ca_system_score_codex":0.00009037076,"about_ca_system_score_gemma":0.00006669998,"threshold_uncertainty_score":0.96817446},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93651104,0.00011745051,0.00007143043,0.00003831748,0.00268853,0.00020062749,0.0000033547446,0.00013664541,0.06023261],"genre_scores_gemma":[0.99643713,0.00001417012,0.0011876514,0.00042578587,0.000010733167,0.000020652089,0.000001864952,0.000043180713,0.0018588381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984847,0.00041116227,0.00025755094,0.00026283087,0.00025760272,0.00032616212],"domain_scores_gemma":[0.99836314,0.00073571684,0.00010131019,0.00063887244,0.000055170516,0.00010581833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007909961,0.00021125087,0.00026582566,0.00008276448,0.00027150483,0.000036042245,0.00024258556,0.00012453186,0.0006192944],"category_scores_gemma":[0.0009985687,0.00016548848,0.00013419245,0.00019169699,0.00009375163,0.000058861646,0.00004654021,0.00020944705,0.000060554183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046292036,0.0000983,0.00018920419,0.000013251979,0.00005497484,0.000008754461,0.00037878976,0.0000021795327,0.00011203264,0.9925467,0.006338844,0.00021068803],"study_design_scores_gemma":[0.0011310045,0.00009050486,0.00008403845,0.000017662242,0.000030424198,0.000007092474,0.000033745007,0.000008053234,0.003931395,0.987252,0.0071965787,0.0002175112],"about_ca_topic_score_codex":0.0000015091246,"about_ca_topic_score_gemma":5.282396e-7,"teacher_disagreement_score":0.05992609,"about_ca_system_score_codex":0.00003238523,"about_ca_system_score_gemma":0.00002180454,"threshold_uncertainty_score":0.67808396},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9730488,0.0004688505,0.024879377,0.00036042577,0.00055316323,0.00019596872,0.0000034754805,0.00015973827,0.00033016974],"genre_scores_gemma":[0.9830316,0.000013157821,0.016787605,0.00011747578,9.2388973e-7,0.0000127257435,0.0000066716407,0.000020902791,0.000008965602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816597,0.00007957191,0.00040254704,0.0005209974,0.00051264174,0.00031830336],"domain_scores_gemma":[0.99861515,0.00008359403,0.0002865841,0.0006688195,0.00013315005,0.00021271607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030912168,0.00024313078,0.00034097853,0.0001078439,0.00022963661,0.00016673499,0.0004563231,0.00007263951,0.0000055791734],"category_scores_gemma":[0.000036935926,0.0002199152,0.000067368106,0.00062629225,0.0002748608,0.00081599504,0.000078051984,0.00017939133,0.0000058443648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000162153,0.00032581817,0.005224836,0.00022717271,0.00007530804,0.00003915735,0.0015951847,0.0003141135,0.001354269,0.990119,0.000058946058,0.0006500067],"study_design_scores_gemma":[0.001628399,0.0002410608,0.0045119226,0.000632168,0.000029250732,0.000089607805,0.00011844332,0.004460657,0.00097464153,0.98692435,0.00005643616,0.0003330753],"about_ca_topic_score_codex":0.00017586364,"about_ca_topic_score_gemma":0.000025404297,"teacher_disagreement_score":0.0099827405,"about_ca_system_score_codex":0.00007774703,"about_ca_system_score_gemma":0.00011562476,"threshold_uncertainty_score":0.8967881},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9934706,0.0000793129,0.0003194895,0.0008599781,0.00069342164,0.00008715275,3.5111984e-7,0.00008986416,0.0043998216],"genre_scores_gemma":[0.9991292,0.000015404838,0.00033341596,0.00042054773,1.8559342e-7,0.0000079653,2.521347e-7,0.0000050587373,0.00008800315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911606,0.000051815183,0.00017104959,0.00019783294,0.00029116625,0.00017206537],"domain_scores_gemma":[0.99902153,0.0002288371,0.000075501484,0.0005315886,0.000087785804,0.000054738113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025158524,0.00008986131,0.00012039633,0.00006910914,0.00017541877,0.000013588261,0.0006073585,0.000041127878,0.000007566798],"category_scores_gemma":[0.00004546765,0.000060635404,0.00006703722,0.0004862245,0.0001954978,0.00008305372,0.00011719017,0.00012637283,0.000048735514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036451659,0.00007320182,0.00046882118,0.0000021814765,0.00000819939,0.000007190779,0.00016806458,0.000033732675,0.0002322308,0.9948352,0.0039996994,0.00016780866],"study_design_scores_gemma":[0.00030607483,0.00018338399,0.0011284541,0.000015413318,0.0000020553193,0.000009722759,0.000009333469,0.0008946235,0.0076603484,0.9893926,0.00032031233,0.00007770755],"about_ca_topic_score_codex":0.000036727713,"about_ca_topic_score_gemma":4.5287214e-7,"teacher_disagreement_score":0.0074281176,"about_ca_system_score_codex":0.000009671426,"about_ca_system_score_gemma":0.000037960628,"threshold_uncertainty_score":0.247264},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9812013,0.0006711725,0.014949043,0.00059467606,0.00086916384,0.00031525045,0.0000025424088,0.0003294564,0.0010673753],"genre_scores_gemma":[0.99669063,0.000055126668,0.0030960385,0.00007071461,0.0000030464896,0.000023617464,0.0000020568307,0.000017844475,0.000040940315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982986,0.00010215889,0.00018091088,0.00053852604,0.00036448205,0.00051532296],"domain_scores_gemma":[0.9987711,0.00016170075,0.000060607123,0.0007061487,0.00007305761,0.00022739996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036328984,0.0002108346,0.00022173491,0.00022276855,0.0002803389,0.00016267496,0.0008205092,0.00007889163,0.0000072547896],"category_scores_gemma":[0.00007145657,0.00019405856,0.00008903527,0.00077856437,0.00024416664,0.00055381365,0.00034854462,0.00031848514,0.000021197498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009582441,0.000059627415,0.002168107,0.00000900989,0.000022629043,0.000030781404,0.00026693483,0.000060655348,0.000777914,0.9950277,0.000036298472,0.0015307241],"study_design_scores_gemma":[0.0013686988,0.0002518783,0.0054303096,0.000020016458,0.0000049886366,0.00002664301,0.000030801508,0.00013979193,0.0029123805,0.98949295,0.000093527626,0.0002280195],"about_ca_topic_score_codex":0.000023859055,"about_ca_topic_score_gemma":0.000008506896,"teacher_disagreement_score":0.015489295,"about_ca_system_score_codex":0.000047534326,"about_ca_system_score_gemma":0.000063097184,"threshold_uncertainty_score":0.79134786},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6778029,0.0031575253,0.2820392,0.005367346,0.0016914055,0.0019045164,0.000012027682,0.0027933666,0.025231674],"genre_scores_gemma":[0.9194551,0.0000066746193,0.07989324,0.000210028,0.000006627284,0.00008742164,0.0000010393718,0.000013504822,0.00032634838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990443,0.000019144758,0.00024364208,0.0002581633,0.00019620721,0.00023855144],"domain_scores_gemma":[0.9991246,0.000062032,0.00010403316,0.00044078915,0.00021510212,0.000053476255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002157331,0.00012555002,0.00018182152,0.000078983816,0.000055523018,0.00017245092,0.00091624074,0.000049856164,6.4060106e-7],"category_scores_gemma":[0.00014219814,0.0001101699,0.00007018353,0.00024176479,0.000077751145,0.0009500027,0.00022298966,0.000060988434,0.000009944229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011305486,0.00027462235,0.00015172648,0.00007619355,0.000014326752,0.0000012695114,0.00046649712,0.0000036685583,0.009378019,0.81590205,0.0066096056,0.16711074],"study_design_scores_gemma":[0.00055048603,0.0002901167,0.0002482949,0.000101061836,0.000006904705,0.0000033927108,0.000017848337,0.01113889,0.2473287,0.72536826,0.014667498,0.0002785475],"about_ca_topic_score_codex":0.000011043202,"about_ca_topic_score_gemma":0.0000014207139,"teacher_disagreement_score":0.24165218,"about_ca_system_score_codex":0.00003914982,"about_ca_system_score_gemma":0.00008337643,"threshold_uncertainty_score":0.44925982},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87894106,0.00004368221,0.01542021,0.00018060498,0.00026933668,0.0002625238,0.00003599393,0.000081909966,0.10476471],"genre_scores_gemma":[0.99465,0.000002801514,0.0021436308,0.00003202692,0.000020077168,0.000104469495,0.00001771853,0.000013130287,0.0030161294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994046,0.000011074525,0.00012296013,0.00018231267,0.000096888,0.00018217547],"domain_scores_gemma":[0.9994446,0.000068737936,0.0000553037,0.00025924653,0.00009183339,0.00008025015],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000031996973,0.000111315894,0.00013269388,0.0000167228,0.00028712308,0.000013711306,0.00011960276,0.000018568058,0.0011357223],"category_scores_gemma":[0.0000053555164,0.00008871573,0.000031014057,0.0003015834,0.0001526144,0.000121235666,0.000027431099,0.00012547184,0.0001913185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031119523,0.00009705171,0.0019826144,0.0000034220054,0.000017569544,8.2910526e-7,0.00009836652,0.000014388602,0.000081350154,0.99596983,0.0009126023,0.00081887486],"study_design_scores_gemma":[0.0003716037,0.000047109137,0.00051858666,0.000012419836,0.000012145215,0.0000071175346,0.00021038938,0.00004702294,0.000761848,0.97198933,0.02584717,0.00017525423],"about_ca_topic_score_codex":0.000012631874,"about_ca_topic_score_gemma":9.253537e-7,"teacher_disagreement_score":0.115708984,"about_ca_system_score_codex":0.0000112367225,"about_ca_system_score_gemma":0.00005541641,"threshold_uncertainty_score":0.9997774},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9565097,0.000026855649,0.000088449444,0.000057244517,0.00077491754,0.00061236677,0.000005566635,0.00009611089,0.04182878],"genre_scores_gemma":[0.9982037,0.0000045710967,0.0006181893,0.000048021062,0.000018751933,0.00003963545,0.0000086859045,0.000052000396,0.0010064472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997974,0.00011651746,0.00042432928,0.0003415696,0.0004784538,0.0006651811],"domain_scores_gemma":[0.9968285,0.0023145322,0.00010005084,0.0005193639,0.00011551942,0.00012204302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002653391,0.00021165935,0.0003257278,0.0003892906,0.00007988315,0.000037355883,0.00040616843,0.00018844614,0.000112239126],"category_scores_gemma":[0.0010793778,0.00020703692,0.000067457986,0.0007761827,0.000106728505,0.00014728514,0.00015087343,0.00053999765,0.00028844713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025059006,0.00050795055,0.024736395,0.000102795726,0.000032842006,0.00023779046,0.0032682149,0.000001632377,0.00042256474,0.9676881,0.0020997568,0.00065136777],"study_design_scores_gemma":[0.0017079698,0.00021914384,0.0126782255,0.000071841474,0.000008127122,0.000010129569,0.00059140235,0.00018514051,0.0029514143,0.9807124,0.00059489266,0.00026927528],"about_ca_topic_score_codex":0.0000937848,"about_ca_topic_score_gemma":0.00013053005,"teacher_disagreement_score":0.04169399,"about_ca_system_score_codex":0.00021063467,"about_ca_system_score_gemma":0.000097226395,"threshold_uncertainty_score":0.8442721},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95418274,0.00064579555,0.031096594,0.0014683059,0.0029432955,0.00017571545,7.756856e-7,0.00009040563,0.0093963845],"genre_scores_gemma":[0.99684274,0.00003489809,0.0024409585,0.00008407606,0.000007998911,0.0000083161185,6.96778e-7,0.000003900463,0.0005763882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992524,0.000046278125,0.00017144387,0.00014950246,0.0002301486,0.00015023128],"domain_scores_gemma":[0.9992874,0.00020123887,0.00006966512,0.00029900158,0.000104413906,0.00003824345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019988958,0.00006839573,0.000077191726,0.00003982916,0.00019780571,0.00006978182,0.00039052384,0.000027164884,0.000027949234],"category_scores_gemma":[0.000046352274,0.00005293326,0.000058363028,0.0004630064,0.000031953743,0.0001952631,0.0000918586,0.000064585,0.000073489704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.932414e-7,0.000036491067,0.001198583,0.000003164331,0.0000095145715,9.848101e-7,0.00021537623,0.00016449147,0.0001041081,0.9845858,0.0020043817,0.011676097],"study_design_scores_gemma":[0.00038407784,0.000043244647,0.004229636,0.00001155445,0.0000054722705,0.000017436088,0.000014903163,0.077956,0.0018359838,0.91022193,0.005160742,0.00011901884],"about_ca_topic_score_codex":0.000006832107,"about_ca_topic_score_gemma":0.0000010677329,"teacher_disagreement_score":0.07779151,"about_ca_system_score_codex":0.000013166017,"about_ca_system_score_gemma":0.000012845367,"threshold_uncertainty_score":0.21585557},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9302627,0.0001882036,0.000016525984,0.001265338,0.00046635128,0.000207673,3.6728454e-7,0.00004119232,0.06755164],"genre_scores_gemma":[0.99923795,0.0000380407,0.000106684616,0.000020926718,0.000028348379,0.000013592091,0.000005815378,0.0000049767814,0.0005436775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993543,0.00011104768,0.00011412064,0.00012634747,0.00015033154,0.00014386933],"domain_scores_gemma":[0.9997407,0.00007110947,0.00004877147,0.000076191165,0.000034726425,0.00002848286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044894952,0.000046187462,0.000060495986,0.00005410684,0.00011880053,0.000050874623,0.0000720619,0.00007726423,0.000017873826],"category_scores_gemma":[0.000047752404,0.00005330427,0.000009161428,0.00024056637,0.000083269224,0.00017796135,0.000010145973,0.000071916744,0.000009686922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002252685,0.000034669796,0.021455854,0.000002188114,6.495514e-7,0.0000016039594,0.0017069613,0.0000021759029,0.00008455551,0.9705226,0.0011052975,0.005081198],"study_design_scores_gemma":[0.00037922582,0.000014385827,0.20797004,0.000011962761,0.0000028044888,2.5918337e-7,0.00070401735,0.00013008229,0.000098597964,0.78634316,0.00425378,0.00009169211],"about_ca_topic_score_codex":0.00117178,"about_ca_topic_score_gemma":0.0031239376,"teacher_disagreement_score":0.18651418,"about_ca_system_score_codex":0.000077439734,"about_ca_system_score_gemma":0.000029407252,"threshold_uncertainty_score":0.2173685},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97866243,0.0005295606,0.000015874572,0.000018131193,0.0015858705,0.00015181783,0.000050885854,0.0003472607,0.018638158],"genre_scores_gemma":[0.99967694,0.000021663314,0.000111713256,0.000017371158,0.000012842569,0.000015944921,0.000017298422,0.000037526846,0.00008869952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988169,0.000071666145,0.00037472564,0.00017415013,0.0002676568,0.00029488376],"domain_scores_gemma":[0.9993556,0.00010201183,0.00006568891,0.00031502228,0.000055854012,0.000105818144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001913584,0.0001973187,0.00029806537,0.00013195084,0.000067458684,0.000017514694,0.00022064375,0.00010588696,0.00042545525],"category_scores_gemma":[0.000013051447,0.00020818615,0.00012568894,0.00036736895,0.00004767128,0.00010108243,0.000031081305,0.000190416,0.0001781068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010192894,0.0001687503,0.016971018,0.00022582327,0.0001820389,0.00002568194,0.0009556186,0.0007602408,0.0026537136,0.97209895,0.004989721,0.00095827883],"study_design_scores_gemma":[0.008022807,0.00072307163,0.09454145,0.0005055575,0.0002384259,0.0001562606,0.00047504672,0.13253063,0.0061898665,0.67560244,0.07827119,0.0027432377],"about_ca_topic_score_codex":0.0000030755232,"about_ca_topic_score_gemma":0.00000275411,"teacher_disagreement_score":0.29649645,"about_ca_system_score_codex":0.00002635931,"about_ca_system_score_gemma":0.000006258431,"threshold_uncertainty_score":0.84895843},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9025397,0.00031139917,0.08728528,0.000701549,0.0026240589,0.00023320371,0.0000013044208,0.00025918463,0.00604437],"genre_scores_gemma":[0.98696303,0.0000018806239,0.012372626,0.00012452592,0.000025090178,0.000015456977,0.00001530345,0.000007584472,0.00047448906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989443,0.000054684824,0.00025279794,0.0002704497,0.0002617844,0.00021602798],"domain_scores_gemma":[0.99933034,0.00013048874,0.00009059817,0.0003122333,0.00008035564,0.00005596868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023155395,0.000118372496,0.00013675718,0.00012931318,0.00015300795,0.00015422827,0.00037567408,0.00004997252,0.000011597065],"category_scores_gemma":[0.000033726756,0.00012221886,0.000062817206,0.00053327816,0.000015618763,0.00041521055,0.00009976132,0.000068898415,0.000098174736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027282788,0.00009273988,0.00021542406,0.00001126558,0.000008651956,0.000012250765,0.00009600081,0.0012597688,0.0012773651,0.98150563,0.007953649,0.0075645256],"study_design_scores_gemma":[0.00093116437,0.000069900365,0.0057093776,0.00001562448,0.0000066735647,0.000017246397,0.0000067413257,0.12544578,0.004704761,0.86117303,0.0017148836,0.00020478967],"about_ca_topic_score_codex":0.000028905511,"about_ca_topic_score_gemma":0.0000041401017,"teacher_disagreement_score":0.12418602,"about_ca_system_score_codex":0.000055083823,"about_ca_system_score_gemma":0.00006715924,"threshold_uncertainty_score":0.498394},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95933986,0.0027365254,0.000224576,0.0062062857,0.004245752,0.00068220077,0.000089452966,0.00019778228,0.026277572],"genre_scores_gemma":[0.986795,0.00014285353,0.005059219,0.00022006549,0.000037788646,0.00012632273,0.000015438165,0.000074120566,0.0075291935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980148,0.00014999631,0.00052148715,0.0004481738,0.00027913004,0.0005864128],"domain_scores_gemma":[0.9976187,0.00037743567,0.0002123691,0.0013890914,0.0001440472,0.00025835642],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00051280996,0.00035500203,0.00038536027,0.0001235129,0.00033279537,0.00007740029,0.0007437533,0.00035982468,0.0005618543],"category_scores_gemma":[0.00029431135,0.00039937804,0.00030635565,0.00061041076,0.00038490994,0.00022071805,0.00018630673,0.0004701549,0.0007928604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018071252,0.0013026419,0.00030684343,0.00016705849,0.00009760894,0.00005343286,0.00082283735,0.0000066339903,0.00044306688,0.9879248,0.008286473,0.0005704882],"study_design_scores_gemma":[0.0021054058,0.00014298815,0.00040912372,0.00020955384,0.00016437715,0.00008349321,0.00019379317,0.000007998087,0.004104052,0.97966385,0.012502141,0.00041321327],"about_ca_topic_score_codex":0.00011812084,"about_ca_topic_score_gemma":0.000035998863,"teacher_disagreement_score":0.027455145,"about_ca_system_score_codex":0.000115064286,"about_ca_system_score_gemma":0.00013538661,"threshold_uncertainty_score":0.99998516},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40947098,0.0031401897,0.5427774,0.005768362,0.008010248,0.0021837144,0.000008341461,0.0017425069,0.026898274],"genre_scores_gemma":[0.9667512,0.000019223968,0.03196021,0.0003022541,0.00001363551,0.00007548273,0.0000013569357,0.000012267469,0.00086433464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989665,0.000024536268,0.00016502434,0.0003513818,0.00016871086,0.00032384598],"domain_scores_gemma":[0.9991938,0.00009485964,0.00007524977,0.0004712546,0.00007581213,0.000089064364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012513656,0.0001279863,0.00015117024,0.00004708191,0.00015142198,0.000093437615,0.0007754671,0.00005761886,0.000023973414],"category_scores_gemma":[0.000029557616,0.00011763967,0.00006427269,0.0002662317,0.00002955902,0.00054417364,0.00013005339,0.000088400324,0.00009813236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010508304,0.00008492646,0.000117041665,0.000016498614,0.000007977465,0.000005818953,0.00019768922,0.00010570554,0.00012103421,0.9872757,0.0015607004,0.010505834],"study_design_scores_gemma":[0.000646694,0.00010961306,0.00017328188,0.00000953443,0.0000044142384,0.000004678003,0.000005534767,0.0461064,0.00054356654,0.9375053,0.014707527,0.00018344363],"about_ca_topic_score_codex":0.0000020251032,"about_ca_topic_score_gemma":5.50375e-7,"teacher_disagreement_score":0.55728024,"about_ca_system_score_codex":0.0000269621,"about_ca_system_score_gemma":0.000008795089,"threshold_uncertainty_score":0.47972065},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99427384,0.00010327924,0.00029370986,0.000308949,0.00067226234,0.00014734411,3.4397038e-7,0.00014544447,0.004054823],"genre_scores_gemma":[0.9887552,0.0000055330593,0.010848047,0.000119766024,5.544457e-7,0.000019949264,0.0000010842183,0.000012347334,0.00023748635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878293,0.00004443956,0.0002501046,0.00031825702,0.00031384898,0.00029040984],"domain_scores_gemma":[0.998829,0.00007566627,0.0001376186,0.0006183089,0.0002175991,0.00012182974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016669038,0.00015037936,0.00021522526,0.00009974314,0.00008522339,0.00007651819,0.0005424098,0.000060085466,0.00004496367],"category_scores_gemma":[0.000017588298,0.00011868085,0.000062811094,0.0006538834,0.000096713185,0.00039245386,0.00013152797,0.000120307726,0.00017169534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027843953,0.000102426646,0.017956967,0.000010279857,0.000025466648,0.0000049497494,0.00030908216,0.000015736694,0.0017717446,0.97564864,0.0029703071,0.0011816312],"study_design_scores_gemma":[0.0008801812,0.00014184235,0.006390375,0.000065356944,0.0000095027435,0.000017493856,0.000033638604,0.002646674,0.003973993,0.98551315,0.00012059541,0.0002071774],"about_ca_topic_score_codex":0.00021298435,"about_ca_topic_score_gemma":0.0000022736776,"teacher_disagreement_score":0.011566591,"about_ca_system_score_codex":0.0000090222175,"about_ca_system_score_gemma":0.00004412541,"threshold_uncertainty_score":0.48396647},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98702836,0.0008468113,0.0001217086,0.0000026497955,0.0014051173,0.00011016847,0.0000019240852,0.00043300947,0.01005026],"genre_scores_gemma":[0.99973345,0.00004289365,0.00009903849,0.000015805734,0.000015456835,0.0000050157555,0.0000015496031,0.000027605014,0.00005919736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924374,0.000025901569,0.000177729,0.00013846961,0.00013328656,0.00028087565],"domain_scores_gemma":[0.9995471,0.0001364008,0.00002296419,0.00016220998,0.000021022654,0.00011025655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050933403,0.0001405428,0.00016039265,0.00016593692,0.000072675444,0.00003771223,0.000083583516,0.000094759926,0.000014346795],"category_scores_gemma":[0.000019146311,0.0001435155,0.00003586467,0.00039995104,0.000025804029,0.000110709676,0.000023244693,0.00013106398,0.000029869261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008476411,0.00006072661,0.011695928,0.000084366366,0.00009170482,0.000035142148,0.0004944966,0.000029441519,0.0026322196,0.98301226,0.0010951844,0.00076008006],"study_design_scores_gemma":[0.0049648136,0.00049460185,0.22045322,0.00018379626,0.00019949654,0.00020021814,0.0007113711,0.005012979,0.064131334,0.6735993,0.027982412,0.0020664583],"about_ca_topic_score_codex":0.000010129392,"about_ca_topic_score_gemma":0.0000028543875,"teacher_disagreement_score":0.30941293,"about_ca_system_score_codex":0.0000388754,"about_ca_system_score_gemma":0.000004730794,"threshold_uncertainty_score":0.58523923},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97160476,0.00009651339,0.018755728,0.0036740692,0.0010285312,0.00013047777,0.0000014353204,0.000051218973,0.0046572858],"genre_scores_gemma":[0.9982889,0.0000083272425,0.0007322098,0.00053515413,0.0000070153455,0.0000054693064,0.0000023591685,0.0000035499427,0.00041701432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924386,0.00007196681,0.00013684537,0.00016451452,0.00025887165,0.00012395355],"domain_scores_gemma":[0.9991073,0.0003538837,0.00006928129,0.00035531085,0.00007720571,0.000037039583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025820188,0.00007425726,0.000080053316,0.000059365364,0.00009767039,0.00004295871,0.0004722508,0.000028592971,0.000024220151],"category_scores_gemma":[0.00009139592,0.000055643475,0.00003995566,0.0005265073,0.000022923798,0.0001473173,0.00008893197,0.0000796628,0.000071011185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005347797,0.00007047255,0.00011715582,0.0000016271933,0.000008252116,0.0000027873944,0.000198151,0.00047988893,0.00029942405,0.9940507,0.0022891522,0.002477062],"study_design_scores_gemma":[0.0004409789,0.00022961696,0.0061069718,0.000015815727,0.0000055639653,0.00001664465,0.000034561916,0.027907765,0.0052812374,0.9553588,0.0044639027,0.00013815355],"about_ca_topic_score_codex":0.00001015365,"about_ca_topic_score_gemma":0.0000010640653,"teacher_disagreement_score":0.038691893,"about_ca_system_score_codex":0.000018093762,"about_ca_system_score_gemma":0.0000413336,"threshold_uncertainty_score":0.2269075},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98570246,0.000018020333,0.0016462592,0.00014278019,0.0003597033,0.00038552808,0.000011227656,0.00032682857,0.011407191],"genre_scores_gemma":[0.98576665,0.000006041146,0.008926542,0.000049218812,0.000007615948,0.00014313713,0.000005281292,0.000047211033,0.0050482857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881566,0.00004340435,0.0002659895,0.00024412655,0.0003182984,0.00031250564],"domain_scores_gemma":[0.9984462,0.00076389627,0.000112509704,0.00045862398,0.0000957086,0.00012306341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010164543,0.00019977214,0.00029078408,0.000051824376,0.0002892894,0.000022516648,0.00017122431,0.00006036194,0.0001620788],"category_scores_gemma":[0.0007138835,0.00015793224,0.00006606251,0.00016348131,0.00023897631,0.00016108848,0.000051393996,0.00017961093,0.00032745406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021391614,0.000707493,0.00045442217,0.000046051107,0.000030278154,0.000076690965,0.00035562128,0.000011175281,0.00001576156,0.9921147,0.0061580655,0.000008317075],"study_design_scores_gemma":[0.0010829129,0.00020674159,0.00085901876,0.00008075177,0.000032935426,0.00003461234,0.000072857416,0.00012394367,0.00075029756,0.99616635,0.00036934332,0.00022021995],"about_ca_topic_score_codex":0.0000050397152,"about_ca_topic_score_gemma":0.000021049307,"teacher_disagreement_score":0.0072802827,"about_ca_system_score_codex":0.00006785441,"about_ca_system_score_gemma":0.0000367048,"threshold_uncertainty_score":0.644029},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9864123,0.00003099617,0.00000584857,0.00006323323,0.0016536354,0.0001396553,0.0000047855747,0.000057507423,0.011632054],"genre_scores_gemma":[0.9993117,0.000017231678,0.00028483043,0.0001725471,0.0000072325024,0.000015152332,0.0000036271986,0.0000222959,0.00016541091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879706,0.00008066524,0.00024658264,0.00023354552,0.00039851107,0.00024364878],"domain_scores_gemma":[0.99911827,0.0003818651,0.000081345315,0.0003097481,0.000040091596,0.000068692694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023002748,0.00015859635,0.00020290981,0.0001803353,0.00021171148,0.00000991166,0.00020491621,0.00013517072,0.00021237593],"category_scores_gemma":[0.00017975678,0.00014085673,0.00009110463,0.00019869542,0.00008577014,0.00008901379,0.00007323917,0.00038151516,0.00002690261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060621645,0.00021085459,0.012262842,0.000009123553,0.000021875043,0.00009487071,0.00047688646,0.0000046323653,0.000014638629,0.9832031,0.003524313,0.00011623145],"study_design_scores_gemma":[0.0009556141,0.00008205163,0.050553,0.000016907732,0.0000053579865,0.000053959357,0.00002939932,0.000021829768,0.00018263534,0.9477025,0.00024203876,0.00015469413],"about_ca_topic_score_codex":0.000013720854,"about_ca_topic_score_gemma":0.0000051745724,"teacher_disagreement_score":0.03829016,"about_ca_system_score_codex":0.000062298735,"about_ca_system_score_gemma":0.00003099555,"threshold_uncertainty_score":0.5743971},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9869319,0.00020656484,0.006789472,0.0008870012,0.0012124456,0.00033622835,0.0000010827783,0.0003368125,0.0032984687],"genre_scores_gemma":[0.9928057,0.000026353542,0.006865264,0.00011249865,0.00001747095,0.000031970012,0.0000022329693,0.00001859946,0.00011986856],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9978093,0.00014250533,0.0003216151,0.0007023428,0.0004807872,0.00054348586],"domain_scores_gemma":[0.99844426,0.00020915589,0.000058226815,0.0010233584,0.00011108061,0.000153942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048449327,0.00025956632,0.0003250199,0.00017926244,0.00010660693,0.00015987684,0.0013333545,0.000097277014,0.000015172394],"category_scores_gemma":[0.000051654537,0.00023011437,0.00006235175,0.0010361907,0.000097452976,0.000534779,0.00047757511,0.0002757277,0.000051113806],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032161664,0.00084342225,0.54932964,0.000027244598,0.000039985553,0.0006686573,0.0013434043,0.00072820653,0.000108090164,0.36222783,0.00070227,0.0839491],"study_design_scores_gemma":[0.0010844643,0.0003401126,0.6124916,0.00005057492,0.000006986285,0.00012874299,0.000060272418,0.017411366,0.00039273515,0.3655915,0.0018607508,0.0005808855],"about_ca_topic_score_codex":0.00020271435,"about_ca_topic_score_gemma":0.00018932928,"teacher_disagreement_score":0.08336821,"about_ca_system_score_codex":0.00015999158,"about_ca_system_score_gemma":0.00009660851,"threshold_uncertainty_score":0.93837917},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9776502,0.000073372816,0.0005284327,0.00035305962,0.0008690134,0.0003428716,0.000011491267,0.00020191076,0.019969596],"genre_scores_gemma":[0.98430824,0.00001291533,0.008131653,0.00033228047,0.000012876957,0.00005225349,0.000009853665,0.00003385728,0.007106048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992732,0.000045614754,0.0001751115,0.00017751433,0.000079198384,0.00024940466],"domain_scores_gemma":[0.9991412,0.00045422546,0.000047477763,0.00026956704,0.000031225158,0.000056308014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025018313,0.00012075049,0.00019403816,0.000023266475,0.00015682321,0.000010156208,0.00017085069,0.00011430607,0.00074220804],"category_scores_gemma":[0.000143379,0.0001140255,0.000075584365,0.000059051275,0.00006627415,0.000092264425,0.00001794788,0.0001288858,0.00016059598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063744825,0.000088889865,0.0000476269,0.00002282235,0.000022298798,0.0000040715972,0.00034044098,0.0000016774296,0.00002982304,0.9865764,0.0070979106,0.0057043266],"study_design_scores_gemma":[0.00087575207,0.00006581627,0.000053261912,0.000012137384,0.00001895611,0.000009188316,0.00004629358,0.000046727702,0.00041416075,0.9841585,0.014162721,0.00013644055],"about_ca_topic_score_codex":0.0000018597448,"about_ca_topic_score_gemma":0.0000012531353,"teacher_disagreement_score":0.0128635485,"about_ca_system_score_codex":0.000023074497,"about_ca_system_score_gemma":0.000015896678,"threshold_uncertainty_score":0.81266576},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9915608,0.0003484176,0.00045571497,0.00015706972,0.0010091603,0.00008704036,0.0000010480449,0.00017895157,0.006201789],"genre_scores_gemma":[0.98095363,0.000003579413,0.01884575,0.000058960613,6.1488873e-7,0.000008233799,0.0000041210915,0.000011662055,0.0001134434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864423,0.000058091828,0.00038659593,0.0003040856,0.0003284691,0.00027850235],"domain_scores_gemma":[0.99889535,0.000098006094,0.00017112118,0.0006403754,0.00012888908,0.000066257046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032126444,0.00015210481,0.00023321601,0.00010600861,0.00011121549,0.00005940684,0.0005617453,0.00007553747,0.000019016787],"category_scores_gemma":[0.000027904547,0.00014529173,0.00010262904,0.0006121405,0.0000838028,0.00015740901,0.00015071643,0.000099386256,0.00010679414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001164475,0.00009993168,0.013091421,0.000019758174,0.000010405283,0.000007264096,0.00006661715,0.000042378342,0.0009079114,0.9838971,0.0016105756,0.00024548138],"study_design_scores_gemma":[0.0005790879,0.00004140276,0.004796818,0.000053947042,0.000010443231,0.00001971517,0.000009083035,0.0014409557,0.0028850543,0.98990995,0.00008524169,0.00016830862],"about_ca_topic_score_codex":0.00020977034,"about_ca_topic_score_gemma":0.0000044943704,"teacher_disagreement_score":0.018390035,"about_ca_system_score_codex":0.00001376767,"about_ca_system_score_gemma":0.000036910526,"threshold_uncertainty_score":0.5924825},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88776976,0.00041563687,0.081828706,0.0004553937,0.0059337467,0.0010011509,0.00008077335,0.00017547753,0.02233936],"genre_scores_gemma":[0.99571204,0.000004906989,0.004002891,0.000065913286,0.0000034835098,0.000011449702,0.0000011296459,0.000019781704,0.00017842239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990168,0.00006609935,0.00030574956,0.00015697321,0.0002505718,0.00020379858],"domain_scores_gemma":[0.99864006,0.00059469347,0.00013763424,0.00031398912,0.00025014588,0.000063471896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022230604,0.00013310152,0.00022817645,0.000033813034,0.00007658063,0.000014381433,0.00024775518,0.000078209436,0.00005854925],"category_scores_gemma":[0.0033044578,0.00009097218,0.000075176256,0.0004294931,0.000055238965,0.000033323013,0.000045175442,0.00014138175,0.000008311334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009390079,0.00014056964,0.00008265461,0.0000803291,0.00002356331,0.0000024532856,0.000085270876,1.2243447e-7,0.00036216792,0.9980151,0.0011262287,0.000072130046],"study_design_scores_gemma":[0.00060205656,0.00011019824,0.00006198959,0.00005560055,0.000047234742,0.0000068380746,0.000042712905,0.00025432758,0.010411915,0.9882431,0.000056848166,0.00010717519],"about_ca_topic_score_codex":0.0000057862194,"about_ca_topic_score_gemma":0.0000027641313,"teacher_disagreement_score":0.10794227,"about_ca_system_score_codex":0.000021779735,"about_ca_system_score_gemma":0.00005667739,"threshold_uncertainty_score":0.39559832},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9936667,0.000069785514,0.004680578,0.000047314305,0.00064152665,0.00012514017,0.0000034977854,0.000057501053,0.0007079613],"genre_scores_gemma":[0.9978129,0.000007262499,0.0021216648,0.000009634609,0.0000024257686,0.0000072784665,0.000003388099,0.000009130784,0.00002627447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998828,0.00009275843,0.00030843285,0.00023108536,0.00030946624,0.00023027111],"domain_scores_gemma":[0.99900013,0.00011041411,0.0001887854,0.00048126228,0.00017859114,0.000040798568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003542245,0.0001010412,0.00019849351,0.00027585158,0.000045730856,0.000017928758,0.0006011285,0.000044609944,0.000007092577],"category_scores_gemma":[0.000031308282,0.00010398271,0.000089575,0.0008176111,0.0001229666,0.0004321606,0.00016064862,0.00012680299,0.000004145808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023079672,0.00010854013,0.0029947693,0.000024411036,0.000011965907,0.0000037590003,0.00027360508,0.000010867889,0.0717993,0.92391807,0.0000371227,0.0007945361],"study_design_scores_gemma":[0.00041638114,0.00016805952,0.014468405,0.000033474484,0.000002778381,0.00000347927,0.000051865227,0.00072404544,0.114446424,0.86950654,0.00008179295,0.000096751275],"about_ca_topic_score_codex":0.00010074987,"about_ca_topic_score_gemma":0.000006853061,"teacher_disagreement_score":0.0544115,"about_ca_system_score_codex":0.000034690675,"about_ca_system_score_gemma":0.00003289479,"threshold_uncertainty_score":0.42402917},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98495126,0.0003026147,5.7289117e-7,0.000038367343,0.00073193474,0.000095525735,0.0000033621905,0.00008324419,0.013793148],"genre_scores_gemma":[0.99982846,0.000009135617,0.000029093342,0.0000065341756,0.000004818412,0.000011099042,0.0000027588194,0.000015730258,0.00009239318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993675,0.000045425975,0.00020644936,0.000107679094,0.00010008884,0.00017290947],"domain_scores_gemma":[0.9996632,0.00006364705,0.000008230714,0.00020309968,0.000025431924,0.000036432026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016607893,0.000085697226,0.0001558625,0.00007630306,0.0000146586835,0.000008068708,0.00010181293,0.0000589071,0.00014435104],"category_scores_gemma":[0.0000525373,0.00009060168,0.000025410578,0.0003421065,0.00003796958,0.00008220084,0.0000063972657,0.00010879925,0.00008412863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002232142,0.00013854442,0.005980171,0.00034333754,0.00001784801,0.000025411835,0.0010492721,0.0008510744,0.0029758783,0.98377687,0.0014840906,0.0033352103],"study_design_scores_gemma":[0.0017467486,0.00017484455,0.041909363,0.0003579412,0.00001959155,0.00001545946,0.00019954638,0.0037435486,0.031506874,0.91232383,0.007415306,0.0005869302],"about_ca_topic_score_codex":0.000009553117,"about_ca_topic_score_gemma":0.0000022241045,"teacher_disagreement_score":0.07145299,"about_ca_system_score_codex":0.000015331201,"about_ca_system_score_gemma":0.0000073986603,"threshold_uncertainty_score":0.36946294},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9222626,0.00040105038,0.07017741,0.000015836269,0.0036592488,0.00080788846,0.0000227973,0.0008193926,0.0018337535],"genre_scores_gemma":[0.9921198,0.000012231753,0.0075434567,0.000014890736,0.000037619564,0.00014677487,0.000012702958,0.000044288812,0.00006822576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991932,0.000035835594,0.00023088667,0.00018230063,0.000095130374,0.00026266772],"domain_scores_gemma":[0.9994027,0.00015986044,0.000041555024,0.0002554188,0.000029718789,0.00011074997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013947749,0.00017123108,0.00024477244,0.00005552989,0.00010796076,0.00001647146,0.00017758511,0.00012639584,0.000032250016],"category_scores_gemma":[0.000035471956,0.00018487338,0.00009645913,0.0001613317,0.00003505134,0.00011166858,0.000015789716,0.00013308144,0.000018781113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074659474,0.0000497593,0.011329318,0.00012777325,0.00022346346,0.00005030597,0.0017057501,0.00014482542,0.26564726,0.7032761,0.01574936,0.0016213928],"study_design_scores_gemma":[0.0021382163,0.0001053345,0.0007399638,0.00012792104,0.0000313228,0.00006826323,0.0002855847,0.00076043716,0.17120868,0.821658,0.0023202987,0.0005559716],"about_ca_topic_score_codex":0.000032223328,"about_ca_topic_score_gemma":0.000002125169,"teacher_disagreement_score":0.11838189,"about_ca_system_score_codex":0.000041712676,"about_ca_system_score_gemma":0.000027603277,"threshold_uncertainty_score":0.75389177},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98067296,0.00041169376,0.0030964536,0.00021020723,0.0013299627,0.00031482778,8.582885e-7,0.00025684922,0.013706201],"genre_scores_gemma":[0.9946916,0.000016682365,0.0050713765,0.00009065035,7.2951246e-7,0.00002352585,8.4304503e-7,0.000013591239,0.0000909861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981288,0.00037414153,0.00022304466,0.00043200128,0.0003251081,0.0005169506],"domain_scores_gemma":[0.9986003,0.0003777975,0.000052415828,0.00074713194,0.00009609528,0.00012624315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080621603,0.00013999254,0.00017739221,0.00032115777,0.000115777395,0.000083271676,0.0008551887,0.00007078212,0.00002306837],"category_scores_gemma":[0.0005578504,0.0001466264,0.000050055456,0.0017083162,0.00007438228,0.0006308124,0.0001656925,0.00030504886,0.000062072075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048324746,0.00006517863,0.0061865225,0.000004691205,0.000005207762,0.00006020052,0.00022684287,0.000013862098,0.0006204115,0.99182576,0.00014969196,0.000836781],"study_design_scores_gemma":[0.000826083,0.0000614361,0.0037529974,0.00001949717,7.67555e-7,0.000011997441,0.00003084123,0.00088225264,0.0028983285,0.9905037,0.00083684525,0.00017520633],"about_ca_topic_score_codex":0.000011325174,"about_ca_topic_score_gemma":0.000010446266,"teacher_disagreement_score":0.014018669,"about_ca_system_score_codex":0.00006598893,"about_ca_system_score_gemma":0.000075604374,"threshold_uncertainty_score":0.59792507},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9776186,0.00067633495,0.000019622346,0.000014430327,0.0065915883,0.00024985068,0.000021573815,0.00030345726,0.014504563],"genre_scores_gemma":[0.9994996,0.000041760028,0.00003580956,0.000011758947,0.00004450759,0.000010196331,0.000019393894,0.000059739752,0.00027723733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998589,0.000078389196,0.00040824988,0.00022882849,0.0002928551,0.000402684],"domain_scores_gemma":[0.9991095,0.00009300325,0.00008229998,0.0005073111,0.00007785514,0.00013001867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017309478,0.00027192206,0.00042134753,0.00012759151,0.00010266776,0.000023145785,0.00034553956,0.00021058864,0.0004898644],"category_scores_gemma":[0.000028662522,0.00027500172,0.0001243991,0.00048150212,0.00007189938,0.00013835772,0.00006344935,0.00021045914,0.000059350717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012921073,0.0001044112,0.004581852,0.00014343704,0.00020283424,0.00003437213,0.0003729976,0.0009635272,0.094421335,0.89119315,0.0075945514,0.00025831765],"study_design_scores_gemma":[0.0044203536,0.00029848074,0.0017572347,0.000116688425,0.00008076591,0.00007626212,0.00011544496,0.0012881401,0.10885367,0.8522307,0.029998515,0.00076372083],"about_ca_topic_score_codex":0.000028264645,"about_ca_topic_score_gemma":0.000010880306,"teacher_disagreement_score":0.038962428,"about_ca_system_score_codex":0.000096843476,"about_ca_system_score_gemma":0.000018042576,"threshold_uncertainty_score":0.9999702},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9967583,0.000073228715,0.000024559486,0.00004884996,0.00016503659,0.00029764135,0.000036833517,0.000066999026,0.002528563],"genre_scores_gemma":[0.9977418,0.00017402366,0.0019326372,0.000026051146,0.000003047138,0.000035101744,0.000007635481,0.000025029105,0.000054660748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885863,0.00008655611,0.0004140647,0.00022707712,0.0002006502,0.00021302672],"domain_scores_gemma":[0.9989314,0.00019315562,0.0001799974,0.00046915768,0.00013586879,0.000090415226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019342461,0.00017469736,0.00035399772,0.00013070962,0.00010956438,0.0000059639115,0.00020724449,0.00009506184,0.000054032855],"category_scores_gemma":[0.00003668517,0.00016384259,0.00018555096,0.0004571211,0.00026169975,0.000097020566,0.00006824518,0.00012405173,0.0000069632342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027924314,0.0010072779,0.07037293,0.00013599842,0.00012299296,0.0000029672121,0.0012805512,3.3884554e-8,0.0007186034,0.92528665,0.0010257247,0.000018325383],"study_design_scores_gemma":[0.0015470266,0.00005556177,0.00510771,0.00004878202,0.00006128871,0.000046927933,0.00012279372,0.000002858853,0.003981664,0.9885009,0.0003746608,0.00014980431],"about_ca_topic_score_codex":0.000014086333,"about_ca_topic_score_gemma":0.0000027843066,"teacher_disagreement_score":0.06526522,"about_ca_system_score_codex":0.0000063600874,"about_ca_system_score_gemma":0.000016333262,"threshold_uncertainty_score":0.6681307},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902296,0.00023230452,0.00001561931,0.000022726981,0.0008294709,0.00037576785,0.00010243944,0.00019737409,0.007994677],"genre_scores_gemma":[0.99681175,0.000011673941,0.0027739317,0.000013717187,0.000012887878,0.000023696623,0.00008503701,0.00007064832,0.00019664751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971713,0.0003924706,0.0006769281,0.0004710265,0.00076177943,0.0005264948],"domain_scores_gemma":[0.9963464,0.0017915922,0.0002927209,0.0010586943,0.00034389814,0.00016667834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073364493,0.0002985758,0.00057194487,0.00075948384,0.00012339182,0.000054642514,0.0006882029,0.00024259687,0.00035264378],"category_scores_gemma":[0.0006357777,0.00029663387,0.00019131426,0.0023335058,0.00036782087,0.00022434664,0.0001571205,0.0003873744,0.000059837104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006796172,0.0005760176,0.025658844,0.000064375025,0.00008566213,0.000027317217,0.00010554364,8.414474e-7,0.008357746,0.96091074,0.003772357,0.00037260237],"study_design_scores_gemma":[0.0019558168,0.0001787901,0.010539339,0.000047543686,0.00005969593,0.000008534003,0.00015745714,0.0001269118,0.023247479,0.963304,0.00008432797,0.00029012217],"about_ca_topic_score_codex":0.0010918853,"about_ca_topic_score_gemma":0.000037233123,"teacher_disagreement_score":0.015119505,"about_ca_system_score_codex":0.00005899881,"about_ca_system_score_gemma":0.000093638606,"threshold_uncertainty_score":0.99994856},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930675,0.00004590328,0.0018552121,0.00034466418,0.001435904,0.00015600245,6.3490614e-7,0.00011821938,0.002975936],"genre_scores_gemma":[0.99931884,0.000007706508,0.00042742677,0.00016352379,0.000010283307,0.000005291267,5.3519506e-7,0.0000067736646,0.00005962813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990707,0.000091798596,0.00019348963,0.00020862496,0.00024147175,0.0001938838],"domain_scores_gemma":[0.99876684,0.0004895972,0.000100946585,0.0005342156,0.000066930785,0.000041485477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010440674,0.00010438968,0.00010943975,0.00012700396,0.00014074358,0.000024174267,0.00065568724,0.00005307812,0.0000075844687],"category_scores_gemma":[0.000058516976,0.0000752965,0.00008589134,0.0006077891,0.00007294803,0.000115694886,0.00013255983,0.00016157795,0.000026109365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043089633,0.00016259936,0.0008024414,0.0000055430305,0.000016656117,0.000009528768,0.00037229309,0.000011264791,0.0020320818,0.9943688,0.0006590398,0.0015166803],"study_design_scores_gemma":[0.00048363835,0.0008814396,0.0043681157,0.000060204682,0.000009357161,0.000014304731,0.00006873813,0.004824568,0.033148333,0.9544402,0.001503905,0.00019720955],"about_ca_topic_score_codex":0.000020021102,"about_ca_topic_score_gemma":0.0000013522032,"teacher_disagreement_score":0.039928596,"about_ca_system_score_codex":0.000018117255,"about_ca_system_score_gemma":0.00002441022,"threshold_uncertainty_score":0.30705023},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.988066,0.000065484695,0.000033424254,0.00005172874,0.00038210952,0.0001717352,0.000006393947,0.000051337698,0.011171744],"genre_scores_gemma":[0.9967795,0.000009093722,0.002726082,0.000031710533,0.0000035161895,0.00003164337,0.0000029910482,0.000016714699,0.00039873432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924165,0.00009942544,0.0002472142,0.00014006955,0.00011582576,0.00015582626],"domain_scores_gemma":[0.99919355,0.00019806565,0.0001141914,0.0003820158,0.00005544318,0.000056713867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028191612,0.000102847815,0.000194145,0.000064104555,0.0000797078,0.000008001781,0.00015796478,0.00006551689,0.00016430124],"category_scores_gemma":[0.00014970309,0.0000992228,0.000112154186,0.00026362657,0.0000636156,0.000043073745,0.000017980912,0.00007924871,0.000018374607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008855402,0.00016784675,0.0005232797,0.000013935539,0.000025954489,5.572424e-7,0.00010436787,4.4437263e-7,0.003443952,0.9888276,0.006832685,0.000050506904],"study_design_scores_gemma":[0.00075062574,0.000027910319,0.00017604478,0.0000072886146,0.000026515198,0.0000029378036,0.00003533378,0.0000023591367,0.03142031,0.9628832,0.0045655877,0.000101925565],"about_ca_topic_score_codex":0.0000073023816,"about_ca_topic_score_gemma":0.0000015723783,"teacher_disagreement_score":0.027976358,"about_ca_system_score_codex":0.000009649938,"about_ca_system_score_gemma":0.000025909829,"threshold_uncertainty_score":0.40461883},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.988042,0.00051962613,0.00007033,0.00031315332,0.0012357959,0.00055315136,0.000049868202,0.0001173967,0.009098659],"genre_scores_gemma":[0.99679947,0.00017945083,0.0002864874,0.00008136433,0.000021247148,0.00004933149,0.000012010613,0.00006566642,0.0025049935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976998,0.00019442884,0.0007843529,0.00040698028,0.00044416255,0.0004702746],"domain_scores_gemma":[0.99741316,0.00055380363,0.0004651081,0.0011418911,0.00022994883,0.000196113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004417247,0.00035616383,0.0006270406,0.00018746371,0.00040196985,0.000016666989,0.00060189876,0.00030953097,0.00039248107],"category_scores_gemma":[0.00021986432,0.00037766498,0.00030272626,0.0007532018,0.00049932714,0.00013303607,0.00016191431,0.00041234543,0.0002860919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049979946,0.0012331562,0.004603282,0.00015373225,0.0001497938,0.000015729187,0.0022660012,0.0000026069906,0.0025564013,0.9827332,0.0060210554,0.00021507812],"study_design_scores_gemma":[0.0015405783,0.00015496234,0.0041156705,0.0001214997,0.00010020617,0.00003676183,0.00035120017,0.00009944314,0.017944,0.97264194,0.0025211915,0.00037254748],"about_ca_topic_score_codex":0.00004603767,"about_ca_topic_score_gemma":0.0000038790217,"teacher_disagreement_score":0.015387599,"about_ca_system_score_codex":0.000050422073,"about_ca_system_score_gemma":0.00016426577,"threshold_uncertainty_score":0.9998675},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9949954,0.000103174854,0.0014693593,0.0002259689,0.0006269037,0.0001663465,8.199399e-7,0.000017955945,0.0023940722],"genre_scores_gemma":[0.9995853,0.000011980791,0.00031070964,0.000017557259,0.0000033027711,0.0000050757944,2.1125162e-7,0.000007250818,0.000058644764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850434,0.00019106995,0.00035012056,0.00019257992,0.00043460575,0.00032729388],"domain_scores_gemma":[0.997636,0.0013854364,0.00016423076,0.0006618944,0.000111979876,0.000040424584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027836524,0.00009329873,0.00014527823,0.00008231101,0.000110226145,0.000029644698,0.0014270425,0.000045514455,0.000004326146],"category_scores_gemma":[0.00026059043,0.00005809959,0.00006286936,0.0007273291,0.00022717504,0.00019005493,0.00049688376,0.00031452067,0.0000065558597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033775417,0.000042579228,0.043490015,0.0000072778953,0.000017136525,0.0000090294425,0.002934704,0.000022172935,0.0007064148,0.9395482,0.000042696858,0.013146001],"study_design_scores_gemma":[0.00058270217,0.00006469608,0.053203426,0.000040039515,0.000001972511,0.000013632023,0.0017240549,0.00064233737,0.021225309,0.92224985,0.00015714059,0.00009486017],"about_ca_topic_score_codex":0.00006905146,"about_ca_topic_score_gemma":0.00015451004,"teacher_disagreement_score":0.020518893,"about_ca_system_score_codex":0.00004763776,"about_ca_system_score_gemma":0.00004310241,"threshold_uncertainty_score":0.26518238},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09513094,0.00022759852,0.89839333,0.001071213,0.0017931409,0.0003725241,0.000070438575,0.00021373446,0.0027270492],"genre_scores_gemma":[0.9960508,0.000047527676,0.003087186,0.00056742394,0.000006900241,0.000023196648,0.00005031403,0.000008935038,0.00015773167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998687,0.0001814799,0.00021129381,0.00038940652,0.00023225692,0.00029851584],"domain_scores_gemma":[0.99891835,0.00045576057,0.000080065765,0.0003636448,0.000079507896,0.00010264837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005189982,0.00015368662,0.00018800277,0.00017122563,0.0002904841,0.0004219698,0.00042276116,0.00004563293,0.000027496986],"category_scores_gemma":[0.0003096818,0.00014613452,0.000039511993,0.0007095819,0.000048169153,0.0006793476,0.00022250977,0.00016206075,0.000028070406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030110582,0.0000638281,0.004195371,0.000010370458,0.000043696436,0.00003303994,0.00013621771,0.00000510893,0.00003024834,0.9892779,0.0049413526,0.0012598274],"study_design_scores_gemma":[0.010336858,0.00021315667,0.021709807,0.0000811798,0.00010442146,0.00005022959,0.0002783196,0.016835611,0.00142877,0.8820385,0.0657868,0.0011363529],"about_ca_topic_score_codex":0.000018766772,"about_ca_topic_score_gemma":8.6983664e-7,"teacher_disagreement_score":0.90091985,"about_ca_system_score_codex":0.000029382702,"about_ca_system_score_gemma":0.00002689865,"threshold_uncertainty_score":0.5959193},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9869067,0.00010555101,0.00006210034,0.00014721317,0.0018850309,0.000082279206,0.000001159172,0.00013414373,0.010675788],"genre_scores_gemma":[0.9984744,0.000019435392,0.0011509989,0.00006276153,0.000005753905,0.000003534902,0.0000013638294,0.0000074493146,0.00027426562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989011,0.000043509546,0.0002668372,0.00026652013,0.0002692609,0.00025274354],"domain_scores_gemma":[0.99926305,0.000052951735,0.00006524682,0.00047768664,0.00004576676,0.00009528023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019403874,0.000116332514,0.00017898915,0.00007396307,0.00008302002,0.000044627184,0.000495871,0.00005408044,0.00015357885],"category_scores_gemma":[0.00001314375,0.00011383883,0.00006800816,0.00046475168,0.00005565836,0.00019536499,0.00005971376,0.00010698445,0.00019707513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071004874,0.00010409519,0.00084956177,0.000010888504,0.000013442809,0.00000966,0.00070291676,0.00016725874,0.00054180727,0.9882271,0.0029368573,0.006429299],"study_design_scores_gemma":[0.0007467962,0.00013366579,0.0013321296,0.000041711293,0.0000066800653,0.00001273977,0.000021364762,0.0019486666,0.004054519,0.9895879,0.001920196,0.00019360054],"about_ca_topic_score_codex":0.00005527808,"about_ca_topic_score_gemma":0.0000027652359,"teacher_disagreement_score":0.011567702,"about_ca_system_score_codex":0.000009615542,"about_ca_system_score_gemma":0.000026335892,"threshold_uncertainty_score":0.4642213},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99232024,0.00042552158,0.001037719,0.0009175553,0.0002897969,0.00020821443,0.000008584371,0.000042777323,0.0047495766],"genre_scores_gemma":[0.9984263,0.00002850443,0.0007740973,0.00010097513,0.00005129606,0.000058995527,0.0000062208373,0.000012362725,0.00054121856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950427,0.000012286247,0.00012761934,0.00012377182,0.00008082263,0.00015121764],"domain_scores_gemma":[0.9995971,0.000078542784,0.00005075524,0.00020207095,0.000024694846,0.000046869915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006822318,0.00009307496,0.00011261181,0.000009950659,0.0002674223,0.000069365,0.0001221269,0.000016827482,0.00006734449],"category_scores_gemma":[0.00000764695,0.00006811467,0.000043339878,0.00007515653,0.000099607234,0.00015978704,0.00008179088,0.00008716395,0.00003013503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001285516,0.000032497283,0.00021020396,0.000004727156,0.000017209783,2.4771444e-7,0.00025928832,0.00001620626,0.00014568932,0.9989106,0.00021078385,0.00019122937],"study_design_scores_gemma":[0.00044605628,0.000007776959,0.00011830993,0.000010870503,0.000013478646,8.1937037e-7,0.0005200923,0.000017823935,0.0010480894,0.99648273,0.0012440205,0.00008995862],"about_ca_topic_score_codex":0.000059230544,"about_ca_topic_score_gemma":7.434472e-7,"teacher_disagreement_score":0.006106075,"about_ca_system_score_codex":0.000014203653,"about_ca_system_score_gemma":0.000015750544,"threshold_uncertainty_score":0.27776358},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9661874,0.00033524464,0.000054574877,0.000009060201,0.002395174,0.00012511107,0.000007848132,0.00013215514,0.03075339],"genre_scores_gemma":[0.99977666,0.000010104932,0.000098677345,0.000019942188,0.0000037272077,0.000008814486,0.0000061297615,0.000024409906,0.00005152468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992756,0.000052501513,0.00023450452,0.00010495959,0.00012709388,0.00020533474],"domain_scores_gemma":[0.999592,0.000041627718,0.00003505871,0.00024734752,0.000027632439,0.000056317458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022458173,0.00012135095,0.00018935095,0.00006253717,0.00003983986,0.000009781977,0.00013902286,0.000047390957,0.00019730201],"category_scores_gemma":[0.000010385092,0.00012958172,0.00006631277,0.0001844107,0.0000341636,0.00007442747,0.000013114654,0.00009352327,0.00004565112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004845519,0.00004102831,0.0051532965,0.000091928894,0.0000679831,0.000005199725,0.00031515778,0.00009547239,0.004454787,0.9859258,0.0035711878,0.00027330357],"study_design_scores_gemma":[0.0010817583,0.00009319415,0.0011570719,0.000057638532,0.000024679606,0.000013350559,0.00042015736,0.00019387942,0.040168073,0.9253231,0.031181699,0.00028536064],"about_ca_topic_score_codex":0.000013994376,"about_ca_topic_score_gemma":0.0000022086053,"teacher_disagreement_score":0.060602672,"about_ca_system_score_codex":0.000024362773,"about_ca_system_score_gemma":0.000006739201,"threshold_uncertainty_score":0.52841896},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96759915,0.00020083958,0.028662125,0.00016812631,0.0006391183,0.0001592363,6.449924e-7,0.0001925078,0.0023782614],"genre_scores_gemma":[0.9697002,0.000020433752,0.030059224,0.000030897376,0.000007304444,0.000007633619,0.0000014990676,0.0000075081953,0.00016525296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900734,0.0000697394,0.00018127792,0.0002674809,0.0002822804,0.00019188733],"domain_scores_gemma":[0.9992015,0.00009888025,0.00011722995,0.00040939427,0.00008145779,0.00009157648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017280699,0.00013264715,0.00016180046,0.00012544707,0.0001540251,0.000027985565,0.00059471396,0.000055267723,0.000030382922],"category_scores_gemma":[0.000012729448,0.00011421492,0.00006359681,0.0006089805,0.00010690374,0.00052944245,0.00011053334,0.00013118098,0.000021775253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037557056,0.000093416864,0.007779927,0.000007413967,0.000022560322,0.000040906663,0.0010130929,0.0004200901,0.00060904806,0.98542035,0.00075626664,0.0037994005],"study_design_scores_gemma":[0.0038714956,0.0042738123,0.08572692,0.0002083593,0.000060458693,0.00031822393,0.0001531833,0.013189307,0.01564047,0.8722585,0.0032308884,0.0010684216],"about_ca_topic_score_codex":0.000030493291,"about_ca_topic_score_gemma":9.329494e-7,"teacher_disagreement_score":0.113161854,"about_ca_system_score_codex":0.000016310412,"about_ca_system_score_gemma":0.00016045547,"threshold_uncertainty_score":0.46575493},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74093264,0.000079208854,0.0014027173,0.030432096,0.0006608347,0.0014030333,0.000010984406,0.00030625524,0.22477224],"genre_scores_gemma":[0.9945192,0.000013500197,0.0016773345,0.00030547773,0.000020414762,0.00005021359,0.0000019715544,0.00003003043,0.0033819026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912643,0.00006510058,0.00018089157,0.00019658578,0.00023520314,0.00019581318],"domain_scores_gemma":[0.9983045,0.0008135785,0.00010638669,0.00060346,0.00008400979,0.000088098175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027824947,0.00015296167,0.00017161234,0.000038056347,0.00019403888,0.00005233816,0.000301191,0.00006584981,0.0005087042],"category_scores_gemma":[0.0002946417,0.000102156,0.000079781494,0.00026301143,0.00003584094,0.000029511262,0.00004751054,0.00019532636,0.00022370968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034795505,0.00012340552,0.000019818992,0.000004563511,0.000027103983,0.0000026599578,0.0007793,5.077082e-7,0.00004383668,0.87280977,0.12602593,0.00015959628],"study_design_scores_gemma":[0.00043669762,0.000053741685,0.000102513884,0.000026956708,0.00002354945,0.000009612969,0.0005301166,0.00011821044,0.0003839194,0.98301774,0.0151710445,0.00012588552],"about_ca_topic_score_codex":0.000052835276,"about_ca_topic_score_gemma":0.000013548488,"teacher_disagreement_score":0.25358653,"about_ca_system_score_codex":0.000088540444,"about_ca_system_score_gemma":0.000063200576,"threshold_uncertainty_score":0.55699545},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97425175,0.000040302235,0.00025513142,0.00014828905,0.000122287,0.00023898398,0.00001028392,0.000062442814,0.024870541],"genre_scores_gemma":[0.9969728,0.000021064723,0.0017765269,0.00006136285,0.0000041818325,0.00005327644,0.0000019003469,0.000016994934,0.0010918842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992604,0.000051606814,0.00023207784,0.00015426548,0.00015451228,0.00014710156],"domain_scores_gemma":[0.99910754,0.0002498943,0.000102089194,0.0004392089,0.000047499325,0.000053763317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020014904,0.00010997839,0.00021075028,0.00007236064,0.00007671367,0.00000853332,0.00017947487,0.00006510537,0.000078756246],"category_scores_gemma":[0.0000936611,0.00009875008,0.000128237,0.00019318958,0.000060243972,0.000040077175,0.00002324844,0.00011089525,0.000023062748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030890402,0.00037842928,0.000048950966,0.000016957769,0.000025635174,5.851275e-7,0.0002932684,0.000044883916,0.0013194071,0.99128354,0.0063672853,0.000190181],"study_design_scores_gemma":[0.0015046179,0.000048342317,0.00001820134,0.000022170627,0.000028001275,0.0000010948243,0.000012794181,0.014705301,0.0027959743,0.9806081,0.00015422521,0.00010118309],"about_ca_topic_score_codex":0.0000023103248,"about_ca_topic_score_gemma":7.6495013e-7,"teacher_disagreement_score":0.023778656,"about_ca_system_score_codex":0.000009282663,"about_ca_system_score_gemma":0.0000052000028,"threshold_uncertainty_score":0.40269116},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9977988,0.000070621165,0.000006616483,0.00054017943,0.0003980071,0.00015244806,5.0630587e-7,0.00002008096,0.0010127182],"genre_scores_gemma":[0.99960905,0.000008404429,0.00023145176,0.0000876225,5.413987e-7,0.000004289953,2.9567883e-7,0.000005098337,0.000053250125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991216,0.00011233632,0.00019836624,0.00019919044,0.00024080873,0.0001276872],"domain_scores_gemma":[0.9991165,0.00015706729,0.00012580151,0.000492514,0.00008247155,0.00002567603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004103231,0.00008610963,0.00011675689,0.000048121652,0.00015134901,0.000029295341,0.0004045338,0.000027314414,0.0000033960457],"category_scores_gemma":[0.000073097064,0.000051735606,0.0000496971,0.00041105814,0.00012315935,0.000104948194,0.00006080363,0.00009252763,0.0000012114058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061174746,0.000064503445,0.009385651,0.00001436523,0.000011818491,4.1330748e-7,0.0016472596,0.00007552012,0.0007841441,0.96125114,0.00019836116,0.026560714],"study_design_scores_gemma":[0.0007167388,0.00012268129,0.032639123,0.00010579929,0.000014154171,0.0000038134579,0.000036736546,0.002182439,0.01356609,0.950428,0.00007284297,0.00011155895],"about_ca_topic_score_codex":0.0000558495,"about_ca_topic_score_gemma":0.00000445892,"teacher_disagreement_score":0.026449155,"about_ca_system_score_codex":0.0000074726177,"about_ca_system_score_gemma":0.000023392879,"threshold_uncertainty_score":0.21097168},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9904334,0.00035393515,0.0022456476,0.00024866083,0.0007758798,0.0000942891,8.766405e-7,0.000111288326,0.0057360013],"genre_scores_gemma":[0.9969633,0.00006079043,0.002815995,0.00008715589,0.000005019998,0.000005777267,6.547884e-7,0.000007972999,0.000053289852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989668,0.00008848431,0.00021784654,0.00028846227,0.00019781472,0.00024056833],"domain_scores_gemma":[0.99905795,0.00021843203,0.00011143136,0.00044768993,0.00007440516,0.000090073176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048902805,0.00012911597,0.00019092087,0.00013220316,0.00013051958,0.00006557343,0.00053441135,0.000057302612,0.000015218625],"category_scores_gemma":[0.000069357346,0.00012805196,0.00006666668,0.00055694894,0.00009159725,0.00031742832,0.00027233164,0.00011835209,0.0000090070525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009629285,0.00006760217,0.00811339,0.000011865929,0.0000151817885,0.000014908362,0.00071520056,0.0000014532051,0.00096974405,0.9553386,0.00019717596,0.034545276],"study_design_scores_gemma":[0.0008123119,0.00018565678,0.010757964,0.00005995328,0.000010192024,0.00004033752,0.000080767204,0.0016335318,0.0027711194,0.9819343,0.0015021913,0.00021163639],"about_ca_topic_score_codex":0.000013297415,"about_ca_topic_score_gemma":0.0000015467253,"teacher_disagreement_score":0.03433364,"about_ca_system_score_codex":0.000010885867,"about_ca_system_score_gemma":0.000021920678,"threshold_uncertainty_score":0.5221808},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9966365,0.0005349542,0.00021540136,0.00017348058,0.0014033286,0.00012865743,2.7380293e-7,0.0001589678,0.0007484404],"genre_scores_gemma":[0.99862105,0.000008185591,0.0010496342,0.00023608727,7.582394e-7,0.0000046728596,4.3257637e-7,0.000008823412,0.00007033586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987972,0.000034859844,0.000298376,0.00024366974,0.0003476054,0.0002783257],"domain_scores_gemma":[0.99906945,0.000075514494,0.00011383428,0.00055563264,0.00009621642,0.00008935259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058837014,0.00012533087,0.00018216556,0.00022399914,0.00008786651,0.00003320059,0.0005148923,0.000059301274,0.0000030485119],"category_scores_gemma":[0.000060800525,0.00010011393,0.00007530636,0.0004931986,0.000078344405,0.00022177299,0.00010928083,0.00009881915,0.000053271375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062191207,0.00015173494,0.000110346344,0.000029416502,0.000013870713,0.0000055859773,0.00031337523,0.000012367842,0.017117567,0.98115534,0.0004647025,0.0006194829],"study_design_scores_gemma":[0.00043540273,0.00021829373,0.0005008836,0.000111358255,0.000004244273,0.0000032548407,0.000014241759,0.00043366276,0.10732748,0.89080614,0.000023113838,0.000121929654],"about_ca_topic_score_codex":0.000025160276,"about_ca_topic_score_gemma":9.982169e-7,"teacher_disagreement_score":0.0903492,"about_ca_system_score_codex":0.000016271882,"about_ca_system_score_gemma":0.000031278618,"threshold_uncertainty_score":0.40825275},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9980299,0.00010582351,0.00021993228,0.00004515857,0.0006695407,0.00012255891,7.3492413e-7,0.000041095554,0.00076529675],"genre_scores_gemma":[0.9979579,0.000005927297,0.0019791902,0.000037569607,2.6677833e-7,0.0000022639126,4.1747893e-7,0.0000051706443,0.000011337065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988849,0.000046467772,0.00040155175,0.00021826327,0.00023704708,0.00021176907],"domain_scores_gemma":[0.99894184,0.00034266236,0.00016827507,0.00039413208,0.00009419373,0.000058909623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009792869,0.0000952836,0.00022763842,0.00032079415,0.000031162213,0.000008226596,0.00041474652,0.000069606474,0.0000017274564],"category_scores_gemma":[0.00012924297,0.00009033575,0.000069564434,0.0007525945,0.000060182683,0.00008810026,0.000102603284,0.00011709032,0.0000033060473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027778597,0.00030704556,0.010509133,0.000017843842,0.000007124805,0.000006734899,0.00034555537,0.0000880521,0.0050460063,0.98228216,0.00007453973,0.00128805],"study_design_scores_gemma":[0.0017171318,0.00023764554,0.023271874,0.00008792754,0.0000025607446,9.901272e-7,0.000019468263,0.0012148758,0.078785546,0.8945476,0.000009965558,0.000104404964],"about_ca_topic_score_codex":0.00010532384,"about_ca_topic_score_gemma":0.000017338276,"teacher_disagreement_score":0.08773453,"about_ca_system_score_codex":0.000017507582,"about_ca_system_score_gemma":0.000025291962,"threshold_uncertainty_score":0.3683785},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99452466,0.00017934547,0.000077533805,0.0008969352,0.0011791355,0.000106407366,2.541405e-7,0.00010716868,0.0029285902],"genre_scores_gemma":[0.99898934,0.00007953699,0.00065142877,0.000064952386,4.4238112e-7,0.000012560153,5.990911e-7,0.000005404786,0.00019575936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990204,0.00006188056,0.0002156791,0.00022045386,0.00031171317,0.00016988177],"domain_scores_gemma":[0.998829,0.00013720276,0.00012905251,0.0007182388,0.00013451476,0.000051996903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034403245,0.00008499535,0.00010147393,0.00006908086,0.00035088792,0.000025976911,0.00060706376,0.000046828307,8.167016e-7],"category_scores_gemma":[0.000058437574,0.000060091694,0.000062526844,0.00047365887,0.00014020146,0.000108127926,0.000072180315,0.00010492458,0.000027219843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047662356,0.00006057224,0.00060363737,0.000002034673,0.0000077549985,0.0000021262824,0.00013108194,0.000008689342,0.0025932172,0.9933968,0.0022947271,0.0008945889],"study_design_scores_gemma":[0.0003135016,0.00015117596,0.015279449,0.000013528212,0.000002460044,0.000005121782,0.000011905306,0.0010152119,0.0093543455,0.97222173,0.0015510505,0.000080511614],"about_ca_topic_score_codex":0.000011801059,"about_ca_topic_score_gemma":5.297122e-7,"teacher_disagreement_score":0.021175064,"about_ca_system_score_codex":0.000013684399,"about_ca_system_score_gemma":0.00003280679,"threshold_uncertainty_score":0.26987818},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9934102,0.0009345471,0.000017822329,0.0009113905,0.0018844244,0.00011961377,0.0000013361985,0.00031398825,0.0024066682],"genre_scores_gemma":[0.998355,0.00008302885,0.0008792222,0.00039620278,4.353278e-7,0.0000060915113,0.0000011259483,0.000014605081,0.0002643118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850976,0.0000650836,0.00036432873,0.00038672914,0.00037068667,0.00030339175],"domain_scores_gemma":[0.9987642,0.0001248368,0.00016204143,0.0007125717,0.00011637072,0.00011997475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002791331,0.00016222843,0.00022745195,0.00021018469,0.000126178,0.000045995126,0.00064766157,0.00010599339,0.000033360055],"category_scores_gemma":[0.00007358458,0.0001524837,0.000104797364,0.00072250626,0.000079101235,0.00026081246,0.00012909423,0.00021451656,0.00024572137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023468065,0.00024824517,0.00014502546,0.000007630998,0.000021618625,0.000011737028,0.00033198908,0.00008528706,0.0013293104,0.9923911,0.0041207816,0.0013049018],"study_design_scores_gemma":[0.0010052605,0.00024913583,0.00016211027,0.00004487872,0.000007396415,0.0000059731683,0.000003671502,0.012401195,0.00454648,0.98128945,0.00011087273,0.0001735716],"about_ca_topic_score_codex":0.000030854048,"about_ca_topic_score_gemma":2.0559901e-7,"teacher_disagreement_score":0.0123159075,"about_ca_system_score_codex":0.000016561557,"about_ca_system_score_gemma":0.0000117601685,"threshold_uncertainty_score":0.62181044},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85195,0.0012333953,0.017730573,0.0034894415,0.018506868,0.0034148004,0.00001229904,0.00051051506,0.103152126],"genre_scores_gemma":[0.99022406,0.000023857205,0.005212355,0.0007948514,0.000010414838,0.0001586909,0.0000026993257,0.00007183437,0.0035012225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923287,0.0013936434,0.0011667612,0.0021690738,0.0011397165,0.0018020828],"domain_scores_gemma":[0.9914708,0.0038756786,0.000574497,0.002973326,0.0007111553,0.00039451473],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.004610746,0.00076543255,0.0009032663,0.000866861,0.0022741572,0.0019263887,0.007946057,0.00034342395,0.000097317046],"category_scores_gemma":[0.0049807224,0.0008667196,0.00024343314,0.00494618,0.0004457547,0.0015607012,0.007142458,0.0020074951,0.00035599188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014239336,0.0004669202,0.00029689152,0.00013335102,0.00010697978,0.000075042386,0.0013536043,0.0003704662,0.0006498423,0.87112683,0.00078607065,0.12449163],"study_design_scores_gemma":[0.0032928633,0.000722965,0.00040560067,0.0012891827,0.000026041294,0.000010996697,0.00050557905,0.078576595,0.0105246855,0.90358275,0.00035233653,0.00071039185],"about_ca_topic_score_codex":0.00008105099,"about_ca_topic_score_gemma":0.000013596415,"teacher_disagreement_score":0.1382741,"about_ca_system_score_codex":0.00062429305,"about_ca_system_score_gemma":0.00082861335,"threshold_uncertainty_score":0.9993783},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9561741,0.009377198,0.0062470613,0.00524323,0.0058421493,0.005433043,0.001221341,0.0006798847,0.009782034],"genre_scores_gemma":[0.98175174,0.0038126253,0.0047926926,0.00047107518,0.0008457061,0.0015125767,0.00048895384,0.0003836675,0.0059409775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98680073,0.000737132,0.0045247525,0.002958236,0.0019666485,0.0030125016],"domain_scores_gemma":[0.98993576,0.0010138992,0.0025914737,0.0036826162,0.0016124428,0.0011638243],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0013337849,0.0027364213,0.0042164843,0.0010946566,0.0018770387,0.000779405,0.003253997,0.0011025924,0.00029586913],"category_scores_gemma":[0.00047845097,0.00248941,0.00165356,0.0041093775,0.0025591804,0.0016211602,0.0018895519,0.0018978055,0.00047280008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044295008,0.0035618064,0.00041122598,0.0010778594,0.0013045168,0.00001768085,0.0009817277,0.0012638905,0.046350367,0.93792,0.003710737,0.0029572716],"study_design_scores_gemma":[0.0065297494,0.00071834784,0.000279405,0.0018323613,0.0011721576,0.000011924878,0.0011813211,0.035600703,0.019862065,0.8029688,0.12721315,0.0026300238],"about_ca_topic_score_codex":0.00012739308,"about_ca_topic_score_gemma":0.00003836879,"teacher_disagreement_score":0.13495117,"about_ca_system_score_codex":0.00050395215,"about_ca_system_score_gemma":0.0015232895,"threshold_uncertainty_score":0.9994224},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79798275,0.0033837443,0.009177029,0.013077249,0.04203552,0.0036877326,0.000017268207,0.00070617883,0.12993251],"genre_scores_gemma":[0.99095124,0.0004185722,0.0002928072,0.0006378626,0.000010381015,0.0001382051,0.0000015558545,0.000038407714,0.0075109643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941436,0.0011433925,0.0008253228,0.0011402665,0.001258495,0.0014889444],"domain_scores_gemma":[0.99173653,0.0040337113,0.00026640572,0.0032612483,0.00039810318,0.00030400857],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002093084,0.00057145883,0.0005410303,0.0003170052,0.0016429124,0.0010081627,0.004536151,0.00024422506,0.00008374977],"category_scores_gemma":[0.00082561345,0.00044857222,0.00036557473,0.0038870727,0.0010036484,0.00053324725,0.0013382315,0.001251882,0.0013998381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017940984,0.00032952486,0.0009193366,0.000051504045,0.00018927833,0.000044388133,0.00044773647,0.00003959881,0.00006778734,0.97067755,0.005007568,0.022046335],"study_design_scores_gemma":[0.0018385497,0.0002795876,0.002074381,0.0002955766,0.000028507022,0.000008834936,0.00009241934,0.0071800277,0.0012717199,0.97816294,0.008353951,0.0004134835],"about_ca_topic_score_codex":0.000016531878,"about_ca_topic_score_gemma":0.000006647803,"teacher_disagreement_score":0.19296847,"about_ca_system_score_codex":0.000246914,"about_ca_system_score_gemma":0.00044118505,"threshold_uncertainty_score":0.9997966},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9838578,0.0031816717,0.0030556854,0.0017695454,0.005160923,0.0006133456,0.000011945749,0.00017612531,0.0021729374],"genre_scores_gemma":[0.9934169,0.00014178877,0.0046456372,0.0004536865,0.0000030586511,0.000014793701,0.000008943275,0.00003115381,0.0012840095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99546134,0.00037761094,0.0009830527,0.0012722756,0.0010104054,0.00089528266],"domain_scores_gemma":[0.99538517,0.00029976925,0.0005152669,0.0020065669,0.00149565,0.00029755424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010685659,0.0006072876,0.0009257408,0.0005128146,0.0004250916,0.00024991573,0.0013810282,0.00032365115,0.00007530817],"category_scores_gemma":[0.00018845873,0.0005497337,0.0002231312,0.0031379694,0.0007579028,0.00046262247,0.0008337552,0.0005588372,0.00007334373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019295707,0.00089530036,0.011634205,0.0002449359,0.0002789504,0.0000836964,0.00050501514,0.00045026967,0.0015919342,0.97754514,0.004179364,0.0023982262],"study_design_scores_gemma":[0.0041070487,0.0009002169,0.005848038,0.0009598469,0.00022514623,0.000029547165,0.000095325486,0.0145646855,0.014830213,0.95698464,0.0007684805,0.000686826],"about_ca_topic_score_codex":0.00034305322,"about_ca_topic_score_gemma":0.00003145382,"teacher_disagreement_score":0.02056052,"about_ca_system_score_codex":0.000088426765,"about_ca_system_score_gemma":0.00097398483,"threshold_uncertainty_score":0.9996954},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95254433,0.002669552,0.00012015439,0.004427515,0.020939844,0.0007724222,0.000005261712,0.00022013648,0.018300807],"genre_scores_gemma":[0.9961098,0.00014255804,0.0006997174,0.0005531826,0.0000017109743,0.000028623575,0.0000024113326,0.00002215603,0.0024398663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961272,0.00022346868,0.0009454423,0.0012556445,0.00070342986,0.0007448194],"domain_scores_gemma":[0.9962017,0.00035519767,0.00041610244,0.001982052,0.00086067716,0.00018427634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001116325,0.00046980972,0.0006780036,0.00079392357,0.00036034815,0.00017138457,0.0015699407,0.00025984348,0.000018665278],"category_scores_gemma":[0.000555663,0.00047750678,0.00023437141,0.004063951,0.00039437358,0.0003220728,0.0006726005,0.0005448059,0.00010323957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060722115,0.0010074987,0.0008076923,0.00027565213,0.00012091781,0.000011448851,0.00035153993,0.00008087187,0.0026959889,0.97911847,0.012813741,0.0026554703],"study_design_scores_gemma":[0.0017276575,0.0007348889,0.0013222806,0.0007523946,0.00006448007,0.0000021211258,0.000018657342,0.00079390424,0.055225227,0.9374847,0.0014939363,0.00037979],"about_ca_topic_score_codex":0.00009803583,"about_ca_topic_score_gemma":0.0000015972166,"teacher_disagreement_score":0.05252924,"about_ca_system_score_codex":0.00006896648,"about_ca_system_score_gemma":0.00053697726,"threshold_uncertainty_score":0.99976766},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80590487,0.004063393,0.0014273602,0.0027817301,0.0635145,0.003597487,0.000077200035,0.0011007475,0.11753271],"genre_scores_gemma":[0.9675731,0.00041160916,0.013377591,0.0007611582,0.00004970441,0.0002140628,0.000025666206,0.00026822893,0.017318862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99331087,0.00055737095,0.002169295,0.0013074153,0.0011053061,0.0015497283],"domain_scores_gemma":[0.9922594,0.0023839774,0.000933077,0.0031569952,0.0008367382,0.0004298124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012214887,0.0012344945,0.0018011316,0.0005201658,0.0007084707,0.00036073665,0.0019091313,0.0009062315,0.0004928797],"category_scores_gemma":[0.0031268767,0.0013950506,0.0005894649,0.002205791,0.00036720166,0.00054635777,0.0011170682,0.0012493017,0.00070703344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009860921,0.0015535427,0.00022415692,0.0012724429,0.00053521566,0.0000564262,0.0012044726,0.000021316826,0.00044922726,0.9475454,0.045930877,0.0011083299],"study_design_scores_gemma":[0.005503467,0.00021493484,0.00007549072,0.0010782965,0.0006831762,0.000011774069,0.0004691598,0.002010335,0.004400673,0.9707694,0.013654015,0.0011292599],"about_ca_topic_score_codex":0.00002100135,"about_ca_topic_score_gemma":0.000007456218,"teacher_disagreement_score":0.16166826,"about_ca_system_score_codex":0.0008952102,"about_ca_system_score_gemma":0.0007877413,"threshold_uncertainty_score":0.99884987},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96141636,0.0030592096,0.0006177115,0.008777101,0.004076292,0.007068194,0.0019159338,0.00061047653,0.012458717],"genre_scores_gemma":[0.9869023,0.0032712228,0.0011702897,0.0006070759,0.00028439178,0.0012328541,0.00029715657,0.00042064773,0.0058140894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98476636,0.0022807866,0.004698561,0.0028341855,0.0025255524,0.0028945438],"domain_scores_gemma":[0.98298556,0.0052949856,0.003233556,0.005945238,0.0016016868,0.00093894993],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow","sts","research_integrity"],"category_scores_codex":[0.0040740212,0.0028712347,0.0038462186,0.00200849,0.0037956918,0.0012460503,0.0050551645,0.0016729633,0.0002527829],"category_scores_gemma":[0.0011493276,0.0022600004,0.0019384316,0.0068754,0.0045312094,0.0012774084,0.0021665485,0.002882938,0.000121520716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013879874,0.0041211885,0.0018294905,0.0008626436,0.0015355567,0.000032831795,0.0056172227,0.00029366926,0.0076656784,0.9649354,0.010164221,0.0015540808],"study_design_scores_gemma":[0.021351771,0.0009622515,0.010941542,0.0018102849,0.0040141246,0.000084955616,0.0040135486,0.033585656,0.0063451314,0.8429694,0.070998006,0.002923312],"about_ca_topic_score_codex":0.0001482833,"about_ca_topic_score_gemma":0.005034182,"teacher_disagreement_score":0.12196602,"about_ca_system_score_codex":0.000570972,"about_ca_system_score_gemma":0.0013892477,"threshold_uncertainty_score":0.9997907},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9094958,0.0018068833,0.00063319085,0.0012241454,0.022555128,0.0020502827,0.00005169272,0.0002337315,0.061949152],"genre_scores_gemma":[0.99259895,0.00016622528,0.00022555573,0.00019310533,0.000097670694,0.000121089826,0.000008848536,0.00007723912,0.0065113404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995582,0.0010818794,0.0012356269,0.0006563553,0.0005832006,0.00086094707],"domain_scores_gemma":[0.9939195,0.002954947,0.0005880899,0.0019783808,0.00042725302,0.00013182359],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0022345474,0.00063233095,0.0007867309,0.0002920567,0.0024890841,0.00039919984,0.0016782974,0.0004960137,0.0003734309],"category_scores_gemma":[0.0006509592,0.00052833924,0.0005377264,0.0016722445,0.0010465519,0.00031788414,0.00069489115,0.0010702218,0.00016096937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009358485,0.0005537018,0.00047603692,0.00025993356,0.00047566294,0.000006423145,0.0017060318,0.000007792948,0.0006070492,0.9882089,0.007336441,0.00026844343],"study_design_scores_gemma":[0.0023852463,0.00006437129,0.00015051394,0.00033967313,0.00093668373,0.000007967723,0.0036688556,0.00074435014,0.0018288487,0.9846478,0.0047528693,0.00047279545],"about_ca_topic_score_codex":0.000043814805,"about_ca_topic_score_gemma":0.0000068296,"teacher_disagreement_score":0.083103135,"about_ca_system_score_codex":0.00025531818,"about_ca_system_score_gemma":0.00042121168,"threshold_uncertainty_score":0.9997168},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95254534,0.0030135266,0.0017655839,0.0013073249,0.012524571,0.0026237934,0.000043545173,0.00036736036,0.025808929],"genre_scores_gemma":[0.99100006,0.00041087423,0.0050948146,0.00022192494,0.000047018886,0.00020594356,0.000014102343,0.00017415818,0.002831127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937579,0.0004208564,0.0023108006,0.0012516507,0.00088381587,0.0013749499],"domain_scores_gemma":[0.99287707,0.0038081666,0.00085492554,0.0015505973,0.00060355815,0.0003056807],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016034833,0.0010447494,0.0016757183,0.00085575215,0.000709489,0.00045319568,0.0009218196,0.00073330716,0.00013457371],"category_scores_gemma":[0.0047769095,0.001241933,0.00025400956,0.0023176973,0.0004888404,0.00080285437,0.00090993673,0.0014414567,0.00013090785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053121366,0.0012045524,0.003290302,0.0016351878,0.00020136949,0.00008620882,0.0037746937,0.000039841765,0.0002577266,0.9868229,0.0014067822,0.001227307],"study_design_scores_gemma":[0.0051384214,0.00017617126,0.0011652894,0.0020133036,0.00037135993,0.000025411651,0.002598449,0.0055980254,0.00068456837,0.9793201,0.0019102538,0.0009986552],"about_ca_topic_score_codex":0.00007508433,"about_ca_topic_score_gemma":0.00005831058,"teacher_disagreement_score":0.03845467,"about_ca_system_score_codex":0.0008261838,"about_ca_system_score_gemma":0.0006430359,"threshold_uncertainty_score":0.99900305},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914164,0.00081369345,0.00016393224,0.0003398372,0.004162976,0.0002186037,0.0000062840554,0.000083553125,0.0027947451],"genre_scores_gemma":[0.999747,0.00002014681,0.000062124156,0.00005045529,0.0000071685317,0.000009442273,4.054892e-7,0.000009234206,0.000094059564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998568,0.0001911657,0.000332488,0.00025972424,0.00041771756,0.00023089848],"domain_scores_gemma":[0.99857056,0.000086454755,0.000216837,0.00094280456,0.00012665277,0.000056691286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034611678,0.0001506618,0.00024932311,0.0000596365,0.00013840751,0.000039534734,0.0016276733,0.00007491543,0.00002305562],"category_scores_gemma":[0.00008874232,0.00010681144,0.00017866831,0.0007003061,0.00025587765,0.0002401556,0.00043862252,0.00015948497,0.000008442045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009274281,0.00036053173,0.001745008,0.000025376801,0.000029623521,4.8291093e-7,0.0007721251,0.0000012304134,0.008076813,0.98245966,0.0048600016,0.0016598409],"study_design_scores_gemma":[0.001211393,0.00030163722,0.0008171925,0.00010342215,0.000019764988,0.0000027717435,0.00003536645,0.00070317875,0.1912461,0.8014313,0.0038917358,0.00023613848],"about_ca_topic_score_codex":0.000017085444,"about_ca_topic_score_gemma":5.3929733e-7,"teacher_disagreement_score":0.18316929,"about_ca_system_score_codex":0.000016522168,"about_ca_system_score_gemma":0.000020417237,"threshold_uncertainty_score":0.43556443},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9703555,0.00021741545,0.017800387,0.001404091,0.0038916832,0.0003578219,0.0000070341157,0.00065255206,0.0053135264],"genre_scores_gemma":[0.98949456,0.000025256395,0.008913043,0.00020442558,0.000014522224,0.000016102802,0.000004046015,0.000009847417,0.0013181693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986639,0.00013017349,0.00024315115,0.0003496227,0.00031763324,0.000295516],"domain_scores_gemma":[0.99889755,0.00021271715,0.000106821186,0.00047973281,0.00014276344,0.00016040711],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042849535,0.00013909467,0.00017246895,0.00014746474,0.0003417122,0.00005376898,0.00087155175,0.000074884796,0.000030316793],"category_scores_gemma":[0.00031363085,0.00013859205,0.000059981707,0.0014350456,0.000035182515,0.0004341973,0.00022101903,0.00019123191,0.0008255965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010197199,0.00027657775,0.0074527855,0.0000064331234,0.000031384083,0.00007686962,0.0013191848,0.00012848052,0.00008501921,0.97097814,0.014611207,0.005023699],"study_design_scores_gemma":[0.0022126776,0.000605824,0.05176018,0.00010683046,0.000024543779,0.00008069463,0.000036110494,0.053240865,0.0037367495,0.8628228,0.024072234,0.0013005087],"about_ca_topic_score_codex":0.000016484959,"about_ca_topic_score_gemma":0.000001419951,"teacher_disagreement_score":0.10815538,"about_ca_system_score_codex":0.000060044295,"about_ca_system_score_gemma":0.000087413406,"threshold_uncertainty_score":0.9999524},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9795014,0.0004240514,0.000046575133,0.0005145366,0.0015826898,0.00027317042,0.0000060095454,0.0003574807,0.017294038],"genre_scores_gemma":[0.9966474,0.0001466542,0.00092926965,0.00071290624,0.0000030756635,0.000016976594,0.000009529312,0.000029492267,0.0015047072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973996,0.00013167133,0.00041457225,0.00086458836,0.0005683188,0.00062124577],"domain_scores_gemma":[0.99820095,0.0001939543,0.00012104818,0.0010907811,0.000098380646,0.00029488959],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038566222,0.00036310946,0.00036167697,0.00020414531,0.0003345907,0.00029545193,0.00079610967,0.00017406617,0.00028918957],"category_scores_gemma":[0.000028181623,0.0003409325,0.00013419545,0.0005119858,0.00012598475,0.00045781015,0.0001744475,0.0003315006,0.000987305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048064765,0.00025661977,0.00063972856,0.000014089371,0.000044848566,0.00003021491,0.00023411794,0.00020396759,0.00043384614,0.9815995,0.012299388,0.0041956296],"study_design_scores_gemma":[0.0025255939,0.0005244886,0.0019049792,0.000059255075,0.0000197964,0.000020554857,0.000013744014,0.0043397713,0.0019507948,0.9836796,0.0044777505,0.00048369187],"about_ca_topic_score_codex":0.00011337824,"about_ca_topic_score_gemma":0.0000038708545,"teacher_disagreement_score":0.017145941,"about_ca_system_score_codex":0.00004033686,"about_ca_system_score_gemma":0.000063705265,"threshold_uncertainty_score":0.9999043},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88722175,0.00006363624,0.10133215,0.00013002273,0.0011356827,0.00025204476,0.0000024609262,0.0001450871,0.009717179],"genre_scores_gemma":[0.99731946,0.000006280266,0.0024896197,0.000051427178,0.0000018723815,0.0000062321656,0.0000023818752,0.000010490205,0.00011226086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985201,0.00008565435,0.00025616132,0.00031694878,0.00048478294,0.0003363954],"domain_scores_gemma":[0.99818194,0.00073710614,0.00013228237,0.00062621024,0.0002181674,0.00010427205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086641416,0.00012100136,0.00016661762,0.00023077281,0.00009310515,0.000026206017,0.0007801745,0.000060367434,0.000011233951],"category_scores_gemma":[0.00028290952,0.00012046568,0.000066737855,0.001186746,0.0001435165,0.000311673,0.000105914216,0.0001744688,0.000025044463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061756284,0.00011413972,0.00085715693,0.000009128101,0.000010777818,0.000013376405,0.00020144413,0.0000105303425,0.0015826677,0.9929405,0.00018892088,0.0040095886],"study_design_scores_gemma":[0.0008079522,0.00017168428,0.004981968,0.000023834402,0.0000017424691,0.0000023437951,0.000026462145,0.0003937917,0.02657633,0.96667606,0.00021010474,0.00012772465],"about_ca_topic_score_codex":0.00000844691,"about_ca_topic_score_gemma":0.000007819355,"teacher_disagreement_score":0.1100977,"about_ca_system_score_codex":0.000064967615,"about_ca_system_score_gemma":0.000029299365,"threshold_uncertainty_score":0.4912448},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98722726,0.0011943687,0.000037964608,0.000019980916,0.0011728276,0.00012473522,0.000006217505,0.0002887505,0.009927873],"genre_scores_gemma":[0.999245,0.000029828934,0.0005964389,0.000011287411,0.000014107174,0.000016955406,0.0000041758753,0.00002419062,0.00005802548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99915767,0.000043832326,0.00028704174,0.0001403572,0.0001416241,0.00022944887],"domain_scores_gemma":[0.9994624,0.00007997566,0.000048677808,0.00027153708,0.000061908664,0.00007548982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018578165,0.00015629992,0.00022844884,0.000105457315,0.000043658125,0.000014931518,0.00025104918,0.00009834376,0.00007727745],"category_scores_gemma":[0.000023322693,0.00015514322,0.00009435249,0.0002687664,0.00006784219,0.00015551958,0.000017198317,0.0001246453,0.000065501416],"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.00003450026,0.00017010617,0.005761953,0.00022418486,0.00023598778,0.000016046297,0.001581239,0.009019721,0.11907236,0.8519417,0.0027056357,0.009236565],"study_design_scores_gemma":[0.005585915,0.00051013625,0.027097408,0.0005016706,0.0001616473,0.0000747417,0.0009893242,0.031456664,0.648686,0.2675804,0.01531641,0.0020397154],"about_ca_topic_score_codex":0.000014072678,"about_ca_topic_score_gemma":0.0000121795865,"teacher_disagreement_score":0.5843613,"about_ca_system_score_codex":0.000022715685,"about_ca_system_score_gemma":0.000012762621,"threshold_uncertainty_score":0.6326557},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.887267,0.010164898,0.0041752914,0.030701656,0.012907732,0.00094936864,0.0000017724169,0.0021480145,0.051684245],"genre_scores_gemma":[0.9912113,0.00022660283,0.0029261624,0.00075601175,0.0000037816524,0.00001358493,0.0000010256537,0.000015696607,0.004845868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986227,0.00009557908,0.00024174056,0.0003351824,0.00030270364,0.00040205638],"domain_scores_gemma":[0.99867094,0.00017980726,0.000056868226,0.00087711174,0.00005177334,0.00016351097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048058847,0.00015064234,0.00012718639,0.000064328226,0.0004963314,0.00029877265,0.0011103082,0.0000579433,0.00006676074],"category_scores_gemma":[0.000027410584,0.00010476929,0.00009573475,0.0006160544,0.00011253743,0.00018828077,0.000117522846,0.00017755898,0.00052902306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029234222,0.000022523485,0.00007532556,0.0000021870385,0.000012036642,0.0000054642514,0.00037510524,0.0000159907,0.00005584673,0.9580248,0.014597217,0.026810601],"study_design_scores_gemma":[0.00042711134,0.00004550026,0.00019702042,0.000023572056,0.0000037971542,0.000009491767,0.00001774923,0.0013611902,0.00017861865,0.9666398,0.03094891,0.00014720549],"about_ca_topic_score_codex":0.000053598018,"about_ca_topic_score_gemma":0.0000019642218,"teacher_disagreement_score":0.10394424,"about_ca_system_score_codex":0.000013717485,"about_ca_system_score_gemma":0.000070005735,"threshold_uncertainty_score":0.6799698},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9951535,0.0006388211,0.0000295431,0.00027635062,0.0014153178,0.00006139848,2.5678307e-7,0.00008037816,0.002344418],"genre_scores_gemma":[0.9985765,0.000064156855,0.0010682894,0.00006596033,2.824051e-7,0.0000027770454,3.2691136e-7,0.000006542635,0.00021516607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999071,0.000056479683,0.00024574838,0.00021673896,0.00020937144,0.00020068888],"domain_scores_gemma":[0.9991323,0.00014777495,0.00009546541,0.00044126256,0.00011523187,0.00006796887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033624578,0.00009517429,0.00012419047,0.00003592453,0.0006929997,0.00009572298,0.00033691945,0.00006385794,0.0000046293485],"category_scores_gemma":[0.000050139683,0.00006781834,0.000052020034,0.00041362326,0.00039301277,0.00017503402,0.00015329507,0.00013665651,0.000014139325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031718519,0.00003391437,0.009050955,0.0000029070288,0.000015697264,0.000011394235,0.00069175253,0.0000037784862,0.00031260026,0.9879551,0.0012578458,0.00066090596],"study_design_scores_gemma":[0.00053689664,0.000027089354,0.0055535226,0.00002006289,0.000004073402,0.00010875753,0.000010975604,0.0013586894,0.0009481794,0.9907383,0.00059002993,0.00010342995],"about_ca_topic_score_codex":0.000030194566,"about_ca_topic_score_gemma":8.671358e-7,"teacher_disagreement_score":0.0034974327,"about_ca_system_score_codex":0.0000057587617,"about_ca_system_score_gemma":0.00004584419,"threshold_uncertainty_score":0.5330063},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9738134,0.004023298,0.00002582232,0.000040808034,0.0017739355,0.000116101735,0.0000014183586,0.00023561851,0.019969596],"genre_scores_gemma":[0.99924046,0.0006608559,0.00001901625,0.0000072942735,0.0000096474,0.00002022412,0.0000017853309,0.000024473502,0.000016255866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993534,0.000023185377,0.00015999391,0.00013037525,0.00011004633,0.00022301351],"domain_scores_gemma":[0.9996244,0.00004201479,0.00001441166,0.0002509131,0.000013582149,0.000054692842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014860091,0.00012160345,0.00016861678,0.00008223619,0.00004420377,0.0000059723307,0.00014582125,0.000080094695,0.000017642264],"category_scores_gemma":[0.000010421395,0.00012843129,0.00004071177,0.00015634227,0.00003147385,0.00008765732,0.000013715924,0.00015324453,0.00012452355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008969829,0.00006395049,0.007288944,0.000066228444,0.00003229831,0.00010181489,0.0018684289,0.00038098983,0.00047135327,0.98595977,0.00141662,0.0023406167],"study_design_scores_gemma":[0.001695106,0.000095339376,0.052066445,0.000102752354,0.000007798034,0.00008195484,0.0004307832,0.0026058608,0.0018456809,0.9320368,0.008470093,0.00056137383],"about_ca_topic_score_codex":0.000009441145,"about_ca_topic_score_gemma":0.000030902796,"teacher_disagreement_score":0.05392297,"about_ca_system_score_codex":0.000038936898,"about_ca_system_score_gemma":0.0000067916503,"threshold_uncertainty_score":0.5237276},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9932927,0.000053873384,0.0030691614,0.00017747087,0.0016426028,0.00025963073,0.000005092586,0.000034814006,0.0014646385],"genre_scores_gemma":[0.9900555,0.0000012069966,0.009904798,0.0000126914965,0.000007850045,0.0000023090633,0.0000023512905,0.000006922602,0.00000638205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979862,0.00027040055,0.0007315713,0.00030303036,0.00048896734,0.00021986221],"domain_scores_gemma":[0.99805164,0.0004385635,0.00047029555,0.00070787163,0.000305123,0.000026493313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068705,0.00014928312,0.0003993796,0.00010976813,0.000050937913,0.000014269394,0.0011157084,0.0000799487,0.000007241398],"category_scores_gemma":[0.00009116,0.0001270711,0.00014745489,0.0011800345,0.0004204278,0.00020293554,0.0005940689,0.00016640328,0.0000012917974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055260634,0.00055139844,0.16826452,0.00007852239,0.000010152261,0.000002157845,0.00034387485,0.0004906146,0.00054720993,0.8281211,0.00019420662,0.0013906572],"study_design_scores_gemma":[0.0005034464,0.000038953982,0.44100764,0.00004175542,0.000003936752,0.00000437949,0.000023702547,0.018823076,0.0062398217,0.5332279,0.0000072594157,0.00007807949],"about_ca_topic_score_codex":0.0011800436,"about_ca_topic_score_gemma":0.00012110074,"teacher_disagreement_score":0.29489323,"about_ca_system_score_codex":0.000063842854,"about_ca_system_score_gemma":0.000085314736,"threshold_uncertainty_score":0.5181809},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99648577,0.00064533623,0.00001924971,0.00032482974,0.0001949907,0.00007691434,0.0000058981864,0.000006205549,0.0022407805],"genre_scores_gemma":[0.9985928,0.00047302133,0.000030774125,0.0001496348,0.000017083445,0.000007288895,0.0000278736,0.000009036676,0.00069250993],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9993248,0.000045995206,0.00016122781,0.00020915162,0.00012643597,0.00013237918],"domain_scores_gemma":[0.99941224,0.000014006717,0.000102079124,0.000353016,0.00007377948,0.00004486551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011078383,0.00009990798,0.00012024648,0.000023079392,0.00007860523,0.00001592856,0.00017204531,0.00010893873,0.000021287748],"category_scores_gemma":[0.00006595001,0.000073867646,0.00007999845,0.000156313,0.00017612323,0.0000071496534,0.000086344735,0.00006526415,0.0000047255894],"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.00004802118,0.000118864344,0.1382783,0.000019095292,0.00008739865,0.0000019239815,0.000058036298,0.0000058612063,0.82136756,0.03638684,0.0019129784,0.001715085],"study_design_scores_gemma":[0.0017982192,0.00043116853,0.45439166,0.00005233236,0.00020083971,0.000031177653,0.00037354435,0.0008446845,0.4013008,0.07609404,0.06391311,0.00056842406],"about_ca_topic_score_codex":0.00006744955,"about_ca_topic_score_gemma":0.00003284455,"teacher_disagreement_score":0.4200668,"about_ca_system_score_codex":0.000010112878,"about_ca_system_score_gemma":0.000031402502,"threshold_uncertainty_score":0.30122355},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98658544,0.000054893164,0.0036692373,0.0006826224,0.00078636635,0.00023196799,0.0000015237894,0.00016427212,0.007823686],"genre_scores_gemma":[0.9961114,0.000017102835,0.0036585003,0.000116418814,0.0000017799155,0.000016611428,6.0586115e-7,0.000012356363,0.000065230925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985923,0.000055089127,0.00020456102,0.00034601273,0.00045357127,0.00034844945],"domain_scores_gemma":[0.9987121,0.00018571802,0.00009051865,0.00079285505,0.00010071705,0.00011805737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030965335,0.00013285094,0.00018961182,0.00022354799,0.0000988213,0.000032206466,0.0011824558,0.00006123785,0.0000049445275],"category_scores_gemma":[0.00011330955,0.00012872524,0.00008897221,0.0009415168,0.0001407612,0.00032991427,0.00026200825,0.00022875553,0.00008650989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019946105,0.00014122043,0.00027786076,0.000007976838,0.000008829875,0.00001531141,0.00018352272,0.00011742118,0.0030530996,0.9946457,0.000028700098,0.0015004199],"study_design_scores_gemma":[0.00095428375,0.0003809455,0.0021358174,0.000028721026,0.0000017259563,0.000003435493,0.000006420489,0.000041964136,0.059732486,0.93609464,0.0004972921,0.00012228072],"about_ca_topic_score_codex":0.000017895836,"about_ca_topic_score_gemma":0.0000017573254,"teacher_disagreement_score":0.058551062,"about_ca_system_score_codex":0.00007400276,"about_ca_system_score_gemma":0.00007170393,"threshold_uncertainty_score":0.5249263},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99438965,0.0024448878,0.0000068720105,0.000013906345,0.0006871031,0.00014782911,0.000005335453,0.00015414758,0.0021502904],"genre_scores_gemma":[0.99954414,0.00025395915,0.000033772852,0.000023340423,0.0000131232555,0.00001048911,0.000003104876,0.00002419843,0.00009385486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936914,0.000025548014,0.00013615466,0.00016850559,0.00010769177,0.0001929342],"domain_scores_gemma":[0.999628,0.000046769306,0.000025238976,0.00016974246,0.000018637369,0.00011157804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008594291,0.00016348725,0.00021962736,0.000055520184,0.00012468103,0.000021407113,0.000060920294,0.000078428224,0.0000091457105],"category_scores_gemma":[0.0000045072857,0.0001346868,0.000017112496,0.00009473216,0.00016242021,0.00014763043,0.000017177725,0.00012837797,0.000007838418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028982136,0.000026706792,0.032925777,0.0000768126,0.00011380471,0.00023726681,0.0008651791,0.000013020609,0.00072605675,0.9639321,0.0009056613,0.00014863403],"study_design_scores_gemma":[0.0077794865,0.0006650222,0.07374261,0.00029977236,0.00011670392,0.003007026,0.0004574101,0.0010041466,0.013453643,0.8839733,0.013925253,0.0015756269],"about_ca_topic_score_codex":0.000006581595,"about_ca_topic_score_gemma":0.0000029420366,"teacher_disagreement_score":0.0799588,"about_ca_system_score_codex":0.0000115822795,"about_ca_system_score_gemma":0.000015922602,"threshold_uncertainty_score":0.54923683},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78919375,0.00043274602,0.20062254,0.00042451205,0.0021207314,0.00061069167,0.00002208121,0.00022565661,0.0063473177],"genre_scores_gemma":[0.99709284,0.000016385484,0.002510954,0.000021297592,0.000046852856,0.000025303298,0.000003789584,0.000019478326,0.0002631065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784964,0.00018877389,0.00030653478,0.00048083553,0.00067949796,0.00049468805],"domain_scores_gemma":[0.99788433,0.0003451304,0.00017138771,0.0012134123,0.0002756008,0.00011016206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005172488,0.00020728631,0.00024200302,0.000079661986,0.00034372183,0.000105566665,0.0017106328,0.000055230386,0.0000047175763],"category_scores_gemma":[0.00006468164,0.0001422582,0.00007489009,0.0012534503,0.00053217297,0.00059922895,0.00019435683,0.00032355954,0.000009669332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013633368,0.00014761444,0.001810722,0.000008348952,0.0000133252815,0.00002310477,0.00014368088,0.00009036104,0.00011413285,0.99577594,0.00033159807,0.0014048615],"study_design_scores_gemma":[0.00073218794,0.0002975626,0.0044427034,0.000028304004,0.0000046975697,0.00000571949,0.000047320736,0.004164874,0.0025068922,0.9827144,0.004832183,0.00022315248],"about_ca_topic_score_codex":0.00005599774,"about_ca_topic_score_gemma":0.000225103,"teacher_disagreement_score":0.20789911,"about_ca_system_score_codex":0.00007151218,"about_ca_system_score_gemma":0.00008939398,"threshold_uncertainty_score":0.5801121},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99772555,0.0007242995,0.00030237477,0.00018643458,0.0005445128,0.00023153906,0.0000066398516,0.000013687326,0.00026498156],"genre_scores_gemma":[0.9982858,0.00014245992,0.001038625,0.0002662914,0.000032238688,0.00003545827,0.000035010973,0.00001076464,0.00015338731],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9992019,0.00004115444,0.00016261969,0.00026037128,0.00007315487,0.00026081226],"domain_scores_gemma":[0.9995962,0.00005349665,0.00004431223,0.00021740426,0.00004563125,0.000042970627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022683201,0.00011844107,0.00011711523,0.000019308416,0.0001659531,0.000012084385,0.00025020706,0.00012356455,0.0000033752995],"category_scores_gemma":[0.0000818802,0.00007933916,0.00010051197,0.000103093545,0.00009940518,0.0000019508939,0.000099114055,0.00009526093,0.0000034582886],"study_design_candidate":"observational","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.0011638183,0.0022134006,0.26229504,0.00009337838,0.00054250826,0.00023172362,0.0011242823,0.001294823,0.41487095,0.20985782,0.041656904,0.06465538],"study_design_scores_gemma":[0.014904604,0.006445397,0.39145654,0.00010034032,0.00009328708,0.00027184462,0.00060382835,0.015094869,0.18738686,0.11458423,0.2663992,0.002658998],"about_ca_topic_score_codex":0.000023933057,"about_ca_topic_score_gemma":0.000005836463,"teacher_disagreement_score":0.22748408,"about_ca_system_score_codex":0.00000803152,"about_ca_system_score_gemma":0.00003093399,"threshold_uncertainty_score":0.3235357},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94559616,0.0011674511,0.000010701799,0.00001792594,0.003180092,0.00008652449,0.0000023390314,0.00048587308,0.04945292],"genre_scores_gemma":[0.9996663,0.000051485917,0.000008699144,0.000022792317,0.0000063197285,0.000014966237,0.0000017845476,0.000024156943,0.00020353637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999419,0.000024184925,0.00013608273,0.000105708656,0.00010672959,0.00020834465],"domain_scores_gemma":[0.9996322,0.00002319384,0.000013015923,0.0002455569,0.000013681178,0.00007239626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008566992,0.00011236689,0.00012642192,0.00006449586,0.0000522438,0.000022468432,0.0001412229,0.00006142473,0.00022417343],"category_scores_gemma":[0.000006063794,0.000113097056,0.000067907764,0.00020854738,0.000022637903,0.00007530966,0.000009947978,0.00010671179,0.0005417402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.638238e-7,0.00003173302,0.0015278421,0.00003321348,0.000043099786,0.000019904212,0.00029575912,0.00011594129,0.0013615492,0.9829632,0.012704341,0.00090254884],"study_design_scores_gemma":[0.00092883996,0.000055530185,0.0025970007,0.00005028985,0.000024611925,0.000051238952,0.00010353876,0.008645071,0.003487415,0.95173967,0.031782277,0.000534542],"about_ca_topic_score_codex":0.0000029454573,"about_ca_topic_score_gemma":5.7088096e-7,"teacher_disagreement_score":0.054070085,"about_ca_system_score_codex":0.000016661996,"about_ca_system_score_gemma":9.031489e-7,"threshold_uncertainty_score":0.69631547},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9693236,0.00045015456,0.0009647165,0.0003645156,0.0011012597,0.00011435516,5.92711e-7,0.000055937104,0.027624888],"genre_scores_gemma":[0.9983588,0.000025581076,0.0012523691,0.00016847391,0.0000024289775,0.000006210048,1.7049719e-7,0.0000051037628,0.00018085024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992974,0.0001278259,0.00014552874,0.0001394084,0.00014515089,0.00014467986],"domain_scores_gemma":[0.9991318,0.00026480964,0.00006837441,0.00045808492,0.000036595855,0.0000403336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053666433,0.00008175295,0.00014422706,0.00001768338,0.00006996625,0.00004603301,0.0004435343,0.000035221332,0.000020649222],"category_scores_gemma":[0.00009290498,0.000054047665,0.0000412706,0.00018644138,0.00014967631,0.00014412083,0.000116290015,0.00007226994,0.000022415228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037158877,0.000024963429,0.001811509,0.0000043240743,0.00000969465,0.0000015214027,0.0003916985,1.3278476e-7,0.00005289798,0.9948161,0.0005738559,0.0023095896],"study_design_scores_gemma":[0.0013377225,0.000014928738,0.003043743,0.000009954994,0.000005753556,0.00002625741,0.00005901302,0.0006164982,0.0016218643,0.99135494,0.0018240844,0.000085246895],"about_ca_topic_score_codex":0.000015284671,"about_ca_topic_score_gemma":4.0551367e-7,"teacher_disagreement_score":0.029035231,"about_ca_system_score_codex":0.0000065524596,"about_ca_system_score_gemma":0.000024133951,"threshold_uncertainty_score":0.22039998},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9945554,0.00013199703,0.00051628455,0.0008024077,0.0011209219,0.000086678985,0.0000010579914,0.00017037454,0.0026148504],"genre_scores_gemma":[0.99665904,0.000012901068,0.0030537844,0.00023475382,3.7034312e-7,0.000008491916,0.0000012316165,0.0000065368677,0.00002288183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905854,0.00003253776,0.00021779268,0.00024443772,0.00024254835,0.000204147],"domain_scores_gemma":[0.9991007,0.00008226319,0.000085428335,0.0005666399,0.00008142244,0.00008358253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019970152,0.000095127085,0.00012989329,0.00014742254,0.00012880145,0.00003629844,0.0004228568,0.000047277277,0.000005291512],"category_scores_gemma":[0.000072370545,0.00008925419,0.000074677584,0.0005716486,0.000060346585,0.00016463088,0.000093948285,0.00011298305,0.000055030498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019343688,0.00015532089,0.00018218542,0.000004641048,0.0000079805495,0.0000044846206,0.00016886923,0.00039141756,0.00144208,0.9968238,0.0006062868,0.00021102997],"study_design_scores_gemma":[0.00065534655,0.00016273755,0.00085105683,0.00006413483,0.0000038128264,0.0000027159458,0.0000056920217,0.00012664944,0.010210436,0.9877506,0.00007003963,0.00009679628],"about_ca_topic_score_codex":0.000044895838,"about_ca_topic_score_gemma":0.0000024104081,"teacher_disagreement_score":0.009073188,"about_ca_system_score_codex":0.000018139917,"about_ca_system_score_gemma":0.00004324265,"threshold_uncertainty_score":0.363968},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98433435,0.00031563273,0.004239848,0.0005494366,0.0016363577,0.00028332585,8.584224e-7,0.00024549259,0.008394693],"genre_scores_gemma":[0.9977231,0.000085955166,0.0017715546,0.00014742579,0.0000020641255,0.000032417185,0.0000011998658,0.000013957408,0.00022229902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982315,0.0001495981,0.00023565623,0.0004496631,0.00039005515,0.00054353103],"domain_scores_gemma":[0.99869716,0.00017709534,0.000047133817,0.00085425045,0.00007415508,0.00015018816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000528818,0.00015231954,0.00018966637,0.00031344127,0.00009569005,0.00008004237,0.0012002514,0.000067652356,0.000028559534],"category_scores_gemma":[0.0001170677,0.00015192619,0.00007275256,0.0015427907,0.00008325891,0.0005756001,0.0003706223,0.0002979256,0.00017595597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012070953,0.00012716626,0.013076677,0.0000035933258,0.000005047556,0.00017844043,0.00021660831,0.000013301632,0.00033044055,0.9731525,0.00026464273,0.012619485],"study_design_scores_gemma":[0.0007819466,0.00009978286,0.012602821,0.000018838384,8.357857e-7,0.000021802512,0.000025619116,0.0028512706,0.00046780342,0.981533,0.0014137308,0.00018257379],"about_ca_topic_score_codex":0.000029104618,"about_ca_topic_score_gemma":0.000016198592,"teacher_disagreement_score":0.013388772,"about_ca_system_score_codex":0.00007792534,"about_ca_system_score_gemma":0.000055070534,"threshold_uncertainty_score":0.619537},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83709306,0.00018104988,0.000052737116,0.00002163818,0.004415984,0.00014856311,0.00000246656,0.0004102924,0.15767421],"genre_scores_gemma":[0.99942327,0.000009581884,0.000034295444,0.000058956917,0.000007111636,0.000019632584,0.000002064238,0.00003699315,0.0004081151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992242,0.000089845395,0.00015797555,0.00014347494,0.00013255248,0.00025197287],"domain_scores_gemma":[0.9994934,0.00007225179,0.000018251912,0.00031279927,0.000018077675,0.00008522411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026786546,0.0001520695,0.00015647912,0.000068711975,0.00006441559,0.000025518526,0.0001308248,0.00008395509,0.0001279717],"category_scores_gemma":[0.000036277193,0.00015248799,0.00006648719,0.00019312315,0.000020822315,0.00006779213,0.0000060071216,0.00015540965,0.00063465605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040496448,0.00003398292,0.00034666833,0.000018552839,0.00002717354,0.000010331916,0.0001171226,0.00014710368,0.0011185854,0.9932982,0.004761848,0.000116384275],"study_design_scores_gemma":[0.00091966905,0.0001388966,0.000635901,0.000054770564,0.000014364234,0.0000146211805,0.000121928984,0.0001934695,0.030197224,0.9226674,0.044649724,0.00039205872],"about_ca_topic_score_codex":0.0000017584761,"about_ca_topic_score_gemma":6.0939476e-7,"teacher_disagreement_score":0.1623302,"about_ca_system_score_codex":0.000038079466,"about_ca_system_score_gemma":0.00000778458,"threshold_uncertainty_score":0.8157431},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9550666,0.0017666486,0.00765433,0.000019064892,0.010236845,0.0015574063,0.00003434168,0.00067508424,0.022989687],"genre_scores_gemma":[0.9993897,0.000014980441,0.00018682548,0.000019329516,0.000024958837,0.00022330436,0.0000046211767,0.000045741723,0.00009052538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998746,0.00017205719,0.00035206997,0.00021077631,0.00020621624,0.0003129146],"domain_scores_gemma":[0.9990327,0.0001726313,0.000051083764,0.0005048664,0.00007238477,0.00016635048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005959894,0.00020506767,0.00029621538,0.00018823493,0.00009328318,0.000022004824,0.00029515816,0.000120748795,0.00005338246],"category_scores_gemma":[0.000050098617,0.00021795469,0.00011936271,0.0006195764,0.00006041544,0.0001246251,0.000020016627,0.00014544057,0.00009485577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014257226,0.00009257526,0.00025818517,0.000049426828,0.00005879951,0.000001596918,0.00025745854,0.0002130043,0.0054723346,0.99264836,0.00071095396,0.00022306698],"study_design_scores_gemma":[0.000660211,0.00007780056,0.00011716006,0.000022542292,0.000025836804,0.0000044461913,0.000153647,0.000018168625,0.025102733,0.9671359,0.0064422092,0.00023933986],"about_ca_topic_score_codex":0.000003024412,"about_ca_topic_score_gemma":4.594946e-7,"teacher_disagreement_score":0.04432312,"about_ca_system_score_codex":0.000035292032,"about_ca_system_score_gemma":0.000022092016,"threshold_uncertainty_score":0.8887934},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950492,0.00005585087,0.000085091866,0.00036238198,0.000119036966,0.00024845923,0.000002507711,0.000054686658,0.0040227813],"genre_scores_gemma":[0.99938977,0.000017096912,0.00037445416,0.000025122388,0.0000019695538,0.00005264718,9.669382e-7,0.000016590511,0.00012138431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992909,0.000036513735,0.00020182283,0.0001253235,0.00017540624,0.00017006429],"domain_scores_gemma":[0.998949,0.00030820767,0.00013372484,0.0004901347,0.00006985183,0.00004910244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002600885,0.000102524915,0.00014051482,0.000050532435,0.0002374459,0.000017814356,0.00028200113,0.000047680147,0.0000051232314],"category_scores_gemma":[0.00006704292,0.000064705215,0.000062568135,0.0004924361,0.0001945306,0.000046802114,0.000027738133,0.00012607953,0.000009292218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021464486,0.00015401836,0.0012769907,0.000010048022,0.00003543668,0.0000010517409,0.0002273419,0.000003382898,0.00014917747,0.99769866,0.00013638675,0.000286052],"study_design_scores_gemma":[0.00091583235,0.000080800055,0.0038189914,0.000022147855,0.000024889972,0.0000048383768,0.00014361406,0.0000019390127,0.0024038362,0.9917735,0.000723869,0.00008575857],"about_ca_topic_score_codex":0.000018158098,"about_ca_topic_score_gemma":0.000024911216,"teacher_disagreement_score":0.005925166,"about_ca_system_score_codex":0.000016548789,"about_ca_system_score_gemma":0.00004071547,"threshold_uncertainty_score":0.2638602},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98645896,0.0003053173,0.0000022261088,0.000045695375,0.00020608745,0.00006554676,9.574388e-7,0.000017816552,0.0128973685],"genre_scores_gemma":[0.9991348,0.00005640075,0.00012801267,0.00022065586,0.000015567959,0.000004319952,0.00002055473,0.000008092333,0.00041159068],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99923617,0.000049517726,0.00016468266,0.00025127822,0.00006203228,0.00023631699],"domain_scores_gemma":[0.9997349,0.000013251893,0.000026924752,0.00015957672,0.000017757158,0.000047582624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016254079,0.0001002161,0.0001005021,0.000023096734,0.000050413295,0.000015704503,0.00015569426,0.000108705375,0.00008386758],"category_scores_gemma":[0.000047679285,0.00008860005,0.000052843487,0.00013690666,0.00003674103,0.0000019454003,0.00005472062,0.00009346695,0.000034024197],"study_design_candidate":"observational","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.00027226322,0.0006328972,0.26783243,0.000033313812,0.00006441766,0.000085030944,0.0001352139,0.00022135752,0.4142468,0.04609915,0.0042571616,0.26612],"study_design_scores_gemma":[0.007471786,0.0026611858,0.32162902,0.00017709051,0.00003161834,0.000103945014,0.00016246115,0.0010500395,0.15588984,0.311939,0.19667944,0.002204581],"about_ca_topic_score_codex":0.000019489691,"about_ca_topic_score_gemma":0.000005280344,"teacher_disagreement_score":0.26583984,"about_ca_system_score_codex":0.0000065141194,"about_ca_system_score_gemma":0.000012757825,"threshold_uncertainty_score":0.3613005},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927873,0.0009621651,0.0014644827,0.0006964095,0.00073881703,0.00024347362,0.000001640538,0.00014892787,0.002956753],"genre_scores_gemma":[0.9984201,0.0001061521,0.0011828191,0.00009045651,0.0000015256035,0.000017527063,2.454414e-7,0.000009603898,0.00017156123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987493,0.00009862105,0.00016257423,0.00037098434,0.00025253303,0.00036599478],"domain_scores_gemma":[0.99911684,0.00016718906,0.000033098542,0.0005100112,0.000037822418,0.00013501204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018846648,0.00012327087,0.00015739974,0.00023661501,0.000076070195,0.00008055311,0.0005708547,0.000052543546,0.00004309058],"category_scores_gemma":[0.00008702139,0.00012025475,0.000035955978,0.00072584447,0.000093655464,0.0004801848,0.0002896346,0.00022386789,0.00007514169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037122206,0.000091367845,0.0048447764,0.0000071538407,0.000005378359,0.000043418906,0.00056617975,0.0000026131986,0.00035100666,0.98200655,0.0002830443,0.0117947785],"study_design_scores_gemma":[0.00080097845,0.00010619104,0.01158658,0.000017269944,7.333435e-7,0.000011998618,0.000015141948,0.0054014437,0.00057126523,0.9807206,0.0006024329,0.00016541107],"about_ca_topic_score_codex":0.00001121716,"about_ca_topic_score_gemma":0.000006552228,"teacher_disagreement_score":0.011629367,"about_ca_system_score_codex":0.000038343045,"about_ca_system_score_gemma":0.000010131519,"threshold_uncertainty_score":0.49038464},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903541,0.0002834498,0.0015506829,0.0012104679,0.0005508074,0.00020242663,7.317678e-7,0.00017226346,0.0056750765],"genre_scores_gemma":[0.9865926,0.000015421327,0.012999479,0.00016925292,0.000007251497,0.000027003063,7.848655e-7,0.000013164805,0.00017504799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839336,0.0001380022,0.000244574,0.00038933853,0.000338433,0.0004963058],"domain_scores_gemma":[0.9989101,0.0002368541,0.000049663246,0.00061802746,0.0000682583,0.0001170959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072580815,0.00013292661,0.00016947208,0.00024600417,0.00010012228,0.000089299516,0.000995923,0.000059371876,0.000020552301],"category_scores_gemma":[0.00016530488,0.00013605524,0.00004685029,0.000933959,0.000065223314,0.00086709176,0.00037238674,0.00028228256,0.00026614903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005694482,0.00010002161,0.0037776236,0.000005409255,0.000004100031,0.000028908962,0.00050884695,0.00015986743,0.0012689937,0.9406611,0.00020844123,0.053271],"study_design_scores_gemma":[0.0012458138,0.000072601964,0.0060150167,0.00003542547,0.0000013381115,0.000017621493,0.00003530233,0.031617824,0.0076483437,0.94901747,0.004009263,0.00028397326],"about_ca_topic_score_codex":0.000011005797,"about_ca_topic_score_gemma":0.00001695965,"teacher_disagreement_score":0.052987028,"about_ca_system_score_codex":0.00011677394,"about_ca_system_score_gemma":0.000047572634,"threshold_uncertainty_score":0.55481714},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9944073,0.00005025326,0.002095685,0.00047787494,0.0006586981,0.0009867238,0.00002989333,0.00008717723,0.001206416],"genre_scores_gemma":[0.99736905,0.000003282361,0.0019329537,0.00024528647,0.00001624499,0.00008436892,0.000019804742,0.000039314193,0.00028969714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986117,0.000065521555,0.0002668389,0.0002872848,0.00032642487,0.00044222522],"domain_scores_gemma":[0.99785525,0.0013520909,0.00006595483,0.00033894915,0.00017731858,0.00021045774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018660864,0.00014936241,0.0002309692,0.0002358603,0.00016733093,0.000051692292,0.00018842053,0.00009861013,0.000032737324],"category_scores_gemma":[0.00077430136,0.00014897605,0.00006865505,0.0003713423,0.000099755765,0.000084095416,0.000108220294,0.0001300361,0.00001462574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019413202,0.00022544283,0.00033864361,0.000095149066,0.000029187608,0.000011849195,0.00084306573,6.719628e-7,0.0020677992,0.98356354,0.012214518,0.0004159792],"study_design_scores_gemma":[0.0013953303,0.0005172884,0.0010666572,0.000032547454,0.000025866279,0.000008673917,0.0005601547,0.00006615689,0.0040505547,0.98854107,0.0035435776,0.00019212344],"about_ca_topic_score_codex":0.0000104860355,"about_ca_topic_score_gemma":0.000015618805,"teacher_disagreement_score":0.008670941,"about_ca_system_score_codex":0.000060321272,"about_ca_system_score_gemma":0.000030804407,"threshold_uncertainty_score":0.6075067},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98315936,0.00050284935,0.00007554983,0.000003598461,0.0019728015,0.000092041424,0.0000022671059,0.0001891424,0.014002364],"genre_scores_gemma":[0.99961776,0.000058408514,0.00006871649,0.000008374024,0.0000075064777,0.000006793158,0.000003898294,0.000025453575,0.00020308296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937844,0.00003534494,0.0001852496,0.000097204946,0.00012729829,0.0001764538],"domain_scores_gemma":[0.99957657,0.00005174603,0.000026724441,0.00024949253,0.000039628045,0.00005583294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013093944,0.00010834419,0.00018288125,0.0000656987,0.000054195207,0.0000051318057,0.00015847915,0.00006894551,0.00005055613],"category_scores_gemma":[0.000015409336,0.00010992044,0.00005360888,0.00031493278,0.00004607844,0.00008537106,0.00001783034,0.00009112286,0.00008386083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000208546,0.00009438615,0.012035615,0.00011486164,0.00009041437,0.000025866591,0.000627819,0.00050963083,0.02119338,0.95796895,0.007109303,0.00020893457],"study_design_scores_gemma":[0.003603061,0.00096557447,0.044337496,0.00025898972,0.00008454854,0.00013392973,0.00032302694,0.0045148614,0.10516751,0.81478626,0.02439964,0.0014250951],"about_ca_topic_score_codex":0.000008513908,"about_ca_topic_score_gemma":9.2336484e-7,"teacher_disagreement_score":0.14318267,"about_ca_system_score_codex":0.000015493766,"about_ca_system_score_gemma":0.000009329046,"threshold_uncertainty_score":0.44824255},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8681054,0.000012502107,0.12911211,0.000010700407,0.0011420359,0.00042100166,0.000036051497,0.000023814328,0.0011363506],"genre_scores_gemma":[0.99750096,0.000001461341,0.0023105934,0.000005449636,0.000011517756,0.00001017321,0.0000135062755,0.000017541248,0.00012882068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987946,0.000029618293,0.00054034515,0.00015951053,0.00027872855,0.0001971697],"domain_scores_gemma":[0.99831104,0.00085581036,0.00028082167,0.00030025482,0.0001917464,0.00006031933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004963342,0.00011137553,0.00032628505,0.00009968127,0.000059152277,0.0000080422915,0.00017917847,0.000093112605,0.000017990862],"category_scores_gemma":[0.000644911,0.00010019743,0.000139301,0.000197575,0.00007179348,0.00006801515,0.000043886324,0.00007001732,0.000003486944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001056162,0.0003871212,0.00067748985,0.00013523073,0.000027994016,4.4878823e-7,0.00008059377,0.000019857545,0.0041647893,0.9937139,0.00016353272,0.00052338553],"study_design_scores_gemma":[0.0015054257,0.0002782771,0.0013129074,0.00010140062,0.000042152304,5.0041984e-7,0.000076803204,0.0015339324,0.014803022,0.98008555,0.00013388302,0.00012616075],"about_ca_topic_score_codex":0.000044736767,"about_ca_topic_score_gemma":0.000038964914,"teacher_disagreement_score":0.1293955,"about_ca_system_score_codex":0.000050872048,"about_ca_system_score_gemma":0.000020736928,"threshold_uncertainty_score":0.40859327},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9826032,0.0009991524,0.0036697441,0.00057965424,0.00083246623,0.0004893936,0.0000060001353,0.00008897713,0.010731396],"genre_scores_gemma":[0.99778485,0.00003499853,0.0020125885,0.00006497701,0.000016508884,0.000020513555,0.000002967684,0.000009212081,0.00005335402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820715,0.00021519039,0.0003324969,0.00032300342,0.00050448114,0.0004176888],"domain_scores_gemma":[0.998801,0.00034656224,0.00021915356,0.00050944474,0.00007566755,0.000048174523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005619761,0.00017903192,0.00023552212,0.00028899874,0.000085322026,0.00010720334,0.0012051011,0.000063134925,0.000007274992],"category_scores_gemma":[0.000019588142,0.00011926244,0.00006692764,0.0020956732,0.00007601471,0.00036672372,0.00013654861,0.00019537461,0.000013212056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018813711,0.0003260474,0.0036555748,0.000029089915,0.000010523387,0.000060207334,0.0004024433,0.000067952045,0.000040113955,0.99313295,0.0003255592,0.0019307466],"study_design_scores_gemma":[0.0025259254,0.0005028247,0.09448718,0.00009281114,0.00003553419,0.00006215702,0.0003981552,0.004108791,0.004292106,0.89098746,0.0020125543,0.0004944896],"about_ca_topic_score_codex":0.00022587107,"about_ca_topic_score_gemma":0.000008492835,"teacher_disagreement_score":0.10214546,"about_ca_system_score_codex":0.00006191097,"about_ca_system_score_gemma":0.00006835366,"threshold_uncertainty_score":0.4863381},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82638675,0.00014811772,0.000015458369,0.00037527393,0.0021210676,0.00011287571,0.0000012341675,0.000045008575,0.1707942],"genre_scores_gemma":[0.99842495,0.00003948713,0.000036647805,0.000038176862,0.000011239727,0.0000069483017,9.1135365e-7,0.0000067214446,0.0014349428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991122,0.00014546383,0.00015738132,0.00012161259,0.00027318564,0.0001901939],"domain_scores_gemma":[0.9994822,0.0000832918,0.00008235335,0.00015941025,0.00011313434,0.000079585116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006117358,0.0000639494,0.00013227548,0.000043671305,0.00023718979,0.000022473989,0.00013188437,0.00007757586,0.00027594238],"category_scores_gemma":[0.00019065653,0.000067086505,0.000056015484,0.00027969942,0.00014400936,0.0001231845,0.000013366602,0.00007531705,0.000032188247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041953344,0.00007137282,0.005285687,0.000004370354,0.000008863017,0.0000014391562,0.0023694898,4.4413477e-7,0.00013141392,0.98972183,0.0006292495,0.0017716695],"study_design_scores_gemma":[0.0006771635,0.00007006613,0.0047622854,0.000015675825,0.000018036882,7.9347853e-7,0.0014136583,0.0000036615843,0.0047109495,0.49815044,0.49002042,0.00015684245],"about_ca_topic_score_codex":0.0008304782,"about_ca_topic_score_gemma":0.00012918505,"teacher_disagreement_score":0.49157137,"about_ca_system_score_codex":0.00003803084,"about_ca_system_score_gemma":0.000090817084,"threshold_uncertainty_score":0.30213755},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9931568,0.00045828722,0.0002635621,0.00043936912,0.00095228443,0.00010563192,0.0000012653071,0.00024402162,0.0043787705],"genre_scores_gemma":[0.9928572,0.00008427517,0.006163065,0.00011924227,7.0329054e-7,0.0000036729004,0.0000024645296,0.000009241369,0.0007600909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882084,0.000054257835,0.00028489213,0.0003157021,0.00027374912,0.0002505821],"domain_scores_gemma":[0.9989815,0.000075963384,0.00007589833,0.000654292,0.00007615318,0.00013624008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015914979,0.00014190697,0.00021160344,0.0001349037,0.00008719406,0.000051810737,0.000660992,0.000062681,0.00010903657],"category_scores_gemma":[0.000024930578,0.00012647893,0.000094733216,0.0008638356,0.000060233815,0.00027667763,0.00008258147,0.000106830434,0.00008532538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055631526,0.00006651334,0.0010881597,0.0000059933554,0.000016714082,0.0000036694937,0.00035807487,0.000026364536,0.0008341452,0.97252744,0.003810639,0.021256695],"study_design_scores_gemma":[0.0007233169,0.0001201355,0.002737644,0.000028833983,0.0000072583316,0.000004574946,0.000014383301,0.0005977853,0.004898424,0.98949933,0.0012056974,0.0001626024],"about_ca_topic_score_codex":0.00027828774,"about_ca_topic_score_gemma":0.000005924666,"teacher_disagreement_score":0.021094091,"about_ca_system_score_codex":0.0000074479635,"about_ca_system_score_gemma":0.00006547752,"threshold_uncertainty_score":0.51576614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9644337,0.00006694951,0.00091842125,0.001310414,0.00014376336,0.00026873613,0.000015316604,0.000044527664,0.032798167],"genre_scores_gemma":[0.9983751,0.000010639105,0.00036111867,0.00009436349,0.000017376746,0.00006443636,0.000005027269,0.000011568112,0.0010603316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943006,0.000018985082,0.00012690923,0.0001575943,0.00010569865,0.00016076204],"domain_scores_gemma":[0.9992384,0.0003586653,0.000053079115,0.00026301993,0.000027170714,0.000059679693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007054327,0.00010919614,0.00011894197,0.000011729843,0.0003459639,0.000020019195,0.00014326368,0.000020182446,0.00032123085],"category_scores_gemma":[0.000014747564,0.00007255776,0.000042588606,0.00011396929,0.00012802704,0.000057079666,0.000053344367,0.00012495655,0.00010003865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027011752,0.00004793358,0.00044558075,0.0000020437444,0.000010909896,6.2840286e-7,0.000081467086,0.0000049913237,0.00005707783,0.9970715,0.001878521,0.00039662197],"study_design_scores_gemma":[0.00018449189,0.000023410008,0.00026732174,0.000008305473,0.0000058477117,0.0000020129792,0.00011787714,0.00007238191,0.0006303413,0.9939789,0.0046140584,0.00009503657],"about_ca_topic_score_codex":0.000014104121,"about_ca_topic_score_gemma":1.0710554e-7,"teacher_disagreement_score":0.033941433,"about_ca_system_score_codex":0.000009313216,"about_ca_system_score_gemma":0.00001714069,"threshold_uncertainty_score":0.35172528},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93012357,0.00012398903,0.06768318,0.00017105477,0.0004306136,0.00006584433,0.0000025390802,0.0000670538,0.0013321398],"genre_scores_gemma":[0.97087985,0.000013502209,0.029011168,0.000036103847,0.000003916214,0.0000016855042,0.0000011803523,0.0000037312132,0.00004886178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943787,0.000009190485,0.00013954002,0.00016887028,0.000121101795,0.00012341507],"domain_scores_gemma":[0.9993187,0.00022268339,0.000058324054,0.00030767923,0.000038352948,0.000054235046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039329394,0.00005641993,0.00008489117,0.000033815966,0.000072231334,0.000042964628,0.0003309706,0.000027165717,0.0000020773261],"category_scores_gemma":[0.00003374066,0.00005333349,0.000015118737,0.00019218732,0.000031113275,0.00020461439,0.00020822557,0.000056443878,0.0000065157947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.073768e-7,0.000034915385,0.0007232788,0.0000053820095,0.0000029930106,0.0000015156845,0.00029299693,1.586746e-7,0.00087669154,0.92876875,0.00029310558,0.0689995],"study_design_scores_gemma":[0.0005404026,0.00010551105,0.093996234,0.00004628158,0.000006414939,0.000013199336,0.00011799327,0.003283044,0.018428765,0.8800854,0.0031699373,0.00020678129],"about_ca_topic_score_codex":0.000036249556,"about_ca_topic_score_gemma":0.0000015137125,"teacher_disagreement_score":0.093272954,"about_ca_system_score_codex":0.0000073940937,"about_ca_system_score_gemma":0.000011970686,"threshold_uncertainty_score":0.21748766},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942452,0.0005389235,0.0006537267,0.0000227656,0.00011109654,0.00008350948,0.000018535777,0.00016919129,0.0041571013],"genre_scores_gemma":[0.99907327,0.00007656811,0.00076036307,0.000007235801,0.0000010039188,0.000005310996,0.0000060924654,0.00001682136,0.000053327363],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999342,0.000019639736,0.00025321118,0.00009749382,0.00017349362,0.000114120674],"domain_scores_gemma":[0.99945956,0.00016455064,0.000068250745,0.00022565156,0.00004682247,0.0000351322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003995639,0.00010051754,0.0002345805,0.000059684615,0.000019460444,0.0000038059547,0.00013818078,0.00005251304,0.00015429144],"category_scores_gemma":[0.000058760943,0.00009902866,0.00006465232,0.00030091972,0.000046133955,0.00009100043,0.000012965483,0.00007213067,0.000011858161],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009452885,0.0019526088,0.011040444,0.0004869866,0.00094003434,0.0000073489737,0.0015038132,0.057838522,0.44471538,0.39305583,0.055919293,0.032445207],"study_design_scores_gemma":[0.0012327245,0.0004053249,0.006385963,0.000080535916,0.000107130705,5.002823e-7,0.000047056117,0.093334846,0.58958095,0.30687737,0.0014700121,0.00047759066],"about_ca_topic_score_codex":0.00002386769,"about_ca_topic_score_gemma":0.0000022918416,"teacher_disagreement_score":0.14486556,"about_ca_system_score_codex":0.000027422977,"about_ca_system_score_gemma":0.0000016463881,"threshold_uncertainty_score":0.40382716},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.995854,0.00056566624,0.0012822072,0.00009318573,0.00044518197,0.00018305027,0.0000015536779,0.000052940486,0.0015221679],"genre_scores_gemma":[0.99795383,0.000012687708,0.0018628789,0.0000052831024,0.0000053256686,0.00001219648,0.0000011276848,0.000008869444,0.000137828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987732,0.00009229555,0.00028301275,0.00021543157,0.0004131495,0.00022291555],"domain_scores_gemma":[0.9990695,0.00006515493,0.00014959116,0.00046624278,0.00021363997,0.000035873272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032517296,0.00010065735,0.00019371312,0.00019047149,0.00005411268,0.000018856414,0.0006747812,0.000046041867,0.0000024614485],"category_scores_gemma":[0.00004655528,0.00009148088,0.00007483666,0.0005351257,0.00020257862,0.0006255591,0.000162789,0.00009390754,0.000004970959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001432282,0.000118122516,0.0016232444,0.000033421893,0.000010423564,0.0000013581645,0.00010737217,0.00009482376,0.037643973,0.95954263,0.000064302374,0.0007459973],"study_design_scores_gemma":[0.0005147947,0.000085754255,0.0016624084,0.00003227577,0.000003147834,0.000001529989,0.00003276377,0.0011624822,0.21025656,0.786115,0.00004246745,0.000090819034],"about_ca_topic_score_codex":0.00009402932,"about_ca_topic_score_gemma":0.0000036717752,"teacher_disagreement_score":0.17342764,"about_ca_system_score_codex":0.000029714838,"about_ca_system_score_gemma":0.000050556675,"threshold_uncertainty_score":0.3730482},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99039286,0.00030996124,0.000015418134,0.000041064028,0.0027630841,0.00014745725,0.0000032074558,0.0000850944,0.0062418496],"genre_scores_gemma":[0.9997333,0.000008643072,0.0000151163,0.00007549491,0.000009147833,0.000026377385,7.308143e-7,0.000021438555,0.00010971649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992607,0.00019182258,0.00013653543,0.000058265832,0.00012018557,0.00023245235],"domain_scores_gemma":[0.9993312,0.0002031926,0.00003436873,0.00037040983,0.000016226535,0.000044646225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036464597,0.000104268525,0.00012056631,0.00003239208,0.00007082014,0.000010422808,0.00024285796,0.000058641523,0.000050115163],"category_scores_gemma":[0.000047288286,0.000059529964,0.000108898756,0.00025983795,0.000049894614,0.00004322835,0.000015831933,0.00013127761,0.000019926103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056963436,0.000031701988,0.0066510304,0.000013887922,0.000059479135,1.6868218e-7,0.0005182126,0.00007142257,0.009096399,0.98110443,0.0023764868,0.00007107611],"study_design_scores_gemma":[0.00063152,0.00003248909,0.037693255,0.00006639744,0.000046847934,0.0000054522666,0.00009417407,0.00037180356,0.09614404,0.862134,0.002554867,0.00022516339],"about_ca_topic_score_codex":0.000012276525,"about_ca_topic_score_gemma":0.000001829338,"teacher_disagreement_score":0.11897045,"about_ca_system_score_codex":0.000022287995,"about_ca_system_score_gemma":0.0000053852996,"threshold_uncertainty_score":0.24275616},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9771701,0.00043478305,0.005460542,0.002459394,0.0056023044,0.00015577108,1.8098099e-7,0.00039166107,0.008325233],"genre_scores_gemma":[0.9970073,0.000007224478,0.0022047758,0.00055368344,0.0000022403656,0.000003727423,2.846833e-7,0.0000057711486,0.00021499113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990818,0.000027874123,0.00017554866,0.00020667171,0.0002283562,0.00027976904],"domain_scores_gemma":[0.99905837,0.00019255416,0.00005398899,0.00053405116,0.00008301803,0.000077995945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010404107,0.000085092914,0.00008049009,0.00005498593,0.00022712002,0.00008949189,0.000702247,0.00004273062,0.0000037023613],"category_scores_gemma":[0.00005503056,0.00005851163,0.000044538094,0.0004744241,0.000046274043,0.00014129038,0.00019697296,0.00015015707,0.00010168736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016843663,0.000027801074,0.0005388102,0.0000014884791,0.0000054869483,0.0000085935935,0.00018652405,0.000015359024,0.00055974006,0.99461585,0.0011902937,0.0028483656],"study_design_scores_gemma":[0.00030155154,0.000063272884,0.0015645978,0.000009560779,0.0000030176468,0.000008889636,0.000021526364,0.0015958749,0.006377742,0.9860287,0.003921632,0.00010365245],"about_ca_topic_score_codex":0.000024099736,"about_ca_topic_score_gemma":0.000003217595,"teacher_disagreement_score":0.01983717,"about_ca_system_score_codex":0.000016193278,"about_ca_system_score_gemma":0.000025202175,"threshold_uncertainty_score":0.23860349},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9860085,0.0026537545,0.000038348135,0.0007475769,0.007908989,0.00024529253,0.000009864178,0.0001735846,0.0022140495],"genre_scores_gemma":[0.9957197,0.00030962896,0.001393979,0.00031046948,0.0000037402406,0.0000057638285,0.0000053470053,0.000039386487,0.0022120203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964761,0.0001709197,0.00085364404,0.00083615066,0.00090191315,0.0007612872],"domain_scores_gemma":[0.9972232,0.00027381748,0.00029090155,0.0012730106,0.00060085923,0.00033820228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005673629,0.0004299774,0.00065905444,0.00026148383,0.00035304046,0.00008116929,0.0010512052,0.00027729056,0.00011890835],"category_scores_gemma":[0.00021064887,0.00043244893,0.00028663845,0.0012065042,0.000457482,0.00049704534,0.0005467976,0.0004706403,0.0007220204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026286754,0.0007618687,0.005044652,0.0000674309,0.00010627199,0.00012620541,0.0029193463,0.00011813766,0.004250971,0.97336376,0.012500303,0.0007147622],"study_design_scores_gemma":[0.00541576,0.0013483723,0.0065536145,0.00046301563,0.00012059563,0.0003964027,0.00012726252,0.025493063,0.012774371,0.9441754,0.0018452314,0.0012868849],"about_ca_topic_score_codex":0.0003600282,"about_ca_topic_score_gemma":0.0000015280802,"teacher_disagreement_score":0.029188337,"about_ca_system_score_codex":0.000053040996,"about_ca_system_score_gemma":0.00034229708,"threshold_uncertainty_score":0.9998127},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9858556,0.0032334153,0.00025278825,0.0005631726,0.0068939156,0.00032482072,0.000008988481,0.00020822753,0.0026590724],"genre_scores_gemma":[0.9930204,0.00029680345,0.0056685903,0.0005272129,0.000006208728,0.0000043344153,0.000010221734,0.000049254882,0.00041697384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959375,0.00019054163,0.0011292135,0.000887212,0.00088036834,0.00097514497],"domain_scores_gemma":[0.99669987,0.00036010993,0.00043734905,0.0013336887,0.00076430314,0.00040466108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002068208,0.0004907792,0.0007087201,0.0005815843,0.00023573313,0.00021627836,0.0012426039,0.00031191102,0.000062376275],"category_scores_gemma":[0.00018039967,0.00048157494,0.0003627328,0.0017037961,0.00038757804,0.000408738,0.00047876922,0.00042726446,0.00022070787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000436466,0.00041325163,0.008108497,0.00010453823,0.00011033983,0.000054234388,0.0010033154,0.000018750383,0.022963317,0.9624805,0.0029941176,0.0017055304],"study_design_scores_gemma":[0.0033926212,0.00048585015,0.0048493636,0.0002961551,0.00010717589,0.000030881565,0.000087752676,0.0015718655,0.029339937,0.95598334,0.0031159758,0.00073907105],"about_ca_topic_score_codex":0.00034786412,"about_ca_topic_score_gemma":0.0000064181077,"teacher_disagreement_score":0.007164801,"about_ca_system_score_codex":0.000048112142,"about_ca_system_score_gemma":0.00016238094,"threshold_uncertainty_score":0.9997636},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9839056,0.00011100412,0.011432012,0.00030391704,0.0010485703,0.000055850673,0.000002746764,0.00016145126,0.0029788632],"genre_scores_gemma":[0.9926175,0.000027874428,0.006538704,0.0004867918,0.000010763361,0.0000025379002,0.000004249334,0.00000640534,0.00030520116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863493,0.000067691224,0.0002008911,0.0004123485,0.00036041086,0.00032369874],"domain_scores_gemma":[0.9990007,0.00011864384,0.00008144905,0.00061734766,0.00004972781,0.0001320803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015928944,0.00014581309,0.00021125471,0.00022014527,0.00028686516,0.00006492206,0.0008480262,0.00006951218,0.00006168804],"category_scores_gemma":[0.00011185993,0.00012224738,0.00011100153,0.001587702,0.00006667451,0.00031786558,0.0002714741,0.00014070523,0.00016704881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027513204,0.00013632674,0.0037228153,0.0000014206953,0.00003336754,0.00019615734,0.00010187666,0.0006242679,0.00016589183,0.9886734,0.0044945986,0.0018471266],"study_design_scores_gemma":[0.0014014416,0.0002942574,0.015114846,0.000022279552,0.00003739679,0.000181154,0.000025563731,0.059646536,0.0018431464,0.91161066,0.008975856,0.00084687356],"about_ca_topic_score_codex":0.00034832343,"about_ca_topic_score_gemma":0.0000040270734,"teacher_disagreement_score":0.07706275,"about_ca_system_score_codex":0.0000645306,"about_ca_system_score_gemma":0.000031871972,"threshold_uncertainty_score":0.49851033},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9811385,0.000051284158,0.00004525538,0.00016488887,0.00046570326,0.00014317458,0.0000045288616,0.00003978944,0.017946826],"genre_scores_gemma":[0.9984162,0.000034800454,0.0006789592,0.00009284353,0.000009965887,0.00000889026,0.0000015550446,0.000012580668,0.00074421475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994,0.00003933187,0.00017785084,0.00013251712,0.00012194141,0.00012832886],"domain_scores_gemma":[0.99894994,0.0006256308,0.000073560404,0.0002544377,0.000050616574,0.000045820194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015077706,0.00009734956,0.00015982884,0.000065257096,0.000110939494,0.0000075232833,0.0000901685,0.00007975817,0.00007365822],"category_scores_gemma":[0.00023292493,0.000079205136,0.00004912391,0.00013480021,0.00004805117,0.000037817277,0.000053480337,0.00013373356,0.000004772387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058821177,0.000092020644,0.0028587969,0.000038178143,0.000029499366,0.000005546394,0.00048781748,0.00000205824,0.00003828247,0.99281925,0.0020156908,0.0015540529],"study_design_scores_gemma":[0.00054933125,0.0002532188,0.0006594007,0.000040659375,0.000024026303,0.000008132949,0.0000623237,0.000073554824,0.0004535997,0.9951376,0.0026486418,0.00008954698],"about_ca_topic_score_codex":0.000007676941,"about_ca_topic_score_gemma":0.0000033189672,"teacher_disagreement_score":0.017277641,"about_ca_system_score_codex":0.000006676155,"about_ca_system_score_gemma":0.000009942633,"threshold_uncertainty_score":0.3229892},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9880109,0.00012390038,0.000684947,0.000024862058,0.0037425668,0.00023785257,0.0000050760505,0.00037935365,0.0067905574],"genre_scores_gemma":[0.9994934,0.000012339846,0.00019244639,0.000013913708,0.000022417797,0.000054605418,0.000008437061,0.0000307245,0.00017166935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993825,0.000022590328,0.00018925853,0.00012867808,0.00007265975,0.000204315],"domain_scores_gemma":[0.9996429,0.000058044458,0.000026874903,0.00017374192,0.000040398983,0.000058055746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013291999,0.00012495008,0.00016203475,0.00008436381,0.00006738548,0.000035166395,0.000105291874,0.00008446274,0.00004172273],"category_scores_gemma":[0.00002047113,0.00012826381,0.000067259134,0.00017439674,0.000039045182,0.00011566259,0.000010612767,0.00009191351,0.000037652706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043454562,0.000030543833,0.03974055,0.000096132506,0.0000782098,0.00000414657,0.00041787548,0.0003779712,0.0022045153,0.9491582,0.0020048642,0.0058435393],"study_design_scores_gemma":[0.0024428964,0.00018493988,0.0051676123,0.00015146733,0.000047770423,0.00006619347,0.0006459184,0.014313788,0.008797668,0.9245647,0.043035273,0.00058176194],"about_ca_topic_score_codex":0.000006031915,"about_ca_topic_score_gemma":0.00000387296,"teacher_disagreement_score":0.041030407,"about_ca_system_score_codex":0.000032123586,"about_ca_system_score_gemma":0.0000049520745,"threshold_uncertainty_score":0.52304465},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96381515,0.00020347789,0.0000015401044,0.00013375291,0.0025524278,0.000099385965,0.0000054104526,0.00048536886,0.0327035],"genre_scores_gemma":[0.99959296,0.000018866316,0.0000076170904,0.00013836501,0.000034143977,0.000004554519,0.000005450647,0.000017784852,0.00018025764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926317,0.00002771707,0.00018709735,0.00014908946,0.00013705496,0.00023589731],"domain_scores_gemma":[0.99952835,0.000045983972,0.000024163348,0.00031063202,0.00001495947,0.00007594135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018266898,0.0001346788,0.00014366728,0.000066480505,0.000060591352,0.00003083383,0.0001550728,0.00007876149,0.0000065786844],"category_scores_gemma":[0.000024534833,0.00013364013,0.00005840258,0.00015075815,0.000013996483,0.00012419715,0.0000066836064,0.00015013386,0.00025460985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029408731,0.000043686305,0.00002802382,0.000008929333,0.000014240712,0.000014037169,0.00025299346,0.0005239313,0.0015237808,0.98904073,0.00702307,0.0014971516],"study_design_scores_gemma":[0.0010227634,0.0001998158,0.002843745,0.000059231254,0.000006240138,0.0000040942823,0.000034460845,0.0005859007,0.008217906,0.97934586,0.007440619,0.00023939354],"about_ca_topic_score_codex":0.0000024933001,"about_ca_topic_score_gemma":2.5948964e-7,"teacher_disagreement_score":0.035777826,"about_ca_system_score_codex":0.00003286647,"about_ca_system_score_gemma":0.0000037084405,"threshold_uncertainty_score":0.54496866},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9775219,0.000854036,0.0000087600965,0.0000069054163,0.0025091795,0.00015210969,0.0000014061042,0.00019841988,0.018747266],"genre_scores_gemma":[0.999723,0.000023929977,0.000050130744,0.000021070706,0.000004114602,0.00003453886,0.000002155848,0.000029431554,0.00011160125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999178,0.00008975893,0.00021589882,0.00013755784,0.00010133254,0.00027746215],"domain_scores_gemma":[0.99957454,0.000065674285,0.000019744179,0.00023331834,0.000015794514,0.00009094355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023090749,0.00014072857,0.00018543135,0.00009656284,0.000039462877,0.000024882245,0.0001315328,0.000104398976,0.000041453444],"category_scores_gemma":[0.00006441497,0.00014910946,0.000051078805,0.0002483479,0.000025242723,0.000087939596,0.000008704648,0.00016381651,0.00011859803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006917771,0.00006945877,0.017664317,0.00005462317,0.000027350576,0.000026169353,0.0008644289,0.0008174811,0.0022260095,0.9771771,0.0007478722,0.00031831735],"study_design_scores_gemma":[0.004402181,0.00010317107,0.024613664,0.00021927166,0.000021628068,0.000028668532,0.0012670596,0.0036779048,0.020057663,0.9152784,0.029341547,0.0009888649],"about_ca_topic_score_codex":0.000008860547,"about_ca_topic_score_gemma":0.000009123589,"teacher_disagreement_score":0.06189868,"about_ca_system_score_codex":0.000045778837,"about_ca_system_score_gemma":0.000011545439,"threshold_uncertainty_score":0.60805076},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9808433,0.00009463364,0.0027057815,0.0030594044,0.0021399362,0.00018856599,4.986125e-7,0.00014638944,0.010821475],"genre_scores_gemma":[0.9966131,0.000012595379,0.0020150165,0.0008312831,0.000016028602,0.000013340381,5.232849e-7,0.000010523709,0.0004875976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864525,0.00006635527,0.00029448312,0.00034556937,0.00030022656,0.00034813845],"domain_scores_gemma":[0.9990877,0.00015150405,0.00007170022,0.0005587113,0.000041768293,0.00008861366],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029824345,0.00014073224,0.00015193553,0.00015024624,0.00007725951,0.00015782214,0.0009832387,0.00009893494,0.00005087835],"category_scores_gemma":[0.00008951814,0.00014169754,0.000048696096,0.0004147999,0.00003937531,0.0006090297,0.00018160253,0.00032433745,0.0008280942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000485411,0.00022811168,0.0009978446,0.0000011852102,0.000004574719,0.00001907226,0.0006903027,0.0008859829,0.00022458617,0.9651773,0.0017925979,0.029973619],"study_design_scores_gemma":[0.00032681873,0.00021234898,0.0027186922,0.000048911963,0.0000020152834,0.000006239046,0.0000533567,0.023020629,0.013535929,0.94868594,0.01108357,0.0003055616],"about_ca_topic_score_codex":0.000072680734,"about_ca_topic_score_gemma":0.0000647583,"teacher_disagreement_score":0.029668057,"about_ca_system_score_codex":0.0002554125,"about_ca_system_score_gemma":0.0000515267,"threshold_uncertainty_score":0.9999499},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98957133,0.00007719059,0.00027884176,0.00041535986,0.00014703632,0.00015161693,0.0000018612254,0.00003743971,0.009319343],"genre_scores_gemma":[0.99902433,0.000058987152,0.00067335216,0.00010133052,0.0000014653438,0.000010672104,8.624649e-7,0.0000049063906,0.00012411947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989438,0.00015934813,0.0001634455,0.00018347405,0.00032266873,0.00022723862],"domain_scores_gemma":[0.9991511,0.00026027378,0.000025525185,0.00051148067,0.00002140797,0.00003017946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005044303,0.00008333791,0.00012242739,0.00009358633,0.000056254816,0.000028164673,0.0012897426,0.000034210552,0.000049473947],"category_scores_gemma":[0.000016299342,0.000062276406,0.000042904132,0.00059081055,0.00010060322,0.00028480645,0.00003901179,0.00018654481,0.000047735106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019491032,0.000085110936,0.00068247155,0.000008688498,0.0000042499983,0.000021897207,0.004343268,0.000054053242,0.00029281512,0.9813878,0.00015715686,0.0129429875],"study_design_scores_gemma":[0.00057723414,0.00009251481,0.004554286,0.00001565251,0.0000013567292,0.000009476646,0.0002709468,0.00048807,0.0012628306,0.9901854,0.0024493102,0.00009295601],"about_ca_topic_score_codex":0.0000611619,"about_ca_topic_score_gemma":0.000009099246,"teacher_disagreement_score":0.012850031,"about_ca_system_score_codex":0.000012944399,"about_ca_system_score_gemma":0.000024492852,"threshold_uncertainty_score":0.2539558},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9858539,0.00051789463,0.00028565363,0.0008633964,0.002347739,0.00012727972,0.000001039251,0.00024497104,0.009758135],"genre_scores_gemma":[0.9972058,0.000028087587,0.0021666193,0.00033326083,2.7794547e-7,0.000005040662,4.4373073e-7,0.000007727706,0.0002527629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901,0.00004256299,0.00020075793,0.0002622815,0.00027970775,0.00020467804],"domain_scores_gemma":[0.9990274,0.00009043319,0.00008345996,0.0005865439,0.0001334472,0.00007874187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015193423,0.00010945856,0.00014789417,0.00013726208,0.00007765283,0.000033185843,0.0005008046,0.00005335529,0.000043225336],"category_scores_gemma":[0.00005545566,0.00009771663,0.00005993691,0.00069970614,0.000050907514,0.00011471913,0.00008916328,0.00011161648,0.00015369465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014498115,0.00018742583,0.00019806456,0.000004767896,0.000010310257,0.000005781958,0.00017138006,0.000028695571,0.0004427326,0.98731846,0.009805377,0.0018255372],"study_design_scores_gemma":[0.00060904666,0.00021113575,0.00019104971,0.0000206963,0.0000035020541,0.000003620919,0.0000028849247,0.0054250765,0.0030575036,0.9900328,0.0003230993,0.00011959373],"about_ca_topic_score_codex":0.000019015717,"about_ca_topic_score_gemma":3.5342893e-7,"teacher_disagreement_score":0.011351888,"about_ca_system_score_codex":0.000008008242,"about_ca_system_score_gemma":0.000009550395,"threshold_uncertainty_score":0.39847684},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952755,0.00015990307,0.0014694192,0.00095220143,0.0012889784,0.000089294874,4.3971363e-7,0.00013930043,0.00062494614],"genre_scores_gemma":[0.99777913,0.00005269961,0.0013178654,0.00066329347,0.00000929648,0.000005834378,0.0000016610426,0.0000068711033,0.0001633249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999147,0.00004687016,0.00014074364,0.0002893562,0.00017605214,0.00019999046],"domain_scores_gemma":[0.9994697,0.00007881179,0.00005246658,0.00026389255,0.000031047446,0.00010409024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000930113,0.00011907114,0.00013601902,0.00007425932,0.00018809245,0.000053645083,0.00027957995,0.000040921284,0.000005058733],"category_scores_gemma":[0.00002973683,0.00010941327,0.00003654587,0.00019110097,0.000053484775,0.00021144545,0.00012482457,0.00008044434,0.000055935667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070249052,0.000045183566,0.00079938874,0.000003053782,0.0000091212005,0.000039520124,0.00038870578,0.0000301905,0.00024174433,0.9862533,0.004257631,0.0079251],"study_design_scores_gemma":[0.001381802,0.00021466897,0.018179413,0.000013972011,0.0000036356478,0.00007639659,0.0000043940927,0.009636066,0.0024635356,0.9651549,0.0025905245,0.0002807045],"about_ca_topic_score_codex":0.00004976252,"about_ca_topic_score_gemma":0.0000014135296,"teacher_disagreement_score":0.021098448,"about_ca_system_score_codex":0.000026453557,"about_ca_system_score_gemma":0.00003754448,"threshold_uncertainty_score":0.44617435},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9723286,0.0019501284,0.00041355062,0.0013605561,0.011273161,0.0002147168,0.0000017077991,0.0008022514,0.011655302],"genre_scores_gemma":[0.99205965,0.00003100448,0.0066643925,0.00057169853,0.000008180809,0.000016785425,0.0000032818236,0.000018620516,0.00062637636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998232,0.000079106256,0.0002906678,0.00036507103,0.0004005991,0.0006325574],"domain_scores_gemma":[0.9983429,0.00011249994,0.00010425092,0.0007963532,0.0003146747,0.00032934212],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00066127104,0.00020606654,0.00021496891,0.0001223371,0.00023288232,0.00013131625,0.0008134221,0.000112234855,0.000040893916],"category_scores_gemma":[0.00017488866,0.00018812479,0.00007286855,0.000740906,0.000038055638,0.000773356,0.00030254788,0.00021084353,0.0014388105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003264511,0.0002167357,0.0058080764,0.0000074410664,0.000020210482,0.00000206966,0.00040882427,0.000003935733,0.0017471818,0.97739327,0.013059867,0.0013291178],"study_design_scores_gemma":[0.0016445364,0.000262225,0.0051994356,0.000067141984,0.00002616816,0.000026027916,0.000023752109,0.004428205,0.006453133,0.9531411,0.028040342,0.0006879121],"about_ca_topic_score_codex":0.00004926394,"about_ca_topic_score_gemma":0.000003277247,"teacher_disagreement_score":0.024252156,"about_ca_system_score_codex":0.000028465802,"about_ca_system_score_gemma":0.000058594458,"threshold_uncertainty_score":0.9993387},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96134454,0.00061401015,0.010256444,0.00025475965,0.0020935175,0.00035749603,0.00000507505,0.00029269315,0.024781443],"genre_scores_gemma":[0.99402726,0.000026937007,0.0057528443,0.000043049928,0.0000013934354,0.00001719205,9.759307e-7,0.000011619039,0.00011872252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809885,0.00029629975,0.00028731118,0.00040920475,0.00048750004,0.0004208266],"domain_scores_gemma":[0.9976647,0.00040179555,0.00012223689,0.0014224376,0.00025107895,0.00013774968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006030759,0.00015829924,0.00025403654,0.00024066352,0.00011999432,0.00005224429,0.0020232943,0.0000802027,0.00004728005],"category_scores_gemma":[0.0007088073,0.00015207406,0.00009716294,0.0014522354,0.00020831477,0.00044003918,0.00026153607,0.00021475497,0.000028236582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050889103,0.00009426192,0.0038232906,0.000011629546,0.000021056409,0.000008441213,0.00015402379,0.0000038165726,0.0018323419,0.9927302,0.00036527737,0.00095055427],"study_design_scores_gemma":[0.00075964065,0.0001519277,0.0022759007,0.000015242184,0.0000031716427,0.000008002335,0.00003662763,0.000120302626,0.019604359,0.97633904,0.00051907107,0.00016669634],"about_ca_topic_score_codex":0.000012044243,"about_ca_topic_score_gemma":0.0000039757047,"teacher_disagreement_score":0.032682706,"about_ca_system_score_codex":0.000024657542,"about_ca_system_score_gemma":0.000113541086,"threshold_uncertainty_score":0.62014},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9929318,0.00043719425,0.002140946,0.00060221995,0.0009240173,0.0003082947,0.0000019849406,0.00030935,0.002344216],"genre_scores_gemma":[0.99688315,0.0000774669,0.002702504,0.000104766055,0.000004994089,0.000040520994,0.0000024270591,0.00002034943,0.00016381496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777335,0.0002707309,0.00032826953,0.0005360236,0.00049054314,0.0006010583],"domain_scores_gemma":[0.9977698,0.00045207463,0.00008194526,0.0014133774,0.00011452934,0.00016832066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054106966,0.0001961764,0.00030551237,0.00051302544,0.00019976938,0.000054588574,0.0022821443,0.0000977184,0.000019378636],"category_scores_gemma":[0.0005200933,0.00019930897,0.00010888275,0.0020452577,0.000193374,0.00072099897,0.00060070603,0.0003595084,0.00007853761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002928613,0.00016123758,0.029396135,0.000006584625,0.000012658029,0.0004028299,0.0003907123,0.000016302833,0.00025183058,0.9662821,0.0008906306,0.0021596465],"study_design_scores_gemma":[0.0024685415,0.000101541285,0.06534756,0.0000202758,0.0000013896,0.000050923776,0.0000150310725,0.0006977665,0.0021562509,0.9287168,0.00018647428,0.0002374409],"about_ca_topic_score_codex":0.0000433437,"about_ca_topic_score_gemma":0.000034569402,"teacher_disagreement_score":0.037565343,"about_ca_system_score_codex":0.000076616416,"about_ca_system_score_gemma":0.00009845962,"threshold_uncertainty_score":0.8127584},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96137077,0.00053440867,0.024479311,0.0013341575,0.00442651,0.0005398818,0.000008742347,0.00031631315,0.0069899326],"genre_scores_gemma":[0.9968311,0.000038257996,0.0029004393,0.000071324044,0.000013164793,0.000012314742,6.1129185e-7,0.0000110546725,0.00012172472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983273,0.00019659271,0.0002717927,0.00030638173,0.0004662602,0.00043164764],"domain_scores_gemma":[0.997717,0.00048038608,0.00012774345,0.0011559008,0.00040801687,0.00011095485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008448841,0.00012743019,0.00017278643,0.00010295889,0.00043231618,0.000057816662,0.0018401087,0.000045634457,0.000008054321],"category_scores_gemma":[0.00019418572,0.000092910544,0.00008753911,0.0012043858,0.000701945,0.00027051618,0.0005138231,0.00019339158,0.00010613929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001714,0.000043218188,0.0012081896,0.000004018911,0.000017818435,0.0000022476927,0.00014081592,0.000002220057,0.0018147548,0.9938894,0.0005255905,0.0023345856],"study_design_scores_gemma":[0.00034540475,0.00027251928,0.0028723641,0.00000980504,0.0000026657342,0.0000025465001,0.000011054159,0.0048441147,0.011475701,0.96857554,0.011472243,0.00011604262],"about_ca_topic_score_codex":0.000019126965,"about_ca_topic_score_gemma":0.000008111673,"teacher_disagreement_score":0.035460364,"about_ca_system_score_codex":0.000022413542,"about_ca_system_score_gemma":0.000054008116,"threshold_uncertainty_score":0.3788782},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95412993,0.00036015318,0.00001691994,0.0002671379,0.0039963685,0.00023533632,0.0000038334742,0.00038160928,0.04060868],"genre_scores_gemma":[0.9993958,0.000022621134,0.00000624324,0.00011626509,0.000029795068,0.000045928504,0.0000010640861,0.000037598616,0.0003446993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991305,0.00007072164,0.00017746547,0.0001556025,0.00017140633,0.0002943052],"domain_scores_gemma":[0.9992506,0.0002479709,0.00002916244,0.00038616237,0.000017885519,0.00006821661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022535548,0.00018371812,0.00017392579,0.000053890988,0.00015196996,0.00005153045,0.00026731123,0.00009675672,0.00020768004],"category_scores_gemma":[0.0000380043,0.00013849285,0.00008607966,0.00022864268,0.000037688333,0.000063240805,0.00002199485,0.00029061403,0.00064247835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006560689,0.00004019363,0.00027264765,0.000027650447,0.000057708552,0.000024223424,0.00087392837,0.0009352701,0.0014491809,0.9832167,0.012575071,0.0005208795],"study_design_scores_gemma":[0.003610643,0.0006059487,0.0033337339,0.0003853838,0.000099133475,0.00010248911,0.00057903246,0.039021038,0.04830913,0.7395209,0.16266987,0.0017626935],"about_ca_topic_score_codex":0.000006715305,"about_ca_topic_score_gemma":0.0000031256154,"teacher_disagreement_score":0.24369577,"about_ca_system_score_codex":0.000051735442,"about_ca_system_score_gemma":0.0000028267136,"threshold_uncertainty_score":0.8257974},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9724281,0.0003503356,0.00014620833,0.00000441092,0.0019775014,0.00012405729,0.000001723081,0.00019832996,0.024769366],"genre_scores_gemma":[0.9997829,0.000009343394,0.000060537594,0.000011619242,0.000007135113,0.000005057495,0.000002134333,0.000029076633,0.00009217018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991424,0.000028790337,0.00026838548,0.00013405958,0.00017202746,0.00025434745],"domain_scores_gemma":[0.99934536,0.00015964344,0.00004408488,0.00034216512,0.00003253766,0.00007623343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000476631,0.00014213183,0.0001983286,0.00015853341,0.000042639414,0.000009243027,0.00017073534,0.000098263175,0.000029350078],"category_scores_gemma":[0.000029278803,0.00014543111,0.00010055554,0.0002797123,0.00004093613,0.00006104182,0.00001390011,0.00013833278,0.00004877161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028175722,0.000065614666,0.0015496248,0.0000947029,0.00006628385,0.00001882528,0.00042821356,0.00041791066,0.014315186,0.9804479,0.0014846822,0.0010829162],"study_design_scores_gemma":[0.0020392695,0.0002590854,0.01384245,0.00042619818,0.000040506657,0.000015380121,0.0004823714,0.0017301824,0.24630113,0.7291732,0.0050733304,0.00061693956],"about_ca_topic_score_codex":0.000015943437,"about_ca_topic_score_gemma":0.000004694458,"teacher_disagreement_score":0.2512747,"about_ca_system_score_codex":0.000023197357,"about_ca_system_score_gemma":0.000003261957,"threshold_uncertainty_score":0.5930509},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99676746,0.00081682164,0.0013487146,0.000058354955,0.00038194397,0.00018037327,7.8075493e-7,0.000056857163,0.0003886892],"genre_scores_gemma":[0.9547695,0.000011618995,0.045152865,0.00003870551,3.6395303e-7,0.000005688725,8.7683253e-7,0.0000099378185,0.00001045471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983563,0.000057671947,0.0005094225,0.00030733232,0.0004629133,0.0003063766],"domain_scores_gemma":[0.9987455,0.0001647476,0.00025752262,0.0005037356,0.00024206142,0.00008643987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011780093,0.00013944488,0.00029324592,0.00030592232,0.000041390173,0.000018181054,0.0004643573,0.00007456189,0.000001134332],"category_scores_gemma":[0.00006298001,0.00011257732,0.00004818373,0.0012289316,0.0001082506,0.00015531734,0.000121430465,0.0001610428,0.0000023179907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053068758,0.0006180965,0.03808751,0.00008115068,0.000021433207,0.000050640007,0.0010178777,0.00008550907,0.014772635,0.9356109,0.000053693067,0.009547467],"study_design_scores_gemma":[0.0038910438,0.0013044633,0.031129628,0.0010195393,0.00002198339,0.00001552929,0.00034372706,0.0032618397,0.049975183,0.9085019,0.00008183141,0.00045327848],"about_ca_topic_score_codex":0.0001233031,"about_ca_topic_score_gemma":0.000021349044,"teacher_disagreement_score":0.043804154,"about_ca_system_score_codex":0.000020246069,"about_ca_system_score_gemma":0.00009018777,"threshold_uncertainty_score":0.45907697},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8223347,0.000113186055,0.01077859,0.00055337447,0.016009118,0.0032704554,0.000023457536,0.0017620347,0.1451551],"genre_scores_gemma":[0.9787652,0.000013844264,0.01882051,0.0002453261,0.0001586835,0.00042981605,0.000016553553,0.0002200538,0.0013300396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956993,0.0002308719,0.0011210826,0.00086731423,0.00090929907,0.0011721661],"domain_scores_gemma":[0.9961101,0.00081224786,0.00038589712,0.0016543586,0.00044152007,0.00059590954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010224945,0.0007032762,0.0010585557,0.00029312208,0.0003227118,0.0001661922,0.0011176176,0.00036266897,0.00007709105],"category_scores_gemma":[0.0022298489,0.0007146273,0.0002621825,0.0011348182,0.00011672248,0.0004077973,0.00050709763,0.00060610945,0.00020225042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013309288,0.0013752433,0.0001283614,0.00012908387,0.000079490535,0.000016620295,0.0013958599,0.000005344093,0.00045990865,0.9915322,0.00443785,0.00030692917],"study_design_scores_gemma":[0.0035095334,0.0003840819,0.000032767097,0.00006695699,0.00007173292,0.000046486344,0.0005511304,0.00051910896,0.00080751884,0.9831902,0.009971481,0.0008490234],"about_ca_topic_score_codex":0.0000454761,"about_ca_topic_score_gemma":0.00000360226,"teacher_disagreement_score":0.15643048,"about_ca_system_score_codex":0.00046271493,"about_ca_system_score_gemma":0.00018139184,"threshold_uncertainty_score":0.9995305},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9603314,0.00024170779,0.000012312458,0.00000864225,0.001264999,0.000114252514,0.0000018104901,0.00018337053,0.037841532],"genre_scores_gemma":[0.99946445,0.000059362617,0.000024909268,0.0000074140244,0.0000045438496,0.000014012564,0.0000019979275,0.000021015596,0.00040229651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944186,0.000028222217,0.00017385751,0.00008960803,0.00010947326,0.00015699811],"domain_scores_gemma":[0.99965274,0.000018927985,0.000023214194,0.00022949492,0.000031946045,0.000043688022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012411895,0.0001044171,0.00017505424,0.00005524218,0.000029630039,0.000008821662,0.00013717191,0.00005598176,0.000029680481],"category_scores_gemma":[0.000011649829,0.00007656122,0.00004682059,0.00018035831,0.00003878911,0.000082526465,0.000014852119,0.000077405806,0.00004683143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060469545,0.00021954639,0.2315633,0.00045312586,0.00025866798,0.000038944192,0.0026171373,0.0009495621,0.028866528,0.71777743,0.0066683986,0.010526902],"study_design_scores_gemma":[0.00474041,0.00045252062,0.056334507,0.00055566465,0.00011132784,0.00013553118,0.0018714864,0.010139894,0.06992667,0.7366405,0.117451325,0.001640161],"about_ca_topic_score_codex":0.0000228129,"about_ca_topic_score_gemma":0.000003470172,"teacher_disagreement_score":0.17522879,"about_ca_system_score_codex":0.000013490257,"about_ca_system_score_gemma":0.0000062000413,"threshold_uncertainty_score":0.3122076},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9492166,0.0006085735,0.03941855,0.00024029768,0.003494374,0.00019968627,0.0000013001207,0.00017423967,0.006646362],"genre_scores_gemma":[0.9904298,0.000017881937,0.009314263,0.000172092,0.000004018344,0.0000051308716,9.89374e-7,0.000005432778,0.000050357663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918324,0.00007327909,0.00018156931,0.00021433781,0.00015982072,0.00018774542],"domain_scores_gemma":[0.999335,0.00006610361,0.00009167194,0.00038704937,0.000056682937,0.00006350704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015683039,0.000092194394,0.00014122618,0.000060458537,0.00007070174,0.000027906695,0.00040161956,0.00004775103,0.00001390678],"category_scores_gemma":[0.00005309764,0.00008813887,0.000044375876,0.00026837876,0.0000344111,0.0005552455,0.000070115755,0.00007874377,0.000045949164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015288845,0.00007969035,0.00045230612,0.0000049286064,0.0000058745586,0.000007005345,0.00007578097,0.000023282706,0.002506422,0.99601436,0.00017716025,0.0006516829],"study_design_scores_gemma":[0.00044873284,0.00008453212,0.0019930766,0.000009600627,0.0000026335442,0.000009817615,0.000005947144,0.0003287875,0.0259668,0.9705898,0.00045319842,0.000107077314],"about_ca_topic_score_codex":0.0000031558598,"about_ca_topic_score_gemma":3.125904e-7,"teacher_disagreement_score":0.041213218,"about_ca_system_score_codex":0.000023769984,"about_ca_system_score_gemma":0.00004248945,"threshold_uncertainty_score":0.35941988},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8577252,0.0021792504,0.0000035558069,0.000071837545,0.00528634,0.0003821183,0.000041450417,0.00013930627,0.13417095],"genre_scores_gemma":[0.998342,0.00019067101,0.00002300005,0.000021825617,0.000029974704,0.00003907291,0.000007631417,0.00007352962,0.0012723078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975901,0.0000990308,0.0008119934,0.00041146862,0.000413799,0.0006735859],"domain_scores_gemma":[0.9985224,0.00017763715,0.00022942586,0.000712464,0.000118971846,0.00023908512],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042629312,0.00045940685,0.0007647678,0.00022077067,0.00013444848,0.000052553383,0.00053827325,0.00037430777,0.0008179776],"category_scores_gemma":[0.000049495156,0.000531996,0.00029446828,0.00068276084,0.00018736653,0.0002217616,0.00009955719,0.00046256345,0.0010376616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004404404,0.00040704446,0.0066687893,0.0007360496,0.00032014036,0.00007206253,0.002026208,0.00015627687,0.006429824,0.97675866,0.0060880054,0.00029288782],"study_design_scores_gemma":[0.016465072,0.0039534904,0.023804016,0.0029041297,0.0010427102,0.00023210503,0.0028285806,0.022355683,0.035442024,0.8540116,0.03214575,0.004814868],"about_ca_topic_score_codex":0.000053561947,"about_ca_topic_score_gemma":0.0000025710629,"teacher_disagreement_score":0.14061679,"about_ca_system_score_codex":0.00008816067,"about_ca_system_score_gemma":0.000018773902,"threshold_uncertainty_score":0.9997401},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9279797,0.0009011349,0.055577748,0.0024324434,0.0013188953,0.00060139666,0.0000064355254,0.0004029174,0.010779322],"genre_scores_gemma":[0.974195,0.000022130102,0.02537568,0.00006226456,0.0000045486477,0.000016940201,0.0000012819733,0.000007783372,0.00031435105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890006,0.00009218,0.00022005336,0.0002440835,0.0002949635,0.00024863426],"domain_scores_gemma":[0.9988159,0.00018824963,0.000072380164,0.00066678255,0.00016493224,0.00009176925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029020742,0.00009710361,0.00014522787,0.00017405808,0.000118971635,0.000031498497,0.0008404323,0.000044225475,0.000029624856],"category_scores_gemma":[0.000095876014,0.0000962369,0.00006864356,0.00075432484,0.000093839146,0.00047636835,0.00018599434,0.00013907772,0.00008039794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041354247,0.00012342451,0.0006210093,0.0000036591825,0.000013331195,0.0000016454402,0.00030745138,0.000094604715,0.0040388717,0.98559374,0.00041021686,0.008787932],"study_design_scores_gemma":[0.0010862777,0.00010657057,0.0013399961,0.0000120357445,0.0000037185343,0.000003919296,0.000018551633,0.011669575,0.046441205,0.9340735,0.005068593,0.00017607272],"about_ca_topic_score_codex":0.000007146426,"about_ca_topic_score_gemma":0.00000515883,"teacher_disagreement_score":0.051520236,"about_ca_system_score_codex":0.000023984783,"about_ca_system_score_gemma":0.000050762996,"threshold_uncertainty_score":0.3924427},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9981652,0.00016857704,0.00038756448,0.00023867494,0.00020301915,0.00023879872,0.00002254536,0.0000089961095,0.00056663196],"genre_scores_gemma":[0.9983219,0.00004145143,0.0007124881,0.0002990219,0.00001735561,0.000044332955,0.00008254485,0.000016470833,0.0004644694],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99905205,0.00011677877,0.0001875012,0.000274644,0.00019401772,0.0001750266],"domain_scores_gemma":[0.9992269,0.000030092584,0.00007106415,0.0004921663,0.00009835527,0.00008138302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002234678,0.00012648053,0.00018766572,0.00012588443,0.00007879459,0.000023737684,0.00024470052,0.000063775784,0.00015657922],"category_scores_gemma":[0.00006587619,0.00009805001,0.00013223647,0.0005292078,0.000034019293,0.0000031211766,0.00004926517,0.00005300565,0.00003669147],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035907645,0.0024932292,0.0020890748,0.000028695595,0.008660871,0.00003378307,0.003269355,0.014891315,0.7967958,0.036176994,0.016940098,0.118261725],"study_design_scores_gemma":[0.01747866,0.0057023535,0.040335357,0.000042967466,0.003841301,0.0000168532,0.0010114483,0.23503532,0.63637596,0.03758526,0.020006573,0.0025679795],"about_ca_topic_score_codex":0.000016360398,"about_ca_topic_score_gemma":0.0000063744105,"teacher_disagreement_score":0.22014399,"about_ca_system_score_codex":0.000013263442,"about_ca_system_score_gemma":0.000008492488,"threshold_uncertainty_score":0.39983633},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98064625,0.000027293821,0.0071342234,0.0016138576,0.0011142205,0.0002909705,0.0000013855213,0.00009397274,0.0090778405],"genre_scores_gemma":[0.99847513,0.0000061075793,0.0011689886,0.00016951631,0.000003433988,0.000026196178,8.4159035e-7,0.000012145505,0.00013766569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985466,0.00013364703,0.00020095312,0.00028699538,0.00054574263,0.00028606204],"domain_scores_gemma":[0.99844235,0.00036693757,0.00010133915,0.00083931285,0.0001840516,0.00006601636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006341805,0.00012992103,0.00014451059,0.00010135258,0.0001774146,0.000066092965,0.0011222708,0.000058891084,0.000033702425],"category_scores_gemma":[0.00017553101,0.0000962649,0.000094532756,0.0009266341,0.00020044057,0.0003355712,0.00017844654,0.00019969804,0.00013051287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024558874,0.00017605584,0.0002465644,0.0000040094524,0.000013447838,0.0000067871642,0.00025343813,0.000031555148,0.0012540927,0.99688596,0.00015657529,0.0009469465],"study_design_scores_gemma":[0.00071464916,0.00017527299,0.00094020687,0.000021151965,0.0000024080043,0.0000041449593,0.000020609164,0.00011626407,0.01820487,0.97951245,0.00017960876,0.000108359345],"about_ca_topic_score_codex":0.000011442933,"about_ca_topic_score_gemma":0.000001412531,"teacher_disagreement_score":0.01782887,"about_ca_system_score_codex":0.00007065966,"about_ca_system_score_gemma":0.00007167188,"threshold_uncertainty_score":0.39255685},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938062,0.00014740785,0.0023729939,0.00006120533,0.0007913643,0.0006644787,0.000012863479,0.000023619443,0.0021199097],"genre_scores_gemma":[0.9145449,0.0000060903535,0.08504179,0.000086600434,0.0000040050086,0.0000082540255,0.000002417031,0.000021082433,0.00028485557],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9952059,0.0007911404,0.0015978408,0.00050449045,0.0014577309,0.00044294135],"domain_scores_gemma":[0.995011,0.0031718567,0.0004946794,0.000796849,0.00037156523,0.00015409541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007786536,0.0002239756,0.0006369288,0.0005924341,0.000057031248,0.000050193714,0.00091818173,0.00010936823,0.00028092056],"category_scores_gemma":[0.0016416768,0.00015714871,0.000143883,0.0016740597,0.00028387137,0.0004946439,0.0002756184,0.00018328699,0.000033117485],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009266447,0.0017973621,0.18132332,0.000029951872,0.00006743036,0.0000768814,0.002168966,0.0002524359,0.7090345,0.078660965,0.00791817,0.017743388],"study_design_scores_gemma":[0.0020203376,0.001015725,0.053975724,0.0000778443,0.000019436258,0.000010897665,0.0011656337,0.00094222545,0.7993808,0.13881578,0.0021957909,0.00037981168],"about_ca_topic_score_codex":0.0006547481,"about_ca_topic_score_gemma":0.00004341733,"teacher_disagreement_score":0.12734759,"about_ca_system_score_codex":0.000113266244,"about_ca_system_score_gemma":0.000107645945,"threshold_uncertainty_score":0.64083385},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.856582,0.0001990553,0.13003266,0.0011083629,0.0012020618,0.0005612046,0.000010961431,0.00018779935,0.010115914],"genre_scores_gemma":[0.98650116,0.000020526626,0.012968555,0.00016583747,0.000007855277,0.000050060473,0.000002256811,0.000009878277,0.0002738489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897027,0.000053579573,0.00031466805,0.00019251108,0.00028637575,0.0001825867],"domain_scores_gemma":[0.9985294,0.0003323474,0.00019354116,0.0005681979,0.0003406817,0.0000358452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005296435,0.000103514096,0.00017685232,0.000046762023,0.00008752479,0.000051279127,0.0008167925,0.0000701329,0.00004770006],"category_scores_gemma":[0.00009554765,0.00008046099,0.00009529742,0.00041565308,0.00009293949,0.00032191558,0.00011165053,0.00009205879,0.0000057705097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000134702905,0.00013043404,0.0046403315,0.00000929935,0.000020492107,0.0000014252446,0.00039887452,0.000007082997,0.00060982216,0.9919178,0.0015362807,0.0007147048],"study_design_scores_gemma":[0.00058933155,0.00027809708,0.003934389,0.00002660461,0.000012815525,0.000015938645,0.000039032,0.0021285499,0.007056601,0.9792016,0.0065646954,0.00015234342],"about_ca_topic_score_codex":0.00007314394,"about_ca_topic_score_gemma":0.000014681634,"teacher_disagreement_score":0.12991919,"about_ca_system_score_codex":0.000014903504,"about_ca_system_score_gemma":0.00015532774,"threshold_uncertainty_score":0.3281104},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902064,0.0007675455,0.00053961395,0.0005422396,0.0018345356,0.000101117126,0.0000016684673,0.00024945723,0.0057574185],"genre_scores_gemma":[0.99244577,0.000010921565,0.007193143,0.00012121276,0.0000015647948,0.0000032333908,0.0000028764625,0.000009204105,0.00021206631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988028,0.000037314276,0.00031049704,0.00029570854,0.00030185463,0.0002518519],"domain_scores_gemma":[0.9990286,0.000058395588,0.00013159409,0.000535843,0.00018938228,0.000056142097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029811173,0.00012402401,0.00019909629,0.00012111667,0.00007863727,0.000052233536,0.00057014736,0.000058781705,0.0000075483204],"category_scores_gemma":[0.000026651167,0.00011587639,0.000072898336,0.00056314055,0.00007252526,0.00021234069,0.00015848393,0.00010486826,0.00006594632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015485801,0.0001230739,0.002621974,0.000010445227,0.000006080994,0.0000070196184,0.000044281158,0.000038870246,0.0058951527,0.98499674,0.0057474454,0.0005073536],"study_design_scores_gemma":[0.00061348494,0.00006931193,0.00221699,0.00002486299,0.0000060977245,0.0000072545063,0.0000026337382,0.00256345,0.01663029,0.97694075,0.00077732035,0.00014757412],"about_ca_topic_score_codex":0.00027958845,"about_ca_topic_score_gemma":0.0000019008129,"teacher_disagreement_score":0.010735136,"about_ca_system_score_codex":0.000011734177,"about_ca_system_score_gemma":0.000041889,"threshold_uncertainty_score":0.47253022},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933297,0.00070202746,0.0014446363,0.00028194327,0.0009157148,0.00026779054,0.0000037611442,0.00010007355,0.0029543748],"genre_scores_gemma":[0.99920535,0.00023382703,0.00038218932,0.000021907868,0.0000017851738,0.000022958751,0.0000010884702,0.000013028186,0.00011784245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981301,0.0002894271,0.000375112,0.00029729423,0.00049925654,0.00040880163],"domain_scores_gemma":[0.9966465,0.0016426092,0.00022507095,0.0010203202,0.00037852442,0.000086979846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007838698,0.0001576277,0.00029716728,0.00022720362,0.0002275192,0.000042152536,0.0015347017,0.00006497805,0.0000124986245],"category_scores_gemma":[0.00035825185,0.00012108364,0.00015046433,0.001618899,0.000632501,0.00034293527,0.00027908137,0.00019886621,0.0000047797894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005137856,0.00009259061,0.003676239,0.000011722294,0.000049241928,0.0000067544015,0.0003483089,0.000007644877,0.0031146558,0.9892659,0.00018253336,0.0031930401],"study_design_scores_gemma":[0.00073777017,0.00026915854,0.0042517902,0.00002216977,0.0000051592506,0.000011589782,0.00018296267,0.00043469263,0.021970151,0.9713538,0.0006316113,0.00012913687],"about_ca_topic_score_codex":0.000036562324,"about_ca_topic_score_gemma":0.000015387657,"teacher_disagreement_score":0.018855495,"about_ca_system_score_codex":0.000019494213,"about_ca_system_score_gemma":0.00007450084,"threshold_uncertainty_score":0.49376476},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99121714,0.00069306913,0.0004873738,0.0030715219,0.0016894592,0.00036417847,0.000006402276,0.000028983224,0.002441868],"genre_scores_gemma":[0.9991376,0.000118365984,0.00018717683,0.0004541785,0.0000055850824,0.000007971021,9.893065e-7,0.000008704735,0.000079426645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998204,0.0005664623,0.00038255673,0.00021754245,0.0004316328,0.0001977854],"domain_scores_gemma":[0.99567145,0.0017851753,0.00028009294,0.0020466058,0.000176127,0.00004055933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011508409,0.00014471654,0.00020870203,0.00004983001,0.00033542686,0.000032502412,0.002967402,0.000064173524,0.000036217752],"category_scores_gemma":[0.00026578194,0.00007225907,0.00018821348,0.0011045798,0.00033307922,0.00009162311,0.0007235267,0.00028631257,0.0000032520163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023904788,0.00013788992,0.002685587,0.000002990652,0.000032700857,5.054162e-7,0.0014055113,0.000018970299,0.0042836536,0.98767656,0.0022829142,0.0014487826],"study_design_scores_gemma":[0.0021807724,0.00026824736,0.08700092,0.00032139657,0.00004902409,0.0000019257614,0.00044615733,0.0064030914,0.113893084,0.7827651,0.006294396,0.00037586718],"about_ca_topic_score_codex":0.000024748977,"about_ca_topic_score_gemma":0.000038943163,"teacher_disagreement_score":0.20491147,"about_ca_system_score_codex":0.00003997716,"about_ca_system_score_gemma":0.00008436513,"threshold_uncertainty_score":0.55142206},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9970416,0.000106399595,0.00026080429,0.00044753889,0.00093067694,0.00019328717,0.000008634473,0.0001942754,0.00081677345],"genre_scores_gemma":[0.99049973,0.000010355895,0.009039081,0.00031733944,0.0000014005674,0.000015367608,0.0000056287085,0.000018377334,0.000092688984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983101,0.000042017677,0.0003433125,0.0004621145,0.00045312705,0.00038934877],"domain_scores_gemma":[0.9983342,0.00021207605,0.00019685294,0.00085513486,0.00022764214,0.00017405943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019181857,0.00021550577,0.00029310462,0.00005428233,0.00019383736,0.000050865838,0.0006391126,0.00007388296,0.000024813613],"category_scores_gemma":[0.000064375236,0.00017981174,0.00007906302,0.00081774767,0.0001788277,0.00026864113,0.00026647167,0.0001528636,0.000103243125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016111839,0.00028592348,0.056446027,0.000019494197,0.000045911558,0.0000141284245,0.00020253722,0.00032951828,0.001749259,0.93998617,0.0006890152,0.00021592421],"study_design_scores_gemma":[0.0037130436,0.00022589229,0.022157483,0.00014275714,0.000022201075,0.0000346893,0.000008759224,0.0005919325,0.004798455,0.9662993,0.0016338181,0.0003716813],"about_ca_topic_score_codex":0.0004398287,"about_ca_topic_score_gemma":0.00018405105,"teacher_disagreement_score":0.034288544,"about_ca_system_score_codex":0.000039529023,"about_ca_system_score_gemma":0.000066403976,"threshold_uncertainty_score":0.73325104},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99796146,0.00028820153,0.00014741695,0.000020605155,0.0002407562,0.00005703363,9.29681e-7,0.000008884613,0.0012747266],"genre_scores_gemma":[0.99948347,0.00002675211,0.0002873193,0.000094979805,0.000014058583,3.8378926e-7,0.000009817955,0.000005020006,0.0000782312],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994281,0.000022829174,0.00014273004,0.00017982529,0.0000626635,0.00016387885],"domain_scores_gemma":[0.99965996,0.000030886255,0.000056757282,0.00013592765,0.0000569697,0.000059491947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029706556,0.000079356796,0.0001171913,0.000016511805,0.000040704046,0.0000065285,0.00008827092,0.00010383884,0.0000031814209],"category_scores_gemma":[0.0000888866,0.00006780821,0.000037182475,0.000065707834,0.000080941034,0.0000011723566,0.00012665501,0.000054659016,0.0000020656375],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001100777,0.0001339394,0.28746727,0.000024994344,0.00005147932,0.000010835823,0.000030680127,0.000001687286,0.6748743,0.02341751,0.0005457596,0.0133314505],"study_design_scores_gemma":[0.00094165915,0.00059221085,0.48017433,0.000020827192,0.000021544747,0.000024886234,0.00004784343,0.000026808792,0.49174464,0.023012787,0.0031220396,0.00027040308],"about_ca_topic_score_codex":0.000012312108,"about_ca_topic_score_gemma":0.000006530482,"teacher_disagreement_score":0.19270706,"about_ca_system_score_codex":0.000004777764,"about_ca_system_score_gemma":0.000011286023,"threshold_uncertainty_score":0.27651384},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9158916,0.0006746594,0.035163827,0.006533103,0.0026146374,0.0009796936,0.000003375088,0.0030648878,0.035074238],"genre_scores_gemma":[0.96584857,0.0000039213705,0.033940215,0.00010035955,0.0000026572752,0.000025488936,0.0000030755223,0.000008656196,0.00006706743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990678,0.000019600413,0.00019466568,0.0003132288,0.00018694473,0.00021776563],"domain_scores_gemma":[0.99932146,0.0000262513,0.000056708926,0.0004865748,0.00005721456,0.00005177279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020253652,0.000106397616,0.00012424319,0.00020357485,0.00005162898,0.00021819447,0.0006832535,0.000033990636,0.0000015276665],"category_scores_gemma":[0.000108475026,0.00010850746,0.00003117967,0.00086659665,0.000043701013,0.0010537469,0.00014780817,0.00011618396,0.00003182924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019074002,0.00015452871,0.0008287276,0.000006424071,0.0000026748319,0.000019101144,0.00019725166,0.000012841717,0.00032129814,0.9908854,0.00036433476,0.007205526],"study_design_scores_gemma":[0.0005312857,0.000043385186,0.004514269,0.000034368622,0.0000011709299,0.000009212301,0.0000025880854,0.000071099676,0.014350766,0.97996783,0.0003391739,0.00013483076],"about_ca_topic_score_codex":0.0000513365,"about_ca_topic_score_gemma":0.000008273338,"teacher_disagreement_score":0.04995698,"about_ca_system_score_codex":0.00006693518,"about_ca_system_score_gemma":0.00009837755,"threshold_uncertainty_score":0.44248056},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9882483,0.00004583771,0.000012505347,0.0003728723,0.00061553234,0.00020364416,0.0000036503645,0.000050738432,0.010446925],"genre_scores_gemma":[0.9993851,0.000008145308,0.00014328638,0.00013376106,0.00001464263,0.000012099225,0.0000012500693,0.000016275053,0.00028540386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992027,0.000039544666,0.00023037315,0.00013177613,0.00018306405,0.0002125412],"domain_scores_gemma":[0.9985563,0.0007449577,0.00010660635,0.0005033905,0.00003843421,0.000050315284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007536923,0.0001084003,0.00014293265,0.000065925546,0.00013963683,0.000013646273,0.000275551,0.00005840824,0.00006769686],"category_scores_gemma":[0.00010265297,0.000077466735,0.000120355704,0.00027968592,0.00015442343,0.000046426278,0.000024449128,0.00016775145,0.000035616005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025314035,0.0003116443,0.00021258112,0.000007972854,0.000028545104,0.0000024715894,0.00017916333,1.4247986e-7,0.0010789527,0.99471706,0.0033717554,0.0000643671],"study_design_scores_gemma":[0.00027596205,0.00009363859,0.001495209,0.000014457969,0.000019861498,0.000002244083,0.00007321691,0.0000021553094,0.01744618,0.97934186,0.001148389,0.000086799075],"about_ca_topic_score_codex":0.0000038571275,"about_ca_topic_score_gemma":0.0000020999857,"teacher_disagreement_score":0.016367227,"about_ca_system_score_codex":0.000017373653,"about_ca_system_score_gemma":0.000013561813,"threshold_uncertainty_score":0.31590018},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72651476,0.00038944397,0.26583248,0.00089220953,0.0021229282,0.00030403156,0.0000033243075,0.0005786843,0.0033621453],"genre_scores_gemma":[0.9907076,0.000013627024,0.0087822275,0.00024765093,0.000018597362,0.000013598671,0.000002113754,0.000018255925,0.00019636545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985874,0.0000468672,0.00020259923,0.00048362336,0.00027372048,0.0004057715],"domain_scores_gemma":[0.99871457,0.00009135191,0.00010550539,0.0008243418,0.00005098438,0.00021327964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018810523,0.0002304643,0.00023229816,0.00009833219,0.00018787323,0.00020615122,0.00094399706,0.000074275675,0.000022836726],"category_scores_gemma":[0.000019372368,0.00019743347,0.00010255409,0.00072419335,0.00008376325,0.000486719,0.00015370446,0.00018371589,0.00003120517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049877544,0.00015529543,0.00084521563,0.0000073695796,0.00003392978,0.00001808786,0.0005137363,0.000007177125,0.0009879827,0.99194485,0.00042089762,0.0050156037],"study_design_scores_gemma":[0.002431789,0.00059660827,0.0022678226,0.000057844143,0.00001567407,0.0000116785495,0.000030671243,0.00021108487,0.0037414692,0.9864553,0.003811903,0.00036812254],"about_ca_topic_score_codex":0.000088636254,"about_ca_topic_score_gemma":0.000051104475,"teacher_disagreement_score":0.26419282,"about_ca_system_score_codex":0.00006088688,"about_ca_system_score_gemma":0.0001547188,"threshold_uncertainty_score":0.80511034},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96408147,0.000110574394,0.00026341647,0.00017459391,0.00051782356,0.00022561463,0.000005604843,0.0001360449,0.03448486],"genre_scores_gemma":[0.9909741,0.000039186525,0.0052889907,0.000024262212,0.000012659262,0.000019269331,0.0000028044349,0.00003361026,0.0036051143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987976,0.00004761708,0.00044295107,0.00017898084,0.0002628758,0.0002699772],"domain_scores_gemma":[0.9986844,0.0004967861,0.00020627608,0.00043186417,0.00009351871,0.00008713615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024214441,0.00015814256,0.0004077283,0.00010068439,0.000060947903,0.00001986882,0.00026710198,0.00008596758,0.0002234714],"category_scores_gemma":[0.00072969444,0.00014415685,0.00010641546,0.00024046708,0.00014270436,0.00018528292,0.00009446007,0.00010867865,0.000080202946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001562782,0.00021440274,0.0005800238,0.00009141633,0.00003604978,0.00001635963,0.00027906327,7.03178e-7,0.001103271,0.99449575,0.0030602538,0.000107077445],"study_design_scores_gemma":[0.0004819128,0.0000795694,0.00045047628,0.00006332891,0.000038695016,0.000012820992,0.00022701704,0.0000366428,0.0064405217,0.99139404,0.0006262132,0.00014877538],"about_ca_topic_score_codex":0.000019331983,"about_ca_topic_score_gemma":0.000014492963,"teacher_disagreement_score":0.030879745,"about_ca_system_score_codex":0.000049640086,"about_ca_system_score_gemma":0.00002920972,"threshold_uncertainty_score":0.58785456},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9668637,0.00015929074,0.005939513,0.0012227135,0.0005024818,0.00016888634,6.620818e-7,0.00049791456,0.024644827],"genre_scores_gemma":[0.9957401,0.000014191111,0.002673788,0.00026795213,0.0000055736364,0.000026309186,0.0000022946326,0.000007234285,0.0012625156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992463,0.00002202846,0.00013318886,0.0002521642,0.00015033642,0.000195983],"domain_scores_gemma":[0.99925196,0.00004259326,0.00002904991,0.0005763596,0.000021762746,0.00007827531],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011197889,0.000085384054,0.000093516624,0.000031271014,0.00014707707,0.00012718808,0.0006965834,0.000037720503,0.00015836323],"category_scores_gemma":[0.000006346712,0.000085338324,0.00004490872,0.00031172638,0.000014788274,0.0002547862,0.000081715276,0.00009122038,0.0010241928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.343287e-7,0.00006596989,0.0001236577,0.0000020476396,0.000005131601,0.0000060949346,0.00020201622,0.000009668302,0.0010770902,0.940574,0.0025549727,0.055378597],"study_design_scores_gemma":[0.00079300546,0.000064303895,0.006982591,0.000015591679,0.000008893316,0.00003222673,0.000013467825,0.056951936,0.005456117,0.7453947,0.18390876,0.0003783993],"about_ca_topic_score_codex":0.000027652795,"about_ca_topic_score_gemma":0.0000013196351,"teacher_disagreement_score":0.19517931,"about_ca_system_score_codex":0.000024641402,"about_ca_system_score_gemma":0.000033612854,"threshold_uncertainty_score":0.99975365},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.960137,0.0011237235,2.422747e-7,0.00006803843,0.00042599672,0.00006422915,0.000012475653,0.00005913226,0.038109172],"genre_scores_gemma":[0.994427,0.00019521643,0.00009914526,0.00019024605,0.0000064455676,5.0724816e-7,0.00003244541,0.0000025855,0.0050463635],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.999333,0.000058242826,0.000101026795,0.00017511816,0.0001280676,0.00020450848],"domain_scores_gemma":[0.99968326,0.00005469619,0.000016775535,0.00011706303,0.000012924115,0.00011526347],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015549631,0.00009648,0.00011278012,0.000012248595,0.00015888618,0.000057790974,0.00010227721,0.00004848061,0.011281619],"category_scores_gemma":[0.0000075529792,0.00007672953,0.000024218916,0.00011067698,0.000051855277,0.00013864574,0.0000027994352,0.00009416583,0.0006180057],"study_design_candidate":"observational","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.00007917519,0.000043943608,0.38191032,0.00001855028,0.000030115852,0.000058633876,0.0005587032,0.00004014007,0.000049032627,0.0020542017,0.009429588,0.6057276],"study_design_scores_gemma":[0.0011854266,0.00026355212,0.8655002,0.000030786436,0.000015928506,0.000056178007,0.00016041311,0.0009023565,0.00025093465,0.03882791,0.09232505,0.0004812618],"about_ca_topic_score_codex":0.0012371201,"about_ca_topic_score_gemma":0.00036646114,"teacher_disagreement_score":0.60524637,"about_ca_system_score_codex":0.0000019448223,"about_ca_system_score_gemma":0.0000112993075,"threshold_uncertainty_score":0.9896222},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97875625,0.00044022512,0.000008754656,0.000009412771,0.0013495546,0.00014953957,0.000004093911,0.00046205867,0.018820107],"genre_scores_gemma":[0.9992313,0.000043943197,0.00002071644,0.000018648665,0.000009678959,0.000029776586,0.0000068952004,0.000052485346,0.000586572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908227,0.000044842458,0.00016465825,0.00019369267,0.00019637113,0.00031816444],"domain_scores_gemma":[0.9994132,0.000043721808,0.000027308823,0.00036377806,0.000031789743,0.000120218625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010345844,0.00021134061,0.00022791614,0.00008720408,0.00019974129,0.000014047542,0.00018281507,0.00008167082,0.00007139112],"category_scores_gemma":[0.0000058033515,0.00018431456,0.00007879614,0.00033135025,0.0000935232,0.00012210294,0.000025374604,0.00015903266,0.0002466168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013750627,0.00015400833,0.16371718,0.00018251635,0.0003524925,0.00036455225,0.0018508744,0.001982214,0.0062050526,0.8092531,0.015429756,0.00037077584],"study_design_scores_gemma":[0.022101395,0.0032203428,0.2659357,0.0008990769,0.00037079418,0.0050244876,0.001181339,0.0060205194,0.10893431,0.44718546,0.13153589,0.007590695],"about_ca_topic_score_codex":0.000012699271,"about_ca_topic_score_gemma":0.000013659814,"teacher_disagreement_score":0.36206764,"about_ca_system_score_codex":0.00005102079,"about_ca_system_score_gemma":0.00001077211,"threshold_uncertainty_score":0.75161296},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9904583,0.00010487364,0.00015067011,0.00093039416,0.001413919,0.00011205105,0.0000015096764,0.000095487005,0.0067327837],"genre_scores_gemma":[0.99928844,0.0000030898054,0.00030909394,0.00030168018,5.644725e-7,0.0000064399997,0.0000012172897,0.000004763267,0.00008471595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990306,0.0000918122,0.00021195244,0.00020996573,0.00028577537,0.00016989055],"domain_scores_gemma":[0.9988415,0.0002691539,0.000107411215,0.000652095,0.000096224125,0.00003358152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004324269,0.000094618605,0.00012591823,0.000053114607,0.000118241274,0.000037656366,0.0005774762,0.000040664934,0.000010887225],"category_scores_gemma":[0.00004206126,0.00006428127,0.00007680722,0.00041060091,0.000098600896,0.000073646144,0.00010071049,0.00010273731,0.000031575895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000306575,0.00011000185,0.0013867744,0.0000026878538,0.000005492314,0.0000014709932,0.00002960403,0.00002275408,0.00051428017,0.9885381,0.009115632,0.00027016673],"study_design_scores_gemma":[0.00028824748,0.00008932792,0.0075404895,0.00001183298,0.0000031498785,0.0000011785374,0.000002957697,0.0005437482,0.003678592,0.9875406,0.00022223963,0.000077605015],"about_ca_topic_score_codex":0.0002601496,"about_ca_topic_score_gemma":0.0000038314797,"teacher_disagreement_score":0.008893392,"about_ca_system_score_codex":0.000009341653,"about_ca_system_score_gemma":0.000027835596,"threshold_uncertainty_score":0.2621314},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21321444,0.0001514607,0.7811908,0.00044975468,0.0021434703,0.00031228815,0.0000029405342,0.00014418048,0.0023906564],"genre_scores_gemma":[0.9638422,0.0000024315227,0.035668086,0.00028961417,0.000008649299,0.000040813324,0.00001790404,0.0000055669543,0.0001247239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992928,0.000049351507,0.0001379748,0.00022102731,0.00013070174,0.0001681409],"domain_scores_gemma":[0.9994255,0.00013955984,0.00004721104,0.000213191,0.0001105969,0.00006394272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023097446,0.000080091035,0.0000830401,0.000080304424,0.00017479919,0.000093460156,0.00020236096,0.00003651474,0.000010490609],"category_scores_gemma":[0.00007541064,0.000086142674,0.000054692715,0.00031831927,0.000009201894,0.0002806242,0.000027738372,0.000040309103,0.000026717176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025854945,0.000055919165,0.00008238861,0.0000037996717,0.000006584789,7.2396153e-7,0.000048561476,0.00023222422,0.0010000382,0.9916867,0.0032372081,0.0036432906],"study_design_scores_gemma":[0.0006384802,0.000109413384,0.00055189483,0.000002896134,0.000004202846,0.00001080758,0.000004889727,0.016025046,0.014510633,0.94184047,0.026171306,0.00012993642],"about_ca_topic_score_codex":0.0000024824737,"about_ca_topic_score_gemma":9.940558e-7,"teacher_disagreement_score":0.75062776,"about_ca_system_score_codex":0.000034635723,"about_ca_system_score_gemma":0.00006828928,"threshold_uncertainty_score":0.35127962},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88298273,0.00034453135,0.104611844,0.007414066,0.0020220361,0.0010982197,0.000008850946,0.0001223553,0.0013953707],"genre_scores_gemma":[0.9954645,0.000013620194,0.0034005118,0.0007347759,0.0000490612,0.00014882952,0.000014963931,0.000009582156,0.00016413014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874264,0.000092938135,0.00021249581,0.00036222415,0.00028969924,0.0002999811],"domain_scores_gemma":[0.99890816,0.0004109509,0.00007658682,0.0004137164,0.00010366402,0.00008691109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005466572,0.00015454399,0.0001635532,0.00015227795,0.00020393118,0.00017877317,0.00084506714,0.000060283357,0.0000084779385],"category_scores_gemma":[0.00013352404,0.000120920915,0.00006676483,0.00075875485,0.00001967081,0.0002557473,0.0001090768,0.000112434835,0.000036570047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005082867,0.00025946443,0.007356754,0.000014780999,0.000016010194,0.000035514186,0.0024802552,0.0036191999,0.00013653138,0.9560633,0.011874775,0.01809259],"study_design_scores_gemma":[0.0013119807,0.00038311968,0.09496596,0.00004860705,0.000008814953,0.0000314819,0.000201408,0.017927168,0.00035501644,0.84977436,0.034645963,0.0003461113],"about_ca_topic_score_codex":0.000019819625,"about_ca_topic_score_gemma":0.00007328578,"teacher_disagreement_score":0.112481795,"about_ca_system_score_codex":0.000046068868,"about_ca_system_score_gemma":0.000072602816,"threshold_uncertainty_score":0.49310118},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54810715,0.0009430346,0.43734655,0.0008701162,0.0045222496,0.00029449697,0.000016741691,0.00034236436,0.0075572934],"genre_scores_gemma":[0.9616875,0.000012516135,0.038137726,0.000040209816,0.000004542803,0.00000672428,0.0000018302145,0.0000055761316,0.00010334942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992607,0.000016331374,0.00019109882,0.00020256425,0.00017352188,0.00015577115],"domain_scores_gemma":[0.9991765,0.000024251693,0.000098584875,0.0005853007,0.00006358385,0.000051777944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107757834,0.00008332989,0.0001498964,0.000039768,0.000054788416,0.000011535136,0.00035161813,0.000028447359,0.0000030309468],"category_scores_gemma":[0.000034766672,0.00007721405,0.00003999486,0.00027543903,0.000057886344,0.0004835145,0.00013824482,0.00006011159,0.000026112137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018175527,0.000038433926,0.00014655343,0.0000088470015,0.0000046392297,0.000007272274,0.00019968633,0.000064268235,0.0016464744,0.9965887,0.00017164035,0.0011216349],"study_design_scores_gemma":[0.0011750301,0.0001570912,0.0030110208,0.00009920776,0.0000029887478,0.000018624261,0.000042801683,0.0000980638,0.05085763,0.92056566,0.023747662,0.0002241851],"about_ca_topic_score_codex":0.00007328956,"about_ca_topic_score_gemma":0.000015858042,"teacher_disagreement_score":0.41358036,"about_ca_system_score_codex":0.000032709762,"about_ca_system_score_gemma":0.0000685625,"threshold_uncertainty_score":0.31486976},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8892035,0.00031510481,0.028740395,0.0056846836,0.0028578176,0.0005623139,0.0000011723648,0.0011555557,0.07147947],"genre_scores_gemma":[0.9897412,0.00000787331,0.008860975,0.00090237934,0.000016212332,0.00001788766,8.9546273e-7,0.000009129075,0.00044345745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894863,0.000038099413,0.00017528629,0.00030838928,0.0002419159,0.00028768103],"domain_scores_gemma":[0.99918216,0.00008190858,0.00006751299,0.0005354125,0.00003756057,0.000095446965],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012965343,0.00013618018,0.00014134053,0.000058748923,0.00011323639,0.00007541562,0.00070423423,0.00005165493,0.000029020011],"category_scores_gemma":[0.000028706716,0.00011832906,0.00004864873,0.00020369071,0.000028829085,0.00040367353,0.00013390313,0.00014149958,0.0009574839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010965205,0.00012855636,0.00010263172,0.000005162863,0.000005207935,0.0000058892347,0.00019935062,0.00049792184,0.0001956736,0.98659587,0.0011011871,0.011161473],"study_design_scores_gemma":[0.0005301339,0.00020667695,0.0011508279,0.000022001652,0.0000023262926,0.000008684087,0.000004790166,0.010376693,0.001837509,0.97567385,0.009977515,0.00020897698],"about_ca_topic_score_codex":0.0000036671106,"about_ca_topic_score_gemma":0.0000031696554,"teacher_disagreement_score":0.1005377,"about_ca_system_score_codex":0.000057159345,"about_ca_system_score_gemma":0.000024388572,"threshold_uncertainty_score":0.9998204},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99490464,0.0005776565,0.0011594308,0.00042789467,0.0008664345,0.0003325968,0.000005842701,0.00050265645,0.001222851],"genre_scores_gemma":[0.9973237,0.00010823859,0.0020469087,0.00011822121,0.000012002956,0.00004049082,0.000008024761,0.000032539705,0.0003098996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972738,0.0002468715,0.00032585463,0.00081086525,0.0005614846,0.00078109937],"domain_scores_gemma":[0.99765253,0.0006171463,0.00005991283,0.0010468828,0.00025817193,0.00036534297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033341706,0.00031308262,0.00036750443,0.00034942012,0.0005408097,0.00012360467,0.0010469133,0.00014169807,0.000044067383],"category_scores_gemma":[0.00039290308,0.00030872758,0.00011046946,0.0014769558,0.00043096923,0.0010103463,0.00060018,0.00042985016,0.00007853947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003600198,0.00017081593,0.011590897,0.000013524956,0.00004498392,0.00020707163,0.0012807067,0.0000045254574,0.005197835,0.97894615,0.0006722287,0.0018352487],"study_design_scores_gemma":[0.0032962041,0.0006144044,0.06981958,0.00003436207,0.000010757864,0.00068699423,0.00013370419,0.0029048366,0.01233557,0.90833175,0.0009739166,0.000857946],"about_ca_topic_score_codex":0.000052120937,"about_ca_topic_score_gemma":0.000007511545,"teacher_disagreement_score":0.07061443,"about_ca_system_score_codex":0.000050912062,"about_ca_system_score_gemma":0.000110569425,"threshold_uncertainty_score":0.99993646},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96131724,0.000051823965,0.000011998772,0.000017466338,0.0032426785,0.00015973445,0.000015070451,0.0000753023,0.0351087],"genre_scores_gemma":[0.9992135,0.000035035053,0.00037924247,0.00005678145,0.000013990643,0.000007811322,0.0000049226687,0.00003404168,0.0002546575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987144,0.00008423315,0.00030231135,0.00022453762,0.00037548167,0.0002990512],"domain_scores_gemma":[0.9985424,0.00061543006,0.00009482473,0.0005769647,0.00008291544,0.00008742866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029054392,0.00018728436,0.00032085317,0.00007375823,0.00022230155,0.000006466801,0.00029976282,0.000143782,0.00015316505],"category_scores_gemma":[0.0003921864,0.0001624597,0.0001577595,0.00017577349,0.00013005464,0.00006666054,0.00010889226,0.00022914418,0.000014567999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016834166,0.00020966293,0.0016789787,0.000030219016,0.00007885076,0.000027713912,0.0012518126,7.677862e-7,0.000042442767,0.98756295,0.008808984,0.00013929339],"study_design_scores_gemma":[0.0017740868,0.00024632,0.0011093238,0.00003368169,0.000030455634,0.000008121603,0.00009905566,0.000014498064,0.001584887,0.99378556,0.0011223318,0.0001916985],"about_ca_topic_score_codex":0.0000070534516,"about_ca_topic_score_gemma":0.000002742561,"teacher_disagreement_score":0.037896294,"about_ca_system_score_codex":0.00003929794,"about_ca_system_score_gemma":0.000031414347,"threshold_uncertainty_score":0.66249144},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8839199,0.00044426956,0.055567097,0.00090241584,0.0013910928,0.0005507781,0.000009271375,0.00083253905,0.056382652],"genre_scores_gemma":[0.99187845,0.000005504338,0.0067443918,0.00005040918,0.00000767503,0.000022064005,0.000004256053,0.000016443968,0.0012708104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985169,0.00007923639,0.00014635228,0.00038043634,0.0004075363,0.0004695301],"domain_scores_gemma":[0.9989264,0.0000953939,0.000055362598,0.0007252886,0.0001066744,0.0000908781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021473636,0.00014536221,0.00015010436,0.00009971475,0.00016433613,0.0001360692,0.0009109469,0.000039751874,0.000014969095],"category_scores_gemma":[0.0000140671955,0.00012030646,0.000040825864,0.00063855207,0.000094058305,0.0005767005,0.00021816861,0.00015999726,0.00008385707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013958631,0.00015548474,0.00955332,0.000004359496,0.0000071124246,0.00005096593,0.000042037133,0.00004715016,0.00044903895,0.9871889,0.0014891254,0.0009985504],"study_design_scores_gemma":[0.0011055031,0.0001942244,0.0063428986,0.000020189553,0.0000019503154,0.000020652467,0.00001302427,0.0010341923,0.0035730654,0.98043895,0.007044008,0.00021134915],"about_ca_topic_score_codex":0.000051566738,"about_ca_topic_score_gemma":0.000022246708,"teacher_disagreement_score":0.10795856,"about_ca_system_score_codex":0.000050657254,"about_ca_system_score_gemma":0.000049444676,"threshold_uncertainty_score":0.4905955},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99769425,0.00013734626,0.000005304373,0.0001045298,0.00027673322,0.0002781095,0.000008091781,0.00006287675,0.0014327507],"genre_scores_gemma":[0.99904484,0.000010232372,0.0007544076,0.00006666282,0.0000022549973,0.000008901402,0.0000037238524,0.000018190734,0.00009079698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911857,0.000034063298,0.00031456523,0.00018423786,0.0001530723,0.00019547586],"domain_scores_gemma":[0.9990767,0.00030765258,0.00013898121,0.00030792845,0.000055091707,0.000113625254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004966946,0.0001207484,0.00020125169,0.0001659216,0.00011805879,0.000011721005,0.00018043042,0.000110155874,0.000024021949],"category_scores_gemma":[0.00013121466,0.00011315411,0.000049111182,0.00040479982,0.00008896812,0.000076319564,0.00006168562,0.00013610424,0.0000076005986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018614403,0.00007173114,0.0018130703,0.000030232555,0.00003335569,0.0000018600044,0.000925667,1.7078919e-7,0.012336376,0.9840213,0.0003960984,0.00035154074],"study_design_scores_gemma":[0.00044051008,0.000070044625,0.01025454,0.000023090644,0.000029571254,0.000004856543,0.00015303188,7.434573e-7,0.035603624,0.9529988,0.0003036652,0.000117519354],"about_ca_topic_score_codex":0.000008124523,"about_ca_topic_score_gemma":0.0000050022695,"teacher_disagreement_score":0.031022478,"about_ca_system_score_codex":0.000009518044,"about_ca_system_score_gemma":0.000010995099,"threshold_uncertainty_score":0.46142906},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97766095,0.00001833834,0.000006828548,0.0005977861,0.00020651278,0.00033238583,0.000015368489,0.00004565468,0.021116164],"genre_scores_gemma":[0.997395,0.0000057179404,0.0003022357,0.00012865482,0.0000065941126,0.000041546853,0.0000064761853,0.000036757905,0.0020770486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834037,0.00025623364,0.00035755095,0.00019020669,0.000524994,0.00033064088],"domain_scores_gemma":[0.99730384,0.0017713106,0.0001427571,0.00060176797,0.00011574405,0.00006455328],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012179798,0.00015241394,0.00022038928,0.000044344953,0.00009315565,0.000023637627,0.00049427914,0.000081157676,0.0015243543],"category_scores_gemma":[0.0008296345,0.00010847389,0.00007685282,0.0002939421,0.0001157211,0.00007406379,0.00011697966,0.00026798397,0.00055608316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007216654,0.00047123092,0.0008707376,0.000020777676,0.00005048818,0.0000018387701,0.00025735804,1.1780206e-7,0.0014270482,0.923029,0.07337884,0.0004204089],"study_design_scores_gemma":[0.001174813,0.00008673361,0.00011399995,0.000033667027,0.000014335871,0.0000025231343,0.0000791983,0.000130332,0.015353464,0.9804554,0.002435285,0.000120261895],"about_ca_topic_score_codex":0.000010536886,"about_ca_topic_score_gemma":0.0000021761707,"teacher_disagreement_score":0.07094356,"about_ca_system_score_codex":0.00008183911,"about_ca_system_score_gemma":0.000023320941,"threshold_uncertainty_score":0.9993884},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9654918,0.00003632473,0.0147238,0.0020849563,0.00078955386,0.00041865875,0.0000033199706,0.00036628588,0.016085347],"genre_scores_gemma":[0.9896945,0.000006126097,0.009514832,0.00017407643,0.000011067747,0.000035998026,0.0000027790213,0.00001935491,0.00054131704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982579,0.00014001876,0.00016029719,0.00044670943,0.0005697551,0.0004253266],"domain_scores_gemma":[0.9986717,0.00026762704,0.00007330311,0.00069718005,0.00014526241,0.00014493015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044890548,0.00017575725,0.00015868746,0.00014465702,0.00023359022,0.0001110281,0.00063339545,0.00006458338,0.00002899387],"category_scores_gemma":[0.00008161266,0.00015308312,0.000056984023,0.0008180738,0.000090927904,0.00073619554,0.00015199272,0.00034609155,0.0004604273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047761347,0.00018754961,0.00087095355,0.0000038048765,0.000010220216,0.000020453563,0.00022472853,0.000105720625,0.00024652522,0.9856243,0.00032164477,0.012336312],"study_design_scores_gemma":[0.002481941,0.00054568006,0.007001844,0.000042862383,0.000005578735,0.00006475798,0.000018312936,0.006630612,0.009332765,0.97056526,0.0028934334,0.00041697416],"about_ca_topic_score_codex":0.0000062410413,"about_ca_topic_score_gemma":0.0000072588346,"teacher_disagreement_score":0.024202695,"about_ca_system_score_codex":0.000095527954,"about_ca_system_score_gemma":0.000056335004,"threshold_uncertainty_score":0.6242549},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938042,0.000072438146,0.000287969,0.00015457018,0.0025300311,0.00075401703,0.000017180664,0.00004282851,0.0023367386],"genre_scores_gemma":[0.9987205,0.00000577373,0.0010473251,0.000061863066,0.0000067666983,0.00002999592,8.1850425e-7,0.00004018104,0.000086753585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793845,0.00036804084,0.0006143829,0.000208816,0.00062845903,0.00024184358],"domain_scores_gemma":[0.99709177,0.00074893946,0.0006367385,0.0012678241,0.00021028715,0.00004443583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046609165,0.00022303735,0.00040707726,0.00006654947,0.00017301663,0.000014575835,0.0005394556,0.00008958743,0.000028154876],"category_scores_gemma":[0.0017644957,0.00014093607,0.0002752286,0.0006584806,0.00019466423,0.00008017143,0.00009733063,0.00022078489,0.000008016163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010046373,0.00032629853,0.0009109244,0.00012626962,0.00004509093,4.8139157e-7,0.00028435173,0.00004816292,0.01062836,0.98711157,0.0004899772,0.000018494153],"study_design_scores_gemma":[0.00070568733,0.00008939308,0.00035225792,0.00018110132,0.00006865619,0.000004189285,0.000070966,0.000061590385,0.11123672,0.8864263,0.0006748323,0.000128305],"about_ca_topic_score_codex":0.000007808635,"about_ca_topic_score_gemma":0.0000034287402,"teacher_disagreement_score":0.10068524,"about_ca_system_score_codex":0.00005751519,"about_ca_system_score_gemma":0.00007317547,"threshold_uncertainty_score":0.5747206},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9656771,0.000024463294,0.000008727217,0.00038036113,0.0014945301,0.00026627653,0.0000046808404,0.00002936111,0.032114524],"genre_scores_gemma":[0.99905354,0.000007069962,0.00006780034,0.00021676214,0.0000069093917,0.000012336601,4.9473647e-7,0.000018823419,0.0006162413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989228,0.0001648899,0.00024989343,0.0001457275,0.00031634283,0.00020032248],"domain_scores_gemma":[0.99822474,0.0006968056,0.00017836879,0.00079456624,0.0000670194,0.00003852836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068817823,0.00013264183,0.00020237434,0.000020604606,0.0001807481,0.000022520826,0.00039094008,0.00006212426,0.00015267254],"category_scores_gemma":[0.0010974407,0.000071936716,0.00013009911,0.0001962428,0.00014907005,0.00004381397,0.000056621106,0.00020368262,0.00003808743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005584721,0.00015120345,0.0010653471,0.000020034568,0.00002367563,7.143043e-7,0.00024955266,5.4228747e-7,0.00010223579,0.9882782,0.0100419335,0.00006094404],"study_design_scores_gemma":[0.0003661475,0.00004572502,0.0022779983,0.00003398433,0.000020371317,0.0000025208649,0.000118084245,0.0000064210376,0.010720882,0.98416436,0.0021504187,0.00009310005],"about_ca_topic_score_codex":0.000024601186,"about_ca_topic_score_gemma":0.000007471457,"teacher_disagreement_score":0.033376485,"about_ca_system_score_codex":0.000038105132,"about_ca_system_score_gemma":0.000053532687,"threshold_uncertainty_score":0.29334942},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9708701,0.000060710336,0.00008403498,0.0011125325,0.0013115412,0.00015211827,6.1131357e-7,0.00032853833,0.026079856],"genre_scores_gemma":[0.99742806,0.000016370404,0.0010669554,0.0009535635,0.0000013545174,0.000011828937,0.0000023515581,0.000010686123,0.0005088108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986304,0.00012631342,0.00021050432,0.00038422897,0.00037972268,0.00026882955],"domain_scores_gemma":[0.9988852,0.00010154849,0.000050226423,0.000763917,0.000087404456,0.00011169322],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046413852,0.0001467927,0.00013510975,0.00014580082,0.00018426182,0.000118025186,0.00062383135,0.000072304945,0.00017097832],"category_scores_gemma":[0.00003256389,0.00012921204,0.00007571042,0.00071926095,0.000040599065,0.0002095744,0.00005389419,0.00017768546,0.0011520168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004569091,0.00012047368,0.00009917773,0.0000015175392,0.00000900233,0.0000047361686,0.00017460175,0.000045199035,0.00035593662,0.9829749,0.001930959,0.014278954],"study_design_scores_gemma":[0.00063853344,0.00017987688,0.0011331051,0.000018929322,0.000005087285,0.0000046393984,0.000004682454,0.0021880262,0.0017715484,0.9934457,0.00044292488,0.0001669314],"about_ca_topic_score_codex":0.000020625257,"about_ca_topic_score_gemma":5.501045e-7,"teacher_disagreement_score":0.026558021,"about_ca_system_score_codex":0.000019080237,"about_ca_system_score_gemma":0.00004546017,"threshold_uncertainty_score":0.9996257},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9941104,0.0001481497,7.66701e-8,0.00016555595,0.0003615571,0.00008208756,0.0000011322144,0.000033938213,0.005097112],"genre_scores_gemma":[0.9996493,0.000019283425,0.0000071251593,0.0001017024,0.0000025604397,0.000004325086,0.000003461214,4.5545622e-7,0.00021182522],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944264,0.000037251433,0.00013291635,0.0001118764,0.00015501578,0.00012031677],"domain_scores_gemma":[0.99981916,0.000021419844,0.000035175646,0.000037361955,0.00004073683,0.000046146506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012301344,0.00006689328,0.00010886499,0.0000047940143,0.000057212383,0.000007912914,0.00009752976,0.000045838402,0.00023903062],"category_scores_gemma":[0.000022007858,0.00002273867,0.00005528675,0.00014267127,0.000040223513,0.000043948807,0.000005904214,0.000044827215,0.000017009239],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028624781,0.00027531106,0.042770416,0.000010809802,0.0000149164525,0.000002121671,0.00017433951,4.9585424e-7,0.72408605,0.22911836,0.0008600348,0.0026585348],"study_design_scores_gemma":[0.0010928554,0.00046222025,0.13715824,0.00005848408,0.000024012932,0.0000032616128,0.0008462809,0.000009598119,0.7784013,0.059459787,0.0221382,0.00034572757],"about_ca_topic_score_codex":0.000042316267,"about_ca_topic_score_gemma":0.000017035285,"teacher_disagreement_score":0.16965857,"about_ca_system_score_codex":0.00000581984,"about_ca_system_score_gemma":0.0000057923,"threshold_uncertainty_score":0.26172176},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99117106,0.00010540627,0.0025538858,0.00023296264,0.0005915407,0.0002246876,0.0000015819151,0.00011448767,0.0050044036],"genre_scores_gemma":[0.99782836,0.000016122578,0.0019851923,0.00011040044,0.0000022346298,0.0000068922777,0.0000013523141,0.0000141817145,0.000035269306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982121,0.00015145549,0.0003356192,0.00039222385,0.00042733556,0.0004812785],"domain_scores_gemma":[0.9978186,0.0009375284,0.00009769059,0.00087120215,0.0001494156,0.00012556561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012674892,0.00015096662,0.00023567195,0.00057705044,0.00008299399,0.000022249307,0.0009751749,0.000083165265,0.000009947187],"category_scores_gemma":[0.00034727788,0.00013939195,0.00008104739,0.0016665214,0.00017894103,0.00024311761,0.0002394734,0.00030273385,0.00002541113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049754606,0.00021773795,0.003043674,0.000005572698,0.0000076363,0.000057100795,0.00025619863,0.00002001461,0.0055569015,0.9864918,0.00010193279,0.004191704],"study_design_scores_gemma":[0.0007181647,0.00018264388,0.0309246,0.00004412761,0.0000013232534,0.000004828443,0.000055154804,0.00032847686,0.031352445,0.9361686,0.00007978961,0.00013981292],"about_ca_topic_score_codex":0.000016610313,"about_ca_topic_score_gemma":0.000017314549,"teacher_disagreement_score":0.05032314,"about_ca_system_score_codex":0.00004421247,"about_ca_system_score_gemma":0.000041915104,"threshold_uncertainty_score":0.56842387},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9924248,0.00067444437,0.0012324138,0.000009313871,0.0018434967,0.00007456738,0.0000020286902,0.00011264113,0.0036263377],"genre_scores_gemma":[0.99972206,0.000027427976,0.00015371642,0.0000092316,0.00001216748,0.000006109932,0.0000024387973,0.000020342964,0.000046510373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993891,0.000019496558,0.00015047325,0.00007751292,0.00011862158,0.00024481304],"domain_scores_gemma":[0.99962336,0.000058526457,0.000017918645,0.00019216353,0.000034065466,0.00007398935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016268842,0.00010272089,0.00015690761,0.000042271215,0.000030534025,0.000007943062,0.000102657505,0.00005308723,0.00011627785],"category_scores_gemma":[0.00003847114,0.0001013026,0.000043235643,0.00011301687,0.000026111047,0.00016827992,0.000028234846,0.00010067101,0.000042659995],"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.000015374426,0.00034776304,0.2272432,0.00021933412,0.00021920107,0.0000062753843,0.003216528,0.007244129,0.04922959,0.70075643,0.0034130635,0.008089099],"study_design_scores_gemma":[0.0011059288,0.00015923195,0.14665997,0.00017451684,0.00007960851,0.000026370975,0.0006137864,0.033839885,0.7677652,0.04030558,0.00825212,0.0010177928],"about_ca_topic_score_codex":0.000029645309,"about_ca_topic_score_gemma":9.307141e-7,"teacher_disagreement_score":0.7185356,"about_ca_system_score_codex":0.000029887942,"about_ca_system_score_gemma":0.000004988579,"threshold_uncertainty_score":0.4131},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9752413,0.000105309955,0.00042861493,0.00015979684,0.0024670858,0.00012728552,9.1548986e-7,0.00015769791,0.021312011],"genre_scores_gemma":[0.9957,0.000007735077,0.003694416,0.00026874602,3.6610652e-7,0.000008596868,7.138023e-7,0.000011551695,0.00030785587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983376,0.00012831923,0.0002874695,0.00040413172,0.0005310521,0.00031137874],"domain_scores_gemma":[0.998661,0.0001254084,0.00012351705,0.00078333676,0.00018526718,0.00012148905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005419157,0.00016576456,0.0002115144,0.000114261515,0.00012908464,0.000066296656,0.0005895264,0.00011012747,0.000053529508],"category_scores_gemma":[0.00010522169,0.00015144933,0.00010778893,0.00067436986,0.00008281592,0.0002222107,0.000076582524,0.00018094004,0.0001784213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003935077,0.00017455083,0.0056143333,0.0000068600084,0.000014119068,0.0000066238917,0.00013251213,0.000007576827,0.0010359737,0.99157363,0.0011741071,0.00025580433],"study_design_scores_gemma":[0.0006706875,0.00013432934,0.0006363449,0.000032143067,0.00000527768,0.000013528439,0.000010962208,0.00016727012,0.01614042,0.9815469,0.00045881857,0.0001833533],"about_ca_topic_score_codex":0.000027913607,"about_ca_topic_score_gemma":6.931051e-7,"teacher_disagreement_score":0.021004155,"about_ca_system_score_codex":0.000018079225,"about_ca_system_score_gemma":0.0000834624,"threshold_uncertainty_score":0.6175925},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97102916,0.0018972891,0.0021966952,0.0023538577,0.005605828,0.00044125717,0.0000033977506,0.00018676843,0.016285727],"genre_scores_gemma":[0.9962364,0.00023376195,0.0015697998,0.000103339196,0.000011068388,0.000011240375,3.7838493e-7,0.0000071756835,0.001826855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892205,0.00009151911,0.0002563915,0.0001918823,0.0002983718,0.00023978233],"domain_scores_gemma":[0.9989995,0.00017099731,0.00009340308,0.000611483,0.000051025178,0.00007360649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048019568,0.000107885695,0.00012974394,0.00003067395,0.00019488465,0.000089672816,0.0010196625,0.00003641157,0.00013323728],"category_scores_gemma":[0.000015636917,0.00007345145,0.00008366989,0.000258811,0.00005564698,0.00018509058,0.00011880506,0.00011128457,0.00009741808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019923855,0.00018136865,0.000077562225,0.0000064811215,0.000024141813,0.00001366754,0.00031348868,0.000053989,0.00008289975,0.904747,0.0020734442,0.09240604],"study_design_scores_gemma":[0.0018234397,0.00040076498,0.0010900844,0.000059753627,0.000019096076,0.000022977005,0.000055223172,0.023821797,0.0056046783,0.8259912,0.14070264,0.0004083413],"about_ca_topic_score_codex":0.000016602373,"about_ca_topic_score_gemma":5.0766374e-7,"teacher_disagreement_score":0.1386292,"about_ca_system_score_codex":0.000029552135,"about_ca_system_score_gemma":0.00003242857,"threshold_uncertainty_score":0.2995263},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9725435,0.00039332276,0.000048971175,0.00003816709,0.001153047,0.00023980597,0.0000058211067,0.0005880717,0.024989326],"genre_scores_gemma":[0.99862,0.0000663075,0.00008064911,0.00005508682,0.000019505094,0.00004732706,0.000011389593,0.00006805068,0.0010316843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987607,0.000056827463,0.00025183326,0.00025284468,0.00024317336,0.00043461676],"domain_scores_gemma":[0.9992786,0.000031928586,0.000028419163,0.00045494718,0.000037293416,0.00016878429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013932008,0.00027265196,0.00027899034,0.000072251605,0.00012900683,0.000056069224,0.00026803074,0.000116048745,0.0005044709],"category_scores_gemma":[0.0000045619618,0.00024270524,0.000088401874,0.00030372248,0.00006395953,0.0001671644,0.000015102267,0.00022069344,0.00051243784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005221553,0.0009462858,0.011228498,0.0005966055,0.0015493146,0.0007328501,0.0049907737,0.030317029,0.038427807,0.837281,0.01714461,0.0562631],"study_design_scores_gemma":[0.021218304,0.0023769222,0.073118694,0.001207292,0.0006223707,0.0008161573,0.0020099324,0.018170271,0.10193727,0.56372297,0.20773008,0.007069736],"about_ca_topic_score_codex":0.000023275876,"about_ca_topic_score_gemma":0.000007176766,"teacher_disagreement_score":0.273558,"about_ca_system_score_codex":0.000055553675,"about_ca_system_score_gemma":0.000015171569,"threshold_uncertainty_score":0.98972327},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99628097,0.000007129398,0.000049182498,0.0008566335,0.0001694709,0.00026605555,0.0000019979934,0.000035563302,0.0023329833],"genre_scores_gemma":[0.99964905,0.000004920636,0.00017512338,0.00011202631,0.0000051393376,0.000018657853,0.0000015082079,0.000012872058,0.000020709957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992436,0.00013055782,0.00022382943,0.000116081435,0.00016025706,0.00012565259],"domain_scores_gemma":[0.9983294,0.0011311313,0.00019710507,0.00027378005,0.000044708806,0.000023851042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007485838,0.0000955861,0.00015309395,0.000014459758,0.00033450467,0.000031431282,0.00015875576,0.000049025482,0.000010874046],"category_scores_gemma":[0.00015339967,0.00005667213,0.00006938174,0.00023197108,0.00012432247,0.000048223046,0.000050291197,0.00017872197,0.000018825514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014348728,0.000084303254,0.0011317933,0.000010354609,0.0000326506,1.6320925e-7,0.0029160988,0.0000067334536,0.00015070495,0.9954766,0.00008551558,0.000090731686],"study_design_scores_gemma":[0.0010838173,0.000007990755,0.0033429745,0.000047782138,0.00003505993,0.0000032056225,0.00031413604,0.000019971081,0.00078140147,0.99428445,0.000012835741,0.00006638162],"about_ca_topic_score_codex":0.0000453253,"about_ca_topic_score_gemma":0.000004365338,"teacher_disagreement_score":0.0033680587,"about_ca_system_score_codex":0.000015941014,"about_ca_system_score_gemma":0.0000106590305,"threshold_uncertainty_score":0.25727734},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9623285,0.00006215202,0.0006633665,0.0003994801,0.0011825492,0.0001895131,0.000001213058,0.00016955682,0.03500367],"genre_scores_gemma":[0.9968044,0.000010812958,0.0010147677,0.00016678106,0.0000047099807,0.000040028666,0.000001389462,0.000013908108,0.001943171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840444,0.00014005639,0.0002090071,0.0004314682,0.0003667582,0.00044824585],"domain_scores_gemma":[0.99882907,0.0002652716,0.00003439963,0.0007121453,0.000053475705,0.00010561985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049213023,0.00014336001,0.00015132292,0.00029445786,0.00020605211,0.00011564544,0.00078670436,0.000063799416,0.00019140243],"category_scores_gemma":[0.00007333914,0.00014435436,0.000071351984,0.0014067579,0.00009299376,0.0004906625,0.00010395539,0.00035875523,0.00044807594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030545205,0.00021043538,0.0013630178,0.0000028598943,0.0000059135577,0.00004158402,0.00016822366,0.00012865082,0.00012132883,0.96654016,0.00047186392,0.030915396],"study_design_scores_gemma":[0.0008878362,0.00025278688,0.004963851,0.000028412267,0.0000011737764,0.000006041641,0.00001819718,0.0018082969,0.00026032623,0.9873667,0.004219686,0.00018674304],"about_ca_topic_score_codex":0.000016081132,"about_ca_topic_score_gemma":0.000006857819,"teacher_disagreement_score":0.034475934,"about_ca_system_score_codex":0.00008517884,"about_ca_system_score_gemma":0.000041699663,"threshold_uncertainty_score":0.58866},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93746054,0.0003844916,0.00005271953,0.000017744616,0.0025651415,0.00007293247,0.0000011550088,0.00044014366,0.059005138],"genre_scores_gemma":[0.99950725,0.000040040384,0.000015114499,0.000020534048,0.00001254866,0.000014162126,0.0000025058953,0.00002567107,0.00036217103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994535,0.000020559477,0.0001264699,0.00009874741,0.00009462547,0.000206099],"domain_scores_gemma":[0.9996462,0.000023699435,0.000011619307,0.00023396905,0.000014908576,0.00006963369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010418427,0.00010463136,0.000117310236,0.00004852521,0.000046773173,0.000021894297,0.00014216865,0.00006268907,0.000086900516],"category_scores_gemma":[0.0000063962884,0.000108391934,0.00004942649,0.00018493287,0.000018650451,0.00009186917,0.0000131537945,0.0000988659,0.00031480234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064124297,0.000033930864,0.0044082357,0.00002531352,0.000042334406,0.00003460976,0.00020868343,0.0006961565,0.0015890774,0.98549366,0.005314724,0.0021468792],"study_design_scores_gemma":[0.0008716285,0.00004146315,0.005744356,0.0000371197,0.000015421167,0.000049571227,0.00012356808,0.0040728888,0.0028357124,0.9309681,0.0548416,0.00039857705],"about_ca_topic_score_codex":0.0000062931294,"about_ca_topic_score_gemma":0.0000015769983,"teacher_disagreement_score":0.062046718,"about_ca_system_score_codex":0.000024626876,"about_ca_system_score_gemma":0.0000036139481,"threshold_uncertainty_score":0.44200948},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9963741,0.000078204364,0.00006645353,0.00020725626,0.001009071,0.00008750589,6.9299017e-7,0.00017749445,0.0019992606],"genre_scores_gemma":[0.99836737,0.000016289963,0.0012810023,0.00022679489,2.3860667e-7,0.000005515257,9.489801e-7,0.000006879931,0.00009494912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901164,0.000046242745,0.00021554645,0.00025668112,0.00027387126,0.00019600295],"domain_scores_gemma":[0.9990232,0.0001503762,0.00010546941,0.00048982847,0.00014653869,0.0000845608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015863786,0.000106916144,0.0001755432,0.00014831845,0.0001273261,0.000012901451,0.00047354447,0.00005776337,0.000008939027],"category_scores_gemma":[0.0000788805,0.00009865698,0.000068371184,0.0005726738,0.000096393465,0.00010806359,0.00009607127,0.00010962516,0.00004399175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064647193,0.00014158731,0.0011229643,0.0000047727003,0.0000115063385,0.000016992853,0.00022432677,0.000018364417,0.0014652793,0.99306464,0.0038267905,0.00009630271],"study_design_scores_gemma":[0.0008342653,0.00030355263,0.0033409528,0.000024000743,0.0000027488277,0.000015671432,0.0000032394837,0.00064177177,0.015677594,0.97891784,0.00011594126,0.00012243442],"about_ca_topic_score_codex":0.00003205572,"about_ca_topic_score_gemma":4.3417683e-7,"teacher_disagreement_score":0.014212315,"about_ca_system_score_codex":0.000010151975,"about_ca_system_score_gemma":0.000043622276,"threshold_uncertainty_score":0.4023115},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857401,0.00050086767,0.000034235032,0.0014048045,0.0013450437,0.00009745741,0.0000010881832,0.000105998064,0.0107703805],"genre_scores_gemma":[0.9986427,0.000022929331,0.00075381645,0.0004915587,2.0177438e-7,0.000007609721,5.277819e-7,0.0000071680715,0.00007350146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989928,0.00007382992,0.00020823917,0.00024181389,0.0002678995,0.0002154089],"domain_scores_gemma":[0.9987395,0.0003362815,0.00010398385,0.00067964796,0.000079094396,0.00006150537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003417992,0.00011473858,0.00013461214,0.00009111454,0.00016225551,0.000048971076,0.0006972749,0.00005004199,0.00003941924],"category_scores_gemma":[0.00009615692,0.00008043652,0.000076439304,0.000510322,0.00007293997,0.000070511,0.0001395261,0.00015238467,0.00015258908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.909471e-7,0.000079070414,0.0005546764,0.0000032736561,0.000009999331,0.0000032858443,0.0002930076,0.000018291754,0.00012202885,0.9882684,0.009646054,0.001000961],"study_design_scores_gemma":[0.00032514575,0.00012764314,0.000532897,0.000037782756,0.0000039018587,0.0000039538772,0.000010599836,0.004113925,0.001134945,0.9934585,0.00014708148,0.00010362754],"about_ca_topic_score_codex":0.000016745458,"about_ca_topic_score_gemma":9.802742e-7,"teacher_disagreement_score":0.0129025625,"about_ca_system_score_codex":0.0000076267042,"about_ca_system_score_gemma":0.000010882902,"threshold_uncertainty_score":0.32801062},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98295057,0.0031225004,0.000077612,0.0011990526,0.005758078,0.00027716643,0.000006868885,0.00022333725,0.0063848337],"genre_scores_gemma":[0.9964098,0.00085118326,0.0016530222,0.00036968803,0.000003661609,0.000006800536,0.0000059282147,0.000038407397,0.00066153053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99669725,0.00019732879,0.00083154667,0.0008106167,0.0007312489,0.0007320417],"domain_scores_gemma":[0.99709654,0.00021627978,0.00046271758,0.0013237493,0.0005898129,0.0003108756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008004465,0.00042489715,0.0006050675,0.00044042882,0.00021601593,0.00023703878,0.0012773884,0.00023648136,0.000078875244],"category_scores_gemma":[0.0001339398,0.00042474744,0.00029790605,0.0018142003,0.00033810874,0.00043687507,0.00047791825,0.00039083618,0.0003703841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023534074,0.0004454566,0.0137913395,0.00008697091,0.00008622667,0.000068198795,0.0005893612,0.000030330346,0.004011397,0.9742104,0.0036923774,0.002964414],"study_design_scores_gemma":[0.0018292646,0.0004947679,0.00386985,0.00036638434,0.00007795208,0.000054486638,0.000051267147,0.003297401,0.002907257,0.98121965,0.005285393,0.00054631825],"about_ca_topic_score_codex":0.00022565726,"about_ca_topic_score_gemma":0.0000024533422,"teacher_disagreement_score":0.013459227,"about_ca_system_score_codex":0.00003476841,"about_ca_system_score_gemma":0.00015603345,"threshold_uncertainty_score":0.9998204},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9885002,0.00010382834,0.001809852,0.00007219703,0.00069848984,0.0008160684,0.00004550978,0.00020378552,0.00775007],"genre_scores_gemma":[0.9928226,0.0000011586405,0.006761951,0.000008852391,0.000017549877,0.00008132347,0.0000059285417,0.00006547825,0.00023517638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972716,0.00020297138,0.0012424449,0.00031615118,0.0005274182,0.00043943233],"domain_scores_gemma":[0.9974877,0.0007896087,0.00059444364,0.0007436516,0.0002997399,0.0000848057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006626577,0.00030186464,0.0010276735,0.00015839467,0.000049200367,0.000016070646,0.0003182266,0.00018067005,0.000016526506],"category_scores_gemma":[0.0005070195,0.00027104517,0.00013548194,0.0006138722,0.00017776755,0.00011619928,0.00012832643,0.00019060216,0.000008528352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006302626,0.00033332768,0.0004091919,0.0032054952,0.000050083825,0.00002403486,0.0010225286,0.00005976542,0.0012532783,0.9933852,0.00017935816,0.000014739293],"study_design_scores_gemma":[0.0021840543,0.00010355745,0.000086984786,0.0013635363,0.000098569515,0.000020850626,0.0021944442,0.0015676641,0.021369543,0.9706404,0.000057784084,0.0003126162],"about_ca_topic_score_codex":0.00013594452,"about_ca_topic_score_gemma":0.00004161955,"teacher_disagreement_score":0.022744775,"about_ca_system_score_codex":0.0002092255,"about_ca_system_score_gemma":0.0000895819,"threshold_uncertainty_score":0.9999742},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99685997,0.000009227469,0.000018302102,0.000096025455,0.00050069444,0.00024313426,0.000008594009,0.000069801776,0.0021942323],"genre_scores_gemma":[0.99900794,0.000019657093,0.00009012209,0.000022854932,0.000006575225,0.00001647937,0.000022788601,0.00003578597,0.00077779294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987078,0.0001437883,0.00027575478,0.0001941036,0.0004188182,0.00025974258],"domain_scores_gemma":[0.99882877,0.00031498616,0.0001367368,0.0005318501,0.00011768609,0.00006994497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048713433,0.00013051508,0.00023065397,0.00018478038,0.000060267204,0.000018706367,0.000269412,0.00009191738,0.00015338343],"category_scores_gemma":[0.0002931979,0.00012697946,0.00007491049,0.00034344898,0.00007939865,0.00016741107,0.00006001974,0.00016657267,0.00006759028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009348439,0.00029852107,0.00090101024,0.000040927065,0.00002762673,0.000010462586,0.0001415916,3.8184442e-7,0.02856004,0.96937656,0.00026929754,0.00028010787],"study_design_scores_gemma":[0.0007360286,0.00027333776,0.0030904312,0.000048758364,0.000011354771,0.0000029425473,0.00002491112,0.00005884025,0.011306149,0.9841572,0.00017635954,0.00011365506],"about_ca_topic_score_codex":0.0000027845497,"about_ca_topic_score_gemma":3.9015094e-7,"teacher_disagreement_score":0.01725389,"about_ca_system_score_codex":0.000042507265,"about_ca_system_score_gemma":0.000026091893,"threshold_uncertainty_score":0.5178072},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9839164,0.0015323353,0.00013244909,0.000053952655,0.0038284506,0.00024710913,0.000011065462,0.00022777847,0.010050457],"genre_scores_gemma":[0.9990934,0.00002805939,0.00017687875,0.00000785898,0.000009631173,0.000015247736,0.0000022463573,0.000021606245,0.00064504216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995036,0.000012648127,0.00016740896,0.000082175975,0.00008017285,0.00015398422],"domain_scores_gemma":[0.9996537,0.00004468438,0.00002491207,0.00018757982,0.000025180181,0.00006395686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007381201,0.00009368915,0.00015560586,0.000038246922,0.000030317437,0.000012626545,0.0001304669,0.0000585648,0.00010161928],"category_scores_gemma":[0.000017547627,0.00009731683,0.00006220279,0.00011686052,0.000015536105,0.00013007972,0.000010112624,0.000045385197,0.00003330447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001921541,0.00003704923,0.00084388454,0.0002847367,0.00010807643,0.0000028051832,0.0011588943,0.00035321582,0.0045389296,0.9462028,0.043512788,0.0029375674],"study_design_scores_gemma":[0.002684674,0.0003209378,0.0012601165,0.00014410193,0.000076774675,0.00001774718,0.00025860153,0.005906404,0.08160705,0.8349698,0.07218908,0.00056470325],"about_ca_topic_score_codex":0.000006330019,"about_ca_topic_score_gemma":0.0000025540285,"teacher_disagreement_score":0.111233026,"about_ca_system_score_codex":0.000012165921,"about_ca_system_score_gemma":0.00000374993,"threshold_uncertainty_score":0.3968465},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9825653,0.00009923708,0.00007801123,0.00075412216,0.00020082794,0.000103755396,0.0000020419127,0.00009260698,0.016104102],"genre_scores_gemma":[0.99888283,0.000014687115,0.00027186712,0.00028394387,0.00013184983,0.000008238048,0.000029017965,0.000020706095,0.00035687647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992794,0.000005023774,0.00015604582,0.0002176766,0.00015532837,0.00018655353],"domain_scores_gemma":[0.99953485,0.000019685556,0.00009981716,0.00020067823,0.00013379814,0.00001118199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011439648,0.00011626715,0.0001501224,0.00015740757,0.00019589087,0.00031194766,0.0000907191,0.000036855345,0.000036430116],"category_scores_gemma":[0.000025153566,0.00010630631,0.000038036425,0.00048461207,0.00004810439,0.00062414433,0.0000715875,0.00008659075,0.00006766235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057904203,0.00046127787,0.20808288,0.00015075023,0.00014181792,0.00008577835,0.00003513021,0.000174528,0.000578852,0.7331069,0.054612175,0.0025119917],"study_design_scores_gemma":[0.004402428,0.00014669808,0.37346166,0.00015078878,0.0006321985,0.00001576286,0.00051694637,0.0247598,0.00032931042,0.43229717,0.16203864,0.0012485993],"about_ca_topic_score_codex":0.0021227135,"about_ca_topic_score_gemma":0.00015504182,"teacher_disagreement_score":0.30080974,"about_ca_system_score_codex":0.000012920099,"about_ca_system_score_gemma":0.000012154114,"threshold_uncertainty_score":0.43350455},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91277254,0.0004644631,0.019785969,0.0007999136,0.0024925373,0.00041027938,0.0000029164853,0.00089433766,0.06237705],"genre_scores_gemma":[0.9937536,0.000008615217,0.005377114,0.000085766114,0.000011395511,0.00002498234,0.0000031394634,0.000017715367,0.0007176349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833316,0.00008825681,0.00020477033,0.00041838197,0.0004328189,0.00052264536],"domain_scores_gemma":[0.99865913,0.00016038759,0.000056298395,0.00090136146,0.00011411375,0.00010868844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040036655,0.00016927614,0.00017359176,0.00021618382,0.00022045698,0.00013050393,0.0012899823,0.000069139875,0.000021699008],"category_scores_gemma":[0.0000407899,0.00016021436,0.000103658334,0.0010412643,0.00011179404,0.00061779027,0.00031010163,0.00022750683,0.00024390582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004877612,0.00008373239,0.0022218302,0.0000046892806,0.0000070305027,0.000026700833,0.000023829341,0.00002889216,0.0012014746,0.9924042,0.0016422276,0.0023504982],"study_design_scores_gemma":[0.0005113962,0.000100974125,0.0031735932,0.0000071235427,0.0000021166857,0.000017051103,0.0000048055986,0.0014112849,0.0057949554,0.982497,0.006273402,0.00020634751],"about_ca_topic_score_codex":0.00006626659,"about_ca_topic_score_gemma":0.000007430296,"teacher_disagreement_score":0.080981106,"about_ca_system_score_codex":0.000057258236,"about_ca_system_score_gemma":0.00005106062,"threshold_uncertainty_score":0.6533352},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9885701,0.000057620804,0.00090648484,0.0004103296,0.00028965782,0.00029300715,0.0000046758764,0.000036870773,0.0094312485],"genre_scores_gemma":[0.998713,0.0000124859525,0.0009257821,0.000079486905,0.0000017774855,0.000010838533,3.6721988e-7,0.000011530622,0.00024469075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998515,0.00017752961,0.00021776147,0.00023365897,0.00056640344,0.00028966318],"domain_scores_gemma":[0.9982986,0.0002582744,0.00012417702,0.0011453872,0.00012323867,0.000050337796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003827385,0.00012664312,0.00019401345,0.000038762504,0.00018722693,0.000040088722,0.0017777188,0.000032961903,0.000073652955],"category_scores_gemma":[0.000028482618,0.00007079882,0.00010076494,0.0010894855,0.00058294315,0.00022628538,0.00021599984,0.00021428739,0.000014446548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046470075,0.000062702886,0.0057067242,0.000012119638,0.000043203006,0.0000027844983,0.00065785577,0.00012725517,0.00053260225,0.9915472,0.00011390318,0.0011471403],"study_design_scores_gemma":[0.0009060538,0.00011552987,0.009641142,0.000054912187,0.00000852148,0.000025656625,0.000065880355,0.0005660065,0.003981851,0.9824706,0.002024641,0.00013922904],"about_ca_topic_score_codex":0.000056517667,"about_ca_topic_score_gemma":0.000008346659,"teacher_disagreement_score":0.010142935,"about_ca_system_score_codex":0.000024256444,"about_ca_system_score_gemma":0.000076626246,"threshold_uncertainty_score":0.33034736},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9868622,0.00010773445,0.00010826599,0.0077391295,0.0016912828,0.00015328915,5.1362576e-7,0.00007788204,0.0032597454],"genre_scores_gemma":[0.9984901,0.0000025700344,0.00009335597,0.0013261965,4.59987e-7,0.0000045513716,1.2957453e-7,0.0000031490526,0.00007947723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990663,0.00009962347,0.00016232787,0.0001865885,0.00031747014,0.00016767271],"domain_scores_gemma":[0.99864525,0.00019260043,0.000099339,0.00095060177,0.000076391014,0.000035838275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035861076,0.00009524857,0.00010216243,0.0000418615,0.00020797507,0.000048001773,0.0011612494,0.00003783691,0.0000041123258],"category_scores_gemma":[0.00008624194,0.000047523125,0.00009837948,0.0006764712,0.000073829375,0.00007959432,0.00009975526,0.00015116503,0.000015458832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001957671,0.00008006581,0.00021066109,0.0000011900553,0.000004680209,6.3323614e-7,0.00012531108,0.000020869886,0.00040092992,0.9948467,0.0030607937,0.0012462124],"study_design_scores_gemma":[0.00020345036,0.000095401796,0.003937093,0.000024743875,0.00000322794,0.0000014992667,0.000007370537,0.00054530957,0.010252641,0.9846829,0.0001795765,0.000066746674],"about_ca_topic_score_codex":0.000010311523,"about_ca_topic_score_gemma":6.117937e-7,"teacher_disagreement_score":0.0116279535,"about_ca_system_score_codex":0.0000065077584,"about_ca_system_score_gemma":0.000022594213,"threshold_uncertainty_score":0.21579096},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99656206,0.0007510647,0.000028478244,0.000057437614,0.0007344787,0.00032008157,0.000088348774,0.0000793522,0.0013786787],"genre_scores_gemma":[0.999788,0.000012584516,0.00010556327,0.000009640778,0.000007999602,0.000023323966,0.0000076110696,0.000023253919,0.00002204098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898475,0.00009249228,0.0003832608,0.00016571395,0.00016198058,0.0002118135],"domain_scores_gemma":[0.9992738,0.000070610826,0.00010107264,0.0004343434,0.000076568474,0.0000436362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017455677,0.00016376274,0.00030481475,0.00013017369,0.000117483185,0.000014951249,0.00021447844,0.00004455411,0.0000066404023],"category_scores_gemma":[0.0000088125225,0.00013379799,0.00013267332,0.0005252338,0.00024613086,0.00006756714,0.000039978713,0.00011881976,0.0000029543762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001818578,0.00013234194,0.03171194,0.00029928915,0.00013431924,0.000002321714,0.0003325193,0.001122536,0.19809067,0.76698416,0.0011083087,0.000063385516],"study_design_scores_gemma":[0.0014847076,0.00012429296,0.36242002,0.000297719,0.00012222979,0.00004580172,0.0001027358,0.0012170235,0.025337901,0.6056029,0.0028172617,0.00042739967],"about_ca_topic_score_codex":0.00012304317,"about_ca_topic_score_gemma":0.00004698986,"teacher_disagreement_score":0.3307081,"about_ca_system_score_codex":0.0000099468625,"about_ca_system_score_gemma":0.000007923412,"threshold_uncertainty_score":0.54561234},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8550847,0.0002539732,0.024094244,0.0017833718,0.00076174067,0.0006799963,0.000037761416,0.00009153633,0.117212676],"genre_scores_gemma":[0.99668956,0.00001620422,0.001090182,0.000013074911,0.000017300263,0.00004673511,0.0000050290064,0.0000113541755,0.0021105725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939495,0.000016694394,0.0001902069,0.00011401159,0.000105667656,0.00017848544],"domain_scores_gemma":[0.99920183,0.00022207531,0.00009418568,0.00033893588,0.000095913754,0.000047064066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010394844,0.000087197724,0.00012105132,0.000008643165,0.00019159562,0.000021508713,0.00021708652,0.000018237903,0.00017635108],"category_scores_gemma":[0.000018172439,0.00006108295,0.000051627587,0.00023015124,0.00012266466,0.00005891097,0.00005624226,0.000087727036,0.000067393186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042104675,0.00006232602,0.00053658773,0.00000318299,0.000015232614,2.4607425e-7,0.000042652842,0.000013094096,0.00032891723,0.9951714,0.00028685457,0.0035352593],"study_design_scores_gemma":[0.00018743452,0.000016082458,0.000057053796,0.000008111936,0.000009827181,7.167368e-7,0.00022080484,0.00013939175,0.0010347622,0.96592313,0.032329954,0.000072758776],"about_ca_topic_score_codex":0.00001987763,"about_ca_topic_score_gemma":3.8298532e-7,"teacher_disagreement_score":0.14160484,"about_ca_system_score_codex":0.000009719648,"about_ca_system_score_gemma":0.000025483205,"threshold_uncertainty_score":0.24908903},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97507554,0.0005360792,0.018117428,0.0005551374,0.0009925556,0.00042508214,0.0000029689274,0.0002037451,0.0040914332],"genre_scores_gemma":[0.9872989,0.00015104168,0.012208136,0.000055340108,0.000004245657,0.000024521338,7.7653004e-7,0.000019261874,0.00023774985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981084,0.000178887,0.00025600003,0.00037875964,0.00059295347,0.0004850032],"domain_scores_gemma":[0.9969113,0.0006423891,0.00013387293,0.0018422079,0.0003263151,0.0001439216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005135732,0.00018109728,0.00023075889,0.00011111631,0.00047488578,0.000031658114,0.002841255,0.00006686606,0.0000026528517],"category_scores_gemma":[0.0002269824,0.00012100452,0.00009032413,0.0012125702,0.00057131355,0.0002614356,0.0005632446,0.0003492812,0.000016606757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059344,0.00010365988,0.004701307,0.0000070146143,0.00003389498,0.000041722098,0.00019209189,0.000015403488,0.00016697557,0.99174005,0.0004086782,0.0025298698],"study_design_scores_gemma":[0.001211092,0.00046298662,0.009943498,0.00001883799,0.0000053136437,0.00003840971,0.000018335437,0.001551392,0.004868456,0.98039025,0.0012945165,0.00019688765],"about_ca_topic_score_codex":0.00004130963,"about_ca_topic_score_gemma":0.000023608336,"teacher_disagreement_score":0.012223357,"about_ca_system_score_codex":0.000035628313,"about_ca_system_score_gemma":0.00014974695,"threshold_uncertainty_score":0.52798057},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96501094,0.00003000085,0.0012000481,0.000613393,0.00010490867,0.0001381207,0.000007464403,0.000020996038,0.0328741],"genre_scores_gemma":[0.9976222,0.00000887429,0.0007803594,0.00015140373,0.000017858716,0.000038011058,0.000009068787,0.000011313476,0.0013609466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952024,0.000022844355,0.00010330053,0.00013768271,0.000082825216,0.00013309624],"domain_scores_gemma":[0.99940026,0.00024261995,0.000039583414,0.00022725943,0.000040566152,0.000049693546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045241966,0.00009237451,0.00011350856,0.000006305321,0.0002578592,0.000017548819,0.00008955353,0.000017605229,0.00045038175],"category_scores_gemma":[0.000016255055,0.000064189684,0.000036280297,0.00010772391,0.00008724355,0.000035662735,0.00004638497,0.00009464288,0.000052511004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030177189,0.00007680652,0.00031602135,0.0000013777208,0.000013409603,5.654287e-7,0.00010512818,0.0000049103714,0.0000594789,0.9966448,0.00254663,0.00022786242],"study_design_scores_gemma":[0.00035802348,0.000016053536,0.00012774195,0.00000506646,0.0000063032116,0.0000014750583,0.0001293969,0.00009816274,0.00094614533,0.992238,0.0059861015,0.000087555214],"about_ca_topic_score_codex":0.000015273145,"about_ca_topic_score_gemma":2.0477526e-7,"teacher_disagreement_score":0.032611195,"about_ca_system_score_codex":0.000005625269,"about_ca_system_score_gemma":0.000016155444,"threshold_uncertainty_score":0.49313644},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97591054,0.000345223,0.000005361718,0.000011272328,0.002024808,0.000092037786,0.00000797413,0.000111056645,0.021491703],"genre_scores_gemma":[0.99976367,0.00002687528,0.000012715807,0.000007882434,0.0000071368154,0.000009331615,0.000002415147,0.000018196428,0.00015176598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993555,0.000017692104,0.00020505665,0.000104469524,0.00012833418,0.00018892674],"domain_scores_gemma":[0.9996006,0.000039357044,0.000033960536,0.00024227443,0.000023061251,0.000060754555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009880975,0.00011884401,0.00019157722,0.000078083714,0.000029776204,0.000010009641,0.00015961748,0.00007822295,0.00021208856],"category_scores_gemma":[0.000009222617,0.00012548394,0.00007761775,0.0002262618,0.000041720326,0.0000839475,0.000014983767,0.000101021345,0.00021601566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036962247,0.00039563945,0.023111537,0.0006383953,0.00039642068,0.00006932916,0.0031466905,0.0016463678,0.06890703,0.8302679,0.06977546,0.0016082829],"study_design_scores_gemma":[0.015266104,0.001826465,0.027147485,0.00087746425,0.00034895778,0.00015437309,0.0019927726,0.07822603,0.3396392,0.4627353,0.06772855,0.0040573077],"about_ca_topic_score_codex":0.0000058572714,"about_ca_topic_score_gemma":5.6445134e-7,"teacher_disagreement_score":0.36753258,"about_ca_system_score_codex":0.00001762419,"about_ca_system_score_gemma":0.0000026707787,"threshold_uncertainty_score":0.5117087},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9764528,0.0001431694,0.014563438,0.0010999953,0.0009773824,0.00027684658,4.940152e-7,0.00017839088,0.006307472],"genre_scores_gemma":[0.9943496,0.00001532465,0.0054701404,0.000068068555,0.0000018269537,0.000027234193,0.0000010854155,0.000008389552,0.000058335867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998815,0.00007450779,0.00016951065,0.00031335096,0.00031059768,0.00031705466],"domain_scores_gemma":[0.9992292,0.000090460104,0.000041930765,0.00049470435,0.00006554967,0.00007814884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043537674,0.000102381346,0.00012166516,0.00032655528,0.0000699955,0.000059683953,0.00083267206,0.000053318858,0.0000052323717],"category_scores_gemma":[0.00009148391,0.00010481083,0.000045706773,0.0012364545,0.000064960455,0.0006411458,0.00017735221,0.00018980549,0.000073581425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006492501,0.00009756076,0.0009884192,0.000003141755,0.0000027042972,0.000031010615,0.00027320167,0.00008247141,0.00061263086,0.98745507,0.00003081299,0.010416504],"study_design_scores_gemma":[0.0014793929,0.00007855116,0.008941073,0.000014767294,6.1566817e-7,0.0000051604725,0.000019248815,0.00042469602,0.0047471914,0.98407143,0.000100117824,0.00011774885],"about_ca_topic_score_codex":0.000023615512,"about_ca_topic_score_gemma":0.000029445255,"teacher_disagreement_score":0.017896783,"about_ca_system_score_codex":0.0000979113,"about_ca_system_score_gemma":0.00006047951,"threshold_uncertainty_score":0.42740616},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9992449,0.00012890907,0.0000038388803,0.000015115385,0.000121369405,0.00013532002,0.0000094285315,0.00002217889,0.00031888727],"genre_scores_gemma":[0.9995545,0.00008094445,0.0003064485,0.0000064992882,0.0000027466428,0.000017896775,0.0000019330676,0.00000977556,0.000019270472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994379,0.000026363543,0.00024419947,0.000097213015,0.00009942078,0.00009485751],"domain_scores_gemma":[0.99932146,0.0002266826,0.00018553056,0.00018245023,0.000046795725,0.000037074693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014758408,0.00007012117,0.00017981757,0.000066374945,0.00005284098,0.00000271019,0.00010926238,0.000040185405,0.0000094124025],"category_scores_gemma":[0.00007164419,0.000066967346,0.000048676953,0.000111592744,0.00014300813,0.000063824955,0.000043497424,0.00006243031,0.0000019120369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004858646,0.00017448573,0.014969365,0.00006593231,0.0000161539,0.000003895015,0.00071409415,7.3077935e-8,0.006392529,0.9774392,0.0000709918,0.00014840587],"study_design_scores_gemma":[0.00038716456,0.000055701013,0.016543882,0.000043144286,0.000053605392,0.000017195627,0.00023159382,0.000007778268,0.0164729,0.9660879,0.000019275198,0.000079907506],"about_ca_topic_score_codex":0.000005733419,"about_ca_topic_score_gemma":2.639511e-7,"teacher_disagreement_score":0.011351365,"about_ca_system_score_codex":0.0000055929127,"about_ca_system_score_gemma":0.000012694754,"threshold_uncertainty_score":0.2730849},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9845237,0.00003637402,0.0065136445,0.00016408104,0.00078659283,0.00017700417,0.0000028274112,0.00008499868,0.0077107605],"genre_scores_gemma":[0.99901015,0.000016970003,0.00067604514,0.00008557274,0.0000016505599,0.000009667569,0.0000014043502,0.000009626706,0.00018891375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985926,0.00011800928,0.00018718897,0.00029975182,0.00046210154,0.0003403163],"domain_scores_gemma":[0.99892974,0.00020430234,0.00006419829,0.0005491855,0.0001406984,0.00011188513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027802074,0.00012347709,0.00016855526,0.0002203041,0.000085627566,0.000022196842,0.0008448193,0.000049758695,0.000021304886],"category_scores_gemma":[0.00005081509,0.00011952933,0.00009006641,0.0009014132,0.00011968258,0.00037552498,0.00010738398,0.00018442674,0.0000500507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058979465,0.00019876605,0.0018986637,0.000003977957,0.00001564403,0.00003062455,0.0003827963,0.000034293993,0.00056886196,0.9932719,0.00014699606,0.003388499],"study_design_scores_gemma":[0.0009046102,0.00046711182,0.0053442866,0.000021431442,0.0000022707702,0.0000075746384,0.00001948103,0.00053641445,0.007603277,0.98475087,0.0002120728,0.00013061431],"about_ca_topic_score_codex":0.000011165692,"about_ca_topic_score_gemma":0.0000017400024,"teacher_disagreement_score":0.014486432,"about_ca_system_score_codex":0.000026981481,"about_ca_system_score_gemma":0.000032452816,"threshold_uncertainty_score":0.48742646},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.987399,0.0009269109,0.000051037478,0.00002551843,0.006002777,0.00030103064,0.000019228257,0.00018287144,0.005091665],"genre_scores_gemma":[0.9998369,0.000011744707,0.000009260771,0.0000117793315,0.000013966764,0.000027209468,0.0000028419367,0.000033409025,0.000052845076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989706,0.00007689867,0.00032269274,0.00014183005,0.00023336845,0.00025460584],"domain_scores_gemma":[0.9992328,0.000047760997,0.00007219852,0.0005363688,0.00004565519,0.00006521324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002362009,0.00016808315,0.0002665594,0.000064274085,0.0001005451,0.000024270581,0.00041731587,0.00009076092,0.000008318986],"category_scores_gemma":[0.000013937824,0.00013410758,0.0001483687,0.00039255584,0.000078379686,0.00008589294,0.000042982974,0.00016631241,0.00004350475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051553443,0.000043744472,0.0015148849,0.00016497816,0.00008805383,0.0000032440992,0.00041810444,0.019457005,0.006777565,0.9709986,0.0004982091,0.000030440238],"study_design_scores_gemma":[0.0026637618,0.00011421045,0.011293409,0.0005534364,0.00007226679,0.000046703768,0.00056177465,0.0013605629,0.01132474,0.96601033,0.005407206,0.0005916012],"about_ca_topic_score_codex":0.00013468832,"about_ca_topic_score_gemma":0.000009312706,"teacher_disagreement_score":0.018096443,"about_ca_system_score_codex":0.00005063142,"about_ca_system_score_gemma":0.000016267606,"threshold_uncertainty_score":0.5468749},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.628328,0.0006392507,0.14324832,0.036944363,0.0028539149,0.0020229926,0.000008391314,0.008428974,0.17752577],"genre_scores_gemma":[0.95322645,0.000007376703,0.045429163,0.0010947203,0.00001570981,0.000042835898,0.0000016008363,0.000018103361,0.00016405778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983382,0.000094457115,0.00024109057,0.0004854678,0.00046993524,0.0003708434],"domain_scores_gemma":[0.99854666,0.00007058244,0.00012117162,0.001002637,0.00014637788,0.00011256978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005283387,0.00020380951,0.00014350424,0.000118068965,0.00023481483,0.0009424022,0.0023535346,0.00007214585,0.000010846594],"category_scores_gemma":[0.000041351035,0.00014822712,0.00007122848,0.0005733738,0.00014395393,0.0019823574,0.00022738473,0.00023946309,0.0000910011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027501774,0.00020181826,0.000105413776,0.0000049398636,0.000007482845,0.000013748498,0.00017200953,0.000010472589,0.0015730814,0.9450439,0.0018052125,0.051059134],"study_design_scores_gemma":[0.00017889334,0.00025554237,0.0002909867,0.000052206517,0.0000047494736,0.000022073622,0.000010614677,0.0048105842,0.018133836,0.9733248,0.002644001,0.00027171348],"about_ca_topic_score_codex":0.000011885673,"about_ca_topic_score_gemma":0.0000049020437,"teacher_disagreement_score":0.32489842,"about_ca_system_score_codex":0.000051534116,"about_ca_system_score_gemma":0.00010392497,"threshold_uncertainty_score":0.90876067},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9875004,0.00014838969,0.00004461748,0.000040056755,0.00014759848,0.00008523408,0.000001899014,0.000026705322,0.012005087],"genre_scores_gemma":[0.99813944,0.000034366512,0.0003141228,0.00026344493,0.000026988551,0.0000052403193,0.00002348958,0.00001276111,0.0011801623],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992667,0.000035752313,0.000107883345,0.00026763385,0.00008690642,0.0002351277],"domain_scores_gemma":[0.9996521,0.000013688856,0.000029318755,0.00020791506,0.000028302122,0.000068710346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008598177,0.0001251991,0.0001079034,0.0000106031985,0.000083300154,0.000025285353,0.00015714085,0.00009684066,0.000094009745],"category_scores_gemma":[0.000016324457,0.00009505164,0.000045333236,0.0000767322,0.000050562998,0.0000027014923,0.000045148303,0.00007002613,0.00004202266],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009289377,0.00047872082,0.062620796,0.00003368031,0.00020865545,0.0000806847,0.000088799396,0.00034511558,0.87499106,0.016608534,0.006768965,0.036846027],"study_design_scores_gemma":[0.008117373,0.009201767,0.05601771,0.00015162406,0.000103354265,0.0001985107,0.0001938209,0.0006190592,0.55830795,0.03232255,0.3322588,0.0025074778],"about_ca_topic_score_codex":0.0000070226233,"about_ca_topic_score_gemma":0.0000017260702,"teacher_disagreement_score":0.32548985,"about_ca_system_score_codex":0.000008101157,"about_ca_system_score_gemma":0.000024158066,"threshold_uncertainty_score":0.38760933},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9384864,0.0010058312,0.03962905,0.001616399,0.004906935,0.00046465037,0.00000697299,0.0003015053,0.013582286],"genre_scores_gemma":[0.9981104,0.000023768647,0.0015734177,0.00002761971,0.0000072203156,0.0000123977725,0.0000013573072,0.0000076154465,0.00023618525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865806,0.0001110163,0.00021748555,0.00023106331,0.0004982636,0.00028412096],"domain_scores_gemma":[0.9983978,0.0006247562,0.00010051311,0.0006177043,0.00020802698,0.000051146177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004832065,0.00009840834,0.00011902498,0.000082834646,0.0002808665,0.000041777155,0.0010163339,0.000046643403,0.0000061569767],"category_scores_gemma":[0.00010151558,0.00007466533,0.000084247586,0.0007499089,0.00018844564,0.00028546018,0.00019978858,0.00021936034,0.000029661649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011062749,0.0000819643,0.002258196,0.0000025784739,0.000009752767,0.0000032094804,0.000013647999,0.000060140042,0.00054401974,0.9948528,0.0010446529,0.0011180049],"study_design_scores_gemma":[0.0002950767,0.000057546895,0.011847262,0.000004296603,0.0000017767679,0.00000300003,0.0000051350135,0.003515557,0.0043215025,0.9761372,0.0037298293,0.00008180362],"about_ca_topic_score_codex":0.000055956632,"about_ca_topic_score_gemma":0.0000056413505,"teacher_disagreement_score":0.059624046,"about_ca_system_score_codex":0.00003267946,"about_ca_system_score_gemma":0.00006381998,"threshold_uncertainty_score":0.30447638},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98652864,0.0015209299,0.0028754491,0.002884061,0.0003774908,0.00039481279,0.0000062909585,0.00008773717,0.005324576],"genre_scores_gemma":[0.99902034,0.00027742266,0.0005414353,0.00008339937,0.0000011474827,0.0000147559895,8.121431e-7,0.0000042225906,0.000056472138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925554,0.000142846,0.00012318032,0.00017226368,0.00016487608,0.00014129536],"domain_scores_gemma":[0.99907106,0.00044696254,0.000054293414,0.0003068557,0.00006711609,0.0000537146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029975717,0.000071303744,0.0001247208,0.000084960724,0.00017551068,0.000038665443,0.0002778166,0.000027406106,0.000016561631],"category_scores_gemma":[0.00006357306,0.000054148408,0.000028077637,0.00034161503,0.00067152234,0.00024046037,0.00014856775,0.00011186691,0.0000045920897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046718083,0.00002571292,0.0006557553,0.0000075598514,0.000010347378,0.0000013442824,0.00038999692,0.000002078288,0.00016969658,0.99770904,0.00020452184,0.000819287],"study_design_scores_gemma":[0.0012844404,0.000053058946,0.0017771211,0.000011867816,0.0000041815947,0.000010941238,0.00006092104,0.004624972,0.00026602144,0.9916691,0.0001748895,0.000062441984],"about_ca_topic_score_codex":0.000009528161,"about_ca_topic_score_gemma":0.0000016363059,"teacher_disagreement_score":0.01249168,"about_ca_system_score_codex":0.0000057861935,"about_ca_system_score_gemma":0.0000045781594,"threshold_uncertainty_score":0.24742521},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9913056,0.0001484625,0.000058557267,0.00005051249,0.00022588184,0.00013054433,0.0000074315076,0.00006073309,0.008012306],"genre_scores_gemma":[0.99854803,0.000012614285,0.0011400342,0.00002724774,0.000003213899,0.000009304081,0.0000031095788,0.000011811612,0.00024461714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993,0.000022422973,0.0002502133,0.00012194575,0.00013262108,0.0001728054],"domain_scores_gemma":[0.999071,0.00036617185,0.00010763081,0.0003478838,0.000053827018,0.00005346075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005584867,0.0000795507,0.00014225747,0.00006814794,0.00006220586,0.0000046101345,0.00016924893,0.000054612177,0.000037149683],"category_scores_gemma":[0.0000920745,0.00007652499,0.000056715955,0.00033081262,0.000083886785,0.000040927298,0.000025638146,0.000087212335,0.000023716128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017963244,0.0001421814,0.0026981304,0.0000193675,0.0000098744285,0.0000021456203,0.00015431421,7.1020594e-8,0.002036077,0.99237096,0.0020165492,0.0005323591],"study_design_scores_gemma":[0.00029060955,0.000033143,0.005010015,0.00002150944,0.0000125134675,0.000002522666,0.000040097195,0.0000018291267,0.026127718,0.96261734,0.005764127,0.00007857387],"about_ca_topic_score_codex":0.0000057951024,"about_ca_topic_score_gemma":0.0000061142673,"teacher_disagreement_score":0.029753625,"about_ca_system_score_codex":0.000007238681,"about_ca_system_score_gemma":0.000009044539,"threshold_uncertainty_score":0.31205985},"labels":[],"label_agreement":null}]}